Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged ugcnetcse-dec2019-paper2
0
votes
1
answer
31
UGC NET CSE | December 2019 | Part 2 | Question: 31
Which of the following methods are used to pass any number of parameters to the operating system through system calls? Registers Block or table in main memory Stack Block in main memory and stack
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
1.0k
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
32
UGC NET CSE | December 2019 | Part 2 | Question: 32
Java Virtual Machine $\text{(JVM)}$ is used to execute architectural neutral byte code. Which of the following is needed by the $\text{JVM}$ for execution of Java Code? Class loader only Class loader and Java Interpreter Class loader, Java Interpreter and $\text{API}$ Java Interpreter only
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
364
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
33
UGC NET CSE | December 2019 | Part 2 | Question: 33
In a system for a restaurant, the main scenario for placing order is given below: Customer reads menu Customer places order Order is sent to kitchen for preparation Ordered items are served Customer requests for a bill for the order Bill is prepared ... will have at least how many objects among whom the messages will be exchanged $3$ $4$ $5$ $6$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
958
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
34
UGC NET CSE | December 2019 | Part 2 | Question: 34
An _______ chart is a project schedule representation that presents project plan as a directed graph. The critical path is the __________ sequence of ________ tasks and it defines project ________. Activity, Shortest, ... Cost Activity, Longest, Dependent, Duration Activity, Longest, Independent, Duration Activity, Shortest, Dependent, Duration
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
725
views
ugcnetcse-dec2019-paper2
0
votes
2
answers
35
UGC NET CSE | December 2019 | Part 2 | Question: 35
Let $a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n$ and $a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n$. For $a=7$, $b=17$ and $n=561$, What is the value of $a^b( \text{mod } n)$? $160$ $166$ $157$ $67$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
1.3k
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
36
UGC NET CSE | December 2019 | Part 2 | Question: 36
A clique in an undirected graph $G= \left \langle V, E \right \rangle$ is a subset $V’ \subseteq V$ of vertices, such that If $(u,v) \in E$ then $u \in V’$ and $v \in V’$ If $(u,v) \in E$ then $u \in V’$ or $v \in V’$ Each pair of vertices in $V’$ is connected by an edge All pairs of vertices in $V’$ are not connected by an edge
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
269
views
ugcnetcse-dec2019-paper2
0
votes
3
answers
37
UGC NET CSE | December 2019 | Part 2 | Question: 37
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be accomodated. $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(1), \theta(1)$ $\theta(n), \theta(n)$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
756
views
ugcnetcse-dec2019-paper2
0
votes
5
answers
38
UGC NET CSE | December 2019 | Part 2 | Question: 38
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each branch is on another disk block, we assume a branch is of $4$ bytes. The total memory requirement for a non-leaf node is $32 M -32$ $36 M – 32$ $36 M – 36$ $32 M – 36$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
995
views
ugcnetcse-dec2019-paper2
0
votes
2
answers
39
UGC NET CSE | December 2019 | Part 2 | Question: 39
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n \leq 2$. $T(n) = 4T( \sqrt{n} ) + \lg^2n$ $T(n) = \theta (\lg ( \lg ^2 n) \lg n )$ $T(n) = \theta ( \lg ^2 n \lg n )$ $T(n) = \theta (\lg ^2 n \lg \lg n )$ $T(n) = \theta (\lg ( \lg n) \lg n )$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
2.2k
views
ugcnetcse-dec2019-paper2
1
vote
2
answers
40
UGC NET CSE | December 2019 | Part 2 | Question: 40
Consider a weighted directed graph. The current shortest distance from source $S$ to node $x$ is represented by $d[x]$. Let $d[v] =29$, $d[u]=15$, $w[u,v]=12$. What is the updated value of $d[v]$ based on current information? $29$ $27$ $25$ $17$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
944
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
41
UGC NET CSE | December 2019 | Part 2 | Question: 41
When using Dijkstra's algorithm to find shortest path in a graph, which of the following statement is not true? It can find shortest path within the same graph data structure Every time a new node is visited, we choose the ... Shortest path always passes through least number of vertices The graph needs to have a non-negative weight on every edge
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
888
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
42
UGC NET CSE | December 2019 | Part 2 | Question: 42
The time complexity to multiply two polynomials of degree $n$ using Fast Fourier transform method is: $\theta(n \lg n)$ $\theta(n^2)$ $\theta(n)$ $\theta(\lg n)$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
379
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
43
UGC NET CSE | December 2019 | Part 2 | Question: 43
Consider the following grammars: ... ? $G_1$ and $G_3$ are equivalent $G_2$ and $G_3$ are equivalent $G_2$ and $G_4$ are equivalent $G_3$ and $G_4$ are equivalent
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
411
views
ugcnetcse-dec2019-paper2
1
vote
1
answer
44
UGC NET CSE | December 2019 | Part 2 | Question: 44
Consider the language $L = \{ a^n b^{n-3} \mid n > 2 \}$ on $\Sigma = \{ a, b\}$. Which one of the following grammars generates the language $L$? $S \rightarrow aA \mid a, A \rightarrow aAb \mid b$ ... $S \rightarrow aaaA \mid a, A \rightarrow aAb \mid \lambda$ $S \rightarrow aaaA, A \rightarrow aAb \mid \lambda$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
709
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
45
UGC NET CSE | December 2019 | Part 2 | Question: 45
Consider the following grammar: $S \rightarrow 0A \mid 0BB$ $A \rightarrow 00A \mid \lambda$ $B \rightarrow 1B \mid 11C$ $C \rightarrow B$ Which language does this grammar generate? $L((00)^*0+(11)^*1)$ $L(0(11)^*+1(00)^*)$ $L((00)^*0)$ $L(0(11)^*1)$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
244
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
46
UGC NET CSE | December 2019 | Part 2 | Question: 46
Consider $\sum=\{w, x\}$ and $T=\{x, y, z\}$. Define homomorphism $h$ by: $h(x)=xzy$ $h(w)=zxyy$ If $L$ is the regular language denoted by $r=(w+x^*)(ww)^*$, then the regular language $h(L)$ is given by $(z\:x\:yy+x\:z\:y)(z\:x\:yy)$ $\left(zxyy+(xzy)^*\right)(zxyy\:zxyy)*$ $(zxyy+xzy)(zxyy)^*$ $\left(zxyy+(xzy)^*\right)(zxyy\:zxyy)$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
307
views
ugcnetcse-dec2019-paper2
0
votes
2
answers
47
UGC NET CSE | December 2019 | Part 2 | Question: 47
Consider the following statements with respect to the language $L = \{ a^n b^n \mid n \geq 0 \}$ $S_1 : L^2$ is a context free language $S_2 : L^k$ is context free language for any given $k \geq 1$ $S_3 : \overline{L}$ and $L^\ast$ ... the following is correct? only $S_1$ and $S_2$ only $S_1$ and $S_3$ only $S_2$ and $S_3$ $S_1$, $S_2$ and $S_3$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
1.1k
views
ugcnetcse-dec2019-paper2
0
votes
3
answers
48
UGC NET CSE | December 2019 | Part 2 | Question: 48
Consider the following languages: $L_1 = \{ a^nb^nc^m \} \cup \{a^nb^mc^m\}, n, m \geq 0$ $L_2 =\{ww^R \mid w \in\{ a, b \}^*\}$ Where $R$ represents reversible operation. Which one of the following is (are) inherently ambiguous languages(s)? Only $L_1$ Only $L_2$ both $L_1$ and $L_2$ neither $L_1$ nor $L_2$
soujanyareddy13
asked
in
Theory of Computation
May 12, 2021
by
soujanyareddy13
1.4k
views
ugcnetcse-dec2019-paper2
identify-class-language
1
vote
2
answers
49
UGC NET CSE | December 2019 | Part 2 | Question: 49
Let $G= (V, T, S, P)$ be any context-free grammar without any $\lambda$-productions or unit productions. Let $K$ be the maximum number of symbols on the right of any production in $P$. The maximum number of production rules for any equivalent grammar ... $K \mid P \mid + \mid T \mid$ Where $\mid \cdot \mid$ denotes the cardinality of the set.
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
1.4k
views
ugcnetcse-dec2019-paper2
0
votes
2
answers
50
UGC NET CSE | December 2019 | Part 2 | Question: 50
Consider the following language families: $L_1 \equiv$ The context-free languages $L_2 \equiv$ The context-sensitive languages $L_3 \equiv$ The recursively enumerable languages $L_4 \equiv$ The recursive languages Which one of the following ... $L_1 \subseteq L_2 \subseteq L_4 \subseteq L_3$ $L_2 \subseteq L_1 \subseteq L_4 \subseteq L_3$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
420
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
51
UGC NET CSE | December 2019 | Part 2 | Question: 51
Consider the following statements: $S_1$: These exists no algorithm for deciding if any two Turing machines $M_1$ and $M_2$ accept the same language $S_2$: Let $M_1$ and $M_2$ ... the statements is (are) correct? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
271
views
ugcnetcse-dec2019-paper2
0
votes
2
answers
52
UGC NET CSE | December 2019 | Part 2 | Question: 52
Let $A= \{001, 0011, 11, 101\}$ and $B=\{01, 111, 111, 010\}$. Similarly, let $C= \{00, 001, 1000\}$ and $D=\{0, 11, 011\}$. Which of the following pairs have a post-correspondence solution? Only pair $(A, B)$ Only pair $(C, D)$ Both $(A, B)$ and $(C, D)$ Neither $(A, B)$ nor $(C, D)$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
1.3k
views
ugcnetcse-dec2019-paper2
0
votes
2
answers
53
UGC NET CSE | December 2019 | Part 2 | Question: 53
Which of the following class of $\text{IP}$ address has the last address as $223.255.255.255$? Class $A$ Class $B$ Class $C$ Class $D$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
435
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
54
UGC NET CSE | December 2019 | Part 2 | Question: 54
Consider a subnet with $720$ routers. If a three-level hierarchy is chosen, with eight clusters, each containing $9$ regions of $10$ routers, then total number of entries in hierarchical table of each router is $25$ $27$ $53$ $72$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
274
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
55
UGC NET CSE | December 2019 | Part 2 | Question: 55
Piconet is a basic unit of a bluetooth system consisting of __________ master node and up to _________ active slave nodes. one, five one, seven two, eight one, eight
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
614
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
56
UGC NET CSE | December 2019 | Part 2 | Question: 56
A network with bandwidth of $10 \text{ Mbps}$ can pass only an average of $12, 000$ frames per minute with each frame carrying an average of $10,000$ bits. What is the throughput of this network? $1, 000, 000 \text{ bps}$ $2, 000, 000 \text{ bps}$ $12, 000, 000 \text{ bps}$ $1, 200, 00, 000 \text{ bps}$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
1.8k
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
57
UGC NET CSE | December 2019 | Part 2 | Question: 57
The full form of $\text{ICANN}$ is Internet Corporation for Assigned Names and Numbers Internet Corporation for Assigned Numbers and Names Institute of Cooperation for Assigned Names and Numbers Internet Connection for Assigned Names and Numbers
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
216
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
58
UGC NET CSE | December 2019 | Part 2 | Question: 58
According to Dempster-Shafer theory for uncertainity management, $\textit{Bel}(A)+\textit{Bel}(\neg A) \leq 1$ $\textit{Bel}(A)+\textit{Bel}(\neg A) \geq 1$ $\textit{Bel}(A)+\textit{Bel}(\neg A) = 1$ $\textit{Bel}(A)+\textit{Bel}(\neg A) =0$ Where $\textit{Bel}(A)$ denotes Belief of event $A$.
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
229
views
ugcnetcse-dec2019-paper2
1
vote
0
answers
59
UGC NET CSE | December 2019 | Part 2 | Question: 59
Consider the following statements: $S_1 : \forall x P(x) \vee \forall x Q(x)$ and $\forall x (P(x) \vee Q(x))$ are not logically equivalent. $S_2 : \exists x P(x) \wedge \exists x Q(x)$ ... logically equivalent Which of the following statements is/are correct? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
179
views
ugcnetcse-dec2019-paper2
0
votes
1
answer
60
UGC NET CSE | December 2019 | Part 2 | Question: 60
Consider the game tree given below: Here $\bigcirc$ and $\square$ represent MIN and MAX nodes respectively, The value of the root node of the game tree is: $14$ $17$ $111$ $112$
soujanyareddy13
asked
in
Others
May 12, 2021
by
soujanyareddy13
392
views
ugcnetcse-dec2019-paper2
Page:
« prev
1
2
3
4
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged ugcnetcse-dec2019-paper2
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...