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
Answers by abhishekmehta4u
0
votes
1
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
7.7k
views
answered
Mar 26, 2020
Algorithms
ugcnetcse-jan2017-paper3
algorithms
tree
+
–
0
votes
2
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
7.7k
views
answered
Mar 26, 2020
Algorithms
ugcnetcse-jan2017-paper3
algorithms
tree
+
–
0
votes
3
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
7.7k
views
answered
Mar 26, 2020
Algorithms
ugcnetcse-jan2017-paper3
algorithms
tree
+
–
0
votes
4
UGC NET CSE | January 2017 | Part 3 | Question: 33
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case. $O(1)$ $O( \lg n)$ $O(n)$ $O(n \lg n)$
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case.$O(1...
2.4k
views
answered
Mar 26, 2020
Algorithms
ugcnetcse-jan2017-paper3
algorithms
red-black-tree
+
–
0
votes
5
UGC NET CSE | January 2017 | Part 3 | Question: 35
Dijkstra’s algorithm is based on Divide and conquer paradigm Dynamic programming Greedy approach Backtracking paradigm
Dijkstra’s algorithm is based onDivide and conquer paradigmDynamic programmingGreedy approachBacktracking paradigm
2.2k
views
answered
Mar 26, 2020
Algorithms
ugcnetcse-jan2017-paper3
algorithms
dijkstras-algorithm
+
–
2
votes
6
UGC NET CSE | January 2017 | Part 3 | Question: 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5 $ is...
3.6k
views
answered
Mar 26, 2020
Algorithms
ugcnetcse-jan2017-paper3
algorithms
matrix-chain-ordering
+
–
0
votes
7
UGC NET CSE | January 2017 | Part 3 | Question: 39
Consider the following JAVA program: public class First { public static int CBSE (int x) { if (x < 100)x = CBSE (x+10); return (x-1); } public static void main(String[]args){ System.out.print(First.CBSE(60)); } } What does this program print? $59$ $95$ $69$ $99$
Consider the following JAVA program:public class First { public static int CBSE (int x) { if (x < 100)x = CBSE (x+10); return (x-1); } public ...
2.0k
views
answered
Mar 26, 2020
Object Oriented Programming
ugcnetcse-jan2017-paper3
object-oriented-programming
java
+
–
0
votes
8
UGC NET CSE | January 2017 | Part 3 | Question: 36
Match the following with respect to algorithm paradigms : ... $\text{a-ii, b-i, c-iii, d-iv}$ $\text{a-iii, b-ii, c-i, d-iv}$
Match the following with respect to algorithm paradigms :$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{a.} & \text{Merge sort} & \text{i.} & \te...
1.6k
views
answered
Mar 26, 2020
Algorithms
ugcnetcse-jan2017-paper3
algorithms
easy
match-the-following
+
–
2
votes
9
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$....
4.0k
views
answered
Jul 17, 2019
Algorithms
ugcnetcse-june2019-paper2
double-hashing
+
–
1
votes
10
UGC NET CSE | June 2019 | Part 2 | Question: 45
Consider three CPU intensive processes, which require $10$, $20$ and $30$ units of time and arrive at times $0$, $2$ and $6$ respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $4$ $2$ $3$ $1$
Consider three CPU intensive processes, which require $10$, $20$ and $30$ units of time and arrive at times $0$, $2$ and $6$ respectively. How many context switches are n...
3.8k
views
answered
Jul 17, 2019
Operating System
ugcnetcse-june2019-paper2
process-scheduling
+
–
0
votes
11
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...
2.0k
views
answered
Jul 17, 2019
Theory of Computation
ugcnetcse-june2019-paper2
grammar
strings
+
–
5
votes
12
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....
9.0k
views
answered
Jul 17, 2019
Computer Networks
ugcnetcse-june2019-paper2
subnetting
+
–
0
votes
13
Static Single Assignment form
Consider the following code generation: a=b+c; c=a+x; d=b+c; b=a+x; The minimum no. of total variables required to convert the above code to static single assignment form is______
Consider the following code generation:a=b+c;c=a+x;d=b+c;b=a+x;The minimum no. of total variables required to convert the above code to static single assignment form is__...
3.0k
views
answered
Jun 8, 2019
Compiler Design
compiler-design
static-single-assignment
intermediate-code
+
–
3
votes
14
Follow Set Self Doubt
X->aABe B->c | d A->a What will be the follow of A here? {c, d, $} or {c, d, e, dollar}
X->aABeB->c | dA->aWhat will be the follow of A here?{c, d, $} or {c, d, e, dollar}
475
views
answered
Jun 8, 2019
Compiler Design
compiler-design
first-and-follow
+
–
4
votes
15
Conversion of regular grammar to FA
A->aB/bA/b B->aC/bB C->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there? According to me there should be 2 final states: A and C But the resource from where I am reading it says only one final state will be there which will be A. Kindly explain.
A->aB/bA/bB->aC/bBC->aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there?According to me there should be 2 final states: A...
4.6k
views
answered
Jun 7, 2019
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
+
–
2
votes
16
COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?
S→ A/aA→ aLL1 or not?
974
views
answered
Jun 4, 2019
Compiler Design
compiler-design
ll-parser
syntax-directed-translation
+
–
2
votes
17
Ace academy booklet #graph theory
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Euler circuit exists ... Euler circuit exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Euler circuit exits $\Leftrightarrow$ $n$ is even.
Which of the following is $\textbf{not}$ TRUE?(a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd.(b) In a complete bipartit...
1.9k
views
answered
Jun 4, 2019
Graph Theory
graph-theory
ace-booklet
+
–
0
votes
18
ISI-PCB-2015-C1-b
A $64000$-byte message is to be transmitted over a $2$-hop path in a store-and-forward packet-switching network. The network limits packets toa maximum size of $2032$ bytes including a $32$-byte header. The trans-mission lines in the network are error free and have a speed of $50$ ... answer as $1*3*(T_t+T_p) + \;31*T_t$ where $T_t=0.325\; ms$ and $T_p=3.333\; ms$. Please Confirm.
A $64000$-byte message is to be transmitted over a $2$-hop path in a store-and-forward packet-switching network. The network limits packets toa maximum size of $2032$ byt...
1.1k
views
answered
Jun 4, 2019
Computer Networks
userisi2015
usermod
computer-networks
ip-packet
network-layer
+
–
0
votes
19
Made Easy Test Series:Data Structure-Stack
There is given a infix expression: ${\color{Red} {1}}$ $A+B\times C/\left ( \left ( D+E \right )+F\times G \right )$ While converting infix expression to postfix expression number of symbols in the stack at indicated ... $5$, but is it correct? Can anyone give some explanation??
There is given a infix expression: ${\color{Red} {1}}$$A+B\times C/\left ( \left ( D+E \right )+F\times G \rig...
1.1k
views
answered
May 31, 2019
DS
made-easy-test-series
data-structures
stack
+
–
0
votes
20
GATE2017 CE-2: GA-4
What is the value of $x$ when $81\times\left (\frac{16}{25} \right )^{x+2}\div\left (\frac{3}{5} \right )^{2x+4}=144?$ $1$ $-1$ $-2$ $\text{Can not be determined}$
What is the value of $x$ when $81\times\left (\frac{16}{25} \right )^{x+2}\div\left (\frac{3}{5} \right )^{2x+4}=144?$$1$$-1$$-2$$\text{Can not be determined}$
2.6k
views
answered
May 31, 2019
Quantitative Aptitude
gate2017-ce-2
ratio-proportions
quantitative-aptitude
+
–
2
votes
21
Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain-
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes.Process Pi While...
1.5k
views
answered
May 31, 2019
Operating System
made-easy-test-series
operating-system
process-synchronization
+
–
3
votes
22
MadeEasy Test Series: Theory Of Computation - Regular Languages
Consider the following statements: $S_1:\{(a^n)^m|n\leq m\geq0\}$ $S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...
1.8k
views
answered
May 27, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
0
votes
23
Engineering Maths
If A = $\begin{bmatrix} -1 & 1 & 0 \\ 0 & 2 &-2 \\ 0& 0 & 3 \end{bmatrix}$ then trace of the matrix 3A2 + adj A is ____
If A = $\begin{bmatrix} -1 & 1 & 0 \\ 0 & 2 &-2 \\ 0& 0 & 3 \end{bmatrix}$ then trace of the matrix 3A2 + adj A is ____
830
views
answered
May 26, 2019
Linear Algebra
engineering-mathematics
linear-algebra
+
–
4
votes
24
machine instructions and addressing modes
A digital computer has memory unit with $24$ bits word.The instruction set consists of $150$ different operations. All instructions have an operation code part and an address part. Each instruction is stored in one word of memory. $Q1$ How many bits are needed for the OP-CODE and ... $2^{16}, 2^{24}$ $2^{16},2^{24}-1$ $\textrm{None of these}$
A digital computer has memory unit with $24$ bits word.The instruction set consists of $150$ different operations. All instructions have an operation code part and an add...
1.6k
views
answered
May 25, 2019
CO and Architecture
co-and-architecture
addressing-modes
+
–
2
votes
25
made easy mock
minimum number of nodes (both leaf and non leaf) of B+ tree index required for storing 5500 keys and order of B+ tree is 8 _________ (order is maximum pointers a node can have) am getting 4681
minimum number of nodes (both leaf and non leaf) of B+ tree index required for storing 5500 keys and order of B+ tree is 8 _________(order is maximum pointers a node can...
2.6k
views
answered
May 25, 2019
2
votes
26
TIFR CSE 2019 | Part B | Question: 8
Consider the following program fragment: var a,b : integer; procedure G(c,d: integer); begin c:=c-d; d:=c+d; c:=d-c end; a:=2; b:=3; G(a,b); If both parameters to $G$ are passed by reference, what are the values of $a$ and $b$ at the end of the above program fragment ? $a=0$ and $b=2$ $a=3$ and $b=2$ $a=2$ and $b=3$ $a=1$ and $b=5$ None of the above
Consider the following program fragment:var a,b : integer; procedure G(c,d: integer); begin c:=c-d; d:=c+d; c:=d-c end; a:=2; b:=3; G(a,b);If both parameters to $G$ are p...
2.0k
views
answered
May 24, 2019
Programming in C
tifr2019
programming
parameter-passing
+
–
0
votes
27
Made Easy Test Series: Database-Normalization
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies$F=${$A\rightarrow B$$BC\rightarrow E$$ED\rightarrow A$}Number of additional relation requ...
1.3k
views
answered
May 24, 2019
Databases
databases
made-easy-test-series
database-normalization
+
–
0
votes
28
Morris Mano Edition 3 Exercise 5 Question 10 (Page No. 198)
Design a combinational Circuit that generates the 9’s complement of a BCD digit.?
Design a combinational Circuit that generates the 9’s complement of a BCD digit.?
2.0k
views
answered
Apr 3, 2019
Digital Logic
digital-logic
morris-mano
combinational-circuit
+
–
0
votes
29
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.4 (Page No. 53)
Give DFA's accepting the following languages over the alpabet $\{0,1\}:$ $a)$ The set of all strings ending in $00.$ $b)$ The set of all strings with three consecutive $0's$ (not necessarily at the end)$.$ $c)$ The set of strings with $011$ as a substring.
Give DFA's accepting the following languages over the alpabet $\{0,1\}:$$a)$ The set of all strings ending in $00.$$b)$ The set of all strings with three consecutive $0's...
3.1k
views
answered
Apr 3, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
0
votes
30
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.10 (Page No. 54)
336
views
answered
Apr 3, 2019
Theory of Computation
ullman
theory-of-computation
descriptive
+
–
Page:
1
2
3
4
5
6
...
33
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register