Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
51 views1 page

Tribhuvan University Faculty of Management Office of The Dean 2016 (Make Up)

This document outlines an exam for a data structures and algorithms course, providing details on the exam format, questions, and point values. The exam contains three groups of questions - brief answer questions worth 1 point each, exercise problems worth 4 points each, and comprehensive answer questions worth 5 points each. Students are asked to answer the questions in their own words as much as possible.

Uploaded by

Dhiraj Jha
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
51 views1 page

Tribhuvan University Faculty of Management Office of The Dean 2016 (Make Up)

This document outlines an exam for a data structures and algorithms course, providing details on the exam format, questions, and point values. The exam contains three groups of questions - brief answer questions worth 1 point each, exercise problems worth 4 points each, and comprehensive answer questions worth 5 points each. Students are asked to answer the questions in their own words as much as possible.

Uploaded by

Dhiraj Jha
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/ 1

TRIBHUVAN UNIVERSITY

FACULTY OF MANAGEMENT
Office of the Dean
Full Marks: 40
2016 Time: 2 hrs
(Make up)
BIM/Fourth Semester/IT 218: Data Structure and Algorithm with JAVA

Candidates are required to answer the questions in their own words as far as practicable
Group ‘A’
Brief Answer Questions: [101=10]

1. What do you mean by computational complexities?


2. What is the advantage of doubly linked list over singly linked list?
3. What is priority queue?
4. What is indirect recursion?
5. Define a binary search tree.
6. How B* -tree differs from B-tree?
7. What is minimum spanning tree?
8. In which condition insertion sort performs at best?
9. What do you mean by tree traversal?
10. What hash collision?
Group ‘B'
Exercise problems: [54=20]

11. Write a java method to insert a node at the beginning of circular linked list.
12. Write a method in java for selection sort.
13. Write a java class to implement stack as linked list.
14. Write a java method to search an element in binary search tree
15. Write a Kruskal's algorithm for minimum spanning tree.

Group ‘C'
Comprehensive Answer Questions: [25=10]

16. Define hashing. Explain the bucket addressing method with example.
17. Explain Radix sort algorithm with suitable example.

You might also like