Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
monanshi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by monanshi
1
answer
1
What is the probability that a five-card poker hand does not contain the queen of hearts?
1.1k
views
answer selected
Mar 4, 2018
3
answers
2
Kenneth Rosen Edition 6th Exercise 5.3 Question 37 (Page No. 362)
How many bit strings of length 10 contain at least three 1s and at least three 0s? My Approach:-> using product rule There are 3 subtask following (filling 3 ones in 10 places) = (filling 3 zeros in remaing 7 places) = ... greater than (total number of string). Now , i want to know what is wrong in my apporach. please explain..
How many bit strings of length 10 contain at least three 1s and at least three 0s?My Approach:->using product rule There are 3 subtask following (filling 3 ones in 10 pla...
1.8k
views
answered
Mar 3, 2018
Combinatory
discrete-mathematics
combinatory
kenneth-rosen
+
–
1
answer
3
Kenneth Rosen: Counting-Chapter 5
How many license plates consisting of three letters followed by three digits contain no letter or digit twice?
How many license plates consisting of three letters followed by three digits contain no letter or digit twice?
2.7k
views
commented
Mar 3, 2018
Combinatory
counting
discrete-mathematics
+
–
2
answers
4
syntax and semantic errors
What is the difference in between lexical, syntax and semantic errors? Please give appropriate example also.
What is the difference in between lexical, syntax and semantic errors?Please give appropriate example also.
3.8k
views
commented
Dec 14, 2017
Compiler Design
compiler-design
lexical-analysis
+
–
1
answer
5
#self doubt
What will be the output of following program:- Size of int is 4 bytes #incude<stdio.h> int main() { int a; for(a=1;a<=2147483647;a++) printf("%d\n",a); return 0; } a) will it print till its limit 2147483647 b) it will go to indefinate loop c) compile time error
What will be the output of following program:-Size of int is 4 bytes#incude<stdio.h>int main(){ int a; for(a=1;a<=2147483647;a++) printf("%d\n",a); r...
551
views
answered
Dec 12, 2017
Programming in C
programming-in-c
loop
+
–
1
answer
6
Computer Network
In a class C IP address, 4 bits are taken for subnetting from host id part. Total possible number of subnet masks are ________ 60 80 90 70
In a class C IP address, 4 bits are taken for subnetting from host id part. Total possible number of subnet masks are ________ 60 80 90 70
305
views
commented
Dec 12, 2017
1
answer
7
Discrete mathematics
is there any difference between in valid and tautology?
is there any difference between in valid and tautology?
306
views
commented
Dec 8, 2017
Mathematical Logic
propositional-logic
+
–
5
answers
8
GATE IT 2005 | Question: 43
Which of the following input sequences will always generate a $1$ at the output $z$ ...
Which of the following input sequences will always generate a $1$ at the output $z$ at the end of the third cycle?$\begin{array}{|l|l|}\hline \textbf{A} & \textbf{B} & \t...
15.1k
views
commented
Dec 3, 2017
Digital Logic
gateit-2005
digital-logic
circuit-output
normal
+
–
0
answers
9
Clocks in Synchronus Sequential circuits
Can someone illustrate with well defined procedure of finding the output timing diagram in the circuit involving various flip flops, some combinational circuit. This circuit should be synchronous i.e., being run by a single clock? Ex.: http://gateoverflow.in/264/gate2005-62 , http://gateoverflow.in/726/gate2001-2-8
Can someone illustrate with well defined procedure of finding the output timing diagram in the circuit involving various flip flops, some combinational circuit. This circ...
327
views
asked
Dec 3, 2017
Digital Logic
digital-circuits
sequential-circuit
+
–
1
answer
10
C programming
#include <stdio.h> int main() { int i = 3; printf("%d", (++i)++); return 0; } why this is giving compile time error?
#include <stdio.h>int main(){ int i = 3; printf("%d", (++i)++); return 0;}why this is giving compile time error?
336
views
commented
Dec 2, 2017
5
answers
11
GATE CSE 1996 | Question: 2.21
Consider the circuit in below figure which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output. Binary to Hex conversion Binary to BCD conversion Binary to Gray code conversion Binary to $radix-12$ conversion
Consider the circuit in below figure which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output.Binary to Hex co...
13.9k
views
answered
Dec 2, 2017
Digital Logic
gate1996
digital-logic
circuit-output
normal
+
–
2
answers
12
probability
313
views
answered
Dec 2, 2017
3
answers
13
GATE IT 2006 | Question: 38
When multiplicand $Y$ is multiplied by multiplier $X = x_{n - 1}x_{n-2} \dots x_0$ ... partial products for rows $5$ and $8$ are $2Y$ and $Y$ $-2Y$ and $2Y$ $-2Y$ and $0$ $0$ and $Y$
When multiplicand $Y$ is multiplied by multiplier $X = x_{n - 1}x_{n-2} \dots x_0$ using bit-pair recoding in Booth's algorithm, partial products are generated according ...
10.4k
views
answered
Dec 1, 2017
Digital Logic
gateit-2006
digital-logic
booths-algorithm
difficult
+
–
6
answers
14
GATE CSE 2007 | Question: 32
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$? P: $x'y'z' + w'xy' + wy'z + xz$ Q: $w'y'z' + wx'y' + xz$ ... $x'y'z' + wx'y'+ w'y$ P only Q and S R and S S only
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$?P: $x'y'z' + w'xy' + wy'z + xz$Q: $w'y'z' + wx'y...
10.3k
views
edited
Nov 30, 2017
Digital Logic
gatecse-2007
digital-logic
normal
boolean-algebra
+
–
17
answers
15
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both com...
32.2k
views
commented
Nov 30, 2017
Digital Logic
gatecse-2004
digital-logic
normal
adder
+
–
5
answers
16
GATE CSE 2004 | Question: 28
What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding? $(113. + -111.) + 7.51$ $113. + (-111. + 7.51)$ $9.51$ and $10.0$ respectively $10.0$ and $9.51$ respectively $9.51$ and $9.51$ respectively $10.0$ and $10.0$ respectively
What is the result of evaluating the following two expressions using three-digit floating point arithmetic with rounding?$(113. + -111.) + 7.51$$113. + (-111. + 7.51)$$9....
16.0k
views
commented
Nov 25, 2017
Digital Logic
gatecse-2004
digital-logic
number-representation
normal
+
–
10
answers
17
GATE CSE 2014 Set 3 | Question: 42
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order. int ProcessArray(int *listA, int x, int n) { int i, j, k; i = 0; j = n-1; do { k = (i+j)/2; if ... implementation of binary search. It will always find the maximum element in $listA$. It will return −$1$ even when $x$ is present in $listA$.
Consider the C function given below. Assume that the array $listA$ contains $n (>0)$ elements, sorted in ascending order.int ProcessArray(int *listA, int x, int n) { in...
13.4k
views
answered
Sep 20, 2017
DS
gatecse-2014-set3
data-structures
array
easy
+
–
3
answers
18
TIFR CSE 2013 | Part A | Question: 3
Three candidates, Amar, Birendra and Chanchal stand for the local election. Opinion polls are conducted and show that fraction $a$ of the voters prefer Amar to Birendra, fraction $b$ prefer Birendra to Chanchal and fraction $c$ ... $(a, b, c) = (0.49, 0.49, 0.49);$ None of the above.
Three candidates, Amar, Birendra and Chanchal stand for the local election. Opinion polls are conducted and show that fraction $a$ of the voters prefer Amar to Birendra, ...
2.5k
views
commented
Jul 13, 2017
Mathematical Logic
tifr2013
set-theory&algebra
set-theory
+
–
4
answers
19
TIFR CSE 2016 | Part B | Question: 4
In the following, $A$ stands for a set of apples, and $S(x, y)$ stands for "$x$ is sweeter than $y$. Let $\Psi \equiv \exists x : x \in A$ $\Phi \equiv \forall x \in A : \exists y \in A : S(x, y).$ Which of the following statements implies that there are ...
In the following, $A$ stands for a set of apples, and $S(x, y)$ stands for "$x$ is sweeter than $y$. Let$$\Psi \equiv \exists x : x \in A$$$$\Phi \equiv \forall x \in A :...
3.1k
views
commented
Jul 12, 2017
Mathematical Logic
tifr2016
mathematical-logic
first-order-logic
+
–
3
answers
20
IISc2012Research
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2> Difference between D&C and Dynamic Programming ?
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2 Difference between D&C and Dynamic Programming ?
684
views
answer selected
Jul 12, 2017
1
answer
21
programming
int x=0,i; for(i=0;i<10;i++) if(i%2&&x++) x=+2; what is the value of x.
int x=0,i;for(i=0;i<10;i++)if(i%2&&x++)x=+2;what is the value of x.
1.6k
views
answer selected
Jul 3, 2017
2
answers
22
B+ Tree(order of Internal node)
The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $3$ bytes, the search field value takes $17$ bytes, and the block size is $1024$ bytes. The order of the internal node is_______.
The order of an internal node in a $B+$ tree index is the maximum number of children it can have. Suppose that a child pointer takes $3$ bytes, the search field value tak...
3.5k
views
answer selected
Jun 27, 2017
Databases
databases
b-tree
+
–
1
answer
23
GENERAL DOUBT C
void main() { char *p="cprogramming"; } I know the string literal "cprogramming" is stored in read only data segment. But where will the pointer p be stored, in stack or read-write data segment ?
void main() { char *p="cprogramming"; }I know the string literal "cprogramming" is stored in read only data segment. But where will the pointer p be stored, in stack or r...
714
views
answered
Apr 19, 2017
Programming in C
programming-in-c
+
–
1
answer
24
arguments
The maximum number of arguments that can be passed in a single function are ??
The maximum number of arguments that can be passed in a single function are ??
651
views
answered
Apr 19, 2017
5
answers
25
GATE CSE 2014 Set 1 | Question: 41
Consider the following C function in which size is the number of elements in the array E: int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0; i< size; i++) Y = Y + E[i]; for(i=0; i < size; ... in any sub-array of array E. sum of the maximum elements in all possible sub-arrays of array E. the sum of all the elements in the array E.
Consider the following C function in which size is the number of elements in the array E: int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0; i...
12.4k
views
commented
Apr 19, 2017
Algorithms
gatecse-2014-set1
algorithms
identify-function
normal
+
–
5
answers
26
TIFR CSE 2014 | Part B | Question: 7
Which of the following statements is TRUE for all sufficiently large $n$? $\displaystyle \left(\log n\right)^{\log\log n} < 2^{\sqrt{\log n}} < n^{1/4}$ $\displaystyle 2^{\sqrt{\log n}} < n^{1/4} < \left(\log n\right)^{\log\log n}$ ... $\displaystyle 2^{\sqrt{\log n}} < \left(\log n\right)^{\log\log n} < n^{1/4}$
Which of the following statements is TRUE for all sufficiently large $n$?$\displaystyle \left(\log n\right)^{\log\log n} < 2^{\sqrt{\log n}} < n^{1/4}$ $\displaystyle 2^{...
3.9k
views
commented
Apr 13, 2017
Algorithms
tifr2014
algorithms
time-complexity
+
–
2
answers
27
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.2k
views
commented
Apr 13, 2017
Algorithms
gate1996
algorithms
asymptotic-notation
normal
+
–
1
answer
28
sparse matrix
How many real links are required to store a sparse matrix of 10 rows , 10 columns ,and 15 non zeros entries.(pick up the closest answer)
How many real links are required to store a sparse matrix of 10 rows , 10 columns ,and 15 non zeros entries.(pick up the closest answer)
2.6k
views
commented
Mar 15, 2016
DS
data-structures
sparse-matrix
matrix
+
–
1
answer
29
Which of these languages are NOT context free?
Let $l1 =\{ 0^{n+m} 1^n 0^m \mid n,m>= 0 \}$, $l2 = \{ 0^{n+m} 1^{n+m} 0^m \mid n,m>=0 \}$ , $l3 = \{ 0^{n+m} 1^{n+m} 0^{n+m} \mid n,m>=0 \}$ Which of these languages are NOT context free? Solve this question with explanation Thank you
Let$l1 =\{ 0^{n+m} 1^n 0^m \mid n,m>= 0 \}$,$l2 = \{ 0^{n+m} 1^{n+m} 0^m \mid n,m>=0 \}$ ,$l3 = \{ 0^{n+m} 1^{n+m} 0^{n+m} \mid n,m>=0 \}$Which of these languages are NOT...
3.8k
views
commented
Mar 11, 2016
Theory of Computation
theory-of-computation
context-free-language
+
–
0
answers
30
All sorting techniques
Please explain all the sorting techniques with examples,
Please explain all the sorting techniques with examples,
421
views
commented
Mar 10, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register