Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-june2019-paper2
2
votes
2
answers
61
UGC NET CSE | June 2019 | Part 2 | Question: 61
Match List-I with List-II: ... ii) (a) - (ii); (b)-(i); (c)-(iv); (d)-(iii) (a) - (iii); (b)-(i); (c)-(iv); (d)-(ii)
Match List-I with List-II:$$\begin{array}{|c|c|c|c|} \hline {} & \text{List-I} & {} & \text{List-II} \\ \hline (a) & \text{Prim’s algorithm} & (i) & O(V^3 \log V) \\ \h...
Arjun
1.7k
views
Arjun
asked
Jul 2, 2019
Algorithms
ugcnetcse-june2019-paper2
graph-algorithms
+
–
3
votes
2
answers
62
UGC NET CSE | June 2019 | Part 2 | Question: 62
There are many sorting algorithms based on comparison. The running time of heapsort algorithm is $O(n \text{lg}n)$. Like $P$, but unlike $Q$, heapsort sorts in place where $(P,Q)$ is equal to Merge sort, Quick sort Quick sort, insertion sort Insertion sort, Quick sort Insertion sort, Merge sort
There are many sorting algorithms based on comparison. The running time of heapsort algorithm is $O(n \text{lg}n)$. Like $P$, but unlike $Q$, heapsort sorts in place wher...
Arjun
3.0k
views
Arjun
asked
Jul 2, 2019
Algorithms
ugcnetcse-june2019-paper2
in-place-algo
quicksort-mergesort-insertion-sort
+
–
2
votes
1
answer
63
UGC NET CSE | June 2019 | Part 2 | Question: 63
Consider the Euler’s phi function given by $\phi(n) = n \underset{p/n}{\Pi } \bigg( 1 – \frac{1}{p} \bigg)$ where $p$ runs over all the primes dividing $n$. What is the value of $\phi(45)$? $3$ $12$ $6$ $24$
Consider the Euler’s phi function given by$$\phi(n) = n \underset{p/n}{\Pi } \bigg( 1 – \frac{1}{p} \bigg)$$where $p$ runs over all the primes dividing $n$. What is t...
Arjun
2.8k
views
Arjun
asked
Jul 2, 2019
Combinatory
ugcnetcse-june2019-paper2
euler-phi-function
+
–
7
votes
3
answers
64
UGC NET CSE | June 2019 | Part 2 | Question: 64
Which of the following is best running time to sort $n$ integers in the range $0$ to $n^2-1$? $O(\text{lg } n)$ $O(n)$ $O(n\text { lg }n)$ $O(n^2)$
Which of the following is best running time to sort $n$ integers in the range $0$ to $n^2-1$?$O(\text{lg } n)$$O(n)$$O(n\text { lg }n)$$O(n^2)$
Arjun
3.4k
views
Arjun
asked
Jul 2, 2019
Algorithms
ugcnetcse-june2019-paper2
sorting
+
–
1
votes
1
answer
65
UGC NET CSE | June 2019 | Part 2 | Question: 65
Which of the following is application of depth-first search? Only topological sort Only strongly connected components Both topological sort and strongly connected components Neither topological sort nor strongly connected components
Which of the following is application of depth-first search?Only topological sortOnly strongly connected componentsBoth topological sort and strongly connected components...
Arjun
1.9k
views
Arjun
asked
Jul 2, 2019
Algorithms
ugcnetcse-june2019-paper2
depth-first-search
+
–
3
votes
2
answers
66
UGC NET CSE | June 2019 | Part 2 | Question: 66
Consider double hashing of the form $h(k,i)=(h_1(k)+ih_2(k)) \text{mod m}$ where $h_{1}(k) = \text{k mod m} \ , \ \ h_{2}(k)=1+(\text{k mod n})$ where $n=m-1$ and $m=701$. For $k=123456$, what is the difference between first and second probes in terms of slots? $255$ $256$ $257$ $258$
Consider double hashing of the form$h(k,i)=(h_1(k)+ih_2(k)) \text{mod m}$ where $h_{1}(k) = \text{k mod m} \ , \ \ h_{2}(k)=1+(\text{k mod n})$ where $n=m-1$ and $m=701$....
Arjun
4.1k
views
Arjun
asked
Jul 2, 2019
Algorithms
ugcnetcse-june2019-paper2
double-hashing
+
–
1
votes
1
answer
67
UGC NET CSE | June 2019 | Part 2 | Question: 67
Consider the complexity class $CO-NP$ as the set of languages $L$ such that $\overline{L} \in NP$, and the following two statements: $S_1: \: P \subseteq CO-NP$ $S_2: \: \text{ If } NP \neq CO-NP, \text{ then } P \neq NP$ Which of the following is/are correct? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
Consider the complexity class $CO-NP$ as the set of languages $L$ such that $\overline{L} \in NP$, and the following two statements:$S_1: \: P \subseteq CO-NP$$S_2: \: \t...
Arjun
1.2k
views
Arjun
asked
Jul 2, 2019
Algorithms
ugcnetcse-june2019-paper2
p-np-npc-nph
+
–
3
votes
3
answers
68
UGC NET CSE | June 2019 | Part 2 | Question: 68
Consider the following steps: $S_1$: Characterize the structure of an optimal solution $S_2$: Compute the value of an optimal solution in bottom-up fashion Which of the following step(s) is/are common to both dynamic programming and greedy algorithms? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
Consider the following steps:$S_1$: Characterize the structure of an optimal solution$S_2$: Compute the value of an optimal solution in bottom-up fashionWhich of the foll...
Arjun
5.6k
views
Arjun
asked
Jul 2, 2019
Algorithms
ugcnetcse-june2019-paper2
optimal-solution
dynamic-programming
greedy-algorithm
+
–
1
votes
1
answer
69
UGC NET CSE | June 2019 | Part 2 | Question: 69
Consider the following properties with respect to a flow network $G=(V,E)$ in which a flow is a real-valued function $f:V \times V \rightarrow R$: $P_1$: For all $u, v, \in V, \: f(u,v)=-f(v,u)$ $P_2$ ... $u \in V$ Which one of the following is/are correct? Only $P_1$ Only $P_2$ Both $P_1$ and $P_2$ Neither $P_1$ nor $P_2$
Consider the following properties with respect to a flow network $G=(V,E)$ in which a flow is a real-valued function $f:V \times V \rightarrow R$:$P_1$: For all $u, v, \i...
Arjun
1.5k
views
Arjun
asked
Jul 2, 2019
Graph Theory
ugcnetcse-june2019-paper2
flow-network
+
–
2
votes
1
answer
70
UGC NET CSE | June 2019 | Part 2 | Question: 70
Consider the following statements: $S_1$: For any integer $n>1, \: a^{\phi(n)} \equiv 1(mod \: n)$ for all $a \in Z_n^*$ , where $\phi(n)$ is Euler’s phi function. $S_2$: If $p$ is prime, then $a^p \equiv 1(mod \: p)$ for all $a \in Z_p^*$. Which one of the following is/are correct? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
Consider the following statements:$S_1$: For any integer $n>1, \: a^{\phi(n)} \equiv 1(mod \: n)$ for all $a \in Z_n^*$ , where $\phi(n)$ is Euler’s phi function.$S_2$:...
Arjun
1.8k
views
Arjun
asked
Jul 2, 2019
Set Theory & Algebra
ugcnetcse-june2019-paper2
euler-phi-function
set-theory&algebra
+
–
1
votes
1
answer
71
UGC NET CSE | June 2019 | Part 2 | Question: 71
Which data structure is used by the compiler for managing variables and their attributes? Binary tree Link list Symbol table Parse table
Which data structure is used by the compiler for managing variables and their attributes?Binary treeLink listSymbol tableParse table
Arjun
1.7k
views
Arjun
asked
Jul 2, 2019
Compiler Design
ugcnetcse-june2019-paper2
compiler-design
symbol-table
+
–
1
votes
1
answer
72
UGC NET CSE | June 2019 | Part 2 | Question: 72
On translating the expression given below into quadruple representation, how many operations are required? $(i\ast j)+(e+f)\ast(a\ast b+c)$ $5$ $6$ $3$ $7$
On translating the expression given below into quadruple representation, how many operations are required?$$(i\ast j)+(e+f)\ast(a\ast b+c)$$$5$$6$$3$$7$
Arjun
4.9k
views
Arjun
asked
Jul 2, 2019
Compiler Design
ugcnetcse-june2019-paper2
intermediate-code
quadruple-representation
+
–
1
votes
1
answer
73
UGC NET CSE | June 2019 | Part 2 | Question: 73
Replacing the expression $4\ast 2\cdot 14$ by $8 \cdot 56$ is known as constant folding induction variable strength reduction code reduction
Replacing the expression $4\ast 2\cdot 14$ by $8 \cdot 56$ is known asconstant foldinginduction variablestrength reductioncode reduction
Arjun
4.2k
views
Arjun
asked
Jul 2, 2019
Compiler Design
ugcnetcse-june2019-paper2
code-optimization
constant-folding
+
–
1
votes
2
answers
74
UGC NET CSE | June 2019 | Part 2 | Question: 74
Shift-reduce parser consists of input buffer stack parse table Choose the correct option from those given below: a and b only a and c only c only a, b and c
Shift-reduce parser consists ofinput bufferstackparse tableChoose the correct option from those given below:a and b onlya and c onlyc onlya, b and c
Arjun
4.1k
views
Arjun
asked
Jul 2, 2019
Compiler Design
ugcnetcse-june2019-paper2
shift-reduce-parser
+
–
4
votes
2
answers
75
UGC NET CSE | June 2019 | Part 2 | Question: 75
How many states are there in a minimum state automata equivalent to regular expression given below? Regular expression is $a^*b(a+b)$ $1$ $2$ $3$ $4$
How many states are there in a minimum state automata equivalent to regular expression given below?Regular expression is $a^*b(a+b)$$1$$2$$3$$4$
Arjun
4.7k
views
Arjun
asked
Jul 2, 2019
Theory of Computation
ugcnetcse-june2019-paper2
finite-automata
minimal-state-automata
+
–
1
votes
1
answer
76
UGC NET CSE | June 2019 | Part 2 | Question: 76
Match $\text{List-I}$ with $\text{List-II}$ : where $L_1:$ Regular language $L_2:$ Context-free language $L_3:$ Recursive language $L_4:$ ... $\text{(a)-(iii); (b)-(i); (c)-(ii)}$ $\text{(a)-(i); (b)-(ii); (c)-(iii)}$
Match $\text{List-I}$ with $\text{List-II}$ :where $L_1:$ Regular language $L_2:$ Context-free language $L_3:$ Recursive language $L_4:$ Rec...
Arjun
2.1k
views
Arjun
asked
Jul 2, 2019
Theory of Computation
ugcnetcse-june2019-paper2
languages-classification
cfl-recusive-re
+
–
2
votes
1
answer
77
UGC NET CSE | June 2019 | Part 2 | Question: 77
How can the decision algorithm be constructed for deciding whether context-free language $L$ is finite? By constructing redundant CFG G in CNF generating language $L$ By constructing non-redundant CFG G in CNF generating language $L$ By constructing non- ... for null) Which of the following is correct? i only ii only iii only None of i, ii and iii
How can the decision algorithm be constructed for deciding whether context-free language $L$ is finite?By constructing redundant CFG G in CNF generating language $L$By co...
Arjun
1.6k
views
Arjun
asked
Jul 2, 2019
Theory of Computation
ugcnetcse-june2019-paper2
context-free-language
+
–
2
votes
3
answers
78
UGC NET CSE | June 2019 | Part 2 | Question: 78
Consider the following grammar: $S \rightarrow XY$ $X \rightarrow YaY \mid a \text{ and } Y \rightarrow bbX$ Which of the following statements is/are true about the above grammar? Strings produced by the grammar can have consecutive three $a$ ... by the grammar have $b$'s in multiple of $2$. i only ii and iii only iv only iii and iv only
Consider the following grammar:$S \rightarrow XY$$X \rightarrow YaY \mid a \text{ and } Y \rightarrow bbX$Which of the following statements is/are true about the above gr...
Arjun
2.1k
views
Arjun
asked
Jul 2, 2019
Theory of Computation
ugcnetcse-june2019-paper2
grammar
strings
+
–
4
votes
1
answer
79
UGC NET CSE | June 2019 | Part 2 | Question: 79
Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing machine $M$? $G$ is a CFG with $L(G)=\phi$ There exist two TMs $M_1$ and $M_2$ such that $L(M) \subseteq \{L(M_1) \cup L(M_2)\} = $ language of ... $\omega$ using at most $2^{\mid \omega \mid}$ cells of tape i and ii only i only i, ii and iii iii only
Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing machine $M$?$G$ is a CFG with $L(G)=\phi$There exist two TMs $M_1$ and $M_2...
Arjun
2.8k
views
Arjun
asked
Jul 2, 2019
Theory of Computation
ugcnetcse-june2019-paper2
decidability
turing-machine
+
–
1
votes
1
answer
80
UGC NET CSE | June 2019 | Part 2 | Question: 80
For a statement A language $L \subseteq \Sigma^*$ is recursive if there exists some turing machine $M$. Which of the following conditions is satisfied for any string $\omega$? If $\omega \in L$, then $M$ accepts $\omega$ ... $M$ halts without reaching to acceptable state If $\omega \in L$, then $M$ halts without reaching to an acceptable state
For a statementA language $L \subseteq \Sigma^*$ is recursive if there exists some turing machine $M$. Which of the following conditions is satisfied for any string $\ome...
Arjun
2.1k
views
Arjun
asked
Jul 2, 2019
Theory of Computation
ugcnetcse-june2019-paper2
turing-machine
+
–
3
votes
3
answers
81
UGC NET CSE | June 2019 | Part 2 | Question: 81
A fully connected network topology is a topology in which there is a direct link between all pairs of nodes. Given a fully connected network with $n$ nodes, the number of direct links as a function of $n$ can be expressed as $\frac{n(n+1)}{2}$ $\frac{(n+1)}{2}$ $\frac{n}{2}$ $\frac{n(n-1)}{2}$
A fully connected network topology is a topology in which there is a direct link between all pairs of nodes. Given a fully connected network with $n$ nodes, the number of...
Arjun
3.2k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
mesh-topology
+
–
3
votes
4
answers
82
UGC NET CSE | June 2019 | Part 2 | Question: 82
What is the name of the protocol that allows a client to send a broadcast message with its MAC address and receive an IP address in reply? ARP DNS RARP ICMP
What is the name of the protocol that allows a client to send a broadcast message with its MAC address and receive an IP address in reply?ARPDNSRARPICMP
Arjun
3.3k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
rarp-protocol
+
–
2
votes
3
answers
83
UGC NET CSE | June 2019 | Part 2 | Question: 83
You are designing a link layer protocol for a link with bandwidth of $1$ Gbps ($10^9$ bits/second) over a fiber link with length of $800$ km. Assume the speed of light in this medium is $200000$ km/second. What is the propagation delay in this link? $1$ millisecond $2$ milliseconds $3$ milliseconds $4$ milliseconds
You are designing a link layer protocol for a link with bandwidth of $1$ Gbps ($10^9$ bits/second) over a fiber link with length of $800$ km. Assume the speed of light in...
Arjun
6.1k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
propagation-delay
+
–
5
votes
4
answers
84
UGC NET CSE | June 2019 | Part 2 | Question: 84
You need $500$ subnets, each with about $100$ usable host address per subnet. What network mask will you assign using a class B network address? $255.255.255.252$ $255.255.255.128$ $255.255.255.0$ $255.255.254.0$
You need $500$ subnets, each with about $100$ usable host address per subnet. What network mask will you assign using a class B network address?$255.255.255.252$$255.255....
Arjun
9.8k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
subnetting
+
–
2
votes
2
answers
85
UGC NET CSE | June 2019 | Part 2 | Question: 85
Consider the following two statements with respect to IPv4 in computer networking: P: The loopback (IP) address is a member of class B network. Q: The loopback (IP) address is used to send a packet from host to itself. What can you say about the statements P and Q? P – True; Q – False P – False; Q – True P – True; Q – True P – False; Q – False
Consider the following two statements with respect to IPv4 in computer networking:P: The loopback (IP) address is a member of class B network.Q: The loopback (IP) address...
Arjun
3.3k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
ip-addressing
loopback-address
+
–
2
votes
1
answer
86
UGC NET CSE | June 2019 | Part 2 | Question: 86
In the TCP/IP model, encryption and decryption are functions of ____ layer. data link network transport application
In the TCP/IP model, encryption and decryption are functions of ____ layer.data linknetworktransportapplication
Arjun
7.8k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
encryption-decryption
+
–
1
votes
1
answer
87
UGC NET CSE | June 2019 | Part 2 | Question: 87
Which of the following statements is/are true with regard to various layers in the Internet stack? P: At the link layer, a packet of transmitted information is called a frame. Q: At the network layer, a packet of transmitted information is called a segment. P only Q only P and Q Neither P nor Q
Which of the following statements is/are true with regard to various layers in the Internet stack?P: At the link layer, a packet of transmitted information is called a fr...
Arjun
2.1k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
internet-stack-layers
+
–
2
votes
4
answers
88
UGC NET CSE | June 2019 | Part 2 | Question: 88
What percentage $(\%)$ of the IPv4, IP address space do all class C addresses consume? $12.5 \%$ $25 \%$ $37.5 \%$ $50 \%$
What percentage $(\%)$ of the IPv4, IP address space do all class C addresses consume?$12.5 \%$$25 \%$$37.5 \%$$50 \%$
Arjun
4.9k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
ip-addressing
+
–
2
votes
2
answers
89
UGC NET CSE | June 2019 | Part 2 | Question: 89
The ability to inject packets into the Internet with a false source address is known as Man-in-the-middle attack IP phishing IP sniffing IP spoofing
The ability to inject packets into the Internet with a false source address is known asMan-in-the-middle attackIP phishingIP sniffingIP spoofing
Arjun
2.1k
views
Arjun
asked
Jul 2, 2019
Computer Networks
ugcnetcse-june2019-paper2
network-security
+
–
2
votes
1
answer
90
UGC NET CSE | June 2019 | Part 2 | Question: 91
Consider the game tree given below: Here $\bigcirc$ and $\Box$ represents MIN and MAX nodes respectively. The value of the root node of the game tree is $4$ $7$ $11$ $12$
Consider the game tree given below:Here $\bigcirc$ and $\Box$ represents MIN and MAX nodes respectively. The value of the root node of the game tree is$4$$7$$11$$12$
Arjun
3.2k
views
Arjun
asked
Jul 2, 2019
Artificial Intelligence
ugcnetcse-june2019-paper2
artificial-intelligence
minimax-procedure
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register