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 Kapil
1
votes
1
algorithms
I think the options given for this questions are incorrect, i thing answer would be nk log nk, please correct me if i'm wrong.
I think the options given for this questions are incorrect, i thing answer would be nk log nk, please correct me if i'm wrong.
419
views
answered
Oct 7, 2017
Algorithms
time-complexity
algorithm-design
virtual-gate-test-series
+
–
5
votes
2
Series Summation
Series summation of $S_n$ in closed form? $\begin{align*} &S_n = \frac{1}{1.2.3.4} + \frac{1}{2.3.4.5} + \frac{1}{3.4.5.6} + \dots + \frac{1}{n.(n+1).(n+2).(n+3)} \end{align*}$
Series summation of $S_n$ in closed form?$\begin{align*} &S_n = \frac{1}{1.2.3.4} + \frac{1}{2.3.4.5} + \frac{1}{3.4.5.6} + \dots + \frac{1}{n.(n+1).(n+2).(n+3)} \end{ali...
814
views
answered
Jun 11, 2017
Set Theory & Algebra
number-theory
summation
discrete-mathematics
+
–
7
votes
3
combinatorics
In how many ways 8 different shirts can be distributed to 4 different people so that each will get 2 shirts?
In how many ways 8 different shirts can be distributed to 4 different people so that each will get 2 shirts?
602
views
answered
Apr 28, 2017
Combinatory
discrete-mathematics
combinatory
+
–
4
votes
4
Kenneth Rosen Edition 6th Exercise 5.3 Question 31 (Page No. 362)
The english alphabet contains 21 consonants and five vowels.How many strings of six lowercase letters of the English alphabet contain (b)Exactly two vowels (d)At least two vowels For (b) part I solved it like choose 2 vowels from 5 ... and both of my answers don't match with the key in Rosen. Please let me know where I am wrong.
The english alphabet contains 21 consonants and five vowels.How many strings of six lowercase letters of the English alphabet contain(b)Exactly two vowels(d)At least two ...
951
views
answered
Apr 19, 2017
Combinatory
discrete-mathematics
kenneth-rosen
combinatory
+
–
11
votes
5
The intersection of a context free language and a regular language
The intersection of a context free language and a regular language a)need not be regular b)need not be context free c) is always regular d) is always context free
The intersection of a context free language and a regular language a)need not be regularb)need not be context freec) is always regulard) is always context free
12.2k
views
answered
Apr 16, 2017
4
votes
6
Gilbert Strang Problem set 1.3
Choose a coefficient b that makes this system singular. Then choose a right-hand side g that makes it solvable. Find two solutions in that singular case. $2x +by = 16$ $4x + 8y = g$
Choose a coefficient b that makes this system singular. Then choose a right-hand side g that makes it solvable. Find two solutions in that singular case. $2x ...
1.8k
views
answered
Apr 12, 2017
Linear Algebra
linear-algebra
gilbert-strang
+
–
9
votes
7
GATEBOOK TEST
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ? getting 2 please check
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ?getting 2 please check
428
views
answered
Apr 10, 2017
8
votes
8
C programming - Output ?
#include <stdio.h> int main() { unsigned char a = 5; a |= (1<<((sizeof(char)<<3)-1)); char b = a; printf("%d %d\n",b,a); printf("%u %u\n",b,a); } If the size of a char datatype is 1 Byte, then what will be the output? [Edited]
#include <stdio.h int main() { unsigned char a = 5; a |= (1<<((sizeof(char)<<3)-1)); char b = a; printf("%d %d\n",b,a); printf("%u %u\n",b,a); }If the size of a char data...
2.1k
views
answered
Apr 10, 2017
Programming in C
programming-in-c
+
–
3
votes
9
cil-2017 Q87
427
views
answered
Apr 9, 2017
Databases
cil-2017
databases
lossless-join
database-normalization
+
–
4
votes
10
K&R BOOK
I have learnt that order of function call of f1() and f2() is compiler dependent from K&R book.Why precedence and associavity does not work in this case ?? Please clarify in details . #include<stdio.h> int x = 0; int f1() { x = 5; return x; } int f2() { x = 10; return x; } int main() { int p = f1() + f2(); printf("%d ", x); return 0; }
I have learnt that order of function call of f1() and f2() is compiler dependent from K&R book.Why precedence and associavity does not work in this case ?? Please clarify...
905
views
answered
Apr 2, 2017
Programming in C
programming-in-c
+
–
81
votes
11
GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j.$ What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of $1. . . n$ with at most $n$ inversions? $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^{1.5})$ $\Theta(n)$
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j.$What would be the worst case time complex...
19.9k
views
answered
Apr 1, 2017
Algorithms
gatecse-2003
algorithms
sorting
normal
insertion-sort
+
–
7
votes
12
CSMA/CD
1.7k
views
answered
Mar 14, 2017
Computer Networks
computer-networks
csma-cd
ethernet
+
–
10
votes
13
float vs double
Program 1: #include<stdio.h> int main() { float x = 0.1; if (x == 0.1) printf("IF"); else if (x == 0.1f) printf("ELSE IF"); else printf("ELSE"); } The output of above program is ELSE IF . Program ... getting these weird output and is there any way to predict these outputs on the same processor. Also how comparison is done of two variables in C ?
Program 1:#include<stdio.h int main() { float x = 0.1; if (x == 0.1) printf("IF"); else if (x == 0.1f) printf("ELSE IF"); else printf("ELSE"); }The output of above progra...
5.6k
views
answered
Mar 11, 2017
Programming in C
programming-in-c
ieee-representation
undefined-behaviour
+
–
24
votes
14
GATE CSE 2017 Set 1 | Question: 7
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this representation is $2^{-f}$ to $2^{i}$ $2^{-f}$ to $\left ( 2^{i} - 2^{-f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i} - 2^{-f} \right )$
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this repres...
16.7k
views
answered
Mar 10, 2017
Digital Logic
gatecse-2017-set1
digital-logic
number-representation
fixed-point-representation
+
–
6
votes
15
what is the probability that a randomly chosen bit string of length 10 is palindrome
what is the probability that a randomly chosen bit string of length 10 is palindrome a)1/64 b)1/32 c) 1/8 d)1/4
what is the probability that a randomly chosen bit string of length 10 is palindromea)1/64 b)1/32 c) 1/8 d)1/4
2.8k
views
answered
Mar 9, 2017
2
votes
16
Rosen excercise
How many ways are there for 10 women and 6 men to stand in a line so that no two men stand to each other
How many ways are there for 10 women and 6 men to stand in a line so that no two men stand to each other
259
views
answered
Mar 9, 2017
2
votes
17
C. L. Liu 3.38(b)
Among $3n + 1$ objects, $n$ of them are identical. Find the number of ways to select $n$ objects out of these $3n + 1$ objects.
Among $3n + 1$ objects, $n$ of them are identical. Find the number of ways to select $n$ objects out of these $3n + 1$ objects.
405
views
answered
Mar 9, 2017
4
votes
18
TECHTUD, C PROGRAMMING
1.2k
views
answered
Mar 8, 2017
Programming in C
programming-in-c
output
+
–
3
votes
19
ISRO 2013- Calculus [Mech]
Lim x $\rightarrow$0 $\frac{x^{2}+ x - Sin x}{x^{2}}$ (a) 0 (b) ∞ (c) 1 (d) None of these
Lim x $\rightarrow$0 $\frac{x^{2}+ x - Sin x}{x^{2}}$(a) 0(b) ∞(c) 1(d) None of these
452
views
answered
Mar 8, 2017
Calculus
engineering-mathematics
isro-mech
calculus
+
–
3
votes
20
ISRO 2013- Angle between vectors [Mech]
Vector a= 3i + 2j - 6k, vector b= 4i - 3j + k, angle between above vectors is (a) 90° (b) 0° (c) 45° (d) 60°
Vector a= 3i + 2j - 6k, vector b= 4i - 3j + k, angle between above vectors is(a) 90°(b) 0°(c) 45°(d) 60°
415
views
answered
Mar 8, 2017
Linear Algebra
engineering-mathematics
isro-mech
linear-algebra
+
–
5
votes
21
regular expression
Find the regular expression for $L=a^nb^m$ where $n>=3$ , $m$ is even ?
Find the regular expression for $L=a^nb^m$ where $n>=3$ , $m$ is even ?
468
views
answered
Mar 7, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
3
votes
22
ISRO 2014- Probability [Mech]
A purse contains 4 copper coins and 3 silver coins. A second purse contains 6 copper coins and 4 silver coins. A purse is chosen randomly and a coin is taken out of it. What is the probability that it is a copper coin? a) 70/82 b) 35/70 c) 41/82 d) 41/70
A purse contains 4 copper coins and 3 silver coins. A second purse contains 6 copper coins and 4 silver coins. A purse is chosen randomly and a coin is taken out of it. W...
1.1k
views
answered
Mar 7, 2017
Probability
engineering-mathematics
isro-mech
probability
+
–
2
votes
23
Asynchronous counter circuit with feedback input GATEBOOK QS
How to solve in brief and answer?
How to solve in brief and answer?
896
views
answered
Feb 7, 2017
Digital Logic
digital-counter
digital-logic
+
–
6
votes
24
GATEBOOK
343
views
answered
Feb 7, 2017
Mathematical Logic
discrete-mathematics
+
–
5
votes
25
Cache Access Time
Assume that a system is using write-through cache. It has 70% write hits. The cache operates in look-aside mode with a read-hit ratio of 80%. The program run on the system is such that it has memory reference for read 70% of time and for write is 30%. The main memory ... assume we are using no write allocate policy). Average access time of the system is A. 43 B. 55.2 C. 41.5 D. 60
Assume that a system is using write-through cache. It has 70% write hits. The cache operates in look-aside mode with a read-hit ratio of 80%. The program run on the syste...
2.9k
views
answered
Jan 22, 2017
CO and Architecture
co-and-architecture
multilevel-cache
+
–
5
votes
26
time required to fins the unknowm integer
as we already know the range,so can we use counting sort??and complexity of counting sort is O(n+k) what other method is there to know the missing number??
as we already know the range,so can we use counting sort??and complexity of counting sort is O(n+k)what other method is there to know the missing number??
938
views
answered
Jan 22, 2017
Algorithms
algorithms
time-complexity
sorting
test-series
+
–
4
votes
27
COA_RAW DEPENDENCY
Assume that ADD x, y, z; denotes x ← y + z, SUB x, y, z; x ← y – z and MUL x, y, z; denotes x ← y ∗ z. Consider the following assembly code. I1: SUB R1,R2,R3 I2:ADD R2,R1 R3 I3:ADD R3 R1 R2 I4:SUB R1 R2 R2 Find the number of RAW dependencies in the above assembly code. a. 2 b. 5 c. 3 d. 6
Assume that ADD x, y, z; denotes x ← y + z, SUB x, y, z; x ← y – z and MUL x, y, z; denotes x ← y ∗ z. Consider the following assembly code.I1: SUB R1,R2,R3I...
572
views
answered
Jan 18, 2017
6
votes
28
Virtual Gate Test Series: Computer Networks - CSMA
A $8$-node network runs the Carrier Sence Multiple Access $\text{(CSMA) MAC}$ protocol.The maximum data rate of the network is $\text{10 Megabits/sec}.$ Including retries, each node sends traffic according to some unknown random process ... $\text{(including retries)}$ experience a collision _____$\%?$ $\text{(Correct to two decimal places).}$
A $8$-node network runs the Carrier Sence Multiple Access $\text{(CSMA) MAC}$ protocol.The maximum data rate of the network is $\text{10 Megabits/sec}.$ Including retries...
566
views
answered
Jan 18, 2017
Computer Networks
computer-networks
csma-cd
virtual-gate-test-series
+
–
15
votes
29
Hashing
Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is _______ (upto 2 decimal place).
Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successfu...
3.2k
views
answered
Jan 16, 2017
Algorithms
hashing
+
–
12
votes
30
DS-CLL
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is N is A)O(1) B)O(log N) C)O(N) D)O(N log N)
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is NisA)O(1)B)O(log N)C)O(N)D)O(N...
3.0k
views
answered
Jan 16, 2017
DS
data-structures
time-complexity
algorithms
linked-list
+
–
Page:
1
2
3
4
5
6
...
11
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register