The Gateway to Computer Science Excellence
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. For hardcopy of previous year questions please see
here
Answers by Akriti sood
User Akriti sood
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Akriti sood
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
ISRO 2K16
answered
Mar 19, 2017
in
Numerical Ability

87
views
+1
vote
2
APTITUDE
A class is composed of 2 brothers and 6 other boys. In how many ways can all the boys be seated at a round table so that the two brothers are not seated together?
answered
Mar 16, 2017
in
Study Resources

174
views
+1
vote
3
MEBook
Assume that a fair sixsided die is rolled once. If the value on the die is 1, 2, or 3, the die is rolled a second time.So find the probability that the aggregate of total of values that turn up is at least 6?
answered
Mar 15, 2017
in
Probability

47
views
+1
vote
4
set theory
answered
Mar 14, 2017
in
Set Theory & Algebra

31
views
settheory&algebra
engineeringmathematics
+1
vote
5
decomposition made easy mock
Which of the following relation can decompose into BCNF with dependency preserving and lossless join decomposition. (i) R(ABCDE) {AB → C, C → AB, C → D, D → E} (ii) R(ABCDE) {AB → C, C → A, C → D, D → E} A) only i B) Only II C) Both D) Neither
answered
Mar 8, 2017
in
Databases

70
views
0
votes
6
ISRO 2012 Mech Mean of Numbers
In a class of 45 students, the mean mark of 25 girls is 32 and the mean mark of 20 boys is 27.5. What is the class mean? (a) 32 (b) 27.5 (c) 29.75 (d) 30
answered
Mar 7, 2017
in
Linear Algebra

76
views
engineeringmathematics
isro
isromech
+1
vote
7
ISRO 2006 ECE Memory chips
If the memory chip size is 256*1 bits, then the number of chips required to make up 1K bytes of memory is a) 32 b) 24 c) 12 d) 8
answered
Mar 3, 2017
in
CO & Architecture

461
views
isro
isroece
coandarchitecture
+6
votes
8
Greedy Algorithm Confusing Question
US portal Denominations are 1,10,21,34,70 , 100 and 350 . A) Make 140 Cents . Verify whether Greedy choice fails or not B) Make 182 Cents. Verify whether greedy choice fails or not. 1)Greedy fails in A 2) Greedy fails in B 3)Greedy does not fails in A 4)Greedy does not fails in B
answered
Mar 3, 2017
in
Algorithms

322
views
algorithms
greedyalgorithm
+1
vote
9
sheldon ross
You know that a certain letter is equally likely to be in any one of three different folders. Let αi be the probability that you will find your letter upon making a quick examination of folder i if the letter is, in fact, in folder i, i = 1, 2, 3. (We may have αi < 1.) Suppose you look in folder 1 and do not find the letter. What is the probability that the letter is in folder 1?
answered
Feb 27, 2017
in
Probability

260
views
probability
permutationsandcombinations
+1
vote
10
clock cycles required in pipeline
For all following questions we assume that:  Pipeline contains 5 stages: IF, ID, EX, M and W;  Each stage requires one clock cycle;  All memory references hit in cache;  Following program segment should be processed: LD R1, ... R4, Loop Calculate how many clock cycles will take execution of this segment on the simple pipeline without forwarding or bypassing ?
answered
Jan 9, 2017
in
CO & Architecture

198
views
coandarchitecture
+1
vote
11
SDT evaluation
$\begin{align*} &E\rightarrow E+E \qquad {\color{red}{\text{E.val} = \text{E}_1\text{.val} { \;\;\large + \;\; } \text{E}_2\text{.val}}} \\ &E\rightarrow E*E \; \qquad {\color{red}{\text{E.val} = \text{E}_1\text{.val} { \;\;\large  \;\; } \text ... {\left [ \left ( 3*3 \right )+\left ( 3*5 \right )  6 \right ]+7}} \quad \text{is evaluated using above SDT ?} \\ \end{align*}$
answered
Jan 7, 2017
in
Compiler Design

328
views
madeeasytestseries
syntaxdirectedtranslation
+5
votes
12
Do it with truth table construction . not by guess.
answered
Jan 5, 2017
in
Digital Logic

133
views
+4
votes
13
Maths: Mean Value Theroem
Is following function Satisfy Lagrange's Mean Value Theroem? f(x) =  x+2  in [2, 0] Detailed solution PLEASE!
answered
Dec 27, 2016
in
Calculus

458
views
meanvaluetheorem
calculus
engineeringmathematics
+6
votes
14
madeeasy ds
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all nonleaf nodes of the tree are ________.
answered
Dec 23, 2016
in
DS

205
views
datastructure
madeeasytestseries
heap
tree
+1
vote
15
Time Complexity And Analysis (Modified GATE 2005 Question)
answered
Dec 22, 2016
in
Algorithms

301
views
timecomplexity
+1
vote
16
common ancestors of two nodes in AVl tress
answered
Dec 21, 2016
in
DS

138
views
datastructure
avltree
binarytree
+1
vote
17
Probability Density Function
answered
Dec 11, 2016
in
Probability

124
views
0
votes
18
probability
If two cards are selected randomly from a pack of 52 cards then find the probability of first card being club and second card not being a queen?
answered
Dec 11, 2016
in
Probability

196
views
probability
0
votes
19
[Strong/Weak Semaphore] Operating system Chapter 5 William Stallings 7th Edition
answered
Dec 4, 2016
in
Operating System

980
views
operatingsystem
processsynchronization
algorithms
semaphore
0
votes
20
Suppose that an operating system provides two functions
answered
Dec 4, 2016
in
Operating System

158
views
operatingsystem
deadlock
processsynchronization
0
votes
21
ace test dbms
answered
Dec 3, 2016
in
Databases

80
views
0
votes
22
Let Gn = (Un, En) denote the graph with vertex Vn = {0, 1, 2, …, n – 1}
answered
Nov 29, 2016
in
Graph Theory

116
views
graphtheory
engineeringmathematics
0
votes
23
Find probability that on a 1024host network, two addresses will be the same
answered
Oct 21, 2016
in
Computer Networks

410
views
computernetworks
ethernet
0
votes
24
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!
answered
Jun 24, 2016
in
Databases

2.3k
views
databases
databasenormalization
36,194
questions
43,647
answers
124,088
comments
42,929
users