Explore topic-wise MCQs in Testing Subject.

This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.

1.

Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficienty?

A. bubble sort
B. selection sort
C. insertion sort
D. merge sort
Answer» C. insertion sort
Discussion
2.

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

A. node
B. link
C. variable
Answer» C. variable
Discussion
3.

An array is referenced by its name.Similarly,a linked list is referenced by____

A. address of the first node
B. address of the last node
C. both (a)and(b)
D. none of these
Answer» B. address of the last node
Discussion
4.

Total number of comparision in bubble sort is____

A. o(nlogn)
B. o(n2)
C. o(n)
D. none of these
Answer» C. o(n)
Discussion
5.

Given a file size n the number of times a given file is passed through in bubble sort is____

A. n2
B. n-1
C. nlogn
D. logn
Answer» B. n-1
Discussion
6.

How will you print\n on screen?

A. printf("\\n");
B. printf(\\\n\);
C. echo\\\\n;
D. printf("\\\\n");
Answer» E.
Discussion
7.

Array is

A. data in physical order
B. data in logical order
C. both a& b
D. none of the above
Answer» B. data in logical order
Discussion
8.

The smallest element of an array’s index is called its

A. lower bound
B. upper bound
C. range
D. extraction
Answer» B. upper bound
Discussion
9.

The advantages of linked list over an array for representing a list is________

A. space used is less
B. deletion is easier
C. insertion is easier
D. both (a) and (b)
Answer» E.
Discussion
10.

The result of 0001 1010

A. 0101 1100
B. 0110 1000
C. 0001 1110
D. none of these
Answer» C. 0001 1110
Discussion
11.

It exports a set of operations

A. true, false
B. false, true
C. true, true
D. false, false
Answer» D. false, false
Discussion
12.

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

A. true, false, true
B. true, true, false
C. true, true, true
D. false, true, true
Answer» C. true, true, true
Discussion
13.

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

A. true, false
B. false, true
C. false, false
D. true, true
Answer» E.
Discussion
14.

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

A. true, true
B. false, true
C. false, false
D. true, false
Answer» B. false, true
Discussion
15.

To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

A. i-only
B. ii-only
C. both i and ii
D. none of both
Answer» D. none of both
Discussion
16.

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

A. a-iii, b-ii, c-i
B. a-i, b-ii, c-iii
C. a-iii, b-i, c-ii
D. a-i, b-iii, c-ii
Answer» D. a-i, b-iii, c-ii
Discussion
17.

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

A. true, true
B. true, false
C. false, true
D. false, false
Answer» D. false, false
Discussion
18.

A node is child node if out degree is one.

A. true, true
B. true, false
C. false, true
D. false, false
Answer» C. false, true
Discussion
19.

Insertion b) Deletion c) Retrieval d) Traversal

A. only a,b and c
B. only a and b
C. all of the above
D. none of the above
Answer» E.
Discussion
20.

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

A. true, false
B. false, true
C. true, true
D. false, false
Answer» D. false, false
Discussion
21.

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
Answer» B. counting the minimum memory needed by the algorithm
Discussion
22.

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

A. counting microseconds
B. counting the number of key operations
C. counting the number of statements
D. counting the kilobytes of algorithm
Answer» C. counting the number of statements
Discussion
23.

Two main measures for the efficiency of an algorithm are

A. processor and memory
B. complexity and capacity
C. time and space
D. data and space
Answer» D. data and space
Discussion
24.

________ is the problem of deciding whether or not a given String pattern P appears in a text T.

A. pattern matching
B. searching
C. sorting
D. deletion
Answer» B. searching
Discussion
25.

_________ operation of word processing involves replacing one string in the text by another.

A. insertion
B. deletion
C. searching
D. replacement
Answer» E.
Discussion
26.

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

A. length
B. breath
C. width
D. none
Answer» D. none
Discussion
27.

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

A. main strings
B. substring
C. index
D. block
Answer» C. index
Discussion
28.

String with zero characters is called ________ string.

A. null
B. binary
C. totalled
D. list
Answer» B. binary
Discussion
29.

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

A. memory addressable
B. byte addressable
C. bit
D. byte
Answer» C. bit
Discussion
30.

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

A. array
B. list
C. string
D. block
Answer» D. block
Discussion
31.

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

A. character
B. integer
C. float
D. numeric
Answer» B. integer
Discussion
32.

Computers are used for processing numerical data called _______ data.

A. float
B. local
C. character
D. non-local
Answer» D. non-local
Discussion