B.Sc. (II YEAR) SEMESTER-IV DATASTRUCTURES MODEL QUESTION PAPER ADIKAVI NANNAYA UNIVERSITY
https://www.computersprofessor.com/2017/04/bsc-ii-year-semester-iv-datastructures.html?m=0
ADIKAVI NANNAYA UNIVERSITY
AT THE END OF FOURTH SEMESTER (CBCS PATTERN)
DEGREE EXAMINATIONS
B.SC-DATASTRUCTURES
(From The Admitted Batch of 2016-17)
Time:3 Hours Maximum:75Marks
PART-A
Answer any five questions.
1. Distinguish primitive and Non-primitive Data Structure.
Give an example for each.
2. Write the advantages and disadvantages of array and linked
list.
3. Write a note on stacks and its applications.
4. Explain the below i) Dequeues ii) Circular queues
5. Write a neat diagram explain the linked storage
representation of a Binary tree.
6. Write a note on threaded binary trees.
7. How to represent the Graph in memory? Explain in detail.
8. Write an algorithm
for quick sort.
PART-B
Answer all questions
9. a) What are the
goals of data structure. Write note on linear and Non Linear data structure
with examples.
(OR)
b) What is the
importance of sparse matrix? Write an algorithm to Transpose a given matrix in
sparse form.
10. a) What is a stack? Explain the algorithm to create and
delete items In stack.
(OR)
b) What is a queue?
Explain the algorithms to create and delete Items in a circular queue.
11. a) Write an algorithm to delete operation in any binary
search tree.
(OR)
b) Explain the below:
i) Binary search tree
ii) Heaps.
12. a) What is Minimal
Spinning tree? Write about breadthfrist search Technique.
(OR)
b) What is a graph? How a graph can be represented in memory?
Write an algorithm to delete an edge from a graph?
13. a) What are the
different types of search techniques? Explain the One which is more efficient
among them.
(OR)
b) Explain the below:
i) Selection Sort
ii) Bubble Sort
iii) Merge Sort
iv) Insertion Sort
v) Heap Sort.