Introduction to Algorithm and Programming (CSCT2105)
Computer Science - COS
Semester: Resit
Level: 200
Year: 2016
Page 1 of 2
SCHOOL: H.T.T.T.C DEPARTEMENT: CS LECTURER(S): Dr. DADA Jean-Pierre
COURSE CODE: CSC113 COURSE TITLE: Algorithms and Data structures OPTIONS: FCS100
DATE: HALL: …….. TIME: 1:30 NATURE: RESIT EXAM
INSTRUCTION: Answer all these MCQ questions.
1. A ___________refers to a single unit of
values.
A. data value.
B. attribute value.
C. data item.
D. elementary.
2. Data items that are divided into subitems are
called ___________.
A. single items.
B. group items.
C. elementary items.
D. entity items.
3. Collection of field is called a___________.
A. sample.
B. folder.
C. record.
D. field.
4. In _______________all the records contain
the same data items with the same amount of
space.
A. variable-length records.
B. fixed-length records.
C. subscripted variable.
D. superscripted variable.
5. The logical or mathematical model of a
particular organization of data is called a ____
A. data structure.
B. algorithms.
C. structure.
D. logic structure.
6. ____________ is a sequential representation
of similar data types.
A. Queue.
B. Array.
C. Stack.
D. List.
7. The data structure which reflects relationship
among elements is called a rooted tree graph or
simply a____.
A. graph.
B. list.
C. tree.
D. stack.
8. __________is combining the records in two
different sorted files in to a single sorted file.
A. Sorting.
B. Searching.
C. Listing.
D. Merging.
9. Complexity of linear search algorithm
is___________.
A. O(n).
B. O(log n).
C. O(n2).
D. O(n log n).
10. The complexity of Binary search algorithm is
____________.
A. O(n).
B. O(log n ).
C. O(n2).
D. O(n log n).
B11. The complexity of Bubble sort algorithm is
_________.
A. O(n).
B. O(log n).
C. O(n2).
D. O(n log n).
12. The complexity of merge sort algorithm
is____________.
A. O(n).
B. O(log n).
C. O(n2).
D. O(n log n).
REPUBLIC OF CAMEROON
Peace – Work – Fatherland
***********
THE UNIVERSITY OF BAMENDA
***********
HIGHER TECHNICAL TEACHER TRAINING
COLLEGE (H.T.T.T.C.) BAMBILI
***********
DIRECTORATE OF STUDIES
**********
P.O.BOX 39 BAMBILI
REPUBLIQUE DU CAMEROON
Paix – Travail - Patrie
***********
UNIVERSITE DE BAMENDA
***********
ECOLE NORMALE SUPERIEURE
D’ENSEIGNEMENT TECHNIQUE
***********
DIRECTION DES ETUDES
**********
Tél: 33 05 10 69
www.schoolfaqs.net
Page 2 of 2
13. Sub algorithms fall into two basic categories:
function sub algorithms and ____________ sub
algorithms.
A. procedure.
B. argument.
C. processor.
D. methods.
14. The indirect change of the value of a variable
in one module by another module is called ___.
A. local.
B. global.
C. side effect.
D. variable.
15. Indexing is also called as _______________.
A. matching.
B. elements.
C. pattern matching.
D. numbers.
16. Which of the following data structure is
linear data structure?
A. Tree.
B. Graph.
C. Array.
D. Linked list.
17. The operation of processing each element in
the list is known as_______.
A. sorting.
B. merging.
C. inserting.
D. traversal.
18. The memory address of the first element of
an array is called_________.
A. floor address.
B. foundation address.
C. first address.
D. base address.
19. Which of the following is not the required
condition for binary search algorithm?
A. The list must be sorted.
B. There should be the direct access to the
middle element in any sub list.
C. There must be mechanism to delete and/or
insert elements in list.
D. Direct access to the middle element in any
sub list.
20. Binary search algorithm cannot be applied
to________ concept.
A. sorted linked list.
B. sorted binary trees.
C. sorted linear array.
D. pointer array.
www.schoolfaqs.net
