Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User OneZero
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?
asked
in
Others
Feb 11, 2019
928
views
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.
commented
in
GATE
Feb 5, 2019
463
views
userisro2019
usermod
1
answer
3
Gate 19
The expenditure ______ as follows ...… Break down or breaks down
commented
in
Verbal Aptitude
Feb 3, 2019
2.6k
views
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.
commented
in
Computer Networks
Jan 29, 2019
11.1k
views
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
commented
in
CO and Architecture
Jan 29, 2019
1.2k
views
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
commented
in
Programming in C
Jan 29, 2019
606
views
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
commented
in
Programming in C
Jan 29, 2019
1.5k
views
programming
programming-in-c
made-easy-test-series
1
answer
8
Made easy
commented
in
Programming in C
Jan 29, 2019
594
views
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
commented
in
Combinatory
Jan 29, 2019
263
views
combinatory
0
answers
10
Self curiosity
Can a grammar be both right recursive and ambiguous ? How?
commented
in
Compiler Design
Jan 28, 2019
274
views
compiler-design
theory-of-computation
2
answers
11
Find the language
Regural CFL CSL Recursive
commented
in
Theory of Computation
Jan 28, 2019
303
views
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
commented
in
Programming in C
Jan 28, 2019
692
views
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
commented
in
Programming in C
Jan 28, 2019
406
views
data-structures
programming-in-c
output
1
answer
14
Engineering Mathematics - Discrete Mathematics
Every satisfiable propositional formula is not tautology. True/False
commented
in
Mathematical Logic
Jan 28, 2019
1.1k
views
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 ?
commented
in
Theory of Computation
Jan 28, 2019
315
views
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.
commented
in
Operating System
Jan 27, 2019
802
views
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)
commented
in
Mathematical Logic
Jan 27, 2019
215
views
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
commented
in
CO and Architecture
Jan 27, 2019
299
views
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.
commented
in
Digital Logic
Jan 27, 2019
886
views
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).
commented
in
DS
Jan 27, 2019
1.8k
views
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?
commented
in
Quantitative Aptitude
Jan 27, 2019
907
views
numerical
cryptography
1
answer
22
Ace Test Series: Compilers - Parsers
commented
in
Compiler Design
Jan 26, 2019
1.4k
views
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
commented
in
Compiler Design
Jan 26, 2019
2.3k
views
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)
commented
in
Compiler Design
Jan 26, 2019
4.0k
views
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
commented
in
Compiler Design
Jan 26, 2019
3.2k
views
go-cd-1
parsing
0
answers
26
MadeEasyFLT
In ipv4 and Ipv6 fragmented Datagrams are reassembled only at Destination. is it False?
commented
in
Computer Networks
Jan 25, 2019
330
views
0
answers
27
MadeEasyFLT
Ouput please explain 2nd and 3rd Output.
commented
in
Programming in C
Jan 25, 2019
386
views
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?)
commented
in
Algorithms
Jan 25, 2019
1.7k
views
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
commented
in
Databases
Jan 25, 2019
498
views
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
commented
in
Graph Theory
Jan 25, 2019
20.4k
views
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
2-marks
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...