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 GopiChand
1
answer
1
Looking for Classroom Courses to Repeat for GATE
Hi, So here is the dilemma I am in. I have scored 710, AIR 521 in Gate this year. I had completed all the syllabus, and I was scoring good in test series too. After analyzing my paper performance I realized I lack in ... four month training period. I would appreciate insights on my situation and any suggestion you might have. Thank you for reading :)
Hi,So here is the dilemma I am in. I have scored 710, AIR 521 in Gate this year. I had completed all the syllabus, and I was scoring good in test series too. After analyz...
424
views
commented
Mar 18, 2022
7
answers
2
GATE IT 2004 | Question: 55
Let $f(n)$, $g(n)$ and $h(n)$ be functions defined for positive integers such that $f(n) = O(g(n))$, $g(n) \neq O(f(n))$, $g(n) = O(h(n))$, and $h(n) = O(g(n))$. Which one of the following statements is FALSE? $f(n) + g(n) = O(h(n) + h(n))$ $f(n) = O(h(n))$ $h(n) \neq O(f(n))$ $f(n)h(n) \neq O(g(n)h(n))$
Let $f(n)$, $g(n)$ and $h(n)$ be functions defined for positive integers such that $f(n) = O(g(n))$, $g(n) \neq O(f(n))$, $g(n) = O(h(n))$, and $h(n) = O(g(n))$.Which one...
13.3k
views
commented
Mar 20, 2021
Algorithms
gateit-2004
algorithms
asymptotic-notation
normal
+
–
3
answers
3
GATE CSE 2006 | Question: 78
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of ... need not be inside a critical section The barrier implementation is correct if there are only two processes instead of three.
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arr...
18.3k
views
commented
Mar 2, 2021
Operating System
gatecse-2006
operating-system
process-synchronization
normal
+
–
4
answers
4
GATE CSE 2020 | Question: 43
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this processor. Overheads associated with pipelining force you to ... , the speedup achieved by the pipelined processor over the non-pipelined processor (round off to $2$ decimal places) is_____________.
Consider a non-pipelined processor operating at $2.5$ GHz. It takes $5$ clock cycles to complete an instruction. You are going to make a $5$- stage pipeline out of this p...
16.6k
views
commented
Feb 6, 2021
CO and Architecture
gatecse-2020
numerical-answers
co-and-architecture
pipelining
2-marks
+
–
3
answers
5
GATE CSE 2020 | Question: 34
Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shared variable initialized to $0$ ... all processes execute CODE SECTION P mutually exclusively. It ensures that at most $n-1$ processes are in CODE SECTION P at any time.
Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shar...
13.8k
views
commented
Jan 23, 2021
Operating System
gatecse-2020
operating-system
semaphore
2-marks
+
–
6
answers
6
GATE CSE 2008 | Question: 46
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P...
39.2k
views
commented
Jan 22, 2021
DS
gatecse-2008
data-structures
binary-search-tree
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register