Recent questions without answers / GATE Overflow for GATE CSE

0 votes

0 answers

15601

complexity
Which of the following is correct? a)If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) b)If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n)) c)Both (a) and (b) d)None of the above ans given is b) but there is nothing given about functions so it is possible that there is some function like-. f(n)=n and g(n)=n^(2*sinn) then we cannot say anything i think it should be d)

Which of the following is correct?a)If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) b)If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n))c)Both (a) and (b)d)None of the aboveans give...

Sanket_

243 views

Sanket_ asked Dec 20, 2016

1 votes

0 answers

15602

GATE CSE 1988 | Question: 17i-ii-iii
The following table gives the cost of transporting one tonne of goods from the origins A, B, C to the destinations F, G, H. Also shown are the availabilities of the goods at the origins and the requirements at the destinations. The ... . For the solution of (ii) above, calculate the values of the duals and determine whether this is an optimal solution.

The following table gives the cost of transporting one tonne of goods from the origins A, B, C to the destinations F, G, H. Also shown are the availabilities of the goods...

go_editor

603 views

go_editor asked Dec 20, 2016

1 votes

0 answers

15603

GATE CSE 1988 | Question: 16ii-iii
If $x \| \underline{x} \| \infty = 1< i^{max} < n \: \: max \: \: ( \mid x1 \mid ) $ for the vector $\underline{x} = (x1, x2 \dots x_n)$ ... known property of this norm. Although this norm is very easy to calculate for any matrix, explain why the condition number is difficult (i.e. expensive) to calculate.

If $x \| \underline{x} \| \infty = 1< i^{max} < n \: \: max \: \: ( \mid x1 \mid ) $ for the vector $\underline{x} = (x1, x2 \dots x_n)$ and $\| A \| \infty = x^{Sup} \fr...

go_editor

752 views

go_editor asked Dec 20, 2016

2 votes

0 answers

15604

GATE CSE 1988 | Question: 13ib
Verify whether the following mapping is a homomorphism. If so, determine its kernel. $\overline{G}=G$

Verify whether the following mapping is a homomorphism. If so, determine its kernel.$\overline{G}=G$

go_editor

485 views

go_editor asked Dec 20, 2016

1 votes

0 answers

15605

GATE CSE 1988 | Question: 13ia
Verify whether the following mapping is a homomorphism. If so, determine its kernel. $G$ is the group of non zero real numbers under multiplication.

Verify whether the following mapping is a homomorphism. If so, determine its kernel.$G$ is the group of non zero real numbers under multiplication.

go_editor

452 views

go_editor asked Dec 20, 2016

0 votes

0 answers

15606

Propositional Logic Discrete Maths
There is a student in the class who has sent an e-mail to everyone else in the class,Consider domain as all students in a class. Assume M(x,y) means x has send an email to y Answer given is :- ∃x∀y[(x≠y)→M(x,y)] it's gonna result in True if the x=y and the student has sent himself an email Shall we use ^ consider instead of -> ?Please correct

There is a student in the class who has sent an e-mail to everyone else in the class,Consider domain as all students in a class.Assume M(x,y) means x has send an email to...

rahul sharma 5

657 views

rahul sharma 5 asked Dec 20, 2016

0 votes

0 answers

15607

# CO Dout
1 word is equal to how many bytes or is there is way to calculate from given scenario??

1 word is equal to how many bytes or is there is way to calculate from given scenario??

Çșȇ ʛấẗẻ

129 views

Çșȇ ʛấẗẻ asked Dec 20, 2016

1 votes

0 answers

15608

galvin ex.

Meenakshi Sharma

203 views

Meenakshi Sharma asked Dec 19, 2016

0 votes

0 answers

15609

polling

priyanka gautam-piya

310 views

priyanka gautam-piya asked Dec 19, 2016

1 votes

0 answers

15610

push down automata
How many states will the pda for a^n b^n c^m d^m have?? I know it can be drawn using 5 states as given everywhere. But i think it can be drawn using 4 states also. can anyone tell??

How many states will the pda for a^n b^n c^m d^m have??I know it can be drawn using 5 states as given everywhere. But i think it can be drawn using 4 states also. can any...

sushmita

1.7k views

sushmita asked Dec 19, 2016

0 votes

0 answers

15611

MadeEasy Subject Test: CO & Architecture - Dma
Consider a disk drive with 16 surfaces, 512 tracks / surface, 256 sectors / track, 8 KB / sector with a rotation speed of 3600 rpm. The disk is operated in cycle stealing mode where by whenever 1 B word is ready it is sent ... for each memory cycle is 50 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is __________ .

Consider a disk drive with 16 surfaces, 512 tracks / surface, 256 sectors / track, 8 KB / sector with a rotation speed of 3600 rpm. The disk is operated in cycle stealing...

Kai

242 views

Kai asked Dec 19, 2016

0 votes

0 answers

15612

MadeEasy Test Series: Algorithms - Time Complexity
Can someone prove this?

Can someone prove this?

Kai

337 views

Kai asked Dec 19, 2016

0 votes

0 answers

15613

Confusion- hashing
What is the average number of probs requires for unsuccessful search into an open-address hash table with load factor α (assume uniform hashing) . there are two derivations given one leads to 1/(1-α) and the other leads to 1/2(1+1/(1-α)^2) plz explain the distinction ?

What is the average number of probs requires for unsuccessful search into an open-address hash table with load factor α (assume uniform hashing) .there are two derivatio...

Sanket_

294 views

Sanket_ asked Dec 19, 2016

0 votes

0 answers

15614

Match the following

Samujjal Das

421 views

Samujjal Das asked Dec 19, 2016

0 votes

0 answers

15615

# Cubes # Quantitative Aptitude
A Cube of side 4 cm is cut into 64 equal parts which are numbered from 1 to 64 in such a manner.The cube is single Diagonal cut. Now find the sum of the elements of the cubes which are cut by the single diagonal cut.

A Cube of side 4 cm is cut into 64 equal parts which are numbered from 1 to 64 in such a manner.The cube is single Diagonal cut.Now find the sum of the elements of the cu...

LavTheRawkstar

350 views

LavTheRawkstar asked Dec 19, 2016

1 votes

0 answers

15616

GATE CSE 1988 | Question: 9ii
The code for the implementation of a sub-routine to convert positive numeric data from binary to appropriate character string in a $PDP-11$ like machine has been given below Note-that $SP$ is the stack pointer and $R_i$ represents $i^{th}$ ...

The code for the implementation of a sub-routine to convert positive numeric data from binary to appropriate character string in a $PDP-11$ like machine has been given be...

go_editor

508 views

go_editor asked Dec 19, 2016

1 votes

0 answers

15617

GATE CSE 1988 | Question: 8iv
Consider the following Ada program: Procedure P is BAD-FORMAT: exception Procedure Q is begin ... if S/='b' then raise BAD-FORMAT end if; ... end Q; Procedure R is begin Q; exception when BAD-Format => ... handler body 1 end R; begin ... when BAD-FORMAT => ... handler body 2 end P; Under what conditions are the two handler bodies $1$ and $2$ executed?

Consider the following Ada program:Procedure P is BAD-FORMAT: exception Procedure Q is begin ... if S/='b' then raise BAD-FORMAT end if; ... end Q; Procedure R is begin Q...

go_editor

503 views

go_editor asked Dec 19, 2016

0 votes

0 answers

15618

GATE CSE 1988 | Question: 5ii
Briefly explain the term “Configuring a programmable peripheral chip”.

Briefly explain the term “Configuring a programmable peripheral chip”.

go_editor

272 views

go_editor asked Dec 19, 2016

1 votes

0 answers

15619

GATE CSE 1988 | Question: 5i
A ROM has the following time parameters: Maximum Address to valid Data Output delay $= 30$ n sec. Maximum Chip Select to valid Data Output delay $= 20$ n sec. Maximum Data Hold time (after address change or after chip deselect) $= 10$ n ... negligible What is the maximum rate at which a CPU can continuously read data from this ROM? (Show your calculations step-by-step)

A ROM has the following time parameters:Maximum Address to valid Data Output delay $= 30$ n sec.Maximum Chip Select to valid Data Output delay $= 20$ n sec.Maximum Data H...

go_editor

522 views

go_editor asked Dec 19, 2016

1 votes

0 answers

15620

GATE CSE 1988 | Question: 4i
An $8$-bit data path is to be set up using two $4$-bit ALU's and suitable multiplexers. The ALU's accept two operands $A$ and $B$ on which a total of $16$ operations can be performed. The operand $A$ is from one of two ... a bus. List the data path control signals, and estimate the minimum width of a signal microcode word needed for the generation of these signals.

An $8$-bit data path is to be set up using two $4$-bit ALU’s and suitable multiplexers. The ALU’s accept two operands $A$ and $B$ on which a total of $16$ operations ...

go_editor

536 views

go_editor asked Dec 19, 2016

0 votes

0 answers

15621

MadeEasy Test Series: Programming & DS - Stack
Please explain S2 statement

Please explain S2 statement

rahul sharma 5

362 views

rahul sharma 5 asked Dec 19, 2016

0 votes

0 answers

15622

GATE CSE 1988 | Question: 2xiv
Which of the following features are available in Ada? procedures, monitors, packages, common statement, goto statement, generic unit tasks, backtracking, recursion, exceptions, pragmas, classes.

Which of the following features are available in Ada?procedures, monitors, packages, common statement, goto statement, generic unit tasks, backtracking, recursion, except...

go_editor

489 views

go_editor asked Dec 19, 2016

0 votes

0 answers

15623

self doubt
I am confused between memory mapped IO and Isolated IO I read that for large amount of data transfer memory mapped io are used because they have variety of instructions so they are fast But as isolated io has very less no of instruction and complex structure ... but isolated io has separate bus so comparatively fast. Now from these two statements how to infer which one is fast/better?

I am confused between memory mapped IO and Isolated IOI read that for large amount of data transfer memory mapped io are used because they have variety of instructions so...

vaishali jhalani

186 views

vaishali jhalani asked Dec 19, 2016

0 votes

0 answers

15624

Consider the regular expression 1(1+0)*0.
Consider the regular expression 1(1+0)*0. Contruct the NFA for the given regular expression using Thomson’s construction algorithm and then apply subset construction algorithm to construct the equivalent DFA of the constructed NFA.Finally minimize the DFA. Please answer with working:)

Consider the regular expression 1(1+0)*0.Contruct the NFA for the given regular expression using Thomson’s construction algorithm and then apply subset construction alg...

rahuldb

397 views

rahuldb asked Dec 19, 2016

0 votes

0 answers

15625

Preorder/Postorder Tree
I am getting 6 as the answer,but correct answer given is 5.Plese correct.

I am getting 6 as the answer,but correct answer given is 5.Plese correct.

rahul sharma 5

349 views

rahul sharma 5 asked Dec 19, 2016

1 votes

0 answers

15626

paged virtual memory numerical

Meenakshi Sharma

516 views

Meenakshi Sharma asked Dec 18, 2016

1 votes

0 answers

15627

self doubt
a=10,. b=(++a) +(a++); how this expression actualy run in computer?. i know ans according to me post increment have higher precedence then pre increment so it will trigger a increment operation which will excute after evalution of whole ... then && operator evalute ? how short circut rule actualy work here ? compiler made some changes before execution such expreesion.?

a=10,. b=(++a) +(a++);how this expression actualy run in computer?. i know ansaccording to me post increment have higher precedence then pre increment so it will trigger ...

Vaishali Trivedi

230 views

Vaishali Trivedi asked Dec 18, 2016

2 votes

0 answers

15628

regular or CFL
Which of the following is true? L is Regular L is Context Free L is not Regular L is not Context Free please tell whether it is CFL os not?if it is,then wht will be the corresponding PDA??

Which of the following is true? L is Regular L is Context Free L is not Regular L is not Context Freeplease tell whether it is CFL os not?if it is,then wht will be th...

Akriti sood

153 views

Akriti sood asked Dec 18, 2016

2 votes

0 answers

15629

GATE CSE 1988 | Question: 2xi
A modern day machine typically has an atomic TEST AND SET instruction. Why?

A modern day machine typically has an atomic TEST AND SET instruction. Why?

go_editor

672 views

go_editor asked Dec 18, 2016

2 votes

0 answers

15630

Analysis Of Prims Algorithm
I have seen many varients of complexities using diferent data structures in implementing Prims Agorithm. Can you pls post standard algorithm and tells me in details how to derive the complexities. Please also mention the variations possibles when data structure changes and How will effect the complexity taking Best case and Worst case senarios .

I have seen many varients of complexities using diferent data structures in implementing Prims Agorithm. Can you pls post standard algorithm and tells me in details how ...

PEKKA

911 views

PEKKA asked Dec 18, 2016

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