Question :- A graph is said to be complete if there is no edge between every pair of vertices.

1.true, false, true

2.true, true, false

3.true, true, true

4.false, true, true

Question :- A matrix in which non-zero entries can only occur on the diagonal or on elements immediately above or below the diagonal, is called ______ matrix.

1. triangular

2.tridiagonal

3.sparse

4.simple

Question :- A node is child node if out degree is one.

1. true, true

2. true, false

3.false, true

4. false false

Question :- Array is

1.data in physical order

2.data in logical order

3.both a& b

4.None of the above

Question :- Each programming language contains a ______ set that is used to communicate with the computer.

1.character

2.integer

3.float

4.numeric

Question :- Groups of consecutive elements in a string, such as words, phrases and sentences are called ________.

1. main strings

2.substring

3.index

4.block

Question :- If string 1 = John, and string 2 = Rivers are merged, the process is called ----

1.insertion

2.deletion

3.concatenation

4.replacement

Question :- It exports a set of operations

1.true, false

2.false, true

3.true, true

4. false, false

Question :- The complexity of the average case of an algorithm is

1. much more complicated to analyze than that of worst case

2.much more simpler to analyze than that of worst case

3.sometimes more complicated and some other times simpler than that of worst case

4.None of the above

Question :- The number K in A[K] is called the subscript or the ________.

1. size

2.index

3.variable

4.constant

Question :- Which of the following case does not exist in complexity theory

1. best case

2.worst case

3.average case

4.null case

Question :- A computer which can access an individual byte is called a ________ machine.

1.memory addressable

2.byte addressable

3.bit

4.byte

Question :- A graph is said to be complete if there is an edge between every pair of vertices.

1. A. true, true

2.false, true

3.false, false

4.true, false

Question :- A ______ is a list of a finite number of homogeneous data elements.

1.linear array

2.pointer

3.linked list

4.tree

Question :- Array is a

1.index data structure

2.non liturenear data structure

3. complx data structure

4.None of the above

Question :- Computers are used for processing numerical data called _______ data.

1. float

2.local

3.character

4.non-local

Question :- Each node in a linear list contains an item called _______ which points to the next node in the list.

1.node

2.link

3.variable

4. null

Question :- Elements of of an arrays are accessed by

1.accessing fuction in built in data structure

2.mathematical fuction

3.index

4.none of the above

Question :- Finite sequence S of zero or more characters is called _______.

1.array

2.list

3.string

4.block

Question :- In strictly binary tree, the out-degree of every node is either o or 2.

1.true, false

2.false, true

3.true, true

4. false, false

Question :- In _______ storage, each cell is divided into two parts---- the path stores a single character, while the second part contains the address of the cell containing the next character.

1.. fixed length

2.linked list

3.variable length

4.sequential

Question :- Insertion b) Deletion c) Retrieval d) Traversal

1. only a,b and c

2.only a and b

3.all of the above

4.None of the above

Question :- Matrices with relatively high proportion of zero entries are called ______ matrices.

1.triangular

2.diagonal

3.sparse

4.adjacency

Question :- Nodes that are not root and not leaf are called as internal nodes.

1.true, true

2.true, false

3.false, true

4.false, false

Question :- Programming languages like FORTRAN and PASCAL allocate memory space for arrays ______

1.dynamically

2.statically

3.successively

4.alternatively

Question :- Records can be stored in an area of memory called _______ memory.

1.dynamic

2.static

3.simple

4.parallel

Question :- Records can be stored in an area of memory called _______ memory.

1. dynamic

2. static

3. simple

4.parallel

Question :- Representation of a two dimensional as one single column of rows and mapping it sequentially is called _______ representation.

1.row-major

2.row

3.column-major

4.column

Question :- Row -major order in two -dimentional array refers to an arrangement where

1.all elements of a row are stored in memory in sequence followed by next row in sequence,and so on

2. all elements of row are stored in memory in sequence followed by next column in sequence ,and so on

3. all elements of row are stored in memory in sequence followed by next column in sequence

Question :- Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.

1. A. a-iii, b-ii, c-i

2.a-i, b-ii, c-iii

3.a-iii, b-i, c-ii

4.a-i, b-iii, c-ii

Question :- String with zero characters is called ________ string.

1.null

2.binary

3.totalled

4.list

Question :- The Average case occur in linear search algorithm

1.when item is somewhere in the middle of the array

2.when item is not in the array at all

3.when item is the last element in the array

4.when item is the last element in the array or is not there at all

Question :- The number of characters in a string is called its ______.

1. length

2.breath

3.width

4.none

Question :- The number of elements n is called the length or _____ of the array.

1.upper bound

2.lower bound

3.size

4.variable

Question :- The process of accessing and processing each element of an array A, exactly once is called _______.

1.deleting

2.inserting

3.traversing

4.searching

Question :- The space factor when determining the efficiency of algorithm is measured by

1.counting the maximum memory needed by the algorithm

2.counting the minimum memory needed by the algorithm

3.counting the average memory needed by the algorithm

4.counting the maximum disk space needed by the algorithm

Question :- The time complexity of binary search is O(logn).

1. true, false

2.false, true

3.false, false

4. true, true

Question :- The time factor when determining the efficiency of algorithm is measured by

1.counting microseconds

2.counting the number of key operations

3.counting the number of statements

4. counting the kilobytes of algorithm

Question :- Two dimensional arrays are sometimes called _______ arrays.

1. integer

2.boolean

3.matrix

4.real

Question :- Which of the following items are not part of the array declaration?

1.name of the array

2.data type of the array

3.index set of the array

4.length of the array

Question :- ____ arrays are where the elements in the different arrays with the same subscript belongs to the same record.

1.one dimensional

2.two dimensional

3. two dimensional

4.static

Question :- ____ is a variable whose length may vary during the execution, but the length cannot exceed a maximum values defined before the program is executed.

1.dynamic

2.static

3.semi static

4.global

Question :- _____ arrays are where the elements in the different arrays with the same subscript belongs to the same record.

1.one dimensional

2.parallel

3.two dimensional

4.static

Question :- _____ is a linearly ordered sequence of memory cells.

1.node

2.link

3.variable

4.null

Question :- _____ is a structure used to represent the linear relationship between elements by means of sequential memory locations.

1.linked list

2.array

3.pointer

4.stack

Question :- _____ is a variable whose length may vary during the execution of a program.

1.dynamic

2.static

3.semi static

4.global

Question :- ______ is a list in which the order of the items is significant, and the items are not necessarily sorted.

1._ordered list

2.indexed list

3.sequential list

4.unordered list

Question :- ______ operation of word processing involves replacing one string in the text by another.

1. insertion

2.deletion

3.searching

4.replacement

Question :- ______ refers to the operations of rearranging the elements of an array A so that they are in increasing order.

1.searching

2.sorting

3.traversing

4.inserting

Question :- _______ is the problem of deciding whether or not a given String pattern P appears in a text T.

1. pattern matching

2.searching

3.sorting

4.deletion