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 Swati Kalani
4
answers
1
UGC NET CSE | June 2012 | Part 3 | Question: 74
On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy all the requests in the disk queue. Assume the last request service was at track 345 and the head is moving toward track 0. ... order contains requests for the following tracks: 123, 874, 692, 475, 105, 376 (Assume scan algorithm) 2013 1219 1967 1507
On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy all the requests in the disk queue. Assume the last request service ...
12.6k
views
commented
Apr 24, 2018
Operating System
ugcnetcse-june2012-paper3
operating-system
disk-scheduling
+
–
3
answers
2
UGC NET CSE | Junet 2015 | Part 2 | Question: 5
Consider a Hamiltonian Graph(G) with no loops and parallel edges. Which of the following is true with respect to this graph (G)? $\deg (v) \geq n/2$ for each vertex of $G$ $\mid E(G) \mid \geq 1/2 (n-1)(n-2)+2$ edges $\deg(v) + \deg(w) \geq n$ ... $v$ and $\omega$ not connected by an edge $i$ and $ii$ $ii$ and $iii$ $i$ and $iii$ $i$, $ii$, and $iii$
Consider a Hamiltonian Graph(G) with no loops and parallel edges. Which of the following is true with respect to this graph (G)?$\deg (v) \geq n/2$ for each vertex of $G$...
4.5k
views
commented
Apr 22, 2018
Graph Theory
ugcnetcse-june2015-paper2
discrete-mathematics
graph-theory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register