Register
Filter

Questions by abhishek1995_cse

0 votes
0 answers
1
DataStructure
is hashing there in gate 2019 syllabus?
is hashing there in gate 2019 syllabus?
0 votes
0 answers
2
Gate previous years
Q1. https://gateoverflow.in/3375/gate2008-it-64 Q2. https://gateoverflow.in/8481/gate2015-3-28 In Q1 the rtt is doubled while calculating but in Q2 rtt is not doubled. why ? .
Q1. https://gateoverflow.in/3375/gate2008-it-64Q2. https://gateoverflow.in/8481/gate2015-3-28In Q1 the rtt is doubled while calculating but in Q2 rtt is not doubled. w...
0 votes
1 answer
4
Ace book
The minimal finite automata accepting the set of all strings over {0,1} starting with a 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states. The ans is 7 but according to me modulo n has 5 states .?
The minimal finite automata accepting the set of all strings over {0,1} starting with a 1 that interpreted as the binary representation of an integer are congruent to 0 m...
0 votes
1 answer
5
Acebook
The minimal finite automata accepting the strings in r=0*1* has ________ states? for DFA its 3 states and for NFA its 2 states which one should i go with?
The minimal finite automata accepting the strings in r=0*1* has ________ states?for DFA its 3 states and for NFA its 2 states which one should i go with?
0 votes
0 answers
6
Ace Book
The complement of the language L containing an equal number of a's , b's and c's is a)regular b)context free c)context sensitive but not context free d)recursive and not a CFL
The complement of the language L containing an equal number of a's , b's and c's isa)regularb)context freec)context sensitive but not context freed)recursive and not a CF...
0 votes
1 answer
7
Acebook
Consider the following code: co-begin-end X=2; co begin X=X+3; X=X+1; co end The final possible values of 'X' are: a)3,5 b)3,4,5 c)3,5,6 d)5,3,2
Consider the following code:co-begin-end X=2; co begin X=X+3; X=X+1; co endThe final possible values of 'X' are:a)3,5b)3,4,5c)3,5,6d)5,3,2
1 votes
2 answers
8
AceBook
Consider the machine with 64 MB Physical Memory and a 34 bit Virtual Address Space. If the page size is 4KB, the appropriate sizes of conventional and inverted page table sizes are: a) 4M, 4K b)4K, 4M c)4M, 16K d)16K, 4M. soln: is Option C. but my ans is (7MB, 28KB)
Consider the machine with 64 MB Physical Memory and a 34 bit Virtual Address Space. If the page size is 4KB, the appropriate sizes of conventional and inverted page table...
0 votes
1 answer
10
Test Series
0 votes
0 answers
11
Acebook
For a page size of 200 words, what is the page number and offset for a logical address of 1142. a)5,142 b)2,142 c)6,142 d)7,140
For a page size of 200 words, what is the page number and offset for a logical address of 1142.a)5,142b)2,142c)6,142d)7,140
0 votes
2 answers
12
Ace book-FILESYSTEM
The UNIX I-node contains 8-direct disk block addresses, a single indirect and a double indirect entry for a disk block of size 2KB and 16 bit disk block addresses, the maximum file size supported will be: a) 2.0 G b)2.01 M c)2.018 M d) 2.018 G
The UNIX I-node contains 8-direct disk block addresses, a single indirect and a double indirect entry for a disk block of size 2KB and 16 bit disk block addresses, the ma...
1 votes
1 answer
13
Process Management
Q.Consider the processes P1, P2, P3, P4 whose arrival times are 0, 1, 2, 3 and Burst times are 5, 2, 13, 7. If the Context Switching time is 1 unit (ms), what is the average waiting time if Shortest Job Next scheduling algorithm is used? (a) 7.5 (b) 6.25 (c) 6.5 (d) None
Q.Consider the processes P1, P2, P3, P4 whose arrival times are 0, 1, 2, 3 and Burst times are 5, 2, 13, 7. If the Context Switching time is 1 unit (ms), what is the aver...
0 votes
0 answers
14
Dekkers Algorithm
Is Dekkers Algorithm in syllabus?
Is Dekkers Algorithm in syllabus?
1 votes
0 answers
16
Computer Network
In IPV6 what are the Headers i need to learn. And do i have to remember the fields present in Unicast, Multicast, Geography unicast addess?
In IPV6 what are the Headers i need to learn. And do i have to remember the fields present in Unicast, Multicast, Geography unicast addess?
0 votes
0 answers
17
ACE BITS AND BYTES
0 votes
0 answers
18
ACE BITS AND BYTES
0 votes
1 answer
19
Is Fork ,System calls and Threads are there in syllabus?
0 votes
1 answer
20
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
Page: