Aspire Faculty ID #18856 · Topic: UGC NET Computer Science Nov 2021 (Paper II) · Just now
UGC NET Computer Science Nov 2021 (Paper II)

Given below are two statements

Statement I: In an undirected graph, number of odd degree vertices is even.

Statement II: In an undirected graph, sum of degrees of all vertices is even.

In light of the above statements, choose the correct answer from the options given below.

Solution

By Handshaking Theorem, sum of degrees of all vertices in an undirected graph is equal to twice the number of edges.

So,

$\sum deg(v)=2|E|$

This is always even. Hence, Statement II is true.

Also, in any undirected graph, the number of vertices having odd degree is always even.

Hence, Statement I is also true.

Therefore, both statements are true.

Previous 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)

Nearest first
1
Consider the following graph.Among the following sequencesI. $a\ b\ e\ g\ h\ f$II. $a\ b\ f\ e\ h\ g$III. $a\ b\ f\ h\ …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
2
A data structure is required for storing a set of integers such that each of the following operations can be done in $O…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
3
Two balanced binary trees are given with $m$ and $n$ elements, respectively. They can be merged into a balanced binary …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
4
A double-ended queue (deque) supports adding and removing items from both ends of the queue. The operations supported b…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
5
The postfix form of the expression $(A+B)*(C*D-E)*F/G$ is ______
Topic: UGC NET Computer Science Nov 2021 (Paper II)
6
Given below are two statementsStatement I: LL(1) and LR are examples of Bottom-up parsers.Statement II: Recursive desce…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
7
Which of the following concepts can be used to identify loops?A. Depth first orderingB. DominatorsC. Reducible graphsCh…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
8
Match List I with List IIList IList IIA. $S\to XY,\ X\to 0,\ Y\to 1$I. Greibach Normal FormB. $S\to aS\mid bSS\mid c$II…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
9
 What language is accepted by the pushdown automaton$M=({q_0,q_1,q_2},\{a,b\},\{a,b,z\},\delta,q_0,z,\{q_2\})$with…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
10
Find the regular expression for the language accepted by the automata given below.
Topic: UGC NET Computer Science Nov 2021 (Paper II)

Next 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)

Ascending by ID
1
 Which of the given options provides the increasing order of asymptotic complexity of functions $f_1,\ f_2,\ f_3$ …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
2
The order of a leaf node in a $B+$ tree is the maximum number of value, data record pointer pairs it can hold. Given th…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
3
A hash function $h$ defined as $h(key)=key\ mod\ 7$, with linear probing, is used to insert the keys $44,45,79,55,91,18…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
4
In the following table, the left column contains the names of standard graph algorithms and the right column contains t…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
5
Which agent deals with the happy and unhappy state?
Topic: UGC NET Computer Science Nov 2021 (Paper II)
6
Given below are two statementsStatement I: Breadth-First Search is optimal when all the step costs are equal whereas un…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
7
Consider the given tree below. Calculate the value at the root of the tree using alpha‐beta pruning algorithm.
Topic: UGC NET Computer Science Nov 2021 (Paper II)
8
Which among the following statement(s) is(are) FALSE?A. Greedy best-first search is not optimal but is often efficient.…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
9
Consider the sentence below.There is a country that borders both India and Pakistan.Which of the following logical expr…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
10
Consider a domain consisting of three Boolean variables Toothache, Cavity, and Catch. The full joint distribution is a …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Ask Your Question or Put Your Review.

loading...