Scribd
Upload
8 views1 page

B.Tech Data Structures Model Paper

This document contains a model paper for the Data Structures course with 8 questions covering key topics like time and space complexity, recursive algorithms, infix to postfix conversion, linked lists, polynomials, binary trees, binary search trees, and minimum spanning trees. Students must answer 5 of the 8 questions, with each question worth between 2-14 marks for a total of 70 marks. The questions require explaining concepts with examples, writing programs, drawing trees, and differentiating between data structures and algorithms.

Uploaded by

banavathu vaishnavi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
8 views1 page

B.Tech Data Structures Model Paper

This document contains a model paper for the Data Structures course with 8 questions covering key topics like time and space complexity, recursive algorithms, infix to postfix conversion, linked lists, polynomials, binary trees, binary search trees, and minimum spanning trees. Students must answer 5 of the 8 questions, with each question worth between 2-14 marks for a total of 70 marks. The questions require explaining concepts with examples, writing programs, drawing trees, and differentiating between data structures and algorithms.

Uploaded by

banavathu vaishnavi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

II B.

Tech -I Semester
(CS3T3) Data Structures
Model Paper
(Common to CSE, IT & ECM )
Duration: 3hours Marks: 5X14=70
Answer any FIVE questions. All questions carry equal marks

1. Explain the following with examples


a) Space Complexity - 2M
b) Recursive Algorithms - 3M
c) Time Complexity - 3M
d) Asymptotic Notations - 6M

2. a) Explain the procedure and program to convert infix expression to postfix.-10 M


b) Briefly describe types of Queues. - 4M

3. a) Differentiate Single and Double Linked List. - 4M


b) Explain Circular Linked List with a sample program. - 10 M

4. Explain the following with examples


a) Polynomial Representation - 4M
b) Algorithm to add two polynomials - 4M
c) Sparse Matrix Representation - 6M

5. Define Binary Tree and explain different tree traversal techniques - 14 M

6. a) If there are 31 nodes in a Binary Search Tree what is the maximum and
minimum heights - 4M
b) Define Binary Search Tree.
Start with empty Binary Search Tree
i Insert 15,5,20,14,30,22,2,4,3,7,9,18 draw the tree for each insertion
ii Delete 2,4,5 draw the tree for each deletion - 10 M

7. Explain different algorithms to calculate minimum cost spanning trees - 14 M

8. Write programs and time complexities for


a) Quick Sort
b) Merge Sort - 14 M

You might also like