Recent questions tagged gatebook - GATE CSE Doubts

0 votes

0 answers

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 6 days ago in DS by Sambhrant Maurya (281 points) | 16 views

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 in CO & Architecture by Sambhrant Maurya (281 points) | 12 views

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 in CO & Architecture by Sambhrant Maurya (281 points) | 10 views

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 in CO & Architecture by Sambhrant Maurya (281 points) | 19 views

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 in CO & Architecture by Sambhrant Maurya (281 points) | 15 views

0 votes

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 in CO & Architecture by Sambhrant Maurya (281 points) | 21 views

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 in CO & Architecture by Sambhrant Maurya (281 points) | 15 views

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 write-back policy to be more efficient than write-through policy, for any line which is written at-least once?

asked Oct 17 in CO & Architecture by Sambhrant Maurya (281 points) | 8 views

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 direct-mapped 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 2-way 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 in CO & Architecture by Sambhrant Maurya (281 points) | 20 views

0 votes

1 answer

gatebook #file system
Consider a UNIX file system with 12 direct pointers, 1 indirect pointer, 1 double-indirect pointer, and 1 triple-indirect pointer in the i-node. Assume that disk blocks are 8K bytes and that each pointer to a disk block requires 4 bytes.How many disk reads will ... i-nodes and no data blocks); Assume that the root directory contains very few entries (i.e., is one block long) .

asked Oct 17 in Operating System by chandrikabhuyan8 (117 points) | 25 views

0 votes

0 answers

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 in Calculus by Sambhrant Maurya (281 points) | 16 views

0 votes

0 answers

Gatebook: Calculus
The area enclosed between the parabola and straight line is (A) (B) (C) (D)

asked Oct 7 in Calculus by Sambhrant Maurya (281 points) | 9 views

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 in Digital Logic by Lakshman Patel RJIT (104 points) | 37 views

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 in Digital Logic by Lakshman Patel RJIT (104 points) | 19 views

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 in Mathematical Logic by Sambhrant Maurya (281 points) | 19 views

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 in Mathematical Logic by Sambhrant Maurya (281 points) | 30 views

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 in Databases by Sambhrant Maurya (281 points) | 15 views

0 votes

0 answers

Gatebook; DBMS
In translating from an entity-relationship (E-R) diagram to a relational schema, one piece of E-R 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 one-time occurrence (that is, with the arrow). (D) mandatory participation for many-time occurrence (that is, without the arrow).

asked Sep 19 in Databases by Sambhrant Maurya (281 points) | 10 views

0 votes

0 answers

Gatebook:DBMS
Consider the following entity-relationship (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 e-mail address. (B) Each e-mail 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 in Databases by Sambhrant Maurya (281 points) | 8 views

0 votes

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 in Databases by Sambhrant Maurya (281 points) | 15 views

+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 2-ordered. In a 2-ordered array of 2N elements, what is the maximum number of positions that an element can be from its position if the array were 1-ordered?

asked Sep 1 in Algorithms by Sambhrant Maurya (281 points) | 22 views

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 in Algorithms by Sambhrant Maurya (281 points) | 33 views

0 votes

0 answers

Gatebook test series
Below is the implementation of merge sort. void sort(int a, int lo, int hi){ if(hi<=lo) return; int mid = lo + (hi-lo)/2; sort(a,lo,mid); sort(a,mid+1,hi); merge(a,lo,mid,hi); } Assume that merge function merges the elements a[lo] to a[mid] and a[mid+ ... a[mid]<=a[mid+1]. The number of comparisons needed to merge sort a sorted array is: O(n log n) O(n) O(1) O(log n)

asked Sep 1 in Algorithms by Sambhrant Maurya (281 points) | 14 views

0 votes

1 answer

regular language and few statements
$L$ is a regular language over $\Sigma^*$ $X = \{ x |x\ belongs\ to\ \Sigma^*, |x|\ is\ between\ n\ to\ 2n-1\ \}$ $\exists w \in x, w \in L\ then\ L\ is\ infinite.$ $\exists, |w| >= 2n,\ w \in L\ then\ \exists x \in X$ Which one of the following statements are true ? (A) Only I (B) Only II (C) Both I and II (D) Neither I or II

asked Aug 19 in Theory of Computation by KINGSLAYER (9 points) | 43 views

+1 vote

1 answer

checking if given languages are regular or not
Consider the following languages. Which one of the following statements is true ? (A) L1 is regular, L2 is non regular (B) L1 is non regular, L2 is regular (C) L1 is regular, L2 is regular (D) L1 is non regular, L2 is non regular My ... string and if it is, we can prove that L1 is regular, but how can L2 be regular as that order needs to be maintained!

asked Aug 17 in Theory of Computation by KINGSLAYER (9 points) | 42 views

To see more, click for the full list of questions or popular tags.

2,267 questions

1,281 answers

6,475 comments

89,713 users