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 shraddha_gami
1
answer
1
T(n)=2T(floor(sqrt(n))+log n
the solution of recurrence relation T(n)=2T(floor(sqrt(n))+log n
the solution of recurrence relationT(n)=2T(floor(sqrt(n))+log n
18.8k
views
commented
Aug 16, 2018
Algorithms
algorithms
recurrence-relation
+
–
3
answers
2
Gate 2018
Value of V GREEDY - V OPT
Value of V GREEDY - V OPT
1.9k
views
commented
Feb 4, 2018
Algorithms
gatecse-2018
greedy-algorithm
+
–
2
answers
3
Gate 2018
Any one solve the safe stat question , Max need given and available resources are giveen and they ask about the question where state safe or not
Any one solve the safe stat question ,Max need given and available resources are giveen and they ask about the question where state safe or not
704
views
commented
Feb 4, 2018
0
answers
4
Test Series
Consider a system with cache access time of 10ns and main memory access time of 100ns. If the simultaneous memory access it used what is the average memory access time if the cache hit ratio is 0.92.( Marks: -0.33 ) 1. 18ns 2. 22ns 3. 17.2ns 4. 20ns
Consider a system with cache access time of 10ns and main memory access time of 100ns. If the simultaneous memory access it used what is the average memory access time if...
210
views
commented
Jan 24, 2018
1
answer
5
Identify class of the language
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
583
views
commented
Jan 24, 2018
Theory of Computation
theory-of-computation
+
–
1
answer
6
theory of computation
(o^(n))^(m)|n<m;n,m>=1 is it regular
(o^(n))^(m)|n<m;n,m>=1is it regular
242
views
commented
Jan 24, 2018
4
answers
7
2Darray
Consider a 2D array with elemnts stored in the form of lower triangular matrix.The elements must be crossed to read A[4,2] from the array [-6..................+8 , -6..........+8 ] is
Consider a 2D array with elemnts stored in the form of lower triangular matrix.The elements must be crossed to read A[4,2] from the array [-6..................+8 , -6.......
5.5k
views
commented
Jan 24, 2018
1
answer
8
MadeEasy Test Series 2018: Compiler Design - Syntax Directed Translation
Consider the following schema shown below: Here num' is a token that represents an integer and num.val represents the corresponding integer value. For an input string 2 + 3 + 7 5 ... d:) + 2 3 7 5 I am not able to generate any option.Please verify?
Consider the following schema shown below:Here ‘num’ is a token that represents an integer and num.val represents the corresponding integer value. For an input string...
705
views
commented
Jan 24, 2018
Compiler Design
compiler-design
syntax-directed-translation
made-easy-test-series
+
–
3
answers
9
How many DFA's exist with three states over the input alphabet {0,1}
Is there any procedure to generalize these types of problems ? Thanks in advance
Is there any procedure to generalize these types of problems ? Thanks in advance
16.5k
views
commented
Dec 30, 2017
Theory of Computation
theory-of-computation
combinatory
finite-automata
number-of-dfa
+
–
2
answers
10
explain the output please.
#include <stdio.h> #include <string.h> void fun(char *arr) { int i; unsigned int n = sizeof(arr); printf("n = %d\n", n); for (i=0; i<n; i++) printf("%c ", arr[i]); } // Driver program int main() { char arr[] = {'k', 'h', 'u', 's', 'h', 'a', 'l'}; fun(arr); return 0; }
#include <stdio.h>#include <string.h>void fun(char *arr){int i;unsigned int n = sizeof(arr);printf("n = %d\n", n);for (i=0; i<n; i++) printf("%c ", arr[i]);}// Driver pro...
1.6k
views
commented
Jul 10, 2017
Programming in C
programming-in-c
+
–
2
answers
11
GATE CSE 1991 | Question: 03-ii
Advantage of synchronous sequential circuits over asynchronous ones is: faster operation ease of avoiding problems due to hazards lower hardware requirement better noise immunity none of the above
Advantage of synchronous sequential circuits over asynchronous ones is:faster operationease of avoiding problems due to hazardslower hardware requirementbetter noise immu...
8.6k
views
commented
May 8, 2017
Digital Logic
gate1991
digital-logic
normal
sequential-circuit
synchronous-asynchronous-circuits
multiple-selects
+
–
9
answers
12
ISRO2017-22
Which one of the following Boolean expressions is NOT a tautology? $((a \rightarrow b) \wedge (b \rightarrow c)) \rightarrow (a \rightarrow c)$ $(a \leftrightarrow c) \rightarrow (\sim b\rightarrow (a\wedge c))$ $(a\wedge b \wedge c)\rightarrow (c \vee a)$ $a\rightarrow (b\rightarrow a)$
Which one of the following Boolean expressions is NOT a tautology?$((a \rightarrow b) \wedge (b \rightarrow c)) \rightarrow (a \rightarrow c)$$(a \leftrightarrow c) \rig...
7.4k
views
commented
May 8, 2017
Mathematical Logic
isro2017
mathematical-logic
propositional-logic
+
–
7
answers
13
GATE CSE 1994 | Question: 1.7, ISRO2017-14
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
The recurrence relation that arises in relation with the complexity of binary search is:$T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$$T(n) = T\left(\fra...
18.1k
views
commented
May 8, 2017
Algorithms
gate1994
algorithms
recurrence-relation
easy
isro2017
+
–
4
answers
14
ISRO2017-30
If there are $n$ devices (nodes) in a network, what is the number of cable links required for a fully connected mesh and a star topology respectively $n(n-1)/2$, $n-1$ $n$, $n-1$ $n-1$, $n$ $n-1$, $n(n -1)/ 2$
If there are $n$ devices (nodes) in a network, what is the number of cable links required for a fully connected mesh and a star topology respectively$n(n-1)/2$, $n-1$$n$,...
8.8k
views
commented
May 7, 2017
Computer Networks
isro2017
computer-networks
network-topologies
+
–
2
answers
15
ISRO2017-46
SATA is the abbreviation of Serial Advanced Technology Attachment Serial Advanced Technology Architecture Serial Advanced Technology Adapter Serial Advanced Technology Array
SATA is the abbreviation ofSerial Advanced Technology AttachmentSerial Advanced Technology ArchitectureSerial Advanced Technology AdapterSerial Advanced Technology Array
2.8k
views
commented
May 7, 2017
Computer Peripherals
isro2017
computer-peripherals
non-gate
+
–
6
answers
16
GATE CSE 1994 | Question: 1.4, ISRO2017-2
Let $A$ and $B$ be any two arbitrary events, then, which one of the following is TRUE? $P (A \cap B) = P(A)P(B)$ $P (A \cup B) = P(A)+P(B)$ $P (A \mid B) = P(A \cap B)P(B)$ $P (A \cup B) \leq P(A) + P(B)$
Let $A$ and $B$ be any two arbitrary events, then, which one of the following is TRUE?$P (A \cap B) = P(A)P(B)$$P (A \cup B) = P(A)+P(B)$$P (A \mid B) = P(A \cap B)P(B)$$...
14.0k
views
commented
May 7, 2017
Probability
gate1994
probability
conditional-probability
normal
isro2017
+
–
2
answers
17
Solve using Recursion Tree method when both parts are unequal
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
1.7k
views
commented
May 7, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
3
answers
18
Minimization of DFA
DFA for Every 'a' followed by 'b'. The second one is correct but I want to know if the first one is correct or not? If not please share an example.
DFA for Every 'a' followed by 'b'. The second one is correct but I want to know if the first one is correct or not? If not please share an example.
1.8k
views
commented
May 7, 2017
2
answers
19
ISRO2017-71
At a particular time the value of counting semaphore is 10. It will become 7 after: 3 V operations 3 P operations 5 V operations and 2 P operations 2 V operations and 5 P operations
At a particular time the value of counting semaphore is 10. It will become 7 after:3 V operations3 P operations5 V operations and 2 P operations2 V operations and 5 P ope...
13.6k
views
commented
May 7, 2017
Operating System
isro2017
operating-system
semaphore
+
–
3
answers
20
C programming
void main() { unsigned char var=0; for(var=0;var<=255;var++) { printf("%d ",var); } } What is output of this code?
void main() { unsigned char var=0; for(var=0;var<=255;var++) { printf("%d ",var); } }What is output of this code?
3.2k
views
commented
Apr 15, 2017
Programming in C
programming-in-c
+
–
2
answers
21
c macro
#include <stdio.h> #define foo(a,b) #b int main(void) { int a=10,b=15,ab=20; // your code goes here printf("%d",ab+foo(a,b)); return 0; } What is the output?
#include <stdio.h #define foo(a,b) #b int main(void) { int a=10,b=15,ab=20; // your code goes here printf("%d",ab+foo(a,b)); return 0; } What is the output?
781
views
commented
Apr 15, 2017
DS
programming-in-c
+
–
1
answer
22
geeksforgeeks
Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks like this: 16 14 15 10 12 27 28 How many heapify operations have been performed on root of heap? (A) 1 (B) 2 (C) 3 or 4 (D) 5 or 6 Answer: (B)
Suppose we are sorting an array of eight integers using heapsort, and we have just finished some heapify (either maxheapify or minheapify) operations. The array now looks...
9.1k
views
commented
Apr 14, 2017
Algorithms
sorting
binary-heap
heap-sort
+
–
5
answers
23
Meta: Suggestions to improve GATE Overflow
Mention your dislikes about the site and suggest improvements if any
Mention your dislikes about the site and suggest improvements if any
1.2k
views
commented
Apr 14, 2017
Others
meta
site-improvement
gateoverflow
+
–
2
answers
24
GATE CSE 1996 | Question: 1.11
Which of the following is false? $100n \log n=O(\frac{n\log n}{100})$ $\sqrt{\log n} = O(\log\log n)$ If $0 < x < y \text{ then } n^x = O\left(n^y\right)$ $2^n \neq O\left(nk\right)$
Which of the following is false?$100n \log n=O(\frac{n\log n}{100})$$\sqrt{\log n} = O(\log\log n)$If $0 < x < y \text{ then } n^x = O\left(n^y\right)$$2^n \neq O\left(nk...
19.5k
views
commented
Apr 13, 2017
Algorithms
gate1996
algorithms
asymptotic-notation
normal
+
–
5
answers
25
GATE CSE 2014 Set 1 | Question: 16
Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$? $\{q_0,q_1,q_2\}$ $\{q_0,q_1\}$ $\{q_0,q_1,q_2,q_3\}$ $\{q_3\}$
Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$?$\{q_0,q_1,q_2\}$$\{q_0,q_1\}$$\{q_0,q_1,q_2,q_3\}$...
15.0k
views
commented
Apr 13, 2017
Theory of Computation
gatecse-2014-set1
theory-of-computation
finite-automata
easy
+
–
2
answers
26
GATE CSE 2001 | Question: 1.4
Consider the following two statements: $S_1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language $S_2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \right\}$ is a regular language Which of the following statement is correct? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Consider the following two statements:$S_1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language$S_2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \ri...
14.8k
views
commented
Apr 13, 2017
Theory of Computation
gatecse-2001
theory-of-computation
easy
regular-language
+
–
11
answers
27
GATE IT 2007 | Question: 28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...
29.4k
views
commented
Apr 12, 2017
DS
gateit-2007
data-structures
hashing
probability
normal
+
–
8
answers
28
GATE CSE 2014 Set 3 | Question: 39
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$...
31.6k
views
commented
Apr 11, 2017
DS
gatecse-2014-set3
data-structures
binary-search-tree
numerical-answers
normal
+
–
1
answer
29
cache miss
468
views
commented
Mar 11, 2017
CO and Architecture
co-and-architecture
cache-memory
+
–
0
answers
30
Depth first search
Consider the following graph G. Modified DFS on G applied as follows: • Starting vertex is ‘p’. • Vertex is visited based on alphabetic order. • Vertices are visited in order p, q, r, s, t, v. • It works same as DFS except the visiting order restriction What is the number of back edges during the above DFS traversal on G? a. 2 b. 3 c. 4 d. 5 Explain...how??
Consider the following graph G.Modified DFS on G applied as follows:• Starting vertex is ‘p’.• Vertex is visited based on alphabetic order.• Vertices are visite...
1.1k
views
commented
Feb 9, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register