Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Utk
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Utk
1
answer
1
DFA Finite Automata
Construct a DFA to accept all strings (1+0)^ with an equal no of zeros and 1's ,such that each prefix has atmost one more zero then 1's and at most one more 1's then zeros .
Construct a DFA to accept all strings (1+0)^ with an equal no of zeros and 1's ,such that each prefix has atmost one more zero then 1's and at most one more 1's then zero...
3.6k
views
commented
Jun 13, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
2
ISI2014-PCB-A-1b
Let $x, y$ be two non-negative integers $< 2^{32}$. By $x \wedge y$ we mean the integer represented by the bitwise logical $AND$ of the 32- bit binary representations of $x$ and $y$. For example, if $x = 13$ and $y = 6$, then $x \wedge y$ ... the pseudo-code for the input $x = 13$? What will be the output of the pseudo-code for an arbitrary non-negative integer $x < 2^{32}$?
Let $x, y$ be two non-negative integers $< 2^{32}$. By $x \wedge y$ we mean the integer represented by the bitwise logical $AND$ of the 32- bit binary representations of ...
474
views
commented
May 30, 2016
Algorithms
descriptive
isi2014
algorithms
identify-function
+
–
0
answers
3
ISI2014-PCB-A-1a
Let $x=(x_1, x_2, \dots x_n) \in \{0,1\}^n$ By $H(x)$ we mean the number of 1's in $(x_1, x_2, \dots x_n)$. Prove that $H(x) = \frac{1}{2} (n-\Sigma^n_{i=1} (-1)^{x_i})$.
Let $x=(x_1, x_2, \dots x_n) \in \{0,1\}^n$ By $H(x)$ we mean the number of 1's in $(x_1, x_2, \dots x_n)$. Prove that $H(x) = \frac{1}{2} (n-\Sigma^n_{i=1} (-1)^{x_i})$....
340
views
commented
May 30, 2016
Quantitative Aptitude
descriptive
isi2014
quantitative-aptitude
proof
+
–
2
answers
4
Conditional Probability IITB (RA) 2016
This question was asked in IITB (RA) admissions 2016. I have two blue dice, with which I play a game. If I throw a double six (i.e. if I get two six on both the dices) then I win the game. I separately throw a red dice. If I get ... rolled the three die. I turn around to you and said, "I won!". What is the probability that I actually won the game?
This question was asked in IITB (RA) admissions 2016.I have two blue dice, with which I play a game. If I throw a double six (i.e. if I get two six on both the dices) the...
952
views
commented
May 28, 2016
Probability
probability
conditional-probability
gate-2016-admission
admissions
interview
+
–
1
answer
5
CMI2011-B-06b
Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We want to sort these disks in decreasing order according to their diameter so that the ... $\text{chapatis}$ between two big spoons and flipping the stack.) How many steps will your algorithm take in the worst case?
Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We wa...
480
views
answered
May 28, 2016
Algorithms
descriptive
cmi2011
algorithms
sorting
+
–
1
answer
6
what is the difference between while (*s++ = *t++) and while (*++s = *++t) ??
Both * and ++ have equal precedence with right to left associativity. So *s++ will be evaluated as *(s++) it means first increase the location of s to next location then get the value from that address and *++s will be evaluated as *(++s) it will also do the same thing then what is the difference ?
Both * and ++ have equal precedence with right to left associativity. So *s++ will be evaluated as *(s++) it means first increase the location of s to next location the...
845
views
commented
May 28, 2016
Programming in C
programming
+
–
1
answer
7
Probability IITB (RA) 2016
This question was asked in IITB (RA) 2016 admissions. Three person A, B and C each have a bag of five different coloured balls. All three bags have balls from same five colours. A grabs B and C's bag and took two balls without ... took two balls and put them in his bag without looking. What is the probability that all three bags have different coloured balls?
This question was asked in IITB (RA) 2016 admissions.Three person A, B and C each have a bag of five different coloured balls. All three bags have balls from same five co...
963
views
asked
May 19, 2016
Probability
probability
gate-2016-admission
admissions
iit-bombay
+
–
6
answers
8
GATE CSE 2016 Set 2 | Question: 15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is...
34.0k
views
commented
May 17, 2016
DS
gatecse-2016-set2
data-structures
linked-list
time-complexity
normal
algorithms
+
–
1
answer
9
Difference between an Activation Record and Program Control Block
What is the difference between an Activation Record and Program Control Block? Could anyone define each of them first, and then describe how they are different.
What is the difference between an Activation Record and Program Control Block?Could anyone define each of them first, and then describe how they are different.
1.1k
views
answered
May 15, 2016
Operating System
operating-system
compiler-design
activation-record
program-control-block
+
–
1
answer
10
Logic basic
Express each of these system specification using predicate , quantifiers and logical connectives 1) Every user has access to an electric mailbox 2) The system mailbox can be accessed by everyone in the the group if the system is locked 3) The firewall is in ... one router is functionally if the thoughput is between 100 kbps and 500kbps and the proxy server is not in a diagnostic mode
Express each of these system specification using predicate , quantifiers and logical connectives 1) Every user has access to an electric mailbox 2) The system mailbox can...
2.3k
views
commented
May 15, 2016
Mathematical Logic
mathematical-logic
+
–
2
answers
11
Is the following code legal?
void main() { typedef struct a aType; aType someVariable; struct a { int x; aType *b; }; }
void main() { typedef struct a aType; aType someVariable; struct a { int x; aType *b; }; }
623
views
answered
May 15, 2016
Programming in C
programming-in-c
test-series
+
–
2
answers
12
TIFR CSE 2014 | Part A | Question: 16
Let $x_{0}=1$ and $x_{n+1}= \frac{3+2x_{n}}{3+x_{n}}, n\geq 0$. $x_{\infty}=\displaystyle \lim_{n\rightarrow \infty}x_{n}$ is $\left(\sqrt{5}-1\right) / 2$ $\left(\sqrt{5}+1\right) / 2$ $\left(\sqrt{13}-1\right) / 2$ $\left(-\sqrt{13}-1\right) / 2$ None of the above
Let $x_{0}=1$ and$x_{n+1}= \frac{3+2x_{n}}{3+x_{n}}, n\geq 0$.$x_{\infty}=\displaystyle \lim_{n\rightarrow \infty}x_{n}$ is$\left(\sqrt{5}-1\right) / 2$$\left(\sqrt{5}+1\...
1.8k
views
commented
May 12, 2016
Calculus
tifr2014
limits
+
–
2
answers
13
os
what is meant by process in zombie state??? what are the cases that the process can be in zombie state
what is meant by process in zombie state???what are the cases that the process can be in zombie state
309
views
answered
May 3, 2016
1
answer
14
TIFR CSE 2010 | Part B | Question: 40
Which of the following statement is FALSE? All recursive sets are recursively enumerable. The complement of every recursively enumerable sets is recursively enumerable. Every Non-empty recursively enumerable set is the range of some totally recursive function. All finite sets are recursive. The complement of every recursive set is recursive.
Which of the following statement is FALSE?All recursive sets are recursively enumerable.The complement of every recursively enumerable sets is recursively enumerable.Ever...
2.5k
views
commented
Apr 18, 2016
Theory of Computation
tifr2010
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
1
answer
15
Model this toy by a Finite Automata
2.5k
views
commented
Apr 15, 2016
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
16
least significant digit of 2 ^ (3 * (10 ^ 100) )
Find the least significant digit of $2^{3 \times 10 ^ {100 }}$ 2 4 6 8
Find the least significant digit of $2^{3 \times 10 ^ {100 }}$2468
927
views
answered
Apr 15, 2016
Quantitative Aptitude
quantitative-aptitude
numerical-answers
+
–
2
answers
17
from swp
in what protocol or protocols, it is possible for the sender to receive an ack for a packet that falls outside of its current window a. stop and wait b. selective repeat c.gbn d. all of the above
in what protocol or protocols, it is possible for the sender to receive an ack for a packet that falls outside of its current window a. stop and wait b. select...
1.0k
views
commented
Apr 13, 2016
Computer Networks
computer-networks
sliding-window
+
–
2
answers
18
UGC NET CSE | June 2013 | Part 2 | Question: 3
While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used to measure which one of the following? Length of code Size of software Functionality of software None of the above
While estimating the cost of software, Lines Of Code (LOC) and Function Points (FP) are used to measure which one of the following?Length of codeSize of softwareFunctiona...
6.4k
views
answered
Apr 13, 2016
IS&Software Engineering
is&software-engineering
ugcnetcse-june2013-paper2
+
–
1
answer
19
check this
293
views
commented
Feb 2, 2016
1
answer
20
MadeEasy Test Series: Algorithms - Asymptotic Notations
Let $f(n)$ = Ω(n) and g(n) = O(f(n)). Then g(n) = _______ [Assume n>0 ] (a.) Ω(n) (b.) O(n) (c.) θ(n) (d.) Ω(1) According to me, the answer should be (b.) since, f(n) has lowest bound n and g(n) has f(n) as upper bound. Answer given is (d.) I am confused about the answer.
Let $f(n)$ = Ω(n) and g(n) = O(f(n)). Then g(n) = _______ [Assume n>0 ](a.) Ω(n)(b.) O(n)(c.) θ(n)(d.) Ω(1) According to me, the answer should be (b.) since, f(n) has...
593
views
answer selected
Feb 1, 2016
Algorithms
made-easy-test-series
algorithms
asymptotic-notation
+
–
2
answers
21
View serializable
S: T1(A)R2(B)W2(B)R2(A)W2(B)W1(A)R3(B)W3(B) Given schedule is view serializable ?
S: T1(A)R2(B)W2(B)R2(A)W2(B)W1(A)R3(B)W3(B) Given schedule is view serializable ?
745
views
commented
Feb 1, 2016
Databases
view-serializable
databases
transaction-and-concurrency
+
–
2
answers
22
MadeEasy Test Series: Algorithms - Time Complexity
$T(n)=2T(\frac{n}{2})+n\log n$ for n>=2 and T(1)=0, then T(n) is (a.) $O(n)$ (b.) $O(n \log n)$ (c.) $O( n (\log n)^{2})$ (d.) $O(n^{2})$ Answer given is (c.) The solution is done using subsitution, n = $2^{k}$ But if we do with Master's theorem, then we will get option (b.) and this a case for Master's theorem, right?
$T(n)=2T(\frac{n}{2})+n\log n$ for n>=2 and T(1)=0, then T(n) is(a.) $O(n)$(b.) $O(n \log n)$(c.) $O( n (\log n)^{2})$(d.) $O(n^{2})$ Answer given is (c.) The solution is...
484
views
answer selected
Jan 28, 2016
Algorithms
made-easy-test-series
algorithms
time-complexity
recurrence-relation
+
–
2
answers
23
MadeEasy Test Series: CO & Architecture - Pipelining
please check the answer...
please check the answer...
876
views
commented
Jan 22, 2016
CO and Architecture
made-easy-test-series
co-and-architecture
pipelining
operand-forwarding
+
–
2
answers
24
Tuple Relational Calculus
I believe since the variable 't' is a free variable, so option three should also be right. Second option is also correct?
I believe since the variable 't' is a free variable, so option three should also be right. Second option is also correct?
610
views
asked
Jan 22, 2016
Databases
relational-calculus
databases
+
–
1
answer
25
MadeEasy Test Series: Theory Of Computation - Decidability
Consider the following languages A={<M>|M is a TM and |L(M)| >= 3} B={<M>|M is a TM that accepts some string} Which of the following is correct? (a.) A is decidable, B is partially decidable (b.) A is ... decidable (c.) Both A and B are decidable (d.) Both A and B are partially decidable Answer given : (d.) But how?
Consider the following languagesA={<M>|M is a TM and |L(M)| >= 3}B={<M>|M is a TM that accepts some string}Which of the following is correct?(a.) A is decidable, B is par...
735
views
commented
Jan 20, 2016
Theory of Computation
made-easy-test-series
theory-of-computation
decidability
+
–
1
answer
26
Mathematical Logic Meaning of the given statements
Which predicate logic means, "There are at most two men in class"? $\forall x\forall y((Male(x)\wedge Male(y))\rightarrow (x=y \vee y=x)$ ... How do I know the meaning of the statements? I want to know the working steps.
Which predicate logic means, "There are at most two men in class"?$\forall x\forall y((Male(x)\wedge Male(y))\rightarrow (x=y \vee y=x)$$\exists x \exists y (Male(x)\wedg...
686
views
answer selected
Jan 18, 2016
Mathematical Logic
mathematical-logic
normal
+
–
1
answer
27
Maximum clock frequency for the circuit
In the following digital circuit shown above, the worst case delay is of 30 nsec and the AND gate has delay of 10 nsec. The maximum clock frequency of the circuit to operate is _ MHz. I calculated as follows : ... the flip-flop delay once? The solution gives the frequency as 14.2 MHz, adding the delay due to flip-flop twice. Why?
In the following digital circuit shown above, the worst case delay is of 30 nsec and the AND gate has delay of 10 nsec. The maximum clock frequency of the circuit to oper...
2.9k
views
asked
Jan 16, 2016
Digital Logic
digital-logic
clock-frequency
+
–
1
answer
28
Computing the dual of the boolean function
Suppose, $f(A,B,C,D) = \sum m(0,2,4,6)$ is a boolean expression, expressed in minterm form. How can I calculate and express the dual of the function? I have tried the method using the exact definition, but it turns out to be very cumbersome and prone to errors. Any other method?
Suppose, $f(A,B,C,D) = \sum m(0,2,4,6)$ is a boolean expression, expressed in minterm form. How can I calculate and express the dual of the function?I have tried the meth...
6.7k
views
answer selected
Jan 16, 2016
Digital Logic
dual-function
boolean-algebra
digital-logic
+
–
1
answer
29
MadeEasy Test Series: Operating System - Process
A process spends 20% of its execution time waiting for completion of I/O operation. If there are 4 such processes in memory at once, then the probability of CPU time wasted is _. (Assuming all I/O operations are overlapped) Answer ... with waiting time 't', then probability of CPU time utilization is $t^{n}$. How is this formula coming?
A process spends 20% of its execution time waiting for completion of I/O operation. If there are 4 such processes in memory at once, then the probability of CPU time wast...
843
views
asked
Jan 16, 2016
Operating System
made-easy-test-series
operating-system
process
probability
+
–
1
answer
30
MadeEasy Test Series: Set Theory & Algebra - Functions
Let f: A → B and g: B → C denote two functions. Consider the following two statements: S1 : If both f and g are injections then the composition function gof : A → C is an injection. S2 : If the function gof : A → C is surjection ... is a surjection. Which of the above statements are valid? a) S1 only b) S2 only c) S1 and S2 d) None of these
Let f: A → B and g: B → C denote two functions. Consider the following two statements:S1 : If both f and g are injections then the composition function gof : A → C ...
558
views
commented
Jan 15, 2016
Set Theory & Algebra
made-easy-test-series
discrete-mathematics
set-theory&algebra
functions
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register