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 Vink7389
1
answer
1
Shortest path in DAG and Travelling salesman problem are in DSA gate syllabus??
197
views
asked
Jun 27, 2022
Algorithms
syllabus
+
–
4
answers
2
GATE CSE 1996 | Question: 1.20, ISRO2008-56
Which of the following is an example of spooled device? A line printer used to print the output of a number of jobs A terminal used to enter input data to a running program A secondary storage device in a virtual memory system A graphic display device
Which of the following is an example of spooled device?A line printer used to print the output of a number of jobsA terminal used to enter input data to a running program...
11.1k
views
commented
Jun 8, 2021
Operating System
gate1996
operating-system
io-handling
normal
isro2008
+
–
1
answer
3
Internal and External fragmentation
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{KB}$refers to $\text{kilobyte}$. ... be calculated when we have the information about free memory slots and the process size whose size must be greater than Max free slot size. Someone verify it.
Consider $6$ memory partitions of sizes $200$ $\text{KB}$, $400$ $\text{KB}$, $600$ $\text{KB}$, $500$ $\text{KB}$, $300$ $\text{KB}$and $250$ $\text{KB}$, where $\text{K...
3.2k
views
commented
May 2, 2021
Operating System
memory-management
operating-system
fragmentation
+
–
7
answers
4
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is$\Theta(n)$$\Theta(\log n)...
36.6k
views
commented
Apr 25, 2021
Algorithms
gatecse-2008
normal
algorithms
time-complexity
+
–
4
answers
5
GATE CSE 2021 Set 1 | Question: 46
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in line $\#1$. Assume that the increment operation in line $\#7$ ... is $0$ after all the threads successfully complete the execution of $\textsf{parop}$ There is a deadlock involving all the threads
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in li...
13.5k
views
commented
Apr 17, 2021
Operating System
gatecse-2021-set1
multiple-selects
operating-system
process-synchronization
semaphore
2-marks
+
–
6
answers
6
GATE CSE 1994 | Question: 1.23
Consider the following two functions: $g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n > 10,000 \end{cases}$ $g_2(n) = \begin{cases} n \text{ for } 0 \leq n \leq 100 \\ n^3 \text{ for } n > 100 \end{cases}$ Which of the ... $g_1(n) \text{ is } O(n^3)$ $g_2(n) \text{ is } O(g_1(n))$ $g_2(n) \text{ is } O(n)$
Consider the following two functions:$g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n 10,000 \end{cases}$$g_2(n) = \begin{cases} n \te...
15.5k
views
commented
Apr 8, 2021
Algorithms
gate1994
algorithms
asymptotic-notation
normal
multiple-selects
+
–
2
answers
7
GATE CSE 1991 | Question: 03-viii
Consider the following Pascal function: Function X(M:integer):integer; Var i:integer; Begin i := 0; while i*i < M do i:= i+1 X := i end The function call $X(N)$, if $N$ is positive, will return $\lfloor\sqrt N \rfloor$ $\lfloor\sqrt N \rfloor +1$ $\lceil \sqrt N \rceil$ $\lceil \sqrt N \rceil +1$ None of the above
Consider the following Pascal function:Function X(M:integer):integer; Var i:integer; Begin i := 0; while i*i < M do i:= i+1 X := i endThe function call $X(N)$, if $N$ is ...
3.5k
views
commented
Sep 7, 2020
Algorithms
gate1991
algorithms
easy
identify-function
multiple-selects
+
–
3
answers
8
GATE CSE 2009 | Question: 54
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths ...
14.4k
views
commented
Sep 3, 2020
Algorithms
gatecse-2009
normal
algorithms
dynamic-programming
recursion
+
–
4
answers
9
GATE CSE 2001 | Question: 2.20
Which of the following does not interrupt a running process? A device Timer Scheduler process Power failure
Which of the following does not interrupt a running process?A deviceTimerScheduler processPower failure
24.5k
views
commented
Jul 27, 2020
Operating System
gatecse-2001
operating-system
easy
process
+
–
4
answers
10
paging
Q. Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. Assume that each page table at diff level fits in a single page.How much memory is used by program, including its page tables?
Q.Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire pro...
6.8k
views
commented
May 17, 2020
Operating System
paging
operating-system
memory-management
virtual-memory
+
–
2
answers
11
GATE CSE 2020 | Question: 38
An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space $202.61.0.0/17$. The ... $\text{III}$ only $\text{III}$ and $\text{IV}$ only $\text{I}$ and $\text{IV}$ only
An organization requires a range of IP address to assign one to each of its $1500$ computers. The organization has approached an Internet Service Provider (ISP) for this ...
24.5k
views
commented
Feb 13, 2020
Computer Networks
gatecse-2020
computer-networks
subnetting
2-marks
+
–
2
answers
12
TIFR CSE 2014 | Part A | Question: 16
Let $x_{0}=1$ and $x_{n+1}= \frac{3+2x_{n}}{3+x_{n}}, n\geq 0$. $x_{\infty}=\displaystyle \lim_{n\rightarrow \infty}x_{n}$ is $\left(\sqrt{5}-1\right) / 2$ $\left(\sqrt{5}+1\right) / 2$ $\left(\sqrt{13}-1\right) / 2$ $\left(-\sqrt{13}-1\right) / 2$ None of the above
Let $x_{0}=1$ and$x_{n+1}= \frac{3+2x_{n}}{3+x_{n}}, n\geq 0$.$x_{\infty}=\displaystyle \lim_{n\rightarrow \infty}x_{n}$ is$\left(\sqrt{5}-1\right) / 2$$\left(\sqrt{5}+1\...
1.9k
views
commented
Feb 8, 2020
Calculus
tifr2014
limits
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register