Recent activity by kapilbk1996 / GATE Overflow for GATE CSE

2 answers

1

Floating point
Consider the following bit pattern represents the floating point number in IEEE 754 single precision format: 1 10000111 11100000000000000000000 Which of the following represents the decimal value of above floating number? A) -192 B) -320 C) -384 D) -448

Consider the following bit pattern represents the floating point number in IEEE 754 single precision format: 1 10000111 11100000000000000000000Which of the following repr...

3.5k views

asked Nov 24, 2018

1 answer

2

MadeEasy Full Length Test 2018: Digital Logic - Multiplexer
If A and B are connected to the select lines of the MUX circuit, then the min-terms of the boolean function recognized by the circuit are _____ ?

If A and B are connected to the select lines of the MUX circuit, then the min-terms of the boolean function recognized by the circuit are _____ ?

1.3k views

commented Nov 1, 2018

1 answer

3

MadeEasy Test Series: Digital Logic - Prime Implicants
Total number of essential prime implicants in the given K-map (x represents don't care) are ___ ?

Total number of essential prime implicants in the given K-map (x represents don't care) are ___ ?

2.0k views

commented Oct 31, 2018

1 answer

4

GATE CSE 1989 | Question: 8b
Indicate the result of the following program if the language uses (i) static scope rules and (ii) dynamic scope rules. var x, y:integer; procedure A (var z:integer); var x:integer; begin x:=1; B; z:= x end; procedure B; begin x:=x+1 end; begin x:=5; A(y); write (y) ...end.

Indicate the result of the following program if the language uses (i) static scope rules and (ii) dynamic scope rules.var x, y:integer; procedure A (var z:integer); var x...

1.6k views

answered Sep 25, 2018

1 answer

5

concurrent , nonserial ,serial
1)concurrent schedules= nonserial+serial 2)concurrent = nonserial schedules. which is correct terminology ?

1)concurrent schedules= nonserial+serial2)concurrent = nonserial schedules.which is correct terminology ?

255 views

answered Aug 26, 2018

2 answers

6

Linked allocation of files on a disk space can lead to internal fragmentation
"Linked allocation of files on a disk space can lead to internal fragmentation" Is this statement true or false? Justify your answer.

"Linked allocation of files on a disk space can lead to internal fragmentation"Is this statement true or false? Justify your answer.

2.5k views

answer selected Aug 26, 2018

1 answer

7

B-tree Insertion
An order 3 B-tree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted into the tree 1,2,3,4,5,6,7,8,9,10. (not necessarily in the given order.) What would be the minimum number of node splits possible, if node splitting algorithm is used?

An order 3 B-tree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted in...

989 views

commented Aug 19, 2018

1 answer

8

GateBook Mock Test_2(B-tree)
A B-tree of order m is a tree which satisfies the following properties: Every node has at most m children. Every node (except root) has at least ⌈m/2⌉ children maximium no of internal nodes an order 4 B tree can have with 20 keys.

A B-tree of order m is a tree which satisfies the following properties:Every node has at most m children.Every node (except root) has at least ⌈m/2⌉ children maximi...

925 views

answered Aug 19, 2018

1 answer

9

B-tree
please check this

please check this

415 views

answered Aug 19, 2018

1 answer

10

data base 1

292 views

answered Aug 19, 2018

2 answers

11

#dbms relational algebra
Consider the following relations A, B and C: A Id Name Age 12 Arun 60 15 Shreya 24 99 Rohit 11 B Id Name Age 15 Shreya 24 25 Hari 40 98 Rohit 20 99 Rohit 11 C Id Phone Area 10 2200 02 99 2100 01 How many tuples does the result of the following relational algebra expression contain? Assume that the schema of A∪B is the same as that of A. (A∪B)⋈A.Id>40∧C.Id<15C

Consider the following relations A, B and C: AIdNameAge12Arun6015Shreya2499Rohit11 BIdNameAge15Shreya2425Hari4098Rohit2099Rohit11CIdPhoneArea1022000299210001How many tupl...

826 views

answered Aug 13, 2018

0 answers

12

Linked_list
Insertion at beginning and end ....both require theta(n) ?

Insertion at beginning and end ....both require theta(n) ?

314 views

commented Jul 30, 2018

2 answers

13

which statement is true about doubly linked list?

9.1k views

commented Jul 28, 2018

1 answer

14

Made Easy: Memory allocation
Consider 900 KB memory is managed using variable partitions but no compaction. It currently has three process occupied partition of sizes 212 KB, 114 KB and 100 KB respectively. What is the smallest allocation request that could be denied?

Consider 900 KB memory is managed using variable partitions but no compaction. It currently has three process occupied partition of sizes 212 KB, 114 KB and 100 KB respec...

2.7k views

asked Jul 28, 2018

2 answers

15

Self doubt
What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?

What are the minimum number of pointers required to implement a stack using single ended queue ( the queue is NOT a dequeue )?

1.1k views

asked Jul 26, 2018

3 answers

16

Ace Test Series: Graph Theory - Number Of Spanning Trees
How to approach such questions ? Please provide detailed solution. Answer given is option C

How to approach such questions ? Please provide detailed solution. Answer given is option C

4.4k views

asked Feb 2, 2018

2 answers

17

MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.

Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.

768 views

asked Jan 11, 2018

0 answers

18

Hashing
I am getting 5. Please provide a detailed solution.

I am getting 5. Please provide a detailed solution.

360 views

commented Jan 4, 2018

2 answers

19

synchronization
the following five concurrent processes operating on counting semaphore variable (s) which is initialized to 0 P1: wait (s); cs; signal (s); P2: wait (s); cs; signal (s); P3: wait (s); cs; signal (s); P4: signal s); cs; wait (s); P5: signal (s); cs; wait (s); what is the maximum possible value of s? A) 1 B) 2 C) 3 D) 0

the following five concurrent processes operating on counting semaphore variable (s) which is initialized to 0P1: wait (s); cs; signal (s);P2: wait (s); cs; signal (s);P3...

1.6k views

commented Oct 29, 2017

1 answer

20

hexadecimal subtraction
Given that $(E0B)_{16}-(ABF)_{16}=Y$. The radix 8’s compliment of Y is ?

Given that $(E0B)_{16}-(ABF)_{16}=Y$.The radix 8’s compliment of Y is ?

2.7k views

commented Oct 27, 2017

2 answers

21

GATE CSE 2002 | Question: 2.2
Consider the following multiplexer where $I0, I1, I2, I3$ are four data input lines selected by two address line combinations $A1A0=00,01,10,11$ respectively and $f$ is the output of the multiplexor. EN is the Enable input. The function $f(x,y,z)$ implemented by the above circuit is $xyz'$ $xy + z$ $x + y$ None of the above

Consider the following multiplexer where $I0, I1, I2, I3$ are four data input lines selected by two address line combinations $A1A0=00,01,10,11$ respectively and $f$ is t...

13.4k views

commented Oct 26, 2017

1 answer

22

ISI2013-PCB-CS-2b
Let $C$ denote a logic block that is capable of comparing two $4$ - bit $2$'s complement numbers $A\:(a_3, a_2, a_1, a_0)$ and $B\: (b_3, b_2, b_1, b_0)$, where $a_i, b_i \in \{0, 1\}$ for $i = 0, 1, 2, 3$. The circuit $C$ ... then the outputs should be $E = 0,\: L = 0$, and $G = 1$. Write the Boolean equations for the three outputs $E, \: L$, and $G$.

Let $C$ denote a logic block that is capable of comparing two $4$ – bit $2$’s complement numbers $A\:(a_3, a_2, a_1, a_0)$ and $B\: (b_3, b_2, b_1, b_0)$, where $a_i,...

591 views

answered Oct 24, 2017

3 answers

23

TIFR CSE 2015 | Part B | Question: 14
Consider the following concurrent program (where statements separated by | | with-in cobegin-coend are executed concurrently). x:=1 cobegin x:= x + 1 || x:= x + 1 || x:= x + 1 coend Reading and writing of variables is atomic but evaluation of expressions is not atomic. The ... $\left \{2, 4 \right \}$ $\left \{ 2, 3 \right \}$ $\left \{2 \right \}$

Consider the following concurrent program (where statements separated by | | with-in cobegin-coend are executed concurrently).x:=1 cobegin x:= x + 1 || x:= x + 1 || x:=...

2.2k views

commented Oct 21, 2017

3 answers

24

peterson solution
is bounded waiting satisfy or not?what if turn =other?

is bounded waiting satisfy or not?what if turn =other?

1.3k views

answered Oct 18, 2017

1 answer

25

NPTEL
Consider the following statements: i) if(count==0) ii) add %eax,%ebx 1. i is atomic, ii is non-atomic 2. i is non-atomic, ii is non-atomic 3. i is non-atomic, ii is atomic 4. Both are atomic

Consider the following statements:i) if(count==0)ii) add %eax,%ebx1. i is atomic, ii is non-atomic2. i is non-atomic, ii is non-atomic3. i is non-atomic, ii is atomic4...

1.0k views

answered Oct 18, 2017

6 answers

26

SSTF Disk Scheduling
My answer is 202 given 232

My answer is 202given 232

2.0k views

answered Oct 18, 2017

2 answers

27

I am reading Galvin O.S. and came across the given below line. please tell me where am I wrong?
I am reading Galvin O.S. and came across this line 2. When a process switches from the running state to the ready state (for example, when an interrupt occurs), scheduling is not needed I but If a ... moved to ready queue scheduling is definitely needed. Where am I wrong? O.S. Galvin Edition 9th Page 264

I am reading Galvin O.S. and came across this line 2. When a process switches from the running state to the ready state (for example, when an interrupt occurs), schedulin...

613 views

commented Oct 13, 2017

2 answers

28

MadeEasy Subject Test: Compiler Design - Parsing
Consider the following grammar G: The number of states in SLR parser for G is _______. My question is since this grammar can't generate any string the number of states should be zero right as we will remove useless symbols before constructing canonical collection of LR(0) items

Consider the following grammar G: The number of states in SLR parser for G is _______.My question is since this gram...

978 views

commented Sep 30, 2017

2 answers

29

theory of computation

401 views

commented Sep 9, 2017

0 answers

30

theory of computation
Construct minimal DFA for the language,L = ( L1 union L2 ) where L1 = L (aaa*b) and L2 = L (aab*aba*). The number of states in the minimal DFA, L is _____. Is this correct ??? or is there anyother minimal DFA witb lesser number of states ???

Construct minimal DFA for the language,L = ( L1 union L2 ) where L1 = L (aaa*b) and L2 = L (aab*aba*). The number of states in the minimal DFA, L is _____.Is this correct...

504 views

commented Sep 8, 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