Answers by smartmeet / GATE Overflow for GATE CSE

0 votes

1

How to find the complexity of T(n)=T(sqrt(n)) + 1 ?
Please tell me the complete steps how to solve this problem. $ T(n) = T ( \sqrt n )+ 1$

Please tell me the complete steps how to solve this problem.$ T(n) = T ( \sqrt n )+ 1$

47.2k views

answered Feb 12, 2017

0 votes

2

Gatebook mock
Below is a precedence graph for a set of tasks to be executed on a parallel processing system $S$. Efficiency is defined as the ratio between the speedup and the number of processors. (The speedup is defined as the ratio of the time taken to perform a set of tasks on a single ... same time, what is the efficiency of this precedence graph on $S$? $25\%$ $33\:1/3\%$ $50\%$ $100\%$

Below is a precedence graph for a set of tasks to be executed on a parallel processing system $S$. Efficiency is defined as the ratio between the speedup and the number o...

1.6k views

answered Feb 8, 2017

3 votes

3

gatebook mt2 qn-36
Consider a simple in-order five-stage pipeline with a two-cycle branch misprediction penalty and a single-cycle load-use delay penalty. For a specific program, 30% of the instructions are loads, 20% are branches, the remaining 50% of instructions are ... dependent instruction, and 75% of branches are predicted correctly. What is the average CPI of this program on this processor?

Consider a simple in-order five-stage pipeline with a two-cycle branch misprediction penalty and a single-cycle load-use delay penalty. For a specific program, 30% of the...

1.8k views

answered Feb 8, 2017

6 votes

4

Test series: gatebook mock 2
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair of nodes, which of ... = 10, m = 1 (C) M = 7, m = 4 (D) M = 6, m = 4 Shouldn't the answer be D?

Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any g...

1.9k views

answered Feb 8, 2017

0 votes

5

Gatebook_MockTest2(Aptitude)
There are two examinations rooms A and B. If 10 students are sent from A to B, then the number of students in each room is the same. If 20 candidates are sent from B to A, then the number of students in A is double the number of students in B. The number of students in room A is: (A) 20 (B) 80 (C) 100 (D) 200

There are two examinations rooms A and B. If 10 students are sent from A to B, then the number of students in each room is the same. If 20 candidates are sent from B to A...

373 views

answered Feb 8, 2017

0 votes

6

MadeEasy Subject Test: Compiler Design - Lexical Analysis
Is the given answer correct?

Is the given answer correct?

1.7k views

answered Feb 7, 2017

1 votes

7

GateBook Mock 2
According to me option B is correct.

According to me option B is correct.

720 views

answered Feb 7, 2017

1 votes

8

Gatebook_Mocktest2(Propositional Logic)
Which of the following conditions can be expressed by a Boolean formula in the Boolean variables p1,p2,p3,p4 and the connectives ∧ ∨, (without ¬ ) ? I. At least three of p1,p2,p3,p4 are true. II. Exactly three of p1,p2,p3,p4 are true. III. An even number ofp1,p2,p3,p4are true. (A) I only (B) II only (C) III only (D) I and III

Which of the following conditions can be expressed by a Boolean formula in the Boolean variables p1,p2,p3,p4 and the connectives ∧ ∨, (without ¬ ) ?I. At least three...

785 views

answered Feb 7, 2017

8 votes

9

GateBook_MockTest2(Programming)
# include < stdio.h > main ( ) { float total 0.0, q = 1.0, p = 2.0; while (p/q> 0.001) { q = q + q ; total = total + p/q ; print f (“% f\n”, total) ; } } Which one of the following is the integer that best approximates the last number printed ? (A) 0 (B) 1 (C) 2 (D) 3

# include < stdio.h >main ( ){float total 0.0, q = 1.0, p = 2.0;while (p/q 0.001){q = q + q ;total = total + p/q ;print f (“% f\n”, total) ;}}Which one of the followi...

925 views

answered Feb 7, 2017

1 votes

10

MadeEasy CBT 2017: Databases - Er Diagram
Please explain how they merged.(Modified)

Please explain how they merged.(Modified)

2.1k views

answered Feb 3, 2017

1 votes

11

Predict the result of SQL query
Create table Employee(Emp_id numeric not null, Name varchar(20) , dept_name varchar(20), Salary numeric unique(Emp_id,Name)); What will be the result of the query? insert into Employee values(1002, 'Ross', 'CSE', 10000) ... ;Ted','Finance', ); d) Error in insert into Employee values(1008,'Ross','Sales',20000);

Create table Employee(Emp_id numeric not null, Name varchar(20) , dept_name varchar(20), Salary numeric unique(Emp_id,Name));What will be the result of the query?insert i...

3.2k views

answered Feb 3, 2017

10 votes

12

GATE CSE 2016 Set 2 | Question: 49
Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______

Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, $20$ $P(S)$ operations and $12$ $V(S)...

15.9k views

answered Feb 1, 2017

14 votes

13

GATE CSE 2006 | Question: 64
Consider three processes (process id $0$, $1$, $2$ respectively) with compute time bursts $2$, $4$ and $8$ time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by ... the process with the lowest process id. The average turn around time is: $13$ units $14$ units $15$ units $16$ units

Consider three processes (process id $0$, $1$, $2$ respectively) with compute time bursts $2$, $4$ and $8$ time units. All processes arrive at time zero. Consider the lon...

24.9k views

answered Feb 1, 2017

3 votes

14

MadeEasy Subject Test: Databases - Transactions
S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) Number of serial schedules which are view equal to above S are __. Polygraph that I drew:

S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B)Number of serial schedules which are view equal to above S are __.Polygraph that I drew:

1.4k views

answered Jan 30, 2017

11 votes

15

GATE CSE 2014 Set 1 | Question: 37
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I pick $1, 2, 4, 8, 16$ coins respectively from bags $1$ to $5$ Their total weight comes out to $323$ gm. Then the product of the labels of the bags having $11$ gm coins is ___.

There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I p...

9.5k views

answered Jan 30, 2017

61 votes

16

GATE CSE 2015 Set 2 | Question: 33
Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$? $h(i) = i^2 \text{mod } 10$ $h(i) = i^3 \text{mod } 10$ $h(i) = (11 \ast i^2) \text{mod } 10$ $h(i) = (12 \ast i^2) \text{mod } 10$

Which one of the following hash functions on integers will distribute keys most uniformly over $10$ buckets numbered $0$ to $9$ for $i$ ranging from $0$ to $2020$?$h(i) ...

17.0k views

answered Jan 25, 2017

5 votes

17

GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.

The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.

19.5k views

answered Jan 25, 2017

1 votes

18

testbook compiler

531 views

answered Jan 25, 2017

1 votes

19

ACE TEST SERIES

317 views

answered Jan 25, 2017

2 votes

20

Consider a system with the main memory size of 32MB and each process size 4MB
Consider a system with the main memory size of 32MB and each process size 4MB, if each process spends 80% of its time in doing I/O, what is the CPU utilization percentage? (Assuming there is no virtual memory and ... can perform I/0 in parallel.so at that CPU will be free and therefore its utilisation will be only 20%.

Consider a system with the main memory size of 32MB and each process size 4MB, if each process spends 80% of its time in doing I/O, what is the CPU utilization percentage...

1.7k views

answered Jan 24, 2017

5 votes

21

solve
How many view equal serial schedules possible for the following schedule? S : w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A

How many view equal serial schedules possible for the followingschedule?S : w1(A) r2(A) w3(A) r4(A) w5(A) r6(A) w7(A) r8(A

4.1k views

answered Jan 22, 2017

4 votes

22

how many view equivalent serial schedules are possible
how many view equivalent serial schedules are possible for the given schedule s: w1(a) r2(a) w3(a) r4(a) w5(a) r6(a) a) 2 b) 3 c) 6 d) 8

how many view equivalent serial schedules are possible for the given schedule s: w1(a) r2(a) w3(a) r4(a) w5(a) r6(a)a) 2b) 3c) 6d) 8

8.4k views

answered Jan 22, 2017

5 votes

23

Test by Bikram | Mock GATE | Test 1 | Question: 50
Consider the regular languages denoted by the following pairs of regular expressions: $(0 + 1)$*$ = 0$*$ + 1$*$ $ $0(120)$*$12 = 01(201)$*$2$ $(0$*$l $*$)$*$ = (0$*$1)$*$ $ $(01 +0)$*$0 = 0(10 +0)$*$ $ Determine the truth of ... $a-True, b-False, c-False, d-True$ $a-True, b-True, c-False, d-True$ $a-False, b-True, c-False, d-True$

Consider the regular languages denoted by the following pairs of regular expressions:$(0 + 1)$*$ = 0$*$ + 1$*$ $$0(120)$*$12 = 01(201)$*$2$$(0$*$l $*$)$*$ = (0$*$1)$*$ $$...

717 views

answered Jan 21, 2017

4 votes

24

Test by Bikram | Mock GATE | Test 1 | Question: 51
The access time of cache memory is $10$ $ns$ and main memory is $100$ $ns$. It is estimated that $80 \%$ of memory requests are for read and remaining are for write. The hit ratio for read access only is $0.9$. A write through procedure is used. Pages are always available in cache for write operation. Then, the average access time is ______ $ns$.

The access time of cache memory is $10$ $ns$ and main memory is $100$ $ns$. It is estimated that $80 \%$ of memory requests are for read and remaining are for write. The ...

1.5k views

answered Jan 21, 2017

2 votes

25

Test by Bikram | Mock GATE | Test 1 | Question: 24
The internet host is roughly doubling in size every $18$ $months$. Although no one really knows for sure, one estimate put the number of hosts on it at $7$ million in January $1996$. Using these data the expected number of internet hosts in January $2008$ is _____ billion.

The internet host is roughly doubling in size every $18$ $months$. Although no one really knows for sure, one estimate put the number of hosts on it at $7$ million in Jan...

860 views

answered Jan 19, 2017

2 votes

26

Test by Bikram | Mock GATE | Test 1 | Question: 5
Which of the following statements is $FALSE$ regarding a bridge: Bridge is a layer $2$ device Bridge reduces collision domain Bridge is used to connect two or more $LAN$ segments Bridge reduces broadcast domain

Which of the following statements is $FALSE$ regarding a bridge:Bridge is a layer $2$ deviceBridge reduces collision domainBridge is used to connect two or more $LAN$ seg...

873 views

answered Jan 19, 2017

10 votes

27

Test by Bikram | Mock GATE | Test 1 | Question: 3
Consider the Hasse diagram $D_1$ and $D_2$ as follows: $D_1:$ The Hasse diagram for the partial ordering $\left \{ \langle a, b \rangle \mid a \mod \: b=0 \right \}$ on the set of positive divisors of $24 \}$ $D_2:$ The Hasse diagram for ... $D_1$ and $D_2$ is/are a total ordering? Only $D_1$ Only $D_2$ Both $D_1$ & $D_2$ None $D_1$ & $D_2$

Consider the Hasse diagram $D_1$ and $D_2$ as follows:$D_1:$ The Hasse diagram for the partial ordering $\left \{ \langle a, b \rangle \mid a \mod \: b=0 \right \}$ on th...

694 views

answered Jan 19, 2017

0 votes

28

Which is maximum Planar graph whose Line Graph is Planar?(Check the answer)

282 views

answered Jan 14, 2017

4 votes

29

How many maximum cycles possible in any Complete graph? (Unlabelled nodes)

1.8k views

answered Jan 14, 2017

10 votes

30

GATE CSE 2009 | Question: 41
The above DFA accepts the set of all strings over $\{0,1\}$ that begin either with $0$ or $1$. end with $0$. end with $00$. contain the substring $00$.

The above DFA accepts the set of all strings over $\{0,1\}$ that begin either with $0$ or $1$.end with $0$.end with $00$.contain the substring $00$.

21.1k views

answered Jan 13, 2017

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