Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged out-of-gate-syllabus
21
votes
4
answers
61
GATE IT 2008 | Question: 70
The total number of keys required for a set of $n$ individuals to be able to communicate with each other using secret key and public key cryptosystems, respectively are: $n(n-1)$ and $2n$ $2n$ and $\dfrac{n(n - 1)}{2}$ $\dfrac{n(n - 1)}{2}$ and $2n$ $\dfrac{n(n - 1)}{2}$ and $n$
Ishrat Jahan
asked
in
Computer Networks
Oct 29, 2014
by
Ishrat Jahan
8.9k
views
gateit-2008
computer-networks
network-security
normal
out-of-gate-syllabus
28
votes
7
answers
62
GATE IT 2008 | Question: 18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame? $10,000$ bytes $12,000$ bytes $15,000$ bytes $27,000$ bytes
Ishrat Jahan
asked
in
Computer Networks
Oct 28, 2014
by
Ishrat Jahan
12.5k
views
gateit-2008
computer-networks
communication
serial-communication
normal
out-of-gate-syllabus
8
votes
1
answer
63
GATE CSE 1995 | Question: 17a
An asynchronous serial communication controller that uses a start-stop scheme for controlling the serial I/O of a system is programmed for a string of length seven bits, one parity bit (odd parity) and one stop bit. The transmission rate is ... the complete bit stream that is transmitted for the string $ 0110101'?$ How many such string can be transmitted per second?
Kathleen
asked
in
Computer Networks
Oct 8, 2014
by
Kathleen
1.6k
views
gate1995
computer-networks
serial-communication
normal
descriptive
out-of-gate-syllabus
1
vote
1
answer
64
GATE CSE 1995 | Question: 2.18
The solution of differential equation $y''+3y'+2y=0$ is of the form $C_1e^x+C_2e^{2x}$ $C_1e^{-x}+C_2e^{3x}$ $C_1e^{-x}+C_2e^{-2x}$ $C_1e^{-2x}+C_2e^{-x}$
Kathleen
asked
in
Calculus
Oct 8, 2014
by
Kathleen
754
views
gate1995
calculus
out-of-gate-syllabus
0
votes
3
answers
65
GATE CSE 1995 | Question: 2.15
The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is $x_{k+1} = 3(x_k+b)/2x_k$ $x_{k+1} = (x_{k}^2+b)/2x_k$ $x_{k+1} = x_k-2x_k/\left(x^2_k+b\right)$ None of the above
Kathleen
asked
in
Numerical Methods
Oct 8, 2014
by
Kathleen
2.1k
views
gate1995
numerical-methods
newton-raphson
normal
out-of-gate-syllabus
0
votes
1
answer
66
GATE CSE 1995 | Question: 2.1
A sequence of two instructions that multiplies the contents of the DE register pair by 2 and stores the result in the HL register pair (in 8085 assembly language) is: XCHG and DAD B XTHL and DAD H PCHL and DAD D XCHG and DAD H
Kathleen
asked
in
CO and Architecture
Oct 8, 2014
by
Kathleen
2.9k
views
gate1995
co-and-architecture
8085-microprocessor
out-of-gate-syllabus
0
votes
2
answers
67
GATE CSE 1995 | Question: 1.23
The value of $k$ for which $4x^2 – 8xy + ky^2 = 0$ does not represent a pair of straight lines (both passing through the origin) is: 0 2 9 3
Kathleen
asked
in
Others
Oct 8, 2014
by
Kathleen
493
views
gate1995
lines-curves
out-of-gate-syllabus
2
votes
2
answers
68
GATE CSE 1995 | Question: 1.22
If at every point of a certain curve, the slope of the tangent equals $\frac{-2x}{y}$ the curve is a straight line a parabola a circle an ellipse
Kathleen
asked
in
Others
Oct 8, 2014
by
Kathleen
1.8k
views
gate1995
lines-curves
out-of-gate-syllabus
1
vote
1
answer
69
GATE CSE 1995 | Question: 1.1
A single instruction to clear the lower four bits of the accumulator in 8085 assembly language? XRI 0FH ANI F0H XRI F0H ANI 0FH
Kathleen
asked
in
CO and Architecture
Oct 8, 2014
by
Kathleen
2.2k
views
gate1995
co-and-architecture
8085-microprocessor
out-of-gate-syllabus
1
vote
1
answer
70
GATE CSE 1994 | Question: 22
Consider the program below: Program main: var r:integer; procedure two: begin write (r); end procedure one: var r:integer; begin r:=5; two; end begin r:=2; two; one; two; end What is printed by the above program if Static scoping is assumed for all variables; Dynamic scoping is assumed for all variables. Give reasons for your answer.
Kathleen
asked
in
Programming
Oct 6, 2014
by
Kathleen
1.4k
views
gate1994
programming
variable-binding
normal
out-of-gate-syllabus
3
votes
0
answers
71
GATE CSE 1994 | Question: 16
Every element $a$ of some ring $(R, +, o)$ satisfies the equation $a\;o\;a=a$. Decide whether or not the ring is commutative.
Kathleen
asked
in
Set Theory & Algebra
Oct 6, 2014
by
Kathleen
418
views
gate1994
set-theory&algebra
ring
normal
out-of-gate-syllabus
descriptive
0
votes
3
answers
72
GATE CSE 1994 | Question: 3.4
Match the following items (i) Newton-Raphson (a) Integration (ii) Runge-Kutta (b) Root finding (iii) Gauss-Seidel (c) Ordinary Differential Equations (iv) Simpson's Rule (d) Solution of Systems of Linear Equations
Kathleen
asked
in
Numerical Methods
Oct 4, 2014
by
Kathleen
9.4k
views
gate1994
numerical-methods
easy
out-of-gate-syllabus
0
votes
0
answers
73
GATE CSE 1994 | Question: 1.3
Backward Euler method for solving the differential equation $\frac{dy}{dx}=f(x, y)$ is specified by, (choose one of the following). $y_{n+1}=y_n+hf(x_n, y_n)$ $y_{n+1}=y_n+hf(x_{n+1}, y_{n+1})$ $y_{n+1}=y_{n-1}+2hf(x_n, y_n)$ $y_{n+1}= (1+h)f(x_{n+1}, y_{n+1})$
Kathleen
asked
in
Numerical Methods
Oct 4, 2014
by
Kathleen
818
views
gate1994
numerical-methods
backward-euler-method
out-of-gate-syllabus
3
votes
1
answer
74
GATE CSE 1994 | Question: 1.1
Kathleen
asked
in
Others
Oct 4, 2014
by
Kathleen
1.2k
views
gate1994
fortran
out-of-gate-syllabus
0
votes
0
answers
75
GATE CSE 1993 | Question: 20
Kathleen
asked
in
CO and Architecture
Sep 30, 2014
by
Kathleen
446
views
gate1993
co-and-architecture
8085-microprocessor
out-of-gate-syllabus
38
votes
2
answers
76
GATE CSE 1993 | Question: 6.4, ISRO2008-14
Assume that each character code consists of $8$ bits. The number of characters that can be transmitted per second through an asynchronous serial line at $2400$ baud rate, and with two stop bits is $109$ $216$ $218$ $219$
Kathleen
asked
in
Computer Networks
Sep 30, 2014
by
Kathleen
7.9k
views
gate1993
computer-networks
serial-communication
normal
isro2008
out-of-gate-syllabus
11
votes
3
answers
77
GATE CSE 1997 | Question: 2.3
Purpose of a start bit in $\text{RS-232}$ serial communication protocol is: to synchronize receiver for receiving every byte to synchronize receiver for receiving a sequence of bytes a parity bit to synchronize receiver for receiving the last byte
Kathleen
asked
in
Computer Networks
Sep 29, 2014
by
Kathleen
3.1k
views
gate1997
computer-networks
serial-communication
normal
out-of-gate-syllabus
41
votes
3
answers
78
GATE CSE 2011 | Question: 2
A layer-$4$ firewall (a device that can look at all protocol headers up to the transport layer) CANNOT block entire $\text{HTTP}$ traffic during $9:00PM$ and $5:00AM$ block all $\text{ICMP}$ traffic stop incoming traffic from specific $\text{IP}$ ... same IP address block $\text{TCP}$ traffic from a specific user on a multi-user system during $9:00PM$ to $5:00AM$
go_editor
asked
in
Computer Networks
Sep 29, 2014
by
go_editor
13.5k
views
gatecse-2011
computer-networks
network-security
firewall
normal
out-of-gate-syllabus
8
votes
5
answers
79
GATE CSE 2014 Set 3 | Question: 19, ISRO2017-78
In the context of modular software design, which one of the following combinations is desirable? High cohesion and high coupling High cohesion and low coupling Low cohesion and high coupling Low cohesion and low coupling
go_editor
asked
in
IS&Software Engineering
Sep 28, 2014
by
go_editor
4.9k
views
gatecse-2014-set3
is&software-engineering
easy
isro2017
out-of-gate-syllabus
49
votes
5
answers
80
GATE CSE 2014 Set 2 | Question: 27
An IP machine $Q$ has a path to another $IP\ machine\ H$ via three $IP\ routers \ R1, R2,$ and $R3$. $Q-R1-R2-R3-H$ $H$ acts as an $\text{HTTP}\ server$, and $Q$ connects to $H$ via $\text{HTTP}$ and downloads a file. Session layer ... $R2$ alone? Only $I1$ and $I2$ Only $I1$ Only $I2$ and $I3$ Only $I3$ and $I4$
go_editor
asked
in
Computer Networks
Sep 28, 2014
by
go_editor
11.2k
views
gatecse-2014-set2
computer-networks
network-security
normal
out-of-gate-syllabus
19
votes
4
answers
81
GATE CSE 2014 Set 1 | Question: 24
Which of the following are used to generate a message digest by the network security protocols? RSA SHA-$1$ DES MD5 I and III only II and III only II and IV only III and IV only
go_editor
asked
in
Computer Networks
Sep 26, 2014
by
go_editor
5.3k
views
gatecse-2014-set1
computer-networks
network-security
normal
out-of-gate-syllabus
19
votes
2
answers
82
GATE CSE 1998 | Question: 1.16
In serial communication employing $8$ data bits, a parity bit and $2$ stop bits, the minimum band rate required to sustain a transfer rate of $300$ characters per second is $2400$ band $19200$ band $4800$ band $1200$ band
Kathleen
asked
in
Computer Networks
Sep 26, 2014
by
Kathleen
6.5k
views
gate1998
computer-networks
communication
serial-communication
normal
out-of-gate-syllabus
1
vote
1
answer
83
GATE CSE 1998 | Question: 1.3
Which of the following statements applies to the bisection method used for finding roots of functions: converges within a few iterations guaranteed to work for all continuous functions is faster than the Newton-Raphson method requires that there be no error in determining the sign of the function
Kathleen
asked
in
Numerical Methods
Sep 26, 2014
by
Kathleen
18.2k
views
gate1998
numerical-methods
bisection-method
easy
out-of-gate-syllabus
23
votes
3
answers
84
GATE CSE 2013 | Question: 13
Using public key cryptography, $X$ adds a digital signature σ to message $M$, encrypts $\langle M, \sigma \rangle$, and sends it to $Y$, where it is decrypted. Which one of the following sequences of keys is used for the operations? Encryption: $X's$ ... : $X's$ private key followed by $Y's$ public key; Decryption: $Y's$ private key followed by $X's$ public key
Arjun
asked
in
Computer Networks
Sep 23, 2014
by
Arjun
7.5k
views
gatecse-2013
computer-networks
network-security
normal
out-of-gate-syllabus
21
votes
3
answers
85
GATE CSE 2009 | Question: 46
In the RSA public key cryptosystem, the private and public keys are $(e, n)$ and $(d, n)$ respectively, where $n=p \times q$ and $p$ and $q$ are large primes. Besides, $n$ is public and $p$ and $q$ are private. Let $M$ be an integer ... Which of the above equations correctly represents RSA cryptosystem? I and II I and III II and IV III and IV
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
5.7k
views
gatecse-2009
computer-networks
network-security
normal
out-of-gate-syllabus
16
votes
3
answers
86
GATE CSE 2007 | Question: 19
In Ethernet when Manchester encoding is used, the bit rate is: Half the baud rate Twice the baud rate Same as the baud rate None of the above
Kathleen
asked
in
Computer Networks
Sep 22, 2014
by
Kathleen
9.0k
views
gatecse-2007
computer-networks
ethernet
manchester-encoding
normal
out-of-gate-syllabus
15
votes
7
answers
87
GATE CSE 2004 | Question: 30, ISRO2017-10
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$ both $\text{NP}$ complete $\text{NP}$-complete and in $\text{P}$ respectively undecidable and $\text{NP}$ complete respectively
Kathleen
asked
in
Algorithms
Sep 19, 2014
by
Kathleen
10.3k
views
gatecse-2004
algorithms
p-np-npc-nph
easy
isro2017
out-of-gate-syllabus
23
votes
3
answers
88
GATE CSE 2004 | Question: 22
How many $8-bi$t characters can be transmitted per second over a $9600$ baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits and one parity bit? $600$ $800$ $876$ $1200$
Kathleen
asked
in
Computer Networks
Sep 19, 2014
by
Kathleen
12.7k
views
gatecse-2004
computer-networks
serial-communication
normal
out-of-gate-syllabus
21
votes
5
answers
89
GATE CSE 2006 | Question: 16, ISRO-DEC2017-27
Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true? R is NP-complete R is NP-hard Q is NP-complete Q is NP-hard
Rucha Shelke
asked
in
Algorithms
Sep 17, 2014
by
Rucha Shelke
15.4k
views
gatecse-2006
algorithms
p-np-npc-nph
normal
isrodec2017
out-of-gate-syllabus
15
votes
3
answers
90
GATE CSE 2003 | Question: 12
Ram and Shyam have been asked to show that a certain problem $\Pi$ is $\text{NP-complete}.$ Ram shows a polynomial time reduction from the $\text{3-SAT}$ problem to $\Pi$, and Shyam shows a polynomial time reduction from $\Pi$ to $\text{3-SAT.}$ Which of ... not NP-complete $\Pi$ is in NP, but is not NP-complete $\Pi$ is NP-complete $\Pi$ is neither NP-hard, nor in NP
Kathleen
asked
in
Algorithms
Sep 16, 2014
by
Kathleen
6.4k
views
gatecse-2003
algorithms
p-np-npc-nph
normal
out-of-gate-syllabus
Page:
« prev
1
2
3
4
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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
Recent Posts
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged out-of-gate-syllabus
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...