Scribd
Upload
3 views5 pages

Ds QQ

The document outlines various topics related to data structures, including linked lists, stacks, queues, trees, graphs, searching, and sorting. It provides definitions, examples, and applications for each data structure, along with operations and algorithms associated with them. Additionally, it covers complexities and classifications of data structures, with specific questions and tasks for each unit.

Uploaded by

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

Ds QQ

The document outlines various topics related to data structures, including linked lists, stacks, queues, trees, graphs, searching, and sorting. It provides definitions, examples, and applications for each data structure, along with operations and algorithms associated with them. Additionally, it covers complexities and classifications of data structures, with specific questions and tasks for each unit.

Uploaded by

sankaransvg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Unit 2

2 marks
Give an example for Linked List.
Write the name of any two Applications of Linked Lists
Define the use of doubly linked list
Define circular linked list

5 marks
1 Differentiate circular linked list from singly linked list.
2. Applications of Linked Lists
10 mark
1. Define Doubly linked list Explain insection and deletion operations on
doubly linked list.
2. Write a note on operations of array based linked list with an
example. Or operations on linked list
Unit 3
2 marks
Define Stack.
What is queue
What is called Circular queue?
Write down any two applications of stack.
Write the names of different Types of Queues
What is the limitation of linear queue?

5 marks
1. Give an example for Stack and Write algorithm for push and POP
operations on stack.
2. Define queue. Brief how it is differ from stack.
3. Priority queue – explain
4. Explain the applications of queue
5 Linked Representation of Queues
10 mark
1. Explain enqueue and dequeue operations on linear queue and
circular queue.
2. Applications of stack – infix to postfix conversion(10)

Unit 4
2 marks
What is meant by Tree?
What are the different methods Tree traversals?
Define Graph.
Find the postfix form of infix form A+B/C–D.
Define the following:
(a) Siblings
(b) Degree of a tree.
(c) Height of a tree
(d) Degree of a node
What is adjacency matrix of a graph?
Define full binary tree and complete binary tree.
Define skewed binary trees.
5 marks
1 Discuss how does binary tree represented.
2 Describe in brief about Expression Trees with example.
3 Creating a Binary Tree from a General Tree
4 Explain Threaded binary trees
5 Explain representations of Graphs
6. Note on AVL trees
7 Write short note on Binary Heaps
8. Write short note on Huffman’s tree / code

10 mark
1. Operations on Binary Search Trees (10)
2. Explain Tree Traversals (10).
3. Graph Traversal Algorithms (BFS & DFS) (10)

Unit 5
2 marks
Define Searching
Define sorting
Write the definition of below sorts
- Bubble Sort
- Insertion Sort
- Selection Sort
- Heap Sort
- Shell Sort
5 marks
1. Bubble Sort
2 Insertion Sort
3 Selection Sort
4 Heap Sort
5 Shell Sort
6 External Sorting
9. What is called sorting? Explain its types.
10 mark
1. Explain the below with diagram
i Linear Search
ii Binary Search
2. Explain the below sorting
i) Merge Sort
ii) Quick Sort

Unit 1
2 marks
What is meant by Array?
What is meant by Sparse Matrices
What is meant by linear data structure with example
What is meant by non-linear data structure with example

5 marks
1Write short note on Time and Space Complexity
2 Write short note on Asymptotic Notation.
3 Sparse Matrices
4 Operations on Data Structures
10 mark
1. Classification of Data Structures (10)
2 Explain the insertion and deletion operation in Array

You might also like