The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by abhishekmehta4u
User abhishekmehta4u
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User abhishekmehta4u
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
UGCNETJan2017III: 32
Any decision tree that sorts $n$ elements has height $\Omega (\lg n)$ $\Omega ( n)$ $\Omega (n \lg n)$ $\Omega ( n^{2})$
answered
Mar 26
in
Algorithms

68
views
ugcnetjan2017iii
algorithms
trees
2
answers
2
UGCNETJan2017III: 33
Redblack 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)$
answered
Mar 26
in
Algorithms

38
views
ugcnetjan2017iii
algorithms
redblacktree
2
answers
3
UGCNETJan2017III: 35
Dijkstra’s algorithm is based on Divide and conquer paradigm Dynamic programming Greedy approach Backtracking paradigm
answered
Mar 26
in
Algorithms

54
views
ugcnetjan2017iii
algorithms
dijkstrasalgorithm
2
answers
4
UGCNETJan2017III: 34
The minimum number of scalar multiplication required, for parenthesization of a matrixchain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
answered
Mar 26
in
Algorithms

53
views
ugcnetjan2017iii
algorithms
matrixchainordering
2
answers
5
UGCNETJan2017III: 39
Consider the following JAVA program: public class First { public static int CBSE (int x) { if (x < 100)x = CBSE (x+10); return (x1); } public static void main(String[]args){ System.out.print(First.CBSE(60)); } } What does this program print? $59$ $95$ $69$ $99$
answered
Mar 26
in
Object Oriented Programming

52
views
ugcnetjan2017iii
objectorientedprogramming
java
2
answers
6
UGCNETJan2017III: 36
Match the following with respect to algorithm paradigms: ...
answered
Mar 26
in
Algorithms

77
views
ugcnetjan2017iii
algorithms
2
answers
7
UGCNETJune2019II: 35
Which of the following key constraints is required for functioning of foreign key in the context relational databases? Unique key Primary key Candidate key Check key
commented
Jul 20, 2019
in
Databases

618
views
ugcnetjune2019ii
candidatekeys
0
answers
8
Self Doubt : Ambiguity
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?
commented
Jul 18, 2019
in
Theory of Computation

197
views
theoryofcomputation
finiteautomata
ambiguous
regularlanguages
contextfreelanguages
context
2
answers
9
UGCNETJune2019II: 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=m1$ and $m=701$. For $k=123456$, what is the difference between first and second probes in terms of slots? $255$ $256$ $257$ $258$
answered
Jul 17, 2019
in
Algorithms

526
views
ugcnetjune2019ii
doublehashing
5
answers
10
UGCNETJune2019II: 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$
answered
Jul 17, 2019
in
Operating System

302
views
ugcnetjune2019ii
cpuscheduling
2
answers
11
UGCNETJune2019II: 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$'s. Every string ... Every string produced by the grammar have $b$'s in multiple of $2$. a only b and c only d only c and d only
answered
Jul 17, 2019
in
Theory of Computation

347
views
ugcnetjune2019ii
grammar
strings
4
answers
12
UGCNETJune2019II: 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$
answered
Jul 17, 2019
in
Computer Networks

2.3k
views
ugcnetjune2019ii
subnetting
2
answers
13
Process Synchronization
If there are n processes executing concurrently using binary semaphore S , (n1) processes have the code do{ wait(S); <c.s> signal(s); <r.s>}while(1); the code for the nth process i.e Pn is given by do{ signal(S); <c.s> wait(S); <r. ... ; a) What is the max no. of processes that can be there in the critical section simultaneosly ? A. 2 B . 3 C. n1 D. n
commented
Jun 15, 2019
in
Operating System

234
views
processsynchronization
operatingsystem
criticalsection
2
answers
14
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
commented
Jun 13, 2019
in
Operating System

309
views
memorymanagement
paging
operatingsystem
multilevelpaging
pagetable
selfdoubt
1
answer
15
Cd me doubt static
commented
Jun 8, 2019
in
Compiler Design

69
views
1
answer
16
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}
commented
Jun 8, 2019
in
Compiler Design

100
views
compilerdesign
follow
first
2
answers
17
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.
commented
Jun 7, 2019
in
Theory of Computation

459
views
theoryofcomputation
finiteautomata
regulargrammar
4
answers
18
COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?
answered
Jun 5, 2019
in
Compiler Design

192
views
compilerdesign
ll1parser
syntaxdirectedtranslation
3
answers
19
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.
answered
Jun 5, 2019
in
Graph Theory

152
views
1
answer
20
ISIPCB2015C1b
A $64000$byte message is to be transmitted over a $2$hop path in a storeandforward packetswitching network. The network limits packets toa maximum size of $2032$ bytes including a $32$byte header. The transmission 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.
answered
Jun 4, 2019
in
Computer Networks

214
views
userisi2015
usermod
computernetworks
ippacket
networklayer
2
answers
21
Made Easy Test Series:Data StructureStack
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??
answered
Jun 1, 2019
in
DS

280
views
madeeasytestseries
datastructures
stack
5
answers
22
GATE2017 CE2: GA4
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}$
answered
Jun 1, 2019
in
Numerical Ability

276
views
gate2017ce2
ratioproportion
numericalability
2
answers
23
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
answered
May 31, 2019
in
Operating System

320
views
madeeasytestseries
operatingsystem
processsynchronization
2
answers
24
MadeEasy Test Series: Theory Of Computation  Regular Languages
Consider the following statements: $S_1:\{(a^n)^mn\leq m\geq0\}$ $S_2:\{a^nb^nn\geq 1\} \cup \{a^nb^mn \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
answered
May 28, 2019
in
Theory of Computation

440
views
madeeasytestseries
theoryofcomputation
regularlanguages
2
answers
25
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 ____
answered
May 27, 2019
in
Linear Algebra

143
views
engineeringmathematics
linearalgebra
3
answers
26
Made easy Workbook 2020
Question: $T(1)=1$ $T(n) = 2 T(n  1) + n$ evaluates to? Can anyone solve it by substitution method? Given answer $T(n) = 2^{n+1}  (n+2)$ How?
commented
May 26, 2019
in
Algorithms

2.4k
views
timecomplexity
algorithms
recurrenceeqation
2
answers
27
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 OPCODE and ... $2^{16}, 2^{24}$ $2^{16},2^{24}1$ $\textrm{None of these}$
answered
May 25, 2019
in
CO and Architecture

400
views
coandarchitecture
addressingmodes
2
answers
28
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
commented
May 25, 2019
in
Databases

502
views
2
answers
29
B+ tree
Database file consists 1250 records.Block can hold either 3 record or (10 key,11 pointer ) The max number of level of index required for dense B+ tree index for daatabase file are _____________________
commented
May 25, 2019
in
Databases

999
views
databases
2
answers
30
TIFR2019B8
Consider the following program fragment: var a,b : integer; procedure G(c,d: integer); begin c:=cd; d:=c+d; c:=dc 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
answered
May 25, 2019
in
Programming

389
views
tifr2019
programming
parameterpassing
52,375
questions
60,583
answers
202,002
comments
95,403
users