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 abhishek_tyagi
8
answers
1
Minimum number of comparisons required to sort 5 elements is
The minimum number of comparisons required to sort 5 elements is - 4 5 6 7
The minimum number of comparisons required to sort 5 elements is -4567
43.8k
views
answered
Mar 28
Algorithms
algorithms
sorting
+
–
5
answers
2
ISRO2015-61
The contents of the flag register after execution of the following program by $8085$ microprocessor will be $\textbf{Program}$ $\textsf{SUB A}$ $\textsf{MVI B,(01)}_\textsf{H}$ $\textsf{DCR B}$ $\textsf{HLT}$ $(54)_\textsf{H}$ $(00)_\textsf{H}$ $(01)_\textsf{H}$ $(45)_\textsf{H}$
The contents of the flag register after execution of the following program by $8085$ microprocessor will be$\textbf{Program}$$\textsf{SUB A}$$\textsf{MVI B,(01)}_\textsf{...
10.3k
views
commented
Jan 9, 2020
CO and Architecture
8085-microprocessor
non-gate
isro2015
+
–
1
answer
3
made easy work book
A resource record of DNS has Time to live field which gives the indication of how stable the record is.Such information which is highly stable is assigned to________
A resource record of DNS has Time to live field which gives the indication of how stable the record is.Such information which is highly stable is assigned to________
1.3k
views
answered
Dec 25, 2019
5
answers
4
GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-...
24.5k
views
commented
Nov 6, 2019
Algorithms
gatecse-2015-set1
algorithms
data-structures
normal
time-complexity
+
–
2
answers
5
Circuit switching vs packet switching
Suppose that x bit of message is transmitted over a k -hop path in a network.The circuit set up time is s seconds,the propagation delay is d seconds per hop.The packet size is p bits and data rate is b bps.At what time user will receive the message if a.) Circuit switching is used b:) Packet switching is used
Suppose that x bit of message is transmitted over a k -hop path in a network.The circuit set up time is s seconds,the propagation delay is d seconds per hop.The packet ...
5.5k
views
commented
Sep 4, 2019
Computer Networks
computer-networks
network-switching
+
–
1
answer
6
Data Link Layer
What is the channel capacity of printer (in bps) with a 400Hz bandwidth and a signal to noise ratio is 7 dB?
What is the channel capacity of printer (in bps) with a 400Hz bandwidth and a signal to noise ratio is 7 dB?
1.8k
views
commented
Sep 4, 2019
Computer Networks
computer-networks
data-link-layer
signal-to-noise
+
–
10
answers
7
GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i ...
22.1k
views
commented
Jul 8, 2019
Algorithms
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
+
–
7
answers
8
GATE CSE 2015 Set 2 | Question: 45
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the ... $(a, $ left_end$, k)$ $(a, n-$left_end$-1, k-$left_end$-1)$ and $(a, $left_end$, k)$
Suppose you are provided with the following function declaration in the C programming language.int partition(int a[], int n);The function treats the first element of $a[\...
16.9k
views
commented
Jul 4, 2019
Algorithms
gatecse-2015-set2
algorithms
normal
sorting
quick-sort
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register