Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
harkirat31
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by harkirat31
1
answer
1
bsnl form
i am from cbse board what should i upload here please tell sir ASAP?
i am from cbse board what should i upload here please tell sir ASAP?
1.4k
views
commented
Mar 10, 2017
7
answers
2
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All...
32.9k
views
commented
Feb 17, 2017
Operating System
gatecse-2017-set1
operating-system
process-synchronization
normal
+
–
5
answers
3
GATE CSE 2017 Set 1 | Question: 40
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: $S_1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's ... is true, $S_2$ is false $S_1$ is false, $S_2$ is true $S_1$ is false, $S_2$ is false
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements:$S_1$: Random pa...
15.0k
views
commented
Feb 16, 2017
Operating System
gatecse-2017-set1
page-replacement
operating-system
normal
+
–
11
answers
4
GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
Consider the C code fragment given below.typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->ne...
25.4k
views
commented
Feb 16, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
1
answer
5
Which session of gate cse 2017 was more difficult ?
1.8k
views
asked
Feb 14, 2017
11
answers
6
GATE CSE 2017 Set 1 | Question: 35
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n - 2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); ... printf("%d", n); } The output printed when $\text{fun1}(5)$ is called is $53423122233445$ $53423120112233$ $53423122132435$ $53423120213243$
Consider the following two functions.void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n - 2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("...
20.1k
views
answered
Feb 14, 2017
Programming in C
gatecse-2017-set1
programming
normal
tricky
recursion
+
–
1
answer
7
MadeEasy Subject Test: CO & Architecture - Dma
292
views
asked
Jan 18, 2017
CO and Architecture
made-easy-test-series
co-and-architecture
dma
+
–
0
answers
8
Test Series
What is the correct answer?? is option a is correct?
What is the correct answer?? is option a is correct?
249
views
commented
Jan 9, 2017
2
answers
9
Doubt
Whether a given regular grammar is ambiguous is decidable ?
Whether a given regular grammar is ambiguous is decidable ?
219
views
asked
Jan 3, 2017
2
answers
10
Made Easy Test Series
338
views
asked
Oct 17, 2016
1
answer
11
Ace Gate practice Booklet (1116 Expected questions) Volume 2
Consider a disk with the following specification disk block size is 'S' bytes; Disk Block address id 'D' bits, Disk size is 'B' bytes. 'K' of the total blocks are in use. What is the total space consumption under free list and bit map methods ... b) (B(1+D) - DS)/S c) B/S + ((B-K)/S).D d) B/S + K.D
Consider a disk with the following specification disk block size is 'S' bytes; Disk Block address id 'D' bits, Disk size is 'B' bytes. 'K' of the total blocks are in use....
4.8k
views
answered
Oct 2, 2016
Operating System
file-system
operating-system
disk-scheduling
+
–
1
answer
12
ace test series
367
views
answer selected
Aug 11, 2016
Algorithms
algorithms
asymptotic-notation
ace-test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register