Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
learner_geek
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by learner_geek
0
votes
1
About comparison of lower nits and dtu
Which is better to join for mtech in cse lower nits after nit nagpur or DTU??
Which is better to join for mtech in cse lower nits after nit nagpur or DTU??
2.4k
views
answered
Mar 3, 2020
1
votes
2
GATE CSE 1998 | Question: 1.1
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is$\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}...
8.4k
views
answered
Jan 29, 2018
Probability
gate1998
probability
easy
+
–
2
votes
3
GATE CSE 2015 Set 1 | Question: GA-3
Given Set $A= {2, 3, 4, 5}$ and Set $B= { 11, 12, 13, 14, 15}$, two numbers are randomly selected, one from each set. What is the probability that the sum of the two numbers equals $16$? $0.20$ $0.25$ $0.30$ $0.33$
Given Set $A= {2, 3, 4, 5}$ and Set $B= { 11, 12, 13, 14, 15}$, two numbers are randomly selected, one from each set. What is the probability that the sum of the two numb...
7.2k
views
answered
Jan 28, 2018
Quantitative Aptitude
gatecse-2015-set1
quantitative-aptitude
probability
normal
+
–
3
votes
4
ISRO-DEC2017-13
Consider the following schema: $\text{Sailors(sid,sname,rating,age)}$ $\text{Boats(bid,bname,colour)}$ $\text{Reserves(sid,bid,day)}$ ... Ganga boat. Names of sailors who have reserved at least one Ganga boat. Names of sailors who have reserved at most one Ganga boat.
Consider the following schema:$\text{Sailors(sid,sname,rating,age)}$$\text{Boats(bid,bname,colour)}$$\text{Reserves(sid,bid,day)}$Two boats can have the same name but the...
2.7k
views
answered
Jan 24, 2018
Databases
isrodec2017
+
–
2
votes
5
Natural join
My answer is not matching with any of the option.so what is the correct answer
My answer is not matching with any of the option.so what is the correct answer
1.3k
views
answered
Jan 24, 2018
Databases
natural-join
databases
relational-algebra
sql
+
–
0
votes
6
GATE CSE 2008 | Question: 54
Which of the following are true? A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation Multi-level access link (or display) arrangement is ... activation records II and V only I, III and IV only I, II and V only II, III and V only
Which of the following are true?A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursio...
20.0k
views
answered
Jan 19, 2018
Compiler Design
gatecse-2008
compiler-design
difficult
runtime-environment
+
–
7
votes
7
GATE2012 CY: GA-9
There are eight bags of rice looking alike, seven of which have equal weight and one is slightly heavier. The weighing balance is of unlimited capacity. Using this balance, the minimum number of weighings required to identify the heavier bag is $2$ $3$ $4$ $8$
There are eight bags of rice looking alike, seven of which have equal weight and one is slightly heavier. The weighing balance is of unlimited capacity. Using this balanc...
8.9k
views
answered
Jan 9, 2018
Analytical Aptitude
gate2012-cy
analytical-aptitude
logical-reasoning
+
–
2
votes
8
GATE CSE 2013 | Question: 62
Out of all the $2$-digit integers between $1$ and $100,$ a $2$-digit number has to be selected at random. What is the probability that the selected number is not divisible by $7$ ? $\left(\dfrac{13}{90}\right)$ $\left(\dfrac{12}{90}\right)$ $\left(\dfrac{78}{90}\right)$ $\left(\dfrac{77}{90}\right)$
Out of all the $2$-digit integers between $1$ and $100,$ a $2$-digit number has to be selected at random. What is the probability that the selected number is not divisibl...
3.8k
views
answered
Jan 9, 2018
Quantitative Aptitude
gatecse-2013
quantitative-aptitude
easy
probability
factors
+
–
8
votes
9
GATE2013 EE: GA-9
A car travels $8$ $km$ in the first quarter of an hour, $6$ $km$ in the second quarter and $16$ $km$ in the third quarter. The average speed of the car in km per hour over the entire journey is $30$ $36$ $40$ $24$
A car travels $8$ $km$ in the first quarter of an hour, $6$ $km$ in the second quarter and $16$ $km$ in the third quarter. The average speed of the car in km per hour ove...
3.5k
views
answered
Jan 9, 2018
Quantitative Aptitude
gate2013-ee
speed-time-distance
quantitative-aptitude
+
–
43
votes
10
GATE CSE 2015 Set 1 | Question: GA-10
The probabilities that a student passes in mathematics, physics and chemistry are $m,p$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing in at least one, a $50\%$ ... Only relation I is true. Only relation II is true. Relations II and III are true. Relations I and III are true.
The probabilities that a student passes in mathematics, physics and chemistry are $m,p$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing ...
12.4k
views
answered
Jan 8, 2018
Quantitative Aptitude
gatecse-2015-set1
quantitative-aptitude
probability
+
–
0
votes
11
Data link layer
Can anyone tell me plz....what formula I should use for window size ...1+2a or 2a only ..bcz I have seen in ACE Test series use 2a & Ravidrababu sir use 1+2a.. a=Tp/Tx
Can anyone tell me plz....what formula I should use for window size ...1+2a or 2a only ..bcz I have seen in ACE Test series use 2a & Ravidrababu sir use 1+2a..a=Tp/...
637
views
answered
Jan 7, 2018
1
votes
12
Subject Topic- Operating systems- Semaphore
691
views
answered
Jan 7, 2018
Operating System
subject-topic
semaphore
operating-system
counting-semaphore
+
–
0
votes
13
tree topic
What is the height of root node by default , 0 or 1
What is the height of root node by default , 0 or 1
243
views
answered
Jan 7, 2018
14
votes
14
GATE CSE 1991 | Question: 03-xi
Indicate all the false statements from the statements given below: The amount of virtual memory available is limited by the availability of the secondary memory Any implementation of a critical section requires the use of an indivisible machine- ... for some type of programs. The best fit techniques for memory allocation ensures that memory will never be fragmented.
Indicate all the false statements from the statements given below:The amount of virtual memory available is limited by the availability of the secondary memoryAny impleme...
10.6k
views
answered
Jan 5, 2018
Operating System
gate1991
operating-system
virtual-memory
normal
multiple-selects
+
–
3
votes
15
GATE CSE 2009 | Question: 7, ISRO2015-3
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes? $8$ $32$ $64$ $128$
How many $32K \times 1$ RAM chips are needed to provide a memory capacity of $ 256K$ bytes?$8$$32$$64$$128$
17.5k
views
answered
Jan 5, 2018
Digital Logic
gatecse-2009
digital-logic
memory-interfacing
easy
isro2015
+
–
3
votes
16
GATE CSE 1988 | Question: 8ii
Consider the two program segments below: for i:=1 to f(x) by 1 do S end i:=1; While i<=f(x) do S i:=i+1 end Under what conditions are these two programs equivalent? Treat $S$ as any sequence of statements and $f$ as a function.
Consider the two program segments below:for i:=1 to f(x) by 1 do S endi:=1; While i<=f(x) do S i:=i+1 endUnder what conditions are these two programs equivalent? Treat $S...
2.2k
views
answered
Dec 22, 2017
Programming in C
gate1988
programming
descriptive
loop-invariants
+
–
0
votes
17
subnet mask ques
Q .how to find subnet mask of 2001.2.64 if 2 bits are chosen from host id for subnetting ? Q . what if question is find subnet mask of 200.1.2.2 ?
Q .how to find subnet mask of 2001.2.64 if 2 bits are chosen from host id for subnetting ? Q . what if question is find subnet mask of 200.1.2.2 ?
880
views
answered
Oct 17, 2017
4
votes
18
i was just compiling some code and i got two different output.
#include <stdio.h> #include <string.h> int main() { float a = 1.5; if(a == 1.5) printf("Hello"); printf("_World"); return 0; } output of the above code is :Hello_World #include < ... ; printf("_World"); return 0; } output of above code is:_World Can anyone please explain the concept behind it?
#include <stdio.h>#include <string.h>int main(){ float a = 1.5; if(a == 1.5) printf("Hello"); printf("_World"); return 0;}output of the above code is :Hello...
240
views
answered
Aug 14, 2017
0
votes
19
infix to postfix doubt
if i get A + [ (B+C) ] /G in infix and i want to convert it into postfix then what to do with sign [ should i push it into stack ??
if i get A + [ (B+C) ] /G in infix and i want to convert it into postfix then what to do with sign [ should i push it into stack ??
340
views
answered
Aug 10, 2017
0
votes
20
what should be the space complexity of this , did not find any proper explanation on internet for space complexity
int sum(int A[], int n) { int sum = 0, i; for(i = 0; i < n; i++) sum = sum + A[i]; return sum; }
3.5k
views
answered
Aug 9, 2017
0
votes
21
Symbol table updation.
Which of the following phases update the symbol table ? Lexical analysis, syntax analysis and semantic analysis . Please also tell what kind of updates a phase performs if it updates symbol table.
Which of the following phases update the symbol table ?Lexical analysis, syntax analysis and semantic analysis .Please also tell what kind of updates a phase performs if ...
1.5k
views
answered
Aug 8, 2017
Compiler Design
compiler-design
symbol-table
+
–
0
votes
22
LR(zero)
Options are as:- (a) i and ii (b) i and iii (c) ii and iii (d) none of the above
Options are as:-(a) i and ii (b) i and iii(c) ii and iii (d) none of the above
507
views
answered
Aug 6, 2017
Compiler Design
theory-of-computation
grammar
compiler-design
context-free-language
ace-test-series
+
–
1
votes
23
TOC True or False Question
There exist a regular language A such that for language B which is Recursively Enumerable, (A intersection B) is R.E? Is it True or False!
There exist a regular language A such that for language B which is Recursively Enumerable, (A intersection B) is R.E?Is it True or False!
986
views
answered
Aug 5, 2017
Theory of Computation
theory-of-computation
identify-class-language
+
–
2
votes
24
Peter Linz ex-2.3
Convert the nfa defined by δ (q0,a)={q0,q1} δ (q1,b)={q1,q2} δ (q2,a)={q2} δ (q1,λ)={q1,q2} Where q0 is initial state and q2 final state into equivalent DFA.
Convert the nfa defined byδ (q0,a)={q0,q1}δ (q1,b)={q1,q2}δ (q2,a)={q2}δ (q1,λ)={q1,q2}Where q0 is initial state and q2 final state into equivalent DFA.
3.9k
views
answered
Aug 1, 2017
0
votes
25
harddisk
A disk pack has 19 surfaces and storage area on each surface has an outer diameter of 33cm and inner diameter of 22cm .The maximum recording storage density on any track is 200 bits/cm and minimum spacing between tracks is 0.25 mm, then calculate the capacity of disk pack?
A disk pack has 19 surfaces and storage area on each surface has an outer diameter of 33cm and inner diameter of 22cm .The maximum recording storage density on any track ...
456
views
answered
Jul 27, 2017
0
votes
26
When there is a miss in L1 cache and a hit in L2 cache, a block is transferred from L2 cache
310
views
answered
Jul 26, 2017
2
votes
27
GATE 2017 Mock
Consider the Following regular expressions r1 = 1(0 + 1)* r2 = 1(1 + 0)+ r3 = 11*0 What is the relation between the languages generated by the regular expressions above ? a) L (r1) ⊆ L (r2) and L(r1) ⊆ L(r3) b) L (r1) ⊇ L (r2) and L(r2) ⊇ L(r3) c) L (r1) ⊇ L (r2) and L(r2) ⊆ L(r3) d) L (r1) ⊇ L (r3) and L(r2) ⊆ L(r1) Also Please tell explain the value of 1(1 + 0)+ .
Consider the Following regular expressionsr1 = 1(0 + 1)*r2 = 1(1 + 0)+r3 = 11*0What is the relation between the languages generated by the regular expressions above ?a) L...
2.0k
views
answered
Jul 26, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-expression
grammar
+
–
0
votes
28
array in cache
337
views
answered
Jul 26, 2017
0
votes
29
cache and array
Assume that we have a two dimensional array 60 $\times$ 60. Each elements is of 4 bytes and array is stored in row major order. RAM is 2 MN and cache is 8 KB with each block of 16 bytes. L1: for (i=0; i<60; i++) { for (j=0; j<60; j++) { ... -) { printf( %d , a[i][j]); } } In case of direct mapped cache, the number of cache misses are_____ (Assume that cache is empty initially)
Assume that we have a two dimensional array 60 $\times$ 60. Each elements is of 4 bytes and array is stored in row major order. RAM is 2 MN and cache is 8 KB with each bl...
385
views
answered
Jul 26, 2017
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register