Dark Mode

Recent questions without answers

0 votes

0 answers

15601

C programmng
#include<stdio.h> int main(void) { char a[50]; printf(" %d", scanf("%s", a)); getchar(); } What will be the output and explain its working?

deepak_yadav asked in Programming in C Dec 20, 2016

by deepak_yadav

187 views

1 vote

0 answers

15602

Test Series
The time taken to execute a program in a non-pipelined machine is t. The same program is then executed on an m stage pipeline. The cost of all the logic stages of the pipeline is given by c and h is the cost of each latch. The delay incurred by each pipeline stage is d. What is the expression for pipeline performance/cost ratio.

Aghori asked in CO and Architecture Dec 20, 2016

by Aghori

317 views

0 votes

0 answers

15603

PETER LINZ
Give the regular expression for-( input symbol =a,b) L={w: number of a mod 5>0}

sushmita asked in Theory of Computation Dec 20, 2016

260 views

0 votes

0 answers

15604

predictive parser

iita asked in Compiler Design Dec 20, 2016

by iita

314 views

0 votes

0 answers

15605

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)

Sanket_ asked in Algorithms Dec 20, 2016

226 views

1 vote

0 answers

15606

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.

go_editor asked in Others Dec 20, 2016

579 views

0 votes

0 answers

15607

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.

go_editor asked in Linear Algebra Dec 20, 2016

734 views

1 vote

0 answers

15608

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

go_editor asked in Graph Theory Dec 20, 2016

483 views

1 vote

0 answers

15609

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.

go_editor asked in Set Theory & Algebra Dec 20, 2016

442 views

0 votes

0 answers

15610

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

rahul sharma 5 asked in Mathematical Logic Dec 20, 2016

by rahul sharma 5

639 views

0 votes

0 answers

15611

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

Çșȇ ʛấẗẻ asked in CO and Architecture Dec 20, 2016

by Çșȇ ʛấẗẻ

129 views

1 vote

0 answers

15612

Meenakshi Sharma asked in Operating System Dec 19, 2016

by Meenakshi Sharma

197 views

0 votes

0 answers

15613

priyanka gautam-piya asked in CO and Architecture Dec 19, 2016

by priyanka gautam-piya

307 views

1 vote

0 answers

15614

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??

sushmita asked in Theory of Computation Dec 19, 2016

1.7k views

0 votes

0 answers

15615

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 __________ .

Kai asked in CO and Architecture Dec 19, 2016

by Kai

236 views

0 votes

0 answers

15616

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

Kai asked in Algorithms Dec 19, 2016

by Kai

338 views

0 votes

0 answers

15617

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 ?

Sanket_ asked in Programming in C Dec 19, 2016

284 views

0 votes

0 answers

15618

Match the following

Samujjal Das asked in Theory of Computation Dec 19, 2016

by Samujjal Das

416 views

0 votes

0 answers

15619

# 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.

LavTheRawkstar asked in Quantitative Aptitude Dec 19, 2016

by LavTheRawkstar

339 views

1 vote

0 answers

15620

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}$ ...

go_editor asked in CO and Architecture Dec 19, 2016

495 views

1 vote

0 answers

15621

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?

go_editor asked in Programming in C Dec 19, 2016

495 views

0 votes

0 answers

15622

GATE CSE 1988 | Question: 8iii
Write a LISP function to compute the product of all the numbers in a list. Assume that the list contains only number.

go_editor asked in Programming in C Dec 19, 2016

452 views

0 votes

0 answers

15623

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

go_editor asked in CO and Architecture Dec 19, 2016

272 views

1 vote

0 answers

15624

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)

go_editor asked in CO and Architecture Dec 19, 2016

501 views

1 vote

0 answers

15625

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.

go_editor asked in CO and Architecture Dec 19, 2016

529 views

0 votes

0 answers

15626

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

rahul sharma 5 asked in Algorithms Dec 19, 2016

by rahul sharma 5

349 views

0 votes

0 answers

15627

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.

go_editor asked in Programming in C Dec 19, 2016

468 views

0 votes

0 answers

15628

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?

vaishali jhalani asked in CO and Architecture Dec 19, 2016

by vaishali jhalani

185 views

0 votes

0 answers

15629

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:)

rahuldb asked in Compiler Design Dec 19, 2016

379 views

0 votes

0 answers

15630

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

rahul sharma 5 asked in Programming in C Dec 19, 2016

by rahul sharma 5

341 views

Page:

« prev
1
...
516
517
518
519
520
521
522
523
524
525
526
...
591
next »

Recent questions without answers