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 santhoshdevulapally
User santhoshdevulapally
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User santhoshdevulapally
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
About admission in M.Tech
In CSE, general category I got 36.90 marks, my score is 483 and a rank of 4590 in GATE 2017. Can I get any NIT or any college through CCMT?
commented
Mar 26
in
NITs

108
views
1
answer
2
Database mgmt system
Tell whether the following decomposition of relations lossless and dependency preserving or not. 1. R(ABCDEFGHIJ) and FD sets AB>C, A>DE, B>F, F>GH, D>IJ a) D1"={ DIJ, ACE, FGH, BF, ADC} b) D2={ FGH, DIJ, ADEBF, ABC} 2.R(ABCDEG) and FD sets AB>C, AC>B, AD>E, B>D, BC>A, E>G a) D=( ABC, ACDE, ADG)
answer selected
Feb 4
in
Databases

89
views
databases
losslessjoin
dependencypreserving
functionaldependencies
decomposition
1
answer
3
Testbook 4 Qno 20
#plz check i got 7 ??? but answer is given 2
commented
Jan 29
in
Computer Networks

29
views
testseries
2
answers
4
#Testbook 3 Qno13
is it given correct answer ????
answer selected
Jan 28
in
Linear Algebra

63
views
testseries
1
answer
5
Slow Start Algorithm
Consider the effect of using slow start on a line with 5 millisec round trip time and no congestion. The receiver window is 36 KB and Maximum segement size = 2KB. The time (in milliseconds) before the first full window can be sent is_____
commented
Jan 26
in
Computer Networks

39
views
1
answer
6
tcp frame
Suppose a server transmits one frame of a video every second, and the client starts playing the video at one frame per second as soon as the first frame arrives. Suppose the first ten frames arrive at times 0, 1.2, 1.99, 4.17, 4.01, 5.03, 8.05, 7.50, 8.90, 8.99, all in seconds. Which frames reach the client too late for playout? (A) 7 (B) 3 (C) 6 (D) 5
commented
Jan 25
in
Computer Networks

46
views
computernetworks
tcp
timeout
0
answers
7
CSL AND CFL
1)L={W$W^{R}WW^{R}/ W\epsilon (0+1)^{+}$ } IS THIS CSL OR CFL. 2)L={$a^{m}b^{n}c^{p}/(m=n) or (n=p)}$ } IS THIS DCFL OR CFL. Please construct PDA for 2nd language.  I think 1st is CSL and 2nd is CFL
asked
Jan 25
in
Theory of Computation

45
views
1
answer
8
Test series2.... Complexity
I am posting que as well as its solution.... i am cleared about 1st two loops i and j but how to calculate complexity for innermost loop?? please explain... how this is an answer?
answered
Jan 24
in
Programming

41
views
timecomplexity
testseries
0
answers
9
TCP segement numerical
Suppose an application layer entity wants to send an Lbyte message to its peer process, using an existing TCP connection. The TCP segment consists of the message plus 20 bytes of header. The segment is encapsulated into an IP packet that has an additional 20 bytes of ... ? (A) 67%, 89%, 94% (B) 63%, 90%, 95% (C) 63%, 94%, 89% (D) 56%, 95%, 90%
commented
Jan 22
in
Computer Networks

52
views
1
answer
10
ER diagram
commented
Jan 22
in
Databases

127
views
1
answer
11
virtual gate
I am getting mod2 considering 1st flip flop as Q0
commented
Jan 22
in
Digital Logic

53
views
0
answers
12
Testbook
commented
Jan 22
in
Algorithms

41
views
testbook
testseries
0
answers
13
computer architecture
commented
Jan 21
in
CO & Architecture

53
views
1
answer
14
Made Easy test series
Consider a pipelined processor with 5 stages (IF) Instruction Fetch , (ID) Instruction Decode and operand fetch, (PO) Perform Operation, (MA) Data Memory Access, (WB) Write Back. The IF, ID, MA and WB ... in the pipeline. The maximum number of stalls presents for any instruction in execution of following sequence of instruction is___________.
commented
Jan 21
in
CO & Architecture

71
views
pipeline
madeeasy_testseries
2
answers
15
ME test
The maximum number of orders in which we can insert elements {1,2,3,4,5,6,7} into an empty AVL binary tree so that no rotation need to be performed on it are ______________ (Consider key of root node is 4 always)
commented
Jan 20
in
Algorithms

61
views
1
answer
16
GATE2016Session2GA9
The binary operation is defined as a b = ab+(a+b), where a and b are any two real numbers. The value of the identity element of this operation, defined as the number x such that a x = a, for any a, is . $0$ $1$ $2$ $10$
commented
Jan 20
in
Verbal Ability

36
views
gate2016session2aptitude
1
answer
17
no of clock cycles
commented
Jan 20
in
CO & Architecture

53
views
co&architecture
pipeline
madeeasy_testseries
1
answer
18
DatabaseNormalisation
Determine the highest normal for relation R(A,B,C,D) AB →C BC→D
answer selected
Jan 20
in
Databases

108
views
databasenormalization
functionaldependencies
partialdependency
0
answers
19
Matrix
Let matrix p=$\begin{bmatrix} 4 &1 \\ 1& 4 \end{bmatrix}$ if [P4] is $\begin{bmatrix} a &b \\ c&d \end{bmatrix}$then b is _________. ? Answer given is:56
commented
Jan 20
in
Mathematical Logic

45
views
0
answers
20
General Aptitude ME Test Series
commented
Jan 20
in
Verbal Ability

27
views
madeeasy_testseries
1
answer
21
CN. subnet
A company is granted the site address 181.56.0.0. The company needs 1000 subnets. what is the first subnet ID and DBA of the first subnet.
commented
Jan 20
in
Computer Networks

74
views
0
answers
22
which has higher growth rate?
Which grows faster when n increases? $I. n^{\frac{1}{3}}<\frac{n}{logn} II. n^{\frac{1}{3}}>\frac{n}{logn}$
commented
Jan 19
in
Algorithms

39
views
asymptoticnotations
0
answers
23
Linear Algebra
The system of equations 3x1 – 12x2 + 6x3 + 9x4 = 0, 6x1 + 9x2 + 21x3 + 3x4 = 0, 3x1 + 27x2 + 6x3 = 0, –3x2 + 3x4 = 0 has (1) An unique solution (2) Infinite number of solutions (3) No solution (4) Exactly four solutions
commented
Jan 19
in
Mathematical Logic

52
views
linearalgebra
0
answers
24
question
Consider 2 scenarios: C1: For DFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* C2: For NFA (ϕ, Ʃ, δ, qo, F), if F = ϕ, then L = Ʃ* Where F = Final states set ϕ = Total states set (a) Both are true (b) Both are False (c) C1 is true, C2 is false (d) C1 is false, C2 is true
commented
Jan 19
in
Theory of Computation

39
views
0
answers
25
MADE EASY COA
consider a cache memory which is 30 times faster than the main memory and uses 90% of the total time. what is the speedup gain by the cache memory
comment moved
Jan 19
in
CO & Architecture

42
views
0
answers
26
ipv4 & ipv6
commented
Jan 19
in
Computer Networks

83
views
computernetworks
ipv6
ipv4
0
answers
27
Testbook
Couldnt attempt the question. Note that the solution given has powers of 2 instead of 214 and 215 and so on.
commented
Jan 19
in
Operating System

92
views
multilevelpaging
2
answers
28
Integration
what is the integration of this funcion? f(x)=1−x where −1≤x≤1
answered
Jan 18
in
Calculus

81
views
calculus
integration
1
answer
29
ME test electronics
qus 28
answered
Jan 18
in
Digital Logic

40
views
1
answer
30
Lossy Join In database
Consider a schema R (A, B, C, D, E, F) and functional dependencies are A → B, C → D, B → E Which is divided into R, (A, B, E), R2 (C, D, E) then decomposition? (1) Dependency preserving and loss Join (2) Loss less join but not dependency preserving (3) Dependency preserving but not loss join (4) Not dependency preserving and not loss Join
commented
Jan 18
in
Databases

43
views
1
answer
31
testbook
answer selected
Jan 18
in
CO & Architecture

64
views
1
answer
32
Decomposition
Consider a relation R(ABCD) with FD’s {A → D, B → D, D → BC}. What is the minimum number of decomposition required to make above relation BCNF? my doubt is what is "minimum no. of decompostion" ? is it the no. of tables in decomposed form or the no. of splits we have to do to obtain bcnf?
commented
Jan 17
in
Databases

52
views
1
answer
33
Ethernet
Determine the maximum length of cable (in km) for transmitting data at a rate of 5 mbps in a Ethernet LAN frames of size 1000 Bytes and propagation speed is 3 × 108 m/sec. Your Answer: 240 Correct Answer: 48 Status: incorrect
commented
Jan 17
in
Computer Networks

41
views
1
answer
34
Testbook
commented
Jan 17
in
CO & Architecture

50
views
1
answer
35
TestSeries
I am getting 4 RAW dependencies here. Do we have to consider adjacent dependencies only?
commented
Jan 17
in
CO & Architecture

49
views
madeeasy_testseries
dependencies
1
answer
36
Matrix Multiplication
Consider three matrices A (10 × 100), B (100 × 5), C (5 × 50). What is total number of multiplications required? Your Answer: 500 Correct Answer: 7500 Status: incorrect
answered
Jan 17
in
Programming

25
views
1
answer
37
ACE MOCK II
CAN ANYONE EXPLAIN THE WORKING OF THE CODE..??
answered
Jan 17
in
Programming

24
views
2
answers
38
Aptitude: Train Speed
Two trains Train1 and Train2 from Howrah to Patna, and Patna to Howrah leave at the same time from their respective station. They meet somewhere on the way. After their meeting point, Train1 takes 9 hours to reach Patna and Train2 takes 12hours to reach Howrah. Find the speed ratio of Train1 and Train2?
answered
Jan 15
in
Verbal Ability

88
views
aptitude
speeddistance
0
answers
39
Maximum file size in os
How to calculate MAXIMUM POSSIBLE FILE SIZE and TOTAL POSSIBLE FILE SIZE in unix os.  My approach is Maximum possible file size ... 'n' is no of n indirect block addresses. Total possible file size=$[#direct dba's+DB size/DBA.+[DB size/DBA]^{2}+......]* DB size$
asked
Jan 15
in
Operating System

63
views
1
answer
40
Ace Test Series
answered
Jan 14
in
Algorithms

34
views
algorithms
acetestseries
22,772
questions
29,098
answers
65,129
comments
27,639
users