ALLIANCE COLLEGE

COLLEGE OF UG
FINAL EXAM

DSA Info Exam

Course Title Facility E. Year 2014 Program REG -------
Date
Course Code Department IT A. Year Semester Max.
-------- 2016 1 Weight 40 %
Instructor C. Year Section Time
Name Daniel E. 3 A Allowed 2:00

Name _____________________________ ID. No ______________________

Section ___________________________ Department _________________

INSTRUCTION
 Make sure the exam paper contains 4 pages including the cover page.
 Make sure the exam paper contains the appropriate number of question in appropriate
parts.
 Answer the question according to the instructions given for each part.
 Write your answer neatly on the space provided.
 Mobile phone should be switched off.
 Cheating in any form will result punishment without prior notice.

PART I: True or False [ Pts.]

1. Algorithm is a well-known technique to search any particular element among several elements.
2. Sorting refers to the process of generating a fixed-size output from an input of variable size using the
mathematical formulas known as hash functions.
3. Advanced Sorting is a function that converts a given numeric or alphanumeric key to a small
practical integer value.
4. Hashing function is a highly efficient sorting algorithm and is based on insertion sort algorithm.
5. Shell sorting is one of the sorting algorithms used to arrange a list of elements in order and it use tree
concepts.
6. Shell sort algorithm is an extension of insertion sort, it uses insertion sorting as well.
7. Data Structure is a way to store and organize the data in memory so that it can be used efficiently.
8. Efficiency of a program depends upon the choice of data structures
9. Head and Tail linked list is accessed through the head node, which points to the first node in the list.
10. Next Pointer is stores the memory address (reference) of the next node in the sequence.

PART II: Choose the best answer from the given alternative [ pts.]
ALLIANCE COLLEGE Page 1
 ALLIANCE COLLEGE
COLLEGE OF UG
FINAL EXAM

1.

1. Efficiency of a program depends upon the choice of data structures.

A. Efficiency D. Linked list

B. Reusability E. E All
C. Abstraction

2. Which is a tree data structure in which each node has at most three child nodes, usually distinguished
as “left”, “mid” and “right”.
A. Ternary Tree
B. binary Tree
C. Generic Tree
3. ___is known as a null graph if there are no edges in the graph.

A. Graph C. Null
B. Trivial D. All

4. Which graph containing at least one cycle is known as a cyclic graph?

A. cyclic graph C. Complete Graph

B. Cycle Graph D. All of the above

5. ____ Sort is one of the sorting algorithms used to arrange a list of elements in order and it use tree
concepts.

A. Heap D. hash
B. shell E. None.
C. merge

6. ____ is a faster and highly efficient sorting algorithm.

A. Quicksort D. Divide
B. Algorithm E. All of the above
C. Heap sort

7. Merge sort is one of the most efficient sorting algorithms.

A. True

ALLIANCE COLLEGE Page 2

 ALLIANCE COLLEGE
COLLEGE OF UG
FINAL EXAM

B. False

8. _______is a collision resolution technique used in hash tables.

A. Double hashing C. Closed Hashing

B. hash function D. Open Addressing

9. Which is an open addressing scheme in computer programming for resolving hash collisions in hash
tables?
A. Quadratic probing
B. Disconnected Graph
C. Closed Hashing
10. ____ is an array of some fixed size, usually a prime number.

A. hash table C. Hashing

B. Hash Function D. Heap Sort

PART III: Give short answer for the followings (10pts.)

1. Write the mainly three types of linked lists and define it 3points?
2. Write the Types of Tree Data Structure and define and describe each one 3points?

ALLIANCE COLLEGE Page 3

 ALLIANCE COLLEGE
COLLEGE OF UG
FINAL EXAM

Answer Sheet

DSA Info Exam

Course Title Facility E. Year 2014 Program REG -------
Date
Course Code Department IT A. Year Semester Max.
-------- 2016 1 Weight 40 %
Instructor C. Year Section Time
Name Daniel E. 3 A Allowed 2:00

Name _____________________________ ID. No ______________________

Section ___________________________ Department _________________

PART - I
1. ________________ 6. ________________
2. ________________ 7. ________________
3. ________________ 8. ________________
4. ________________ 9. ________________
5. ________________ 10. ________________

PART - II
1. ________________ 6. ________________
2. ________________ 7. ________________
3. ________________ 8. ________________
4. ________________ 9. ________________
5. ________________ 10. ________________

PART III: Give short answer

1.

2.

ALLIANCE COLLEGE Page 4

 ALLIANCE COLLEGE
COLLEGE OF UG
FINAL EXAM

GOOD LUCK

ALLIANCE COLLEGE Page 5