Register
Filter

Answers by smsubham

0 votes
121
ISRO2020-53
The persist timer is used in TCP to To detect crashes from the other end of the connection To enable retransmission To avoid deadlock condition To timeout $\textsf{FIN_Wait1}$ condition
The persist timer is used in TCP toTo detect crashes from the other end of the connectionTo enable retransmissionTo avoid deadlock conditionTo timeout $\textsf{FIN_Wait1}...
0 votes
122
ISRO2020-37
Context free languages are closed under union, intersection union, kleene closure intersection, complement complement, kleene closure
Context free languages are closed underunion, intersectionunion, kleene closureintersection, complementcomplement, kleene closure
0 votes
124
ISRO2020-61
What is the output of the code given below? # include<stdio.h> int main() { char name[]="satellites"; int len; int size; len= strlen(name); size = sizeof(name); printf("%d",len*size); return 0; } $100$ $110$ $40$ $44$
What is the output of the code given below?# include<stdio.h int main() { char name[]="satellites"; int len; int size; len= strlen(name); size = sizeof(name); printf("%d"...
0 votes
125
Worst Case Time Complexity
What is the worst case time complexity to find kth smallest element into an array of ‘n’ element?
What is the worst case time complexity to find kth smallest element into an array of ‘n’ element?
0 votes
128
mock test
0 votes
129
mock test
what is the meaning of static single assignment how to solve
what is the meaning of static single assignment how to solve
0 votes
131
Gate_2018
How to solve it ..find MST with detailed solution
How to solve it ..find MST with detailed solution
0 votes
133
Uttrakhand Asst. Professor Exam-64
Which of the following problem cannot be solved without recursion? Tower of Hanoi Fibonacci series Tree Traversal None of the above
Which of the following problem cannot be solved without recursion?Tower of HanoiFibonacci seriesTree TraversalNone of the above
0 votes
134
self doubt
given an array which contains the preorder traversal of full $k-ary$ tree. Give an algorithm for constructing the full $k-ary$ tree
given an array which contains the preorder traversal of full $k-ary$ tree. Give an algorithm for constructing the full $k-ary$ tree
0 votes
135
Toc me test me me
Minimum ba how can accept?
Minimum ba how can accept?
0 votes
136
Synchronisation os ace
How 4th statement is true???
How 4th statement is true???
0 votes
142
Cormen Edition 3 Exercise 10.1 Question 6 (Page No. 236)
Show how to implement a queue using two stacks. Analyze the running time of the queue operations.
Show how to implement a queue using two stacks. Analyze the running time of the queue operations.
1 votes
143
Cormen Edition 3 Exercise 10.1 Question 7 (Page No. 236)
Show how to implement a stack using two queues. Analyze the running time of the stack operations.
Show how to implement a stack using two queues. Analyze the running time of the stack operations.
0 votes
144
Cormen Edition 3 Exercise 10.2 Question 2 (Page No. 240)
Implement a stack using a singly linked list $L$. The operations $PUSH$ and $POP$ should still take $O(1)$ time.
Implement a stack using a singly linked list $L$. The operations $PUSH$ and $POP$ should still take $O(1)$ time.
0 votes
145
Cormen Edition 3 Exercise 10.2 Question 3 (Page No. 240)
Implement a queue by a singly linked list $L$. The operations of $ENQUEUE$ and $DEQUEUE$ should still take $O(1)$ time.
Implement a queue by a singly linked list $L$. The operations of $ENQUEUE$ and $DEQUEUE$ should still take $O(1)$ time.
0 votes
146
Cormen Edition 3 Exercise 10.2 Question 7 (Page No. 241)
Give a $\Theta(n)$ time nonrecursive procedure that reverses a singly linked list of $n$ elements. The procedure should use no more than constant storage beyond that needed for the list itself.
Give a $\Theta(n)$ time nonrecursive procedure that reverses a singly linked list of $n$ elements. The procedure should use no more than constant storage beyond that need...
0 votes
148
Ace book-FILESYSTEM
The UNIX I-node contains 8-direct disk block addresses, a single indirect and a double indirect entry for a disk block of size 2KB and 16 bit disk block addresses, the maximum file size supported will be: a) 2.0 G b)2.01 M c)2.018 M d) 2.018 G
The UNIX I-node contains 8-direct disk block addresses, a single indirect and a double indirect entry for a disk block of size 2KB and 16 bit disk block addresses, the ma...
0 votes
149
Open file table
When a process opens a file that is already being read by another process, the file descriptors in both process will point to the same open file table entry.[True / False]. (open file table ?)
When a process opens a file that is already being read by another process, the file descriptors in both process will point to the same open file table entry.[True / False...
0 votes
150
Gateforum mock 2
Page: