Set 1

Question 1 of 100

A router running OSPF calculates the shortest path tree using:

Question 2 of 100

Which normal form eliminates transitive dependency?

Question 3 of 100

At resonance in a series RLC circuit:

Question 4 of 100

Which UML diagram is primarily used to represent interactions between users and a system?

Question 5 of 100

The data structure used by Breadth First Search is:

Question 6 of 100

In C, which operator is used to access a structure member through a pointer?

Question 7 of 100

Which memory is fastest among the following?

Question 8 of 100

The NPV of a project is considered acceptable when:

Question 9 of 100

Which gate is known as a universal gate?

Question 10 of 100

The balance factor of an AVL tree node can be:

Question 11 of 100

A language accepted by a finite automaton is always:

Question 12 of 100

Which protocol is responsible for translating domain names into IP addresses?

Question 13 of 100

A deadlock requires which of the following conditions?

Question 14 of 100

Which AI search algorithm guarantees an optimal solution when the heuristic is admissible?

Question 15 of 100

Thevenin's theorem converts a network into:

Question 16 of 100

Which software process model is best suited when requirements are frequently changing?

Question 17 of 100

The binary equivalent of decimal 45 is:

Question 18 of 100

Which cache mapping technique allows a block to be placed in any cache line?

Question 19 of 100

The pumping lemma for regular languages is mainly used to:

Question 20 of 100