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 gatecse-2010
26
votes
4
answers
31
GATE CSE 2010 | Question: 35
What is the value printed by the following C program? #include<stdio.h> int f(int *a, int n) { if (n <= 0) return 0; else if (*a % 2 == 0) return *a+f(a+1, n-1); else return *a - f(a+1, n-1); } int main() { int a[] = {12, 7, 13, 4, 11, 6}; printf("%d", f(a, 6)); return 0; } $-9$ $5$ $15$ $19$
go_editor
asked
in
Algorithms
Sep 30, 2014
by
go_editor
11.6k
views
gatecse-2010
algorithms
recursion
identify-function
normal
67
votes
2
answers
32
GATE CSE 2010 | Question: 34
The weight of a sequence $a_0,a_1, \dots, a_{n-1}$ of real numbers is defined as $a_0+a_1/2+ \dots + a_{n-1}/2^{n-1}$. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let $X$ denote the ... $X$ is equal to $max(Y, a_0+Y)$ $max(Y, a_0+Y/2)$ $max(Y, a_0 +2Y)$ $a_0+Y/2$
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
17.8k
views
gatecse-2010
algorithms
dynamic-programming
normal
47
votes
3
answers
33
GATE CSE 2010 | Question: 33
A $5-$stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID, OF and WO stages take $1$ clock cycle each for any instruction. The PO stage takes $1$ clock cycle for ... $13$ $15$ $17$ $19$
go_editor
asked
in
CO and Architecture
Sep 29, 2014
by
go_editor
22.1k
views
gatecse-2010
co-and-architecture
pipelining
normal
53
votes
10
answers
34
GATE CSE 2010 | Question: 32
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$ $10$, $11$, $01$, $00$ $10$, $00$, $01$, $11$ $11$, $10$, $00$, $01$
go_editor
asked
in
Digital Logic
Sep 29, 2014
by
go_editor
30.5k
views
gatecse-2010
digital-logic
circuit-output
normal
30
votes
4
answers
35
GATE CSE 2010 | Question: 31
What is the boolean expression for the output $f$ of the combinational logic circuit of NOR gates given below? $\overline{Q+R}$ $\overline{P+Q}$ $\overline{P+R}$ $\overline{P+Q+R}$
go_editor
asked
in
Digital Logic
Sep 29, 2014
by
go_editor
11.5k
views
gatecse-2010
digital-logic
circuit-output
normal
41
votes
2
answers
36
GATE CSE 2010 | Question: 25
Which of the following statements are true? Shortest remaining time first scheduling may cause starvation Preemptive scheduling may cause starvation Round robin is better than FCFS in terms of response time I only I and III only II and III only I, II and III
go_editor
asked
in
Operating System
Sep 29, 2014
by
go_editor
20.5k
views
gatecse-2010
operating-system
process-scheduling
easy
23
votes
2
answers
37
GATE CSE 2010 | Question: 24
A system uses FIFO policy for system replacement. It has $4$ page frames with no pages loaded to begin with. The system first accesses $100$ distinct pages in some order and then accesses the same $100$ pages but now in the reverse order. How many page faults will occur? $196$ $192$ $197$ $195$
go_editor
asked
in
Operating System
Sep 29, 2014
by
go_editor
12.1k
views
gatecse-2010
operating-system
page-replacement
normal
45
votes
5
answers
38
GATE CSE 2010 | Question: 23
Consider the methods used by processes $P1$ and $P2$ for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables $S1$ and $S2$ ... ? Mutual exclusion but not progress Progress but not mutual exclusion Neither mutual exclusion nor progress Both mutual exclusion and progress
go_editor
asked
in
Operating System
Sep 29, 2014
by
go_editor
17.7k
views
gatecse-2010
operating-system
process-synchronization
normal
3
votes
1
answer
39
GATE CSE 2010 | Question: 22
What is the appropriate pairing of items in the two columns listing various activities encountered in a software life cycle? P. Requirements Capture 1. Module Development and Integration Q. Design 2. Domain Analysis R. Implementation 3. Structural and Behavioral Modeling S. Maintenance 4. Performance Tuning P-3 Q-2 R-4 S-1 P-2 Q-3 R-1 S-4 P-3 Q-2 R-1 S-4 P-2 Q-3 R-4 S-1
go_editor
asked
in
IS&Software Engineering
Sep 29, 2014
by
go_editor
3.1k
views
gatecse-2010
is&software-engineering
easy
14
votes
4
answers
40
GATE CSE 2010 | Question: 21,ISRO2017-60
The cyclomatic complexity of each of the modules $\text{A}$ and $\text{B}$ shown below is $10.$ What is the cyclomatic complexity of the sequential integration shown on the right hand side? $19$ $21$ $20$ $10$
go_editor
asked
in
IS&Software Engineering
Sep 29, 2014
by
go_editor
12.1k
views
gatecse-2010
is&software-engineering
cyclomatic-complexity
easy
isro2017
51
votes
6
answers
41
GATE CSE 2010 | Question: 20
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? $2$-phase locking Time-stamp ordering I only II only Both I and II Neither I nor II
go_editor
asked
in
Databases
Sep 29, 2014
by
go_editor
22.6k
views
gatecse-2010
databases
transaction-and-concurrency
normal
29
votes
2
answers
42
GATE CSE 2010 | Question: 19
A relational schema for a train reservation database is given below. passenger(pid, pname, age) reservation(pid, class, tid) ... (SELECT * FROM Passenger WHERE age>65 AND Passenger.pid=Reservation.pid) $1, 0$ $1, 2$ $1, 3$ $1, 5$
go_editor
asked
in
Databases
Sep 29, 2014
by
go_editor
8.3k
views
gatecse-2010
databases
sql
normal
56
votes
8
answers
43
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
go_editor
asked
in
Databases
Sep 29, 2014
by
go_editor
32.7k
views
gatecse-2010
databases
b-tree
easy
58
votes
2
answers
44
GATE CSE 2010 | Question: 17
Let $L_1$ be the recursive language. Let $L_2$ and $L_3$ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true? $L_2 - L_1 \:\text{is recursively enumerable.}$ ... $L_2 \cap L_3 \:\text{is recursively enumerable.}$ $L_2 \cup L_3 \:\text{is recursively enumerable.}$
go_editor
asked
in
Theory of Computation
Sep 29, 2014
by
go_editor
16.1k
views
gatecse-2010
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
normal
7
votes
2
answers
45
GATE CSE 2010 | Question: 16
Which one of the following is not a client-server application? Internet chat Web browsing E-mail Ping
go_editor
asked
in
Web Technologies
Sep 29, 2014
by
go_editor
7.7k
views
gatecse-2010
web-technologies
easy
20
votes
6
answers
46
GATE CSE 2010 | Question: 15. PGEE 2018
One of the header fields in an IP datagram is the Time-to-Live (TTL) field. Which of the following statements best explains the need for this field? It can be used to prioritize packets. It can be used to reduce delays. It can be used to optimize throughput. It can be used to prevent packet looping.
go_editor
asked
in
Computer Networks
Sep 29, 2014
by
go_editor
9.7k
views
gatecse-2010
computer-networks
ip-packet
easy
24
votes
3
answers
47
GATE CSE 2010 | Question: 14
Which languages necessarily need heap allocation in the runtime environment? Those that support recursion. Those that use dynamic scoping. Those that allow dynamic data structure. Those that use global variables.
go_editor
asked
in
Compiler Design
Sep 29, 2014
by
go_editor
8.3k
views
gatecse-2010
compiler-design
easy
runtime-environment
28
votes
5
answers
48
GATE CSE 2010 | Question: 13
Which data structure in a compiler is used for managing information about variables and their attributes? Abstract syntax tree Symbol table Semantic stack Parse table
go_editor
asked
in
Compiler Design
Sep 29, 2014
by
go_editor
14.1k
views
gatecse-2010
compiler-design
lexical-analysis
easy
45
votes
6
answers
49
GATE CSE 2010 | Question: 12
Two alternative packages $A$ and $B$ are available for processing a database having $10^k$ records. Package $A$ requires $0.0001 n^2$ time units and package $B$ requires $10n\log_{10} n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$
go_editor
asked
in
Algorithms
Sep 29, 2014
by
go_editor
12.7k
views
gatecse-2010
algorithms
time-complexity
easy
37
votes
3
answers
50
GATE CSE 2010 | Question: 11
What does the following program print? #include<stdio.h> void f(int *p, int *q) { p=q; *p=2; } int i=0, j=1; int main() { f(&i, &j); printf("%d %d\n", i,j); return 0; } $2 \ 2$ $2 \ 1$ $0 \ 1$ $0 \ 2$
go_editor
asked
in
Programming in C
Sep 29, 2014
by
go_editor
9.6k
views
gatecse-2010
programming
programming-in-c
easy
parameter-passing
57
votes
12
answers
51
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
go_editor
asked
in
DS
Sep 29, 2014
by
go_editor
16.2k
views
gatecse-2010
data-structures
binary-tree
normal
24
votes
2
answers
52
GATE CSE 2010 | Question: 9
The Boolean expression of the output $f$ of the multiplexer shown below is $\overline {P \oplus Q \oplus R}$ $P \oplus Q \oplus R$ $P+Q+R$ $\overline{P+Q+R}$
go_editor
asked
in
Digital Logic
Sep 29, 2014
by
go_editor
8.8k
views
gatecse-2010
digital-logic
circuit-output
easy
53
votes
3
answers
53
GATE CSE 2010 | Question: 8
$P$ is a $16$-bit signed integer. The $2$'s complement representation of $P$ is $(F87B)_{16}$. The $2$'s complement representation of $8\times P$ is $(C3D8)_{16}$ $(187B)_{16}$ $(F878)_{16}$ $(987B)_{16}$
go_editor
asked
in
Digital Logic
Sep 29, 2014
by
go_editor
16.3k
views
gatecse-2010
digital-logic
number-representation
normal
53
votes
2
answers
54
GATE CSE 2010 | Question: 7
The main memory unit with a capacity of $4$ $\text{megabytes}$ is built using $1\text{M} \times \text{1-bit}$ DRAM chips. Each DRAM chip has $1\text{K}$ rows of cells with $1\text{K}$ cells in each row. The time taken for a single ... in the memory unit is $100$ nanoseconds $100\times 2^{10}$ nanoseconds $100\times 2^{20}$ nanoseconds $3200\times 2^{20}$ nanoseconds
go_editor
asked
in
Digital Logic
Sep 29, 2014
by
go_editor
18.9k
views
gatecse-2010
digital-logic
memory-interfacing
normal
25
votes
3
answers
55
GATE CSE 2010 | Question: 6
The minterm expansion of $f(P,Q,R) = PQ +Q \bar{R}+P\bar{R}$ is $m_2+m_4+m_6+m_7$ $m_0+m_1+m_3+m_5$ $m_0+m_1+m_6+m_7$ $m_2+m_3+m_4+m_5$
go_editor
asked
in
Digital Logic
Sep 29, 2014
by
go_editor
7.4k
views
gatecse-2010
digital-logic
canonical-normal-form
normal
69
votes
5
answers
56
GATE CSE 2010 | Question: 30
Suppose the predicate $F(x, y, t)$ is used to represent the statement that person $x$ can fool person $y$ at time $t$. Which one of the statements below expresses best the meaning of the formula, $\qquad∀x∃y∃t(¬F(x,y,t))$ Everyone can ... time No one can fool everyone all the time Everyone cannot fool some person all the time No one can fool some person at some time
gatecse
asked
in
Mathematical Logic
Sep 21, 2014
by
gatecse
70.0k
views
gatecse-2010
mathematical-logic
easy
first-order-logic
22
votes
4
answers
57
GATE CSE 2010 | Question: 29
Consider the following matrix $A = \left[\begin{array}{cc}2 & 3\\x & y \end{array}\right]$ If the eigenvalues of A are $4$ and $8$, then $x = 4$, $y = 10$ $x = 5$, $y = 8$ $x = 3$, $y = 9$ $x = -4$, $y =10$
gatecse
asked
in
Linear Algebra
Sep 21, 2014
by
gatecse
8.5k
views
gatecse-2010
linear-algebra
eigen-value
easy
40
votes
7
answers
58
GATE CSE 2010 | Question: 28
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? $7, 6, 5, 4, 4, 3, 2, 1$ $6, 6, 6, 6, 3, 3, 2, 2$ $7, 6, 6, 4, 4, 3, 2, 2$ $8, 7, 7, 6, 4, 2, 1, 1$ I and II III and IV IV only II and IV
gatecse
asked
in
Graph Theory
Sep 21, 2014
by
gatecse
18.5k
views
gatecse-2010
graph-theory
degree-of-graph
56
votes
3
answers
59
GATE CSE 2010 | Question: 27
What is the probability that divisor of $10^{99}$ is a multiple of $10^{96}$? $\left(\dfrac{1}{625}\right)$ $\left(\dfrac{4}{625}\right)$ $\left(\dfrac{12}{625}\right)$ $\left(\dfrac{16}{625}\right)$
gatecse
asked
in
Probability
Sep 21, 2014
by
gatecse
13.5k
views
gatecse-2010
probability
normal
25
votes
5
answers
60
GATE CSE 2010 | Question: 26
Consider a company that assembles computers. The probability of a faulty assembly of any computer is $p$. The company therefore subjects each computer to a testing process. This testing process gives the correct result for any computer with a probability of $q$. What is the probability of a computer being declared faulty? $pq + (1 - p)(1 - q)$ $(1 - q)p$ $(1 - p)q$ $pq$
gatecse
asked
in
Probability
Sep 21, 2014
by
gatecse
7.5k
views
gatecse-2010
probability
easy
Page:
« prev
1
2
3
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged gatecse-2010
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...