Recent activity by shubham007 / GATE Overflow for GATE CSE

5 answers

1

GATE CSE 2018 | Question: 32
Consider the following C code. Assume that unsigned long int type length is $64$ bits. unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for( i=n; i>1; i=i/2) j++; for( ; j>1; j=j/2) sum++; return sum; } The value returned when we call fun with the input $2^{40}$ is: $4$ $5$ $6$ $40$

Consider the following C code. Assume that unsigned long int type length is $64$ bits.unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for(...

16.1k views

commented Sep 15, 2018

2 answers

2

Finite Automata to Regular Expression.Can this be solved further?
Convert the given Finite Automata to Regular Expression.

Convert the given Finite Automata to Regular Expression.

3.2k views

commented Aug 19, 2018

0 answers

3

ace quetion bank
the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 modulo 5 has ______ states.

the minimal finite automata accepting the set of all strings over { 0, 1} starting with 1 that interpreted as the binary representation of an integer are congruent to 0 m...

500 views

asked Aug 19, 2018

0 answers

4

Test Series
Consider the circuit with initial state Q0=0,Q1=0 and Q2=0. Then which of the following sequence of output is correct? a)4, 6, 3 b) 1, 3, 7 c) 3, 6, 4 d) 7, 3, 1

Consider the circuit with initial state Q0=0,Q1=0 and Q2=0.Then which of the following sequence of output is correct?a)4, 6, 3b) 1, 3, 7c) 3, 6, 4d) 7, 3, 1

455 views

commented Jan 27, 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