In Kruskal's algorithm, the next ________ is not added to viable set A, if its adding induce a/an cycle.

• A) Cycle
• B) Vertex
• C) Edge
• D) Tree

The breadth-first-search algorithm is a shortest-path algorithm that works on__________graphs.

• A) Directed
• B) Un-directed
• C) Weighted
• D) Un-weighted

Once you enter a strong component, every vertex in the
component is _________.

• A) reachable
• B) reachable some times
• C) removed
• D) not reachable

In Timestamped DFS, No back edges means ___________.

• A) BFS
• B) DFS
• C) no cycles
• D) 1 cycle

The time complexity to compute Graph transpose G^T is (V+E), if you have ______________ for G.

• A) stack
• B) an adjacency list
• C) Array list
• D) complete list

Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the __________ has relatively few __________.

• A) tree, edges
• B) tree, branches
• C) graph, edges
• D) graph, branches

Dijkstra’s algorithm is a simple________ algorithm for computing the single-source shortest-paths to all other vertices.

• A) Greedy
• B) Brute-Force
• C) Divide and conquer
• D) Bellman-Ford

What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?

• A) O(V+E)
• B) O(V)
• C) O(log E)
• D) O(log V)

A fully connected undirected graph of 5 nodes will have _________ edges.

• A) 15
• B) 4
• C) 5
• D) 10

In Prim's algorithm, If the color of a vertex is __________,then it is in S otherwise not.

• A) Black
• B) Gray
• C) White
• D) Blue

An un-weighted graph can be considered as a graph in which every edge has weight_______unit.

• A) 1
• B) 3
• C) 7
• D) 5

The method of dividing and assigning different portions of a large system to different groups for construction is called ________ .

• A) Working Boundary Structure
• B) Work Breakdown Structure
• C) Work Breakdown System
• D) Work Basic Structure

How can we implement generalization in Object Oriented programming languages?

• A) Polymorphism
• B) Abstraction
• C) Inheritance
• D) Encapsulation

In multiprocessing applications, different execution threads may pass information to one another by sending _____________________ to each other.

• A) Synchronous messages
• B) System calls
• C) Interrupt calls
• D) Asynchronous messages

________________ pointed out the elegant conceptual integrity exhibited by layered organization of software systems, with the resulting gains in development and maintenance ease.

• A) Barry Boehm
• B) Shaw and Garlan
• C) Edsger Dijkstra
• D) David Parnas

Client server is a ______________ system model.

• A) Distributed
• B) Homogeneous
• C) Heterogeneous
• D) Integrated

Collaboration diagram can show _______________.
a. Binary messages
b. Asynchronous messages
c. Synchronous messages

• A) c only
• B) a only
• C) b only
• D) both b and c

Sequence of messages can be present in:
a. Use case diagram
b. Sequence diagram
c. Collaboration diagram

• A) b only
• B) b and c
• C) c only
• D) a only

Client server model tries to …….data and processing.

• A) Clone
• B) Merge
• C) Proceed
• D) Distribute

A _____ relationship indicates that one entity is composed of one or more parts which are themselves instances of that or another entity.

• A) Specialization
• B) Generalization
• C) Whole-part
• D) Inheritance