Recent activity by maverick / GATE Overflow for GATE CSE

2 answers

1

PhD Admissions Written Test (Basic)
Let x1, x2, ...x8 be 8 propositional variables. Let · represent AND connective ⊕ represent the Exclusive-or connective. The number of satisfying assignments of the formula x1 ⊕ x2 ⊕ ...x8 is _________________ The number of satisfying assignments of the formula (x1·x2) ⊕ (x3·x4)... ⊕ (x7·x8) is __________________

Let x1, x2, ...x8 be 8 propositional variables. Let · represent AND connective ⊕ represent the Exclusive-or connective.The number of satisfying assignments of the form...

493 views

answered Sep 12, 2022

1 answer

2

igate test series
Selection of how many integers from the first ten positive integers (1, 2, ...) guarantees that there must be a pair of these integers with a sum equal to 11 ?

Selection of how many integers from the first ten positive integers (1, 2, ...) guarantees that there must be a pair of these integers with a sum equal to 11 ?

624 views

answered Sep 10, 2022

4 answers

3

TIFR CSE 2011 | Part B | Question: 31
Given a set of $n=2^{k}$ distinct numbers, we would like to determine the smallest and the second smallest using comparisons. Which of the following statements is TRUE? Both these elements can be determined using $2k$ comparisons. ... $nk$ comparisons are necessary to determine these two elements.

Given a set of $n=2^{k}$ distinct numbers, we would like to determine the smallest and the second smallest using comparisons. Which of the following statements is TRUE?Bo...

7.8k views

commented Nov 21, 2020

3 answers

4

GATE CSE 1996 | Question: 2.15
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot $1, 2, 3, \dots n$ $n, n-1, n-2, \dots, 2, 1$ Let $C_1$ and $C_2$ be the number of comparisons made for the inputs (i) and (ii) respectively. Then, $C_1 < C_2$ $C_1 > C_2$ $C_1 = C_2$ we cannot say anything for arbitrary $n$

Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot$1, 2, 3, \dots n$$n, n-1, n-2, \dots, 2, 1$Let $C_1$ and $C_2$ be the...

11.1k views

commented Oct 31, 2020

3 answers

5

GATE CSE 1994 | Question: 21
Consider the following recursive function: function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end; The above function is run on a computer with a stack of $64$ bytes. Assuming ... an address takes $2$ bytes each, estimate the maximum value of $n$ for which the stack will not overflow. Give reasons for your answer.

Consider the following recursive function:function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end;The above function i...

25.5k views

commented Oct 30, 2020

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