Ics 2105 Data Structures And Algorithms Question Paper
Ics 2105 Data Structures And Algorithms
Course:Bachelor Of Science In Computer Science|Bachelor Of Science In Mathematics And Computer Science
Institution: Jomo Kenyatta University Of Agriculture And Technology question papers
Exam Year:2017
JOMO KENYATTA UNIVERSITY OF AGRICULTURE AND TECHNOLOGY
COMPUTER SCIENCE
DATA STRUCTURES AND ALGORITHMS
TIME: 2 hours
Q1
a) Data structures are two of basic types. Explain the 2 types and site 2 examples of each (6mks)
b) For an algorithm to be qualified as efficient and fast, 2 conditions must hold true. Describe them (4mks)
c) Best case time complexity or the best amount of time and algorithm can possibly take to complete should be measured. How is it achieved? (2mks)
d) Explain the following terminologies associated with a tree structure:
• Root
• Leaf
• Traversing
(3mks)
e) Represent the two operations of a queue data structure with the aid of a well labeled diagram (5mks)
Q2
a) Space complexity property of algorithms is vital in multiuser systems and situations where limited memory is available. What 3 components of space complexity must be addressed? (6mks)
b) What would be your guideline as a programmer when considering several types of data structures (2mks)
c) For any queue operation there must be supporting functions to ensure efficiency.
• State 3 supporting functions indicating the use of each (6mks)
• For each supporting function write an appropriate algorithm (6mks)
Q3
a) Discuss 2 forms of data items and state an example of each (6mks)
b) You have been asked to compare and select among various algorithms for development of JKUATs library inventory system. Which factor will help you achieve this (3mks)
c) Consider 2 scenarios below and advise appropriate data structure that would implement each (2mks)
• Serving requests on a single shared resource, like a printer, CPU task scheduling
• Handling of interrupts in real time systems
d) Describe 3 types of linked lists with the aid of schema diagrams (9mks)
Q4
a) In order for any procedure to be qualified as an algorithm, it must be characterized by some unique features discuss 6 of these features. (12mks)
b) The PUSH process of stack data stricture entails two sequential steps. Discuss (4mks)
c) Boolean abstract data types employs logical operators to combine relations into relations. Explain how this is achieved. (2mks)
d) Illustrate these two categories of algorithms in relation to data structures. (2mks)
e) Illustrate these two categories of algorithms in relation to data structures (2mks)
• Search algorithms
• Sort algorithms
More Question Papers
Exams With Marking Schemes