You are on page 1of 2

Index Number _____________________Signature ________________ Date ____________

CHRISTIAN SERVICE UNIVERSITY COLLEGE


KUMASI
FACULTY OF HEALTH AND ALLIED SCIENCES
DEPARTMENT OF COMPUTER SCIENCE AND INFORMATION
TECHNOLOGY

BACHELOR OF SCIENCE IN COMPUTER SCIENCE


End of First Semester Examination, 2020/2021 Academic Year
LEVEL 300

CSCP 365: DATA STRUCTURES I

JANUARY, 2021

INSTRUCTIONS

 ATTEMPT ALL QUESTIONS


 You are required to upload your answered document on the moodle.
ALL THE BEST

Examiner: D. Asamoah
Page 1 of 2
Index Number _____________________Signature ________________ Date ____________

SECTION B
Attempt all questions.

Question One
a. Explain various operations performed on data structures.
b. Differentiate between linear and non-linear data structure.
c. Distinguish between best, worst and average case complexities of an algorithm.
d. Explain the applications of stacks.
e. Write a program in C++ or Java to find second highest value from array elements.

Question Two
a. What are the differences between a stack and a queue?
b. How do you overcome the limitation of a linear queue? Explain in detail.
c. Explain the applications of linked lists.
d. What are the advantages of circular linked list over singly linked list?
e. Write a program in C++ or Java to perform binary search.

D. Asamoah

Page 2 of 2

You might also like