Q1[3 Marks]Introduction
What does the Big-Omega notation determine in algorithm analysis? Explain divide and conquer approach of algorithm.
Subject Archive1 Paper Available
Data Structure and Algorithum
Past examination question papers available in the PDF viewer below. Review past questions and syllabus units to prepare for your semester final exams.
Past Question Papers (PDF)
Switch tabs to view different exam papers4th-sem_Data Structure and Algorithum.pdf
IOE Past Examination Paper
Served via fast CDN. Read in full view or download for offline study.
Document information: This past examination paper is identified as an IOE/TU academic document and was cataloged from a public Google Drive archive. This independent website did not create the examination paper and is not affiliated with TU or IOE.
Rights holders can request correction or removal by emailing subeshgaming@gmail.com with this page URL and supporting details.
Most Frequently Asked Questions
Top recurring IOE board exam questions for Data Structure and Algorithum with verified mark schemes, formula notation, and recurrence frequency.
Showing 40 of 40 top repeated questions
8 Chapters · Click any chapter to expand
·
Year-wise & Session-wise Exam Papers
Complete questions from each exam session (Regular & Back exams from 2082 to 2069) for Data Structure and Algorithum. Click any session paper to expand.
Showing 226 questions across 16 exam session papers
Institute of Engineering • 2083 Baishakh Board Examination
Q2[5 Marks]Tree
How do you delete a node with one child in binary search tree? Create a AVL tree for following sequence of elements: 3, 2, 1, 4, 5, 6, 7, 16, 15, 14, 13, 12. Construct a B-tree of order 3 for given data: 52, 46, 27, 81, 90, 108, 72, 110, 35, 115, 121, 86.
Q3[5 Marks]Tree
Construct a B-tree of order 3 for given data: 52, 46, 27, 81, 90, 108, 72, 110, 35, 115, 121, 86.
Q4[2 Marks]Sorting Algorithms
Define internal and external sorting. Sort the data 81, 89, 9, 11, 14, 76, 54, 22, 49 and 37 using Heap sort. Also define the time and space complexity of heap sort.
Q5[1 Marks]Searching Algorithms
Explain sequential search efficiency. Write algorithm for Binary search. Insert keys 89,18,49,58 and 69 with hash table size 10 using quadratic probing.
Q6[1 Marks]Stack and Recursion
Define stack. Convert the following infix expression to postfix using stack. Infix expression: .
Q7[3 Marks]Stack and Recursion
Construct the recursive call tree for the Tower of Hanoi problem with 3 disks, showing each recursive call to move disks from peg A to peg C using peg B.
Q8[4 Marks]Queues
How circular queue overcomes the problem of linear queue in terms of memory efficiency? What do you mean by priority queue and what are their types?
Q9[3 Marks]Linked List
Differentiate between static and dynamic list with suitable example. Write algorithm to add two polynomials using linked list.