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.
Answers by smartmeet
User smartmeet
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User smartmeet
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
How to find the complexity of T(n)=T(sqrt(n)) + 1 ?
answered
Feb 12
in
Algorithms

3.1k
views
algorithms
recurrence
0
votes
2
Gatebook mock
answered
Feb 8
in
CO & Architecture

339
views
gatebook_mt2
co&architecture
speedup
+1
vote
3
gatebook mt2 qn36
Consider a simple inorder fivestage pipeline with a twocycle branch misprediction penalty and a singlecycle loaduse delay penalty. For a specific program, 30% of the instructions are loads, 20% are branches, the remaining 50% ... instruction, and 75% of branches are predicted correctly. What is the average CPI of this program on this processor?
answered
Feb 8
in
CO & Architecture

593
views
co&architecture
machineinstructions
clockcycle
+2
votes
4
Test series: gatebook mock 2
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair ... m = 1 (C) M = 7, m = 4 (D) M = 6, m = 4 Shouldn't the answer be D?
answered
Feb 8
in
Graph Theory

137
views
gatebook_mt2
0
votes
5
Gatebook_MockTest2(Aptitude)
There are two examinations rooms A and B. If 10 students are sent from A to B, then the number of students in each room is the same. If 20 candidates are sent from B to A, then the number of students in A is double the number of students in B. The number of students in room A is: (A) 20 (B) 80 (C) 100 (D) 200
answered
Feb 8
in
Numerical Ability

76
views
gatebook_mt2
0
votes
6
No. of Tokens
answered
Feb 7
in
Compiler Design

174
views
+1
vote
7
GateBook Mock 2
According to me option B is correct.
answered
Feb 7
in
Theory of Computation

97
views
gatebook_mt2
theoryofcomputation
0
votes
8
Gatebook_Mocktest2(Propositional Logic)
answered
Feb 7
in
Mathematical Logic

94
views
gatebook_mt2
mathematicallogic
propositionallogic
+2
votes
9
GateBook_MockTest2(Programming)
answered
Feb 7
in
Programming

58
views
programminginc
gatebook_mt2
0
votes
10
Made Easy CBT20172Q22
Please explain how they merged.
answered
Feb 3
in
Databases

127
views
madeeasytestseries
cbt2017
databases
erdiagram
+1
vote
11
Predict the result of SQL query
answered
Feb 3
in
Databases

71
views
databases
sql
0
votes
12
GATE 2016249
Consider a nonnegative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______
answered
Feb 1
in
Operating System

1.6k
views
gate20162
operatingsystem
semaphore
normal
numericalanswers
+1
vote
13
GATE200664
Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by ... to the process with the lowest process id. The average turn around time is: 13 units 14 units 15 units 16 units
answered
Feb 1
in
Operating System

1k
views
gate2006
operatingsystem
processschedule
normal
+3
votes
14
MADEEASY
S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) Number of serial schedules which are view equal to above S are __. Polygraph that I drew:
answered
Jan 30
in
Databases

227
views
databases
madeeasytestseries
view_serializable
+1
vote
15
GATE2014137
There are 5 bags labeled 1 to 5. All the coins in a given bag have the same weight. Some bags have coins of weight 10 gm, others have coins of weight 11 gm. I pick 1, 2, 4, 8, 16 coins respectively from bags 1 to 5. Their total weight comes out to 323 gm. Then the product of the labels of the bags having 11 gm coins is ___.
answered
Jan 30
in
Algorithms

880
views
gate20141
algorithms
numericalanswers
normal
+1
vote
16
GATE20152_33
Which one of the following hash functions on integers will distribute keys most uniformly over 10 buckets numbered 0 to 9 for $i$ ranging from 0 to 2020? $h(i) = i^2 \text{mod } 10$ $h(i) = i^3 \text{mod } 10$ $h(i) = (11 \ast i^2) \text{mod } 10$ $h(i) = (12 \ast i^2) \text{mod } 10$
answered
Jan 25
in
Algorithms

1.1k
views
gate20152
algorithms
hashing
normal
+2
votes
17
GATE20152_40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
answered
Jan 25
in
Set Theory & Algebra

2.7k
views
gate20152
settheory&algebra
functions
normal
numericalanswers
+1
vote
18
testbook compiler
answered
Jan 25
in
Compiler Design

75
views
testbooktestseries
testseries
compilerdesign
+1
vote
19
ACE TEST SERIES
answered
Jan 25
in
Computer Networks

45
views
+2
votes
20
Consider a system with the main memory size of 32MB and each process size 4MB
answered
Jan 24
in
Operating System

151
views
operatingsystem
+1
vote
21
solve
How many view equal serial schedules possible for the following schedule? S : w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A
answered
Jan 22
in
Databases

786
views
databases
+1
vote
22
how many view equivalent serial schedules are possible
answered
Jan 22
in
Databases

520
views
transactions
0
votes
23
GATE200577, ISRO201655
The relation book (title,price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list? select title from book as B where (select count(*) ... Title of the fifth most inexpensive book Title of the fifth most expensive book Titles of the five most expensive books
answered
Jan 19
in
Databases

2.5k
views
gate2005
databases
sql
easy
isro2016
0
votes
24
Which is maximum Planar graph whose Line Graph is Planar?(Check the answer)
answered
Jan 14
in
Graph Theory

39
views
+3
votes
25
How many maximum cycles possible in any Complete graph? (Unlabelled nodes)
answered
Jan 14
in
Graph Theory

143
views
graphtheory
cycle
0
votes
26
GATE200941
The above DFA accepts the set of all strings over {0,1} that begin either with 0 or 1. end with 0. end with 00. contain the substring 00.
answered
Jan 13
in
Theory of Computation

603
views
gate2009
theoryofcomputation
finiteautomata
easy
0
votes
27
made easy mock test
19 If a system has 16 kB memory and buddy system is used to allocate the memory for process during runtime. Consider the following sequence: Process P1 of size 7 kB loaded Process P2 of size 4 kB loaded Process P1 is terminated ... 6 kB loaded Process P4 of size 3 kB loaded How much space is wasted due to internal fragmentation _______ (in kB).
answered
Jan 12
in
Operating System

65
views
0
votes
28
REgular and cfl
Why (a+b)*.an bn regular?
answered
Jan 12
in
Theory of Computation

60
views
0
votes
29
Digital Logic/Virtual Gate test
answered
Jan 10
in
Digital Logic

79
views
digitallogic
flipflop
counter
virtualgate
0
votes
30
Subtraction from Hex to Binary
(012.25)16  (101110.101)2 = (__)2 = (__)10
answered
Jan 10
in
Digital Logic

65
views
digitallogic
numberrepresentation
+4
votes
31
GATE2014139
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is ________
answered
Jan 5
in
Algorithms

3.2k
views
gate20141
algorithms
numericalanswers
normal
0
votes
32
Eigen Values of special matrices
answered
Jan 3
in
Linear Algebra

197
views
engineeringmathematics
eigenvalue
linearalgebra
+1
vote
33
GATE 2005 Probability and line
Using given data ponts tabulated below a straight line passing through origin is fitted using least squares method the slope of the line is x 1 2 3 y 1.5 2.2 2.7 .9 1 1.1 1.5
answered
Dec 30, 2016
in
Probability

94
views
probability
+1
vote
34
Probability Binomial Distribution
answered
Dec 30, 2016
in
Probability

236
views
binomialtheorem
probability
0
votes
35
Probability
In a certain group of computer personnel, 65% have insufficient knowledge of hardware, 45% have inadequate idea of software and 70% are in either one (or) both of the two categories. What is the percentage of people who knpw software among those who have a sufficient knowledge of hardware? 0.35/0.3 0.3/0.35 0.3 0.35
answered
Dec 30, 2016
in
Probability

92
views
probability
Page:
1
2
next »
23,414
questions
30,126
answers
67,509
comments
28,443
users