This combine questions from Gateforum Test Series .

# Recent questions tagged gateforum-test-series

1
1 vote
2
3
Please tell me that why BW is satisfied here I m facing problem in these topic
4
Given a text array $T[1…..n]$ and a pattern array $P[1….m]$ such that T and P are character taken from alphabet $\sum$, $\sum={a,b,c,…..z}$. String matching problem is to find all the occurence of P in T. A pattern occur with shift s in T if $P[1…..m]=T[s+1,…...s+m]$. Consider $T=bacacbaacacac$ $P=cac$ The sum of the value of all s is ________
1 vote
5
Which of the following time stamp ordering protocol(s) allow the following schedules? $T:W_1(A)\ W_2(A)\ W_3(A)\ R_2(A)\ R_4(A)$ Time stamps: $T_1=5,T_2=10,T_3=15,T_4=20$ Thomas write rule Multiversion time stamp protocol Basic Time stamp All of these
1 vote
6
Consider a scnario of CSMA/CD network. Suppose A & B attempt to transmit a frame simultaneously and collide. Using exponential backoff algorithm A chooses K=0 and B chooses K=1. Again they collide and after the 2nd collision both A & B will choose K with equal probability from set: For A {0,1} and for B {0,1} For ... for B {0,1} For A {0,1} and for B {0,1,2,3} For A {0,1,2,3} and for B {0,1,2,3}
1 vote
7
Which of the following is FALSE? (A) LL(k) grammars are context free grammar (B) LL(k) grammars are unambiguous (C) There are LL(k) grammars which are not context free (D) LL(k) grammars cannot have left recursion i marked a answer is given c)
1 vote
8
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano seconds.
9
Let the page fault probability be 0.6 and page fault service time is 150 ms and time to replace dirty page is 200 ms. In case of a page fault the probability of being dirty is 0.5. If a memory access takes 100 ms. The effective access time is ___ ms?
1 vote
10
11
12
Which of the following is false? a)All the schedules which are allowed under basic time stamp ordering protocols are also allowed under Thomas write rule. b)Schedules which are allowed under Thomas write rule are also allowed under multi-version timestamp ordering ... schedules which are not allowed Thomas write rule are also not allowed in a multi-version timestamp ordering protocol. d)None.
13
Direction:Each data sufficiency problem consists of a question and two statements,labeled $(1)$ and $(2)$,which contain certain data.Using these data and your knowledge of mathematics and everyday fact(such as the number of days in july or the meaning of the word counterclockwise),decide whether the data given are sufficient for ... $(2)\sqrt{x}<y$ $Q2)$ Is $m>n?$ $(1)n-m+2>0$ $(2)n-m-2>0$
14
$a=a+100$ in function foo, does it increases the value of a by 100 or just increments the address.
15
16
17
18
Suppose you are designing a sliding window protocol for a $1Mbps$ point to point link which has one way latency of $1.25s$. Assuming that each frame carries $1kB$ of data, determine the minimum number of bits required for the sequence number. Answer provided - $9$ bits.
19
1 vote
20
What is the largest mantissa we can store in floating-point format if the size of the mantissa field is m-bit and exponent field is e-bit? The mantissa is normalized and has an implied $1$ in the left of the point. Normalized form of mantissa is 1.M
1 vote
21
22
which of the following statement is true with respect to the following program? unsigned long flags; Acquire(lock); ……….. if(something_bad){ … return ERROR; } Release(lock); return 0; The program acquires and release lock properly. The program has a problem with releasing the lock, The “Release(lock)” statement should be moved inside the “If(something_bad)”, block Both B and C
1 vote
23
24
the table “Sales89” contains information about the address,zip,sale-date,price and inflamation-adjusted “real-price” of 222 sales of single family homes in calcutta during 1989.Here is the table schema
25
suppose that in a file organization record size(R)=150 bytes , block size (B)=512 bytes. there are totally 30000 records. the data field on which indexing is done is 9 bytes and block pointer size is 7 bytes how many block access will be needed to access a data item in case of single level primary indexing?
26
Can anyone explain how will the second parameter gets passed ?
27
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as B-A-C . The exact pre order traversal of the tree is? A)C-A-B B)A-B-C C)C-B-A D)Can't be determined from given information.
1 vote