The length of the path from v5 to v6 in the MST of previous question with n = 10 is
An undirected graph G(V,E) contains n (n > 2) nodes named Two nodes vi, vj are connected if and only if Each edge is assigned a weight i + j. A sample graph with n = 4 is shown below.
Consider the following table of arrival time and burst time for three processes P0, P1 and P2. The 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?
Consider the following grammar G where S,F, and Hare non-terminal symbols , p, d, and care terminal symbols. Which of the following statement (s) is / are correct? S1. LL(1) can parse al strings that are generated using grammar G S2. LR(1) can parse all strings that are generated using grammar G
निर्देश: निम्नलिखित शब्द का प्रत्यय बताइएः
Match the following:
List - I 1) Waterfall model 2) Evolutionary model 3) Component-based software engineering 4) Spiral development List - II a) Specifications can be developed incrementally b) Requirements compromises are inevitable c) Explicit recognition of risk d) Inflexible partitioning of the project into stages
An ordered n-tuple (d1, d2, …,dn) with d1 ≥ d2 ≥ ⋯ ≥ dn is called graphic if there exists a simple undirected graph with n vertices having degrees d1, d2, … , dn respectively. Which of the following 6-tuples is NOT graphic?
What will be the output of the following Python code?