Data structures
Previous year question paper with solutions for Data structures
Our website provides solved previous year question paper for Data structures . Doing preparation from the previous year question paper helps you to get good marks in exams. From our DS question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.
These Questions are downloaded from www.brpaper.com You can also download previous years question papers of 10th and 12th (PSEB & CBSE), B-Tech, Diploma, BBA, BCA, MBA, MCA, M-Tech, PGDCA, B-Com, BSc-IT, MSC-IT.
Print this page
- Write and explain an algorithm to convert infix to postfix expression. Give example to support your answer.
- Doubly linked list
- Priority queues
- Define B-Tree. Write and explain an algorithm to insert an element in a B-Tree.
- What is meant by traversing? Discuss in-order tree traversing algorithm by taking suitable example.
- What is graph? Explain how a graph can be represented using adjacency matrix.
- Write and explain the working of breadth first search algorithm for a graph.
- Construct the binary tree for the following expression : (2x + 5)(3x – y + 8) Give the sequence obtained when tree is traversed in post order form.
- Explain the link list representation of Graph adjacency matrix. Write the algorithm for the same.
- Explain the Dijkstra’s algorithm for shortest distance for a graph.
- What is the mathematical notation used to define the complexity of an algorithm?
- What is the complexity of linear search?
- How an element is searched in BST?
- What is a degree of a graph?
- What is a post order traversal?