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
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
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
Questions by admin
User admin
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User admin
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
answer
1
Probability
We are given a set $X = \left \{x_1, x_2, \ldots , x_n \right \}$ where $x_i = 2i$. A sample $S$ (which is a subset of $X$) is drawn by selecting each $x_i$ independently with probability $P_i = \frac 12$. The expected value of the smallest number in sample $S$ is: a) $1/n$ b) $2$ c) $\sqrt n$ d) $n$
asked
Oct 23, 2015
in
Numerical Ability

107
views
probability
expectation
+3
votes
4
answers
2
BCNF and 3NF
1) dependency preservation 2)lossless join a)If a relation is in 3NF , which of the above points is guaranteed. b)If a relation is in BCNF , which of the above points is guaranteed [ I am confused right now, can I say , if a relation ... using a particular algorithm, then only I can say that the decomposed relations is lossless/dependency preserving same goes for 3NF]. Please help!
asked
Oct 20, 2015
in
Databases

3.1k
views
databases
databasenormalization
+1
vote
1
answer
3
Determine the type of functional dependency
Consider Relation R (A, B, C, D, E, F) { AB>C C>B D>C E>D F>E } C.key=AF I have 2 questions 1) Isn't AB>C fully functionally dependent? Because the definition of full functional dependency ... AB can determine C,which is the case here. 2) Does F>E exhibit partial dependency? How do I determine if its partially dependent?
asked
Oct 20, 2015
in
Databases

265
views
functionaldependencies
+2
votes
1
answer
4
evaluation of prefix expression takes O(n^2)....true?
asked
Oct 20, 2015
in
Algorithms

448
views
stack
+1
vote
1
answer
5
Is array implementation better or the min heap in case of Prims algorithm
For prim's algorithm array implementation takes $O(V^2)$ while min heap implementation takes $O((E+V)\log V)$ time. For dense graph $E = O(V^2).$ So is array implementation considered better or the min heap one??? Does the min heap implementation run better for graph with less edges??
asked
Oct 18, 2015
in
Algorithms

279
views
minimumspanningtrees
primsalgorithm
+1
vote
1
answer
6
disk scheduling
Consider a disk with the 100 tracks numbered from 0 to 99 rotating at 3000 rpm. The number of sectors per track is 100 and the time to move the head between two successive tracks is 0.2 millisecond. Consider a set of disk requests to read data from tracks 32 ... IS this the correct way of solving this problem or am I missing something? Please help
asked
Oct 17, 2015
in
Operating System

463
views
+1
vote
1
answer
7
How is escape sequence tokenised in c compiler.
How tokens are assigned for a string having escape sequence in C lexical phase Eg.. printf ("this\" is a string\""); and what for printf ("this is""a string");
asked
Oct 16, 2015
in
Programming

251
views
compilertokenization
+1
vote
2
answers
8
How many process are created by the program?
int main(){ int i; for(i=0;i<4;i++) fork(); return 0; } in my calculation i think 14 processes will be created including the the parent process. am i right ? Is there any easier method to solve this kind of question ?? please provide the right approach to solve these kind of problems
asked
Oct 11, 2015
in
Operating System

1.8k
views
operatingsystem
fork
+4
votes
4
answers
9
How many number of possible relations in a antisymmetric set?
I just want to know how the value in the answers come like 2^n2 and 2^n^21 etc. Please make it clear.
asked
Oct 9, 2015
in
Set Theory & Algebra

2.9k
views
sets
settheory&algebra
relations
+3
votes
3
answers
10
T.C of T(n)=2T(n1)+n,n >1 ,T(1)=1 ?
T.C of T(n)=2T(n1)+n,n > 1 ,T(1)=1 ?
asked
Oct 8, 2015
in
Algorithms

3k
views
timecomplexity
0
votes
2
answers
11
GATE 2016 Preparation
Hi All, I have applied for GATE 2016 exam in the stream of CS. I haven't started preparation yet. Would it be possible to prepare for the exam in less than 110 days including solving previous papers? If yes how should it be scheduled. Can anyone help? To add a point, i have been away from books since 2 years as i am working as test engineer.
asked
Oct 8, 2015
in
Study Resources

2.8k
views
+2
votes
3
answers
12
What is the time complexity of the following C code?
int Test(int n) { if (n<=0) return 0; else { int i = random(n1); return Test(i) + Test(n1i); } } Suppose the function $\text{random}()$ takes constant time, then what is the time complexity of $T(n)$?
asked
Oct 8, 2015
in
Algorithms

462
views
algorithms
timecomplexity
+2
votes
1
answer
13
float
following statment printf("%f",9/5); prints answer is 2.0 can any one explain plzzzzz
asked
Oct 8, 2015
in
Programming

625
views
+1
vote
1
answer
14
Segmentation
In segmented paging, is the paging applied on segment table or on segments?
asked
Oct 8, 2015
in
Operating System

454
views
virtualmemory
segmentation
+1
vote
1
answer
15
A X:Y decoder can be constructed using how many A:B decoder with enable?
options are : A)Y/B B)X/A 3)X/B 4)Y/A
asked
Oct 7, 2015
in
Digital Logic

381
views
+1
vote
2
answers
16
when we realize a 64x1 mux using 4x1 muxes we have levels?
options are: A) 2 B)3 C)4 D)5 Please provide answer with explanation.
asked
Oct 7, 2015
in
Digital Logic

3.3k
views
0
votes
2
answers
17
what will be the output?
Actually I don't know how to find MUX equation. please provide answer with explanation.
asked
Oct 7, 2015
in
Digital Logic

112
views
+3
votes
3
answers
18
How can one solve the following recurrence?
$T(n)\quad=\quad T(n1)+T \left (\frac{n}{2} \right )+n$ $n \geq 1, \quad T(1)=1$
asked
Oct 6, 2015
in
Algorithms

490
views
recurrence
timecomplexity
+1
vote
1
answer
19
Scoping and Call by Need evaluation
Find the output of the below program in case of Dynamic Scoping with call by need evaluation method int x=10,y=10; main() { int x=2; int y=3; fun1(x+y,5); printf("x"); } fun1(int z,int k) { k=z+k; }
asked
Oct 6, 2015
in
Programming

335
views
programminginc
+1
vote
1
answer
20
related to BCNF Decomposition
quest: consider the Rn R(C,S,Z) with FDs CS>Z and Z>C then their BCNF decomposition will be lossless join or Dependency preserving or both of them?
asked
Oct 5, 2015
in
Databases

128
views
+1
vote
1
answer
21
Related to closure and FDS
ques: F is a set of functional dependencies on realtion R(ABCDE) with F={A>ABCD,B>C,B>D} which of the following is in the closure of F? a.) CD>B b.) C>D c).B>CD d.) BCD>A
asked
Oct 5, 2015
in
Databases

107
views
databases
+1
vote
2
answers
22
the minimum number of two input NAND gate required to realize one AND gate is (complemented inputs is not available).
asked
Oct 4, 2015
in
Digital Logic

1.2k
views
+1
vote
1
answer
23
Why is the output of these two programs different in C?
#include int main(){ float x = 0.1; if (x == 0.1) printf("IF"); else if (x == 0.1f) printf("ELSE IF"); else printf("ELSE"); return 0; } #include int ... 0; } First program Output: ELSE IF Second program Output: IF Both programs are similar.But outputs are different.Why?
asked
Oct 3, 2015
in
Programming

403
views
0
votes
1
answer
24
What is the Cyclomatic Complexity of the pseudo code ?
while (my) and (a
asked
Oct 2, 2015
in
Algorithms

999
views
cyclomaticcomplexity
0
votes
1
answer
25
Is the language regular
L={s belongs to (0+1)* for every prefix s' of sn0(s')n1(s')
asked
Oct 1, 2015
in
Theory of Computation

114
views
theoryofcomputation
regularlanguages
0
votes
0
answers
26
the noninverting buffer have delay of 2 ns and 4ns both xor and all wire have zero delay how many transition
asked
Sep 25, 2015
in
Digital Logic

120
views
0
votes
1
answer
27
Identify the class of the language
Identify the class of the language $L = \Bigl \{a^n b^m \mid n \leq m \leq 2n\Bigr \}$. a) CFL but not DCFL b) DCFL but not regular c) not CFL
asked
Sep 23, 2015
in
Theory of Computation

635
views
theoryofcomputation
identifyclasslanguage
+1
vote
1
answer
28
Producer consumer code using semaphore
The code for producer consumer prob​lem using semaphore is producer's code do { * // produce an item in nextproduced wait(empty) ; wait(mutex) ; buffer[in] = nextProduced; in = (in + 1) % BUFFERSIZE; signal(mutex) ; signal( ... consumer. Since producer does not affect 'out' and consumer does not affect 'in', so we could have used mutex1 and mutex2.
asked
Sep 22, 2015
in
Operating System

515
views
operatingsystem
processsynchronization
interprocesscommunication
semaphore
+6
votes
1
answer
29
If a 3 bit multiplicand is multiplied to a 2 bit multiplier, minimum number of two input AND, XOR, and OR gates, needed?
asked
Sep 17, 2015
in
Digital Logic

2k
views
digitallogic
+2
votes
1
answer
30
How to solve recursion problem in less time?
I'm solving questions of recursion. But those problems are hard to debug in few minutes? Have you any such method that solve recursive problem in less time? I have written problem below: please help me in this problem: int fun(int n){ int x=1, ... ); return; } The return value of fun(5) is ________. How to solve this problem in less time? Please help me.
asked
Sep 15, 2015
in
Programming

803
views
recursion
Page:
1
2
next »
47,928
questions
52,333
answers
182,380
comments
67,805
users