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 Tesla!
User Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
CMI2017B7
Consider the following function that takes as input a sequence $A$ of integers with n elements,$A[1],A[2], \dots ,A[n]$ and an integer $k$ and returns an integer value. The function length$(S)$ returns the length of the sequence $S$. Comments ... complexity of this algorithm in terms of the length of the input sequence $A$? Give an example of a worstcase input for this algorithm.
commented
Sep 27, 2019
in
Algorithms

497
views
cmi2017
algorithms
timecomplexity
descriptive
4
answers
2
Minimum number of tables to represent ERDiagram
The minimum number of tables to represent ERDiagram such that the relational database satisfies 1NF.
commented
Aug 22, 2019
in
Databases

2.9k
views
erdiagram
databases
ertorelational
relational
5
answers
3
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}$
commented
Jun 1, 2019
in
Numerical Ability

266
views
gate2017ce2
ratioproportion
numericalability
0
answers
4
Peter Linz Edition 4 Exercise 5.2 Question 15 (Page No. 145)
Show that the grammar with productions $S\rightarrow SS,$ $S\rightarrow \lambda,$ $S\rightarrow aSb,$ $S\rightarrow bSa.$ is ambiguous.
commented
Apr 17, 2019
in
Theory of Computation

51
views
peterlinz
peterlinzedition4
theoryofcomputation
grammar
ambiguous
3
answers
5
ISI2017MMA27
A box contains $5$ fair and $5$ biased coins. Each biased coin has a probability of head $\frac{4}{5}$. A coin is drawn at random from the box and tossed. Then the second coin is drawn at random from the box ( without replacing the first one). Given that the first coin has shown head ... the second coin is fair is $\frac{20}{39}\\$ $\frac{20}{37}\\$ $\frac{1}{2}\\$ $\frac{7}{13}$
commented
Apr 5, 2019
in
Probability

650
views
isi2017mma
engineeringmathematics
probability
4
answers
6
GATE2005IT81b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector of the ... data starting from the sector $4$ of the outermost track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
commented
Mar 26, 2019
in
Operating System

4.7k
views
gate2005it
operatingsystem
disks
normal
0
answers
7
made easy mock 2019
(i)A computer can have multiple MAC addresses (ii)A computer can have multiple IP addresses at different instances of time true/ false?? acc to me (i) false (ii)true
commented
Jan 14, 2019
in
Computer Networks

97
views
1
answer
8
Multi level paging
Im confused with multi level paging As per my understanding the outer most page table must be in main memory and not all inner page tables to be in memory in 2 level paging by this we can save the memory But with this, faults will be more and time ... if we use more levels of paging more faults wil be their Even then why we are using multi level paging Please can someone help me
answer edited
Jan 14, 2019
in
Operating System

538
views
memorymanagement
2
answers
9
array
commented
Jan 9, 2019
in
Programming

223
views
arrays
datastructures
programminginc
6
answers
10
GATE2016150
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n1}$. In the code, function $\text{pmax}$ returns an integer not smaller than any of its arguments .For all $i,t[i]$ is ... can be in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
commented
Dec 29, 2018
in
Operating System

15.8k
views
gate20161
operatingsystem
resourceallocation
difficult
ambiguous
1
answer
11
CMI2017A02
An FM radio channel has a repository of $10$ songs. Each day, the channel plays $3$ distinct songs that are chosen randomly from the repository. Mary decides to tune in to the radio channel on the weekend after her exams. What is the probability that no song gets repeated during ...
commented
Dec 24, 2018
in
Probability

344
views
cmi2017
engineeringmathematics
probability
0
answers
12
General query
Is there internal fragmentation in continuous dynamic partitioning ? After the processes have been allocated the partitions according to their size , there is no internal fragmentation , I agree but what if some processes have completed their execution and left leaving behind the ... which has size smaller than the hole , then will it create a new partion of its size from the hole?
commented
Dec 20, 2018
in
Operating System

28
views
1
answer
13
ISI2004MIII: 12
The maximum possible value of $xy^2z^3$ subjected to condition $x,y,z \geq 0$ and $x+y+z=3$ is $1$ $\frac{9}{8}$ $\frac{9}{4}$ $\frac{27}{16}$
commented
Dec 20, 2018
in
Calculus

470
views
isi2004
engineeringmathematics
maximaminima
6
answers
14
TIFR2019A1
Let $X$ be a set with $n$ elements. How many subsets of $X$ have odd cardinality? $n$ $2^n$ $2^{n/2}$ $2^{n1}$ Can not be determined without knowing whether $n$ is odd or even
answered
Dec 19, 2018
in
Set Theory & Algebra

771
views
tifr2019
engineeringmathematics
discretemathematics
settheory&algebra
sets
1
answer
15
Complement of CFL
How to prove that $\text{"complement of L }= \{WW^R \mid W \in \{a,b\}^*\} \text{ is CFL}" $?
commented
Dec 10, 2018
in
Theory of Computation

1.1k
views
contextfreelanguages
theoryofcomputation
0
answers
16
IP protocol sum
Error Correcting and Detecting Codes: The IP protocol implements Internet checksum over just the IP header. As the packet passes through the routers, one field called Time To Live (TTL) (8bits long) in the IP header is decremented at each router. So ... checksum in the header. Is there a way to update the checksum without having to recalculate the checksum over the entire header?
commented
Nov 28, 2018
in
Computer Networks

104
views
computernetworks
3
answers
17
Peter Linz Edition 4 Exercise 1.2 Question 18 (Page No. 29)
Assume $\sum = \left \{ a,b \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) = n_{b}\left ( w \right ) + 1 \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) > n_{b}\left ( w \right ) \right \}$ ...
answer edited
Nov 22, 2018
in
Theory of Computation

280
views
theoryofcomputation
peterlinz
peterlinzedition4
grammar
0
answers
18
made easy 2019 Q33
how many of the following statements is incorrect regarding the time complexity of binary search tree,AVL Tree, min heap, binary tree? i assumed non existent elements are those which do not exists in a tree, acc to me only (a) is incorrect! because to find any element in BST, It takes O(n) time
commented
Nov 11, 2018
in
DS

353
views
1
answer
19
#Functional Depencency
max number of FD in a relation with 'n' attributes=$2^{2n}$ how this formula is obtained?
commented
Oct 29, 2018
in
Databases

99
views
databasenormalization
databases
1
answer
20
Relation
State True or False? Empty set Φ is an equivalence relation.
commented
Oct 10, 2018
in
Set Theory & Algebra

245
views
relations
0
answers
21
Semaphore
Will it causing deadlock? How do we fixed it? P1: P2: Wait(S); Wait(Q); Wait(Q); Wait(S); ........ ............. Signal(S); Signal(Q); Signal(Q); Signal(S);
commented
Oct 5, 2018
in
Operating System

239
views
operatingsystem
semaphore
processsynchronization
0
answers
22
internal path length of complete binary tree
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
commented
Oct 3, 2018
in
Algorithms

809
views
al
binarytree
datastructures
graphalgorithms
4
answers
23
GATE200464
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ \begin{array}{llc} \hline \text {Instruction} & \text{Operation }& \text{Instruction size (in Words)} \\\hline \text{MOV $R_1,5000$} & ... clock cycles }\\\hline \end{array} The total number of clock cycles required to execute the program is $29$ $24$ $23$ $20$
commented
Oct 2, 2018
in
CO and Architecture

7.5k
views
gate2004
coandarchitecture
machineinstructions
normal
1
answer
24
MadeEasy Test Series: Theory Of Computation  Finite Automata
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using MyhillNerode theorem is ________.
commented
Sep 29, 2018
in
Theory of Computation

191
views
madeeasytestseries
theoryofcomputation
myhillnerode
finiteautomata
1
answer
25
time complexity
If both of the algorithms A and B need O(nlogn) time then they both are equally efficient and finish in same amount of time. TRUE OR FALSE
commented
Sep 29, 2018
in
Algorithms

115
views
timecomplexity
algorithms
asymptoticnotations
0
answers
26
Multilevel paging doubt
Consider a computer system using 2level paging with TLB. The logical address supported is 32 bits. The page table is divided into 512 pages each of size 1KB. Page table entry size at 1st level is 2Bytes and that at the second level is 4 Bytes each. ... level PT)+$512*1KB$(At second level)=$544KB$ Is my analysis correct? Below is the visualisation what I see is happening.
commented
Sep 29, 2018
in
Operating System

260
views
memorymanagement
pagetable
operatingsystem
2
answers
27
time complexity
answered
Sep 29, 2018
in
Algorithms

205
views
2
answers
28
MIT ASSIGNMENT
Find the complexity of the following function when called with some integer n: void foo(n) { int i,j,k,x=0; for (i=1 ; i ≤ n ; i++) for (j=1 ; j ≤ i * i ; j++) { for ( k = 1 ; k ≤ j ; k++) { x=x+10; } }
commented
Sep 29, 2018
in
Algorithms

167
views
algorithms
timecomplexity
asymptoticnotations
0
answers
29
# self doubt
https://gateoverflow.in/3363/gate2008it53 in this question if the producer produced one item after this if the consumer does not want to consume and producer want to produce next , so can i conclude that producer starve forever
commented
Sep 26, 2018
in
Operating System

34
views
1
answer
30
Probability  Gravner66
You are dealt one card at random form a full deck and your opponent is dealt $2$ cards (Without any replacement ). If you get an Ace, he pays you $10$ dollar, if you get a King, he pays you $5$ dollar (regardless of his cards). If you have ... red cards, he pays you $1$ dollar. In all other cases you pay him $1$ dollar . Determine your expected earnings . Are they positive?
answer edited
Sep 26, 2018
in
Probability

58
views
probability
gravner
engineeringmathematics
randomvariable
52,315
questions
60,427
answers
201,753
comments
95,228
users