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 G.K.T
2
answers
1
GATE CSE 2006 | Question: 66
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $y_i$ instances while ... $ \max(x_{p},x_{q})>1$ $ \min(x_{p},x_{q})>1$
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $x_i$ instances of a resource $R$, $ 1\leq i\leq n$ . Currently, all instances ...
16.5k
views
commented
Jan 27, 2018
Operating System
gatecse-2006
operating-system
resource-allocation
normal
+
–
0
answers
2
Made Easy mock test 1 Q:16 (2017-18)
Which of the following is true for the predicate logic P ? ~ $\forall z[P(z) \rightarrow ($~$Q(z)\rightarrow P(z)) ]$ a.) P is satisfiable b.) P is Tautology c.) P is Contradiction d.) None of these
Which of the following is true for the predicate logic P ?~ $\forall z[P(z) \rightarrow ($~$Q(z)\rightarrow P(z)) ]$a.) P is satisfiableb.) P is Tautologyc.) P is Contrad...
495
views
commented
Jan 16, 2018
0
answers
3
Made easy mock 1 Q:30 (2017-18)
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls, 5 identical yellow balls and 3 identical blue balls are __________. PS : I am interested in approach to solve the problem , not the ans
The number of ways can 10 balls be chosen from an urn containing 10 identical green balls, 5 identical yellow balls and 3 identical blue balls are __________. PS : I am i...
261
views
closed
Jan 16, 2018
Combinatory
discrete-mathematics
made-easy-test-series
+
–
1
answer
4
Gateforum DBMS
1.5k
views
commented
Jan 12, 2018
Databases
gateforum-test-series
databases
lossless-join
bcnf-decomposition
+
–
1
answer
5
MADE EASY Basic Full Length 3
Consider a page size of 1 KB and that each page table entry takes 4 B. If every page table fits into a single page and 3 level paging are used then size of virtual memory is ________(in bits).
Consider a page size of 1 KB and that each page table entry takes 4 B. If every page table fits into a single page and 3 level paging are used then size of virtual memory...
659
views
commented
Jan 1, 2018
Operating System
made-easy-full-length
operating-system
+
–
2
answers
6
ISRO-DEC2017-28
The number of structurally different possible binary trees with $4$ nodes is $14$ $12$ $336$ $168$
The number of structurally different possible binary trees with $4$ nodes is $14$$12$$336$$168$
3.0k
views
commented
Dec 21, 2017
DS
isrodec2017
+
–
1
answer
7
ISRO-DEC2017-42
In designing a computer's cache system, the cache block (or cache line) size es an important parameter. Which one of the following statements is correct in this context? Smaller block size incurs lower cache miss penalty. Smaller block size implies better spatial locality. Smaller block size implies smaller cache tag. Smaller block size implies lower cache hit time.
In designing a computer's cache system, the cache block (or cache line) size es an important parameter. Which one of the following statements is correct in this context?S...
1.6k
views
commented
Dec 20, 2017
CO and Architecture
isrodec2017
+
–
4
answers
8
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...
16.2k
views
commented
Dec 18, 2017
DS
gatecse-2015-set2
data-structures
binary-heap
normal
+
–
4
answers
9
GATE CSE 1989 | Question: 1-vii, ISRO2015-14
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is $4$ $5$ $6$ $3$
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear p...
17.9k
views
commented
Dec 14, 2017
Algorithms
hashing
isro2015
gate1989
algorithms
normal
+
–
2
answers
10
ISRO2016-51
For the real time operating system, which of the following is the most suitable scheduling scheme? Round robin First come first serve Pre-emptive Random scheduling
For the real time operating system, which of the following is the most suitable scheduling scheme?Round robinFirst come first servePre-emptiveRandom scheduling
9.1k
views
commented
Dec 14, 2017
Operating System
isro2016
operating-system
process-scheduling
+
–
2
answers
11
Self doubt in Class of language
If L1 is regular and L2 is CFL then L1.L2 ( . => concat) is ?
If L1 is regular and L2 is CFL then L1.L2 ( . = concat) is ?
454
views
commented
Nov 29, 2017
Theory of Computation
theory-of-computation
identify-class-language
context-free-language
regular-language
+
–
1
answer
12
toc-identify class of a language
817
views
commented
Nov 26, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
13
Average
A train travels 8 km in the first quarter of an hour, 6 km in the second quarter and 40 km in the third quarter. Find the average speed of train per hour over the entire journey. <a>. 72 km/h <b>. 18 km/h <c>. 77.33 km/h <d>. 78.5 km/h
A train travels 8 km in the first quarter of an hour, 6 km in the second quarter and 40 km in the third quarter. Find the average speed of train per hour over the entire ...
482
views
commented
Nov 26, 2017
1
answer
14
GATE CSE 2016 Set 1 | Question: 34
The following function computes the maximum value contained in an integer array $P[ \ ]$ of size $n$ $(n>=1)$. int max (int *p,int n) { int a = 0, b=n-1; while (__________) { if (p[a]<= p[b]) {a = a+1;} else {b = b-1;} } return p[a]; } The missing loop condition is: $a\ \ != n$ $b\ \ != 0$ $b>(a+1)$ $b\ \ != a$
The following function computes the maximum value contained in an integer array $P[ \ ]$ of size $n$ $(n>=1)$. int max (int *p,int n) { int a = 0, b=n-1;...
11.2k
views
commented
Nov 23, 2017
Programming in C
gatecse-2016-set1
programming-in-c
normal
+
–
3
answers
15
Virtual Gate Test Series: Computer Networks - Sequence Number
Consider bandwidth of line is $100$ Mbps and the sequence number of the field consists $32$ bits on a TCP machine. How much time it will take to cover all possible sequence numbers? ________________ sec (integer value only). Mine was $ 343.59$, so $344$ but my answer is wrong.
Consider bandwidth of line is $100$ Mbps and the sequence number of the field consists $32$ bits on a TCP machine. How much time it will take to cover all possible sequen...
611
views
commented
Nov 18, 2017
Computer Networks
computer-networks
sequencenumber
virtual-gate-test-series
+
–
1
answer
16
combinatoric
No of ways to distribute 6 different gifts to 2 student from total 4 student ? my approach ... distinct to distinct ... am getting 378 , given ans is 384 ... they permuted ..is this correct ...?
No of ways to distribute 6 different gifts to 2 student from total 4 student ? my approach ... distinct to distinct ... am getting 378 , given ans is 384 ... they permute...
607
views
commented
Nov 18, 2017
0
answers
17
OS-(How to approach?)
A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity of 10 MB. If the disk has 20 sectors per track and is currently at the end of the 5th sector ... of 6000 rpm, how much time will it take to read 1 MB contiguous data starting from the sector 4 of the outer most track?
A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity of 10 MB.I...
401
views
commented
Nov 16, 2017
Operating System
operating-system
disk-scheduling
+
–
4
answers
18
Test Series
How come here deadlock is not possible?! It says each process needs a minimum of one instance to complete. So maximum could be anything greater than one and deadlock may happen in the worst case, right?
How come here deadlock is not possible?! It says each process needs a minimum of one instance to complete. So maximum could be anything greater than one and deadlock may...
873
views
commented
Nov 8, 2017
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
0
answers
19
Shortest Path
First Statement is true. But I don't know about second?
First Statement is true. But I don't know about second?
892
views
commented
Nov 2, 2017
Algorithms
shortest-path
algorithms
+
–
1
answer
20
Computer networks
There are 10 stations in a LAN always having constant load, ready to transmit. During any particular contention slot, each station transmits with a probability 0.1. If the average frame takes 122ms to transmit, what is the channel efficiency, if the round trip time is 51.2 micro seconds?
There are 10 stations in a LAN always having constant load, ready to transmit. During any particular contention slot, each station transmits with a probability 0.1. If th...
1.3k
views
commented
Oct 28, 2017
3
answers
21
Calculate sum of (WAR, RAW and WAW) dependencies instructions.
Consider the following instructions. I 1 : R 1 = 100 I 2 : R 1 = R 2 + R 4 I 3 : R 2 = R 4 + 25 I 4 : R 4 = R 1 + R 3 I 5 : R 1 = R 1 + 30 Calculate sum of (WAR, RAW and WAW) dependencies the above instructions. (a) 10 (c) 6 (b) 12 (d) 8
Consider the following instructions.I 1 : R 1 = 100I 2 : R 1 = R 2 + R 4I 3 : R 2 = R 4 + 25I 4 : R 4 = R�...
5.4k
views
commented
Oct 3, 2017
CO and Architecture
data-dependency
data-hazards
+
–
0
answers
22
csma/cd
596
views
commented
Oct 3, 2017
Computer Networks
computer-networks
+
–
1
answer
23
SPEEDUP CPI
. A program running on a non-pipelined processor executes 15% load instructions (5 cycles), 20% store instructions (4 cycles), 15% branch instructions (3 cycles) and 50% ALU instructions (4 cycles). What is the CPI? Now we execute this program on a ... write) in one cycle, ignoring data and control hazards (only consider structural hazards). What is the speedup over the previous one?
. A program running on a non-pipelined processor executes 15% load instructions (5 cycles), 20% store instructions (4 cycles), 15% branch instructions (3 cycles) and 50%...
1.3k
views
answered
Oct 3, 2017
CO and Architecture
cpi
speedup
+
–
1
answer
24
self doubt
how should we prepare for general aptitude section of gate and when is the best time for its prep during rivision and how much time should we allot to it ?? please advice
how should we prepare for general aptitude section of gate and when is the best time for its prep during rivision and how much time should we allot to it ?? please advice...
427
views
commented
Oct 2, 2017
Quantitative Aptitude
general
+
–
1
answer
25
Algo doubt
What will be the time complexity? voidfun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) printf("hello"); }
What will be the time complexity?voidfun(){int i, j;for (i=1; i<=n; i++)for (j=1; j<=log(i); j++)printf("hello");}
412
views
commented
Sep 29, 2017
Algorithms
time-complexity
+
–
1
answer
26
sql query
755
views
commented
Sep 28, 2017
6
answers
27
Simplified CFG
Consider the following grammar $S\rightarrow Aa\mid B $ $B\rightarrow a\mid BC$ $C \rightarrow a\mid \in$ the no of productions in simplified cfg is
Consider the following grammar$S\rightarrow Aa\mid B $$B\rightarrow a\mid BC$$C \rightarrow a\mid \in$the no of productions in simplified cfg is
3.3k
views
commented
Sep 25, 2017
Compiler Design
compiler-design
context-free-grammar
+
–
1
answer
28
UGC NET CSE | December 2008 | Part 2 | Question: 9
Suppose it takes $100$ $ns$ to access page table and $20$ $ns$ to access associative memory. If the average access time is $28$ $ns$, the corresponding hit rate is: $100$ percent $90$ percent $80$ percent $70$ percent
Suppose it takes $100$ $ns$ to access page table and $20$ $ns$ to access associative memory. If the average access time is $28$ $ns$, the corresponding hit rate is:$100$ ...
790
views
commented
Sep 25, 2017
Computer Networks
ugcnetcse-dec2008-paper2
computer-networks
cache-memory
+
–
1
answer
29
Data Dependency
Do we have to see the WAW and WAR dependency in adjacent instructions or the full set of instructions ?
Do we have to see the WAW and WAR dependency in adjacent instructions or the full set of instructions ?
427
views
commented
Sep 24, 2017
0
answers
30
dependencies
The following code is to be executed in a 3 stage pipelined processor with hazard detection and resolution at each stage.The stages are IF , OF(one or more as required) and execution(including writeback operation) What are the possible RAW , WAR ,WAW hazards R0 <- (R0) + 1 ACC <- (ACC) * (R0) R1<-ACC ACC <-ACC + R0 M <-(ACC)
The following code is to be executed in a 3 stage pipelined processor with hazard detection and resolution at each stage.The stages are IF , OF(one or more as required) a...
222
views
commented
Sep 24, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register