020/2023 - Junior Manager (Information Management)

Question 1

Which of the following is the time complexity of the given program ?
void sample (int n)
{
int p,q,r,c=0;
for (p=n/2; p

Accepted Answer

O(n² log n)

Answer

O(log n)

Answer

O(n log n)

Answer

O(n²)

Question 2

Which of the following is the correct postfix expression corresponding to the given infix expression ? A + B – C*D + (E^F)* G/H/I * J + K

Accepted Answer

AB + CD* – EF^ G*H/I/J *+ K+

Answer

AB + – * CD+*^ EF/G/H*I J*+ K

Answer

AB – + C*D+ E^F * G/H/I * J K+

Answer

AB + – C*D+ E^F * G/H/I* J K+

Question 3

Which of the following statement(s) is/are true relating to linked lists ?
I. more memory is required in the linked list as compared to an array.
II. direct access to an element is not possible in a linked list as in an array by index.
III. There is no need to shift elements after the insertion or deletion of an element only the address present in the next pointer needs to be updated.

Accepted Answer

AII of the above

Answer

Only I and II

Answer

Only III

Answer

None of the above

Question 4

Which among the following statement(s) is/are not correct regarding the properties of the binary trees ?
1. The number of leaf nodes l in a perfect binary tree, is l = (n + 1)/2.
2. A full binary tree with l leaves has 2l + 1nodes (n).
3. The number of null links (i.e. , absent children of the nodes) in a binary tree of n nodes is (n – 1)

Accepted Answer

Only 2 and 3

Answer

Only 1 and 3

Answer

Only 1

Answer

Only 2

Question 5

Consider the following statements about AVl trees :
I. Searching for a specific key in an AVL tree can be done the same way as that of any balanced or unbalanced binary search tree.
II. Once a node has been found in an AVl tree, the next or previous node can be accessed in amortized constant time.
III. The retracing can stop if the balance factor becomes (+/–) 1 implying that the height of that sub tree remains unchanged.
Which among the above statement(s) is/are not correct ?

Accepted Answer

Only III

Answer

Only I

Answer

Only II and III

Answer

All of the above

Question 6

Which of the following is/are correct relating to the possible multiplicity property of MST ?
1. If all the edge weights of a graph are the same, then every spanning tree of that graph is the minimum.
2. If each edge has a distinct weight then there will be only one, unique minimum spanning tree.
3. If the weights are positive, then a minimum spanning tree is a minimum cost subgraph connecting all vertices.

Accepted Answer

Only 1 and 2

Answer

Only 1

Answer

Only 2 and 3

Answer

Only 3

Question 7

Which of the following statement(s) is/are correct relating to double hashing ?
a. The interval between probes is fixed (usually 1).
b. The interval between probes is increased by adding the successive outputs of a quadratic polynomial to the value given by the original hash computation.
c. The interval between probes is computed by a secondary hash function.

Accepted Answer

Only c

Answer

All of the above

Answer

Only a and c

Answer

Only a

Question 8

Which of the following are the two key attributes that a problem must have in dynamic programming to be applicable ?
1. Overlapping sub-problems
2. Non-overlapping sub-problems
3. Optimal substructure
4. divide and Conquer

Accepted Answer

1 and 3

Answer

1 and 2

Answer

1 and 4

Answer

2 and 3

Question 9

Which of the following statement(s) is/are correct regarding greedy algorithms ?
i. The choice made by a greedy algorithm may depend on choices made so far, but not on future choices or all the solutions to the sub-problem.
ii. A greedy algorithm never reconsiders its choices.
iii. Greedy algorithms produce good solutions to some mathematical problems, but not to others.

Accepted Answer

All of the above

Answer

Only i

Answer

Only ii

Answer

None of the above

Question 10

Which of the following statement(s) is/are correct about mongodB horizontal scaling ?
a. It refers to bringing on additional nodes to share the load.
b. This allows them to be distributed across nodes more simply, as queries do not have to “join” them together across nodes.
c. It refers to increasing the processing power of a single server or cluster.
d. It is a good option to try first if massive storage and processing are not required.

Accepted Answer

Only a and b

Answer

Only b and c

Answer

All of the above

Answer

Only c

Question 11

Consider the following statements :
i. It is a database management system based on the relational model.
ii. Entity type refers to the collection of the entity that shares a common definition.
iii. Stores data in entities, defined as tables that hold specific information.
iv. Stores data as well as methods.
Which among the above statement(s) is/are correct regarding the OODBMS ?

Accepted Answer

Only iv

Answer

Only i and ii

Answer

Only iii

Answer

Only ii

Question 12

Which of the following is/are not a concurrency control technique(s) ?
a. Locking
b. Time stamping
c. Normalization
d. Optimistic method

Accepted Answer

Only c

Answer

All of the above

Answer

Only a and b

Answer

Only a

Question 13

Which of the following is not the utility of DBMS ?
1. Loading
2. Recovery
3. File organization
4. Backup

Accepted Answer

None of the above

Answer

Only 1 and 4

Answer

Only 1 and 3

Answer

All of the above

Question 14

Which of the following is used to manipulate Oracle database structures, including tables ?

Accepted Answer

Data Definition Language (DDL)

Answer

Data Manipulation Language (DML)

Answer

DML and DDL

Answer

None of the above

Challenge Yourself

Practice Mode

Mock Test

020/2023 - Junior Manager (Information Management)