Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by FathimaMuhzina
3
answers
1
UGC NET CSE | June 2012 | Part 3 | Question: 72
$G_1$ and $G_2$ are two graphs as shown: Both $G_1$ and $G_2$ are planar graphs Both $G_1$ and $G_2$ are not planar graphs $G_1$ is planar and $G_2$ is not planar $G_1$ is not planar and $G_2$ is planar
$G_1$ and $G_2$ are two graphs as shown:Both $G_1$ and $G_2$ are planar graphsBoth $G_1$ and $G_2$ are not planar graphs$G_1$ is planar and $G_2$ is not planar$G_1$ is no...
4.2k
views
commented
Oct 17, 2021
Graph Theory
ugcnetcse-june2012-paper3
graph-theory
graph-planarity
+
–
1
answer
2
UGC NET CSE | November 2017 | Part 2 | Question: 10
The output of the following combinational circuit is $F$. The value of $F$ is $P_1+P_2’P_3$ $P_1+P_2’P_3’$ $P_1+P_2P_3’$ $P_1’+P_2P_3$
The output of the following combinational circuit is $F$.The value of $F$ is$P_1+P_2’P_3$$P_1+P_2’P_3’$$P_1+P_2P_3’$$P_1’+P_2P_3$
958
views
commented
Jul 24, 2021
Unknown Category
ugcnetcse-nov2017-paper2
+
–
2
answers
3
UGC NET CSE | October 2020 | Part 2 | Question: 79
Consider the following regular expressions: $r=a(b+a)^*$ $s=a(a+b)^*$ $t=aa^*b$ ... $L(r) \supseteq L(t) \supseteq L(s)$ $L(s) \supseteq L(t) \supseteq L(r)$
Consider the following regular expressions:$r=a(b+a)^*$$s=a(a+b)^*$$t=aa^*b$Choose the correct answer from the options given below based on the relation between the langu...
1.6k
views
commented
Jun 19, 2021
Theory of Computation
ugcnetcse-oct2020-paper2
theory-of-computation
regular-expression
+
–
2
answers
4
UGC NET CSE | August 2016 | Part 2 | Question: 31
The number of strings of length 4 that are generated by the regular expression $(0+ 1+ | 2+ 3+ )^{*}$, where | is an alternation character and ${+, ^{*}}$ are quantification characters, is : $08$ $09$ $10$ $12$
The number of strings of length 4 that are generated by the regular expression $(0+ 1+ | 2+ 3+ )^{*}$, where | is an alternation character and ${+, ^{*}}$ are quantificat...
2.4k
views
commented
May 29, 2021
Theory of Computation
ugcnetcse-aug2016-paper2
theory-of-computation
regular-expression
+
–
1
answer
5
UGC NET CSE | November 2017 | Part 3 | Question: 36
An undirected graph $G(V,E)$ contains $n(n>2)$ nodes named $v_1, v_2, \dots , v_n$. Two nodes $v_i$ and $v_j$ are connected if and only if $0< \mid i-j \mid \leq 2$. Each edge $(v_i, v_j)$ is assigned a weight $i+j$. The cost of the minimum spanning tree of such a graph with $10$ nodes is $88$ $91$ $49$ $21$
An undirected graph $G(V,E)$ contains $n(n>2)$ nodes named $v_1, v_2, \dots , v_n$. Two nodes $v_i$ and $v_j$ are connected if and only if $0< \mid i-j \mid \leq 2$. Each...
1.1k
views
answered
Jul 5, 2020
Unknown Category
ugcnetcse-nov2017-paper3
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register