Get premium membership and access revision papers, questions with answers as well as video lessons.

Data Structures Session Iii 2009 Question Paper

Data Structures Session Iii 2009

Course:Bachelor Of Education Science

Institution: Kabarak University question papers

Exam Year:2009

UNIVERSITY EXAMINATIONS
2009/2010 ACADEMIC YEAR
FOR THE DEGREE OF BACHELOR OF EDUCATION SCIENCE
COURSE CODE: COMP 123
COURSE TITLE: DATA STRUCTURES
STREAM: SESSION III

INSTRUCTIONS:
Attempt Question ONE and Any other TWO.

QUESTION ONE (30 marks)

(a) (i) Describe a stack ? [2 marks]
(ii) Write algorithm to push an element to the stack [4 marks]

(b) (i) Describe the queue using a suitable diagram, [3 marks]
(ii) Write steps used to insert an element to the queue [3 marks]

(c) Explain types of data structures [4 marks]

(d) (i) What is an array? [2 marks]
(ii) Discuss the features of array data structure. [4 marks]

(e) Explain any two types of memory used in data structures [ 4 marks]

(f) Write algorithm to find a node on a binary tree [4 marks]

QUESTION TWO (20 marks)

(a) Write the algorithm used to delete anode from a binary tree [6 marks]

(b) Write algorithm to pop an element from the stack [6 marks]

(c) Explain the steps used to add a node in a list [4 marks]

(d) Write the algorithm used to delete element from the list [4 marks]

QUESTION THREE (20 marks)

(a) Using a suitable diagram explain Deque. [6 marks]
(b) Using a suitable diagram explain linked stack and its advantages. [6 marks]

(c) What is a heap? [2 marks]

(d) Explain about doubly linked list [4 marks]

QUESTION FOUR (20 marks)
(a) Write short on garbage collection and its advantages [6 marks]

(b) Discuss the use of new and delete in memory allocation [4 marks]

(c) State and explain four advantages of the linked list [4 marks]

(d) Write algorithm to insert a node in a binary tree [6 marks] Page 3 of 3

QUESTION FIVE (20 marks)

(a) Explain differences between tree and binary tree [4 marks]

(b) Explain the properties of a binary tree [4 marks]

(c) Explain with the aid of a diagram how you can represent a tree through
linked representation. [4 marks]

(d) (i) What is a string? [2 marks]
(ii) Discuss any 4 major functions which can be performed by a string [4 marks]

(e) Explain about ordered tree [2 marks]

Data Structures Session Iii 2009 Question Paper

More Question Papers

Popular Exams

Mid Term Exams

End Term 1 Exams

End Term 3 Exams

Opener Exams

Full Set Exams