The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Dhillu Thambi
User Dhillu Thambi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Dhillu Thambi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
made easy tt1
answered
Nov 7, 2018
in
Operating System

48
views
2
answers
2
made easy tt1
answered
Nov 7, 2018
in
Operating System

49
views
0
answers
3
Segmentation and System Call
$1)$No of Pages $\times$ Page size= Virtual Address Space or Size No of Pages $\times$ PTE size= Page Table Size Then, if we divide Virtual Address Space with No of Segments then what will we get? __________________________________________________________________________ $2)$ Is every Program is a software interrupt?
commented
Nov 7, 2018
in
Operating System

41
views
operatingsystem
1
answer
4
Doubt Counting Semaphore
Assume Counting Semaphore N=8. On performing 10 down() operations by 10 different processes , first 8 will be successful and last two processes will be suspended. Does this mean that the first 8 processes can enter in the CS at the same time? In other words, does counting semaphore can let multiple processes access the CS at the same time?
answered
Nov 7, 2018
in
Operating System

142
views
operatingsystem
semaphore
processsynchronization
0
answers
5
Graph connectivity
Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?
commented
Nov 6, 2018
in
Graph Theory

225
views
graphtheory
graphconnectivity
0
answers
6
Regular Graph
If a 2regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 S3: G is connected S4: Every component of G is an even cycle Options A) S1,S2 B)S2,S4 C)S3,S4 D)S1,S4
commented
Nov 6, 2018
in
Graph Theory

132
views
graphtheory
discretemathematics
graph
1
answer
7
AVL Tree
The minimum number of node in an AVL Tree of height $10$ is ____________
answer edited
Nov 6, 2018
in
DS

86
views
datastructure
avltree
2
answers
8
#OS #FCFS
Is FCFS always nonpreemptive? If an I/O bound process comes, then? It will be preempted or not?
answered
Nov 6, 2018
in
Operating System

129
views
2
answers
9
Gateforum Test Series: Digital Logic  Adder
answered
Nov 6, 2018
in
Digital Logic

68
views
gateforumtestseries
digitallogic
adder
1
answer
10
MadeEasy Test Series: Theory Of Computation  Regular Languages
Which of the following is Regular?
commented
Nov 6, 2018
in
Theory of Computation

115
views
theoryofcomputation
regularlanguages
madeeasytestseries
2
answers
11
made easy
Which of the following statements is incorrect? (a)Threads are bound to a single process. (b)It's much easier to communicate between processes than between threads. (c)Process consumes more resources. (d)It's easy for threads to inadvertently disrupt each other since they share the entire address space.
answered
Nov 6, 2018
in
Operating System

99
views
1
answer
12
Page Replacement
Only "Second chance" is mentioned then how can I know whether it is "FIFO 2nd chance" or "LRU 2nd chance" algorithm ?
answered
Nov 6, 2018
in
Operating System

65
views
2
answers
13
Contiguous Memory Allocation
Why option A is wrong ? It is contiguous allocation policy hence suffers fragmentation.
commented
Nov 6, 2018
in
Operating System

114
views
0
answers
14
Testseries
Correct answer is A
commented
Nov 6, 2018
in
Algorithms

91
views
testseries
0
answers
15
Time Complexity for an infinite loop
What is the time complexity for infinite loops Question 1 what is T(n) for this case While(1) { a=a+b; } Question 2 for this case if(1) { for i to n a=a+b } else { for i to n for j to n a=a+b } Edit 2: Compiled the code ... ); return 0; } output I get is 8 6 which means the else case is never executed hence in worst case do we have to consider the else part.
commented
Nov 6, 2018
in
Algorithms

153
views
algorithms
timecomplexity
asymptoticnotations
spacecomplexity
1
answer
16
Push Down Automata
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack Then A)Ldf proper subset of Lef. B)Ldf = Lef. C)Lef proper subset of Ldf. D)None .
commented
Nov 6, 2018
in
Theory of Computation

99
views
theoryofcomputation
pushdownautomata
dpda
contextfreegrammars
2
answers
17
what is the need of multilevel paging in terms of implementation of virtual address space ?
answered
Nov 5, 2018
in
Operating System

312
views
2
answers
18
Deadlock
If the total number of resources available is 6 and each process requires 3 instances of a resource to complete execution. Then what is the number of processes that can exist in this system without causing a deadlock?
answer selected
Nov 5, 2018
in
Operating System

67
views
deadlock
operatingsystem
50,645
questions
56,601
answers
195,849
comments
102,207
users