Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
prasitamukherjee
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by prasitamukherjee
3
answers
1
Theory of computation
Write a regular expression for the string having 3 consequetive 1s
Write a regular expression for the string having 3 consequetive 1s
571
views
commented
Apr 6, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
2
Set theory
Justify your answer with valid reason $\phi \epsilon \left \{ A \right \} \wedge \phi \subseteq \left \{ A \right \}$ Where A is an non empty set $\left | A \right | \neq 0$
Justify your answer with valid reason$\phi \epsilon \left \{ A \right \} \wedge \phi \subseteq \left \{ A \right \}$Where A is an non empty set $\left | A \right | \neq 0...
612
views
commented
Apr 3, 2017
Set Theory & Algebra
set-theory&algebra
set-theory
+
–
1
answer
3
Set theory
Let S be a set of n elements and let p(S) be its power set. Then find total number of ordered pairs such that $s1 \cap s2 = \phi$ where s1 & s2 are subset of p(s)
Let S be a set of n elements and let p(S) be its power set. Then find total number of ordered pairs such that $s1 \cap s2 = \phi$ where s1 & s2 are subset of p(s)
455
views
answered
Apr 3, 2017
Set Theory & Algebra
set-theory&algebra
set-theory
+
–
7
answers
4
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All...
32.9k
views
commented
Feb 22, 2017
Operating System
gatecse-2017-set1
operating-system
process-synchronization
normal
+
–
1
answer
5
Count(*) when one of the tuple has null values in all column?
Ideally Count(*) will count no of rows in which atleast one column is Non NULL otherwise discard that row. Is this statement true? But when I am trying practically it is returning the count including the null tuple where all columns ... // Returning 2 rows which is correct select count(*) from stud; // Returning 4 rows. Is this correct?
Ideally Count(*) will count no of rows in which atleast one column is Non NULL otherwise discard that row. Is this statement true?But when I am trying practically it is ...
1.5k
views
answered
Feb 12, 2017
Databases
databases
sql
+
–
1
answer
6
Gate 2017 Set-1 Min Reg/Nor gates
Could somone pls confirm what is the ans for min NOR gates and min number of Registers? Also what was the marks distribution for Memory Leal/Malloc DS question?
Could somone pls confirm what is the ans for min NOR gates and min number of Registers?Also what was the marks distribution for Memory Leal/Malloc DS question?
477
views
answered
Feb 12, 2017
Digital Logic
digital-logic
co-and-architecture
+
–
2
answers
7
GATE 2017 Set 2 - COA
In Gate 2017 Afternoon session there was a que where they asked for Tag Size in bit. So in this que tag bit was 18 . But to calculate tag size i think we should multiply it with number of Lines i.e 18*29 Note : No. of Lines was given in que. Is my approach is right?
In Gate 2017 Afternoon session there was a que where they asked for Tag Size in bit.So in this que tag bit was 18 .But to calculate tag size i think we should multiply it...
1.4k
views
answered
Feb 12, 2017
CO and Architecture
cache-memory
+
–
3
answers
8
Gate 2017 Set-1 first order logic
Consider following first order logic $\forall x ( \exists y R( x, y ) )$ is equivalent to 1) $\exists y ( \exists x R( x, y ) )$ 2) $\exists y ( \forall x R( x, y ) )$ 3) $\forall y ( \exists x R( x, y ) )$ 4) $\neg \exists x ( \forall y \neg R(x,y) )$ Note: Not sure in the question was it equivalent to or which of these are implied by
Consider following first order logic$\forall x ( \exists y R( x, y ) )$ is equivalent to1) $\exists y ( \exists x R( x, y ) )$2) $\exists y ( \forall x R( x, y ) )$3) $\f...
2.3k
views
answered
Feb 12, 2017
Mathematical Logic
discrete-mathematics
first-order-logic
+
–
10
answers
9
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 ...
21.5k
views
answered
Feb 12, 2017
Algorithms
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
+
–
10
answers
10
GATE CSE 2017 Set 1 | Question: 6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are:Note: The height of a tree with a single node is $0$.$4$ and $15$ res...
16.6k
views
answered
Feb 12, 2017
DS
gatecse-2017-set1
data-structures
binary-search-tree
easy
+
–
12
answers
11
GATE CSE 2017 Set 1 | Question: 44
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the ...
23.7k
views
answered
Feb 12, 2017
Computer Networks
gatecse-2017-set1
network-security
computer-networks
rsa-security-networks
out-of-gate-syllabus
numerical-answers
normal
+
–
5
answers
12
GateBook Mock-Test-2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how m...
7.4k
views
commented
Feb 8, 2017
Computer Networks
computer-networks
gatebook-mt2
ip-packet
+
–
1
answer
13
Linked list time complexity
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is. a) O(n) and O(nlogn) b) O(n) and O(n) c) O(nlogn) and O(nlogn) d) O(nlogn) and O(n)
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is.a) O(n) and O(nlogn)b) O(n) and O(n)c) O(nlogn) ...
1.6k
views
answered
Feb 8, 2017
Algorithms
algorithms
time-complexity
+
–
2
answers
14
maxima minima made easy
Consider the function f (x) = sin x in the interval X<--[pi/4, 7pi/4]. The number of location/s of the local minima are __________ .
Consider the function f (x) = sin x in the interval X< [pi/4, 7pi/4]. The number of location/s of the local minima are __________ .
637
views
answered
Feb 8, 2017
1
answer
15
MadeEasy Subject Test: Databases - Sql
639
views
commented
Feb 7, 2017
Databases
made-easy-test-series
databases
sql
+
–
7
answers
16
GATE CSE 2003 | Question: 65
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in...
9.9k
views
commented
Jan 16, 2017
Databases
gatecse-2003
databases
b-tree
normal
+
–
6
answers
17
GATE CSE 2006 | Question: 67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank $1.$ Ties are not broke but ranks are skipped: if ... of the above statements are correct? $2$ and $5$ $1$ and $3$ $1$ and $4$ $3$ and $5$
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasin...
20.9k
views
commented
Jan 15, 2017
Databases
gatecse-2006
databases
sql
normal
+
–
1
answer
18
GATE IT 2007 | Question: 33
Consider the program below in a hypothetical language which allows global variable and a choice of call by reference or call by value methods of parameter passing. int i ; program main () { int j = 60; i = 50; call f (i, j); print i, j; } procedure f (x, y) { i = 100; x ... :$ i = 100, j = 60$ Call by value : $i = 100, j = 60$; Call by reference :$ i = 10, j = 70$
Consider the program below in a hypothetical language which allows global variable and a choice of call by reference or call by value methods of parameter passing. ...
8.5k
views
commented
Jan 15, 2017
Compiler Design
gateit-2007
programming
parameter-passing
normal
compiler-design
runtime-environment
+
–
5
answers
19
GATE IT 2007 | Question: 41
Following table indicates the latencies of operations between the instruction producing the result and instruction using the result. ... to execute the above code segment assuming each instruction takes one cycle to execute? $7$ $10$ $13$ $14$
Following table indicates the latencies of operations between the instruction producing the result and instruction using the result.$$\begin{array}{|l|l|c|} \hline \textb...
23.2k
views
commented
Jan 15, 2017
CO and Architecture
gateit-2007
co-and-architecture
machine-instruction
normal
+
–
8
answers
20
GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a mess...
18.7k
views
commented
Jan 14, 2017
Computer Networks
gateit-2007
computer-networks
routing
binary-tree
normal
+
–
1
answer
21
GATE CSE 2011 | Question: 35
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$ ... of processes. What is the average waiting time for the three processes? $5.0$ ms $4.33$ ms $6.33$ ms $7.33$ ms
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$$$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arriva...
12.5k
views
commented
Jan 14, 2017
Operating System
gatecse-2011
operating-system
process-scheduling
normal
+
–
5
answers
22
GATE IT 2008 | Question: 31
If $f(x)$ is defined as follows, what is the minimum value of $f(x)$ for $x \in (0, 2]$ ? $f(x) = \begin{cases} \frac{25}{8x} &\text{ when } x \leq \frac{3}{2} \\ x+ \frac{1}{x} &\text { otherwise}\end{cases}$ $2$ $2 \frac{1}{12}$ $2\frac{1}{6}$ $2\frac{1}{2}$
If $f(x)$ is defined as follows, what is the minimum value of $f(x)$ for $x \in (0, 2]$ ?$$f(x) = \begin{cases} \frac{25}{8x} &\text{ when } x \leq \frac{3}{2} \\ x+ \fr...
7.6k
views
commented
Jan 12, 2017
Calculus
gateit-2008
calculus
maxima-minima
normal
+
–
5
answers
23
GATE CSE 2009 | Question: 39
In quick-sort, for sorting $n$ elements, the $\left(n/4\right)^{th}$ smallest element is selected as pivot using an $O(n)$ time algorithm. What is the worst case time complexity of the quick sort? $\Theta(n)$ $\Theta(n \log n)$ $\Theta(n^2)$ $\Theta(n^2 \log n)$
In quick-sort, for sorting $n$ elements, the $\left(n/4\right)^{th}$ smallest element is selected as pivot using an $O(n)$ time algorithm. What is the worst case time com...
21.2k
views
commented
Jan 11, 2017
Algorithms
gatecse-2009
algorithms
sorting
normal
+
–
8
answers
24
GATE CSE 2009 | Question: 55
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... of all suppliers who have supplied only non-blue part. Find the names of all suppliers who have not supplied only blue parts.
Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...
38.2k
views
commented
Jan 11, 2017
Databases
gatecse-2009
databases
sql
normal
+
–
7
answers
25
GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maxi...
29.9k
views
commented
Jan 11, 2017
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
+
–
1
answer
26
GATE CSE 2011 | Question: 44
An application loads $100$ libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as $10$ ms. Rotational speed of disk is $6000$ rpm. If all $100$ libraries are loaded from random locations on the disk, how ... start of the block may be neglected.) $0.50 \ s$ $1.50 \ s$ $1.25 \ s$ $1.00 \ s$
An application loads $100$ libraries at startup. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as $10$ ms...
13.2k
views
commented
Jan 10, 2017
Operating System
gatecse-2011
operating-system
disk
normal
+
–
2
answers
27
Frequency of output signal?
I got the ans as 1/(5*25) = 1/125. None of the, match
I got the ans as 1/(5*25) = 1/125. None of the, match
658
views
commented
Jan 5, 2017
Digital Logic
digital-logic
clock-frequency
digital-counter
+
–
3
answers
28
How is this lexical error ?
5.6k
views
answer selected
Dec 18, 2016
Compiler Design
compiler-design
lexical-analysis
test-series
+
–
1
answer
29
Number of stall cycles for given speed up
Anyone? I know my answer is wrong.
Anyone? I know my answer is wrong.
448
views
commented
Dec 12, 2016
CO and Architecture
stall
co-and-architecture
speedup
+
–
2
answers
30
Is Thomas's write rule and basic write rule followed here?
Here Read_TS(X) = 30 when T1 reads X; Now when T3 goes to write X, it's timestamp is 20. Hence TS(T) = 20 But Read_TS(X) > TS(T) . Both rules don't allow this! How is b correct?
Here Read_TS(X) = 30 when T1 reads X; Now when T3 goes to write X, it's timestamp is 20. Hence TS(T) = 20But Read_TS(X) TS(T) . Both rules don't allow this!How is b corr...
794
views
commented
Nov 23, 2016
Databases
databases
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register