1 The values of the boolean data type are
*Old and New
*Big and Small
*True and False
*Two and Three
*Old and New
*Big and Small
*True and False
*Two and Three
2 The execution of an abstract data type in a programming
language is known as a
*Data Force
*Data Source
*Data Structure
*Data Set
*Data Force
*Data Source
*Data Structure
*Data Set
3 All the following are common data types except __
*Boolean
*Floating point
*Characters
*Sinking points
*Boolean
*Floating point
*Characters
*Sinking points
4 A group of data objects is typically characterised by how
the objects are __
*Tested
*Accessed
*Printed
*Secured
*Tested
*Accessed
*Printed
*Secured
5 In the context of data structures, a java array is also known
as an __
*Integer
*Object
*Pointer
*List
*Integer
*Object
*Pointer
*List
6 All the following can be classified as primitive operations
except _
*ADD
*SET
*PUT
*GET
*ADD
*SET
*PUT
*GET
7 A _ table is commonly referred to as a searcheable container
*Stack
*Data
*Hash
*Blog
*Stack
*Data
*Hash
*Blog
8 True or False values are categorised as __
*Boolean
*Floating point
*Characters
*Sinking points
*Boolean
*Floating point
*Characters
*Sinking points
9 The primitive operation of a List which updates the contents
of a node is called a __
*GET
*SET
*CITE
*LET
*GET
*SET
*CITE
*LET
10 Identify any of the following which is an exhaustive search
method?
*Stacking
*Backtracking
*Sidetracking
*Updating
*Stacking
*Backtracking
*Sidetracking
*Updating
11 Which of the following is best suited for assigning memory,
at the architectural level?
*Loop
*Block
*Queue
*Stack
*Loop
*Block
*Queue
*Stack
12 Generally, variables need an array in order to store series of
related __
*Blocks
*Classes
*Forms
*Values
*Blocks
*Classes
*Forms
*Values
13 The technique for resolving collisions in hash tables is
known as _
*Backtracking
*Separate Chaining
*Searching
*Linking
*Backtracking
*Separate Chaining
*Searching
*Linking
14 The algorithm that systematically visits all the items in a
tree is known as a _
*Tree Inversal
*Tree Preversal
*Tree Adversal
*Tree Traversal
*Tree Inversal
*Tree Preversal
*Tree Adversal
*Tree Traversal
15 In the postorder traversal technique, the root is visited _
*First
*Midway
*Last
*Constantly
*First
*Midway
*Last
*Constantly
16 The primitive operation of a _ which updates the contents
of a node is called a set
*Form
*Tree
*Class
*List
*Form
*Tree
*Class
*List
17 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
18 A searchable container is usually referred to as a _ table
*List
*Hash
*Stack
*Queue
*List
*Hash
*Stack
*Queue
19 All the following can be classified as primitive operations
except _
*Put
*Set
*Get
*Add
*Put
*Set
*Get
*Add
20 Software programme __ become simpler after proper
structuring
*Functions
*Subroutines
*Arguments
*Routines
*Functions
*Subroutines
*Arguments
*Routines
Comments
Post a Comment
DROP YOUR COMMENTS HERE.....