Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
endurance1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by endurance1
1
votes
1
GATE IT 2005 | Question: 9
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of the memory cycle time is used for refreshing? $10$ $6.4$ $1$ $0.64$
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of t...
10.5k
views
answered
Jun 21, 2021
Digital Logic
gateit-2005
digital-logic
memory-interfacing
normal
+
–
0
votes
2
ACE Model Grand Test 2003 Operating System
The state of a process during context switching is 1. May be busy 2. May be idle 3. Always idle 4. always busy
The state of a process during context switching is 1. May be busy2. May be idle3. Always idle4. always busy
1.3k
views
answered
Jun 8, 2021
Operating System
operating-system
context-switch
+
–
0
votes
3
What is the probability of seat available
An airplane knows that 5 percent of the people making reservations on a certain flight will not show up. Consequently, their policy is to sell 52 tickets for a flight that can hold only 50 passengers. What is the probability that there will be a seat available for every passenger who shows up?
An airplane knows that 5 percent of the people making reservations on a certain flight will not show up. Consequently, their policy is to sell 52 tickets for a flight tha...
7.3k
views
answered
Mar 18, 2021
1
votes
4
GATE CSE 1995 | Question: 24
Prove that in finite graph, the number of vertices of odd degree is always even.
Prove that in finite graph, the number of vertices of odd degree is always even.
5.7k
views
answered
Mar 10, 2021
Graph Theory
gate1995
graph-theory
degree-of-graph
proof
descriptive
+
–
0
votes
5
GATE CSE 1996 | Question: 1.4
Which of the following statements is FALSE? The set of rational numbers is an abelian group under addition The set of integers in an abelian group under addition The set of rational numbers form an abelian group under multiplication The set of real numbers excluding zero is an abelian group under multiplication
Which of the following statements is FALSE?The set of rational numbers is an abelian group under additionThe set of integers in an abelian group under additionThe set of ...
22.8k
views
answered
Mar 4, 2021
Set Theory & Algebra
gate1996
set-theory&algebra
group-theory
normal
+
–
0
votes
6
GATE CSE 2016 Set 1 | Question: 14
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? $P$: Minimum spanning tree of $G$ does not change. $Q$: Shortest path between any pair of vertices does not change. $P$ only $Q$ only Neither $P$ nor $Q$ Both $P$ and $Q$
Let $G$ be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following sta...
22.4k
views
answered
Sep 17, 2020
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
+
–
0
votes
7
GATE CSE 2011 | Question: 55
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. The length of the path from $v_5$ to $v_6$ in the MST of previous question with $n=10$ is $11$ $25$ $31$ $41$
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each ...
11.6k
views
answered
Sep 17, 2020
Algorithms
gatecse-2011
algorithms
graph-algorithms
spanning-tree
normal
+
–
0
votes
8
GATE CSE 2005 | Question: 39
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements i...
26.1k
views
answered
Sep 6, 2020
Algorithms
gatecse-2005
algorithms
sorting
normal
+
–
7
votes
9
GATE IT 2007 | Question: 25
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ? $1$ $2$ $3$ $n$
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ?$1$$2$$3$$n$
21.3k
views
answered
Jan 6, 2020
Graph Theory
gateit-2007
graph-theory
graph-connectivity
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register