1 votes
1
Give a combinatorial argument to establish the identity below for any nonnegative integer n:$\sum_{k=0}^{n} k\binom{n}{k}=n\ast 2^{n-1}$
3 votes
2
Is it necessary to solve question which is in standard book :- ie(exercise question) Or only pyqs solving is sufficient??
0 votes
4
5 votes
7
please explain the concept of precedence graph in operating system concurrent processes.
8 votes
8
A system is having 3 user process , each requiring 2 units of resource R . WHAT IS the minimum and maximum no. of units of R required such that no deadlock will occ...
7 votes
9
Consider the following code snippet: if(fork()&& fork()) { fork(); } if(fork()||fork()) { fork(); fork(); } printf("GATE 2017");How many times GATE $2017$ printed?How to ...
6 votes
10
#include <stdio.h int main() { int x=1,y=0,z=5; int a=x && y && z++; printf("%d",z); }The output is 5, can someone explain how?
8 votes
11
How many times "hello" gets printed?main() { fork(); fork(); printf("hello"); }
4 votes
12
int b[10][10];int *a[10];//How b [3] and a [3] will work??
1 votes
13
How can we print this alphabetical pattern using c?ABCDE BCDE CDE DEABCD BCD CD DABC BC CAB BA
0 votes
14
int fun(int n) { int s=0,i; if(n<=1) return 1; for(i=1; i*i<n; i++) s+=n; return fun(n/4)+fun(n/4)+s; } what will be the time complexity, returning value and no. of recur...
1 votes
15
#include<stdio.h int main() { int i = 0x1 << sizeof(int)*8-1; printf("\n%x",i); i = i > sizeof(int)*8-1; printf("%d",i); }Find the output ?
2 votes
16
The value returned by the following function for foo(10) is ____ int foo(int x) { if(x < 1) return 1; int sum = 0; for(i = 1; i <= x; i++) { sum += foo(x-i); } return sum...
2 votes
19
How come D66 is boolean algebra. Explain it through hasse diagram.
2 votes
20
P( A union B)=.6P( A intersection B)=.25Find P(A ) +P(B ) ? where P(A ) means probability of A complement.
6 votes
21
5 votes
22
8 votes
23
Find a closed form for the generating function for the given sequence1) 1,1,0,1,1,1,1,1.....2) 1,2,1,1,1,1,1.....Do manually​ ..
7 votes
27
Total number of ways we can fill a $4 \times 4$ matrix by $0$ and $1$’s such that every row and column contains odd no of $0$'s and $1$'s is ________.
3 votes
28
Predict the output of following program. Assume that the numbers are stored in 2's complement form.#include<stdio.h>int main(){ unsigned int x = -1; int y = ~0; if...