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
Recent activity by Suraj123
6
answers
1
GATE CSE 2017 Set 2 | Question: 30
Consider the recurrence function $T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$ Then $T(n)$ in terms of $\Theta$ notation is $\Theta(\log \log n)$ $\Theta( \log n)$ $\Theta (\sqrt{n})$ $\Theta(n)$
Consider the recurrence function$$T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$$Then $T(n)$ in terms of $\Theta$ notation is$\Theta(\log \l...
18.0k
views
commented
Dec 27, 2018
Algorithms
gatecse-2017-set2
algorithms
recurrence-relation
+
–
6
answers
2
GATE CSE 2006 | Question: 61
The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$ ... a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore
The atomic fetch-and-set $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening a...
27.8k
views
commented
Dec 5, 2018
Operating System
gatecse-2006
operating-system
process-synchronization
normal
+
–
4
answers
3
GATE IT 2007 | Question: 58
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability of a page fault is $p$ ... that the average access time is $3$ time units. Then the value of $p$ is $0.194$ $0.233$ $0.514$ $0.981$
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability o...
23.1k
views
comment edited
Dec 3, 2018
Operating System
gateit-2007
operating-system
page-replacement
probability
normal
+
–
6
answers
4
GATE CSE 2014 Set 2 | Question: 14
Consider the tree arcs of a BFS traversal from a source node $W$ in an unweighted, connected, undirected graph. The tree $T$ formed by the tree arcs is a data structure for computing the shortest path between every pair of vertices. the shortest path ... graph. the shortest paths from $W$ to only those nodes that are leaves of $T$. the longest path in the graph.
Consider the tree arcs of a BFS traversal from a source node $W$ in an unweighted, connected, undirected graph. The tree $T$ formed by the tree arcs is a data structure f...
11.2k
views
answered
Jul 9, 2018
Algorithms
gatecse-2014-set2
algorithms
graph-algorithms
normal
graph-search
+
–
2
answers
5
MadeEasy Test Series: Algorithms - Time Complexity
please explain answer given c
please explain answer given c
723
views
answered
Apr 9, 2018
Algorithms
made-easy-test-series
algorithms
time-complexity
+
–
2
answers
6
mock test
Given an array $A[-1:6,-2:10] $. The base address of array is $1000$. If every elements take $4$ Bytes for storage . Then compute the address of element $A[5,7]$. Assume row major storage. $1245$ $1348$ $2434$ $1384$
Given an array $A[-1:6,-2:10] $. The base address of array is $1000$. If every elements take $4$ Bytes for storage . Then compute the address of element $A[5,7]$. Assum...
1.5k
views
commented
Apr 9, 2018
Programming in C
array
+
–
1
answer
7
critical section
Consider the following code to access critical section do{ flag[j] = 1; turn = x; while(y); // Critical Section flag[z]=0; // Remainder Section } while(1); The values of x, y and z in the above code for which Mutual exclusion is guaranteed for two process i and j x=j; y=flag[j] ... =flag[i]&&turn=i; z=j x=j; y=flag[i]&&turn=i; z=j x=j; y=flag[j]&&turn=j; z=j
Consider the following code to access critical sectiondo{flag[j] = 1;turn = x;while(y);// Critical Sectionflag[z]=0;// Remainder Section} while(1);The values of x, y and ...
3.1k
views
answered
Jan 12, 2018
Operating System
operating-system
critical-section
process-synchronization
+
–
5
answers
8
Matrix Chain
Total no. of ways to perform matrix multiplication having 7 matrices is ? Total no. of ways to by which we could parenthesize 7 matrices is ? Does the above two questions are different or same ? Plz explain the answer.
Total no. of ways to perform matrix multiplication having 7 matrices is ?Total no. of ways to by which we could parenthesize 7 matrices is ?Does the above two questions ...
15.5k
views
answered
Oct 26, 2017
Algorithms
algorithms
dynamic-programming
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register