a)Unit 1What is Abstract data type? Explain with the help of example.
a)Unit 1
What is Abstract data type? Explain with the help of example.
b)Unit 1Differentiate array and linked list.
b)Unit 1
Differentiate array and linked list.
Previous Year Question Paper
AD/AG/AL/CD/CY/IO/IS-303 (GS) – Data Structure
June 2024•AIML•SEMESTER-3
June 2024
Max Marks: 70
Duration: 3 Hours
Instructions:
• Attempt any five questions.
• All questions carry equal marks.
a)Unit 3Draw an AVL tree on following inputs, assume that tree is initially empty: 485, 575, 655, 745, 830, 910, 100, 110, 520, 130, 340, 450, 365, 525, 204, 155, 130, 35.
a)Unit 3
Draw an AVL tree on following inputs, assume that tree is initially empty: 485, 575, 655, 745, 830, 910, 100, 110, 520, 130, 340, 450, 365, 525, 204, 155, 130, 35.
b)Unit 4Compare and Contrast the Spanning tree and Minimum Spanning Tree.
b)Unit 4
Compare and Contrast the Spanning tree and Minimum Spanning Tree.
a)Unit 1What do you mean by an algorithm? Write the criteria and characteristics of an algorithm.
a)Unit 1
What do you mean by an algorithm? Write the criteria and characteristics of an algorithm.
b)Unit 1Demonstrate the efficiency of an algorithm.
b)Unit 1
Demonstrate the efficiency of an algorithm.
a)Unit 2Write an algorithm to convert infix expression into postfix form using Stack. Also evaluate the given postfix form using stack.
a)Unit 2
Write an algorithm to convert infix expression into postfix form using Stack. Also evaluate the given postfix form using stack.
b)Unit 2Write a program in 'C' to implementation of QUEUE.
b)Unit 2
Write a program in 'C' to implementation of QUEUE.
a)Unit 3What are the differences between:
i) Height and depth
ii) Order and degree.
a)Unit 3
What are the differences between:
i) Height and depth
ii) Order and degree.
b)Unit 3Show that the maximum number of nodes in a binary tree of height h is 2^(h+1)-1.
b)Unit 3
Show that the maximum number of nodes in a binary tree of height h is 2^(h+1)-1.
a)Unit 1What are sparse matrices? Explain the representation of the Sparse matrix. Also, demonstrate the upper triangle and lower triangular sparse matrices. Suggest a space efficient representation for sparse matrices and determine the address determination formulas for it.
a)Unit 1
What are sparse matrices? Explain the representation of the Sparse matrix. Also, demonstrate the upper triangle and lower triangular sparse matrices. Suggest a space efficient representation for sparse matrices and determine the address determination formulas for it.
b)Unit 1Write a note on Compaction, overflow, and Underflow in Array term.
b)Unit 1
Write a note on Compaction, overflow, and Underflow in Array term.
a)Unit 5What is HashMap in data structure? How does HashMap handle collisions? Explain with C or Java.
a)Unit 5
What is HashMap in data structure? How does HashMap handle collisions? Explain with C or Java.
b)Unit 5Demonstrate LRU Algorithm. Which data structure uses LRU algorithm.
b)Unit 5
Demonstrate LRU Algorithm. Which data structure uses LRU algorithm.
a)Unit 4Draw the directed graph that corresponds to the given adjacency matrix.
a)Unit 4
Draw the directed graph that corresponds to the given adjacency matrix.
b)Unit 1Explore all types of operations that can be performed on a linked list.
b)Unit 1
Explore all types of operations that can be performed on a linked list.