Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by OneZero
1
answer
1
RA in IIT
Is getting into old IIT as RA better than getting in new IIT as TA? Is RA in general a good choice?
Is getting into old IIT as RA better than getting in new IIT as TA?Is RA in general a good choice?
948
views
asked
Feb 11, 2019
0
answers
2
isro form filling ?
Will ISRO 2019 recruit this year? till now there is no information about ISRO 2019 form. Please share if you have information regarding it.
Will ISRO 2019 recruit this year? till now there is no information about ISRO 2019 form.Please share if you have information regarding it.
465
views
commented
Feb 5, 2019
GATE
userisro2019
usermod
+
–
1
answer
3
Gate 19
The expenditure ______ as follows ...… Break down or breaks down
The expenditure ______ as follows ...…Break down or breaks down
2.6k
views
commented
Feb 3, 2019
3
answers
4
mtu
Suppose that host A is connected to a router R 1, R 1 is connected to another router, R 2, and R 2 is connected to host B. Suppose that a TCP message that contains 900 bytes of data and 20 bytes of TCP header is passed to the IP code at host A for ... 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 512 bytes including a 12-byte frame header.
Suppose that host A is connected to a router R 1, R 1 is connected to another router,R 2, and R 2 is connected to host B. Suppose that a TCP message that contains 900byte...
11.6k
views
commented
Jan 29, 2019
1
answer
5
MadeEasy Test Series 2019: CO & Architecture - Cache Memory
A CPU cache is organized into 2 level cache L1 and L2 The penalty for L1 cache miss and L2 cache miss are 60 and 30 respectively for 1200 memory references The hit time of L1 and L2 are 5 and 10 clock cycles and penalty for L2 cache miss to main memory is 70 clock cycles. The average memory access time will be
A CPU cache is organized into 2 level cache L1 and L2 The penalty for L1 cache miss and L2 cache miss are 60 and 30 respectively for 1200 memory references The hit time o...
1.3k
views
commented
Jan 29, 2019
CO and Architecture
co-and-architecture
cache-memory
made-easy-test-series
+
–
0
answers
6
MadeEasy Full Length Test 2019: Programming & DS - Programming
Consider the following C code: #include <stdio.h> struct MadeEasy { char p,q,r; }; int main (void) { struct MadeEasy a={ d' - 2019,'e',5+'a'}; struct MadeEasy *b=&a; printf("%c, %c", *((char*)b+1)- 1, *((char*)b+ 2)- 1); return 0; } The output of the following code will be
Consider the following C code:#include <stdio.h>struct MadeEasy{char p,q,r;};int main (void){struct MadeEasy a={ d' - 2019,'e',5+'a'};struct MadeEasy *b=&a;printf("%c, %c...
613
views
commented
Jan 29, 2019
Programming in C
programming-in-c
programming
made-easy-test-series
+
–
1
answer
7
MadeEasy Test Series: Programming & DS - Programming in C
Consider the following C code: include <stdio.h> int fun() { static int num=25; return num--; } int main() { for(fun( ); fun();fun()) printf("%d", fun( )); return O; } The sum of the values printed by the above program will be
Consider the following C code:include <stdio.h>int fun(){static int num=25;return num ;}int main(){for(fun( ); fun();fun())printf("%d", fun( ));return O;}The sum of the v...
1.5k
views
commented
Jan 29, 2019
Programming in C
programming
programming-in-c
made-easy-test-series
+
–
1
answer
8
Made easy
618
views
commented
Jan 29, 2019
Programming in C
data-structures
queue
circular-queue
+
–
0
answers
9
Arrangement Problem
The number of ways, we can arrange 5 books in 3 shelves ________. Given answer 2520 n=3 r=5 so answer is 3-1+5 P5= 7p5= 2520 My answer 3*3*3*3*3= 243 Where am I doing wrong? please help
The number of ways, we can arrange 5 books in 3 shelves ________. Given answer 2520n=3 r=5 so answer is 3-1+5 P5= 7p5= 2520 My answer 3*3*3*3*3= 243Where am I doing wrong...
259
views
commented
Jan 29, 2019
Combinatory
combinatory
+
–
0
answers
10
Self curiosity
Can a grammar be both right recursive and ambiguous ? How?
Can a grammar be both right recursive and ambiguous ? How?
277
views
commented
Jan 28, 2019
Compiler Design
compiler-design
theory-of-computation
+
–
2
answers
11
Find the language
Regural CFL CSL Recursive
ReguralCFLCSLRecursive
314
views
commented
Jan 28, 2019
1
answer
12
MadeEasy WorkBook: Programming & DS - Programming in C
for(i=10;i<10;++i) printf("%d" i&1) prints (a) 0101010101 (b) 0111111111 (c) 0000000000 (d) 1111111111
for(i=10;i<10;++i)printf("%d" i&1)prints(a) 0101010101(b) 0111111111(c) 0000000000(d) 1111111111
732
views
commented
Jan 28, 2019
Programming in C
made-easy-booklet
programming
programming-in-c
+
–
1
answer
13
ds and programming
when i printing x it is giving 0 but when comparing x with 5 ,it executing else part ,means condition fail ,why ?? #include <stdio.h> int main(void) { int x; if(x=(printf("Hello")) != 5) printf("Hello"); else printf("World \n"); printf("%d \n",x); return 0; } https://ideone.com/NJSj2i
when i printing x it is giving 0 but when comparing x with 5 ,it executing else part ,means condition fail ,why ??#include <stdio.h int main(void) { int x; if(x=(printf("...
414
views
commented
Jan 28, 2019
Programming in C
data-structures
programming-in-c
output
+
–
1
answer
14
Engineering Mathematics - Discrete Mathematics
Every satisfiable propositional formula is not tautology. True/False
Every satisfiable propositional formula is not tautology.True/False
1.1k
views
commented
Jan 28, 2019
Mathematical Logic
discrete-mathematics
propositional-logic
mathematical-logic
+
–
0
answers
15
Self doubt
L={ <TM>| L(TM)= not re} is it decidable or not if undecidable what specific set it belongs ?
L={ <TM>| L(TM)= not re} is it decidable or not if undecidable what specific set it belongs ?
309
views
commented
Jan 28, 2019
Theory of Computation
theory-of-computation
+
–
1
answer
16
GeeksforGeeks
Suppose that the running time for each process in milliseconds is an exponential random variable with parameter λ=1/20. If process P1 arrives immediately ahead of the process P2 in the running state, then the probability that process P2 will have to wait more than 20 milliseconds is ... . A 0.274 B 0.324 C 0.428 D 0.368 How to approach this. even not able to understand the question.
Suppose that the running time for each process in milliseconds is an exponential random variable with parameter λ=1/20. If process P1 arrives immediately ahead of the pr...
807
views
commented
Jan 27, 2019
Operating System
engineering-mathematics
random-variable
probability
+
–
0
answers
17
Testbook.com
Let f be a function from A to B and f -1 exist. Let S and T be subsets of B. Which of the following is true? 1. f -1 (S ∪ T) = f -1 (S) ∪ f -1 (T) 2. f -1 (S ∩ T) = f -1 (S) ∩ f -1 (T)
Let f be a function from A to B and f -1 exist. Let S and T be subsets of B. Which of the following is true?1. f -1 (S ∪ T) = f -1 (S) ∪ f -1 (T)2. f -1 (S ∩ T) = f...
215
views
commented
Jan 27, 2019
Mathematical Logic
set-theory&algebra
+
–
0
answers
18
Self doubt
please arrange them in increasing order of speed: Relative addressing , Absolute addressing , Register addressing , Register Indirect addressing , Indirect addressing , Base addressing , indexed addressing
please arrange them in increasing order of speed:Relative addressing , Absolute addressing , Register addressing , Register Indirect addressing , Indirect addressing , Ba...
323
views
commented
Jan 27, 2019
CO and Architecture
co-and-architecture
addressing-modes
+
–
0
answers
19
Ace academy workbook
Till what value of mod counter you will call it? As per my understanding the maximum number it is counting is 5 so I call it as mod 6 counter but in in the workbook it is given as mod 5 counter and their explanation is that number of states are 5 that's why it is a mod 5 counter. What is correct and why? please help me.
Till what value of mod counter you will call it? As per my understanding the maximum number it is counting is 5 so I call it as mod 6 counter but in in the workbook it is...
881
views
commented
Jan 27, 2019
Digital Logic
digital-logic
digital-logic
digital-counter
+
–
1
answer
20
made easy test
The number of permutations can be obtained in the output using stack assuming that input contains elements 1, 2, 3, 4, 5, 6 in any order such that 3 will poped out from stack at 3rd position are _______ (assume one element enter in stack only one time).
The number of permutations can be obtained in the output using stack assuming that input contains elements 1, 2, 3, 4, 5, 6 in any order such that 3 will poped out from s...
1.8k
views
commented
Jan 27, 2019
1
answer
21
crypt arithmetic
If 356 + 123 = 512 .Then what is the value of 653 + 321? 1.215 2.974 3.1004 4.1304 How to solve these type questions?
If 356 + 123 = 512 .Then what is the value of 653 + 321?1.2152.9743.10044.1304How to solve these type questions?
919
views
commented
Jan 27, 2019
Quantitative Aptitude
numerical
cryptography
+
–
1
answer
22
Ace Test Series: Compilers - Parsers
1.4k
views
commented
Jan 26, 2019
Compiler Design
compiler-design
lr-parser
ace-test-series
+
–
1
answer
23
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 10
Which of the following is TRUE regarding LL(0) grammar? We can have a LL(0) grammar for any regular language We can have a LL(0) grammar for a regular language only if it does not contain empty string We can have a ... regular language if and only if it has prefix property We can have a LL(0) grammar for only single string languages
Which of the following is TRUE regarding LL(0) grammar?We can have a LL(0) grammar for any regular languageWe can have a LL(0) grammar for a regular language only if it d...
2.3k
views
commented
Jan 26, 2019
Compiler Design
go-cd-1
parsing
+
–
1
answer
24
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 7
Which of the following is a requirement for an LL(1) grammar? Unambiguity No left recursion If $A \to \alpha \mid \beta$ are two productions, then $FIRST(\alpha)$ and $FIRST(\beta)$ are disjoint (i) and (ii) (iii) (i), (ii) and (iii) (ii) and (iii)
Which of the following is a requirement for an LL(1) grammar?UnambiguityNo left recursionIf $A \to \alpha \mid \beta$ are two productions, then $FIRST(\alpha)$ and $FIRST...
4.1k
views
commented
Jan 26, 2019
Compiler Design
go-cd-1
ll-parser
+
–
3
answers
25
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 3
Which of the following statements is FALSE? Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter Languages of grammars parsed by LR(2) parsers is a strict super set of the languages of ... LL(1) parsers There is no DCFL which is not having a grammar that can be parsed by a LR(1) parser
Which of the following statements is FALSE?Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiterLanguages of grammars parsed ...
3.3k
views
commented
Jan 26, 2019
Compiler Design
go-cd-1
parsing
+
–
0
answers
26
MadeEasyFLT
In ipv4 and Ipv6 fragmented Datagrams are reassembled only at Destination. is it False?
In ipv4 and Ipv6 fragmented Datagrams are reassembled only at Destination.is it False?
337
views
commented
Jan 25, 2019
0
answers
27
MadeEasyFLT
Ouput please explain 2nd and 3rd Output.
Ouputplease explain 2nd and 3rd Output.
391
views
commented
Jan 25, 2019
0
answers
28
Dijkstra's Algorithm on negative weight cycle
Somebody please clarify me, will dijkstra’s algorithm terminate if there is a negative cycle present? (as far as I know, it doesn't give correct result as it keep updating the value, so in that logic it sould fall into infinite loop and wont terminate. Is this correct?)
Somebody please clarify me, will dijkstra’s algorithm terminate if there is a negative cycle present? (as far as I know, it doesn't give correct result as it keep updat...
1.7k
views
commented
Jan 25, 2019
Algorithms
dijkstras-algorithm
+
–
0
answers
29
me adv test
Consider the following schedule: S:R2(A), W1(B), W1(C), R3(B), R2(B), R1 (A), commit_1, R2(C), commit_2, W3(A), commit_3 How many given statements true about schedule(S)____. (i) Schedule(S) is conflict serializable schedule. (ii) Schedule(S) is ... strict recoverable schedule. (iv) Schedule(S) is allowed by strict 2PL. only 1 is correct as per my answer but in answer they have given 3
Consider the following schedule:S:R2(A), W1(B), W1(C), R3(B), R2(B), R1 (A), commit_1, R2(C), commit_2, W3(A), commit_3How many given statements true about schedule(S)___...
520
views
commented
Jan 25, 2019
Databases
made-easy-test-series
databases
strict-schedule
conflict-serializable
+
–
6
answers
30
GATE CSE 2019 | Question: 38
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
Let $G$ be any connected, weighted, undirected graph.$G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight.$G$ has a unique minimum spanning...
20.7k
views
commented
Jan 25, 2019
Graph Theory
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
2-marks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register