0% found this document useful (0 votes)
28 views2 pages

BCSIT_2_Data Structure & Algorithm

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
28 views2 pages

BCSIT_2_Data Structure & Algorithm

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

POKHARA COLLEGE OF MANAGEMENT

Affiliated to Pokhara University


GYAN MARG, NADIPUR, POKHARA-3
Level: Bachelor Term End Internal Exam Year : Spring-2024
Program: BCSIT Full Mark: 100
Semester: 2nd Pass Mark: 45
Course: Data Structure & Algorithm (CMP:176) Time: 3hrs
Candidates are required to give their answers in their own words as far as
practicable. The figures in the margin indicate full marks.

Section “A”
Very short answer questions
Attempt all question [10X2=10]
1. What is data structure? Explain Abstract data type (ADT) with an
example
2. What is time complicity?
3. What are the main features of stack?
4. What is a binary tree?
5. What is hashing?
6. What is a priority queue?
7. Differentiate between external sorting and internal sorting?
8. What is a graph?
9. What is Dynamic Programming?
10. What is linked list?
Section “B”
Descriptive answer Questions
Attempt Any Five question [5X10=30]
11. What is recursive algorithm? write a recursion algorithm for tower
of Hanoi problem
12. Convert the infix expression a+b*c+(d*e+f)*g into infix
expression.
13. Write down algorithm Enqueue and Dequeue operation.
14. How to creates single linked list with examples.
15. Load the key 9,50, 700, 76, 85, 92, 73 81and 101 in this order, a
hash table of size 7 using quadratic probing with c[i]=i 2 and the
hash function h(key)%7
16. To construct the binary tree considering the following sequences:
a. Pre-order:10,5,6,20,30,25,23,24,26,40
b. In-order :5,6,10,20,23,24,25,26,30,40

Section “C”
Long answer questions
Attempt any two questions [(7.5+7.5) X 2= 30
17. a. Insert sequentially AVL tree5,6,8, 3,2,4,7.
b. Write the sequence of node of given tree in pre-order, post-
order and in-order.

18. a. Sort the following sequence of array 2,6,11,4,5,7 using concept


of merge sort. Show each step involved while sorting.
b. writes down the algorithm of bubble sort?

19. a. Using Dijkstra’s Algorithm, find the shortest distance from


source vertex ‘S’ to remaining vertices in the following graph
Also, write the order in which the vertices are visited.

b. What is the differentiate between DFS and BFS?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy