Printed Pages – 3 (2)
I-259 Unit-II
B.Sc. (Part-III) Examination, 2020
Q. 2. Discuss the concept of linked list of stack with
INFORMATION TECHNOLOGY
Paper - II suitable example.
(Fundamental Data Structure)
OR
Time Allowed : Three Hours
Maximum Marks : 50 Discuss the concept of stack as a circular linked
Minimum Pass Marks : 17
list with suitable example.
Note : Attempt all five questions. One question from Unit-III
each unit is compulsory. All questions carry equal
Q. 3. What is Binary Tree ? Explain with suitable
marks.
example.
Unit-I
OR
Q. 1. What is an Algorithm ? Discuss terminologies
Discuss B+ and B* trees with suitable example.
used in algorithm with suitable concept and
Unit-IV
example.
Q. 4. Explain Binary search with suitable example.
OR
Write a short note on various primitives OR
operations of queue with suitable example. Discuss insertion sort with suitable example.
I-259 P.T.O. I-259
I-259 Unit-II
B.Sc. (Part-III) Examination, 2020
Q. 2. Discuss the concept of linked list of stack with
INFORMATION TECHNOLOGY
Paper - II suitable example.
(Fundamental Data Structure)
OR
Time Allowed : Three Hours
Maximum Marks : 50 Discuss the concept of stack as a circular linked
Minimum Pass Marks : 17
list with suitable example.
Note : Attempt all five questions. One question from Unit-III
each unit is compulsory. All questions carry equal
Q. 3. What is Binary Tree ? Explain with suitable
marks.
example.
Unit-I
OR
Q. 1. What is an Algorithm ? Discuss terminologies
Discuss B+ and B* trees with suitable example.
used in algorithm with suitable concept and
Unit-IV
example.
Q. 4. Explain Binary search with suitable example.
OR
Write a short note on various primitives OR
operations of queue with suitable example. Discuss insertion sort with suitable example.
I-259 P.T.O. I-259
