[go: up one dir, main page]
Scribd
Upload
6 views2 pages

Important_DS_Questions_Answers

The document defines various data structures and concepts, including arrays, stacks, queues, linked lists, trees, and graphs, along with their operations and properties. It also covers searching and sorting algorithms, such as linear search, binary search, bubble sort, and quick sort. Additionally, it discusses implementations of stacks and queues using arrays and linked lists, as well as applications of stacks.

Uploaded by

poiissooon393
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
6 views2 pages

Important_DS_Questions_Answers

The document defines various data structures and concepts, including arrays, stacks, queues, linked lists, trees, and graphs, along with their operations and properties. It also covers searching and sorting algorithms, such as linear search, binary search, bubble sort, and quick sort. Additionally, it discusses implementations of stacks and queues using arrays and linked lists, as well as applications of stacks.

Uploaded by

poiissooon393
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

1. Define Data Structure.

Ans: A data structure is a way of organizing and storing data so that it can be accessed and modified efficiently.

2. Define Abstract Data Type (ADT).

Ans: ADT is a logical description of data and operations without considering implementation.

3. What do you mean by Array?

Ans: An array is a collection of elements identified by index or key, stored in contiguous memory locations.

4. What is Stack? List its operations.

Ans: A stack is a LIFO structure. Operations: push, pop, peek, isEmpty.

5. What is a Queue? List its types.

Ans: A queue is a FIFO structure. Types: Simple, Circular, Priority, Double-ended (Deque).

6. Define Circular Queue.

Ans: A circular queue connects the last position to the first to utilize memory efficiently.

7. Define Linked List.

Ans: A linked list is a sequence of nodes where each node points to the next.

8. What is a Doubly Linked List (DLL)?

Ans: DLL is a linked list where each node has pointers to both next and previous nodes.

9. Define Hashing and Hash Function.

Ans: Hashing is converting keys to indexes using a hash function to enable fast data retrieval.

10. Explain Collision Resolution Strategies.

Ans: Techniques like chaining, linear probing, and double hashing resolve hash collisions.

11. What is a Binary Tree?

Ans: A binary tree is a tree with each node having at most two children.

12. Define Binary Search Tree (BST).

Ans: A BST is a binary tree where left < root < right.

13. Define Graph and List its Representations.

Ans: A graph is a set of nodes connected by edges. Represented using adjacency list or matrix.

14. List Graph Traversal Methods.

Ans: Graph traversal methods include DFS (Depth First Search) and BFS (Breadth First Search).

15. Define Heap and Max Heap.

Ans: A heap is a binary tree with heap property. Max heap: parent >= children.

16. What is Searching?

Ans: Searching is the process of finding an element in a data structure.

17. Explain Linear Search.


Ans: Linear search checks each element one by one. Time: O(n).

18. Explain Binary Search.

Ans: Binary search divides the sorted array to search efficiently. Time: O(log n).

19. Define Sorting and List Methods.

Ans: Sorting arranges elements in order. Methods: Bubble, Selection, Insertion, Merge, Quick, Heap.

20. Define Bubble Sort.

Ans: Bubble sort repeatedly swaps adjacent elements if they are in wrong order.

21. Define Insertion Sort.

Ans: Insertion sort builds sorted list one item at a time by inserting elements.

22. Define Selection Sort.

Ans: Selection sort repeatedly selects the minimum and places it at the beginning.

23. Define Merge Sort.

Ans: Merge sort is a divide and conquer algorithm that merges sorted subarrays.

24. Define Quick Sort.

Ans: Quick sort selects a pivot and partitions the array around it recursively.

25. Explain Stack using Array (program brief).

Ans: Use array to implement push/pop. Top variable tracks current element.

26. Explain Queue using Linked List.

Ans: Each node has value and pointer; enqueue adds at rear, dequeue removes from front.

27. Explain Singly Linked List operations.

Ans: Operations: insert, delete, traverse, search, update.

28. Explain Tree Traversals.

Ans: Methods: Inorder, Preorder, Postorder - for visiting all nodes.

29. Define Sparse Matrix.

Ans: A sparse matrix has mostly zero elements. Efficiently stored using arrays or linked lists.

30. Applications of Stack.

Ans: Used in recursion, expression evaluation, syntax parsing, and backtracking.

You might also like