Recent activity by UK / GATE Overflow for GATE CSE

1 answer

1

C Programming doubt
What is the difference between struct node* head= NULL and struct node* head= (struct node*)NULL ?

What is the difference between struct node* head= NULL and struct node* head= (struct node*)NULL ?

697 views

commented Mar 30, 2016

3 answers

2

C pointer doubt
What is the difference when I write in program mynode * head; add_node(&head,10); add_node( struct node ** head, into value); To this mynode *head; add_node (head,10); add_node( struct node* head, into value) Which is the correct way of writing?

What is the difference when I write in program mynode * head; add_node(&head,10); add_node( struct node head, into value);To this mynode *head; add_node (head,10); add_...

710 views

commented Mar 16, 2016

6 answers

3

GATE CSE 2016 Set 2 | Question: 15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$

$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is...

34.3k views

commented Mar 14, 2016

4 answers

4

GATE CSE 2016 Set 2 | Question: 03
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.

The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.

15.5k views

commented Mar 6, 2016

1 answer

5

In how many ways can 5 chocolates be chosen from an unlimited number of Cadbury,Five-star, and Perk chocolates?

we have to choose five chocolates,say, C1, C2, C3, C4 and C5. Now for C1 we can choose among three kinds of chocolates. Since the supply of chocolates is infinite, for C2...

4.6k views

commented Feb 26, 2016

3 answers

6

IITD2011Interview
#IITD_2011 which is better merge sort or heap. sort ?

#IITD_2011 which is better merge sort or heap. sort ?

543 views

answered Feb 24, 2016

2 answers

7

permutations
The number of ways in which 6 rings can be worn on the four fingers of one hand is: a. 360 b. 4^6 c. 6C4 d. 6^4

The number of ways in which 6 rings can be worn on the four fingers of one hand is:a. 360b. 4^6c. 6C4d. 6^4

1.2k views

commented Feb 18, 2016

2 answers

8

GATE2013 CE: GA-3
Which of the following options is the closest in meaning to the word given below: Primeval Modern Historic Primitive Antique

Which of the following options is the closest in meaning to the word given below: PrimevalModernHistoricPrimitiveAntique

3.2k views

answered Feb 17, 2016

0 answers

9

GCD
Let (x′, y′) correspond to gcd(b, a mod b), i.e. gcd(b, a mod b) = x′ ·b + y′ · (a mod b). Then show that gcd(a, b) = y′ · a + (x′ − q)b where q is the quotient of the integer division of a by b. Can anyone help me with this?

Let (x′, y′) correspond to gcd(b, a mod b), i.e. gcd(b, a mod b) = x′ ·b + y′ · (a mod b). Then show that gcd(a, b) = y′ &midd...

476 views

asked Feb 17, 2016

3 answers

10

GATE CSE 2016 Set 2 | Question: GA-02
Nobody knows how the Indian cricket team is going to cope with the difficult and seamer-friendly wickets in Australia. Choose the option which is closest in meaning to the underlined phrase in the above sentence. Put up with. Put in with. Put down to. Put up against.

Nobody knows how the Indian cricket team is going to cope with the difficult and seamer-friendly wickets in Australia.Choose the option which is closest in meaning to the...

4.4k views

answered Feb 14, 2016

2 answers

11

GATE CSE 2016 Set 2 | Question: GA-03
Find the odd one in the following group of words. mock, deride, praise, jeer Mock Deride Praise Jeer

Find the odd one in the following group of words.mock, deride, praise, jeerMockDeridePraiseJeer

3.0k views

answered Feb 12, 2016

1 answer

12

Ace Test Series: Algorithms - Asymptotic Notations
Consider the following functions: $f(n)=3n^{\sqrt(n) }$ $g(n) =2^{\sqrt(n)}\log_2 n$ $h(n)=n!$ Which of the following option is true? (A) $f(n)$ is $O(g(n))$ (B) $h(n)$ is $O(g(n))$ (C) $g(n)$ is not $O(f(n))$ (D) $h(n)=O(f(n))$

Consider the following functions: $f(n)=3n^{\sqrt(n) }$ $g(n) =2^{\sqrt(n)}\log_2 n$ $h(n)=n!$Which of the following option is true?(A) $f(n)$ is $O(g(n...

713 views

commented Feb 3, 2016

0 answers

13

Probability
A process spends $20%$ of its execution time waiting for completion of I/O operation. If there are $4$ processes in memory at once, then the probability of CPU time wasted is ____ (Assume all I/O operations are overlapped, upto $3$ decimal places).

A process spends $20%$ of its execution time waiting for completion of I/O operation. If there are $4$ processes in memory at once, then the probability of CPU time waste...

324 views

commented Jan 31, 2016

0 answers

14

virtual gate 2016 Disk size
A disk has 16 equidistant tracks. The diameters of the outermost and innermost tracks are 16 cm and 1 cm respectively. The innermost track has got the capacity of 20 MB. The total amount of data which can be stored on the disk if the ... MB (integer value only). {capacity of each track is equal or outermost track has capacity greater than innermost track?? }

A disk has 16 equidistant tracks. The diameters of the outermost and innermost tracks are 16 cm and 1 cm respectively. The innermost track has got the capacity of 20 MB. ...

474 views

commented Jan 30, 2016

1 answer

15

Question on finding number of cycles to execute instructions
Q).We have two dsigns $D1$ and $D2$ for a synchronous pipeline processor, $D1$ has $5$ pipeline stages with execution times of $3 \text{nsec}$ $2\text{nsec}$ ,$4 \text{nsec}$ ,$2 \text{nsec}$ ... for executing $100$ instructions ? 196 nsec (integer value only) .The correct answer is 202 Please check how the answer would be 202.

Q).We have two dsigns $D1$ and $D2$ for a synchronous pipeline processor, $D1$ has $5$ pipeline stages with execution times of $3 \text{nsec}$ $2\text{nsec}$ ,$4 \text{n...

547 views

answered Jan 30, 2016

1 answer

16

MadeEasy Test Series: Programming & DS - Binary Search Trees
Q). Find the number of trees that are possible .If we construct a binary search tree by successively inserting $5$ distinct items int an initially empty tree. a). $4$ b). $10$ c). $14$ d). $20$ I used the formula 2n!/(n+1)!*n!. Is it right ? also the ans given is 14,but I am getting 7.

Q). Find the number of trees that are possible .If we construct a binary search tree by successively inserting $5$ distinct items int an initially empty tree.a). $4$b). $...

732 views

commented Jan 30, 2016

1 answer

17

MadeEasy Test Series: Combinatory - Permutations And Combinations
Number of solutions are there of x+y+z=17 in positive integers are_________ Here in this do we have to take constraints of x>=1,y>=1,z>=1?

Number of solutions are there of x+y+z=17 in positive integers are_________Here in this do we have to take constraints of x>=1,y>=1,z>=1?

944 views

commented Jan 28, 2016

1 answer

18

Permutation n combination
what is the correct solution to this question??

what is the correct solution to this question??

363 views

commented Jan 27, 2016

1 answer

19

digital logic
How is the correct ans c?

How is the correct ans c?

404 views

commented Jan 27, 2016

4 answers

20

GATE CSE 2008 | Question: 62
The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers $1, 2, 3, 4, 5, 6, 7$ in the given order. What will be the contents of the list after function completes execution? struct ... $1, 3, 2, 5, 4, 7, 6$ $2, 3, 4, 5, 6, 7, 1$

The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing th...

19.2k views

commented Jan 23, 2016

1 answer

21

Probability of Successful transmission
Q If probability of frame reaching safely is 0.1 then mean number of transmissions of a frame to make it success is _____. How to solve this question?

Q If probability of frame reaching safely is 0.1 then mean number of transmissions of a frame to make it success is _____.How to solve this question?

1.9k views

commented Jan 23, 2016

6 answers

22

GATE CSE 2009 | Question: 40
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.

Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below:$L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$$L_2=\left \{ a^i b^j c^k \mid i,j,k...

13.1k views

commented Jan 22, 2016

2 answers

23

Digital Logic
A digital circuit shown below has two $3$-bit input $A_2A_1A_0$ and $B_2B_1B_0$. To obtain output $Y=1$, the number of possible cases are ______.

A digital circuit shown below has two $3$-bit input $A_2A_1A_0$ and $B_2B_1B_0$.To obtain output $Y=1$, the number of possible cases are ______.

825 views

commented Jan 21, 2016

8 answers

24

GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$

Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...

25.6k views

commented Jan 12, 2016

4 answers

25

GATE CSE 2014 Set 2 | Question: 32
Three processes $A$, $B$ and $C$ each execute a loop of $100$ iterations. In each iteration of the loop, a process performs a single computation that requires $t_c$ CPU milliseconds and then initiates a single I/O operation that lasts ... slice of $50$ milliseconds. The time in milliseconds at which process C would complete its first I/O operation is ___________.

Three processes $A$, $B$ and $C$ each execute a loop of $100$ iterations. In each iteration of the loop, a process performs a single computation that requires $t_c$ CPU m...

12.3k views

commented Jan 11, 2016

3 answers

26

The boolean expression f(x,y,z) in its canonical form for the decoder circuit shown below is
Note : the bubbles are NOT gates

Note : the bubbles are NOT gates

3.4k views

answered Jan 11, 2016

5 answers

27

GATE CSE 2014 Set 2 | Question: 45
The value of a $\text{float}$ type variable is represented using the single-precision $\text{32-bit}$ floating point format of $\text{IEEE-754}$ standard that uses $1$ $\text{bit}$ for sign, $\text{8 bits}$ for biased exponent and ... . The representation of $X$ in hexadecimal notation is $\text{C1640000H}$ $\text{416C0000H}$ $\text{41640000H}$ $\text{C16C0000H}$

The value of a $\text{float}$ type variable is represented using the single-precision $\text{32-bit}$ floating point format of $\text{IEEE-754}$ standard that uses $1$ $\...

11.2k views

commented Jan 10, 2016

1 answer

28

MadeEasy Test Series: Operating System - Memory Management
The available main memory for loading processes is 128 MB which is divided into fixed number of partitions each of size 16 MB. If the processes of size 12 MB, and 6 MB are loaded into memory. The percentage of the internal fragmentation is ____________ (upto two decimal places)

The available main memory for loading processes is 128 MB which is divided into fixed number of partitions each of size 16 MB. If the processes of size 12 MB, and 6 MB ar...

2.3k views

commented Jan 9, 2016

2 answers

29

Symbol table Access time
Which of the following symbol table implementations is best suited if access time is to minimum? (a) Linear list (b) Search table (c) Hash table (d) Self-organization list

Which of the following symbol table implementations is best suited if access time is to minimum?(a) Linear list(b) Search table(c) Hash table(d) Self-organization list

14.7k views

commented Jan 9, 2016

2 answers

30

If an ethernet destination address is

1.8k views

answered Jan 9, 2016

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