> > Data Structures And Algorithms MCQs > Basic Data Structures and Algorithms MCQs

Basic Data Structures and Algorithms MCQ

1. Infiniband can support data transfer speeds of ____ per second.

1.5 billion bits (1.5 gigabits)

5 billion bits (5 gigabits)

2.5 billion bits (2.5 gigabits)

10 billion bits (10 gigabits)

Answer

Correct Answer: 2.5 billion bits (2.5 gigabits)

Note: This Question is unanswered, help us to find answer for this one

2. The __________ places new orders when inventory levels fall to predetermined points.

Master level

Economic order quantity

Purchasing control level

Financial minimum level

Answer

Correct Answer: Economic order quantity

Note: This Question is unanswered, help us to find answer for this one

3. A(n) ____ control is any type of input mechanism on a form.

Variable.

Input.

Parameter.

Form. Correct

Answer

Correct Answer: Input.

Note: This Question is unanswered, help us to find answer for this one

4. In a(n) ____________________ data type, each data item is a collection of other data items.

One-dimensional array

Array index out of bounds

Structured data type

Aggregate operation

Answer

Correct Answer: Structured data type

Note: This Question is unanswered, help us to find answer for this one

5. With a(n) ____, you perform an action or task, and then you perform the next action, in order.

Spaghetti Bowl

Sequence

Sequence Structure

Sequence, selection, and loop

Answer

Correct Answer: Sequence Structure

Note: This Question is unanswered, help us to find answer for this one

6. With a hollow structure, the organization ____.

System of consciously coordinated activities or forces of two or more people

Assembles portions of product provided by outside contractors

The arrangement of having discrete parts of a task done by different people

Has a central core of key functions and outsources others to vendors who are less expensive or faster

Answer

Correct Answer: Has a central core of key functions and outsources others to vendors who are less expensive or faster

Note: This Question is unanswered, help us to find answer for this one

7. Members of a(n) ________ union have names, but the union itself has no name.

Anonymous

Semicolon

Integers

A member

Answer

Correct Answer: Anonymous

Note: This Question is unanswered, help us to find answer for this one

8. In a function template, the programmer substitutes for .

Parameters, data types

Parameters, arguments

Arguments, parameters

Answer

Correct Answer: Parameters, data types

Note: This Question is unanswered, help us to find answer for this one

9. Because “a” is always less than “b”, alphabetic sorts are ____ sorts.

Ascending

Decending

Downward

Reversing

Answer

Correct Answer: Ascending

Note: This Question is unanswered, help us to find answer for this one

10. A ____ read is an added statement that gets the first input value in a program.

Nested

Stacked

Posttest

Priming

Answer

Correct Answer: Priming

Note: This Question is unanswered, help us to find answer for this one

11. When computers sort data, they always use ____ values when making comparisons between values.

Numeric

Alphanumeric

Alphabetic

Ascending.

Answer

Correct Answer: Numeric

Note: This Question is unanswered, help us to find answer for this one

12. Assume s is "abcabc", the method ________ returns an array of characters.

ToChars(s)

s.toCharArray()

String.toChars()

String.toCharArray()

s.toChars()

Answer

Correct Answer: s.toCharArray()

Note: This Question is unanswered, help us to find answer for this one

13. A collection in the items stored there are of different types is referred to as a(n) ________ type.

Homogeneous

Heterogeneous

Dynamic

Abstract

Answer

Correct Answer: Heterogeneous

Note: This Question is unanswered, help us to find answer for this one

14. The ____ is skewed by a few very high or low values.

Mean

Cornice

Keystone

Pendentive

Flying buttress

Answer

Correct Answer: Mean

Note: This Question is unanswered, help us to find answer for this one

15. Structures can be stacked or connected to one another at their ____.

Entry points only

Exit points only

Entry or combination points

Entry or exit points

Answer

Correct Answer: Entry or exit points

Note: This Question is unanswered, help us to find answer for this one

16. A(n) ____ tells the user what to enter.

Command line

Input screen

Prompt

Data line

Answer

Correct Answer: Prompt

Note: This Question is unanswered, help us to find answer for this one

17. A variable usually is passed into a method by ____.

Reference

Inference

Insinuation

Value

Answer

Correct Answer: Value

Note: This Question is unanswered, help us to find answer for this one

18. A ____ is a rectangular area into which the user can type text.

Label

Button

Check box

Text box

Answer

Correct Answer: Text box

Note: This Question is unanswered, help us to find answer for this one

19. A(n) ____ is shorthand for the detail you want to use in a search filter.

Colon

Investigator

Umlaut

File property name

Answer

Correct Answer: File property name

Note: This Question is unanswered, help us to find answer for this one

20. A(n) ______ is a process or set of operations in a calculation.

Algorithm

Feedback loop

Stream

Structure

Answer

Correct Answer: Algorithm

Note: This Question is unanswered, help us to find answer for this one

21. Two-dimensional arrays can be thought of as containing ________.

Rows and columns

Lines and pages

Rows and lines

Lines and columns

Rows and pages

Answer

Correct Answer: Rows and columns

Note: This Question is unanswered, help us to find answer for this one

22. Suppose integer x = new integer(3); x holds ________.

False

A reference value to an Integer object

A class type

An interface type

An array type

Calendar.get(Calendar.WEEK_OF_YEAR

Answer

Correct Answer: A reference value to an Integer object

Note: This Question is unanswered, help us to find answer for this one

23. The body of a ______-test loop is always executed at least once.

Pretest

Posttest

Condition-controlled

Count-controlled

Answer

Correct Answer: Posttest

Note: This Question is unanswered, help us to find answer for this one

24. A variable defined inside a method is referred to as ________.

A global variable

A method variable

A block variable

A local variable

Answer

Correct Answer: A local variable

Note: This Question is unanswered, help us to find answer for this one

25. The ____ function is used to create a constant.

Define()

Min()

Abs()

Sqrt()

Answer

Correct Answer: Define()

Note: This Question is unanswered, help us to find answer for this one

26. In comparison with unstructured information, semi-structured information ________.

Is more difficult to break down

Has no inherent order

Is easier to query and aggregate

Is more difficult to link together

Answer

Correct Answer: Is easier to query and aggregate

Note: This Question is unanswered, help us to find answer for this one

27. A(n) ________ search uses a loop to sequentially step through an array.

Binary.

Unary.

Linear.

Relative.

None of these

Answer

Correct Answer: Linear.

Note: This Question is unanswered, help us to find answer for this one

28. A ________ search uses a loop to sequentially step through an array.

Binary

Unary

Linear

Relative

None of these

Answer

Correct Answer: Linear

Note: This Question is unanswered, help us to find answer for this one

29. The rijndael algorithm is better known today as __________.

Blowfish

Advanced Encryption Standard (AES

Triple Data Encryption Standard (3DES)

Data Encryption Standard (DES

Answer

Correct Answer: Advanced Encryption Standard (AES

Note: This Question is unanswered, help us to find answer for this one

30. When working with multiple sets of data, one would typically use a ________.

List

Tuple

Nested list

Sequence

Answer

Correct Answer: Nested list

Note: This Question is unanswered, help us to find answer for this one

31. Every node (except of the last node) in a singly linked list contains ____.

The next node

No address information

The address of the next node

The address of the previous node

Answer

Correct Answer: The address of the next node

Note: This Question is unanswered, help us to find answer for this one

32. To arrange the elements in an array in ascending order, you use the ____ method.

Array.Sort

Array.Ascending

Array.Arrange

Array

Answer

Correct Answer: Array.Sort

Note: This Question is unanswered, help us to find answer for this one

33. The number of elements in an array is called the ____ of the array.

Width

Size

Height

Depth

Answer

Correct Answer: Size

Note: This Question is unanswered, help us to find answer for this one

34. Programmers sometimes refer to a situation in which nothing goes wrong as the ____ case.

Rainbow day

Sunny day

Cloudy day

Pessimistic

Answer

Correct Answer: Sunny day

Note: This Question is unanswered, help us to find answer for this one

35. In all languages, subscript values must be sequential ____.

Characters

Fractions

Real numbers

Integers

Answer

Correct Answer: Integers

Note: This Question is unanswered, help us to find answer for this one

36. In a ____, items in a list are compared with each other in pairs.

Quick sort

Shell sort

Bubble sort

Matrix sort

Answer

Correct Answer: Bubble sort

Note: This Question is unanswered, help us to find answer for this one

37. If a one-dimensional array contains five elements, its highest subscript is ____.

Superscript

Keyset

Index

Subscript

Answer

Correct Answer: Subscript

Note: This Question is unanswered, help us to find answer for this one

38. Each element in a two-dimensional array requires ____ subscript(s) to reference it.

One

Two

Three

Four

Answer

Correct Answer: Two

Note: This Question is unanswered, help us to find answer for this one

39. An array whose elements you can access using a single subscript is a ____ array.

One dimensional

Multidimensional

Non-dimensional

Answer

Correct Answer: One dimensional

Note: This Question is unanswered, help us to find answer for this one

40. When mathematicians use a two-dimensional array, they often call it a ____ or a table.

Vector

Matrix

Square

Answer

Correct Answer: Matrix

Note: This Question is unanswered, help us to find answer for this one

41. The starting value of an algorithm used to generate a range of numbers is called the _________.

Write

Integer

Seed

Different

Answer

Correct Answer: Seed

Note: This Question is unanswered, help us to find answer for this one

42. The ________ function does the same thing as using the mathematical ∧ operator.

Abs.

Pow.

Round.

Cos.

Sqrt

Answer

Correct Answer: Sqrt

Note: This Question is unanswered, help us to find answer for this one

43. The following pseudocode is an example of ____.

Sequence

Decision

Loop

Nested

Answer

Correct Answer: Decision

Note: This Question is unanswered, help us to find answer for this one

44. When an array is passed to a function, it is actually ________ the array that is passed.

A copy of all the values in

The value stored in the first element of

The data type and name of

The data type and size of

The starting memory address of

Answer

Correct Answer: The starting memory address of

Note: This Question is unanswered, help us to find answer for this one

45. Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

End

Endloop

Endif

Endstructure

Answer

Correct Answer: Endif

Note: This Question is unanswered, help us to find answer for this one

46. A(n) ________ member variable may be accessed before any objects of the class have been declared.

Private

Public

Inline

Static

Answer

Correct Answer: Static

Note: This Question is unanswered, help us to find answer for this one

47. A bubble sort is sometimes called a ____.

Dropping sort

Sinking sort

Compare sort

Pair sort

Answer

Correct Answer: Sinking sort

Note: This Question is unanswered, help us to find answer for this one

48. A ________ is used to travel through a linked list and search for data.

Node.

Pointer.

Null pointer.

Traversal operator.

None of these

Answer

Correct Answer: Pointer.

Note: This Question is unanswered, help us to find answer for this one

49. The ________ represents a special value that marks the end of a list of values.

Sentinel

No iterations

Three

Infinite

Answer

Correct Answer: Sentinel

Note: This Question is unanswered, help us to find answer for this one

50. After you create an array variable, you still need to ____ memory space.

Null

Reserve

Type-safe

Property

Answer

Correct Answer: Reserve

Note: This Question is unanswered, help us to find answer for this one

51. If an exception occurs in a try-catch block, the code in the finally clause ________.

Is executed

May be executed

Is not executed

Is not executed if the exception is caught

Answer

Correct Answer: Is executed

Note: This Question is unanswered, help us to find answer for this one

52. Fill in the code in comparable________ c = new date();

Answer

Correct Answer:

Note: This Question is unanswered, help us to find answer for this one

53. Before a structure variable can be created, the structure must be _________.

Declared

Organized

Processed

None of these

Answer

Correct Answer: Declared

Note: This Question is unanswered, help us to find answer for this one

54. The expression score[5] is pronounced ________.

Score sub 4

Score sub 5

Score of 4

Score of 5

Answer

Correct Answer: Score sub 5

Note: This Question is unanswered, help us to find answer for this one

55. The elements of an array are stored in __________ storage locations in the computer?s memory.

Consecutive

Alternative

Both

None

Answer

Correct Answer: Consecutive

Note: This Question is unanswered, help us to find answer for this one

56. A variable or a value listed in a call to a method is called ________.

A parameter

An argument

A local variable

A global variable

Answer

Correct Answer: An argument

Note: This Question is unanswered, help us to find answer for this one

57. A two-dimensional array can be viewed as _ and ___.

Rows, columns

Arguments, parameters

Increments, decrements

All of these

Answer

Correct Answer: Rows, columns

Note: This Question is unanswered, help us to find answer for this one

58. A three-dimensional array can be thought of as ________ of two-dimensional arrays.

Rows

Columns

Lines

Pages

Answer

Correct Answer: Pages

Note: This Question is unanswered, help us to find answer for this one

59. Data can be organized and processed sequentially using an array, called a(n) ____ list.

Linked

Ordered

Sequential

Ascending

Answer

Correct Answer: Sequential

Note: This Question is unanswered, help us to find answer for this one

60. Selection sort requires ________ passes to put n data items in order.

N-1

N+1

Answer

Correct Answer: N-1

Note: This Question is unanswered, help us to find answer for this one

61. To describe a queuing system, we use the term ____ for the object that provides the service.

Client

Server

Customer

Provider

Answer

Correct Answer: Server

Note: This Question is unanswered, help us to find answer for this one

62. A ____ is a copy that is kept in case values need to be restored to their original state.

Read-only file

Backup file

Primary file

Secondary file

Answer

Correct Answer: Backup file

Note: This Question is unanswered, help us to find answer for this one

63. The maximum number of entry points that any programming structure can have is ____.

Five

Zero

One

Three

Answer

Correct Answer: One

Note: This Question is unanswered, help us to find answer for this one

64. Attaching structures end to end is called ____ structures.

Linking

Nesting

Stacking

Building

Answer

Correct Answer: Stacking

Note: This Question is unanswered, help us to find answer for this one

65. Java.util.vector is a subtype of ________.

Java.util.ArrayList

Java.util.LinkedList

Java.util.AbstractList

Java.util.Vector

Java.util.List

Answer

Correct Answer: Java.util.AbstractList

Note: This Question is unanswered, help us to find answer for this one

66. Arrays, unlike simple built-in types, are passed by ____.

Type

Class

Reference

Answer

Correct Answer: Reference

Note: This Question is unanswered, help us to find answer for this one

67. A loop within another loop is known as a(n) ____ loop.

Ndefinite

Nested

Infinite

Hidden

Answer

Correct Answer: Nested

Note: This Question is unanswered, help us to find answer for this one

68. A loop must return to the ____ question at some later point in a structure.

Master loop

Loop-controlling

Start loop

Continue loop

Answer

Correct Answer: Loop-controlling

Note: This Question is unanswered, help us to find answer for this one

69. When you derive a class from an existing class, you ________ add new data and functions.

Multiple inheritance

May

Both of these

None of these

Answer

Correct Answer: May

Note: This Question is unanswered, help us to find answer for this one

70. The number of elements an array will hold is known as the ____ of the array.

True

Size

Variable

False

Answer

Correct Answer: Size

Note: This Question is unanswered, help us to find answer for this one

71. When you return an array from a method, the method returns ________.

A copy of the array

A copy of the first element

The reference of the array

The length of the array

Answer

Correct Answer: The reference of the array

Note: This Question is unanswered, help us to find answer for this one

72. When you create a ____ report, the records must have been sorted in order by a key field.

Sort Records as a Whole

Algorithm

Control Break

Random-Access

Answer

Correct Answer: Control Break

Note: This Question is unanswered, help us to find answer for this one

73. When an array is sorted from highest to lowest, it is said to be in ________ order.

Sorting

Simplicity

Selection, bubble

Descending

Answer

Correct Answer: Descending

Note: This Question is unanswered, help us to find answer for this one

74. To build a list initially, you can use a(n) ________ routine.

FALSE

Append

Nodes

Struct

Answer

Correct Answer: Append

Note: This Question is unanswered, help us to find answer for this one

75. The following pseudocode is an example of a ____ structure.

Decision

Sequence

Nested

Loop

Answer

Correct Answer: Sequence

Note: This Question is unanswered, help us to find answer for this one

76. You use the ________ operator to access members of an object.

()

Answer

Correct Answer: .

Note: This Question is unanswered, help us to find answer for this one

77. The sequential search algorithm uses a(n) ____ variable to track whether the item is found.

Int

Bool

Char

Double

Answer

Correct Answer: Bool

Note: This Question is unanswered, help us to find answer for this one

78. ________ is a data structure to store data in sequential order.

A list

A set

A tree

A stack

A queue

Answer

Correct Answer: A list

Note: This Question is unanswered, help us to find answer for this one

79. ________ allows for very recent file changes to be restored.

Shadowing

Data Masking

Differential Backup

Answer

Correct Answer: Shadowing

Note: This Question is unanswered, help us to find answer for this one

80. ________ algorithms are used to arrange random data into some order.

Standard search

Sorting

Inear

Binary search

None of these

Answer

Correct Answer: Sorting

Note: This Question is unanswered, help us to find answer for this one

81. ____ methods are methods that exist to be used with an object created from a class.

Nonstatic

Static

Hidden

Controlled

Answer

Correct Answer: Nonstatic

Note: This Question is unanswered, help us to find answer for this one

82. In a truth table, the expression ____ is true

True and true

True and false

False and false

False and true.

Answer

Correct Answer: True and true

Note: This Question is unanswered, help us to find answer for this one

83. In a truth table, the expression ____ is false.

True OR true

True OR false

False OR false

False OR true.

Answer

Correct Answer: False OR false

Note: This Question is unanswered, help us to find answer for this one

84. Every element in an array is assigned a unique number known as a ________.

Number

Character

Subscript

Integer

Answer

Correct Answer: Subscript

Note: This Question is unanswered, help us to find answer for this one

85. Each object of a class has its own copy of the class's ________.

Member functions

Member variables

Constructor and destructor functions

All of these

None of these

Answer

Correct Answer: Member variables

Note: This Question is unanswered, help us to find answer for this one

86. A(n) ________ informs the compiler that a class will be declared later in the program.

Forward declaration

This pointer

Overloaded

Copy constructor

Answer

Correct Answer: Forward declaration

Note: This Question is unanswered, help us to find answer for this one

87. A member function that is declared ________ may not access any non-static data members in the class

Private

Public

Static

Inline

None of these

Answer

Correct Answer: Static

Note: This Question is unanswered, help us to find answer for this one

88. A heuristic is a(n) ____.

Analytical technique based on self-knowledge and self-reflection

Precise, step-by-step set of rules that will reliably generate a solution to a problem

Technique to improve memory and mental processing

Shortcut to problem solving, also known as a rule of thumb

Answer

Correct Answer: Shortcut to problem solving, also known as a rule of thumb

Note: This Question is unanswered, help us to find answer for this one

89. Which of the following points is/are true about Linked List data structure when it is compared with array

Arrays have better cache locality that can make them better in terms of performance.

It is easy to insert and delete elements in Linked List

Random access is not allowed in a typical implementation of Linked Lists

The size of array has to be pre-decided, linked lists can change their size any time.

All of the above

Answer

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

90. Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call?

2 <--> 1 <--> 4 <--> 3 <--> 6 <-->5

5 <--> 4 <--> 3 <--> 2 <--> 1 <-->6.

6 <--> 5 <--> 4 <--> 3 <--> 2 <--> 1.

6 <--> 5 <--> 4 <--> 3 <--> 1 <--> 2

Answer

Correct Answer: 2 <--> 1 <--> 4 <--> 3 <--> 6 <-->5

Note: This Question is unanswered, help us to find answer for this one

91. The time required to search an element in a linked list of length n is

O (log n)

O (n)

O (1)

O(n2)

Answer

Correct Answer: O (n)

Note: This Question is unanswered, help us to find answer for this one

92. Which of the following operations is performed more efficiently by doubly linked list than by linear linked list?

Deleting a node whose location is given

Searching an unsorted list for a given item

Inserting a node after the node with a given location

Traversing the list to process each node

Answer

Correct Answer: Deleting a node whose location is given

Note: This Question is unanswered, help us to find answer for this one

93. Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be the slowest?

union only

intersection, membership

membership, cardinality

union, intersection

Answer

Correct Answer: union, intersection

Note: This Question is unanswered, help us to find answer for this one

94. Is it possible to create a doubly linked list using only one pointer with every node.

Not Possible

Yes, possible by storing XOR of addresses of previous and next nodes.

Yes, possible by storing XOR of current node and next node

Yes, possible by storing XOR of current node and previous node

Answer

Correct Answer: Yes, possible by storing XOR of addresses of previous and next nodes.

Note: This Question is unanswered, help us to find answer for this one

95. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

log 2 n

n/2

log 2 n – 1

Answer

Correct Answer: n

Note: This Question is unanswered, help us to find answer for this one

96. Which of these is the correct big -Oh expression for 1+2+3+...+n?

O(log n)

O(n)

O(n log n)

O(n2)

Answer

Correct Answer: O(n)

Note: This Question is unanswered, help us to find answer for this one

97. What is the minimum number of nodes in a full binary tree with height 3?

Answer

Correct Answer: 7

Note: This Question is unanswered, help us to find answer for this one

98. Which of the following operations is more expensive in the array implementation of the linked list than it is in the dynamically created linked list?

Insertion

Traversing

Searching

None

Answer

Correct Answer: Insertion

Note: This Question is unanswered, help us to find answer for this one

99. Which of the following tree traversal techniques reads the root before its children nodes?

In order

Pre-order

Post-order

None of the above

Answer

Correct Answer: In order

Note: This Question is unanswered, help us to find answer for this one

100. Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

1.6

2.9

4.2

5.5

Answer

Correct Answer: 2.9

Note: This Question is unanswered, help us to find answer for this one

101. What kind of list is the best to answer questions such as "Which is the item at position n?"

Lists implemented with an array

Doubly-linked lists

Singly-linked lists

Doubly-linked or singly-linked lists are equally good

Answer

Correct Answer: Lists implemented with an array

Note: This Question is unanswered, help us to find answer for this one

102.

Quicksort is run on two inputs shown below to sort them in the ascending order.

i) 1,2,3,...n
ii) n,n-1,n-2,...2,1

If C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively, then

C1>C2

C1=C2

You cannot say anything for arbitrary n

Answer

Correct Answer: C1=C2

Note: This Question is unanswered, help us to find answer for this one

103. In a selection sort algorithm, the number of passes required to perform the sort are ______.

N-1

N-2

N^2

Answer

Correct Answer: N-1

Note: This Question is unanswered, help us to find answer for this one

104. Which of the following operations is more expensive in the dynamically created linked list than it is in the conventional array?

Finding Kth element

Insertion

Deletion

Traversing

Answer

Correct Answer: Finding Kth element

Note: This Question is unanswered, help us to find answer for this one

105. A binary tree, all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

Full binary tree

2-Tree

Threaded tree

Complete binary tree

Answer

Correct Answer: Complete binary tree

Note: This Question is unanswered, help us to find answer for this one

106. What do we call a binary tree in which all the levels, except possibly the last level, have the maximum number of nodes, and in which all the nodes at the last level appear as far left as possible?

Full binary tree

2-Tree

Threaded tree

Complete binary tree

Answer

Correct Answer: Complete binary tree

Note: This Question is unanswered, help us to find answer for this one

107. The number of distinct simple graphs with up to three nodes is _______.

Answer

Correct Answer: 7

Note: This Question is unanswered, help us to find answer for this one

108. You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion in the middle of a NONEMPTY queue?

Neither of them changes

Only front_ptr changes

Only rear_ptr changes

Both change

Answer

Correct Answer: Both change

Note: This Question is unanswered, help us to find answer for this one

109.
Consider this binary search tree.
This question is based upon the figure shown below
Consider this binary search tree.
Which will be the new root if you remove the root and replace it with something from the left subtree?

Answer

Correct Answer:

Note: This Question is unanswered, help us to find answer for this one

110. What is the maximum depth of recursive calls a function may make?

n (where n is the argument)

There is no fixed maximum

Answer

Correct Answer: There is no fixed maximum

Note: This Question is unanswered, help us to find answer for this one

111. A binary search tree is generated by inserting the following integers in the order: 50,15,62,5,20,58,91,3,8,37,60,24. How many nodes are in the left and right subtrees, respectively?

(4,7)

(7,4)

(8,3)

(3,8)

Answer

Correct Answer: (7,4)

Note: This Question is unanswered, help us to find answer for this one

112. Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the enqueue member function place the new entry in the array?

data[1]

data[2]

data[11]

data[12]

Answer

Correct Answer: data[12]

Note: This Question is unanswered, help us to find answer for this one

113. Which of these are standard operations of Stack Data Structure?

Push, delete

Insert, pop

Put, extract

Push, pop

Answer

Correct Answer: Push, pop

Note: This Question is unanswered, help us to find answer for this one

114. Which of the following is the worst-case scenario for operations on heaps?

Neither insertion nor removal is better than linear

Insertion is better than linear, but removal is not

Removal is better than linear, but insertion is not

Both insertion and removal are better than linear

Answer

Correct Answer: Both insertion and removal are better than linear

Note: This Question is unanswered, help us to find answer for this one

115. What is the minimum number of edges and vertices possible in a non- planar graph?

10 edges, 5 vertices

9 edges, 6 vertices

6 edges, 4 vertices

9 edges, 5 vertices

Answer

Correct Answer: 10 edges, 5 vertices

Note: This Question is unanswered, help us to find answer for this one

116. If h is the depth of the tree, which formula will be used to find the maximum number of nodes n in a perfect binary tree?

2h + 1 - 1

2h + 1

2h + 1 + 1

Answer

Correct Answer: 2h + 1 - 1

Note: This Question is unanswered, help us to find answer for this one

117. What will happen if in data structure a pop operation on the stack causes the stack pointer to move past the origin of the stack?

Overflow

Underflow

Null

Garbage collection

Answer

Correct Answer: Underflow

Note: This Question is unanswered, help us to find answer for this one

118. In the linked representation of a sparse matrix, the head node for a column list stores_____

a pointer to the next column head node

a pointer to the first node in the column list

column number

All of the above

Answer

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

119. You have implemented a queue with a circular array keeping track of the first item, the last item, and the count (the number of items in the array). Suppose the address of the first is zero, and that of the last is CAPACITY-1, what can you say about the count?

The count must be zero

The count must be CAPACITY

The count can be zero or CAPACITY, but no other value can occur

None of the above

Answer

Correct Answer: The count must be CAPACITY

Note: This Question is unanswered, help us to find answer for this one

120. Which of the following operations in the simple linked list will modify the beginning of the linked list?

Deletion of the first node

Insertion after the last node

Insertion after the first node

None of the above

Answer

Correct Answer: Deletion of the first node

Note: This Question is unanswered, help us to find answer for this one

121. A matrix is called sparse when______

most of its elements are non-zero

most of its elements are zero

all of its elements are non-zero

None of the above

Answer

Correct Answer: most of its elements are zero

Note: This Question is unanswered, help us to find answer for this one

122. Which of the following data structures has a balanced condition?

AVL Tree

Doubly Linked List

Double Ended Queue

Stack

Answer

Correct Answer: AVL Tree

Note: This Question is unanswered, help us to find answer for this one

123. A given connected graph G is a Euler graph if and only if all vertices of G are of ______.

the same degree

even degrees

odd degrees

different degrees

Answer

Correct Answer: even degrees

Note: This Question is unanswered, help us to find answer for this one

124. What is the meaning of the statement: "Entries in a stack are 'ordered'"?

A collection of stacks can be sorted

Stack entries may be compared with the '<' operation

The entries must be stored in a linked list

There is a first entry, a second entry, and so on

Answer

Correct Answer: There is a first entry, a second entry, and so on

Note: This Question is unanswered, help us to find answer for this one

125. Four characters are placed in a queue in the following order: D, C, B, and A. If they are removed one at a time, what will be the order of their removal?

ABCD

ABDC

DCAB

DCBA

Answer

Correct Answer: DCBA

Note: This Question is unanswered, help us to find answer for this one

126. Which of the following operations is performed more efficiently by the doubly linked list than by the linear linked list?

Deleting a node the location of which is given

Searching an unsorted list for a given item

Inserting a node after the node with a given location

Traversing the list to process each node

Answer

Correct Answer: Deleting a node the location of which is given

Note: This Question is unanswered, help us to find answer for this one

127. You have implemented a queue with a linked list keeping track of a front pointer and a rear pointer. Which of these pointers will you change during an insertion into a NONEMPTY queue?

Neither of them changes

Only front_ptr changes

Only rear_ptr changes

Both change

Answer

Correct Answer: Only rear_ptr changes

Note: This Question is unanswered, help us to find answer for this one

128. Which of the following techniques is used to resolve collision in hashing?

Separate chaining

Open addressing

Linear probing

All of the above

Answer

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

129. The number of nodes in the largest maximal independent set of the complete bipartite graph K(4,2) is_____ .

Answer

Correct Answer: 4

Note: This Question is unanswered, help us to find answer for this one

130. What kind of initialization needs to be done for a chained hash table?

None

The key at each array location must be initialized

The head pointer of each chain must be set to NULL

Both B and C must be carried out

Answer

Correct Answer: Both B and C must be carried out

Note: This Question is unanswered, help us to find answer for this one

131. Which queue allows insertion and deletion at both ends?

Simple queue

Circular queue

Dequeue

Special queue

Answer

Correct Answer: Circular queue

Note: This Question is unanswered, help us to find answer for this one

132. The operation for removing an entry from a stack is traditionally called _______.

delete

peek

pop

remove

Answer

Correct Answer: pop

Note: This Question is unanswered, help us to find answer for this one

133. Which of the operations is simpler in the doubly linked list than it is in the simple linked list?

Insertion

Deletion

Both a and b

None of the above

Answer

Correct Answer: Both a and b

Note: This Question is unanswered, help us to find answer for this one

134. In a graph G having the cut set matrix C(G) and an incidence matrix A(G), the rank of C(G) would be____

The same as that of A(G)

More than that of A(G)

Less than that of A(G)

Independent of the rank of A(G)

Answer

Correct Answer: More than that of A(G)

Note: This Question is unanswered, help us to find answer for this one

135. How many real links are required for a sparse matrix having 10 rows, 10 columns and 15 non-zero elements? (Pick the nearest answer)

100

Answer

Correct Answer: 50

Note: This Question is unanswered, help us to find answer for this one

136. Which of the following statements about binary trees is false?

Every Node must have at least two children

Every non-empty tree has exactly one root node

Every node has at the most two children

None of the above

Answer

Correct Answer: Every Node must have at least two children

Note: This Question is unanswered, help us to find answer for this one

137. Which operations require linear time for their worst-case behavior in the linked-list version of a queue?

front

push

empty

None of these operations require linear time

Answer

Correct Answer: empty

Note: This Question is unanswered, help us to find answer for this one

138. Let A be a sorted array of n=10 elements. Assume that only one comparison is required to determine whether the target is equal to, less than, or greater than A[i]. Which of the following denotes the average successful time of finding an arbitrary element x in A using the binary search?

1.6

2.5

4.2

5.5

Answer

Correct Answer: 2.5

Note: This Question is unanswered, help us to find answer for this one

139. A simple graph in which there exists an edge between every pair of vertices is called a/an _________.

incomplete graph

complete graph

Euler graph

planner graph

Answer

Correct Answer: complete graph

Note: This Question is unanswered, help us to find answer for this one

140. A one dimensional array A has indices 1...75. Each element is a string and takes up three memory words. The array is stored starting at location 1120 decimal. The starting address of A[49] is:

1267

1164

1264

1169

Answer

Correct Answer: 1264

Note: This Question is unanswered, help us to find answer for this one

141. A circuit which is a connected graph and which includes every vertex of the graph is known as_____.

Euler

Unicursal

Hamiltonian

Clique

Answer

Correct Answer: Hamiltonian

Note: This Question is unanswered, help us to find answer for this one

142. A non- planar graph with the minimum number of vertices has:

10 edges, 5 vertices

9 edges, 6 vertices

6 edges, 4 vertices

9 edges, 5 vertices

Answer

Correct Answer: 9 edges, 6 vertices

Note: This Question is unanswered, help us to find answer for this one

143. What is the worst-case scenario for quicksort to sort an array of n elements?

O(log n)

O(n)

O(n log n)

O(n2)

Answer

Correct Answer: O(n2)

Note: This Question is unanswered, help us to find answer for this one

144. If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

data[0]

data[n-1]

data[n]

data[2*n + 1]

Answer

Correct Answer: data[0]

Note: This Question is unanswered, help us to find answer for this one

145. State whether True or False. For all possible inputs, a linear algorithm to solve a problem must perform faster than a quadratic algorithm to solve the same problem.

True

False

Answer

Correct Answer: True

Note: This Question is unanswered, help us to find answer for this one

146. A procedure that calls itself in a program is called _______.

Repeat

Loop

Recursion

Tree

Answer

Correct Answer: Recursion

Note: This Question is unanswered, help us to find answer for this one

147. In which data structure is the concept of rotation used?

Binary search tree

Circular queue

AVL tree

Circular linked list

Answer

Correct Answer: AVL tree

Note: This Question is unanswered, help us to find answer for this one

148. Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:

Answer

Correct Answer: 2

Note: This Question is unanswered, help us to find answer for this one

149. What is the worst-case scenario for mergesort to sort an array of n elements?

O(log n)

O(n)

O(n log n)

O(n2)

Answer

Correct Answer: O(n log n)

Note: This Question is unanswered, help us to find answer for this one

150. If X is the adjacency matrix of a graph G with no self loops, the entries along the principle diagonal of X are ______.

all zeros

all ones

both zeros and ones

different

Answer

Correct Answer: both zeros and ones

Note: This Question is unanswered, help us to find answer for this one

151. What is true of the complete bipartite graphs K(3,3) and K(2,4)?

Both are planar

Neither is a planar

Both are isomorphic

None of these

Answer

Correct Answer: None of these

Note: This Question is unanswered, help us to find answer for this one

152. What is the minimum number of nodes in a complete binary tree with depth 3?

Answer

Correct Answer: 15

Note: This Question is unanswered, help us to find answer for this one

153. Which term is used to describe an O(n) algorithm?

Constant

Linear

Logarithmic

Quadratic

Answer

Correct Answer: Linear

Note: This Question is unanswered, help us to find answer for this one

154. Where does the push member function place the new entry on the linked list in the linked list implementation of a queue?

At the head

At the tail

After all other entries that are greater than the new entry

After all other entries that are smaller than the new entry

Answer

Correct Answer: At the tail

Note: This Question is unanswered, help us to find answer for this one

155. Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?

Pre-order traversal

Post-order traversal

In order traversal

Top-down traversal

Answer

Correct Answer: In order traversal

Note: This Question is unanswered, help us to find answer for this one

156. One difference between a queue and a stack is:

Queues require dynamic memory but stacks do not

Stacks require dynamic memory but queues do not

Queues use two ends of the structure but stacks use only one

Stacks use two ends of the structure but queues use only one

Answer

Correct Answer: Queues use two ends of the structure but stacks use only one

Note: This Question is unanswered, help us to find answer for this one

157. The post-order traversal of a binary tree starts with:

Post-order traversal of the left sub tree

Post-order traversal of the right sub tree

Post-order traversal of the root

Post-order traversal of the lowest node

Answer

Correct Answer: Post-order traversal of the left sub tree

Note: This Question is unanswered, help us to find answer for this one

158. Which situation occurs frequently if the selected hash function is poor?

Overflow

Underflow

Collision

None of the above

Answer

Correct Answer: Collision

Note: This Question is unanswered, help us to find answer for this one

159. The linked list implementation of sparse matrices is superior to the generalized dope vector method because it is __________.

conceptually easier and completely dynamic

efficient if the sparse matrix is a band matrix

efficient in accessing an entry

all of these

Answer

Correct Answer: all of these

Note: This Question is unanswered, help us to find answer for this one

160. Which information is not saved in the activation record when a function call is executed?

Current depth of recursion

Formal parameters

Location where the function should return when done

Local variables

Answer

Correct Answer: Current depth of recursion

Note: This Question is unanswered, help us to find answer for this one

161.
In a graph G, F is a spanning forest of G if

(i)F is a subgraph of G containing all the nodes of G
(ii)F is an order forest containing trees T1,T2,...Tn
(iii)Ti contains all the nodes that are reachable in G from the root Ti and are contained in Tj for some j

Which of the above conditions is/are true?

(i),(ii)

(ii),(iii)

(i),(iii)

(i),(ii) and (iii)

Answer

Correct Answer: (i),(ii) and (iii)

Note: This Question is unanswered, help us to find answer for this one

162. In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the path counts 1. Assume log(n) is log base 2.

about log(n)

about 2*log(n)

about 3*log(n)

about 4*log(n)

Answer

Correct Answer: about 2*log(n)

Note: This Question is unanswered, help us to find answer for this one

163. Suppose X is a B-tree leaf containing 41 entries and has at least one sibling. Which of the statements would be true in this case?

Any sibling of X is also a leaf

Any sibling of X contains at least 41 entries

The parent of X has exactly 42 entries

X has at least 41 siblings

Answer

Correct Answer: Any sibling of X is also a leaf

Note: This Question is unanswered, help us to find answer for this one

164. Consider a linked list of n elements which is pointed by an external pointer. What is the time taken to delete the element which is a successor of the pointed element by a given pointer?

O(1)

O(log2n)

O(n)

O(n*log2n)

Answer

Correct Answer: O(1)

Note: This Question is unanswered, help us to find answer for this one

165. In a complete binary tree, the parent of any node k can be determined by ________.

2k

2k+1

K/2

2K-1

Answer

Correct Answer: K/2

Note: This Question is unanswered, help us to find answer for this one

166. The recurrence relation T(n)=mT(n/2)+an2 is satisfied by___

T(n)=O(nm)

T(n)=O(m*log(m))

T(n)=O(n*log(m))

T(n)=O(m*log(n))

Answer

Correct Answer: T(n)=O(n*log(m))

Note: This Question is unanswered, help us to find answer for this one

167. What is the worst-case scenario for heapsort to sort an array of n elements?

O(log n)

O(n)

O(n log n)

O(n2)

Answer

Correct Answer: O(n log n)

Note: This Question is unanswered, help us to find answer for this one

168. Which additional requirement is placed on an array so that binary search may be used to locate an entry?

The array elements must form a heap

The array must have at least 2 entries

The array must be sorted

The array's size must be a power of two

Answer

Correct Answer: The array must be sorted

Note: This Question is unanswered, help us to find answer for this one

169. What is the maximum number of statements that may be recursive calls in a single function declaration?

1

2

n (n is the argument)

There is no fixed maximum

Answer

Correct Answer: There is no fixed maximum

Note: This Question is unanswered, help us to find answer for this one

170. A graph in which all nodes are of an equal degree is known as:

Multigraph

Non - regular graph

Regular graph

Complete graph

Answer

Correct Answer: Regular graph

Note: This Question is unanswered, help us to find answer for this one

171. What is the best definition of a collision in a hash table?

Two entries are identical except for their keys

Two entries with different data have exactly the same key

Two entries with different keys have exactly the same hash value

Two entries with exactly the same key have different hash values

Answer

Correct Answer: Two entries with different keys have exactly the same hash value

Note: This Question is unanswered, help us to find answer for this one

172. In which dynamically created linked list can the first node be recovered after moving to the second node?

Simple linked list

Circular linked list

Doubly linked list

Both b and c

Answer

Correct Answer: Both b and c

Note: This Question is unanswered, help us to find answer for this one

173. A chained hash table has an array size of 512. What is the maximum number of entries that can be placed in the table?

511

512

1024

There is no maximum limit

Answer

Correct Answer: There is no maximum limit

Note: This Question is unanswered, help us to find answer for this one

174. What is the formulae to find maximum number of nodes n in a perfect binary tree?

2h + 1 - 1

2h + 1

2h

2h + 1 + 1

Answer

Correct Answer: 2h + 1 - 1

Note: This Question is unanswered, help us to find answer for this one

175. In which data structure do the insertion and deletion take place at the same end?

Linked list

Tree

Stack

Linked list of stack

Answer

Correct Answer: Stack

Note: This Question is unanswered, help us to find answer for this one

176. Suppose T is a complete binary tree with 14 nodes. What would be the minimum possible depth of T?

3

4

5

Answer

Correct Answer: 3

Note: This Question is unanswered, help us to find answer for this one

177. The minimum number of interchanges needed to convert the array 89,19,14,40,17,12,10,2,5,7,11,6,9,70 into a heap with the maximum element at the root is:

0

1

2

3

Answer

Correct Answer: 2

Note: This Question is unanswered, help us to find answer for this one

178. What is the value of the post-fix expression 6 3 2 4 + - *?

Something between -15 and -100

Something between -5 and -15

Something between 5 and 15

Something between 15 and 100

Answer

Correct Answer: Something between -15 and -100

Note: This Question is unanswered, help us to find answer for this one

179. Which of the following applications may use a stack?

A parentheses balancing program

Keeping track of local variables at run time

Syntax analyzer for a compiler

All of the above

Answer

Correct Answer: All of the above

Note: This Question is unanswered, help us to find answer for this one

180. Which of the following is false?

A binary search begins with the middle element in the array

A binary search continues halving the array either until a match is found or until there are no more elements to search

If the search argument is greater than the value located in the middle of the binary, the binary search continues in the lower half of the array

Answer

Correct Answer: If the search argument is greater than the value located in the middle of the binary, the binary search continues in the lower half of the array

Note: This Question is unanswered, help us to find answer for this one

181. For a complete binary tree with depth d, the total number of nodes is:

2d+1

2d

2d+1-1

2d2

Answer

Correct Answer: 2d+1-1

Note: This Question is unanswered, help us to find answer for this one

182.
Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the push member function place the new entry in the array?

data[1]

data[2]

data[11]

data[12]

Answer

Correct Answer: data[12]

Note: This Question is unanswered, help us to find answer for this one

183.
Here is a code for an integer variable n

   while (n > 0)
   {
     n = n/10; // Use integer division
   }
What is the worst case scenario analysis for the above loop?

O(1)

O(log n)

O(n)

O(n2)

Answer

Correct Answer: O(log n)

Note: This Question is unanswered, help us to find answer for this one

184. Tree algorithms typically run in time O(d) . What is d?

The depth of the tree

The number of divisions at each level

The number of nodes in the tree

The total number of entries in all the nodes of the tree

Answer

Correct Answer: The depth of the tree

Note: This Question is unanswered, help us to find answer for this one

185. What happens if you make a recursive call without making the problem smaller?

The operating system detects the infinite recursion because of the "repeated state"

The program keeps running until you press Ctrl-C

The results are non-deterministic

The run-time stack overflows, halting the program

Answer

Correct Answer: The run-time stack overflows, halting the program

Note: This Question is unanswered, help us to find answer for this one

186. Which feature of heaps allows them to be efficiently implemented using a partially filled array?

Heaps are binary search trees

Heaps are complete binary trees

Heaps are full binary trees

Heaps contain only integer data

Answer

Correct Answer: Heaps are complete binary trees

Note: This Question is unanswered, help us to find answer for this one

187. What is the minimum number of edges which must be removed from a complete bipartite graph of six nodes K(6) so that the remaining graph is a planar?

2

3

4

6

Answer

Correct Answer: 6

Note: This Question is unanswered, help us to find answer for this one

188. A simple graph with n vertices and k components can have at the most _______.

n edges

n-k edges

(n-k)(n-k-1)/2 edges

(n-k)(n-k+1)/2 edges

Answer

Correct Answer: (n-k)(n-k+1)/2 edges

Note: This Question is unanswered, help us to find answer for this one

189. Which graph traversal algorithm uses a queue to keep track of the vertices which need to be processed?

Breadth-first search

Depth-first search

Answer

Correct Answer: Breadth-first search

Note: This Question is unanswered, help us to find answer for this one

190. A full binary tree with 2n+1 nodes contains:

n-1 leaf nodes

n non-leaf nodes

n-1 non-leaf nodes

n leaf nodes

Answer

Correct Answer: n non-leaf nodes

Note: This Question is unanswered, help us to find answer for this one

191. You have a file with 4 billion 32-bit integers. The distribution of the integers is random but uniform. You are supposed to find a number NOT in the file. If you created a bit array and used the index to that array to determine if a number existed in the file approximately how much memory would you need?

2 Gigabytes

512 Megabytes

16 Gigabytes

1024 Megabytes

128 Gigabytes

Answer

Correct Answer: 512 Megabytes

Note: This Question is unanswered, help us to find answer for this one

192. What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink, and all integer capacities on edges? Assume the graph G = (V,E) has a finite, integer maximum flow value of f.

O(|E|^2|V|)

O(|V|)

O(|E|f)

O(|E||V|)

O(|E|)

Answer

Correct Answer: O(|E|f)

Note: This Question is unanswered, help us to find answer for this one

193. What is the worst-case time complexity of finding a maximum cardinality matching in a bipartite graph G = (V,E)?

O(|E||V|)

O(|E| + |V|)

O(|E|*sqrt(|V|))

O(|E|^2|V|^2)

O(|V|)

Answer

Correct Answer: O(|E|*sqrt(|V|))

Note: This Question is unanswered, help us to find answer for this one

194. The path length from a node to the deepest leaf under it is the _________.

Size

Height

Depth

Set

Answer

Correct Answer: Height

Note: This Question is unanswered, help us to find answer for this one

195. If a node having two children is deleted from a binary tree, it is replaced by its:

Preorder predecessor

Inorder successor

Suborder successor

Inorder predecessor

Answer

Correct Answer: Inorder successor

Note: This Question is unanswered, help us to find answer for this one

196. Can Dijkstra's be used to find the longest-path in a graph?

No, they can't

Yes, with a slight modification to the algorithm.

Yes, by multiplying each edge in the graph by -1, and finding the shortest-path.

Answer

Correct Answer: No, they can't

Note: This Question is unanswered, help us to find answer for this one

197. Which sort will you use if you want to optimize sorting time?

Insertion sort

Quick sort

Bubble sort

Merge sort

Answer

Correct Answer: Merge sort

Note: This Question is unanswered, help us to find answer for this one

198. Which is the best possible complexity to sort an array?

O(NlogN)

O(N*N)

O(1)

O(logN)

O(N)

Answer

Correct Answer: O(NlogN)

Note: This Question is unanswered, help us to find answer for this one

199. A technique for direct search is _______.

Linear search

Tree search

Hashing

Binary search

Answer

Correct Answer: Hashing

Note: This Question is unanswered, help us to find answer for this one

200. Which is a way of organizing data that considers not only the items stored, but also their relationship to each other?

Database table

Algorithm

Database

Data Structure

Answer

Correct Answer: Data Structure

Note: This Question is unanswered, help us to find answer for this one

201. Heapsort's worst case performance is

O(n^2)

O(n * log n)

O(n)

O(1)

O(n^2 * log n)

Answer

Correct Answer: O(n * log n)

Note: This Question is unanswered, help us to find answer for this one

202. Worst case insert for a dynamic array is

O(n^2)

O(1)

O(log n)

O(n)

Answer

Correct Answer: O(n)

Note: This Question is unanswered, help us to find answer for this one

203. What is the correct order for a in-order binary tree traversal?

Right Child - Parent - Left Child

Left Child - Parent - Right Child

Parent - Left Child - Right Child

Left Child - Right Child - Parent

Answer

Correct Answer: Left Child - Parent - Right Child

Note: This Question is unanswered, help us to find answer for this one

204. The path length from root to farthest leaf node is the ______ of the tree.

Set

Height

Size

Depth

Answer

Correct Answer: Depth

Note: This Question is unanswered, help us to find answer for this one

205. Which data structure provides the fastest lookup time

HashMap

Fibonacci heap

Sorted list

B-tree

Doubly-linked list

Answer

Correct Answer: HashMap

Note: This Question is unanswered, help us to find answer for this one

206. What is the time complexity to insert an item into a B-Tree?

O(1)

O(N^2)

O(log N)

O(N)

O(N * log N)

Answer

Correct Answer: O(log N)

Note: This Question is unanswered, help us to find answer for this one

207. What is the minimum number of queues needed to implement a priority queue?

Ten

Once

Three

Two

Answer

Correct Answer: Two

Note: This Question is unanswered, help us to find answer for this one

208. In tree there may be more than one path from root to leaf node

False

True

Answer

Correct Answer: False

Note: This Question is unanswered, help us to find answer for this one

209. A balanced binary search tree search average output is

O(n^2)

O(n * log n)

O(log n)

O(n)

O(1)

Answer

Correct Answer: O(log n)

Note: This Question is unanswered, help us to find answer for this one

210. Which of the following problems has the fastest algorithms?

Find the 2nd largest value in an array

Find the 2nd smallest value in an array

Find the maximum value in an array.

Find the median value in an array

Answer

Correct Answer: Find the maximum value in an array.

Note: This Question is unanswered, help us to find answer for this one

211. Bubble sort's worst case performance is

O(log n)

O(n^3)

O(n^2)

O(1)

O(n)

Answer

Correct Answer: O(n^2)

Note: This Question is unanswered, help us to find answer for this one

212. What is the time complexity to compute the average of a N×M matrix?

O(N^2)

It depends on how both N and M vary.

O(N*M)

O(N+M)

Answer

Correct Answer: O(N*M)

Note: This Question is unanswered, help us to find answer for this one

213. Which is a collection of distinct unordered elements with a common type and no duplicates?

Set

Stack

Sequence

Structure

Answer

Correct Answer: Set

Note: This Question is unanswered, help us to find answer for this one

214. In which of the following areas is data structures NOT applied extensively?

Compiler design

Simulation

Website design

Graphics

Answer

Correct Answer: Website design

Note: This Question is unanswered, help us to find answer for this one

215. Collision resolution is not required if a hash function is perfect

True

False

Answer

Correct Answer: True

Note: This Question is unanswered, help us to find answer for this one

216. What is the data structures used to perform recursion?

Heap

Linked List

Stack

Queue

Answer

Correct Answer: Stack

Note: This Question is unanswered, help us to find answer for this one

217. What is the data structure used to perform recursion?

Array

Binary Tree

B-tree

Stack

Answer

Correct Answer: Stack

Note: This Question is unanswered, help us to find answer for this one

218. A perfect hash function is

maps each hash value to a different valid input

maps each valid input to a different hash value

not possible

Answer

Correct Answer: maps each valid input to a different hash value

Note: This Question is unanswered, help us to find answer for this one

219. Which is an access mechanism that transforms the search key into a storage address, thereby providing very fast access to stored data?

Pointers

Recursion

Binary Search

Hashing

Answer

Correct Answer: Hashing

Note: This Question is unanswered, help us to find answer for this one

220. Which of the following is NOT a basic function of a linked list?

Deletion of a leaf

Creation of a list

Insertion of a node

Deletion of a node

Answer

Correct Answer: Deletion of a leaf

Note: This Question is unanswered, help us to find answer for this one

221. A stack must always be implemented using an array

False

True

Answer

Correct Answer: False

Note: This Question is unanswered, help us to find answer for this one

222. What is the running time of finding Nth element in array using quick sort? (For example: Find the 4th smallest element in an unsorted array.)

n!

2 ^ n

n * log(n)

n ^ 3

n ^ 2

Answer

Correct Answer: n * log(n)

Note: This Question is unanswered, help us to find answer for this one

223. Which is an ordered collection of elements in which insertions are restricted to the rear end and deletions are restricted to the front end?

Stack

Binary tree

Queue

Array

Answer

Correct Answer: Queue

Note: This Question is unanswered, help us to find answer for this one

224. BFS and DFS are two types of

Sorting algorithms

Searching algorithms

computational complexity measurements

Answer

Correct Answer: Searching algorithms

Note: This Question is unanswered, help us to find answer for this one

225. All binary trees are balanced

True

False

Answer

Correct Answer: False

Note: This Question is unanswered, help us to find answer for this one

226. The most common solution to the Towers of Hanoi involves the use of which datastructure

Hashtable

Set

Stack

Queue

Answer

Correct Answer: Stack

Note: This Question is unanswered, help us to find answer for this one

227. A(n) ______ is the data structure used more than any other data structure.

Binary Tree

Array

Linked List

B-tree

Answer

Correct Answer: Array

Note: This Question is unanswered, help us to find answer for this one

228. What is the difference between the stack and queue data structures?

Stack requires recursive search technique; Queue does not.

Stack uses selection sort; Queue uses bubble sort.

Stack is LIFO; Queue is FIFO.

Stack is FIFO; Queue is LIFO.

Answer

Correct Answer: Stack is LIFO; Queue is FIFO.

Note: This Question is unanswered, help us to find answer for this one

229. Which starts with an empty list and adds elements one-by-one to create a sorted list?

Insertion sort

Selection sort

Bubble sort

Quicksort

Answer

Correct Answer: Insertion sort

Note: This Question is unanswered, help us to find answer for this one

230. Minimum number of queues needed to implement the priority queue?

One.

Two. One queue is used for actual storing of data and another for storing priorities.

Three.

Four.

Answer

Correct Answer: Two. One queue is used for actual storing of data and another for storing priorities.

Note: This Question is unanswered, help us to find answer for this one

231. What is the most suitable data structure for a situation where tasks must be scheduled for execution on a computer and the tasks include system tasks?

Tree

Array

Linked List

Priority Queue

Answer

Correct Answer: Priority Queue

Note: This Question is unanswered, help us to find answer for this one

232. Can a binary tree be implemented using an array?

Yes

No

Answer

Correct Answer: Yes

Note: This Question is unanswered, help us to find answer for this one

233. What is the process a procedure goes through when one of the steps of the procedure involves invoking the procedure itself?

Induction

Recursion

Sequencing

Looping

Answer

Correct Answer: Recursion

Note: This Question is unanswered, help us to find answer for this one

234. The smalled element of an array's index is called its:

Lower bound

Upper bound

Midpoint

Range

Answer

Correct Answer: Lower bound

Note: This Question is unanswered, help us to find answer for this one

235. Which is the most suitable data structure for hierarchical data models?

Priority Queue

Linked List

Tree

Array

Answer

Correct Answer: Tree

Note: This Question is unanswered, help us to find answer for this one

236. Which of the following data structures is efficient in tree construction?

Queue

Array

Stack

Linked List

Answer

Correct Answer: Linked List

Note: This Question is unanswered, help us to find answer for this one

237. Which represents data as a chain of nodes and provides dynamic growth of data?

Stack

Linked List

Sequence

Array

Answer

Correct Answer: Linked List

Note: This Question is unanswered, help us to find answer for this one

238. Which steps through an array sequentially until a match is found?

Hashing

Sequential Search

Fibonacci Search

Binary Search

Answer

Correct Answer: Sequential Search

Note: This Question is unanswered, help us to find answer for this one

239. What compares adjacent elements and exchanges them to put an array in order?

Insertion sort

Selection sort

Quicksort

Bubble sort

Answer

Correct Answer: Bubble sort

Note: This Question is unanswered, help us to find answer for this one

240. External sorting is a way of

sorting data that is too large to fit into RAM

sorting data without the usage of a recursive implementation

sorting data outside a specific performance bound

Answer

Correct Answer: sorting data that is too large to fit into RAM

Note: This Question is unanswered, help us to find answer for this one

Data Structures And Algorithms MCQs | Topic-wise

MCQ on Basic Data Structures and Algorithms MCQ on Data Management

MCQ on Data Transmission MCQ on Transmission Control Protocol
General Data Structures And Algorithms MCQs

Data Structures And Algorithms Subjects

Data Transmission MCQs

Data Management MCQs

Transmission Control Protocol MCQs

More Resources

Data Structures And Algorithms MCQ

Data Structures And Algorithms Skill Assessment

Data Structures And Algorithms PDF

Related MCQs

Data Warehousing MCQs

DB2 Administration MCQs

DB2 Programming MCQs

Delphi MCQs

DHTML MCQs

MCQ on Basic Data Structures and Algorithms	MCQ on Data Management
MCQ on Data Transmission	MCQ on Transmission Control Protocol
General Data Structures And Algorithms MCQs

Basic Data Structures and Algorithms MCQ

1. Infiniband can support data transfer speeds of ____ per second.

2. The __________ places new orders when inventory levels fall to predetermined points.

3. A(n) ____ control is any type of input mechanism on a form.

4. In a(n) ____________________ data type, each data item is a collection of other data items.

5. With a(n) ____, you perform an action or task, and then you perform the next action, in order.

6. With a hollow structure, the organization ____.

7. Members of a(n) ________ union have names, but the union itself has no name.

8. In a function template, the programmer substitutes ________ for ________.

9. Because “a” is always less than “b”, alphabetic sorts are ____ sorts.

10. A ____ read is an added statement that gets the first input value in a program.

11. When computers sort data, they always use ____ values when making comparisons between values.

12. Assume s is "abcabc", the method ________ returns an array of characters.

13. A collection in the items stored there are of different types is referred to as a(n) ________ type.

14. The ____ is skewed by a few very high or low values.

15. Structures can be stacked or connected to one another at their ____.

16. A(n) ____ tells the user what to enter.

17. A variable usually is passed into a method by ____.

18. A ____ is a rectangular area into which the user can type text.

19. A(n) ____ is shorthand for the detail you want to use in a search filter.

20. A(n) ______ is a process or set of operations in a calculation.

21. Two-dimensional arrays can be thought of as containing ________.

22. Suppose integer x = new integer(3); x holds ________.

23. The body of a ______-test loop is always executed at least once.

24. A variable defined inside a method is referred to as ________.

25. The ____ function is used to create a constant.

26. In comparison with unstructured information, semi-structured information ________.

27. A(n) ________ search uses a loop to sequentially step through an array.

28. A ________ search uses a loop to sequentially step through an array.

29. The rijndael algorithm is better known today as __________.

30. When working with multiple sets of data, one would typically use a ________.

31. Every node (except of the last node) in a singly linked list contains ____.

32. To arrange the elements in an array in ascending order, you use the ____ method.

33. The number of elements in an array is called the ____ of the array.

34. Programmers sometimes refer to a situation in which nothing goes wrong as the ____ case.

35. In all languages, subscript values must be sequential ____.

36. In a ____, items in a list are compared with each other in pairs.

37. If a one-dimensional array contains five elements, its highest subscript is ____.

38. Each element in a two-dimensional array requires ____ subscript(s) to reference it.

39. An array whose elements you can access using a single subscript is a ____ array.

40. When mathematicians use a two-dimensional array, they often call it a ____ or a table.

41. The starting value of an algorithm used to generate a range of numbers is called the _________.

42. The ________ function does the same thing as using the mathematical ∧ operator.

43. The following pseudocode is an example of ____.

44. When an array is passed to a function, it is actually ________ the array that is passed.

45. Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

46. A(n) ________ member variable may be accessed before any objects of the class have been declared.

47. A bubble sort is sometimes called a ____.

48. A ________ is used to travel through a linked list and search for data.

49. The ________ represents a special value that marks the end of a list of values.

50. After you create an array variable, you still need to ____ memory space.

51. If an exception occurs in a try-catch block, the code in the finally clause ________.

52. Fill in the code in comparable________ c = new date();

53. Before a structure variable can be created, the structure must be _________.

54. The expression score[5] is pronounced ________.

55. The elements of an array are stored in __________ storage locations in the computer?s memory.

56. A variable or a value listed in a call to a method is called ________.

57. A two-dimensional array can be viewed as ___________ and _____________.

58. A three-dimensional array can be thought of as ________ of two-dimensional arrays.

59. Data can be organized and processed sequentially using an array, called a(n) ____ list.

60. Selection sort requires ________ passes to put n data items in order.

61. To describe a queuing system, we use the term ____ for the object that provides the service.

62. A ____ is a copy that is kept in case values need to be restored to their original state.

63. The maximum number of entry points that any programming structure can have is ____.

64. Attaching structures end to end is called ____ structures.

65. Java.util.vector is a subtype of ________.

66. Arrays, unlike simple built-in types, are passed by ____.

67. A loop within another loop is known as a(n) ____ loop.

68. A loop must return to the ____ question at some later point in a structure.

69. When you derive a class from an existing class, you ________ add new data and functions.

70. The number of elements an array will hold is known as the ____ of the array.

71. When you return an array from a method, the method returns ________.

72. When you create a ____ report, the records must have been sorted in order by a key field.

73. When an array is sorted from highest to lowest, it is said to be in ________ order.

74. To build a list initially, you can use a(n) ________ routine.

75. The following pseudocode is an example of a ____ structure.

76. You use the ________ operator to access members of an object.

77. The sequential search algorithm uses a(n) ____ variable to track whether the item is found.

78. ________ is a data structure to store data in sequential order.

79. ________ allows for very recent file changes to be restored.

8. In a function template, the programmer substitutes for .

57. A two-dimensional array can be viewed as _ and ___.

102.

Quicksort is run on two inputs shown below to sort them in the ascending order.

i) 1,2,3,...n
ii) n,n-1,n-2,...2,1

If C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively, then

109.
Consider this binary search tree.
This question is based upon the figure shown below
Consider this binary search tree.
Which will be the new root if you remove the root and replace it with something from the left subtree?