Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
robinofautumn
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by robinofautumn
0
votes
1
Static Linking
Compare Following Points between Static and Dynamic Linking :- 1. Program Startup. 2. Overall Page Fault Rate.
Compare Following Points between Static and Dynamic Linking :- 1. Program Startup.2. Overall Page Fault Rate.
250
views
answered
Dec 30, 2022
Operating System
operating-system
linker
+
–
6
votes
2
GATE CSE 2022 | Question: 18
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with $0,$ the $3^{\text{rd}}$ largest element of the tree is stored at index ______________ .
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assumin...
14.8k
views
answered
Dec 27, 2022
DS
gatecse-2022
numerical-answers
data-structures
binary-search-tree
1-mark
+
–
0
votes
3
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
Dec 27, 2022
Algorithms
gatecse-2005
algorithms
sorting
normal
+
–
1
votes
4
mde esy test series
Which of the following statements is/are true? A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree. B. In a labelled undirected connected simple graph, G, all the breadth first search from same node form same ... is descendent of u in all possible depth-first search forest of G. (u.d is discover time of node u in DFS).
Which of the following statements is/are true?A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree.B. In a label...
591
views
answered
Dec 19, 2022
Algorithms
made-easy-test-series
graph-theory
depth-first-search
graph-algorithm
+
–
2
votes
5
what is the user identification number in process control block?
813
views
answered
Nov 15, 2022
Operating System
operating-system
+
–
0
votes
6
Kurose and Ross Edition 6 Exercise 1 Question P12 (Page No 73)
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other ... bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done bein...
3.5k
views
answered
Oct 17, 2022
Computer Networks
computer-networks
kurose-and-ross
network-layer
network-flow
network-switching
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register