GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Recent activity by Vijay Thakur
User Vijay Thakur
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Vijay Thakur
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
forouzan 5th edition chapter2 Q23
answer selected
Aug 16
in
Computer Networks

70
views
computernetworks
1
answer
2
speedup
suppose that execution time for a program is proportional to instruction fetch time ,assume that fetching an instruction from the cache takes 1 time unit ,but fetching it from main memory takes 10 time units.Also,assume that a requested ... fetched from main memory into the cache and then etched from the cache to be exexuted.Compute the speedup ratio?
answer selected
Aug 9
in
CO & Architecture

28
views
1
answer
3
Average access time
Consider two level memory systems in which the average access time is 150 ns without level L1 . The level 1 access time is 20 ns . The average access time with L1 is 40 ns. The hit ration of L1 in percengage........ Plz help me to find the correct answer.. I got 88%
answer selected
Aug 9
in
CO & Architecture

42
views
hitratio
1
answer
4
Discrete mathematics example 13 Kenneth rosen
answer selected
Aug 9
in
Mathematical Logic

66
views
3
answers
5
Class of language
answer selected
Aug 3
in
Theory of Computation

43
views
theoryofcomputation
identifyclasslanguage
1
answer
6
Relational Algebra
Answer and explanation please .
answer selected
Jul 30
in
Databases

81
views
1
answer
7
algorithm
best known algorithm to check if a singly linked list is palindrome or not is O(n).......................how?
answer selected
Jul 30
in
Algorithms

30
views
1
answer
8
database
For relation R=(L, M, N, O, P), the following dependencies hold: M→O, NO→P, P→Land L→MN R is decomposed into R1 = (L, M, N, P) and R2 = (M, O).What is the highest normal form satisfied by the above decomposition? My doubt is For R1 it is in 2NF and R2 it is in BCNF .But ,dependency preserving also violates .So whts the highest normal form ?
answer selected
Jul 30
in
Databases

64
views
databases
datadependences
1
answer
9
lan techniques.
can anyone tell me how does the formula (min frame)Lmin = 2* tp(propagation delay) *B (bandwidth)came ?
answer selected
Jul 30
in
Computer Networks

30
views
computernetworks
2
answers
10
Round robin with feedback queues
answer selected
Jul 29
in
Operating System

70
views
1
answer
11
CLR 3rd edition , page no 87, Q.no. 4.36
answer selected
Jul 29
in
Algorithms

63
views
algorithms
2
answers
12
frquency
a flip flop has a delay of 10 ns from the time clock edge applied to the time the output is obtained .There is a mode mode 10 ripple counter that uses this type of flip flop .The maximum delay in output is ...........................................
answer selected
Jul 29
in
Digital Logic

86
views
digitallogic
1
answer
13
UGCNETAUG2016III56
Given a Turing Machine M = ({q0 , q1 }, {0, 1}, {0, 1, B}, δ, B, {q1 }) Where δ is a transition function defined as δ(q0 , 0) = (q0 , 0, R) δ(q0 , B) = (q1 , B, R) The language L(M) accepted by Turing machine is given as : (1) 0* 1* (2) 00* (3) 10* (4) 1*0*
answer selected
Jul 29
in
Theory of Computation

96
views
1
answer
14
Identify the language
L = { w  w $\epsilon$ (a,b)* and #a(w)  #b(w) $\leq$ 10}. Is L regular or a CFL?
answer selected
Jul 29
in
Theory of Computation

54
views
laguages
3
answers
15
Toc CFL DCfL
Caption Is this CFL or DCFL or not CFL
answer selected
Jul 29
in
Theory of Computation

64
views
theoryofcomputation
dcfl
contextfreelanguage
1
answer
16
Digital Logic
Number of 3 variable functions possible such that f(x,y,z) = f(x',y,z') is _____
answer selected
Jul 29
in
Digital Logic

63
views
1
answer
17
TOC NFA epssilon transition
In case of NFA, assume i have defined e(epsilon transition) from qo to q1: Now if e comes on qo,then can i stay on same qo or do i need to follow transition from qo to q1?
answered
Jul 29
in
Theory of Computation

39
views
theoryofcomputation
nfa
finiteautomata
1
answer
18
Number of Hamiltonian cycles in a complete graph
answer selected
Jul 28
in
Graph Theory

108
views
graphtheory
cycle
3
answers
19
is canonical cover and minimal cover the same thing?
answer selected
Jul 28
in
Databases

857
views
2
answers
20
testbook test series
First field of the three field I.R. indicates opcode, second addresses a register from a set of 100 registers and the third is the memory address field . A 32 bit instruction is placed in 1 MB memory. If there ... which address both register and memory and l instructions which addresses register, then find the number of zero address instructions.
answer selected
Jul 13
in
CO & Architecture

43
views
1
answer
21
Digital Logic
How many 2input multiplexers are required to construct a 2^10input multiplexer?
answer selected
Jul 13
in
Digital Logic

83
views
digitallogic
multiplexer
2
answers
22
Digital Loig
Number of minterms at the output of 8input EXOR gate is/are ?
answer selected
Jul 13
in
Digital Logic

76
views
digitallogic
1
answer
23
Different equations for Bandwidth delay product from different writers
answer selected
Jul 13
in
Computer Networks

31
views
computernetworks
1
answer
24
peter linz ex. (regular languages)
answer selected
Jul 10
in
Theory of Computation

38
views
1
answer
25
#OS #MULTILEVEL FEEDBACK QUEUE
Consider a system which has a CPU bound process,which require the burst time of 40 seconds.The multilevel Feed Back Queue scheduling algorithm is used and the queue time quantum '2' seconds and in each level it is incremented by '5' seconds.Then how many ... queue the process will terminate the execution? (a) 5,4 (b) 4,5 (c) 3,4 (d) 4,3
answer selected
Jul 10
in
Operating System

310
views
operating
system
multilevel
feedback
queue
scheduling
1
answer
26
Master Theorem
T(n) = 3T(n/2) + $\sqrt[2]{n+3}$ if n > 1 = d if n = 1 2. T(n) = 3T(n/2) + $\sqrt[2]{n^{4}+3}$ if n > 1 = d if n = 1.
answer selected
Jul 10
in
Algorithms

75
views
algorithms
mastertheorem
1
answer
27
MealyMoore machines
Mealy machines do not respond for epsilon whereas Moore machines do. Is this true? Please explain.
answer selected
Jul 10
in
Theory of Computation

184
views
theoryofcomputation
1
answer
28
Regular language
L = { $a^{i}b^{2i} $  i>=1} Is this language regular or not ? Is there any specific way to check weather language is regular or not ?
edited
Jul 5
in
Theory of Computation

23
views
regularlanguages
theoryofcomputation
1
answer
29
UGCNETAUG2016III55
Given the following two languages: $L_1 = \{uww^{r}ν \mid u, v, w \in \{a, b\}^+\}$ $L_2 = \{uww^{r}ν \mid u, ν, w \in \{a, b\}^+ , u > ν\}$ Which of the following is ... regular language. $L_1$ is not regular language and $L_2$ is regular language. Both $L_1$ and $L_2$ are regular languages. Both $L_1$ and $L_2$ are not regular languages.
edited
Jul 4
in
Theory of Computation

70
views
regularlanguages
theoryofcomputation
0
answers
30
CLR 3rd edition , Page no. 49 , second para
edited
Jun 23
in
Algorithms

71
views
algorithms
asymptoticnotations
6
answers
31
GATE200636
Given two three bit numbers $a_{2}a_{1}a_{0}$ and $b_{2}b_{1}b_{0}$ and $c$ the carry in, the function that represents the carry generate function when these two numbers are added is: $a_{2}b_{2}+a_{2}a_{1}b_{1}+a_{2}a_{1}a_{0}b_{0}+a_{2}a_{0}b_{1} ... {0}+a_{1}\overline{b_{2}}b_{1}+\overline{a_{1}}a_{0}\overline{b_{2}}b_{0}+a_{0}\overline{b_{2}b_{1}}b_{0}$
answered
Jun 14
in
Digital Logic

1.5k
views
gate2006
digitallogic
normal
carrygenerator
1
answer
32
Heapsort
Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations have been performed on root of heap?
answer edited
May 3
in
DS

236
views
heapsort
2
answers
33
Sorting
Which sorting algorithim is best if exhactly only half of the elements are in correct position ?
answer edited
Apr 24
in
Others

141
views
sorting
algorithms
2
answers
34
Graph Theory
let G=(V,E) be an connected graph, let $\left  V \right = n$ Find largest value of n such that i) G is complete & ii) G is bipartite with valid proof
commented
Apr 3
in
Algorithms

93
views
graphtheory
3
answers
35
GATE201348
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. ... preserving correctness. What is the minimum number of spills to memory in the compiled code? 0 1 2 3
commented
Apr 2
in
Compiler Design

2.5k
views
outofsyllabusnow
gate2013
normal
compilerdesign
targetcodegeneration
codeoptimization
1
answer
36
ISRO 2012  Mech: Matrices
rank of given matrix is a) 0 b) 1 c) 2 d) 3
answered
Mar 8
in
Linear Algebra

58
views
engineeringmathematics
isro
isromech
2
answers
37
ISRO 2008 ECE PROM
A programmable device (PROM) is (a) programmable OR and fixed AND array (b) programmable AND and fixed OR array (c) programmable AND and programmable OR array (d) none
answered
Mar 2
in
Digital Logic

81
views
isro
isroece
digitallogic
1
answer
38
gatebook mt2
A certain pipelined RISC machine has 8 generalpurpose registers R0, R1, . . . , R7 and supports the following operations. ADD Rs1, Rs2, Rd /* Add Rs1 to Rs2 and put the sum in Rd */ MUL Rs1, Rs2, Rd /* Multiply Rs1 by Rs2 and put the product in ... cycles required for an operation sequence that computes the value of AB + ABC + BC ? (A) 5 (B) 6 (C) 7 (D) 8
commented
Feb 7
in
CO & Architecture

281
views
machineinstructions
co&architecture
clockfrequency
0
answers
39
GATE 2017: Maths: LA
Is manual calculation required to solve this question, or there is some properties can be applied here, btw please solve it.
commented
Feb 6
in
Linear Algebra

165
views
gate_2017
linearalgebra
engineeringmathematics
2
answers
40
Gate 2017 ME
In a company 45 people earn Rs. 20,000 per month, 25 people earn Rs. 30,000 per month, 20 people earn Rs. 40,000, 8 people earns Rs. 60,000 per month and 2 people earn Rs. 150,000 per month. Find median ?
commented
Feb 6
in
Verbal Ability

227
views
27,407
questions
35,256
answers
84,506
comments
33,480
users