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 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
vote
1
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
answered
9 hours
ago
in
Databases

12
views
+1
vote
2
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
12 hours
ago
in
Programming

10
views
+1
vote
3
ACE MOCK II
CAN ANYONE EXPLAIN THE WORKING OF THE CODE..??
answered
13 hours
ago
in
Programming

12
views
0
votes
4
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
answered
19 hours
ago
in
CO & Architecture

18
views
+1
vote
5
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
2 days
ago
in
Verbal Ability

40
views
aptitude
speeddistance
+1
vote
6
Ace Test Series
answered
3 days
ago
in
Algorithms

24
views
algorithms
acetestseries
+2
votes
7
test series 2
answered
3 days
ago
in
Mathematical Logic

44
views
+1
vote
8
toc test
answered
3 days
ago
in
Theory of Computation

24
views
+2
votes
9
micro instruction
I'm getting 61 also what will be the answer in case of vertical microprogramming
answered
3 days
ago
in
CO & Architecture

34
views
microprogramming
co&architecture
virtualgate
+3
votes
10
DS and programming
how to solve this?
answered
6 days
ago
in
Programming

23
views
+2
votes
11
Testbook question
b*2 b*c2 b+c*2 none of these
answered
6 days
ago
in
Programming

24
views
programminginc
0
votes
12
future knowledge scheduling
answered
6 days
ago
in
Operating System

50
views
+2
votes
13
made easy workbook
answered
Jan 9
in
Computer Networks

32
views
+2
votes
14
DBMS2
answered
Jan 7
in
Databases

22
views
0
votes
15
process
answered
Jan 7
in
Operating System

22
views
+4
votes
16
discrete
find the solution of the recurence relation an =3an1 + 2n initial conditon is given as a1=3 ?
answered
Jan 5
in
Mathematical Logic

67
views
discretemathematics
+1
vote
17
UGC NET Computer Science Dec 2014 Ques no 35
answered
Jan 5
in
Algorithms

56
views
+1
vote
18
Natural vs conditional join dbms
answered
Jan 5
in
Databases

29
views
naturaljoin
databases
relationalalgebra
0
votes
19
What is the time taken by the server to send the file to all clients
answered
Jan 5
in
Computer Networks

37
views
computernetworks
+3
votes
20
madeeasy test series
In a particular Unix Os, each data block is 256 bits, each node has 4 direct data block address and 3 additional addresses: one for single indirect block, one for double indirect block and one fot triple indirect block. Each block is addressed ... in the file system (in k bits ) is _________. what is k bits here? what will the exact answer??
answered
Jan 5
in
Operating System

45
views
+2
votes
21
doubt
no of token generated? int main() { int ***p; printf("%d",***p); }
answered
Jan 5
in
Compiler Design

48
views
lexicalanalysis
0
votes
22
parsing
Consider the following operator grammar E>AaBcD A>bAe B>bBe D>eDg Which of the following precedence relation is incorrect from the above grammar? Assume x<•y is used to represent x is having less precedence than y and in the expression x appears first and y appears next. a) a<•b b) c<•g c) a<•e d) c<•b
answered
Jan 5
in
Compiler Design

20
views
+1
vote
23
Conflictequvalent serial schedule
answered
Jan 5
in
Databases

23
views
+2
votes
24
Compiler Design
answered
Jan 4
in
Compiler Design

33
views
+2
votes
25
parsing
Convert the grammar to reduced form ? S>AB S>CA B>BC B>AB A>a C>aB b
answered
Jan 4
in
Compiler Design

29
views
+2
votes
26
Stack Permutation
Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 5, 7, 8, 4, 6 in that order? a)6, 8, 4, 7, 5 b)6, 4, 5, 7, 8 c)6, 4, 7, 8, 5 d)7, 8, 4, 6, 5
answered
Jan 4
in
DS

56
views
permutation
stack
+1
vote
27
How many packets are in the buffer on an average?
answered
Jan 4
in
Computer Networks

27
views
computernetworks
+1
vote
28
what is the total number of fragments received at destination?
answered
Jan 2
in
Computer Networks

34
views
computernetworks
+2
votes
29
Maths: GroupTheory
Let S = R  {1} and define a binary operation on S by a*b = a+b+ab, what is true about (S,*) A. (S,*) is a group but is not commutative B. (S,*) is a group and is also commutative C. (S,*) is not a group because inverse of 1 doesn't exist "How to check if inverse and identity element exist?
answered
Jan 2
in
Set Theory & Algebra

37
views
discretemathematics
settheory&algebra
groups
+2
votes
30
Minimal Finite Automata
What is the minimum no of states in the finite automata that accept all the strings over {0,1} where its binary equivalent is congruent to 2 modulo 5? Please explain.
answered
Jan 2
in
Theory of Computation

22
views
+1
vote
31
Permutation and combinations
Number of binary strings of length 10 with 3 consecutive 0's or 1's is ?
answered
Dec 15, 2016
in
Combinatory

199
views
combinatory
permutation
combinatorics
combinaton
+1
vote
32
made easy test
compiler test part 1 q 15
answered
Dec 15, 2016
in
Compiler Design

35
views
+3
votes
33
Algorithms Hashing
answered
Dec 15, 2016
in
Algorithms

57
views
algorithms
hashing
datastructure
+4
votes
34
Master Theorem Algorithm
How is master theorem applicable here?
answered
Dec 15, 2016
in
Algorithms

72
views
mastertheorem
algorithms
timecomplexity
+4
votes
35
Me Test D&c
Professor Arjun develops an algorithm to multiply two square matrix that is asmptoticaly faster than strassen's algorithm using divide and conquer method . Arjun's algorithm divide matrix into pieces of $\frac{n}{4} \times \frac{n}{4}$ create $'P'$ subproblems and ... : $T(n)= P T(\frac{n}{4})+\Theta (n^{2})$ Then the largest value of $P$ is ______
answered
Dec 15, 2016
in
Algorithms

85
views
testseries
algorithms
madeeasy_testseries
+1
vote
36
BST (DS)
17. The binary search tree contains the values—1, 2, 3, 4, 5, 6, 7 and 8. The tree is traversed in preorder and the values are printed out. Which of the following sequences is a valid output? (a) 5 3 1 2 4 7 8 6 (b) 5 3 1 2 6 4 8 7 (c) 5 3 2 4 1 6 7 8 (d) 5 3 1 2 4 7 6 8
answered
Dec 14, 2016
in
DS

32
views
0
votes
37
made Easy compiler test q 10
correct answer
answered
Dec 14, 2016
in
Compiler Design

29
views
+3
votes
38
Arrayname and pointer manipulation + type casting
answered
Dec 14, 2016
in
Programming

148
views
programminginc
programming
Page:
1
2
3
4
next »
18,898
questions
23,865
answers
51,932
comments
20,186
users