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 2023•AIML•SEMESTER-3
June 2023
Max Marks: 70
Duration: 3 Hours
Instructions:
• Attempt any five questions.
• All questions carry equal marks.
a)Unit 1What is the application of linked list. And also write the algorithm how to add two polynomials using linked list.
a)Unit 1
What is the application of linked list. And also write the algorithm how to add two polynomials using linked list.
b)Unit 1Write a program in C to insert a node at any specified position in doubly linked list.
b)Unit 1
Write a program in C to insert a node at any specified position in doubly linked list.
a)Unit 1What is the difference between data and information? Give one example of each.
a)Unit 1
What is the difference between data and information? Give one example of each.
b)Unit 1How to represent 2-D array in memory? Explain with the help of example.
b)Unit 1
How to represent 2-D array in memory? Explain with the help of example.
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 3Construct the steps to configure a B-tree of order 5 for the given data.
a)Unit 3
Construct the steps to configure a B-tree of order 5 for the given data.
b)Unit 4Explain Dijkstra Algorithm with the help of example.
b)Unit 4
Explain Dijkstra Algorithm with the help of example.
a)Unit 5Write a Heap sort algorithm. Use Heap sort algorithm to sort the following elements: D A T A S T R U C T U R E S.
a)Unit 5
Write a Heap sort algorithm. Use Heap sort algorithm to sort the following elements: D A T A S T R U C T U R E S.
b)Unit 5Differentiate internal sorting and external sorting. Also enlists the name of two sorting techniques of each.
b)Unit 5
Differentiate internal sorting and external sorting. Also enlists the name of two sorting techniques of each.
a)Unit 5Binary search is more efficient than Linear search. Justify your answer.
a)Unit 5
Binary search is more efficient than Linear search. Justify your answer.
b)Unit 5Write short note on Hashing and Indexing.
b)Unit 5
Write short note on Hashing and Indexing.