Recent activity by syncronizing / GATE Overflow for GATE CSE

0 answers

1

Time complexity
Is this the correct way to solve ? Q) int algorithm(int n) { int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorithm(n/2)+algorithm(n/2)*algorithm(n/2) }

Is this the correct way to solve ?Q) int algorithm(int n){ int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorit...

1.3k views

commented Mar 16, 2019

0 answers

2

MadeEasy Test Series: Compiler Design - Parsing
Let G be a grammar with the following productions: If LR(1) parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item T → .T * F in the initial state ________.

Let G be a grammar with the following productions:If LR(1) parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an ...

410 views

closed Mar 5, 2019

5 answers

3

ISRO2015-7
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders required will be $0,17$ $16,1$ $1,16$ $8,8$

If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders r...

9.7k views

commented Mar 1, 2019

0 answers

4

MadeEasy TestSeries-2019
In the given Synchronous counter circuit, initially, all the flip-flop outputs are ‘0’. it is required to replace FF2 with A-B Flip-Flop. The A-B flip-flop excitation table is given below. the FF2 inputs are? The answer given is A=Q1’ B=Q1’ This is how I approached the above question.

In the given Synchronous counter circuit, initially, all the flip-flop outputs are ‘0’. it is required to replace FF2 with A-B Flip-Flop. The A-B flip-flop excitation...

598 views

commented Mar 1, 2019

0 answers

5

next larger double precision number is 2P
The difference between 201 and next larger double precision number is 2P , if IEEE double precision format is used then the value of P is ________. what is next larger precision number here ?

The difference between 201 and next larger double precisionnumber is 2P, if IEEE double precision format is used then thevalue of P is ________.what is next larger precis...

512 views

asked Feb 28, 2019

1 answer

6

Identify the function f3
The given logic circuit is realizing the boolean function and function Identify the function f3(A,B,C,D) Answer given is

The given logic circuit is realizing the boolean function and function Identify the function f3(A,B,C,D)Answer given is

1.1k views

commented Feb 28, 2019

1 answer

7

IIT Bombay
I’m getting 25.99 in gate 2019, OBC. can I get RA in IIT Bombay?

I’m getting 25.99 in gate 2019, OBC. can I get RA in IIT Bombay?

652 views

answer selected Feb 15, 2019

1 answer

8

ISRO 2019
Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?

Can anyone pls write about ISRO cut off for CSE in GEN and OBC category?

1.2k views

commented Feb 6, 2019

0 answers

9

isro form filling ?
Will ISRO 2019 recruit this year? till now there is no information about ISRO 2019 form. Please share if you have information regarding it.

Will ISRO 2019 recruit this year? till now there is no information about ISRO 2019 form.Please share if you have information regarding it.

462 views

asked Feb 5, 2019

2 answers

10

ISRO2008-11
The Boolean theorem $\text{AB}+\overline{\text{A}}\text{C} +\text{BC = AB} + \overline{\text{A}}\text{C}$ corresponds to $\text{(A+B)} \bullet (\overline{\text{A}} +\text{C}) \bullet \text{(B+C) = (A+B)} \bullet (\overline{\text{A}} +\text{C})$ ... $\text{(A+B)} \bullet (\overline{\text{A}} +\text{C}) \bullet \text{(B+C) = AB} + \overline{\text{A}}\text{C}$

The Boolean theorem $\text{AB}+\overline{\text{A}}\text{C} +\text{BC = AB} + \overline{\text{A}}\text{C}$ corresponds to$\text{(A+B)} \bullet (\overline{\text{A}} +\text{...

5.5k views

commented Feb 5, 2019

0 answers

11

ISRO Recruitment 2019
When ISRO 2019 form filling will start?

When ISRO 2019 form filling will start?

646 views

asked Feb 4, 2019

1 answer

12

Less than equal to 40 In OBC ,branch CSE
Will I get any IITs under 40 marks in gate 2018 in OBC category ?

Will I get any IITs under 40 marks in gate 2018 in OBC category ?

983 views

answer selected Jan 26, 2019

3 answers

13

GATE CSE 2015 Set 2 | Question: GA-5
Based on the given statements, select the most appropriate option to solve the given question. What will be the total weight of $10$ poles each of same weight? Statements: One fourth of the weight of the pole is $5\;\text{Kg}$. The ... Statement II alone is not sufficient. Either I or II alone is sufficient. Both statements I and II together are not sufficient.

Based on the given statements, select the most appropriate option to solve the given question.What will be the total weight of $10$ poles each of same weight?Statements:O...

3.3k views

commented Jan 17, 2019

6 answers

14

GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$

What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory.int main () { unsigned int ...

28.1k views

commented Jan 14, 2019

1 answer

15

Mathematics GATE 2018 EE: 18
Let $f$ be a real-valued function of a real variable defined as $f(x) = x - [ x ]$ , where $ [ x ]$ denotes the largest integer less than or equal to $x$. The value of ${\LARGE \int}_{0.25}^{1.25} \! f(x) \, \mathrm{d}x$ is _________ (upto $2$ decimal places).

Let $f$ be a real-valued function of a real variable defined as $f(x) = x - [ x ]$ , where $ [ x ]$ denotes the largest integer less than or equal to $x$. The value o...

2.8k views

commented Jan 12, 2019

2 answers

16

the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables: S1 = 3, S2 = 2, S3 = 1; P(S1); P(S2); P(S3); Critical Section V(S3); V(S2); V(S1); Does it satisfy mutual exclusion, progress and bounded waiting?

Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables:S1 = 3, S2 = 2, S3 = 1;P(S1);P(S...

4.9k views

commented Jan 6, 2019

0 answers

17

Number of Misses
Consider a direct mapped cache with 16 blocks with block size of 16 bytes. Initially the cache is empty. The following sequence of access of memory blocks: Ox80000, Ox80008, Ox80010, Ox80018, Ox30010 is repeated 10 times. Which of the following represents number of compulsory and conflict misses? Ans. Compulsory = 3 and conflict = 18

Consider a direct mapped cache with 16 blocks with block size of 16 bytes. Initially the cache is empty. The following sequence of access of memory blocks:Ox80000, Ox8000...

1.4k views

commented Jan 2, 2019

1 answer

18

MadeEasy Test Series: CO & Architecture - Pipelining
A system employs 10 stage instruction pipeline in which 5% instruction results in data dependency, 10% instruction results in control dependency, 2% instructions results in structural dependency. 10% instructions are exposed to data and ... The average instruction time is ________. [in cycles] Ans. 1.92 Please Explain Briefly the Solution

A system employs 10 stage instruction pipeline in which 5% instruction results in data dependency, 10% instruction results in control dependency, 2% instructions results ...

728 views

commented Nov 19, 2018

9 answers

19

GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.

A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)...

21.6k views

commented Nov 2, 2018

5 answers

20

LL(1)
Every LL(1) grammar is ______ A.SLR(1) B.LALR(1) C.LR(1) D.Both B & C

Every LL(1) grammar is ______A.SLR(1)B.LALR(1)C.LR(1)D.Both B & C

1.7k views

commented Sep 22, 2018

0 answers

21

tokens
Which of the following is not a token of c -program? A. 1.02e + 2 B. # define C. 123.33 D. MAX please explain why?

Which of the following is not a token of c -program?A. 1.02e + 2B. # defineC. 123.33D. MAXplease explain why?

418 views

commented Sep 22, 2018

1 answer

22

Fortran statement
The number of tokens in the fortran statements DO 10 I = 1.3 is ?

The number of tokens in the fortran statements DO 10 I = 1.3 is ?

291 views

asked Sep 22, 2018

1 answer

23

number of tokens
Question: Find the number of tokens in the following C code using lexical analyzer of the compiler.

Question:Find the number of tokens in the following C code using lexical analyzer of the compiler.

5.4k views

commented Sep 22, 2018

0 answers

24

semantic analyzer
Incompatable types work with the _____________ A. Syntax tree B.semantic analyzer C.Code optimizer D.Lexical analyzer Answer is B Please explain why?

Incompatable types work with the _____________A. Syntax treeB.semantic analyzerC.Code optimizerD.Lexical analyzerAnswer is BPlease explain why?

1.1k views

asked Sep 22, 2018

9 answers

25

AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.

The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...

8.9k views

answer selected Sep 15, 2018

0 answers

26

Strongly connected components
Consider the following graph: The number of strongly connected components of the graph are ________.

Consider the following graph:The number of strongly connected components of the graph are ________.

2.5k views

asked Sep 15, 2018

8 answers

27

GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$

The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...

24.2k views

commented Sep 13, 2018

8 answers

28

Minimum number of comparisons required to sort 5 elements is
The minimum number of comparisons required to sort 5 elements is - 4 5 6 7

The minimum number of comparisons required to sort 5 elements is -4567

43.6k views

commented Sep 13, 2018

1 answer

29

Test series
T(n) = T(root(n)) + n where n>=2 Time complexity ?

T(n) = T(root(n)) + n where n>=2Time complexity ?

640 views

commented Sep 10, 2018

2 answers

30

Test series
int main() { int a = 1, b = 2, c = 3; printf("%d", a += (a += 3, 5, a)); } How is this evaluated ?

int main() { int a = 1, b = 2, c = 3; printf("%d", a += (a += 3, 5, a)); } How is this evaluated ?

2.2k views

asked Aug 30, 2018

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