Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Laxmi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Laxmi
10
answers
1
GATE CSE 2013 | Question: 29
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing ... cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in...
29.8k
views
commented
Dec 17, 2016
Operating System
gatecse-2013
operating-system
disk
normal
+
–
10
answers
2
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
31.7k
views
commented
Jan 28, 2015
DS
gatecse-2003
data-structures
binary-heap
+
–
11
answers
3
GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree i...
25.9k
views
commented
Jan 28, 2015
DS
gateit-2006
data-structures
binary-tree
normal
+
–
6
answers
4
GATE CSE 2014 Set 1 | Question: 14
Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by P for the inputs $[1 \ 2 \ 3 \ 4 \ 5]$ and $[4 \ 1 \ 5 \ 3 \ 2]$ respectively. Which one of the following holds? $t_1 = 5$ $t_1 < t_2$ $t_1>t_2$ $t_1 = t_2$
Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by P for the i...
19.1k
views
answered
Jan 27, 2015
Algorithms
gatecse-2014-set1
algorithms
sorting
easy
+
–
3
answers
5
GATE IT 2008 | Question: 83
Consider the code fragment written in C below : void f (int n) { if (n <= 1) { printf ("%d", n); } else { f (n/2); printf ("%d", n%2); } } Which of the following implementations will produce the same output for $f(173)$ as the above code? ... { printf ("%d", n%2); f (n/2); } } Both $P1$ and $P2$ $P2$ only $P1$ only Neither $P1$ nor $P2$
Consider the code fragment written in C below : void f (int n) { if (n <= 1) { printf ("%d", n); } else { f (n/2); printf ("%d", n%2); } }Which of the following im...
8.7k
views
answered
Jan 26, 2015
Algorithms
gateit-2008
algorithms
recursion
identify-function
normal
+
–
9
answers
6
GATE IT 2005 | Question: 52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which ...
20.4k
views
answered
Jan 26, 2015
Algorithms
gateit-2005
algorithms
spanning-tree
normal
+
–
2
answers
7
time complexity of a program is?
for(i=1;i<=n;i++) for(j=n/3;j<=2n;j+=n/3) x=x+1;
for(i=1;i<=n;i++) for(j=n/3;j<=2n;j+=n/3) x=x+1;
383
views
answered
Jan 26, 2015
Algorithms
algorithms
time-complexity
+
–
2
answers
8
based on asymptotics, which of the following is true?
433
views
commented
Jan 26, 2015
Algorithms
algorithms
asymptotic-notation
test-series
+
–
2
answers
9
GATE IT 2004 | Question: 16
Which of the following commands or sequences of commands will rename a file x to file y in a Unix system ? mv y, x mv x, y cp y, x (rm x) cp x, y (rm x) II and III II and IV I and III II only
Which of the following commands or sequences of commands will rename a file x to file y in a Unix system ?mv y, xmv x, ycp y, x (rm x)cp x, y (rm x)II and IIIII and IVI a...
3.9k
views
commented
Jan 25, 2015
Operating System
gateit-2004
operating-system
unix
out-of-syllabus-now
+
–
2
answers
10
Mysterious Fork() call?
1.2k
views
answered
Jan 25, 2015
Operating System
fork-system-call
operating-system
+
–
4
answers
11
GATE CSE 2007 | Question: 17
Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE? Context switch time is longer for kernel level threads than for user level threads. User level threads do ... be scheduled on different processors in a multi-processor system. Blocking one kernel level thread blocks all related threads.
Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE?Context switch time is longer for kern...
21.0k
views
commented
Jan 25, 2015
Operating System
gatecse-2007
operating-system
threads
normal
+
–
4
answers
12
GATE CSE 2007 | Question: 55
An operating system used Shortest Remaining System Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes: ... $P2$ ? $5$ $15$ $40$ $55$
An operating system used Shortest Remaining System Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following process...
8.1k
views
commented
Jan 25, 2015
Operating System
gatecse-2007
operating-system
process-scheduling
normal
+
–
14
answers
13
GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None
Each Process $P_i, i = 1\ldots 9$ is coded as followsrepeat P(mutex) {Critical section} V(mutex) foreverThe code for $P_{10}$ is identical except it uses V(mutex) in plac...
24.7k
views
answered
Jan 24, 2015
Operating System
gate1997
operating-system
process-synchronization
normal
+
–
2
answers
14
Disk Scheduling algorithm
Which scheduling algorithm is optimum among the following disk scheduling algorithm in most of cases? a)FCFS b)SSTF c)SCAN d)LOOK Also please give reason
Which scheduling algorithm is optimum among the following disk scheduling algorithm in most of cases?a)FCFSb)SSTFc)SCANd)LOOKAlso please give reason
2.6k
views
answered
Jan 24, 2015
6
answers
15
GATE CSE 2006 | Question: 63, UGCNET-June2012-III: 45
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to ... more efficient now Hardware support for memory management is no longer needed CPU scheduling can be made more efficient now
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address ...
25.6k
views
answered
Dec 25, 2014
Operating System
gatecse-2006
operating-system
virtual-memory
normal
ugcnetcse-june2012-paper3
+
–
2
answers
16
GATE IT 2005 | Question: 17
A student wishes to create symbolic links in a computer system running Unix. Three text files named $``\text{file 1}", ``\text{file 2}"$ and $``\text{file 3}"$ exist in her current working directory, and the student has read and ... information would be lost from her file system? Hobbies Friends Courses I and II only II and III only II only I and III only
A student wishes to create symbolic links in a computer system running Unix. Three text files named $ \text{file 1}", \text{file 2}"$ and $ \text{file 3}"$ exist in h...
4.1k
views
answered
Dec 25, 2014
Operating System
gateit-2005
operating-system
shell-script
out-of-syllabus-now
normal
+
–
4
answers
17
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...
22.5k
views
answered
Dec 25, 2014
Operating System
gateit-2007
operating-system
page-replacement
probability
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register