1. Which of the following is not a limitation of binary search algorithm ?

(A) binary search algorithm is not efficient when the data elements are more than 1000.

(B) must use a sorted array

(C) requirement of sorted array is expensive when a lot of insertion and deletions are needed

(D) there must be a mechanism to access middle element directly

2. Two dimensional arrays are also called

(A) tables arrays

(B) matrix arrays

(C) both of the above

(D) none of the above

3. The term “push” and “pop” is related to the

(A) Array

(B) Lists

(C) stacks

(D) all of above

4. A data structure where elements can be added or removed at either end but not in the middle is referred as

(A) Linked lists

(B) Stacks

(C) Queues

(D) Deque

5. The following sorting algorithm is of divideand-conquer type

(A) Bubble sort

(B) Insertion sort

(C) Quick sort

(D) None of the above

6. An algorithm that calls itself directly or indirectly is known as

(A) Recursion

(B) Polish notation

(C) Traversal algorithm

(D) None of the above

7. The elements of an array are stored successively in memory cells because

(A) by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

(B) the architecture of computer memory does not allow arrays to store other than serially

(C) A and B both false

(D) A and B both true

8. The memory address of the first element of an array is called

(A) base address

(B) floor address

(C) foundation address

(D) first address

9. The memory address of fifth element of an array can be calculated by the formula

(A) LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array

(B) LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array

(C) LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array

(D) None of the above

10. The following data structure can’t store the non-homogeneous data elements

(A) Arrays

(B) Records

(C) Pointers

(D) None of the above

Answers: 1. (A) 2. (C) 3. (C) 4. (D) 5. (B) 6. (A) 7. (A) 8. (A) 9. (C) 10. (A)

(A) binary search algorithm is not efficient when the data elements are more than 1000.

(B) must use a sorted array

(C) requirement of sorted array is expensive when a lot of insertion and deletions are needed

(D) there must be a mechanism to access middle element directly

2. Two dimensional arrays are also called

(A) tables arrays

(B) matrix arrays

(C) both of the above

(D) none of the above

3. The term “push” and “pop” is related to the

(A) Array

(B) Lists

(C) stacks

(D) all of above

4. A data structure where elements can be added or removed at either end but not in the middle is referred as

(A) Linked lists

(B) Stacks

(C) Queues

(D) Deque

5. The following sorting algorithm is of divideand-conquer type

(A) Bubble sort

(B) Insertion sort

(C) Quick sort

(D) None of the above

6. An algorithm that calls itself directly or indirectly is known as

(A) Recursion

(B) Polish notation

(C) Traversal algorithm

(D) None of the above

7. The elements of an array are stored successively in memory cells because

(A) by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

(B) the architecture of computer memory does not allow arrays to store other than serially

(C) A and B both false

(D) A and B both true

8. The memory address of the first element of an array is called

(A) base address

(B) floor address

(C) foundation address

(D) first address

9. The memory address of fifth element of an array can be calculated by the formula

(A) LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array

(B) LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array

(C) LOC(Array[5]=Base(Array)+w(5-lower boun(D), where w is the number of words per memory cell for the array

(D) None of the above

10. The following data structure can’t store the non-homogeneous data elements

(A) Arrays

(B) Records

(C) Pointers

(D) None of the above

Answers: 1. (A) 2. (C) 3. (C) 4. (D) 5. (B) 6. (A) 7. (A) 8. (A) 9. (C) 10. (A)

1. Arrays are best data structures for

(A) relatively permanent collections of data

(B) the size of the structure and the data in the structure are constantly changing

(C) both of above situation

(D) none of above situation

2. Linked lists are best suited for

(A) relatively permanent collections of data

(B) the size of the structure and the data in the structure are constantly changing

(C) both of above situation

(D) none of above situation

3. Each array declaration need not give, implicitly or explicitly, the information about the

(A) name of array

(B) data type of array

(C) first data from the set to be stored

(D) index set of the array

4. The complexity of merge sort algorithm is

(A) O(n)

(B) O(log n)

(C) O(n log n)

(D) None of these

5. The indirect change of the values of a variable in one module by another module is called

(A) internal change

(B) inter-module change

(C) side effect

(D) all the above

6. Two main measures for the efficiency of an algorithm are

(A) Time and space

(B) Processor and memory

(C) Complexity and capacity

(D) Data and space

7. The time factor when determining the efficiency of algorithm is measured by

(A) Counting the number of key operations

(B) Counting the number of statements

(C) Counting the kilobytes of algorithm

(D) None of the above

8. The space factor when determining the efficiency of algorithm is measured by

(A) Counting the maximum memory needed by the algorithm

(B) Counting the minimum memory needed by the algorithm

(C) Counting the average memory needed by the algorithm

(D) Counting the maximum disk space needed by the algorithm

9. All the above* Which of the following data structures are indexed structures

(A) linear arrays

(B) linked lists

(C) both of above

(D) none of above

10. Which of the following is not the required condition for binary search algorithm

(A) there must be mechanism to delete and/ or insert elements in list

(B) the list must be sorted

(C) there should be the direct access to the middle element in any sublist

(D) none of the above

Answers: 1. (A) 2. (B) 3. (C) 4. (C) 5. (C) 6. (A) 7. (A) 8. (A) 9. (A) 10. (A)

(A) relatively permanent collections of data

(B) the size of the structure and the data in the structure are constantly changing

(C) both of above situation

(D) none of above situation

2. Linked lists are best suited for

(A) relatively permanent collections of data

(B) the size of the structure and the data in the structure are constantly changing

(C) both of above situation

(D) none of above situation

3. Each array declaration need not give, implicitly or explicitly, the information about the

(A) name of array

(B) data type of array

(C) first data from the set to be stored

(D) index set of the array

4. The complexity of merge sort algorithm is

(A) O(n)

(B) O(log n)

(C) O(n log n)

(D) None of these

5. The indirect change of the values of a variable in one module by another module is called

(A) internal change

(B) inter-module change

(C) side effect

(D) all the above

6. Two main measures for the efficiency of an algorithm are

(A) Time and space

(B) Processor and memory

(C) Complexity and capacity

(D) Data and space

7. The time factor when determining the efficiency of algorithm is measured by

(A) Counting the number of key operations

(B) Counting the number of statements

(C) Counting the kilobytes of algorithm

(D) None of the above

8. The space factor when determining the efficiency of algorithm is measured by

(A) Counting the maximum memory needed by the algorithm

(B) Counting the minimum memory needed by the algorithm

(C) Counting the average memory needed by the algorithm

(D) Counting the maximum disk space needed by the algorithm

9. All the above* Which of the following data structures are indexed structures

(A) linear arrays

(B) linked lists

(C) both of above

(D) none of above

10. Which of the following is not the required condition for binary search algorithm

(A) there must be mechanism to delete and/ or insert elements in list

(B) the list must be sorted

(C) there should be the direct access to the middle element in any sublist

(D) none of the above

Answers: 1. (A) 2. (B) 3. (C) 4. (C) 5. (C) 6. (A) 7. (A) 8. (A) 9. (A) 10. (A)

1. The depth of a complete binary tree is given by

(A) Dn = n log2n

(B) Dn = n log2n+1

(C) Dn = log2n

(D) Dn = log2n+1

(A) Dn = n log2n

(B) Dn = n log2n+1

(C) Dn = log2n

(D) Dn = log2n+1

2. The complexity of Binary search algorithm is

(A) O(n)

(B) O(log )

(C) O(n log n)

(D) None of the above

3. The complexity of Bubble sort algorithm is

(A) O(n)

(B) O (n2)

(C) O(n log n)

(D) None of the above

4. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return

(A) FAEKCDBHG

(B) FAEKCDHGB

(C) EAFKHDCBG

(D) FEAKDCHBG

5. When representing any algebraic expression E the following uses only binary operations in a 2-tree

(A) the variable in E will appear as external nodes and operations in internal nodes

(B) the operations in E will appear as external nodes and variables in internal nodes

(C) the variables and operations in E will appear only in internal nodes

(D) None of the above

6. When converting binary tree into extended binary tree, all the original nodes in binary tree are

(A) internal nodes on extended tree

(B) external nodes on extended tree

(C) vanished on extended tree

(D) None of the above

7. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

(A) ABFCDE

(B) ADBFEC

(C) ABDECF

(D) None of the above

8. Which of the following data structure is linear data structure?

(A) Trees

(B) Graphs

(C) Arrays

(D) None of the above

9. The operation of processing each element in the list is known as

(A) Merging

(B) Inserting

(C) Traversal

(D) All the above

10. Finding the location of the element with a given value is called

(A) Traversal

(B) Search

(C) Sort

(D) All of the above

Answers: 1. (D) 2. (B) 3. (B) 4. (B) 5. (A) 6. (A) 7. (C) 8. (C) 9. (C) 10. (B)

(A) O(n)

(B) O(log )

(C) O(n log n)

(D) None of the above

3. The complexity of Bubble sort algorithm is

(A) O(n)

(B) O (n2)

(C) O(n log n)

(D) None of the above

4. When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return

(A) FAEKCDBHG

(B) FAEKCDHGB

(C) EAFKHDCBG

(D) FEAKDCHBG

5. When representing any algebraic expression E the following uses only binary operations in a 2-tree

(A) the variable in E will appear as external nodes and operations in internal nodes

(B) the operations in E will appear as external nodes and variables in internal nodes

(C) the variables and operations in E will appear only in internal nodes

(D) None of the above

6. When converting binary tree into extended binary tree, all the original nodes in binary tree are

(A) internal nodes on extended tree

(B) external nodes on extended tree

(C) vanished on extended tree

(D) None of the above

7. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

(A) ABFCDE

(B) ADBFEC

(C) ABDECF

(D) None of the above

8. Which of the following data structure is linear data structure?

(A) Trees

(B) Graphs

(C) Arrays

(D) None of the above

9. The operation of processing each element in the list is known as

(A) Merging

(B) Inserting

(C) Traversal

(D) All the above

10. Finding the location of the element with a given value is called

(A) Traversal

(B) Search

(C) Sort

(D) All of the above

Answers: 1. (D) 2. (B) 3. (B) 4. (B) 5. (A) 6. (A) 7. (C) 8. (C) 9. (C) 10. (B)

(A) P points to the address of first element in DATA

(B) P can store only memory addresses

(C) P contain the DATA and the address of DATA

(D) P contains the address of an element in DATA.

2. The Worst case occur in linear search algorithm when

(A) Item is not in the array at all

(B) Item is the last element in the array

(C) Item is the last element in the array or is not there at all

(D) None of above

3. The Average case occur in linear search algorithm

(A) When Item is somewhere in the middle of the array

(B) When Item is not in the array at all

(C) When Item is the last element in the array

(D) All the above

4. The complexity of the average case of an algorithm is

(A) Much more complicated to analyze than that of worst case

(B) Much more simpler to analyze than that of worst case

(C) Sometimes more complicated and some other times simpler than that of worst case

(D) None of the above

5. The following data structure allows deleting data elements from front and inserting at rear

(A) Stacks

(B) Queues

(C) Deques

(D) Binary search tree

6. This data structure allows deletions at both ends of the list but insertion at only one end.

(A) Input-restricted deque

(B) Output-restricted deque

(C) Priority queues

(D) None of the above

7. The following data structure is non-linear type

(A) Strings

(B) Lists

(C) Stacks

(D) None of the above

8. The following data structure is linear type

(A) Strings

(B) Lists

(C) Queues

(D) All of the above

9. To represent hierarchical relationship between elements, the following data structure is suitable

(A) Deque

(B) Priority

(C) Tree

(D) All of above

10. A binary tree whose every node has either zero or two children is called

(A) Complete binary tree

(B) Binary search tree

(C) Extended binary tree

(D) None of above

Answers: 1. (D) 2. (C) 3. (A) 4. (A) 5. (B) 6. (A) 7. (D) 8. (D) 9. (C) 10. (C)

## TO PURCHASE SPECIALIST OFFICER MARKETING/IT/HR/LAW STUDY MATERIAL VISIT HERE

__Kiran’s IBPS Specialist Officers (So) I.T. Officer CWE Spl – V Guide Cum Practice Work Book (With CD)– English__

__Buy IBPS Specialist Officers CWE I.T. Officer Online Exam Practice Work Book__

## No comments:

Post a Comment