Scribd
Upload
20 views2 pages

Important DS Questions 2024-25

The document outlines important questions related to data structures and algorithms, covering topics such as time-space trade-offs, array representations, linked lists, stacks, queues, searching, sorting, trees, and graphs. It includes specific tasks like implementation, algorithms, and operations for each data structure. Additionally, it addresses concepts like recursion, priority queues, and various tree types, along with their respective algorithms and problems.

Uploaded by

akashmaurya5078
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
20 views2 pages

Important DS Questions 2024-25

The document outlines important questions related to data structures and algorithms, covering topics such as time-space trade-offs, array representations, linked lists, stacks, queues, searching, sorting, trees, and graphs. It includes specific tasks like implementation, algorithms, and operations for each data structure. Additionally, it addresses concepts like recursion, priority queues, and various tree types, along with their respective algorithms and problems.

Uploaded by

akashmaurya5078
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/ 2

Important Questions

1. Introduction:
• What do you understand by time space trade off? Explain best, worst and
average case analysis in this respect with an example.
2. Array:
• Address calculation(2D,3D): Row major, Column major.
• Sparse Matrix (array and linked list representation) and perform addition
operation.

3. Linked List
• Creation, insertion and deletion (Singly linked list, doubly linked list,
circular linked list).
• Representation of polynomial and perform addition operation using
singly linked list. ( Algorithms, Code)

4. Stack
• Implementation of stack (Array, Linked list)
• Conversion of Infix to Postfix ( Algorithm and Problem using
stack)
• Conversion of Infix to Prefix ( Algorithm and Problem using stack)
• Evaluation of Postfix Expression using stack( Algo and Problem)
• Tower of Hanoi( Algo + Code)
• Reverse a string using Stack( Algo + Code)
• Recursion: factorial, Fibonacci series
• Definition head and tail recursion . and removal of tail recursion.
5. Queue
• Implementation of linear queue, circular queue ( Array , Linked List)
• A double ended Queue (deque) is a linear list in which additions may be made
at either end. Obtain a data representation mapping a deque into one
dimensional array. Write C function to add and delete elements from either
end of deque.
• Priority Queue.
6. Searching
• Binary Search(Algorithm and Code).
• Index Sequential Search.
• Hashing definition. characteristic of Hash function. Different collision
resolution technique.
7. Sorting
• Quick-Sort Algorithm and how to apply some given values.
• Merge-Sort Algorithm and how to apply some given values.
• Heap-Sort Algorithm and how to apply some given values.
• Insertion-Sort , Selection Sort( Algorithms and find Time complexity )
8. Tree
• Memory Representation of Binary Tree.
• Definition: Strictly Binary tree, Complete Binary Tree, Extended Binary Tree.
• Types of threaded binary tree and advantage of TBT over binary tree.
• Draw Binary Tree .(Given Any two order(Pre, Post,In).
• Algorithm and Function for creation and traversal of BST.
• Definition AVL tree. Apply Creation(insertion) and deletion to given values.
• Definition B-Tree. Apply Creation(insertion) and deletion to given values.
• Huffman Tree. Draw Huffman tree and Huffman code for a given data.
9. Graph
• Graph memory representation
• BFS, DPS (Algorithm and Problem)
• Transitive Closure
• Minimum cost Spanning tree- Prims and Kruskal( Algorithm and Problem)
• Shortest Path : Dijikstra, Warshal( Algorithms and Problem)

You might also like