Aspire Faculty ID #19330 · Topic: UGC NET Computer Science Dec 2018 (Paper II) · Just now
UGC NET Computer Science Dec 2018 (Paper II)

Consider the graph shown below : 
Use Kruskal's algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is

Solution

Using Kruskal's algorithm, we select edges in increasing order of weights, without forming a cycle.

From the graph, the selected edge weights are:

$1,1,1,2,2,2,3,4$

Since the graph has $9$ vertices, the minimum spanning tree must have

$9-1=8$ edges.

Now, total weight of MST is

$1+1+1+2+2+2+3+4$

$=16$

Therefore, the weight of the minimum spanning tree is

$16$

Previous 10 Questions — UGC NET Computer Science Dec 2018 (Paper II)

Nearest first
1
Consider the following Boolean equations:$(i)\ wx+w(\overline{x}+y)+x(\overline{x}+y)=x+wy$$(ii)\ (w\overline{x}(y+x\ov…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
2
In computers, subtraction is generally carried out by:
Topic: UGC NET Computer Science Dec 2018 (Paper II)
3
Use Dual Simplex Method to solve the following problem: Maximize $z=-2x_1-3x_2$ subject to: $x_1+x_2\geq 2$ $2x_1+x_2\l…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
4
In PERT/CPM, the merge event represents _____ of two or more events.
Topic: UGC NET Computer Science Dec 2018 (Paper II)
5
The Boolean expression $\overline{A}\cdot B+A\cdot \overline{B}+A\cdot B$ is equivalent to:
Topic: UGC NET Computer Science Dec 2018 (Paper II)
6
The relation $\leq$ and $<$ on a Boolean algebra are defined as: $x\leq y$ if and only if $x\vee y=y$ $x<y$ means…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
7
Which of the following statements are true? $(i)$ Every logic network is equivalent to one using just NAND gates or jus…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
8
A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train or Automobile …
Topic: UGC NET Computer Science Dec 2018 (Paper II)
9
A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probabil…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
10
Match List I with List II and choose the correct answer from the code given below. List I …
Topic: UGC NET Computer Science Dec 2018 (Paper II)

Next 10 Questions — UGC NET Computer Science Dec 2018 (Paper II)

Ascending by ID
1
Consider the following statements: $(i)$ Auto increment addressing mode is useful in creating self-relocating code. $(i…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
2
A computer uses a memory unit with $256K$ words of $32$ bits each. A binary instruction code is stored in one word of m…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
3
Consider the following x86 assembly language instructions: MOV AL, $153$ NEG AL The contents of the destination registe…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
4
The decimal floating point number $-40.1$ represented using IEEE-754 $32$-bit representation and written in hexadecimal…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
5
Find the Boolean expression for the logic circuit shown below: $(1-\text{NAND gate},\ 2-\text{NOR gate},\ 3-\text{NOR g…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
6
Consider a disk pack with $32$ surfaces, $64$ tracks and $512$ sectors per track. $256$ bytes of data are stored in a b…
Topic: UGC NET Computer Science Dec 2018 (Paper II)
7
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $0.5$ ns, …
Topic: UGC NET Computer Science Dec 2018 (Paper II)
8
If a graph $G$ has no loops or parallel edges, and if the number of vertices $n$ in the graph is $n\geq 3$, then graph …
Topic: UGC NET Computer Science Dec 2018 (Paper II)
9
The solution of recurrence relation $T(n)=2T(\sqrt{n})+\lg(n)$ is:
Topic: UGC NET Computer Science Dec 2018 (Paper II)
10
The elements $42,25,30,40,22,35,26$ are inserted one by one in the given order into a max-heap. The resultant max-heap …
Topic: UGC NET Computer Science Dec 2018 (Paper II)
Ask Your Question or Put Your Review.

loading...