Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
12751
Data structure
Consider an implementation of towers of hanoi where there are 25 discs(numbered from 0 to 24) and three pegs(source, auxiliary, destination). We have to move all 25 discs from source peg to destination peg using auxiliary peg only. What is the number of ... number 0) respectively to complete the task in least possible time ? 16777216 and 1 1 and16777216 16777215 and 1 1 and 16777215
Consider an implementation of towers of hanoi where there are 25 discs(numbered from 0 to 24) and three pegs(source, auxiliary, destination). We have to move all 25 discs...
heena singh
338
views
heena singh
asked
Dec 10, 2017
0
votes
0
answers
12752
tournament
Once the tournament finishes, pick up the logN competitors that were beaten by the tournament winner and hold a mini-tournament to find which one is the best among them. If we imagine that better players correspond with smaller numbers, the algorithm ... in logN−1l steps. This algorithm requires N+logN−2 comparisons to complete How is the competitors beaten by tournament winner log N ?
Once the tournament finishes, pick up the logN competitors that were beaten by the tournament winner and hold a mini-tournament to find which one is the best among them. ...
A_i_$_h
303
views
A_i_$_h
asked
Dec 10, 2017
0
votes
0
answers
12753
slotted aloha
6000 stations are competing for use of single slotted aloha channel. The average station makes 30 requests/hr ,where each request is for 500 us(micro sec) duration. calculate normalized total traffic on channel
6000 stations are competing for use of single slotted aloha channel. The average station makes 30 requests/hr ,where each request is for 500 us(micro sec) duration. calcu...
arch
414
views
arch
asked
Dec 10, 2017
0
votes
0
answers
12754
internet
consider the packet size 1400 B is passed through a network having mtu 620B(including header) header size is 20B.what will be the packet size in last fragment (in Byte) a)1440 b)1444 c)1436 d)1428
consider the packet size 1400 B is passed through a network having mtu 620B(including header) header size is 20B.what will be the packet size in last fragment (in Byte)...
eyeamgj
406
views
eyeamgj
asked
Dec 10, 2017
1
votes
0
answers
12755
Concatenation of two different language
Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈ True or false
Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈True or false
set2018
409
views
set2018
asked
Dec 10, 2017
0
votes
0
answers
12756
#testbook test series
shefali1
157
views
shefali1
asked
Dec 10, 2017
0
votes
0
answers
12757
minimum swaps
Minimum number of swaps required is in insertion or selection sort
Minimum number of swaps required is in insertion or selection sort
A_i_$_h
1.2k
views
A_i_$_h
asked
Dec 10, 2017
0
votes
0
answers
12758
madeeasy work book
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames allocated to the process then what is the minimum and maximum number of page faults possible?
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames ...
aaru14
283
views
aaru14
asked
Dec 10, 2017
Operating System
operating-system
+
–
0
votes
0
answers
12759
Multilevel paging
Can someone please explain the concept of multilevel paging in detail...
Can someone please explain the concept of multilevel paging in detail...
Satyam
254
views
Satyam
asked
Dec 9, 2017
0
votes
0
answers
12760
10 class book mathematics
The set A(0,2,4) then find A union null set explain?
The set A(0,2,4) then find A union null set explain?
Sai vamsi
135
views
Sai vamsi
asked
Dec 9, 2017
0
votes
0
answers
12761
CSMA/CD
What is contention window for CSMA/CD? What is it's difference with persistence method?
What is contention window for CSMA/CD? What is it's difference with persistence method?
srestha
304
views
srestha
asked
Dec 9, 2017
Computer Networks
computer-networks
csma-cd
ethernet
+
–
0
votes
0
answers
12762
Process
Shivam Chauhan
513
views
Shivam Chauhan
asked
Dec 9, 2017
Operating System
operating-system
+
–
0
votes
0
answers
12763
goodput
Suppose that it takes 1 unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size of N packets. Each packet causes an ack or a nak to be generated by the receiver, and ack/nak transmission times ... i) 1 1 - e(i/N) Here ack is sent for each packet or only after entire window size (N packets is sent ) ??
Suppose that it takes 1 unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size o...
A_i_$_h
379
views
A_i_$_h
asked
Dec 9, 2017
0
votes
0
answers
12764
Output
Shivam Chauhan
436
views
Shivam Chauhan
asked
Dec 9, 2017
Programming in C
programming
programming-in-c
+
–
0
votes
0
answers
12765
Effect of rollback on timestamp
If RTS('A') is set to transaction T's timestamp but then T has to rollback. Then what will RTS('A') be a)0 b)remains same c)equals timestamp of a transaction (if any) which had read 'A' before T.
If RTS('A') is set to transaction T's timestamp but then T has to rollback. Then what will RTS('A') bea)0b)remains samec)equals timestamp of a transaction (if any) which ...
pCS
215
views
pCS
asked
Dec 9, 2017
0
votes
0
answers
12766
IP address
Just give brief explaination and any reference link if possible How to find reverse lookup of an IP address(say for 10.128.1.1)?
Just give brief explaination and any reference link if possibleHow to find reverse lookup of an IP address(say for 10.128.1.1)?
srestha
367
views
srestha
asked
Dec 9, 2017
Computer Networks
computer-networks
network-addressing
+
–
0
votes
0
answers
12767
Kenneth Rosen Edition 6th Exercise 6.4 Example 16 (Page No. 437)
Can't understand what they did here. How did they find out the value of xG(x)?Example 444. Chapter: Advanced Counting Techniques
Can't understand what they did here. How did they find out the value of xG(x)?Example 444. Chapter: Advanced Counting Techniques
MrPeppermint
605
views
MrPeppermint
asked
Dec 9, 2017
Mathematical Logic
discrete-mathematics
kenneth-rosen
generating-functions
+
–
0
votes
0
answers
12768
solve : reflexive relation
R = { (x,y) ∈ z X z : x-y is even integer } is this reflexive how to prove and what this set is representing , z= set of integers
R = { (x,y) ∈ z X z : x-y is even integer } is this reflexive how to prove and what this set is representing , z= set of integers
sumit goyal 1
411
views
sumit goyal 1
asked
Dec 9, 2017
7
votes
0
answers
12769
Access link vs Control Link
Access Link : 1) An access link from record A points to the record of the closest enclosing block in the program. 2) The chain of access links traces the static structure (think: scopes) of the program. 3) Refers to non-local data in other ... execution of the program. 3) Refers to non-local data in other activation record. (NOT CLEAR) Can anyone explain this line ?
Access Link :1) An access link from record A points to the record of the closest enclosing block in the program.2) The chain of access links traces the static structure (...
VS
9.7k
views
VS
asked
Dec 9, 2017
Compiler Design
compiler-design
+
–
0
votes
0
answers
12770
Doubt: Andrew S. Tanenbaum 4th ed.
"processes on the Internet are not required to use TCP or UDP. If a user on machine A decides to use some new transport protocol to talk to a user on machine B (for example, for a multimedia application), introduction of a NAT ... because the NAT box will not be able to locate the TCP Source port correctly. " Please explain this. especially last line.
"processes on the Internet are not required to use TCP or UDP. If a user on machine A decides to use some new transport protocol to talk to a user on machine B (for examp...
Diksha Aswal
168
views
Diksha Aswal
asked
Dec 8, 2017
0
votes
0
answers
12771
acetest
pranab ray
358
views
pranab ray
asked
Dec 8, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
12772
context free language
Consider the following languages. The number of the above languages L1, L2, L3 and L4 are context free languages is ______. Answer given is 2 ,L2 and L4.My doubt is why L2 why not L3.I also got 2 .pls someone explain
Consider the following languages.The number of the above languages L1, L2, L3 and L4 are context free languages is ______.Answer given is 2 ,L2 and L4.My doubt is why L2 ...
set2018
618
views
set2018
asked
Dec 8, 2017
1
votes
0
answers
12773
identify the language ?
Let L = {ambnbkdl⎪(n+k = odd) only if m = l; m, n, k, l > 0}. Which of the following is true about L? 1)L is CFL but not DCFL 2)L is regular but not CFL 3)L is DCFL but not regular 4)none of the above
Let L = {ambnbkdl⎪(n+k = odd) only if m = l; m, n, k, l 0}. Which of the following is true about L?1)L is CFL but not DCFL2)L is regular but not CFL3)L is DCFL but not...
set2018
376
views
set2018
asked
Dec 8, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
0
answers
12774
segmentation with paging
For each of the four processes P1, P2, P3 and P4. The total size in kilobytes (KB) and the number of segments are given below. Process Total size (in KB) Number of segments P1 195 4 P2 254 5 P3 45 3 P4 364 8 The page size is 1 KB. The size ... the query as to ......each segment will require page table or not? why only one page table is taken per process and not per segment
For each of the four processes P1, P2, P3 and P4. The total size in kilobytes (KB) and the number of segments are given below.ProcessTotal size (in KB)Number of segmentsP...
A_i_$_h
1.3k
views
A_i_$_h
asked
Dec 8, 2017
Operating System
operating-system
+
–
0
votes
0
answers
12775
Pointer doubt
a and &a are the same thing where a is array name? I am unable to understand diff between (a+1) and (&a+1) when assigned to a pointer #include <stdio.h> int main() { int a[5] = {1,2,3,4,5}; int *ptr = (int*)(&a+1); printf("%d %d", *(a+1), *(ptr-1)); return 0; }
a and &a are the same thing where a is array name? I am unable to understand diff between (a+1) and (&a+1) when assigned to a pointer #include <stdio.h>int main(){ in...
Kiran Karwa
370
views
Kiran Karwa
asked
Dec 8, 2017
0
votes
0
answers
12776
Algorithms:- Test series Complexity
operations on the list in this order insert, O(n log n) decrease key, O(n) find operations. What is the time complexity of all these operations put together? A O(n) B O(n2) C O(n2 log n) D O$(sqrt(n))$
operations on the list in this order insert, O(n log n) decrease key, O(n) find operations. What is the time complexity of all these operations put together?A O(n)B O(n2...
rahul sharma 5
403
views
rahul sharma 5
asked
Dec 8, 2017
Algorithms
algorithms
time-complexity
+
–
0
votes
0
answers
12777
Algorithms: Test Series(Hashing)
Consider an initially empty symbol table implemented using a hash table of size ‘B’ with hash function h(C) = C mod B. In worst case for any possible sequence of inputs where N > B, what is the order of growth of inserting N (key, value) pairs with distinct key into table, if separate chaining is used to resolve collisions? A Ο(N) B Ο (N log N) C Ο(N3) D Ο(N2)
Consider an initially empty symbol table implemented using a hash table of size ‘B’ with hash function h(C) = C mod B. In worst case for any possible sequence of inpu...
rahul sharma 5
924
views
rahul sharma 5
asked
Dec 8, 2017
Algorithms
algorithms
hashing
+
–
0
votes
0
answers
12778
self_doubt theory of computation
....... how can we solve question by this table need help
.......how can we solve question by this table need help
air1ankit
307
views
air1ankit
asked
Dec 8, 2017
Theory of Computation
theory-of-computation
regular-expression
finite-automata
turing-machine
+
–
1
votes
0
answers
12779
Transaction
Abhijeet_Kumar
397
views
Abhijeet_Kumar
asked
Dec 8, 2017
Databases
transaction-and-concurrency
test-series
databases
+
–
4
votes
0
answers
12780
Transaction
Abhijeet_Kumar
419
views
Abhijeet_Kumar
asked
Dec 8, 2017
Databases
transaction-and-concurrency
databases
test-series
conflict-serializable
+
–
Page:
« prev
1
...
421
422
423
424
425
426
427
428
429
430
431
...
594
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register