Scribd
Upload
15 views2 pages

Data Structure and Algorithms

This document outlines an examination for a Bachelor-level course in Data Structure and Algorithms at Pokhara University for Spring 2024. It includes various questions on topics such as Abstract Data Types, stacks, queues, linked lists, recursion, binary trees, sorting algorithms, and graph algorithms. Candidates are required to provide answers in their own words and complete all questions within a 3-hour time frame.

Uploaded by

Prabin Chaudhary
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
15 views2 pages

Data Structure and Algorithms

This document outlines an examination for a Bachelor-level course in Data Structure and Algorithms at Pokhara University for Spring 2024. It includes various questions on topics such as Abstract Data Types, stacks, queues, linked lists, recursion, binary trees, sorting algorithms, and graph algorithms. Candidates are required to provide answers in their own words and complete all questions within a 3-hour time frame.

Uploaded by

Prabin Chaudhary
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

POKHARA UNIVERSIT Y

Level: Bachelor Semester: Spring Year : 2024


Programme: BE Full Marks: 100
Course: Data Structure and Algorithms Pass Marks: 45
Time : 3 hrs.
Candidates are required to give their answers in their own words as far
as practicable.
The figures in the margin indicate full marks.
Attempt all the questions.
1. a) Define Abstract Data Type (ADT). Explain how ADTs provide data 7
abstraction with an example.
b) Define a stack ADT. Explain and write algorithms for basic 8
operations of stack.
2. a) Define priority queue. Write C/C++ functions to implement the 8
operations in a circular queue.
b) Explain List ADT. Write down an algorithm to delete the last node in 7
a singly circular linked list. Explain each steps in detail.
3. a) Write an algorithm to delete a node from the specific position of 7
doubly linked list.
b) What is a linked stack? Implement its push and pop operations using 8
singly linked list.
4. a) How do you use recursion to solve a problem? Explain in detail with 7
your own example.
b) Define a binary tree. Write algorithms for insertion and deletion 8
operation in a complete binary tree.
5. a) Explain the significance of a balanced tree over unbalanced tree. 8
Construct an AVL tree from the following data: 10, 20, 30, 15, 5, 12,
25, 50.
b) Why do you think sorting is necessary? Sort the following data using 7
quick sort:
5, 3, 8, 6, 2, 7, 1, 4
6. a) Why spanning tree is important? Find minimum spanning tree of 7
following graph using Prim's algorithm:

Page 1 of 2
b) Find the shortest path from source vertex A to other vertices using 8
Dijkstra’s algorithm for the following graph.

7. Write short notes on: (Any two) 2×5


a) Binary search
b) Big O Nation
c) Hash System

Page 2 of 2

You might also like