Recent activity by P SHANMUKHA SHARMA / GATE Overflow for GATE CSE

7 answers

1

GATE CSE 2003 | Question: 88
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\geqslant 3$, and TwoLog_n is initialized to the value of $2^*\lceil \log_2(n) \rceil$ for (k = 3; k ... $\left\{m \mid m \leq n, \text{m is prime} \right\}$ { }

In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\...

12.4k views

commented Dec 24, 2022

1 answer

2

GO Classes Scholarship 2023 | Test | Question: 22
Consider below two program fragments. Assume malloc is always successful, and sizes are as follows - sizeof (int *)=8 bytes sizeof ( double)=8 bytes sizeof ( char )=1 byte sizeof ( int )=4 byte Program 1 int **p; p = (int ... run time error, but Program $1$ will run fine. Both programs will always run fine. Both programs may produce run time errors.

Consider below two program fragments.Assume malloc is always successful, and sizes are as follows -sizeof (int *)=8 bytes sizeof ( double)=8 bytes sizeof ( char )=1 byte ...

664 views

comment edited Oct 6, 2022

2 answers

3

GATE CSE 2002 | Question: 1.3
The solution to the recurrence equation $T(2^k) = 3T(2^{k-1})+1, T(1) =1$ is $2^k$ $\frac{(3^{k+1}-1)}{2}$ $3^{\log_2 k}$ $2^{\log_3 k}$

The solution to the recurrence equation $T(2^k) = 3T(2^{k-1})+1, T(1) =1$ is$2^k$$\frac{(3^{k+1}-1)}{2}$$3^{\log_2 k}$$2^{\log_3 k}$

12.1k views

commented Oct 4, 2022

2 answers

4

GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 12
Which of the following statement(s) is/are true? If $\text{T1}(x) = \text{O}(f(x))$ and $\text{T2}(x) = \text{O}(g(x))$ then $\text{T1}(x) + \text{T2}(x) = \text{O} (\max(f(x), g(x))$ If $\text{T}(x) = \text{O}(cf(x)),$ ... then $\text{T1}(x) \ast \text{T2}(x) = \text{O}(f(x) \ast g(x))$ $2^{(n+1)} = \text{O}(2^{n} ).$

Which of the following statement(s) is/are true?If $\text{T1}(x) = \text{O}(f(x))$ and $\text{T2}(x) = \text{O}(g(x))$ then $\text{T1}(x) + \text{T2}(x) = \text{O} (\max(...

581 views

commented Oct 1, 2022

11 answers

5

GATE CSE 2005 | Question: 52
A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probability that two such randomly generated strings are not identical is: $\frac{1}{2^n}$ $1 - \frac{1}{n}$ $\frac{1}{n!}$ $1 - \frac{1}{2^n}$

A random bit string of length n is constructed by tossing a fair coin n times and setting a bit to 0 or 1 depending on outcomes head and tail, respectively. The probabili...

8.8k views

commented Sep 25, 2022

7 answers

6

GATE2011 AG: GA-8
Three friends, $R, S$ and $T$ shared toffee from a bowl. $R$ took $\frac{1}{3}^{\text{rd}}$ of the toffees, but returned four to the bowl. $S$ took $\frac{1}{4}^{\text{th}}$ of what was left but returned three toffees to the bowl. $T$ took ... returned two back into the bowl. If the bowl had $17$ toffees left, how may toffees were originally there in the bowl? $38$ $31$ $48$ $41$

Three friends, $R, S$ and $T$ shared toffee from a bowl. $R$ took $\frac{1}{3}^{\text{rd}}$ of the toffees, but returned four to the bowl. $S$ took $\frac{1}{4}^{\text{th...

8.1k views

commented Sep 17, 2022

2 answers

7

GO Classes 2023 | Weekly Quiz 3 | Question: 20
The implies connective $\rightarrow$ is one of the stranger connectives in propositional logic. Below are a series of statements regarding implications. Which of the following statements is/are TRUE? For any propositions $P$ and $Q,$ the following is ... $R,$ the following statement is always true: $(P \rightarrow Q) \vee (R \rightarrow Q)$.

The “implies” connective “$\rightarrow$” is one of the stranger connectives in propositional logic. Below are a series of statements regarding implications. Which...

564 views

answered Aug 6, 2022

3 answers

8

GATE CSE 2021 Set 2 | Question: 11
Consider the following sets, where $n \geq 2$: $S_1$: Set of all $n \times n$ matrices with entries from the set $\{ a, b, c\}$ $S_2$: Set of all functions from the set $\{0,1,2, \dots, n^2-1\}$ ... There exists a surjection from $S_1$ to $S_2$ There exists a bijection from $S_1$ to $S_2$ There does not exist an injection from $S_1$ to $S_2$

Consider the following sets, where $n \geq 2$:$S_1$: Set of all $n \times n$ matrices with entries from the set $\{ a, b, c\}$$S_2$: Set of all functions from the set $\{...

6.5k views

commented Jul 29, 2022

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true