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

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
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 questions without answers
No answer
No selected answer
No upvoted answer
Featured
Previous GATE
No answer
No selected answer
No upvoted answer
Featured
Previous GATE
0
votes
0
answers
1
PIPELINING.
How to find number of stall cycles and branch penalty & CPI in a branched instruction pipelining?
asked
May 21
in
CO & Architecture
by
Ritabrata Dey
(
41
points)

3
views
#computer
coandarchitecture
+1
vote
0
answers
2
Vani Qs Bank Algorithms
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i. Ans should be O(log n) right by doing binary search ??
asked
May 21
in
Algorithms
by
Hirak
Active
(
2k
points)

26
views
algorithms
datastructure
arrays
searching
0
votes
0
answers
3
Sheldon Ross, Chapter #4, Question #13
An airline operates a flight having 50 seats. As they expect some passenger to not show up, they overbook the flight by selling 51 tickets. The probability that an individual passenger will not show up is 0.01, independent of all other ... the airline has to pay a compensation of Rs.1lakh to that passenger. What is the expected revenue of the airline?
asked
May 21
in
Probability
by
Asim Siddiqui 4
Junior
(
809
points)

13
views
probability
randomvariable
sheldonross
+1
vote
0
answers
4
GEEKSFORGEEKS ALGO
What does it mean when we say that an algorithm X is asymptotically more efficient than Y? (A) X will be a better choice for all inputs (B) X will be a better choice for all inputs except small inputs (C) X will be a better choice for all inputs except large ... is it always the case?? At some points it might be true but I do not think this is the case for each and every input..
asked
May 20
in
Algorithms
by
Hirak
Active
(
2k
points)

21
views
algorithms
0
votes
0
answers
5
Made Easy Test Series:Microprogramming
A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which has $130$ control signals $,64$ flags and $12$ branch conditions .$X$ and ... register$(CDR)$ respectively.value of $X+Y$ is ______? How to work with branch condition in micro programming :(
asked
May 20
in
CO & Architecture
by
srestha
Veteran
(
114k
points)

11
views
madeeasytestseries
microprogramming
coandarchitecture
0
votes
0
answers
6
CCMT Admission doubt
Which one is better among NITW CSIS and NITK CSE? Also please let me know the pros and cons of both. Need to change my willingness accordingly before 22nd May. Help from mentors and admins would be much appreciated. Thanks in advance.
asked
May 20
in
NITs
by
shraddha priya
Active
(
3.8k
points)

19
views
admissions
nit
mtech
0
votes
0
answers
7
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
asked
May 20
in
Operating System
by
srestha
Veteran
(
114k
points)

21
views
madeeasytestseries
operatingsystem
processsynchronization
0
votes
0
answers
8
Recurrence RelationSelf Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??
asked
May 19
in
Algorithms
by
srestha
Veteran
(
114k
points)

33
views
discretemathematics
recurrenceeqation
algorithms
0
votes
0
answers
9
ROM(self doubts)
The minimum size of the ROM which maintains truth table of square of 3 bit numbers is __________ (in bits)
asked
May 19
in
CO & Architecture
by
altamash
(
483
points)

9
views
0
votes
0
answers
10
Self doubt Data structures
Implement Linked list using stack.
asked
May 19
in
Programming
by
shraddha priya
Active
(
3.8k
points)

79
views
programminginc
0
votes
0
answers
11
Self Doubt:Operating SystemThreads
User level threads doesnot require context switching This is a true statement (Because OS cannot recognize user level threads) Can somebody elaborate more on it?? This given answer is wrong I think:https://gateoverflow.in/290648/made_easy_test_series Plz check
asked
May 19
in
Operating System
by
srestha
Veteran
(
114k
points)

15
views
operatingsystem
threads
0
votes
0
answers
12
Made Easy Test Series: DatabaseNormalization
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)??
asked
May 19
in
Databases
by
srestha
Veteran
(
114k
points)

23
views
databases
madeeasytestseries
databasenormalization
0
votes
0
answers
13
Mode of OS during page table access
What is the mode(User/Kernel) of the Operating System when a Page Table or TLB are being accessed?
asked
May 18
in
Operating System
by
!KARAN
Active
(
1.8k
points)

13
views
memorymanagement
pagetable
operatingsystem
0
votes
0
answers
14
IIITH INTERVIEW
Why does OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?
asked
May 18
in
Databases
by
shraddha priya
Active
(
3.8k
points)

31
views
iiithpgee
interview
mtech
0
votes
0
answers
15
Made Easy Test Series:AlgorithmDijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??
asked
May 18
in
Algorithms
by
srestha
Veteran
(
114k
points)

26
views
madeeasytestseries
algorithms
0
votes
0
answers
16
Admission through ccmt
In second round of ccmt i got nit warangal csis and if i float again for third round i can get nit surathakal cs ,so for third round should i float or internal sliding for cs of warangal ??please help
asked
May 18
in
NITs
by
Prateek Raghuvanshi
Boss
(
10.2k
points)

65
views
admissions
nit
0
votes
0
answers
17
CCMT 2019
If Anyone got NIT Rourkela IS/SE or IIIT A in CCMT 2nd Round, then please comment the score along with category so that it will be useful
asked
May 18
in
Written Exam
by
Ashok
(
391
points)

22
views
0
votes
0
answers
18
Made Easy Test Series:AlgorithmTime Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??
asked
May 18
in
Algorithms
by
srestha
Veteran
(
114k
points)

33
views
algorithms
madeeasytestseries
timecomplexity
0
votes
0
answers
19
Self Doubt:Mathematical Logic
Represent these two statement in first order logic: $A)$ Only Alligators eat humans $B)$ Every Alligator eats humans Is Every represents $\equiv \exists$ and Only represents $\equiv \forall$ ?? Can we differentiate it with verb ‘eat’ and ‘eats’??
asked
May 18
in
Mathematical Logic
by
srestha
Veteran
(
114k
points)

13
views
discretemathematics
mathematicallogic
firstorderlogic
0
votes
0
answers
20
carry look ahead adder vs ripple carry
$ExclusiveOR$ gate has a propagation delay of $10$ ns and that the $AND$ or $OR$ gates have a propagation delay of $5$ ns.What is the total propagation delay time in the fourbit adder.Assume $FANIN =2$ $1)$ ripple adder $2)$ carry look ahead adder
asked
May 16
in
Digital Logic
by
jk_1
Active
(
1.1k
points)

18
views
digitallogic
0
votes
0
answers
21
Made Easy Test Series: AlgorithmReverse Polish Notation
Consider the neworder strategy for traversing a binary tree: Visit the root Visit the right subtree using neworder Visit the left subtree using neworder The neworder traversal of expression tree corresponding to the reverse polish expression 3 4 * 5 – 2 ^ 6 7 * 1 + – What will be expression, any procedure for it??
asked
May 16
in
Compiler Design
by
srestha
Veteran
(
114k
points)

38
views
infixpostfix
algorithms
timecomplexity
0
votes
0
answers
22
Made Easy Test Series:FlipFlop
A Finite State Machine(FSM) is implemented using the DFFs A and B with logic gates as shown below. The four possible states of FSM are $Q_{A}Q_{B}=00,01,10,11$. Assume that $X_{in}$ is held at constant logic level throughout the operation of FSM. ... states if $X_{in}=0$ How do we check $X_{in}$ here? Can we check it arbitrarily, or checked with prev states??
asked
May 16
in
Digital Logic
by
srestha
Veteran
(
114k
points)

26
views
digitallogic
flipflop
madeeasytestseries
0
votes
0
answers
23
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??
asked
May 15
in
Compiler Design
by
srestha
Veteran
(
114k
points)

155
views
compilerdesign
madeeasytestseries
0
votes
0
answers
24
Discrete Mathematics by Kenneth Rosen,section2.4,recursive functions
$C_{a}^{k}:\mathbb{N}^{k}\rightarrow \mathbb{N}$ I am studying discrete math from beginnings and came across this term in primitive recursive function.I don't know what $C_{a}^{k}$ means and does $\mathbb{N}$ means set of natural numbers?Someone please help me out.
asked
May 15
in
Set Theory & Algebra
by
souren
(
21
points)

31
views
discretemathematics
settheory&algebra
kennethrosen
0
votes
0
answers
25
Made Easy Test Series: Digital Logic
A $3\times 8$ decoder with $2$ enable inputs is used to address $8$ block of memory. What will be the size of each memory block when addressed from a $16$ bit bus with $2$ MSB’s used to enable the decoder?
asked
May 15
in
Digital Logic
by
srestha
Veteran
(
114k
points)

24
views
digitallogic
madeeasytestseries
decoder
0
votes
0
answers
26
GATE2011 Aptitude Set 3  GA7
Given that $f(y)=\frac{y}{y},$ and $q$ is nonzero real number $,$ the value of $f(q)f(q)$ is $0$ $1$ $1$ $2$
asked
May 14
in
Numerical Ability
by
Lakshman Patel RJIT
Boss
(
36.3k
points)

19
views
generalaptitude
numericalability
gate2011aptiset3
0
votes
0
answers
27
Made Easy Test Series: Computer NetworkDijkstra Algo
Consider Dijkstra's algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connecting $u$ to $v.$ Ram then implements the rest of the algorithm ... costs where all routing table entry will be correct. $D)$ Both $A)$ and $B)$ How Dijkstra working here?
asked
May 14
in
Computer Networks
by
srestha
Veteran
(
114k
points)

22
views
computernetworks
madeeasytestseries
0
votes
0
answers
28
Made Easy Test Series: Operating SystemMemory Mapped I/O
Which of the following best characterize by Memory Mapped I/O? $A)$ Additional hardware for bus is required to control the IO bus and memory bus. $B)$ Some of the address space is separated from memory space and assigned them to I/ ... is used $D)$ None of these I havenot got this answer to Galvin. Someone plz. give the concept used here .
asked
May 14
in
Operating System
by
srestha
Veteran
(
114k
points)

14
views
operatingsystem
madeeasytestseries
0
votes
0
answers
29
Rosen 7e Exercise 8.2 Questionno26 page no525 Recurrence Relation
What is the general form of the particular solution guaranteed to exist of the linear nonhomogeneous recurrence relation $a_n$=$6a_{n1}$$12a_{n2}$+$8a_{n3}$+F(n) if F(n)=$n^2$ F(n)=$2^n$ F(n)=$n2^n$ F(n)=$(2)^n$ F(n)=$n^22^n$ F(n)=$n^3(2)^n$ F(n)=3
asked
May 14
in
Combinatory
by
aditi19
Active
(
3.5k
points)

24
views
kennethrosen
discretemathematics
#recurrencerelations
recurrence
+2
votes
0
answers
30
GATE2010 Aptitude Set 3  GA6
It has taken fiftysix long and frustrating, years to turn bronze, into gold for India's Olympics aspirations$.$ Beijing $2008$ marks a defining moment in India's Olympic history$.$ From Delhi to Beijing is a long journey but one that ... India's Olympic history. Our Olympians have undertaken a long journey to Beijing. India's bronze medal turned into gold at Beijing.
asked
May 14
in
Verbal Ability
by
Lakshman Patel RJIT
Boss
(
36.3k
points)

11
views
generalaptitude
verbalability
gate2010aptiset3
Page:
1
2
3
4
5
6
...
511
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIT Kanpur MS Interview experience
My GATE preparation and what you can learn from it
IIT Bombay RA (2019) Programming Questions
COAP Round 1 has started
MTECH (COUURSE WORK) AI INTERVIEW EXPERIENCE 2019
All categories
General Aptitude
Engineering Mathematics
Digital Logic
Programming & DS
Algorithms
Theory of Computation
Compiler Design
Operating System
Databases
CO & Architecture
Computer Networks
Non GATE
Others
Admissions
Exam Queries
Tier 1 Placement Questions
Job Queries
Projects
Follow @csegate
Recent questions without answers
Recent Blog Comments
It was free when I gave them, maybe they made it...
The tests are there but it ain't free. Cost is...
They removed their tests recently, I think it'll...
how did you get Success gateway test series for...
49,408
questions
53,593
answers
185,824
comments
70,874
users