1 Identify which one of the following which is not a valid
operation in Java programming
*Multiplication
*Additon
*Exposition
*Subtraction
*Multiplication
*Additon
*Exposition
*Subtraction
2 A first class abstract data type supports the establishment
of multiple __
*Stucks
*Instances
*Messages
*Forces
*Stucks
*Instances
*Messages
*Forces
3 Generally, in linear data structures, the storage and access is
done linealy in the computer __
*Windows
*Menus
*Memory
*Icons
*Windows
*Menus
*Memory
*Icons
4 The choice of data structure is a key design consideration in
designing __
*Sites
*Keys
*Programmes
*Sets
*Sites
*Keys
*Programmes
*Sets
5 In Object-oriented languages, abstract data types are
expressed by means of __
*Classes
*Moles
*Sets
*Lists
*Classes
*Moles
*Sets
*Lists
6 In a queue data structure, additions are made at the end and
removals at the head, hence it is said to be a _ structure
*FIFO
*LIFO
*INFO
*NIFO
*FIFO
*LIFO
*INFO
*NIFO
7 The PUSH and POP are 2 basic operations of implementing
a _
*Queue
*Stack
*Block
*String
*Queue
*Stack
*Block
*String
8 Which of the following is not a valid category of data type?
*Numeric
*Character
*Item
*Boolean
*Numeric
*Character
*Item
*Boolean
9 A static data structure can also be referred to as an _
*Intersparsed array
*Abstract data
*Array
*Activex data
*Intersparsed array
*Abstract data
*Array
*Activex data
10 he operation in which a node is added to the top of a stack
leaving previous nodes below is referred to as _
*PUSH
*MOVE
*LET
*SET
*PUSH
*MOVE
*LET
*SET
11 Identify any of the following which is an exhaustive search
method?
*Stacking
*Backtracking
*Sidetracking
*Updating
*Stacking
*Backtracking
*Sidetracking
*Updating
12 Ordinarily, the _ operation is required to create a list
*Index
*Add
*Set
*Initialise
*Index
*Add
*Set
*Initialise
13 In the preorder traversal technique, the root is visited _
*Last
*Most
*First
*Least
*Last
*Most
*First
*Least
14 The position of a key in the array is designated by a _
function
*List
*Hash
*Stack
*Block
*List
*Hash
*Stack
*Block
15 Two common exhaustive search methods are bruteforce
and __
*Stacking
*Pushing
*Bactracking
*Moving
*Stacking
*Pushing
*Bactracking
*Moving
16 Ordinarily, a _ provides the blueprint for objects
*Hash
*Class
*Reference
*Bin
*Hash
*Class
*Reference
*Bin
17 The primitive operation of a _ which updates the contents
of a node is called a set
*Form
*Tree
*Class
*List
*Form
*Tree
*Class
*List
18 The operation in which a node is added to the top of a
stack leaving previous nodes below is referred to as a _
*POP
*PUSH
*BLOG
*PUT
*POP
*PUSH
*BLOG
*PUT
19 The general format for declaring a _is to write: type name;
*List
*Variable
*Key
*Log
*List
*Variable
*Key
*Log
20 The position of a key in the array is designated by a _
function
*Binary
*Hash
*Reference
*Static
*Binary
*Hash
*Reference
*Static
Comments
Post a Comment
DROP YOUR COMMENTS HERE.....