Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Tesla!
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Tesla!
2
answers
1
CMI2017-B-7
Consider the following function that takes as input a sequence $A$ of integers with n elements,$A[1],A[2], \dots ,A[n]$ and an integer $k$ and returns an integer value. The function length$(S)$ returns the length of the sequence $S$. Comments ... complexity of this algorithm in terms of the length of the input sequence $A$? Give an example of a worst-case input for this algorithm.
Consider the following function that takes as input a sequence $A$ of integers with n elements,$A ,A , \dots ,A[n]$ and an integer $k$ and returns an integer value. The f...
1.4k
views
commented
Sep 26, 2019
Algorithms
cmi2017
algorithms
time-complexity
descriptive
+
–
4
answers
2
Minimum number of tables to represent ER-Diagram
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
11.5k
views
commented
Aug 22, 2019
Databases
er-diagram
databases
er-to-relational
relational
+
–
5
answers
3
GATE2017 CE-2: GA-4
What is the value of $x$ when $81\times\left (\frac{16}{25} \right )^{x+2}\div\left (\frac{3}{5} \right )^{2x+4}=144?$ $1$ $-1$ $-2$ $\text{Can not be determined}$
What is the value of $x$ when $81\times\left (\frac{16}{25} \right )^{x+2}\div\left (\frac{3}{5} \right )^{2x+4}=144?$$1$$-1$$-2$$\text{Can not be determined}$
2.6k
views
commented
May 31, 2019
Quantitative Aptitude
gate2017-ce-2
ratio-proportions
quantitative-aptitude
+
–
1
answer
4
Peter Linz Edition 4 Exercise 5.2 Question 15 (Page No. 145)
Show that the grammar with productions $S\rightarrow SS,$ $S\rightarrow \lambda,$ $S\rightarrow aSb,$ $S\rightarrow bSa.$ is ambiguous.
Show that the grammar with productions$S\rightarrow SS,$$S\rightarrow \lambda,$$S\rightarrow aSb,$$S\rightarrow bSa.$is ambiguous.
322
views
commented
Apr 17, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
grammar
ambiguous
+
–
4
answers
5
ISI2017-MMA-27
A box contains $5$ fair and $5$ biased coins. Each biased coin has a probability of head $\frac{4}{5}$. A coin is drawn at random from the box and tossed. Then the second coin is drawn at random from the box ( without replacing the first one). Given that the first coin has shown head ... the second coin is fair is $\frac{20}{39}\\$ $\frac{20}{37}\\$ $\frac{1}{2}\\$ $\frac{7}{13}$
A box contains $5$ fair and $5$ biased coins. Each biased coin has a probability of head $\frac{4}{5}$. A coin is drawn at random from the box and tossed. Then the second...
2.6k
views
commented
Apr 5, 2019
Probability
isi2017-mma
engineering-mathematics
probability
+
–
5
answers
6
GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $...
13.7k
views
commented
Mar 25, 2019
Operating System
gateit-2005
operating-system
disk
normal
+
–
2
answers
7
GATE Overflow | Algorithms | Test 1 | Question: 18
Time complexity of the optimal algorithm to interchange the $m^{th}$ and $n^{th}$ elements of a singly Linked List is $\Theta(m+n)$ $\Theta(m)$ when $m\geq n$ otherwise $\Theta(n)$ $\Theta(m)$ if $m \leq n$ otherwise $\Theta(n)$ $\Theta(m+ \min (m,n))$
Time complexity of the optimal algorithm to interchange the $m^{th}$ and $n^{th}$ elements of a singly Linked List is $\Theta(m+n)$$\Theta(m)$ when $m\geq n$ otherwise $...
561
views
commented
Mar 20, 2019
Algorithms
go-alogrithms-1
algorithms
linked-list
+
–
1
answer
8
Test by Bikram | Mock GATE | Test 4 | Question: 38
In a height balanced binary search tree, the heights of the left and right descendants of any node differ at most by $1.$ Which of the following statements are TRUE for such kind of tree? Worst case search time is logarithmic in the number of nodes. ... is logarithmic in the number of nodes. II and IV only I, II and IV I and III only I, III and IV
In a height balanced binary search tree, the heights of the left and right descendants of any node differ at most by $1.$ Which of the following statements are TRUE for s...
386
views
commented
Jan 15, 2019
DS
tbb-mockgate-4
data-structures
avl-tree
binary-search-tree
+
–
0
answers
9
made easy mock 2019
(i)A computer can have multiple MAC addresses (ii)A computer can have multiple IP addresses at different instances of time true/ false?? acc to me (i) false (ii)true
(i)A computer can have multiple MAC addresses(ii)A computer can have multiple IP addresses at different instances of timetrue/ false??acc to me(i) false (ii)true
801
views
commented
Jan 14, 2019
1
answer
10
Multi level paging
Im confused with multi level paging As per my understanding the outer most page table must be in main memory and not all inner page tables to be in memory in 2 level paging by this we can save the memory But with this, faults will be more and time ... if we use more levels of paging more faults wil be their Even then why we are using multi level paging Please can someone help me
Im confused with multi level pagingAs per my understanding the outer most page table must be in main memory and not all inner page tables to be in memory in 2 level pagin...
1.5k
views
answer edited
Jan 14, 2019
Operating System
memory-management
+
–
1
answer
11
Test by Bikram | Mock GATE | Test 4 | Question: 16
Consider a sorted array of $k+1$ elements, where the elements are first $k$ natural numbers $-\left \{ 1, 2, 3, 4, 5,\dots, k \right \}$ and any one of those $k$ numbers is repeated. The time complexity of best algorithm to find that repeated number is: $O\left ( k \right )$ $O\left ( k\log k \right )$ $O\left ( \log k \right )$ $O(1)$
Consider a sorted array of $k+1$ elements, where the elements are first $k$ natural numbers $-\left \{ 1, 2, 3, 4, 5,\dots, k \right \}$ and any one of those $k$ numbers ...
535
views
answer selected
Jan 9, 2019
Algorithms
tbb-mockgate-4
algorithms
time-complexity
+
–
2
answers
12
array
494
views
commented
Jan 9, 2019
Programming in C
array
data-structures
programming-in-c
+
–
7
answers
13
GATE CSE 2016 Set 1 | Question: 50
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ ... in the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n-1}$. In the code, function $\text{pmax}$ returns an inte...
47.1k
views
commented
Dec 29, 2018
Operating System
gatecse-2016-set1
operating-system
process-synchronization
difficult
ambiguous
+
–
2
answers
14
CMI2017-A-02
An FM radio channel has a repository of $10$ songs. Each day, the channel plays $3$ distinct songs that are chosen randomly from the repository. Mary decides to tune in to the radio channel on the weekend after her exams. What is the probability that no song gets repeated during ...
An FM radio channel has a repository of $10$ songs. Each day, the channel plays $3$ distinct songs that are chosen randomly from the repository.Mary decides to tune in to...
1.1k
views
commented
Dec 24, 2018
Probability
cmi2017
engineering-mathematics
probability
+
–
0
answers
15
General query
Is there internal fragmentation in continuous dynamic partitioning ? After the processes have been allocated the partitions according to their size , there is no internal fragmentation , I agree but what if some processes have completed their execution and left leaving behind the ... which has size smaller than the hole , then will it create a new partion of its size from the hole?
Is there internal fragmentation in continuous dynamic partitioning ?After the processes have been allocated the partitions according to their size , there is no internal ...
164
views
commented
Dec 20, 2018
2
answers
16
ISI2004-MIII: 12
The maximum possible value of $xy^2z^3$ subjected to condition $x,y,z \geq 0$ and $x+y+z=3$ is $1$ $\frac{9}{8}$ $\frac{9}{4}$ $\frac{27}{16}$
The maximum possible value of $xy^2z^3$ subjected to condition $x,y,z \geq 0$ and $x+y+z=3$ is$1$$\frac{9}{8}$$\frac{9}{4}$$\frac{27}{16}$
1.1k
views
commented
Dec 20, 2018
Calculus
isi2004
engineering-mathematics
maxima-minima
+
–
6
answers
17
TIFR CSE 2019 | Part A | Question: 1
Let $X$ be a set with $n$ elements. How many subsets of $X$ have odd cardinality? $n$ $2^n$ $2^{n/2}$ $2^{n-1}$ Can not be determined without knowing whether $n$ is odd or even
Let $X$ be a set with $n$ elements. How many subsets of $X$ have odd cardinality?$n$ $2^n$$2^{n/2}$$2^{n-1}$Can not be determined w...
3.4k
views
answered
Dec 19, 2018
Set Theory & Algebra
tifr2019
engineering-mathematics
discrete-mathematics
set-theory&algebra
set-theory
+
–
1
answer
18
Complement of CFL
How to prove that $\text{"complement of L }= \{WW^R \mid W \in \{a,b\}^*\} \text{ is CFL}" $?
How to prove that $\text{"complement of L }= \{WW^R \mid W \in \{a,b\}^*\} \text{ is CFL}" $?
5.1k
views
commented
Dec 10, 2018
Theory of Computation
context-free-language
theory-of-computation
+
–
0
answers
19
IP protocol sum
Error Correcting and Detecting Codes: The IP protocol implements Internet checksum over just the IP header. As the packet passes through the routers, one field called Time To Live (TTL) (8-bits long) in the IP header is decremented at each router. So ... checksum in the header. Is there a way to update the checksum without having to recalculate the checksum over the entire header?
Error Correcting and Detecting Codes: The IP protocol implements Internet checksum over just the IP header. As the packet passes through the routers, one field called Tim...
531
views
commented
Nov 28, 2018
Computer Networks
computer-networks
+
–
3
answers
20
Peter Linz Edition 4 Exercise 1.2 Question 18 (Page No. 29)
Assume $\sum = \left \{ a,b \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) = n_{b}\left ( w \right ) + 1 \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) > n_{b}\left ( w \right ) \right \}$ ...
Assume $\sum = \left \{ a,b \right \}$ $L = \left \{ w : n_{a}\left ( w \right ) = n_{b}\left ( w \right ) + 1 \right \}$$L = \left \{ w : n_{a}\left ( w \right ) n_{b}\...
1.2k
views
answer edited
Nov 22, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
grammar
+
–
1
answer
21
made easy 2019 Q33
how many of the following statements is incorrect regarding the time complexity of binary search tree,AVL Tree, min heap, binary tree? i assumed non existent elements are those which do not exists in a tree, acc to me only (a) is incorrect! because to find any element in BST, It takes O(n) time
how many of the following statements is incorrect regarding the time complexity of binary search tree,AVL Tree, min heap, binary tree?i assumed non existent elements are ...
2.1k
views
commented
Nov 11, 2018
1
answer
22
#Functional Depencency
max number of FD in a relation with 'n' attributes=$2^{2n}$ how this formula is obtained?
max number of FD in a relation with 'n' attributes=$2^{2n}$how this formula is obtained?
495
views
commented
Oct 28, 2018
Databases
database-normalization
databases
+
–
1
answer
23
Relation
State True or False? Empty set Φ is an equivalence relation.
State True or False?Empty set Φ is an equivalence relation.
1.8k
views
commented
Oct 10, 2018
Set Theory & Algebra
relations
+
–
0
answers
24
Semaphore
Will it causing deadlock? How do we fixed it? P1: P2: Wait(S); Wait(Q); Wait(Q); Wait(S); ........ ............. Signal(S); Signal(Q); Signal(Q); Signal(S);
Will it causing deadlock? How do we fixed it?P1: P2: Wait(S); Wait(Q); Wait(Q); Wait(S); ........ ............. Signal(S); Signal(Q); Signal(Q); Signal(S);
1.1k
views
commented
Oct 5, 2018
Operating System
operating-system
semaphore
process-synchronization
+
–
0
answers
25
internal path length of complete binary tree
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
1.8k
views
commented
Oct 2, 2018
Algorithms
al
binary-tree
data-structures
graph-algorithms
+
–
4
answers
26
GATE CSE 2004 | Question: 64
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... }\\\hline \end{array} The total number of clock cycles required to execute the program is $29$ $24$ $23$ $20$
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$\begin{array}{|l|l|c|} \hline \text {Instruction} & \text...
19.5k
views
commented
Oct 1, 2018
CO and Architecture
gatecse-2004
co-and-architecture
machine-instruction
normal
+
–
1
answer
27
MadeEasy Test Series: Theory Of Computation - Finite Automata
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
675
views
commented
Sep 29, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
myhill-nerode
finite-automata
+
–
1
answer
28
time complexity
If both of the algorithms A and B need O(nlogn) time then they both are equally efficient and finish in same amount of time. TRUE OR FALSE
If both of the algorithms A and B need O(nlogn) time then theyboth are equally efficient and finish in same amount of time.TRUE OR FALSE
576
views
commented
Sep 28, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
0
answers
29
Multi-level paging doubt
Consider a computer system using 2-level paging with TLB. The logical address supported is 32 bits. The page table is divided into 512 pages each of size 1KB. Page table entry size at 1st level is 2Bytes and that at the second level is 4 Bytes each. ... level PT)+$512*1KB$(At second level)=$544KB$ Is my analysis correct? Below is the visualisation what I see is happening.
Consider a computer system using 2-level paging with TLB. The logical address supported is 32 bits. The page table is divided into 512 pages each of size 1KB. Page table ...
929
views
commented
Sep 28, 2018
Operating System
memory-management
paging
operating-system
+
–
2
answers
30
time complexity
1.9k
views
answered
Sep 28, 2018
Algorithms
algorithms
time-complexity
test-series
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register