The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
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
+4
votes
1
Which one of the following statements is correct regarding the elements and subsets of the set
answered
Mar 27, 2017
in
Linear Algebra

626
views
linearalgebra
+2
votes
2
ISRO 2K16
answered
Mar 19, 2017
in
Numerical Ability

104
views
+1
vote
3
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

305
views
+1
vote
4
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

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

38
views
settheory&algebra
engineeringmathematics
+1
vote
6
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

108
views
0
votes
7
ISRO 2012  [Mech]
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

109
views
engineeringmathematics
isromech
linearalgebra
+1
vote
8
ISRO 2006 ECE
If the memory chip size is 256 x 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 and Architecture

620
views
isroece
coandarchitecture
+6
votes
9
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

612
views
algorithms
greedyalgorithm
+1
vote
10
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

513
views
probability
permutationandcombination
+1
vote
11
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 and Architecture

284
views
coandarchitecture
+1
vote
12
MadeEasy Subject Test: Compiler Design  Syntax Directed Translation
...
answered
Jan 7, 2017
in
Compiler Design

396
views
madeeasytestseries
compilerdesign
syntaxdirectedtranslation
+5
votes
13
Do it with truth table construction . not by guess.
Consider the partial implementation of a 2bit counter using T flipflops following the sequence 02310, as shown below.
answered
Jan 5, 2017
in
Digital Logic

156
views
+6
votes
14
MadeEasy Test Series: Programming & DS  Heap
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

288
views
madeeasytestseries
datastructures
heap
+1
vote
15
Time Complexity And Analysis (Modified GATE 2005 Question)
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } } Q1] What is the running time complexity of the ... i) 0<i<n as and when they are computed . Please tell how the code will look like in first place Please explain in detail how to analyse it
answered
Dec 22, 2016
in
Algorithms

391
views
timecomplexity
+1
vote
16
common ancestors of two nodes in AVl tress
can anyone define the procedure to find the common ancestor of any two given nodes in balanced BST..??
answered
Dec 21, 2016
in
DS

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

148
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

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

1.4k
views
operatingsystem
processsynchronization
algorithms
semaphore
0
votes
20
Suppose that an operating system provides two functions
Suppose that an operating system provides two functions, block_queue() which puts the calling process on the blocked queue, and wakeup_queue(P)which moves process P to the runnable queue if it is currently on the ... the Following statement is true? it prints P0P1 alternatively always. It prints P1P0 alternatively always Deadlock possible None
answered
Dec 4, 2016
in
Operating System

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

85
views
0
votes
22
Let Gn = (Un, En) denote the graph with vertex Vn = {0, 1, 2, …, n – 1}
Let Gn = (Un, En) denote the graph with vertex Vn = {0, 1, 2, …, n – 1} and edge set En: En = {{i, j}: i + j = 1 mod n} where n ≥ 3. The number of components of Gn for n ≥ 3 ___ n 1
answered
Nov 29, 2016
in
Graph Theory

137
views
graphtheory
engineeringmathematics
0
votes
23
Find probability that on a 1024host network, two addresses will be the same
Suppose Ethernet physical addresses are chosen at random (using true random bits). The probability that on a 1024host network, two addresses will be the same is : 1.77 × 10–9 1.87 × 10–9 1.99 × 10–9 1.98 × 10–8
answered
Oct 21, 2016
in
Computer Networks

462
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

4.1k
views
databases
databasenormalization
50,737
questions
57,275
answers
198,154
comments
104,823
users