Past exam questions: Data Structure and Algorithms
Open in the Padhaiko app2079 Ashwin (Back)
- Question 1 (4 marks): Introduction
- Question 2(a) (5 marks): Queues
- Question 2(b) (5 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (4 marks): Queues
- Question 4(a) (3 marks): Linked List
- Question 4(b) (7 marks): Linked List
- Question 5(a) (3 marks): Recursion
- Question 5(b) (3 marks): Recursion
- Question 6 (6 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 7 (6 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 8(a) (2 marks): Sorting Algorithms
- Question 8(b) (6 marks): Sorting Algorithms
- Question 9(a) (3 marks): Searching Algorithms
- Question 9(b) (5 marks): Searching Algorithms
- Question 10 (4 marks): Introduction
- Question 11(a) (4 marks): Graphs
- Question 11(b) (4 marks): Graphs
- Question 12(a) (2 marks): Graphs
- Question 12(b) (4 marks): Graphs
2078 Chaitra (Regular)
- Question 1 (4 marks): Introduction
- Question 2 (8 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (6 marks): Linked List
- Question 4 (10 marks): Linked List
- Question 5 (6 marks): Recursion
- Question 6(a) (6 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 6(b) (6 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 7 (6 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 8 (8 marks): Sorting Algorithms
- Question 9 (8 marks): Searching Algorithms
- Question 10 (4 marks): Introduction
- Question 11 (8 marks): Graphs
2078 Poush (Back)
- Question 1(a) (5 marks): Introduction
- Question 1(b) (5 marks): Definition of stack and its operations · Array implementation of…
- Question 2(a) (5 marks): Queues
- Question 2(b) (5 marks): Linked List
- Question 3(a) (6 marks): Recursion
- Question 3(b) (4 marks): Introduction
- Question 4 (10 marks): Sorting Algorithms
- Question 5 (10 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 6(a) (6 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 6(b) (4 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 7 (10 marks): Searching Algorithms
- Question 8 (10 marks): Graphs
2078 Baishakh (Back)
- Question 1 (4 marks): Introduction
- Question 2 (8 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (8 marks): Queues
- Question 4 (6 marks): Recursion
- Question 5 (4 marks): Introduction
- Question 6 (8 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 7 (8 marks): Searching Algorithms
- Question 8 (8 marks): Sorting Algorithms
- Question 9 (6 marks): Linked List
- Question 10 (10 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 11 (10 marks): Graphs
2077 Chaitra (Regular)
- Question 1 (4 marks): Introduction
- Question 2 (8 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (8 marks): Queues
- Question 4 (6 marks): Recursion
- Question 5 (4 marks): Introduction
- Question 6 (8 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 7 (8 marks): Searching Algorithms
- Question 8 (8 marks): Sorting Algorithms
- Question 9 (6 marks): Linked List
- Question 10(a) (4 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 10(b) (6 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 11 (10 marks): Graphs
2076 Baisakh (Back)
- Question 1 (4 marks): Introduction
- Question 2 (5 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (5 marks): Queues
- Question 4 (6 marks): Linked List
- Question 5 (10 marks): Linked List
- Question 6 (8 marks): Recursion
- Question 7 (4 marks): Introduction
- Question 8(a) (5 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 8(b) (5 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 9 (8 marks): Sorting Algorithms
- Question 10(a) (4 marks): Searching Algorithms
- Question 10(b) (6 marks): Searching Algorithms
- Question 11 (10 marks): Graphs
2075 Baisakh (Back)
- Question 1(a) (2 marks): Introduction
- Question 1(b) (4 marks): Linked List
- Question 2 (10 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (6 marks): Linked List
- Question 4 (10 marks): Linked List
- Question 5 (8 marks): Recursion
- Question 6(a) (5 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 6(b) (5 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 7 (8 marks): Sorting Algorithms
- Question 8 (10 marks): Searching Algorithms
- Question 9 (6 marks): Introduction
- Question 10 (6 marks): Graphs
2074 Bhadra (Regular)
- Question 1 (4 marks): Introduction
- Question 2 (10 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (5 marks): Queues
- Question 4 (6 marks): Linked List
- Question 5 (10 marks): Linked List
- Question 6 (8 marks): Recursion
- Question 7 (12 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 8 (10 marks): Sorting Algorithms
- Question 9 (5 marks): Introduction
- Question 10 (10 marks): Graphs
2073 Bhadra (Regular)
- Question 1 (4 marks): Introduction
- Question 2(a) (5 marks): Queues
- Question 2(b) (5 marks): Definition of stack and its operations · Array implementation of…
- Question 3(a) (2 marks): Linked List
- Question 4 (10 marks): Linked List
- Question 5 (8 marks): Recursion
- Question 6 (6 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 7 (6 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 8 (8 marks): Sorting Algorithms
- Question 9 (8 marks): Searching Algorithms
- Question 10 (4 marks): Introduction
- Question 11 (10 marks): Graphs
2072 Ashwin (Regular)
- Question 1 (4 marks): Introduction
- Question 2 (5 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (5 marks): Queues
- Question 4 (6 marks): Linked List
- Question 5 (5 marks): Linked List
- Question 6 (5 marks): Linked List
- Question 7 (8 marks): Recursion
- Question 8 (6 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 9 (6 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 10 (8 marks): Sorting Algorithms
- Question 11 (8 marks): Searching Algorithms
- Question 12 (4 marks): Introduction
- Question 13 (10 marks): Graphs
2066 Bhadra (Regular / Back)
- Question 1(a) (5 marks): Introduction
- Question 1(b) (1 marks): Definition of stack and its operations · Array implementation of…
- Question 2 (4 marks): Definition of stack and its operations · Array implementation of…
- Question 3(a) (3 marks): Queues
- Question 3(b) (2 marks): Linked List
- Question 4 (6 marks): Linked List
- Question 5 (5 marks): Recursion
- Question 6(a) (1 marks): Introduction
- Question 6(b) (5 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 7 (11 marks): Sorting Algorithms
- Question 8 (8 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 9 (10 marks): Searching Algorithms
- Question 10 (10 marks): Sorting Algorithms
- Question 11 (3 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 12 (5 marks): Graphs
2066 Jestha (Back)
- Question 1 (8 marks): Definition of stack and its operations · Array implementation of…
- Question 2 (8 marks): Queues
- Question 3 (8 marks): Linked List
- Question 4 (8 marks): Recursion
- Question 5 (8 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 6 (8 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 7 (8 marks): Sorting Algorithms
- Question 8(a) (6 marks): Introduction
- Question 8(b) (2 marks): Searching Algorithms
- Question 9 (8 marks): Graphs
- Question 10(a) (4 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 10(b) (4 marks): Graphs
2065 Shrawan (Regular / Back)
- Question 1(a) (2 marks): Introduction
- Question 1(b) (6 marks): Queues
- Question 2 (8 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (8 marks): Linked List
- Question 4 (8 marks): Recursion
- Question 5(a) (4 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 5(b) (4 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 6 (4 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 7 (8 marks): Sorting Algorithms
- Question 8 (8 marks): Searching Algorithms
- Question 9 (8 marks): Graphs
- Question 10 (8 marks): Graphs
2064 Jestha
- Question 1 (8 marks): Definition of stack and its operations · Array implementation of…
- Question 2 (8 marks): Queues
- Question 3 (8 marks): Linked List
- Question 4 (8 marks): Recursion
- Question 5 (8 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 6 (8 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 7 (8 marks): Sorting Algorithms
- Question 8 (8 marks): Searching Algorithms
- Question 9 (8 marks): Graphs
- Question 10(a) (4 marks): Introduction
- Question 10(b) (4 marks): Graphs
2063 Baishakh (Regular / Back)
- Question 1 (8 marks): Queues
- Question 2(a) (4 marks): Linked List
- Question 2(b) (4 marks): Definition of stack and its operations · Array implementation of…
- Question 4 (8 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 5(a) (3 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 5(b) (5 marks): Searching Algorithms
- Question 6 (8 marks): Linked List
- Question 7 (8 marks): Graphs
- Question 8 (8 marks): Sorting Algorithms
- Question 9 (8 marks): Sorting Algorithms
- Question 10 (8 marks): Graphs
2062 Baishakh (Regular / Back)
- Question 1 (8 marks): Linked List
- Question 2(a)(i) (1 marks): Introduction
- Question 2(a)(ii) (3 marks): Queues
- Question 2(b) (4 marks): Definition of stack and its operations · Array implementation of…
- Question 3 (8 marks): Recursion
- Question 4(a) (2 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 4(b) (6 marks): Definition and tree terminologies · Binary trees · Binary search tree
- Question 5 (8 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…
- Question 6 (8 marks): Sorting Algorithms
- Question 7(a) (5 marks): Introduction
- Question 7(b) (3 marks): Sorting Algorithms
- Question 8 (8 marks): Graphs
- Question 9 (8 marks): Searching Algorithms
- Question 10 (8 marks): Balanced binary tree · Introduction to red-black tree · B-Tree: Need…