Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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}...
3.1k
views
answered
Mar 20, 2020
Computer Networks
isro-2020
computer-networks
tcp
normal
+
–
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
2.7k
views
answered
Mar 20, 2020
Theory of Computation
isro-2020
theory-of-computation
context-free-language
easy
+
–
0
votes
123
ISRO2020-26
The operating system and the other processes are protected from being modified by an already running process because they run at different time instants and not in parallel they are in different logical addresses they use a protection algorithm in the scheduler every address generated by the CPU is being checked against the relocation and limit parameters
The operating system and the other processes are protected from being modified by an already running process becausethey run at different time instants and not in paralle...
4.7k
views
answered
Mar 20, 2020
Operating System
isro-2020
operating-system
process-synchronization
easy
+
–
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"...
3.8k
views
answered
Mar 20, 2020
Programming in C
isro-2020
programming
array
normal
+
–
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?
1.8k
views
answered
Mar 19, 2020
DS
algorithms
time-complexity
data-structures
sorting
+
–
0
votes
126
DFS- depth first search
733
views
answered
Mar 19, 2020
DS
data-structures
depth-first-search
graph-algorithms
graph-connectivity
+
–
0
votes
127
AVL Tree
Suppose we have an AVL tree of n nodes and any change in the tree violates the AVL tree property then :- S1: If we insert an element in the tree, maximum 2 Rotations are required to make the Tree AVL again. S2: If we delete an element from the tree, maximum 2 Rotations are required to make tree AVL again Which are correct statements?
Suppose we have an AVL tree of n nodes and any change in the tree violates the AVL tree property then :-S1: If we insert an element in the tree, maximum 2 Rotations are r...
1.5k
views
answered
Mar 19, 2020
DS
avl-tree
data-structures
tree
+
–
0
votes
128
mock test
299
views
answered
Mar 19, 2020
Programming in C
data-structures
+
–
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
247
views
answered
Mar 19, 2020
Programming in C
data-structures
+
–
0
votes
130
mock test
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Which of the following is correct ? plz explain how second statement is true
Consider the following statements:S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) ...
629
views
answered
Mar 19, 2020
Programming in C
data-structures
+
–
0
votes
131
Gate_2018
How to solve it ..find MST with detailed solution
How to solve it ..find MST with detailed solution
366
views
answered
Mar 19, 2020
Programming in C
data-structures
+
–
0
votes
132
made easy test series
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Which of the following is correct ?
Consider the following statements:S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) ...
3.3k
views
answered
Mar 19, 2020
Programming in C
stack
queue
data-structures
+
–
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
2.3k
views
answered
Mar 19, 2020
Unknown Category
uttarakhand-asst-prof-2018
data-structures
+
–
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
380
views
answered
Mar 19, 2020
DS
data-structures
tree
descriptive
+
–
0
votes
135
Toc me test me me
Minimum ba how can accept?
Minimum ba how can accept?
252
views
answered
Mar 19, 2020
0
votes
136
Synchronisation os ace
How 4th statement is true???
How 4th statement is true???
406
views
answered
Mar 19, 2020
0
votes
137
GATE CSE 2020 | Question: 10
Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements. $L$ is deterministic context-free. $L$ is context-free but not deterministic context-free. $L$ is not $LL(k)$ for any $k$. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Ⅰ and Ⅲ only Ⅲ only
Consider the language $L = \{a^{n}\mid n \geq 0\} \cup \{a^{n}b^{n}\mid n \geq 0\}$ and the following statements.$L$ is deterministic context-free.$L$ is context-free but...
20.1k
views
answered
Mar 19, 2020
Theory of Computation
gatecse-2020
theory-of-computation
identify-class-language
1-mark
+
–
25
votes
138
GATE CSE 2020 | Question: 9
Consider the following statements. Symbol table is accessed only during lexical analysis and syntax analysis. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment. Errors violating the condition any ... the above statements is/are TRUE? I only I and III only Ⅱ only None of Ⅰ, Ⅱ and Ⅲ
Consider the following statements.Symbol table is accessed only during lexical analysis and syntax analysis.Compilers for programming languages that support recursion nec...
14.5k
views
answered
Mar 19, 2020
Compiler Design
gatecse-2020
compiler-design
compilation-phases
runtime-environment
1-mark
+
–
2
votes
139
GATE CSE 2020 | Question: 8
Consider the following statements. If $L_1 \cup L_2$ is regular, then both $L_1$ and $L_2$ must be regular. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Both Ⅰ and Ⅱ Neither Ⅰ nor Ⅱ
Consider the following statements.If $L_1 \cup L_2$ is regular, then both $L_1$ and $L_2$ must be regular.The class of regular languages is closed under infinite union....
13.5k
views
answered
Mar 19, 2020
Theory of Computation
gatecse-2020
theory-of-computation
regular-language
1-mark
+
–
0
votes
140
MY DOUBT: Worst case space complexity of Quick sort (NOT FOR A STRAIGHT ANSWER)
First read it properly. I am not asking a specific question about space complexity. Question: What is worst case space complexity of quick sort? Everywhere it is showing O(logn). My understanding about it: I know that Quick ... by ratio 1:n-1 which is worst case, wouldn't it be requesting for O(n) stack records?
First read it properly. I am not asking a specific question about space complexity.Question: What is worst case space complexity of quick sort?Everywhere it is showing O(...
2.4k
views
answered
Mar 19, 2020
DS
algorithms
sorting
data-structures
space-complexity
+
–
1
votes
141
Cormen Edition 3 Exercise 10.1 Question 2 (Page No. 235)
Explain how to implement two stacks in one array $A[1...n]$ in such a way that neither stack overflows unless the total number of elements in both stacks together is $n$.The $PUSH$ and $POP$ operations should run in $O(1)$ time.
Explain how to implement two stacks in one array $A[1...n]$ in such a way that neither stack overflows unless the total number of elements in both stacks together is $n$....
2.5k
views
answered
Mar 19, 2020
Algorithms
cormen
data-structures
stack
descriptive
+
–
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.
583
views
answered
Mar 19, 2020
Algorithms
cormen
data-structures
queue
descriptive
+
–
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.
1.3k
views
answered
Mar 19, 2020
Algorithms
cormen
data-structures
stack
descriptive
+
–
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.
399
views
answered
Mar 19, 2020
Algorithms
cormen
data-structures
linked-list
descriptive
+
–
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.
401
views
answered
Mar 19, 2020
Algorithms
cormen
data-structures
linked-list
descriptive
+
–
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...
918
views
answered
Mar 19, 2020
Algorithms
cormen
data-structures
linked-list
descriptive
+
–
0
votes
147
File allocation
1) Search time for file in linked allocation is more than in contiguous allocation. 2)Contiguous allocation scheme efficiently implement fixed size file. Plz explain which one true and which one false? (In answer they considered in linked allocation external fragmentation not exist but contiguous allocation it exists)
1) Search time for file in linked allocation is more than in contiguous allocation.2)Contiguous allocation scheme efficiently implement fixed size file. Plz explain which...
2.1k
views
answered
Mar 19, 2020
DS
operating-system
file-system
+
–
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...
453
views
answered
Mar 19, 2020
Operating System
operating-system
file-system
+
–
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...
756
views
answered
Mar 18, 2020
Operating System
operating-system
file-system
+
–
0
votes
150
Gateforum mock 2
382
views
answered
Mar 18, 2020
Operating System
operating-system
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
12
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register