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 sarthak_07
1
answer
1
TOC question from virtual gate
Given answer: A Please explain
Given answer: APlease explain
829
views
commented
Nov 22, 2021
Theory of Computation
theory-of-computation
finite-automata
context-free-language
+
–
4
answers
2
GATE IT 2005 | Question: 77
Assume that "host1.mydomain.dom" has an IP address of $145.128.16.8$. Which of the following options would be most appropriate as a subsequence of steps in performing the reverse lookup of $145.128.16.8$ ? In the following options "NS" is ... -addr.arpa domains Directly query a NS for $145.$in-addr.arpa and then a NS for $128.145.$in-addr.arpa domains
Assume that "host1.mydomain.dom" has an IP address of $145.128.16.8$. Which of the following options would be most appropriate as a subsequence of steps in performing the...
10.1k
views
commented
Oct 21, 2021
Computer Networks
gateit-2005
computer-networks
normal
application-layer-protocols
+
–
7
answers
3
GATE CSE 1990 | Question: 7-b
In a two-level virtual memory, the memory access time for main memory, $t_{M}=10^{-8}$ sec, and the memory access time for the secondary memory, $t_D=10^{-3}$ sec. What must be the hit ratio, $H$ such that the access efficiency is within $80$ percent of its maximum value?
In a two-level virtual memory, the memory access time for main memory, $t_{M}=10^{-8}$ sec, and the memory access time for the secondary memory, $t_D=10^{-3}$ sec. What m...
19.3k
views
answer reshown
Sep 30, 2021
Operating System
gate1990
descriptive
operating-system
virtual-memory
+
–
7
answers
4
GATE CSE 2018 | Question: 30
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements.No...
27.4k
views
commented
Sep 17, 2021
Algorithms
gatecse-2018
algorithms
graph-algorithms
graph-search
normal
2-marks
+
–
6
answers
5
GATE CSE 2000 | Question: 17
An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements that are swapped need to be adjacent). What is the minimum number of swaps ... ? Give an ordering of elements in the above array so that the minimum number of swaps needed to sort the array is maximum.
An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements t...
11.1k
views
commented
Sep 13, 2021
Algorithms
gatecse-2000
algorithms
sorting
normal
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register