Dark Mode

Answers by dd

1 vote

1

Self Doubt
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}$

answered in Combinatory Mar 15, 2022

186 views

3 votes

2

Exam queries
Is it necessary to solve question which is in standard book :- ie(exercise question) Or only pyqs solving is sufficient??

answered in GATE Feb 14, 2022

2.4k views

11 votes

3

GATE CSE 2021 Set 2 | Question: 1
Let $G$ be a connected undirected weighted graph. Consider the following two statements. $S_1$: There exists a minimum weight edge in $G$ which is present in every minimum spanning tree of $G$. $S_2$: If every edge in $G$ has distinct weight, then $G$ has a ... are true $S_1$ is true and $S_2$ is false $S_1$ is false and $S_2$ is true Both $S_1$ and $S_2$ are false

answered in Algorithms Feb 21, 2021

11.7k views

0 votes

4

Kenneth Rosen Edition 7 Exercise 8.1 Question 10 (Page No. 511)
Find a recurrence relation for the number of bit strings of length $n$ that contain the string $01$. What are the initial conditions? How many bit strings of length seven contain the string $01?$

answered in Combinatory May 2, 2020

386 views

89 votes

5

GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$

answered in Operating System Dec 18, 2017

23.0k views

3 votes

6

Average access time in cache memory along with hard disk
A system has cache main memory and disk for virtual memory. If referenced word in cache $30$ ns to access it. If it is not in cache $80$ ns to load it in cache and reference is started again. If the word not in memory then $22$ms to ... memory and $80$ ns from memory to cache and start again. Cache hit ratio is $0.8$ memory hit ratio is $0.9$

answered in CO and Architecture Jul 9, 2017

2.2k views

5 votes

7

precedence graph
please explain the concept of precedence graph in operating system concurrent processes.

answered in Operating System Jul 8, 2017

2.4k views

8 votes

8

MIN Resource requirement for deadlock
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 occur ?

answered in Operating System Jul 7, 2017

3.9k views

7 votes

9

fork system call
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 solve this using tree diagram?

answered in Operating System Jul 7, 2017

9.3k views

6 votes

10

programming
#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?

answered in Programming in C Jul 7, 2017

2.3k views

8 votes

11

working of fork() system call
How many times "hello" gets printed? main() { fork(); fork(); printf("hello"); }

answered in Operating System Jul 7, 2017

11.4k views

4 votes

12

Multidimensional array
int b[10][10]; int *a[10]; //How b[2][3] and a[2][3] will work??

answered in Programming in C Jul 2, 2017

1.4k views

1 vote

13

C programming
How can we print this alphabetical pattern using c? ABCDE BCDE CDE DE ABCD BCD CD D ABC BC C AB B A

answered in Programming in C Jun 28, 2017

902 views

0 votes

14

Recursive function
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 recursive calls of the above-given code?

answered in Algorithms Jun 27, 2017

1.0k views

1 vote

15

let us c
#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 ?

answered in Programming in C Jun 25, 2017

1.3k views

2 votes

16

SSelf
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; }

answered in Programming in C Jun 25, 2017

516 views

3 votes

17

LEARNING LINUX--- Beginner's Guide to linux
Hey friends lets learn linux get small exercise and get speed over that platform as it is simlar to other operating system but to get an industrial touch just be familar and get daily small excersie and guidance by Arjun sir .. . .. follow ... n discuss here your queries ... Also make your laptop dual boot and install a linux if you already have not.

answered in Others Jun 25, 2017

3.1k views

26 votes

18

GATE CSE 2007 | Question: 84
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. How many distinct paths are there for the ... $(10,10)$ starting from the initial position $(0,0)$? $^{20}\mathrm{C}_{10}$ $2^{20}$ $2^{10}$ None of the above

answered in Combinatory Jun 25, 2017

12.5k views

2 votes

19

Hasse diagram
How come D66 is boolean algebra. Explain it through hasse diagram.

answered in Set Theory & Algebra Jun 24, 2017

776 views

2 votes

20

Probability
P( A union B)=.6 P( A intersection B)=.25 Find P(A`) +P(B`) ? where P(A`) means probability of A complement.

answered in Mathematical Logic Jun 24, 2017

427 views

6 votes

21

Test by Bikram | Mathematics | Test 2 | Question: 23
$U = \{1,2,3,4,5 \}$ and $A$ and $B$ are two subsets. If $n(A \cap B) = 2$ and $A \neq B$ then, total number of ordered pairs $(A,B)$ possible are _________ (where $n(A)$ is the cardinality of set $A$).

answered in Mathematical Logic Jun 9, 2017

575 views

5 votes

22

3 D array with pointers

answered in Programming in C Jun 3, 2017

818 views

8 votes

23

Generating function , closed form
Find a closed form for the generating function for the given sequence 1) 1,1,0,1,1,1,1,1..... 2) 1,2,1,1,1,1,1..... Do manually ..

answered in Combinatory Jun 2, 2017

3.0k views

3 votes

24

LEARNING LINUX--- Beginner's Guide to linux
Hey friends lets learn linux get small exercise and get speed over that platform as it is simlar to other operating system but to get an industrial touch just be familar and get daily small excersie and guidance by Arjun sir .. . .. follow ... n discuss here your queries ... Also make your laptop dual boot and install a linux if you already have not.

answered in Others May 31, 2017

3.1k views

3 votes

25

Finding best time complexity
$\begin{align*} & a[n] = \{x_1,x_2,x_3,x_4,....,x_n\} \text{ is an array of integers where } n,x_i > 0. \\ & A = \left [ \text{min}\left ( x_i,x_j \right ) \right ] \cdot \left ( j-i \right ) \text{ where } j > i \text{ and } i,j \leq n \\ & \text{What is the best time complexity to find out the value of } A_{\bf max} \; ? \end{align*}$

answered in Algorithm Challenges May 27, 2017

1.1k views

2 votes

26

Kenneth Rosen Edition 6th Exercise 5.3 Question 35 (Page No. 362)
How many bit strings contain exactly eight 0s and 10 1s if every 0 must be immediately followed by a 1 ?

answered in Mathematical Logic May 27, 2017

912 views

7 votes

27

Test by Bikram | Mathematics | Test 2 | Question: 29
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 ________.

answered in Mathematical Logic May 24, 2017

489 views

3 votes

28

#PROG
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 (x == y) printf("same"); else printf("not same"); return 0; } 1.SAME 2.NOT SAME

answered in Programming in C May 17, 2017

1.3k views

52 votes

29

GATE CSE 2000 | Question: 6
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertices are adjacent iff the symmetric difference of the corresponding sets has ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?

answered in Set Theory & Algebra May 12, 2017

6.3k views

1 vote

30

ISI 2016 PCB C5
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it. In either case, your answer must include proper justifications without which no credit will be given. #include<stdio.h> main() { unsigned char i, j, a[] = {1, 2, 3, 4, 5} ... j, n); while(j-- != 0) a[0] += n; printf("j = %d, a[0] = %d\n", j, a[0]); }

answered in Others May 9, 2017

450 views

Page:

1
2
3
4
5
6
...
13
next »