An undirected graph G(V, E) contains n ( n > 2 ) nodes named v1 , v2 ,….vn. Two nodes vi , vj are connected if and only if 0 < |i – j| <= 2. Each edge (vi, vj ) is assigned a weight i + j. A sample graph with n = 4 is shown below.What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes?(A) 1/12(11n^2 – 5n)(B) n^2 – n + 1(C) 6n – 11(D) 2n + 1

An undirected graph G(V, E) contains n ( n > 2 ) nodes named v1 , v2 ,

1.	An undirected graph G(V, E) contains n ( n > 2 ) nodes named v1 , v2 ,….vn. Two nodes vi , vj are connected if and only if 0 < \|i – j\| <= 2. Each edge (vi, vj ) is assigned a weight i + j. A sample graph with n = 4 is shown below.What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes?(A) 1/12(11n^2 – 5n)(B) n^2 – n + 1(C) 6n – 11(D) 2n + 1
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Consider the following table of arrival time and burst time for three processes P0, P1 and P2.Process Arrival time Burst TimeP0 0 ms 9 msP1 1 ms 4 msP2 2 ms 9 msThe pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?(A) 5.0 ms(B) 4.33 ms(C) 6.33(D) 7.33
A thread is usually defined as a “light weight process” because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the following is TRUE?(A) On per-thread basis, the OS maintains only CPU register state(B) The OS does not maintain a separate stack for each thread(C) On per-thread basis, the OS does not maintain virtual memory state(D) On per-thread basis, the OS maintains only scheduling and accounting information
The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?(A) Finite state automata(B) Deterministic pushdown automata(C) Non-Deterministic pushdown automata(D) Turing Machine
Database table by name Loan_Records is given below.Borrower Bank_Manager Loan_Amount Ramesh Sunderajan 10000.00 Suresh Ramgopal 5000.00 Mahesh Sunderajan 7000.00What is the output of the following SQL query?SELECT Count(*) FROM ( ( SELECT Borrower, Bank_Manager FROM Loan_Records) AS S NATURAL JOIN ( SELECT Bank_Manager, Loan_Amount FROM Loan_Records) AS T );(A) 3(B) 9(C) 5(D) 6
Consider the language L1,L2,L3 as given below.L1={ | p,q N}L2={ | p,q N and p=q}L3={ | p,q,r N and p=q=r}Which of the following statements is NOT TRUE?(A) Push Down Automata (PDA) can be used to recognize L1 and L2(B) L1 is a regular language(C) All the three languages are context free(D) Turing machine can be used to recognize all the three languages
Which of the following pairs have DIFFERENT expressive power?(A) Deterministic finite automata(DFA) and Non-deterministic finite automata(NFA)(B) Deterministic push down automata(DPDA)and Non-deterministic push down automata(NPDA)(C) Deterministic single-tape Turing machine and Non-deterministic single-tape Turing machine(D) Single-tape Turing machine and multi-tape Turing machine
Which one of the following is NOT desired in a good Software Requirement Specifications (SRS) document?(A) Functional Requirements(B) Non-Functional Requirements(C) Goals of Implementation(D) Algorithms for Software Implementation
The time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes be t2.Which of the following is TRUE?(A) t1 > t2(B) t1 = t2(C) t1 < t2(D) nothing can be said about the relation between t1 and t2
A company needs to develop digital signal processing software for one of its newest inventions. The software is expected to have 40000 lines of code. The company needs to determine the effort in person-months needed to develop this software using the basic COCOMO model. The multiplicative factor for this model is given as 2.8 for the software development on embedded systems, while the exponentiation factor is given as 1.20. What is the estimated effort in person-months?(A) 234.25(B) 932.50(C) 287.80(D) 122.40
Consider a hypothetical processor with an instruction of type LW R1, 20(R2), which during execution reads a 32-bit word from memory and stores it in a 32-bit register R1. The effective address of the memory location is obtained by the addition of a constant 20 and the contents of register R2. Which of the following best reflects the addressing mode implemented by this instruction for operand in memory?(A) Immediate Addressing(B) Register Addressing(C) Register Indirect Scaled Addressing(D) Base Indexed Addressing

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment