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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent activity by Mk Utkarsh
User Mk Utkarsh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Mk Utkarsh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
MadeEasy Test Series: CO & Architecture  Clock Frequency
Consider 1 GHz clock frequency processor, uses different operand accessing models shown below: Assume that 2 memory cycles consumed for memory reference, 3 cycles consumed for arithmetic computation and 1 cycle consumed when the operand is in ... (in million words/sec) of processor is __________ (upto 2 to decimal places).(ANSWER344.82)
edited
Jun 6
in
CO & Architecture

509
views
madeeasytestseries
coandarchitecture
clockfrequency
1
answer
2
MadeEasy Subject Test: CO & Architecture  Addressing Modes
edited
Jun 4
in
CO & Architecture

167
views
coandarchitecture
addressingmodes
madeeasytestseries
2
answers
3
Interrupt
GATE 2009 A CPU generally handles an interrupt by executing an interrupt service routine As soon as an interrupt is raised. By checking the interrupt register at the end of fetch cycle. By checking the interrupt register after finishing the execution of the ... am having confusion between option A and C... For hardware interrupt option A is suitable and for software interrupt option C
answered
Jun 4
in
CO & Architecture

358
views
coandarchitecture
interrupts
isr
0
answers
4
Doubt: Little Endian and Big Endian
I understand what is little endian and big endian. Suppose $\text{90AB12CD}_{16}$, this is the integer that is supposed to be stored in the memory. Then in big endian, we store like this. The most significant byte at the lower address. . ... strange for me, because most of the time we think, the first byte is from the rightmost side. Please, someone, confirm.
edited
Jun 1
in
CO & Architecture

335
views
coandarchitecture
computer
1
answer
5
MadeEasy Test Series 2018: Calculus  Limits
The value of $\lim_{x\rightarrow \infty }\left ( \frac{4^{x+2} + 3^{x}}{4^{x2}} \right )$ is ____________
answer selected
May 29
in
Calculus

140
views
engineeringmathematics
calculus
limits
madeeasytestseries
1
answer
6
MadeEasy WorkBook: Algorithms  Sorting
Consider the following array with 7 elements for insertion sort? 25, 15, 30, 9, 99, 20, 26 In how many passes, the given sequence will be sorted? (a) 4 pass (b) 5 pass (c) 6 pass (d) More than 6 pass Answer is 6 passes. Can anyone explain it step by step.
answer selected
May 27
in
Algorithms

120
views
madeeasybooklet
algorithms
sorting
2
answers
7
GATE2008IT10
Arrange the following functions in increasing asymptotic order: $n^{1/3}$ $e^n$ $n^{7/4}$ $n \log^9n$ $1.0000001^n$ a, d, c, e, b d, a, c, e, b a, c, d, e, b a, c, d, b, e
commented
May 27
in
Algorithms

3.4k
views
gate2008it
algorithms
asymptoticnotations
normal
1
answer
8
Maths: Limits
$\LARGE \lim_{n \rightarrow \infty} \frac{n^{\frac{3}{4}}}{log^9 n}$
answered
May 27
in
Calculus

97
views
engineeringmathematics
calculus
limits
1
answer
9
Cormen Edition 3 Exercise 3.2 Question 5 (Page No. 60)
Which is asymptotically larger: $lg(lg^*n)$ and $lg^*(lg n)$ ?
answered
May 25
in
Algorithms

25
views
cormen
algorithms
asymptoticnotations
descriptive
difficult
0
answers
10
Made Easy Test Series:Compiler DesignCLR parser
$S\rightarrow aAbAcdc$ $A\rightarrow d$ Number of states in $CLR\left ( 1 \right )$ parser construction _______________ Is $S\rightarrow d.c$ $A\rightarrow d.,a$ will be in $1$ state or in $2$ different states??
commented
May 17
in
Compiler Design

186
views
compilerdesign
madeeasytestseries
2
answers
11
Permutation & Combination Self Doubt
How many 4 letter combinations can be made with the help of letters of the word STATISTICS?
commented
May 16
in
Numerical Ability

120
views
permutationandcombination
generalaptitude
1
answer
12
SLR(1)
Is the given grammar SLR(1)? $\text{E}\rightarrow \text{T+E  T}$ $\text{T}\rightarrow i$
edited
May 14
in
Compiler Design

200
views
compilerdesign
parsing
normal
2
answers
13
LL1 Parsers
answered
May 13
in
Compiler Design

127
views
compilerdesign
parsing
1
answer
14
LL1 parsing
Find first and follow of given grammer E > E+T / T T > T*F / F F > (E) / id
answer selected
May 13
in
Compiler Design

346
views
firstandfollow
parsing
0
answers
15
Find Asymptotic upper bound (http://www.csd.uwo.ca/~moreno/CS433CS9624/Resources/master.pdf)
commented
Apr 19
in
Algorithms

95
views
asymptoticnotations
timecomplexity
5
answers
16
GATE200335
Consider the following recurrence relation $T(1)=1$ $T(n+1) = T(n)+\lfloor \sqrt{n+1} \rfloor$ for all $n \geq 1$ The value of $T(m^2)$ for $m \geq 1$ is $\frac{m}{6}\left(21m39\right)+4$ $\frac{m}{6}\left(4m^23m+5\right)$ $\frac{m}{2}\left(3m^{2.5}11m+20\right)5$ $\frac{m}{6}\left(5m^334m^2+137m104\right)+\frac{5}{6}$
edited
Apr 8
in
Algorithms

3.4k
views
gate2003
algorithms
timecomplexity
recurrence
difficult
1
answer
17
MadeEasy Test Series: Operating System  Fork
closed
Apr 6
in
Operating System

61
views
operatingsystem
fork
madeeasytestseries
1
answer
18
Cormen Edition 3 Exercise 3.1 Question 2 (Page No. 52)
Show that for any real constants $a$ and $b$, where $b > 0,$ $(n+a)^b=\Theta(n^b)$
answered
Apr 5
in
Algorithms

27
views
cormen
algorithms
asymptoticnotations
descriptive
1
answer
19
UGCNETDec2012III10
List  I List  II a. Application layer 1. TCP b. Transport layer 2. HDLC c. Network layer 3, HTTP d. Data layer 4. BGP a b c d A 2 1 4 3 B 3 4 1 2 C 3 1 4 2 D 2 4 1 3
answer selected
Mar 26
in
Computer Networks

501
views
ugcnetdec2012iii
computernetworks
osiprotocol
1
answer
20
CNGATEBOOK
I think for (C), it should be The probability of "not detecting" a burst error of size 9 is $\frac{1}{2^7}$ And for (D), the probability of detecting burst error of size 15 should be $1\frac{1}{2^8}$ Correct me if I am wrong.
commented
Mar 23
in
Computer Networks

109
views
computernetworks
crcpolynomial
1
answer
21
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 9 (Page No. 252)
Sixteenbit messages are transmitted using a Hamming code. How many check bits are needed to ensure that the receiver can detect and correct singlebit errors? Show the bit pattern transmitted for the message 1101001100110101. Assume that even parity is used in the Hamming code.
answered
Mar 22
in
Computer Networks

22
views
computernetworks
datalinklayer
tanenbaum
hammingcode
3
answers
22
Kenneth Rosen Edition 7th Exercise 1.4 Question 6 (Page No. 53)
Let $N(x)$ be the statements “$x$ has visited North Dakota,” where the domain consists of the students in your school. Express each of these quantifications in English. $\exists x N(x)$ $\forall x N(x)$ $\sim \exists x N(x)$ $\exists x \sim N(x)$ $\sim \forall x N(x)$ $\forall x \sim N(x)$
answered
Mar 16
in
Mathematical Logic

23
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
2
answers
23
Kenneth Rosen Edition 7th Exercise 1.3 Question 18 (Page No. 35)
show that $p \rightarrow q$ and $\sim q \rightarrow \sim p$ are logically equivalent.
answer selected
Mar 16
in
Mathematical Logic

17
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
4
answers
24
Kenneth Rosen Edition 7th Exercise 1.4 Question 5 (Page No. 53)
Let $P(x)$ be the statement “x spends more than five hours every weekday in class.” where the domain for x consists of all students. Express each of these qualifications in English. $\exists x P(x)$ $\forall x P(x)$ $\exists x \sim p(x)$ $\forall x \sim P(x)$
answered
Mar 16
in
Mathematical Logic

47
views
kennethrosen
discretemathematics
mathematicallogic
propositionallogic
1
answer
25
Kenneth Rosen Edition 6th Exercise 6.4 Question 33 (Page No. 442)
Use generating function to solve the recurrence relation $a_k=3{a_{k1}} + 2$ with initial conditions $a_0=1 $.
edited
Mar 7
in
Combinatory

258
views
kennethrosen
discretemathematics
generatingfunctions
1
answer
26
Rosen 7e, Advance Counting techniques , Question 6.f
Find the generating function for the sequence $\left \{ a_n \right \} where $ $a_n = \Large \binom{10}{n+1} $ ... $\Large \color{red}{ \frac{( 1+x )^{10}  1}{x} }$ Please verify
commented
Mar 7
in
Combinatory

43
views
kennethrosen
discretemathematics
generatingfunctions
1
answer
27
Peter Linz Edition 4 Exercise 3.2 Question 10.b (Page No. 88)
What is the regular expression for this
commented
Feb 22
in
Theory of Computation

168
views
theoryofcomputation
peterlinz
finiteautomata
regularlanguages
regularexpressions
0
answers
28
TANCET 2016 SQL
commented
Feb 17
in
Databases

16
views
tancet
0
answers
29
ER Model. Please explain the answer.
Please explain the answer.
edited
Feb 17
in
Databases

46
views
er
erdiagram
relationalmodel
2
answers
30
counting
Three different numbers are selected from the set X = {1,2,3,4,…,10}. What is the probability that the product of two of the numbers is equal to the third? (a) 3/10 (b) 1/40 (c) 1/20 (d) 4/5
recategorized
Feb 8
in
Numerical Ability

675
views
generalaptitude
8
answers
31
GATE201912
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n1)!$ $1$ $\frac{(n1)!}{2}$
commented
Feb 7
in
Graph Theory

2.9k
views
gate2019
engineeringmathematics
discretemathematics
graphtheory
graphconnectivity
1
answer
32
Probability: Poisson distribution calculation vs normal probability calculation
In this question if we do simply probability calculation then it is 8/20 40% but when I am appling poisson distribution then it is 40.4%. why we are getting two different answers??
answered
Feb 2
in
Mathematical Logic

188
views
engineeringmathematics
probability
poissondistribution
0
answers
33
Arrangement
Number of ways we can arrange 5 books in 3 selves___________
commented
Jan 31
in
Combinatory

91
views
permutationandcombination
1
answer
34
MadeEasy Test Series: Databases  Database Normalization
Consider a database with the following relation: Shipping (ShipName, ShipType, TripId, Cargo, Port. Date) With the following functional dependencies: sorry for not typing ,i will type it later my doubt isisn’t partial dependency $ShipName\rightarrow ShipType$ present in new database??
answered
Jan 31
in
Databases

114
views
databases
databasenormalization
madeeasytestseries
1
answer
35
#madeeasy testseries
Caption
closed
Jan 31
in
Databases

42
views
2
answers
36
Databases Multiple granularity
commented
Jan 31
in
Databases

110
views
databases
multiplegranularity
0
answers
37
Databases Multiple granularity
closed
Jan 31
in
Databases

137
views
databases
1
answer
38
B+ tree maximum and minimum height
commented
Jan 30
in
Databases

509
views
btree
indexing
databases
0
answers
39
ME FLT5
Consider the following POSETs: Which of the above POSETs are isomorphic to (P (S), ⊆), where S = {a, b, c}?
recategorized
Jan 30
in
Set Theory & Algebra

71
views
engineeringmathematics
5
answers
40
GATE19973.1
Let $\left(Z, *\right)$ be an algebraic structure where $Z$ is the set of integers and the operation $*$ is defined by $n*m = \max(n,m)$. Which of the following statements is true for $\left(Z, *\right)$? $\left(Z, *\right)$ is a monoid $\left(Z, *\right)$ is an Abelian group $\left(Z, *\right)$ is a group None of the above
edited
Jan 30
in
Set Theory & Algebra

1.7k
views
gate1997
settheory&algebra
groups
normal
49,576
questions
54,182
answers
187,506
comments
71,143
users