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 yg92
1
votes
1
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...
33.3k
views
answered
Mar 25, 2017
Operating System
gatecse-2017-set1
operating-system
process-synchronization
normal
+
–
10
votes
2
ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
Semaphores are used to solve the problem ofRace ConditionProcess SynchronizationMutual ExclusionNone of the aboveI and IIII and IIIAll of the aboveNone of the above
21.6k
views
answered
Mar 24, 2017
Operating System
semaphore
isro2015
process-synchronization
+
–
–2
votes
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.3k
views
answered
Feb 16, 2017
Operating System
gatecse-2017-set1
page-replacement
operating-system
normal
+
–
64
votes
4
GATE CSE 2017 Set 1 | Question: 45
The values of parameters for the Stop-and-Wait ARQ protocol are as given below: Bit rate of the transmission channel $= 1$ Mbps. Propagation delay from sender to receiver $= 0.75$ ms. Time to process a frame $= 0.25$ ms. Number ... (expressed in percentage) of the Stop-and-Wait ARQ protocol for the above parameters is _____________ (correct to $2$ decimal places).
The values of parameters for the Stop-and-Wait ARQ protocol are as given below:Bit rate of the transmission channel $= 1$ Mbps.Propagation delay from sender to receiver $...
33.0k
views
answered
Feb 15, 2017
Computer Networks
gatecse-2017-set1
computer-networks
stop-and-wait
numerical-answers
normal
+
–
5
votes
5
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$$S \rightarrow abScT \mid abcT$$$$T \rightarrow bT \mid ...
21.7k
views
answered
Feb 15, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
normal
+
–
14
votes
6
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.7k
views
answered
Feb 15, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
23
votes
7
GATE CSE 2017 Set 1 | Question: 41
Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relation EMP. Consider the following queries on the database expressed in tuple relational calculus. { ... Which of the above queries are safe? I and II only I and III only II and III only I, II and III
Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relatio...
25.6k
views
answered
Feb 15, 2017
Databases
gatecse-2017-set1
databases
relational-calculus
safe-query
normal
+
–
0
votes
8
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.7k
views
answered
Feb 14, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
3
votes
9
Paging
Consider a computer system that implements physical address of 26-bits and page size of 16 KB. The processor contains TLB which can hold 128 page table entries and is 4-way set associative. The maximum page table size is 8 MB. If the page table entry contains a valid bit, a dirty bit, 2 page protection bit and translation, then the minimum TLB tag bits supported by the system is _________.
Consider a computer system that implements physical address of 26-bits and page size of 16 KB. The processor contains TLB which can hold 128 page table entries and is 4-w...
1.0k
views
answered
Jan 31, 2017
3
votes
10
Segmented Paging
Consider a system using segmented paging architecture, the segment is divided into 32K pages and each page is having 8K entries. The segment table is divided into 16K pages and each page is having 4K entries. The memory is byte addressable and page table entry ... . The Physical Address space is 1GB. Evaluate : The Page table size of segment. The Page table size of segment table.
Consider a system using segmented paging architecture, the segment is divided into 32K pages and each page is having 8K entries. The segment table is divided into 16K pag...
4.7k
views
answered
Jan 31, 2017
5
votes
11
paging with segmentation
Consider a system using segmented paging architecture where both logical address space and physical address space is 64 MB. The logical address space is divided into 8 equal size segments, the segment is divided into equal size pages which are power of 2. The ... be the size of the page of segment in bytes so that the page table of segment exactly fits in one page frame?
Consider a system using segmented paging architecture where both logical address space and physical address space is 64 MB. The logical address space is divided into 8 eq...
2.0k
views
answered
Jan 31, 2017
Operating System
operating-system
+
–
2
votes
12
Time Complexity of the given code ?
#include <stdio.h> int main(void) { for(i=1;i<=n;i*=2) { for(j=0;j<=i;j++) { for(k=0;k<=n;k++) { ..... O(1)....; } } } return 0; } What is the time complexity of given code ?
#include <stdio.h int main(void) { for(i=1;i<=n;i*=2) { for(j=0;j<=i;j++) { for(k=0;k<=n;k++) { ..... O(1)....; } } } return 0; }What is the time complexity of given code...
1.0k
views
answered
Jan 29, 2017
Algorithms
time-complexity
algorithms
programming-in-c
+
–
2
votes
13
MadeEasy CBT 2017: CO & Architecture - Pipelining
1.4k
views
answered
Jan 23, 2017
CO and Architecture
made-easy-test-series
cbt-2017
co-and-architecture
pipelining
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
