Scribd
Upload
50 views

Data Structure QB

Uploaded by

pratikgandule
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
50 views

Data Structure QB

Uploaded by

pratikgandule
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

MGM University

Course Code: ITY23PCL202


Name of the Course: DataStructure Question Bank
Unit-01

1.What is Data structure? Explain the Types of data structure, in detail?


2. Explain Asymptotic notations in detail?
3.Explain Time and Space complexity with examples in detail?
4. What are asymptotic notations? Describe the significance of Big O notation with an example.
5. Distinguish between Time complexity and Space complexity?
6. Distinguish between Algorithm and Pseudocode?
7.Write a c program to find a factorial of a number using recursion?
8.What is Data Structure? State the Characteristics of Data Structure?

Unit 2
1. Explain a postfix expression using a stack. Explain with the following example 5 6 2 + * 12 4 / -
2. What are the limitations of a linear queue? How is it solved? Explain circular queue in detail.
3. Explain how a stack can be used to convert an infix expression to a postfix expression with the
following example A+(B*C-(D/E^F)*G)*H.
4. What is a stack? Explain the Various Operations in Stack?.
5. Explain what is a priority queue with its characteristics, operations with examples in detail?
6. Evaluate the Postfix Expression: 6 2 3 * / 3 4 * + 3 2 * -
7. What is a stack? Explain the Various Operations in Stack?.
8. Define Queue. Explain Different Types of Queue?
9. State the Difference between stack and Queue?
10. State the application of Queue?

Unit 3
1. Explain the difference between static and dynamic memory allocation?
2. What is a singly linked list? Write a C program to create and display a singly linked list?
3. What is a Linked List ? Explain all the types of linked lists in detail?
4. Explain static memory allocation with its properties,advantages and disadvantages?
5. Describe the structure of a singly & doubly linked list. How do they differ from each other?
6. State the Application Of Stack? Evaluate the Prefix Expression: -/*2*5+3652
7. What is dynamic memory allocation? Which library functions are used to allocate memory
dynamically with its syntax?
8. List and explain the different types of linked lists?
9. State the Difference Between Priority and Double Ended Queue?
Unit 4
1. What is a binary tree? What are the types of binary trees? Explain Binary Search Tree with the
following Example:
20,23,13,9,14,19,21,27,24.
2. Define a Graph.? State and Explain Types of Graphs?
3. Explain the concept of an AVL tree in detail with an Example?
4. State adjacency matrix for the given undirected weighted graph?

5. Define a binary search tree (BST). How is the searching operation performed on a BST
explained in detail with example 25,10,12,15,39 ?.
6. Explain Kruskal’s algorithm with the Following Example?

7. Define a binary search tree (BST). How does the searching operation performed on a BST explain
in detail with example 4,2,3,6,5,7,1 ?
8. Explain how Prim's algorithm works for finding the minimum spanning tree with the Below
Example

9. Solve the following Example with Prims and Kruskal Algorithm?


10. Solve the following Example with Prims and Kruskal Algorithm?

.
11.Solve the following Example with Prims and Kruskal Algorithm?

12.Solve the following Example with Prims and Kruskal Algorithm?


13.Solve the following Example with Prims and Kruskal Algorithm?

You might also like