Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged gatebook
0
votes
0
answers
Gatebook Mock Test
Assume at Kth level (assuming the level of root as level 1) we strictly exceed 400 then answer will be K1 and If at Kth level, total number of keys =400 then answer K. Hence, At Root level : 1 Node, 1 Key, 2 Pointers At next level(2nd level) : 2 ... we can have only 160 keys .So to have 400 keys with maximum levels we need the 6th level. Can anyone help me where I am wrong.
asked
Jan 18
in
Databases
by
badman
(
9
points)

11
views
gatebook
+2
votes
0
answers
GateBook Full Length Test
Which of the following statements is/are true/correct ? A) Professor Ram gives a comparisonbased sorting algorithm that runs in T(n) = 2T(n1)+ 1. There is not enough information to know whether Ram's algorithm is correct. B) Professor ... base 6) so this also should not be the time complexity of a comparison based sorting algorithm. Can anyone confirm?.Thanks in advance
asked
Dec 28, 2020
in
Algorithms
by
Deterministic
(
31
points)

40
views
gatebook
algorithms
timecomplexity
+1
vote
1
answer
GateBook OS test series
G Suppose a system in which there are two types of processes, type A and type B processes. All processes of type A execute the same code, and all processes of type B execute the same code. The code for each process type is shown below. A Processes B ... of AABAB. S2 : It is possible for processes to finish in the order AABBA. Which of the above statement(s) is/are CORRECT ?
asked
Nov 26, 2020
in
Operating System
by
Deterministic
(
31
points)

46
views
gatebook
0
votes
0
answers
GATEBOOK TEST SERIES  TM
is a language and is a Turing machine which accepts . loops on epsilon forever. Which one of the following statements is true ? (A) is r.e but not recursive (B) can be non r.e (C) can not be recursive (D) can be regular
asked
Oct 7, 2020
in
Theory of Computation
by
Gate2022
(
7
points)

25
views
gatebook
0
votes
1
answer
GATEBOOK TEST SERIES  TM Q4
Consider the following three statements. I. If the language L is recognized by a nondeterministic finite automaton, then L is recognized by a deterministic finite automaton. II. If the language L is recognized by a nondeterministic pushdown automaton, then L is ... (D) One of the three statements is known to be true; the other two statements are known to be false.
asked
Oct 7, 2020
in
Theory of Computation
by
Gate2022
(
7
points)

67
views
gatebook
0
votes
0
answers
GATEBOOK TEST  TOC Q7
Suppose there are four languages . Each of the languages may or may not be recursive enumerable. However, we know that the following about them: There is a reduction from to There is a reduction from to There is a reduction from to Below are four statements. Indicate whether each one is (a) CERTAIN to be true, ... C) P(c), Q(b), R(a), S(a) (D) P(c), Q(b), R(a), S(b)
asked
Oct 7, 2020
in
CO & Architecture
by
Gate2022
(
7
points)

19
views
gatebook
0
votes
0
answers
GATEBOOK Test Series  TOC Q 14
Let h be the homomorphism defined by h(a) = b and h(b) = a. Let Which of the following statements is correct? (A). L is regular. (B). L is non regular DCFL (C). L is nonDCFL But CFL (D). L is NonCFL
asked
Oct 7, 2020
in
CO & Architecture
by
Gate2022
(
7
points)

47
views
gatebook
0
votes
0
answers
GATEBOOK TEST SERIES  TOC  Q17
Consider the following problems. 1. Given a TM M and a string w, does M ever write the symbol ... of the above problems are decidable? (A) Only 4 (B) 2 and 3 Only (C) 2 and 4 Only (D) 2, 3 and 4 Only
asked
Oct 7, 2020
in
CO & Architecture
by
Gate2022
(
7
points)

13
views
gatebook
0
votes
0
answers
GATEBOOK Test Series  TOC
Let h be the homomorphism defined by h(a) = b and h(b) = a. Let Which of the following statements is correct? (A). L is regular. (B). L is non regular DCFL (C). L is nonDCFL But CFL (D). L is NonCFL
asked
Oct 2, 2020
in
Theory of Computation
by
Gate2022
(
7
points)

23
views
gatebook
0
votes
2
answers
GATEBOOK  Test Series  TOC
Consider the following statements S1: If F is a finite language and L is some language, and is a regular language, then L must be a regular language. S2: If A is regular and is regular then so is B. Which one of the following statements is True ? (A) Only S1 (B) Only S2 (C) Both S1 and S2 (D) Neither S1 or S2
asked
Oct 2, 2020
in
Theory of Computation
by
Gate2022
(
7
points)

105
views
gatebook
0
votes
0
answers
GATEBOOK Test Series  Closure Properties
Consider the following statements : 1. if a deterministic finite automaton M over alphabet accepts all strings of length less than or equal to the number of states in M, then it must accept all strings over . 2. if a nondeterministic finite automaton M over alphabet ... of the above statements is/are correct ? A. Only 3 B. Only 1,3,4 C. Only 1,2,3 D. ALL
asked
Oct 2, 2020
in
Theory of Computation
by
Gate2022
(
7
points)

21
views
gatebook
0
votes
0
answers
GATEBOOK  Test Series  TOC
Consider the CFG 'G' given below ,where S and A are nonterminals, S is the start symbol, and {0,1} is the set of terminals. Let L(G) denote the language generated by the above grammar, language L(G) is (A) Regular (B) DCFL but not Regular (C) CFL but not DCFL (D) CSL but not CFL
asked
Oct 2, 2020
in
Theory of Computation
by
Gate2022
(
7
points)

15
views
gatebook
0
votes
1
answer
GATEBOOK  Test Series  TOC
Consider the following problems. 1. Given a TM M and a string w, does M ever write the symbol ... of the above problems are decidable? (A) Only 4 (B) 2 and 3 Only (C) 2 and 4 Only (D) 2, 3 and 4 Only
asked
Oct 2, 2020
in
Theory of Computation
by
Gate2022
(
7
points)

26
views
gatebook
0
votes
0
answers
Show that the language L = w1cw2 : w1, w2 ∈ {a, b}+ , {w1 ≠ w^R2 } with Σ = {a, b, c}, is contextfree.
asked
Jun 26, 2020
in
Theory of Computation
by
roh
(
9
points)

34
views
theoryofcomputation
gatebook
peterlinz
0
votes
0
answers
l1 = (ab m>0), l2=lamda. then l is which type of language  regular or context?
asked
May 13, 2020
in
Theory of Computation
by
gunjanmimo
(
5
points)

8
views
gatebook
0
votes
0
answers
#microprogrammed control unit
In case of micro programmed control unit, why we have field reserved for control memory address as the micro program counter will automatically be incremented by clock and will point to the next micro instruction in sequence?
asked
Mar 30, 2020
in
CO & Architecture
by
Lovejeet Singh
(
5
points)

11
views
coandarchitecture
controlunit
sir
gatebook
+2
votes
0
answers
Gatebook Heaps
What is the minimum number of comparisons required in the worst case to find the smallest element in a minheap? Can someone please explain the procedure. The answer is 50*51 / 2
asked
Jan 20, 2020
in
DS
by
neeraj_bhatt
(
475
points)

17
views
heap
gatebook
0
votes
0
answers
Gatebook Test Series COA
Consider the following statements about autoincrement/autodecrement addressing modes: (i) In autoincrement addressing mode address of the operand is computed first followed by an increment of the content of the register (ii) In autodecrement addressing mode address of the operand is computed first ... B) (i) and (iii) only (C) (i) and (iv) only (D) (ii) and (iii) only
asked
Dec 24, 2019
in
CO & Architecture
by
neeraj_bhatt
(
475
points)

21
views
gatebook
addressingmodes
0
votes
1
answer
GATEBOOK DSA
You are given a hash table with n keys and m slots, with the simple uniform hashing (assume each key is equally likely to be hashed into each slot). Collisions are resolved by chaining. What is the expected number of slots that end up not being empty ?
asked
Dec 2, 2019
in
DS
by
Sambhrant Maurya
(
485
points)

70
views
dsa
hashing
gatebook
0
votes
0
answers
Gatebook : CO
What conclusions can be drawn regarding traffic generated to the main memory for write through and write back if we vary miss rate? Higher miss rate write through is superior (generates less traffic) Higher miss rate write back is superior (generates less traffic) Lower miss rate write ... A). 1, 4 are true (B). 2, 3 are true (C). No conclusions can be drawn (D). Similar performance
asked
Oct 19, 2019
in
CO & Architecture
by
Sambhrant Maurya
(
485
points)

25
views
coandarchitecture
gatebook
cachememory
0
votes
0
answers
Gatebook: CO Basics
A computer uses 8 digit mantissa and 2 digit exponent. If a = 0.052 and b = 28E + 11 then will A. result in underflow B. result in overflow C. 0 D. 5.28 E + 11
asked
Oct 19, 2019
in
CO & Architecture
by
Sambhrant Maurya
(
485
points)

15
views
coandarchitecture
gatebook
0
votes
1
answer
Gatebook: Control Unit
1 0 1 0 1 0 1 1 0 1 0 0 0 1 0 1 0 1 0 0 1 1 0 0 1 1 0 0 1 1 1 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 1 0 1 0 0 0 1 0 1 0 1 0 0 1 1 0 0 1 1 0 0 1 1 1 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 Minimum and maximum no of bits used to generate these control signals is
asked
Oct 18, 2019
in
CO & Architecture
by
Sambhrant Maurya
(
485
points)

106
views
coandarchitecture
gatebook
controlunit
0
votes
0
answers
Gatebook: CO
#include <stdio.h> int main() { unsigned char arr[2] = {0x01, 0x00}; unsigned short int x = *(unsigned short int *) arr; printf("%d", x); getchar(); return 0; } What is the output on little endian and big endian respectively? A. 1, 1 B, 256, 1 C. 1, 256 D. None of above Please explain how the array is stored in memory here and how we are accessing it using x.
asked
Oct 18, 2019
in
CO & Architecture
by
Sambhrant Maurya
(
485
points)

27
views
coandarchitecture
gatebook
+1
vote
0
answers
Gatebook: Addressing Modes
Consider an instruction of indirect addressing mode. What are the number of memory references by the processor when instruction is a computation that requires a single operand and when it is a unconditional branch instruction respectively ? A. 3, 3 B. 3, 2 C. 2, 2 D. 4, 3
asked
Oct 18, 2019
in
CO & Architecture
by
Sambhrant Maurya
(
485
points)

30
views
gatebook
addressingmodes
0
votes
1
answer
Gatebook :IO Interfaces
Consider a system in which I/O device has a data transfer rate of 20KB/s and employs DMA. Bus cycle takes 200 ns. Transfer of bus control in both directions takes 120 ns. Data transferred 1 byte at a time. Suppose if DMA cycle stealing mode is ... microseconds) bus would be tied up by bus if a block of 256 bytes is transferred? (Reduce the answer to the nearest integer)
asked
Oct 17, 2019
in
CO & Architecture
by
Sambhrant Maurya
(
485
points)

53
views
gatebook
dma
0
votes
0
answers
Gatebook : Memory Organization
Consider a cache system organization employing a line size of 64 Bytes and main memory that requires 40 ns to transfer a 2 Byte word. What is the minimum average number of times a cache line must be made dirty for writeback policy to be more efficient than writethrough policy, for any line which is written atleast once?
asked
Oct 17, 2019
in
CO & Architecture
by
Sambhrant Maurya
(
485
points)

20
views
gatebook
cachememory
0
votes
0
answers
Gatebook: Memory Organization
The designers of a computer must select a cache system. They have two options. Design #1 uses a directmapped cache containing 2 words per cache line. It would have an instruction miss rate of 3% and a data miss rate of 8% Design #2 uses a 2way set associative cache containing 8 words per cache ... . D1 = 0.70, D2 = 0.40 C. D1 = 0.70, D2 = 0.48 D. D1 = 1.10, D2 = 0.40
asked
Oct 17, 2019
in
CO & Architecture
by
Sambhrant Maurya
(
485
points)

223
views
gatebook
cachememory
0
votes
1
answer
gatebook #file system
Consider a UNIX file system with 12 direct pointers, 1 indirect pointer, 1 doubleindirect pointer, and 1 tripleindirect pointer in the inode. Assume that disk blocks are 8K bytes and that each pointer to a disk block requires 4 bytes.How many disk reads will ... inodes and no data blocks); Assume that the root directory contains very few entries (i.e., is one block long) .
asked
Oct 17, 2019
in
Operating System
by
chandrikabhuyan8
(
165
points)

55
views
gatebook
0
votes
1
answer
Gatebook:Calculus
The area of triangle is calculated by the formula . If the angle A is measure with 1% error. Find the % error in area. (A) (B) (C) (D)
asked
Oct 7, 2019
in
Calculus
by
Sambhrant Maurya
(
485
points)

34
views
gatebook
engineeringmathematics
calculus
0
votes
1
answer
Gatebook: Calculus
The area enclosed between the parabola and straight line is (A) (B) (C) (D)
asked
Oct 7, 2019
in
Calculus
by
Sambhrant Maurya
(
485
points)

33
views
gatebook
engineeringmathematics
calculus
0
votes
1
answer
Gatebook boolean algebra min  terms
The number of Product terms in SOP Expressions after minimizing the following Boolean expression is: $\bigg[D’+AB’+A’C+AC’D+A’C’D\bigg]$ $1$ $2$ $3$ $4$
asked
Oct 4, 2019
in
Digital Logic
by
Lakshman Patel RJIT
(
165
points)

60
views
digitallogic
booleanalgebra
gatebook
0
votes
0
answers
Gatebook boolean algebra
What is the time complexity for checking whether an assignment of truth values to variables $x_{1}\dots x_{n}$ satisfies a given formula $f(x_{1},\dots,x_{n})?$ $O(2^{n})$ $O(g(n))$ , where $g$ is a polynomial $O(\log (n))$ None of the above
asked
Oct 4, 2019
in
Digital Logic
by
Lakshman Patel RJIT
(
165
points)

29
views
digitallogic
booleanalgebra
gatebook
0
votes
1
answer
Gatebook: Logic
Which of the following first order logic statement is equivalent to below statement ? If anyone cheats, everyone suffers. S1: S2: A. Only S1 B. Only S2 C. Both S1 and S2 D. None
asked
Sep 28, 2019
in
Mathematical Logic
by
Sambhrant Maurya
(
485
points)

47
views
firstorderlogic
discretemaths
gatebook
0
votes
1
answer
Gatebook: Set Theory
Let is a partial order relation defined on natural numbers. Identify the false statement? (A). is distributive but not complemented lattice (B). is not a lattice (C). is not Boolean lattice (D). Element 1 doesn't have complement
asked
Sep 22, 2019
in
Mathematical Logic
by
Sambhrant Maurya
(
485
points)

50
views
sets
discretemaths
gatebook
0
votes
2
answers
Gatebook;DBMS
Consider the relation employee(name,sex,manager) with name as the key, manager gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? A. Names of employees who have a female subordinate B. ... manager How to interpret this TRC expression? The y.name = e.manager =>x.sex=female part is troublesome.
asked
Sep 19, 2019
in
Databases
by
Sambhrant Maurya
(
485
points)

72
views
databases
gatebook
trc
0
votes
0
answers
Gatebook; DBMS
In translating from an entityrelationship (ER) diagram to a relational schema, one piece of ER logic that cannot be captured by primary keys, uniques, and foreign keys is (A) the weak entity. (B) any ternary relationship. (C) mandatory participation for onetime occurrence (that is, with the arrow). (D) mandatory participation for manytime occurrence (that is, without the arrow).
asked
Sep 19, 2019
in
Databases
by
Sambhrant Maurya
(
485
points)

41
views
databases
gatebook
+1
vote
0
answers
Gatebook:DBMS
Consider the following entityrelationship (ER) model For the following group of statements, which one does not coincide (Or not true) with the model ? (A) Each person has at most one email address. (B) Each email address belongs to exactly ... passport number? eg I can assign 3 passport numbers to the same person Pinkman. Passport Number Name 101 Pinkman 102 Pinkman 103 Pinkman
asked
Sep 19, 2019
in
Databases
by
Sambhrant Maurya
(
485
points)

42
views
databases
gatebook
+1
vote
1
answer
Gatebook: DBMS
Consider the following table Mystery A B 1 null 2 4 3 5 null 6 select count() from Mystery where A not in( select B from Mystery) What is the output of this query? (A) 1 (B) 0 (C) 4 (D) 3
asked
Sep 19, 2019
in
Databases
by
Sambhrant Maurya
(
485
points)

41
views
databases
gatebook
+1
vote
1
answer
Gatebook TS: Algorithms
An array is said to be ordered if for each such that . for example, the array 1 4 2 6 3 7 5 8 is 2ordered. In a 2ordered array of 2N elements, what is the maximum number of positions that an element can be from its position if the array were 1ordered?
asked
Sep 1, 2019
in
Algorithms
by
Sambhrant Maurya
(
485
points)

33
views
gatebook
sorting
algorithms
0
votes
2
answers
Gatebook: Algorithms
Of the following, which gives the best upper bound for the value of where is a solution of the recurrence , with
asked
Sep 1, 2019
in
Algorithms
by
Sambhrant Maurya
(
485
points)

81
views
gatebook
algorithms
asymptoticanalysis
Page:
1
2
next »
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
9,020
questions
3,138
answers
14,457
comments
95,829
users