Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
luc_Bloodstone
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by luc_Bloodstone
2
answers
1
Self doubt in Binary search Algo
The average successful search time taken by binary search on a sorted array of $10$ items? $2.6$ $2.7$ $2.8$ $2.9$ Answer is $2.9$ My doubt:- But when I am using $log_2n$ for $n = 10$ it is not equal to $2.9$, and $log_210 = 3.3219$ ?
The average successful search time taken by binary search on a sorted array of $10$ items?$2.6$$2.7$$2.8$$2.9$Answer is $2.9$My doubt:- But when I am using $log_2n$ for $...
11.0k
views
commented
Sep 8, 2020
Algorithms
algorithms
binary-search
time-complexity
+
–
4
answers
2
MadeEasy Test Series 2018: Compiler Design - Runtime Environments
Consider the following statements: S1 : Static allocation can not support recursive function. S2 : Stack allocation can support pointers but can not deallocate storage at run-time. S3 : Heap allocation can support pointers and it can allocate or deallocate ... statements are true? a S1 and S2 b S2 and S3 c S3 and S1 d S1, S2 and S3
Consider the following statements:S1 : Static allocation can not support recursive function.S2 : Stack allocation can support pointers but can not deallocate storage at r...
3.0k
views
commented
Sep 1, 2020
Compiler Design
compiler-design
runtime-environment
made-easy-test-series
+
–
4
answers
3
GATE CSE 1998 | Question: 7-a
Suppose we have a database consisting of the following three relations. $\text{FREQUENTS (student, parlor)}$ giving the parlors each student visits. $\text{SERVES (parlor, ice-cream)}$ ... the following in SQL: Print the students that frequent at least one parlor that serves some ice-cream that they like.
Suppose we have a database consisting of the following three relations.$\text{FREQUENTS (student, parlor)}$ giving the parlors each student visits.$\text{SERVES (parlor, ...
6.0k
views
commented
Jul 15, 2020
Databases
gate1998
databases
sql
descriptive
+
–
4
answers
4
GATE CSE 2014 Set 2 | Question: 48
The probability that a given positive integer lying between $1$ and $100$ (both inclusive) is NOT divisible by $2$, $3$ or $5$ is ______ .
The probability that a given positive integer lying between $1$ and $100$ (both inclusive) is NOT divisible by $2$, $3$ or $5$ is ______ .
13.0k
views
answered
Jun 5, 2020
Probability
gatecse-2014-set2
probability
numerical-answers
normal
+
–
3
answers
5
GATE CSE 1994 | Question: 21
Consider the following recursive function: function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end; The above function is run on a computer with a stack of $64$ bytes. Assuming ... an address takes $2$ bytes each, estimate the maximum value of $n$ for which the stack will not overflow. Give reasons for your answer.
Consider the following recursive function:function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end;The above function i...
25.4k
views
commented
May 22, 2020
Programming in C
gate1994
programming
recursion
normal
descriptive
+
–
9
answers
6
GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at ...
30.3k
views
commented
May 9, 2020
DS
gatecse-2019
numerical-answers
data-structures
binary-tree
2-marks
+
–
1
answer
7
#sorting
Consider an array contains n distinct elements and we need to sort them in nondecreasing order as follows: First find the minimum, remove this element from the array and find the minimum of the remaining elements, remove this element and so on until array become empty. In the best case, how many comparisons are needed? A.O(n) B.O(n2) C.O(nlogn) D.None of the above
Consider an array contains n distinct elements and we need to sort them in nondecreasing order as follows: First find the minimum, remove this element from the array an...
948
views
commented
Apr 27, 2020
Algorithms
algorithms
sorting
time-complexity
+
–
0
answers
8
How is it possible to maintain the same frame size?
The minimum size of ethernet frame is 64 bytes long to make sure that the sender is able to detect the collision at the far end of the cable. If the Fast Ethernet with bandwidth 100 Mb/s also has the same 64 byte minimum frame size, but ... the cable length by a factor of 10 Frame size must be change i think both A and B can be the answer..
The minimum size of ethernet frame is 64 bytes long to make sure that the sender is able to detect the collision at the far end of the cable. If the Fast Ethernet with ba...
1.3k
views
commented
Apr 7, 2020
Computer Networks
computer-networks
+
–
0
answers
9
Breadth first Search
Which of following statement is true ? A. In BFS of UDG there are no back edges and forward edges. B. In BFS of Directed Graph there is no back edge and forward edges. C. In BFS of UDG for each back edge(u,v) we have 0<= v.d <= u.d D. Both b and c. Ans. A
Which of following statement is true ?A. In BFS of UDG there are no back edges and forward edges.B. In BFS of Directed Graph there is no back edge and forward edges.C. In...
3.8k
views
commented
Dec 7, 2019
DS
breadth-first-search
data-structures
graph-algorithm
+
–
2
answers
10
GATE CSE 2001 | Question: 6
Give a deterministic PDA for the language $L=\{a^ncb^{2n} \mid n \geq 1\}$ over the alphabet $\Sigma = \{a,b,c\}$. Specify the acceptance state.
Give a deterministic PDA for the language $L=\{a^ncb^{2n} \mid n \geq 1\}$ over the alphabet $\Sigma = \{a,b,c\}$. Specify the acceptance state.
5.0k
views
commented
Dec 1, 2019
Theory of Computation
gatecse-2001
theory-of-computation
normal
pushdown-automata
descriptive
+
–
1
answer
11
MadeEasy Test Series 2019: Algorithms - Time complexity
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c,like cant we take both the recurrance call as combined as both have same parameter?and if not, then ...
775
views
commented
Nov 25, 2019
Algorithms
time-complexity
algorithms
made-easy-test-series
asymptotic-notation
+
–
2
answers
12
Fragmentation
Consider a TCP message that contains 1024 bytes of data and 20 bytes of TCP header is passed to IP for delivery across two networks interconnected by a router (i.e., it travels from the source host to a router to the destination host). The first network has ... the IP layer at the destination for TCP message, in the best case is _________ bytes. (Assume all IP headers are 20 bytes)
Consider a TCP message that contains 1024 bytes of data and 20 bytes of TCP header is passed to IP for delivery across two networks interconnected by a router (i.e., it t...
2.6k
views
commented
Nov 11, 2019
Computer Networks
fragmentation
computer-networks
+
–
2
answers
13
GATE IT 2008 | Question: 68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only
Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals wit...
15.8k
views
commented
Oct 3, 2019
Computer Networks
gateit-2008
computer-networks
network-protocols
normal
+
–
2
answers
14
Understanding Np-hard
I am having difficulty in understanding np and np-hard topic in algorithms. If someone can provide some good source to learn about it in easy manner it would be a real help. Thank you!
I am having difficulty in understanding np and np-hard topic in algorithms. If someone can provide some good source to learn about it in easy manner it would be a real he...
668
views
asked
Sep 22, 2019
Algorithms
p-np-npc-nph
algorithms
+
–
5
answers
15
TIFR CSE 2010 | Part B | Question: 26
Suppose there is a balanced binary search tree with $n$ nodes, where at each node, in addition to the key, we store the number of elements in the sub tree rooted at that node. Now, given two elements $a$ and $b$, such that $a < b$ ... $O(n)$ comparisons and $O(n)$ additions, using depth-first- search.
Suppose there is a balanced binary search tree with $n$ nodes, where at each node, in addition to the key, we store the number of elements in the sub tree rooted at that ...
8.7k
views
commented
Aug 14, 2019
DS
tifr2010
binary-search-tree
+
–
2
answers
16
TIFR CSE 2013 | Part B | Question: 13
Given a binary tree of the following form and having $n$ nodes, the height of the tree is $\Theta \left(\log n\right)$ $\Theta \left(n\right)$ $\Theta \left(\sqrt{n}\right)$ $\Theta \left(n / \log n\right)$ None of the above.
Given a binary tree of the following form and having $n$ nodes, the height of the tree is$\Theta \left(\log n\right)$$\Theta \left(n\right)$$\Theta \left(\sqrt{n}\right)$...
3.4k
views
commented
Aug 12, 2019
DS
tifr2013
binary-tree
data-structures
+
–
2
answers
17
ISI2015-PCB-CS-3a
Consider a linked list containing $n$ nodes, where each node contains two pointers $ptr1$ and $ptr2$. For each node, $ptr1$ points to the next node of the list. Describe how pointer $ptr2$ should be set up for each node so that you will be able to locate the $i$-th node from the start node in the list traversing no more than $[\log\: i] + [i/2]$ nodes.
Consider a linked list containing $n$ nodes, where each node contains two pointers $ptr1$ and $ptr2$. For each node, $ptr1$ points to the next node of the list. Describe ...
1.7k
views
commented
Aug 7, 2019
DS
descriptive
isi2015-pcb-cs
data-structures
linked-list
+
–
4
answers
18
GATE CSE 1990 | Question: 10b
One giga bytes of data are to be organized as an indexed-sequential file with a uniform blocking factor $8.$ Assuming a block size of $1$ Kilo bytes and a block refrencing pointer size of $32$ bits, find out the number of levels of indexing ... size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
One giga bytes of data are to be organized as an indexed-sequential file with a uniform blocking factor $8.$ Assuming a block size of $1$ Kilo bytes and a block refrencin...
6.3k
views
commented
Jul 27, 2019
Databases
gate1990
databases
indexing
descriptive
+
–
5
answers
19
TIFR CSE 2010 | Part B | Question: 33
In a relational database there are three relations: $Customers = C \textsf{(CName)}$ $Shops = S \textsf{(SName)}$ $Buys = B \textsf{(CName, SName)}$ Then the Relational Algebra expression ( $\Pi $ ... from at least two shops. Customers who buy from all shops. Customers who do not buy buy anything at all. None of the above.
In a relational database there are three relations:$Customers = C \textsf{(CName)}$$Shops = S \textsf{(SName)}$$Buys = B \textsf{(CName, SName)}$Then the Relational Algeb...
3.7k
views
commented
Jul 24, 2019
Databases
tifr2010
databases
relational-algebra
+
–
5
answers
20
GATE CSE 1992 | Question: 02,ix
Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ time Heap sort Quick sort Merge sort Radix sort
Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ timeHeap sortQuick sortMerge sortRadix sort
16.5k
views
commented
Apr 25, 2019
Algorithms
gate1992
easy
algorithms
sorting
multiple-selects
+
–
5
answers
21
GATE CSE 2005 | Question: 82b
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges ... spanning tree a weighted shortest path from $s$ to $t$ an Euler walk from $s$ to $t$ a Hamiltonian path from $s$ to $t$
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$...
6.4k
views
commented
Apr 24, 2019
Algorithms
gatecse-2005
algorithms
graph-algorithms
normal
+
–
7
answers
22
GATE CSE 2001 | Question: 2.14
Consider an undirected, unweighted graph $G$. Let a breadth-first traversal of $G$ be done starting from a node $r$. Let $d(r,u)$ and $d(r,v)$ be the lengths of the shortest paths from $r$ to $u$ and $v$ respectively in $G$. If $u$ is visited before $v$ during the breadth- ... correct? $d(r,u) < d(r,v)$ $d(r,u) > d(r,v)$ $d(r,u) \leq d(r,v)$ None of the above
Consider an undirected, unweighted graph $G$. Let a breadth-first traversal of $G$ be done starting from a node $r$. Let $d(r,u)$ and $d(r,v)$ be the lengths of the short...
13.9k
views
commented
Apr 24, 2019
Algorithms
gatecse-2001
algorithms
graph-algorithms
normal
graph-search
+
–
6
answers
23
GATE IT 2008 | Question: 41
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Recently Used (LRU) page replacement policy. $\text{0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92}$ How many ... $1, 2, 3, 4$ $7$ and $1, 2, 4, 5$ $8$ and $1, 2, 4, 5$ $9$ and $1, 2, 3, 5$
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Re...
23.5k
views
commented
Mar 18, 2019
Operating System
gateit-2008
operating-system
page-replacement
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register