CIT341 TMA4

1 The data structure consisting of a group of elements accessed by indexing is known as the __
*Argument
*SIMM
*Array
*Set

2 Proper structuring of data makes software programme routines __
*Older
*Newer
*Tougher
*Simpler

3 In java programming, the 'int' type represents the set of __
*16-bit integers
*12-bit integers
*22-bit integers
*32-bit integers

4 In an array, elements are referenced by the array __
*Integer
*Name
*Point
*List

5 Which of the options is the emphasis placed on computer supported cooperative work (CSCW)?
*The use of computing systems in support of the collaborative work of a group of people
*The use of computing systems in support of individual work
*The use of information management in support of the individual work
*None of the above

6 Which of the following is best suited for allocating memory, at the architectural level?
*Block
*Stack
*Queue
*Loop

7 Two common exhaustive search methods are __ and backtracking
*Flipsoft
*Quicksoft
*Loopforce
*Bruteforce

8 In the preorder __ technique, the root is visited first
*Transcendent
*Tridal
*Traversal
*Transcorp

9 Which of the following operations creates the LIST?
*Initialise
*Add
*Index
*Set

10 The primary design consideration in the design of _ is the choice of data structure
*Arrays
*Programs
*Instances
*Arguments

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

12 All the following can be classified as primitive operations except _
*ADD
*SET
*PUT
*GET

13 A _ table is commonly referred to as a searcheable container
*Stack
*Data
*Hash
*Blog

14 True or False values are categorised as __
*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

16 A _ has a node of degree zero
*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

18 A Hash table resolves collisions by a technique known as _chaining
*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

20 In the context of encapsulation, it is common to make fields _
*Large
*Private
*Public
*Small