Scribd
Upload
20 views1 page

BSC Part 3 It Fundamental Data Structure e 3798 2021

Uploaded by

dishomnibus
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
20 views1 page

BSC Part 3 It Fundamental Data Structure e 3798 2021

Uploaded by

dishomnibus
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/ 1

E-3798

B. Sc. (Part-III) EXAMINATION, 2021 UNIT -4


4. a. Explain Binary search tree with the help of example. Write step by
INFORMATION TECHNOLOGY
step algorithm for binary search tree.
Paper Second
b. Explain heap sort and quick sort with example.
(Fundamental Data Structure)
c. What is bubble sort? Explain with example. Write algorithm for
Time : Three Hours ] [ Maximum Marks : 50
bubble sort.
Note :-Attempt any two questions from each unit. All questions carry UNIT -5
equal marks.
5. a. Define graph. Explain directed, undirected and weighted graphs
UNIT -1
with examples. Also write advantages and disadvantages of all.
1. a. What is Queue? Explain circular queue and priority in detail. Give b. What are the method for traversing a graph? Explain in detail with
examples. the help of suitable examples.
b. Define data structure. Explain Algorithm and its analysis in detail. c. Explain spanning tree and minimum spanning tree with the help of
c. What is stack? What are the operations that can be performed on example. What are the application areas of both.
stack? Also explain stack as an abstract data type.
UNIT -2
2. a. What is linked list? Is it a linear or non-linear data structure? ***
What are the advantages of linked list has over an Array list?
b. Explain doubly linked list and its memory representation. Describe
algorithm for inserting at the end of the doubly linked list.
c. Explain circular linked list. Also explain queue as a circular linked
list with the help of example.
UNIT -3
3. a. What is B Tree data structure? What are the operations performed
on B-Tree.
b. Explain B+ Tree with the help of diagram and example.
c. Write notes on :
i. Linked list representation of binary tree
ii. Threaded binary tree

You might also like