Recent activity by nag.swarna / GATE Overflow for GATE CSE

2 answers

1

GATE CSE 2018 | Question: 53
Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, , 199$), and $256$ sectors per track (numbered as $0, 1, 255$). The following $6$ disk ... negligible. The total power consumption in milliwatts to satisfy all of the above disk requests using the Shortest Seek Time First disk scheduling algorithm is _____

Consider a storage disk with $4$ platters (numbered as $0, 1, 2$ and $3$), $200$ cylinders (numbered as $0, 1, … , 199$), and $256$ sectors per track (numbered as $0, 1...

15.8k views

commented Jan 6, 2019

0 answers

2

gateforum
Given answer is 22 but im getting 14 ...anyone please explain ..

Given answer is 22 but im getting 14 ...anyone please explain ..

279 views

commented Dec 19, 2018

0 answers

3

Gateforum Test Series: Databases - Indexing
Can anyone explain this in detail???

Can anyone explain this in detail???

364 views

asked Dec 9, 2018

0 answers

4

SELF DOUBT
IS EQUALITY PROBLEM ON DCFL IS DECIDABLE ???

IS EQUALITY PROBLEM ON DCFL IS DECIDABLE ???

181 views

asked Nov 23, 2018

0 answers

5

doubt
Consider the following languages. LA = { <M> | M is a Turing machine that accepts string 101 } LB = { <M> | M is a Turing machine that accepts no string } Select the correct option. 1. LA is recursively enumerable and LB is not recursively ... not recursive. 3. Both LA and LB is not recursively enumerable. 4. LA is recursive and LB is recursively enumerable but not recursive.

Consider the following languages.LA = { <M | M is a Turing machine that accepts string “101” }LB = { <M | M is a Turing machine that accepts no string }Select the cor...

298 views

asked Nov 22, 2018

0 answers

6

Gateforum Test Series: Theory of Computation - Turing Machine
anyone please explain this in detail

anyone please explain this in detail

374 views

commented Nov 22, 2018

0 answers

7

Gateforum Test Series: Theory of Computation - Turing Machine
Im not getting the intution behind this can any one explain

Im not getting the intution behind this can any one explain

253 views

asked Nov 22, 2018

0 answers

8

Gateforum Test Series: Digital Logic - Multiplexer
Can anyone explain briefly i was unable to understand

Can anyone explain briefly i was unable to understand

418 views

commented Nov 16, 2018

0 answers

9

digital

431 views

commented Nov 16, 2018

1 answer

10

digital

270 views

asked Nov 16, 2018

0 answers

11

digital

318 views

asked Nov 16, 2018

0 answers

12

digital
Given answer is T flipflop .Please provide the solution if you are getting correct answer

Given answer is T flipflop .Please provide the solution if you are getting correct answer

213 views

asked Nov 16, 2018

0 answers

13

DATA STRUCTURES
WHY?? CAN ANYONE EXPLAIN

WHY?? CAN ANYONE EXPLAIN

624 views

asked Nov 11, 2018

1 answer

14

DATA STRUCTURES
Can anyone explain answer is A

Can anyone explain answer is A

1.1k views

commented Nov 9, 2018

0 answers

15

Testseries
Correct answer is A

Correct answer is A

692 views

commented Nov 6, 2018

1 answer

16

Gate Forum

670 views

commented Nov 6, 2018

0 answers

17

Test Series
Can anyone please explain

Can anyone please explain

402 views

commented Nov 6, 2018

0 answers

18

ACE TEST SERIES

244 views

asked Nov 5, 2018

2 answers

19

MadeEasy Test Series: Algorithms - Dynamic Programming
Consider two strings A = “abbaccda” and B = “abcaa” consider "x"be length of the longest common subsequence between A and B and “y” be the number of distinct such longest common subsequences between A and B. Then 10x+ 2y is ________.

Consider two strings A = “abbaccda” and B = “abcaa” consider "x"be length of the longest common subsequence between A and B and “y” be the number of distinct ...

2.0k views

commented Nov 5, 2018

9 answers

20

AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.

The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...

9.0k views

commented Nov 5, 2018

1 answer

21

GateForum
Can anyone please explain

Can anyone please explain

578 views

commented Nov 4, 2018

2 answers

22

self doubt
what is the difference between *(ptr)++ and ptr++ where char *ptr="gateoverflow"

what is the difference between*(ptr)++ and ptr++ where char *ptr="gateoverflow"

638 views

answer selected Sep 2, 2018

1 answer

23

gate forum

564 views

asked Sep 2, 2018

0 answers

24

Gate forum test series

350 views

asked Aug 23, 2018

1 answer

25

UGC NET CSE | December 2014 | Part 2 | Question: 14
When an array is passed as parameter to a function, which of the following statements is correct ? The function can change values in the original array. In $C$, parameters are passed by value, the function cannot change the original ... elements in the array. Results in a run time error when the function tries to access the elements in the array.

When an array is passed as parameter to a function, which of the following statements is correct ?The function can change values in the original array. In $C$, parameters...

1.6k views

commented Aug 18, 2018

2 answers

26

Array
Q. Assume the following C variable declaration int * M[10], N[10][10]; of the following expressions. 1. M [2][4] 2. N [2] 3. M [3] 4. N [2][4] Which will not give compile time errors if used as left-hand sides of assignment statements in a C program? (a) 2 and 4 only (b) 2, 3 and 4 only (c) 4 only (d) 1, 3 and 4 only

Q. Assume the following C variable declarationint * M[10], N[10][10];of the following expressions.1. M [4]2. N 3. M [3]4. N [4]Which will not give compile time errors ...

931 views

commented Aug 18, 2018

1 answer

27

array

1.0k views

answered Aug 18, 2018

1 answer

28

Programming
int main() { int array[] = {3, 5, 1, 4, 6, 2}; int done = 0; int i; while (done == 0) { done = 1; for (i = 0; i <= 4; i++) { if (array[i] = 1; i--) { if (array[i] > array[i-1]) { swap(&array[i], &array[i-1]); done = 0; } } } printf("%d", array[3]); } What does marked part do?

int main() { int array[] = {3, 5, 1, 4, 6, 2}; int done = 0; int i; while (done == 0) { done = 1; for (i = 0; i <= 4; i++) { if (array[i] = 1; i ) { if (array[i] array[i...

595 views

commented Aug 18, 2018

1 answer

29

what is the answer

1.6k views

commented Aug 18, 2018

0 answers

30

#pipelining

118 views

asked Jun 27, 2018

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