1 A data type is said to be abstract when it is independent of
concrete __
*Termination
*Fumigation
*Classification
*Implementation
*Termination
*Fumigation
*Classification
*Implementation
2 In building large systems, the choice of data structure
determines the quality of the ___
*Substrate
*Argument
*Product
*Expression
*Substrate
*Argument
*Product
*Expression
3 Which one of the following is a typical non-linear data
structure?
*List
*Tree
*Stack
*Queue
*List
*Tree
*Stack
*Queue
4 The data structure consisting of a group of elements
accessed by indexing is known as the __
*Argument
*SIMM
*Array
*Set
*Argument
*SIMM
*Array
*Set
5 Proper structuring of data makes software programme
routines __
*Older
*Newer
*Tougher
*Simpler
*Older
*Newer
*Tougher
*Simpler
6 Ordinarily, the _ operation is required to create a list
*Index
*Add
*Set
*Initialise
*Index
*Add
*Set
*Initialise
7 In the preorder traversal technique, the root is visited _
*Last
*Most
*First
*Least
*Last
*Most
*First
*Least
8 The position of a key in the array is designated by a _
function
*List
*Hash
*Stack
*Block
*List
*Hash
*Stack
*Block
9 Normally, a leaf has a node of degree__
*One
*Three
*Two
*Zero
*One
*Three
*Two
*Zero
10 Two common exhaustive search methods are bruteforce
and __
*Stacking
*Pushing
*Bactracking
*Moving
*Stacking
*Pushing
*Bactracking
*Moving
11 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
12 All the following can be classified as primitive operations
except _
*ADD
*SET
*PUT
*GET
*ADD
*SET
*PUT
*GET
13 A _ table is commonly referred to as a searcheable
container
*Stack
*Data
*Hash
*Blog
*Stack
*Data
*Hash
*Blog
14 True or False values are categorised as __
*Boolean
*Floating point
*Characters
*Sinking points
*Boolean
*Floating point
*Characters
*Sinking points
15 The primitive operation of a List which updates the
contents of a node is called a __
*GET
*SET
*CITE
*LET
*GET
*SET
*CITE
*LET
16 A _ has a node of degree zero
*Leaf
*Routine
*Pointer
*Subroutine
*Leaf
*Routine
*Pointer
*Subroutine
17 The algorithm that systematically visits all the items in a
tree is known as a _ traversal.
*Stack
*Tree
*List
*Queue
*Stack
*Tree
*List
*Queue
18 A Hash table resolves collisions by a technique known as _chaining
*Separate
*Fixed
*Partial
*Full
*Separate
*Fixed
*Partial
*Full
19 All __, whether they are fields, local variables, or
parameters, follow the same naming rules and conventions.
*Variables
*Indices
*Loops
*Sets
*Variables
*Indices
*Loops
*Sets
20 In the context of encapsulation, it is common to make
fields _
*Large
*Private
*Public
*Small
*Large
*Private
*Public
*Small
Comments
Post a Comment
DROP YOUR COMMENTS HERE.....