menu
search
Log In

GO Book for GATECSE 2022GATE Overflow Book for GATE CSE 2022

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

Subjects


GATE Overflow
Recent questions tagged gateforum-test-series

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts
This combine questions from Gateforum Test Series .

Recent questions tagged gateforum-test-series

0 votes
1 answer
3
Gateforum booklet
Please tell me that why BW is satisfied here I m facing problem in these topic
Please tell me that why BW is satisfied here I m facing problem in these topic
asked Jan 15, 2019 in Operating System Prince Sindhiya 169 views
0 votes
2 answers
4
Gateforum Test Series: Algorithms - Dynamic Programming
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 ________
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 ________
asked Jan 14, 2019 in Algorithms Gupta731 311 views
1 vote
0 answers
5
Gateforum Test Series: Databases - Transactions
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
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
asked Jan 13, 2019 in Databases Gupta731 201 views
1 vote
1 answer
6
Gateforum Test Series: Computer Networks - Lan Technologies
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 ... {0,1} and for B {0,1,2,3} For A {0,1,2,3} and for B {0,1,2,3}
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}
asked Jan 13, 2019 in Computer Networks Gupta731 242 views
1 vote
1 answer
7
Gateforum Test Series: Compiler Design - Parsing
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)
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)
asked Jan 11, 2019 in Compiler Design Prince Sindhiya 297 views
1 vote
1 answer
8
Gateforum Test Series: Operating System - Virtual Memory
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.
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.
asked Jan 11, 2019 in Operating System snaily16 159 views
0 votes
0 answers
9
Gateforum Test Series: Operating System - Virtual Memory
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?
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?
asked Jan 11, 2019 in Operating System snaily16 545 views
0 votes
2 answers
12
Gateforum Test Series: Databases - Transactions
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 ... are not allowed Thomas write rule are also not allowed in a multi-version timestamp ordering protocol. d)None.
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.
asked Jan 5, 2019 in Databases Parth Shah 1.9k views
0 votes
0 answers
13
Gateforum Test Series: General Aptitude - Logical Reasoning
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 ... $Q2)$ Is $m>n?$ $(1)n-m+2>0$ $(2)n-m-2>0$
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$
asked Jan 4, 2019 in Analytical Aptitude Lakshman Patel RJIT 146 views
0 votes
0 answers
14
Gateforum Test Series
$a=a+100$ in function foo, does it increases the value of a by 100 or just increments the address.
$a=a+100$ in function foo, does it increases the value of a by 100 or just increments the address.
asked Jan 2, 2019 in Programming Gupta731 121 views
0 votes
1 answer
16
Gateforum Test Series
asked Jan 2, 2019 in Algorithms Gupta731 151 views
2 votes
1 answer
18
Gateforum Test Series: Computer Networks - Sliding Window
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.
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.
asked Dec 24, 2018 in Computer Networks Gupta731 185 views
1 vote
1 answer
20
Gateforum Test Series: Digital Logic - Floating Point Representation
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
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
asked Dec 24, 2018 in Digital Logic Gupta731 357 views
0 votes
0 answers
22
Gateforum Test Series: Operating System - Process Synchronization
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 ... lock, The Release(lock) statement should be moved inside the If(something_bad) , block Both B and C
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
asked Dec 21, 2018 in Operating System Shivam Kasat 232 views
0 votes
0 answers
24
Gateforum Test Series: Databases - Sql
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
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
asked Dec 19, 2018 in Databases Shivam Kasat 179 views
3 votes
2 answers
25
Gateforum Test Series: Databases - Indexing
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?
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?
asked Dec 19, 2018 in CO and Architecture Shivam Kasat 318 views
4 votes
2 answers
27
Gateforum Test Series: Programming & DS - Binary Tree
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.
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.
asked Dec 11, 2018 in DS Parth Shah 477 views
1 vote
0 answers
28
Gateforum Test Series: Digital Logic - Digital Counter
The MOD value (or) number of states in the ripple counter as shown in the figure is? Answer given: Mod 7 counter. My doubt is that won't it go till 111 and then the counter is cleared as the input to NAND gate is taken from the output of the flipflops?
The MOD value (or) number of states in the ripple counter as shown in the figure is? Answer given: Mod 7 counter. My doubt is that won't it go till 111 and then the counter is cleared as the input to NAND gate is taken from the output of the flipflops?
asked Dec 11, 2018 in Digital Logic Parth Shah 78 views
2 votes
0 answers
29
Gateforum Test Series: Digital Logic - Digital Counter
The circuit shown in figure is using one 4-bit BCD counter and one 4-bit binary counter. The MOD value for the counter is ?
The circuit shown in figure is using one 4-bit BCD counter and one 4-bit binary counter. The MOD value for the counter is ?
asked Dec 11, 2018 in Digital Logic Parth Shah 264 views
0 votes
0 answers
30
Gateforum Test Series: Databases - Indexing
Can anyone explain this in detail???
Can anyone explain this in detail???
asked Dec 9, 2018 in Databases nag.swarna 140 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...