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
Answers by monanshi
2
votes
1
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.9k
views
answered
Mar 3, 2018
Combinatory
discrete-mathematics
combinatory
kenneth-rosen
+
–
1
votes
2
#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...
589
views
answered
Dec 12, 2017
Programming in C
programming-in-c
loop
+
–
28
votes
3
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...
14.1k
views
answered
Dec 2, 2017
Digital Logic
gate1996
digital-logic
circuit-output
normal
+
–
2
votes
4
probability
334
views
answered
Dec 2, 2017
10
votes
5
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.5k
views
answered
Dec 1, 2017
Digital Logic
gateit-2006
digital-logic
booths-algorithm
difficult
+
–
1
votes
6
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?
356
views
answered
Sep 21, 2017
35
votes
7
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.6k
views
answered
Sep 20, 2017
DS
gatecse-2014-set3
data-structures
array
easy
+
–
0
votes
8
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...
756
views
answered
Apr 19, 2017
Programming in C
programming-in-c
+
–
0
votes
9
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 ??
669
views
answered
Apr 19, 2017
9
votes
10
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
answered
Mar 11, 2016
Theory of Computation
theory-of-computation
context-free-language
+
–
3
votes
11
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 ?
709
views
answered
Feb 26, 2016
4
votes
12
GATE2015 ME-3: GA-6
Select the appropriate option in place of underlined part of the sentence. Increased productivity necessary reflects greater efforts made by the employees. Increase in productivity necessary Increase productivity is necessary Increase in productivity necessarily No improvement required
Select the appropriate option in place of underlined part of the sentence.Increased productivity necessary reflects greater efforts made by the employees.Increase in prod...
3.0k
views
answered
Feb 18, 2016
Verbal Aptitude
gate2015-me-3
verbal-aptitude
english-grammar
+
–
0
votes
13
GATE2012 AR: GA-1
Which one of the following options is the closest in meaning to the word given below? Pacify Excite Soothe Deplete Tire
Which one of the following options is the closest in meaning to the word given below?PacifyExciteSootheDepleteTire
1.2k
views
answered
Feb 16, 2016
Verbal Aptitude
gate2012-ar
verbal-aptitude
meaning
+
–
6
votes
14
GATE2012 CY: GA-3
Which one of the following options is the closest in meaning to the word given below? Latitude Eligibility Freedom Coercion Meticulousness
Which one of the following options is the closest in meaning to the word given below?LatitudeEligibilityFreedomCoercionMeticulousness
2.1k
views
answered
Feb 16, 2016
Verbal Aptitude
gate2012-cy
verbal-aptitude
meaning
+
–
21
votes
15
GATE2013 EE: GA-1
They were requested not to quarrel with others. Which one of the following options is the closest in meaning to the word quarrel? make out call out dig out fall out
They were requested not to quarrel with others.Which one of the following options is the closest in meaning to the word quarrel?make outcall outdig outfall out
3.0k
views
answered
Feb 16, 2016
Verbal Aptitude
gate2013-ee
verbal-aptitude
closest-word
+
–
5
votes
16
GATE2013 EE: GA-5
Statement: You can always give me a ring whenever you need. Which one of the following is the best inference from the above statement? Because I have a nice caller tune. Because I have a better telephone facility. Because a friend in need is a friend indeed. Because you need not pay towards the telephone bills when you give me a ring.
Statement: You can always give me a ring whenever you need.Which one of the following is the best inference from the above statement?Because I have a nice caller tune.Bec...
2.1k
views
answered
Feb 16, 2016
Verbal Aptitude
gate2013-ee
verbal-reasoning
verbal-aptitude
+
–
15
votes
17
GATE2014 AE: GA-1
A student is required to demonstrate a high level of comprehension of the subject, especially in the social sciences. The word closest in meaning to comprehension is understanding meaning concentration stability
A student is required to demonstrate a high level of comprehension of the subject, especially in the social sciences.The word closest in meaning to comprehension isunders...
2.6k
views
answered
Feb 16, 2016
Verbal Aptitude
gate2014-ae
closest-word
verbal-aptitude
+
–
4
votes
18
GATE2014 AE: GA-2
Choose the most appropriate word from the options given below to complete the following sentence. One of his biggest ______ was his ability to forgive. vice virtues choices strength
Choose the most appropriate word from the options given below to complete the followingsentence.One of his biggest ______ was his ability to forgive.vicevirtueschoicesstr...
1.8k
views
answered
Feb 16, 2016
Verbal Aptitude
gate2014-ae
most-appropriate-word
+
–
0
votes
19
Java
Why c is faster than java.
Why c is faster than java.
1.0k
views
answered
Feb 14, 2016
Programming in C
programming
+
–
11
votes
20
GATE CSE 2016 Set 2 | Question: 23
Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires. Anarkali's public key. Salim's public key. Salim's private key. Anarkali's private key.
Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires.Anarkali's public key.Salim's public key.Salim's private key.Ana...
9.5k
views
answered
Feb 13, 2016
Computer Networks
gatecse-2016-set2
computer-networks
network-security
cryptography
easy
out-of-gate-syllabus
+
–
60
votes
21
GATE CSE 2016 Set 1 | Question: 35
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$
What will be the output of the following $C$ program?void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } ...
15.6k
views
answered
Feb 13, 2016
Programming in C
gatecse-2016-set1
programming-in-c
recursion
normal
+
–
48
votes
22
GATE CSE 2016 Set 1 | Question: 30
Consider the two cascade $2$ to $1$ multiplexers as shown in the figure . The minimal sum of products form of the output $X$ is $\overline{P} \ \overline {Q}+PQR$ $\overline{P} \ {Q}+QR$ $PQ +\overline{P} \ \overline{Q}R$ $\overline{Q} \ \overline{R} + PQR$
Consider the two cascade $2$ to $1$ multiplexers as shown in the figure . The minimal sum of products form of the output $X$ is $\overline{P} \ \overline {Q}+PQR$$\ove...
9.4k
views
answered
Feb 12, 2016
Digital Logic
gatecse-2016-set1
digital-logic
multiplexer
normal
+
–
68
votes
23
GATE CSE 2016 Set 1 | Question: 53
An IP datagram of size $1000$ $\text{bytes }$arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is $100$ $\text{bytes }$. Assume that the size of the IP header is $20$ $\text{bytes }.$ The number of fragments that the IP datagram will be divided into for transmission is________.
An IP datagram of size $1000$ $\text{bytes }$arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is $100$ $\text{by...
16.8k
views
answered
Feb 12, 2016
Computer Networks
gatecse-2016-set1
computer-networks
ip-packet
normal
numerical-answers
+
–
59
votes
24
GATE CSE 2016 Set 1 | Question: 46
Consider the following Syntax Directed Translation Scheme $( SDTS )$, with non-terminals $\{S,A \}$ and terminals $\{a,b \}$. $S \to aA \quad \{\text{print }1\}$ $S \to a \quad \{\text{print }2\}$ $A \to Sb \quad \{\text{print }3\}$ Using the above $SDTS$ ... printed by a bottom-up parser, for the input $aab$ is: $1 \ 3 \ 2 $ $2 \ 2 \ 3 $ $2 \ 3 \ 1 $ syntax error
Consider the following Syntax Directed Translation Scheme $( SDTS )$, with non-terminals $\{S,A \}$ and terminals $\{a,b \}$. $S \to aA \quad \{\text{print }1\}...
10.7k
views
answered
Feb 12, 2016
Compiler Design
gatecse-2016-set1
compiler-design
syntax-directed-translation
normal
+
–
45
votes
25
GATE CSE 2016 Set 1 | Question: 52
Consider that $B$ wants to send a message $m$ that is digitally signed to $A$. Let the pair of private and public keys for $A$ and $B$ be denoted by ${K_{x}}^-$ and ${K_{x}}^+$ for $x=A, B$, respectively. Let $K_{x}(m)$ represent the operation of encrypting $m$ with a ... $\left\{m, {K_{A}}^-(H(m))\right\}$ $\left\{m, {K_{A}}^+(m)\right\}$
Consider that $B$ wants to send a message $m$ that is digitally signed to $A$. Let the pair of private and public keys for $A$ and $B$ be denoted by ${K_{x}}^-$ and ${K_{...
8.6k
views
answered
Feb 12, 2016
Computer Networks
gatecse-2016-set1
computer-networks
network-security
easy
out-of-gate-syllabus
+
–
85
votes
26
GATE CSE 2016 Set 1 | Question: 45
The attribute of three arithmetic operators in some programming language are given below. ... $2-5+1-7*3$ in this language is ________.
The attribute of three arithmetic operators in some programming language are given below.$$\begin{array}{|c|l|}\hline \textbf{OPERATOR} & \textbf{PRECEDENCE} & \textbf{...
10.2k
views
answered
Feb 12, 2016
Compiler Design
gatecse-2016-set1
compiler-design
parsing
normal
numerical-answers
+
–
4
votes
27
What's the difference between Binary tree height, level and depth?
What's the difference between Binary tree height, level and depth? Sometimes it's confusing! Does there definition change according to question also, if mentioned?
What's the difference between Binary tree height, level and depth? Sometimes it's confusing!Does there definition change according to question also, if mentioned?
11.3k
views
answered
Jan 18, 2016
DS
data-structures
binary-tree
+
–
3
votes
28
Calculating time compleity of recurrence relations.
I am having some problems in calculating time complexities for recurrence relations. In one of the books, I saw two questions- 1. A(n) { if(n<=1) return (n); else { return ( A(n/2)+ A(n/2)+ n); } } The recurrence for this is given as T(n)= T(n/2)+ ... )+T(n/2) +c if n>1 I think it should be T(n)= 2T(n/2)+6T(n/2) +n^2 What am I missing here ?
I am having some problems in calculating time complexities for recurrence relations. In one of the books, I saw two questions-1.A(n){if(n<=1) return (n);else{ return ( A(...
405
views
answered
Jan 17, 2016
Algorithms
algorithms
recurrence-relation
+
–
2
votes
29
IPv6
5.4k
views
answered
Jan 15, 2016
Computer Networks
ipv6
+
–
4
votes
30
Counting number of articulation points
Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check
Given answer is 2, I think it should be 3: F,A, and G are articulation points. Please check
1.1k
views
answered
Jan 15, 2016
Graph Theory
discrete-mathematics
graph-theory
ace-test-series
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register