Dark Mode

Recent questions tagged out-of-gate-syllabus

0 votes

1 answer

1

#syallabus completion
HELLO SIR , SIR I HAVE LEFT WITH TOC, CD , DM AND CN AND I THOUGHT , I SHOULD LEAVE ANY TWO OF THESE SO THAT I CAN FOCUS ON REVISION PROPERLY… SO , I WANT TO KNOW THAT WHICH 2 OF THESE SHOULD LEFT ASIDE .

jaswinder asked in GATE Oct 12, 2023

200 views

0 votes

1 answer

2

Software engineering

gateexplore asked in IS&Software Engineering Jul 6, 2023

202 views

0 votes

0 answers

3

Software Engineering
Calculate cyclomatic complexity for the program to find the smallest of three numbers.

gateexplore asked in IS&Software Engineering Jul 5, 2023

148 views

0 votes

1 answer

4

Software engineering
Classes communicate with one another via: processed information Interfaces messages coupling

gateexplore asked in IS&Software Engineering Jul 5, 2023

709 views

0 votes

0 answers

5

Numerical Method Analysis : Help...
Use Secant method to find roots of: $x^3-2x^2+3x-5=0$ $x+1 = 4sinx$ $e^x = x + 2$

kidussss asked in Numerical Methods Mar 7, 2023

259 views

0 votes

0 answers

6

Numerical Method Analysis : Help....
Use NR method to find a root of the equation with tolerance x=0.00001. $x^3-2x-5=0$ $e^x-3x^2=0$

kidussss asked in Numerical Methods Mar 7, 2023

193 views

0 votes

0 answers

7

Numerical Method Analysis : Help...
Use Bisection method to find all roots of $x^3 – 5x + 3 = 0$

kidussss asked in Numerical Methods Mar 7, 2023

109 views

0 votes

0 answers

8

Numerical Method Analysis : Help...
Use Bisection method to find the root of the following equation with tolerance 0.001. $x^4 - 2x^3 - 4x^2 + 4x + 4 = 0$ $x^3 – e^x + sin(x) = 0$

kidussss asked in Numerical Methods Mar 7, 2023

265 views

0 votes

0 answers

9

GATE CSE 1995 | Question: 17b
Consider a CRT display that has a text mode display format of $80×25$ characters with a $9×12$ character cell. What is the size of the video buffer RAM for the display to be used in monochrome ($1$ bit per pixel) graphics mode

Arjun asked in Computer Peripherals Jul 14, 2019

by Arjun

1.4k views

13 votes

6 answers

10

GATE CSE 2019 | Question: 54
In an RSA cryptosystem, the value of the public modulus parameter $n$ is $3007$. If it is also known as that $\phi(n)=2880$ where $\phi()$ denotes Euler’s Totient Function, then the prime factor of $n$ which is greater than $50$ is _________

Arjun asked in Computer Networks Feb 7, 2019

by Arjun

8.9k views

39 votes

12 answers

11

GATE CSE 2017 Set 1 | Question: 44
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .

Arjun asked in Computer Networks Feb 14, 2017

by Arjun

23.7k views

39 votes

3 answers

12

GATE CSE 2017 Set 1 | Question: 15
A sender $S$ sends a message $m$ to receiver $R$, which is digitally signed by $S$ with its private key. In this scenario, one or more of the following security violations can take place. $S$ ... with a fraudulent message Which of the following are possible security violations? I and II only I only II only II and III only

Arjun asked in Computer Networks Feb 14, 2017

by Arjun

12.5k views

1 vote

0 answers

13

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

580 views

0 votes

0 answers

14

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

1 answer

15

GATE CSE 1988 | Question: 14ii
Consider the following well-formed formula: $\exists x \forall y [ \neg \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(x,y)]$ Show using resolution principle that the well-formed formula, given above, cannot be satisfied for any interpretation.

go_editor asked in Mathematical Logic Dec 20, 2016

665 views

1 vote

1 answer

16

GATE CSE 1988 | Question: 14i
Consider the following well-formed formula: $\exists x \forall y [ \neg \: \exists z [ p (y, z) \wedge p (z, y) ] \equiv p(x,y)]$ Express the above well-formed formula in clausal form.

go_editor asked in Mathematical Logic Dec 20, 2016

651 views

7 votes

3 answers

17

GATE CSE 1988 | Question: 13iii
Are the two digraphs shown in the above figure isomorphic? Justify your answer.

go_editor asked in Graph Theory Dec 20, 2016

1.2k views

1 vote

1 answer

18

GATE CSE 1988 | Question: 13ic
Verify whether the following mapping is a homomorphism. If so, determine its kernel. $f(x)=x^3$, for all $x$ belonging to $G$.

go_editor asked in Set Theory & Algebra Dec 20, 2016

545 views

1 vote

0 answers

19

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

20

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

443 views

1 vote

1 answer

21

GATE CSE 1988 | Question: 10iia
Translate the executable statements of the following Pascal Program into quadruples. Assume that integer and real values require four words each. repeat flag[i]:=true; while turn !=i do begin while flag[j] do skip turn:=i; end critical section flag[i]:=false; until false Program Test; ... 1...10] of real; begin i:=0; While i:<=10 do begin a[i]:=0; i:=i+1 end; end.

go_editor asked in Compiler Design Dec 19, 2016

812 views

1 vote

0 answers

22

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

499 views

0 votes

0 answers

23

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

24

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

0 votes

0 answers

25

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

469 views

0 votes

1 answer

26

GATE CSE 1988 | Question: 2xiii
What is referential transparency?

go_editor asked in Programming in C Dec 19, 2016

610 views

0 votes

0 answers

27

GATE CSE 1989 | Question: 12b
Consider a database with the following three relations: CREDITS (STUDENT; COURSE) OFFERS (TEACHER; COURSE) BELONGS (TEACHER; DEPARTMENT) Given below is a code in query language QUEL. Describe in one English sentence the query posed by the given QUEL program. range of s is ... range of e2 is LIST2 range of e3 is LIST3 retrieve(E1.I) where e1.I=e2.I and where e1.I=e3.I

makhdoom ghaya asked in Databases Dec 15, 2016

by makhdoom ghaya

516 views

0 votes

0 answers

28

GATE CSE 1988 | Question: 2iv
Give one property of the field of real numbers which no longer holds when we compute using finite-precision floating point numbers.

go_editor asked in Set Theory & Algebra Dec 11, 2016

482 views

1 vote

0 answers

29

GATE CSE 1988 | Question: 2i
If the transportation problem is solved using some version of the simplex algorithm, under what condition will the solution always have integer values?

go_editor asked in Others Dec 11, 2016

388 views

1 vote

0 answers

30

GATE CSE 1988 | Question: 1vi
An $8212$ in handshake mode of implementation is used in a device controller of a microprocessor-based system. The $8212$ control signals used for the purpose of handshaking are _________ at the microprocessor end, and ________ at the device end.

go_editor asked in Others Dec 10, 2016

400 views

Page:

1
2
3
4
5
next »

Recent questions tagged out-of-gate-syllabus