Register
Filter

Questions by akash.dinkar12

0 votes
2 answers
141
ISI2018-MMA-7
The greatest common divisor of all numbers of the form $p^2 − 1$, where $p \geq 7$ is a prime, is $6$ $12$ $24$ $48$
The greatest common divisor of all numbers of the form $p^2 − 1$, where $p \geq 7$ is a prime, is$6$$12$$24$$48$
3 votes
5 answers
142
ISI2018-MMA-3
The number of trailing zeros in $100!$ is $21$ $23$ $24$ $25$
The number of trailing zeros in $100!$ is$21$$23$$24$$25$
3 votes
1 answer
143
ISI2018-MMA-2
The number of squares in the following figure is $\begin{array}{|c|c|c|c|}\hline \text{} & & & \\\hline \hline \text{} & & & \\\hline \hline \text{} & & & \\\hline \hline \text{} & & & \\\hline \end{array}$ $25$ $26$ $29$ $30$
The number of squares in the following figure is$$\begin{array}{|c|c|c|c|}\hline \text{} & & & \\\hline \hline \text{} & & & \\\hline \hline \text{} & & & \\\hline \hline...
1 votes
2 answers
144
ISI2018-MMA-1
The number of isosceles (but not equilateral) triangles with integer sides and no side exceeding $10$ is $65$ $75$ $81$ $90$
The number of isosceles (but not equilateral) triangles with integer sides and no side exceeding $10$ is$65$$75$$81$$90$
1 votes
2 answers
145
Gate 2018: Probability
In a box, there are $2$ red, $3$ black and $4$ blue coloured balls. The probability of drawing $2$ blue balls in sequence without replacing, and then drawing $1$ black ball from this box is _________ %.
In a box, there are $2$ red, $3$ black and $4$ blue coloured balls. The probability of drawing $2$ blue balls in sequence without replacing, and then drawing $1$ black ba...
1 votes
1 answer
150
ISI2017-PCB-CS-2(b)
Write a $C$ program to fins all permutations of a string (having at most 6 characters). For example, a string of $3$ characters like $“abc"$ has 6 possible permutations: $“abc", “acb", “bca", “bac", “cab", “cba".$
Write a $C$ program to fins all permutations of a string (having at most 6 characters). For example, a string of $3$ characters like $“abc"$ has 6 possible permutations...
1 votes
1 answer
151
ISI2017-PCB-CS-1(b)
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
0 votes
1 answer
157
Cormen Edition 3 Exercise 22.1 Question 2 (Page No. 592)
Give an adjacency-list representation for a complete binary tree on $7$ vertices. Give an equivalent adjacency-matrix representation. Assume that vertices are numbered from $1\ to\ 7$ as in a binary heap.
Give an adjacency-list representation for a complete binary tree on $7$ vertices. Give an equivalent adjacency-matrix representation. Assume that vertices are numbered fr...
0 votes
1 answer
158
Cormen Edition 3 Exercise 22.1 Question 1 (Page No. 592)
Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of every vertex ? How long does it take to compute the in-degrees ?
Given an adjacency-list representation of a directed graph, how long does it take to compute the out-degree of every vertex ? How long does it take to compute the in-degr...
1 votes
0 answers
159
Cormen Edition 3 Exercise 6.1 Question 7 (Page No. 154)
Show that, with the array representation for storing an $n$-element heap, the leaves are the nodes indexed by $\lfloor n/2\rfloor +1$,$\lfloor n/2\rfloor +2,…,n$
Show that, with the array representation for storing an $n$-element heap, the leaves are the nodes indexed by $\lfloor n/2\rfloor +1$,$\lfloor n/2\rfloor +2,…,n$
0 votes
2 answers
160
Cormen Edition 3 Exercise 6.1 Question 6 (Page No. 154)
Is the array with values $23,17,14; 6,13,10,1,5,7,12$ a max-heap ?
Is the array with values $23,17,14; 6,13,10,1,5,7,12$ a max-heap ?
Page: