Register
Filter

Questions by just_bhavana

3 votes
1 answer
1
Programming
#include<stdio.h> int main() { char arr[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(arr+1)-(unsigned)arr); printf("%d", (unsigned)(p+1)-(unsigned)p); } Please enlighten about the 2nd printf statement. Also what is the difference between the two statements?
#include<stdio.h int main() { char arr[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(arr+1)-(unsigned)arr); printf("%d", (unsigned)(p+1)-(unsigned)p); }Please enl...
1 votes
1 answer
3
CPU bound and IO bound process
1 votes
0 answers
8
Addressing modes
Computer uses addressing modes to reduce number of bits in the addressing field of instruction. Justify this statement and give relevant reasons.
Computer uses addressing modes to reduce number of bits in the addressing field of instruction.Justify this statement and give relevant reasons.
2 votes
1 answer
9
Combinatorics
Somebody prove this identity : $\frac{\binom{n-1}{0}}{1} + \frac{\binom{n-1}{1}}{2} + \frac{\binom{n-1}{2}}{3} + .... + \frac{\binom{n-1}{n-1}}{n} = \frac{2^{n}-1}{n}$
Somebody prove this identity :$\frac{\binom{n-1}{0}}{1} + \frac{\binom{n-1}{1}}{2} + \frac{\binom{n-1}{2}}{3} + .... + \frac{\binom{n-1}{n-1}}{n} = \frac{2^{n}-1}{n}$
1 votes
0 answers
11
Prim's algorithm for MST
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm. Justify this statement.
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm.Justify this statement.
0 votes
0 answers
12
Chromatic polynomials
Check which of the following can be chromatic polynomials of a non-null graph ? i) x5 - 4x3 - 2x2 + x + 4 ii) x6 - 3x5 + 2x4 - 1 P.S I know for a non-null graph G, X(G) (i.e. chromatic number) is at least 2. How to proceed further ??
Check which of the following can be chromatic polynomials of a non-null graph ?i) x5 - 4x3 - 2x2 + x + 4ii) x6 - 3x5 + 2x4 - 1P.S I know for a non-null graph G, X(G) (i.e...
3 votes
1 answer
14
Counting
Suppose that a person with 10 friends invites a different subset of 3 friends to dinner every night for 10 days. In how many ways can he do this so that all friends are included at least once ? How to approach this problem ?
Suppose that a person with 10 friends invites a different subset of 3 friends to dinner every night for 10 days. In how many ways can he do this so that all friends are i...
2 votes
1 answer
18
Functionally complete sets
Which of the following set is not functionally complete? a) {XOR,1,NOT} b) {XOR,1,OR} c) {OR, NOT} d) {XOR,1, AND}
Which of the following set is not functionally complete?a) {XOR,1,NOT}b) {XOR,1,OR}c) {OR, NOT}d) {XOR,1, AND}
5 votes
1 answer
19
Probability
A train and a bus arrive at random between 9 am and 10 am. The train stops for 10 minutes whereas the bus stops for 'x' minutes. Find 'x' such that the probability that the bus and train meet is 0.5. How to approach such type of questions ?
A train and a bus arrive at random between 9 am and 10 am. The train stops for 10 minutes whereas the bus stops for 'x' minutes. Find 'x' such that the probability that t...
Page: