NATIONAL OPEN UNIVERSITY OF NIGERIA

UNIVERSITY VILLAGE, PLOT 91, CASDASTRAL ZONE, NNAMDI AZIKIWE EXPRESS WAY, JABI, ABUJA.
FACULTY OF SCIENCES
OCTOBER/NOVEMBER 2014 EXAMINATION

COURSE CODE:                                                         CIT341                                                          

COURSE TITLE:                                                        Data Structures

DURATION:                                                               3 Hours

INSTRUCTIONS:                                                       Answer any Four (4) Questions

1a.       State the for properties of Array List                                                                                 [8 marks]

1b.       Write a Java if_else Statement code snippet to determine the class of a student grade using the student score. Given that:                                 [9.5 marks]

Score between 1 and 39 =F

Score between 40 and 44 =E

Score between 45 and 49 =D

Score between 50 and 59 =C

Score between 60 and 69 =B

Score between 70 and 100 =A

2a.       Define the following:                                                                                                         [3.5 marks]

i.          A class

ii.         An interface

iii.        A package

2b.       Enumerate and explain any four common ways of performing Memory allocation     [12marks]

3a.       Write short note on Algorithm                                                                                         [5.5 marks]

3b.       Copy and complete the Table below by sequentially executing the stack operations[12 marks]

4a.       Enumerate and explain two classifications of Arrays                                                    [5.5 marks]

4b.       Define the following Queue operation(s)                                                                          [12 marks]

i.          Initialise(Q)

ii.         Add(X,Q)

iii.       IsEmpty

iv.        IsFull

v.         Initialise

vi.        Destroy

5a.       Explain Stack with a simple physical representation                                                     [6.5 marks]

5b.       State and explain two classes of Data Structures with example                                    [11marks]

6a.       Write short note on Array                                                                                                [5.5 marks]

6b.       Copy and complete the following table by generating the contents of queue after

operation for the given actions                                                                                          [12 marks]