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-2003
5
votes
0
answers
1
Modified GATE 2003 question
Consider this GATE 2003 question: https://gateoverflow.in/937/gate2003-46 Here, instead of XOR gates we had OR gates, then which of the following operations can we perform? $A + B, A - B\ and\ A + 1$
Rishabh Gupta 2
asked
in
CO and Architecture
Nov 3, 2017
by
Rishabh Gupta 2
1.2k
views
gatecse-2003
adder
4
votes
0
answers
2
#Gate2003
Consider the following logic program P A(x) <- B(x, y), C(y) <- B(x,x) Which of the following first order sentences is equivalent to P? Can anyone explain how it can be solved ?
Syedarshadali
asked
in
Mathematical Logic
Jun 29, 2017
by
Syedarshadali
982
views
discrete-mathematics
first-order-logic
gatecse-2003
83
votes
6
answers
3
GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$
go_editor
asked
in
Operating System
Apr 24, 2016
by
go_editor
23.7k
views
gatecse-2003
operating-system
normal
virtual-memory
29
votes
3
answers
4
GATE CSE 2003 | Question: 49
Consider the following assembly language program for a hypothetical processor $A, B,$ and $C$ are $8$ bit registers. The meanings of various instructions are shown as comments. MOV B, #0 ; $B \leftarrow 0$ MOV C, #8 ; $C \leftarrow 8$ Z: CMP C, #0 ; compare C ... $\text{LRC A,} \#1; $ left rotate $A$ through carry flag by one bit $\text{ADD A,} \#1$
go_editor
asked
in
CO and Architecture
Apr 24, 2016
by
go_editor
9.8k
views
gatecse-2003
co-and-architecture
machine-instruction
normal
70
votes
9
answers
5
GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j.$ What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of $1. . . n$ with at most $n$ inversions? $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^{1.5})$ $\Theta(n)$
go_editor
asked
in
Algorithms
Apr 24, 2016
by
go_editor
19.6k
views
gatecse-2003
algorithms
sorting
normal
insertion-sort
43
votes
5
answers
6
GATE CSE 2003 | Question: 74
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } main() {P(i ... by name parameter passing mechanism, the values printed by the above program are $115, 220$ $25, 220$ $25, 15$ $115, 105$
go_editor
asked
in
Compiler Design
Apr 24, 2016
by
go_editor
12.8k
views
gatecse-2003
programming
compiler-design
parameter-passing
runtime-environment
normal
55
votes
7
answers
7
GATE CSE 2003 | Question: 81
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ ... $1$ $V(S)$ at $W, V(T)$ at $X, P(S)$ at $Y, P(T)$ at $Z, S$ and $T$ initially $1$
go_editor
asked
in
Operating System
Apr 24, 2016
by
go_editor
14.6k
views
gatecse-2003
operating-system
process-synchronization
normal
60
votes
6
answers
8
GATE CSE 2003 | Question: 47
Consider the following circuit composed of XOR gates and non-inverting buffers. The non-inverting buffers have delays $\delta_1 = 2 ns$ and $\delta_2 = 4 ns$ as shown in the figure. Both XOR gates and all wires have zero delays. Assume that all gate inputs, outputs, and wires ... of logic levels) occur(s) at $B$ during the interval from $0$ to $10$ ns? $1$ $2$ $3$ $4$
shikharV
asked
in
Digital Logic
Dec 2, 2015
by
shikharV
16.1k
views
gatecse-2003
digital-logic
digital-circuits
79
votes
10
answers
9
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
Disha
asked
in
DS
Sep 19, 2014
by
Disha
31.8k
views
gatecse-2003
data-structures
binary-heap
55
votes
6
answers
10
GATE CSE 2003 | Question: 90
Consider the function $f$ defined below. struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL) || (p->next == NULL)|| ((p->data <= p ->next -> data) && f(p- ... order of data value the elements in the list are sorted in non-increasing order of data value not all elements in the list have the same data value
Kathleen
asked
in
DS
Sep 17, 2014
by
Kathleen
17.4k
views
gatecse-2003
data-structures
linked-list
normal
39
votes
5
answers
11
GATE CSE 2003 | Question: 89
Consider the C program shown below: #include<stdio.h> #define print(x) printf("%d", x) int x; void Q(int z) { z+=x; print(z); } void P(int *y) { int x = *y + 2; Q(x); *y = x - 1; print(x); } main(void) { x = 5; P(&x); print(x); } The output of this program is: $12 \ 7 \ 6$ $22 \ 12 \ 11$ $14 \ 6 \ 6$ $7 \ 6 \ 6$
Kathleen
asked
in
Programming in C
Sep 17, 2014
by
Kathleen
12.4k
views
gatecse-2003
programming
programming-in-c
normal
pointers
56
votes
7
answers
12
GATE CSE 2003 | Question: 88
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\geqslant 3$, and TwoLog_n is initialized to the value of $2^*\lceil \log_2(n) \rceil$ for (k = 3; k ... $\left\{m \mid m \leq n, \text{m is prime} \right\}$ { }
Kathleen
asked
in
Algorithms
Sep 17, 2014
by
Kathleen
12.2k
views
gatecse-2003
algorithms
identify-function
normal
46
votes
6
answers
13
GATE CSE 2003 | Question: 87
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the actions reading and writing the data item $D$ ... $T2; T1; T3$ The schedule is serializable as $T3; T2; T1$ The schedule is not serializable
Kathleen
asked
in
Databases
Sep 17, 2014
by
Kathleen
11.2k
views
gatecse-2003
databases
transaction-and-concurrency
normal
46
votes
3
answers
14
GATE CSE 2003 | Question: 86
Consider the set of relations shown below and the SQL query that follows. Students: (Roll_number, Name, Date_of_birth) Courses: (Course_number, Course_name, Instructor) Grades: (Roll_number, Course_number, Grade) Select distinct Name from Students, Courses, Grades where ... students who have got an A grade in at least one of the courses taught by Korth None of the above
Kathleen
asked
in
Databases
Sep 17, 2014
by
Kathleen
15.2k
views
gatecse-2003
databases
sql
easy
42
votes
3
answers
15
GATE CSE 2003 | Question: 85
Consider the following functional dependencies in a database. ... is in second normal form but not in third normal form in third normal form but not in BCNF in BCNF in none of the above
Kathleen
asked
in
Databases
Sep 17, 2014
by
Kathleen
14.8k
views
gatecse-2003
databases
database-normalization
normal
78
votes
7
answers
16
GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps
Kathleen
asked
in
Computer Networks
Sep 17, 2014
by
Kathleen
27.6k
views
gatecse-2003
computer-networks
sliding-window
normal
25
votes
6
answers
17
GATE CSE 2003 | Question: 83
A $2$ $km$ long broadcast LAN has $10^7$ bps bandwidth and uses CSMA/CD. The signal travels along the wire at $2 \times 10^8$ m/s. What is the minimum packet size that can be used on this network? $50$ $\text{bytes}$ $100$ $\text{bytes}$ $200$ $\text{bytes}$ None of the above
Kathleen
asked
in
Computer Networks
Sep 17, 2014
by
Kathleen
13.4k
views
gatecse-2003
computer-networks
lan-technologies
normal
55
votes
6
answers
18
GATE CSE 2003 | Question: 82, ISRO2009-1
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network? $172.57.88.62$ and $172.56.87.23$ $10.35.28.2$ and $10.35.29.4$ $191.203.31.87$ and $191.234.31.88$ $128.8.129.43$ and $128.8.161.55$
Kathleen
asked
in
Computer Networks
Sep 17, 2014
by
Kathleen
28.8k
views
gatecse-2003
computer-networks
subnetting
normal
isro2009
30
votes
3
answers
19
GATE CSE 2003 | Question: 80
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ is shown below. Process P: Process Q: while(1){ W: print '0'; print '0'; X: } while(1){ Y: print '1'; print ... at $W, V(S)$ at $X, P(T)$ at $Y, V(T)$ at $Z, S$ initially $1$ , and $T$ initially $0$
Kathleen
asked
in
Operating System
Sep 17, 2014
by
Kathleen
6.7k
views
gatecse-2003
operating-system
process-synchronization
normal
92
votes
3
answers
20
GATE CSE 2003 | Question: 77
A uni-processor computer system only has two processes, both of which alternate $10$ $\text{ms}$ CPU bursts with $90$ $\text{ms}$ I/O bursts. Both the processes were created at nearly the same time. The I/O of both processes ... Static priority scheduling with different priorities for the two processes Round robin scheduling with a time quantum of $5$ $\text{ms}$
Kathleen
asked
in
Operating System
Sep 17, 2014
by
Kathleen
19.5k
views
gatecse-2003
operating-system
process-scheduling
normal
51
votes
4
answers
21
GATE CSE 2003 | Question: 76
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statistically linked libraries? Smaller sizes of executable files Lesser overall page fault rate in the system Faster program startup Existing programs need not be re-linked to take advantage of newer versions of libraries
Kathleen
asked
in
Compiler Design
Sep 17, 2014
by
Kathleen
16.2k
views
gatecse-2003
compiler-design
runtime-environment
linker
easy
2
votes
2
answers
22
GATE CSE 2003 | Question: 75
Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed to be either Java or C++, though the syntax is similar. Class P { Class Q subclass of P { void f(int ... P. The output produced by executing the above program fragment will be 1 2 1 2 1 1 2 1 2 2 2 2
Kathleen
asked
in
Programming in C
Sep 17, 2014
by
Kathleen
5.5k
views
gatecse-2003
programming
variable-binding
normal
out-of-syllabus-now
40
votes
5
answers
23
GATE CSE 2003 | Question: 73
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } main() {P(i ... by need parameter passing mechanism, the values printed by the above program are: $115, 220$ $25, 220$ $25, 15$ $115, 105$
Kathleen
asked
in
Programming in C
Sep 17, 2014
by
Kathleen
9.1k
views
gatecse-2003
compiler-design
normal
runtime-environment
parameter-passing
57
votes
6
answers
24
GATE CSE 2003 | Question: 72
The following resolution rule is used in logic programming. Derive clause $(P \vee Q)$ from clauses $(P\vee R),(Q \vee ¬R)$ Which of the following statements related to this rule is FALSE? $((P ∨ R)∧(Q ∨ ¬R))⇒(P ∨ Q)$ ... if $(P ∨ R)∧(Q ∨ ¬R)$ is satisfiable $(P ∨ Q)⇒ \text{FALSE}$ if and only if both $P$ and $Q$ are unsatisfiable
Kathleen
asked
in
Mathematical Logic
Sep 17, 2014
by
Kathleen
14.1k
views
gatecse-2003
mathematical-logic
normal
propositional-logic
5
votes
0
answers
25
GATE CSE 2003 | Question: 71
Consider the following logic program P $\begin{align*} A(x) &\gets B(x,y), C(y) \\ &\gets B(x,x) \end{align*}$ ... $(\forall x) [(\forall y) [B(x,y) \land C(y)] \Rightarrow A(x)] \land (\exists x)[B(x,x)]$
Kathleen
asked
in
Programming in C
Sep 17, 2014
by
Kathleen
3.8k
views
gatecse-2003
programming
logic-programming
out-of-syllabus-now
60
votes
4
answers
26
GATE CSE 2003 | Question: 70
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1}) \in E$ for all $k$ in $i$ through $j-1$. A simple path is a path in ... length from $j$ to $k$ If there exists a path from $j$ to $k$, every simple path from $j$ to $k$ contains at most $A[j,k]$ edges
Kathleen
asked
in
Algorithms
Sep 17, 2014
by
Kathleen
17.5k
views
gatecse-2003
algorithms
graph-algorithms
normal
50
votes
11
answers
27
GATE CSE 2003 | Question: 69
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ ... a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? $3$ $4$ $5$ $6$
Kathleen
asked
in
Algorithms
Sep 17, 2014
by
Kathleen
14.2k
views
gatecse-2003
algorithms
normal
greedy-algorithm
25
votes
3
answers
28
GATE CSE 2003 | Question: 68
What is the weight of a minimum spanning tree of the following graph? $29$ $31$ $38$ $41$
Kathleen
asked
in
Algorithms
Sep 17, 2014
by
Kathleen
7.5k
views
gatecse-2003
algorithms
spanning-tree
normal
86
votes
5
answers
29
GATE CSE 2003 | Question: 67
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows. $w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, otherwise} \end{cases}$ A single-source shortest path ... edges in the shortest paths from $v_1$ to all vertices of $G$ $G_1$ is connected $V_1$ forms a clique in $G$ $G_1$ is a tree
Kathleen
asked
in
Algorithms
Sep 17, 2014
by
Kathleen
20.0k
views
gatecse-2003
algorithms
graph-algorithms
normal
30
votes
7
answers
30
GATE CSE 2003 | Question: 65
Consider the following $2-3-4$ tree (i.e., B-tree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above
Kathleen
asked
in
Databases
Sep 17, 2014
by
Kathleen
9.9k
views
gatecse-2003
databases
b-tree
normal
Page:
1
2
3
4
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-2003
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:...