Get premium membership and access revision papers, questions with answers as well as video lessons.
Bbit 324: Data Structure And Algorithm 3Rd Trimester 2016 Question Paper
Bbit 324: Data Structure And Algorithm 3Rd Trimester 2016
Course:Bachelor Of Business Information Technology
Institution: Kenya Methodist University question papers
Exam Year:2016
DATA STRUCTURES AND ALGORITHMS(BBIT 324 )(CISY 212)3RD TRIMESTER 2016 FT
KENYA METHODIST UNIVERSITY
END OF 3'RD 'TRIMESTER 2016 (FT) EXAMINATION
SCHOOL : SCIENCE AND TECHNOLOGY
DEPARTMENT : COMPUTING AND INFORMATION SCIENCE
UNIT CODE : CISY 212/BBIT 324
UNIT TITLE : DATA STRUCTURES AND ALGORITHMS
TIME : 2 HOURS
INSTRUCTIONS
Answer Question ONE and any other TWO questions
QUESTION ONE (30 Marks)
Briefly describe the following terms as used with data structures and algorithms
Algorithm Efficiency
Abstract Data Type
Minimum spanning tree
Recursion
Data type
[10 marks]
Distinguish between data abstraction, encapsulation and data structure
[6 marks]
Describe a binary search tree, then use the list below, construct a binary search tree
12,5,13,4,9,14,18,16,10,8, 6,15,20,15 [6 marks]
State and briefly describe the two main operations of the Queue ADT
[4 marks]
Write an algorithm that would be used to remove the first element from a linked list.
[4 marks]
QUESTION TWO (15 marks)
Give two similarities and two differences between a stack and a queue
[4 mark]
Using a binary tree exanple to illustrate, describe the for techniques for traversing a tree
[11 marks]
QUESTION THREE (15 marks)
The data below shows values and their frequency of occurence. Use it to answer this question
Value frequency
A 12
B 7
C 10
D 5
E 6
Describe huffman tree
[2 marks]
Construct huffman tree from the data and give the code for each value
[6 marks]
Using an example describe the travelling salesman problem and how the prims algorithm is used to solve it.
[7 marks]
QUESTION FOUR (15 marks)
Describe the Selection Sort algorithm and show that is has polynomial complexity
[9 marks]
In addition to the push() and pop() operations on a stack ADT, describe two other operations that are essential, giving an algorithm for each
[6 marks]
More Question Papers
Popular Exams
Return to Question Papers