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
Filter
User rishu_darkshadow
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by rishu_darkshadow
16
votes
1
GATE CSE 2015 Set 1 | Question: 33
Consider the following pseudo code, where $x$ and $y$ are positive integers. begin q := 0 r := x while r ≥ y do begin r := r - y q := q + 1 end end The post condition that needs to be satisfied after the program terminates is $\{ r = qx + y \wedge r < y\}$ ... $\{ y = qx + r \wedge 0 < r < y\}$ $\{ q + 1 < r - y \wedge y > 0\}$
answered
in
Programming in C
Jan 19, 2018
15.5k
views
gatecse-2015-set1
programming
loop-invariants
normal
1
vote
2
GATE CSE 2014 Set 3 | Question: 17
One of the purposes of using intermediate code in compilers is to make parsing and semantic analysis simpler. improve error recovery and error reporting. increase the chances of reusing the machine-independent code optimizer in other compilers. improve the register allocation.
answered
in
Compiler Design
Jan 19, 2018
9.1k
views
gatecse-2014-set3
compiler-design
intermediate-code
easy
0
votes
3
UGC NET CSE | November 2017 | Part 3 | Question: 38
Which of the following statement(s) is/are TRUE regarding Java Servelets? A Java Servelet is a server-side component that runs on the web server and extends the capabilities of a server. A servelet can use the user interface classes like AWT or Swing. Only (i) is TRUE Only (ii) is TRUE Both (i) and (ii) are TRUE Neither (i) nor (ii) is TRUE
answered
in
Unknown Category
Jan 4, 2018
730
views
ugcnetcse-nov2017-paper3
0
votes
4
UGC NET CSE | November 2017 | Part 3 | Question: 41
Which of the following statements is/are TRUE regarding JAVA? Constants that cannot be changed are declared using ‘static’ keyword. A class can only inherit one class but can implement multiple interfaces. Only (i) is TRUE Only (ii) is TRUE Both (i) and (ii) are TRUE Neither (i) nor (ii) is TRUE
answered
in
Unknown Category
Jan 4, 2018
1.2k
views
ugcnetcse-nov2017-paper3
2
votes
5
UGC NET CSE | November 2017 | Part 2 | Question: 28
The number of bits used for addressing in Gigabit Ethernet is __________. $32$ bits $48$ bits $64$ bits $128$ bits
answered
in
Unknown Category
Jan 4, 2018
2.8k
views
ugcnetcse-nov2017-paper2
computer-networks
ethernet
11
votes
6
GATE CSE 2002 | Question: 2.21
Which combination of the following features will suffice to characterize an OS as a multi-programmed OS? More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I/O, another program is immediately scheduled ... is immediately scheduled for execution. (a) (a) and (b) (a) and (c) (a), (b) and (c)
answered
in
Operating System
Dec 12, 2017
12.6k
views
gatecse-2002
operating-system
normal
process
61
votes
7
GATE CSE 2014 Set 2 | Question: 41
Suppose a stack implementation supports an instruction $\text{REVERSE}$, which reverses the order of elements on the stack, in addition to the $\text{PUSH}$ and $\text{POP}$ ... instruction. A queue can be implemented where both $\text{ENQUEUE}$ and $\text{DEQUEUE}$ take a single instruction each.
answered
in
DS
Dec 8, 2017
24.7k
views
gatecse-2014-set2
data-structures
stack
easy
2
votes
8
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$
answered
in
DS
Dec 5, 2017
16.2k
views
gatecse-2010
data-structures
binary-tree
normal
4
votes
9
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$
answered
in
Databases
Dec 5, 2017
32.7k
views
gatecse-2010
databases
b-tree
easy
1
vote
10
GATE CSE 2009 | Question: 19
The coupling between different modules of a software is categorized as follows: Content coupling Common coupling Control coupling Stamp coupling Data coupling Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows: I-II-III-IV-V V-IV-III-II-I I-III-V-II-IV IV-II-V-III-I
answered
in
IS&Software Engineering
Dec 4, 2017
13.7k
views
gatecse-2009
is&software-engineering
normal
2
votes
11
GATE CSE 2009 | Question: 40
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
answered
in
Theory of Computation
Dec 4, 2017
13.1k
views
gatecse-2009
theory-of-computation
easy
identify-class-language
22
votes
12
GATE IT 2007 | Question: 6, ISRO2011-25
A processor takes $12$ cycles to complete an instruction I. The corresponding pipelined processor uses $6$ stages with the execution times of $3, 2, 5, 4, 6$ and $2$ cycles respectively. What is the asymptotic speedup assuming that a very large number of instructions are to be executed? $1.83$ $2$ $3$ $6$
answered
in
CO and Architecture
Nov 17, 2017
13.2k
views
gateit-2007
co-and-architecture
pipelining
normal
isro2011
5
votes
13
GATE CSE 2007 | Question: 5
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below. Which of the following is not a topological ordering? $1$ $2$ $3$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $6$ $5$ $3$ $2$ $4$ $1$ $6$ $5$
answered
in
Algorithms
Nov 17, 2017
7.7k
views
gatecse-2007
algorithms
graph-algorithm
topological-sort
easy
2
votes
14
GATE CSE 2005 | Question: 54
Let $N_f$ and $N_p$ denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let $D_f$ and $D_p$ denote the classes of languages accepted by deterministic finite automata and deterministic push-down automata ... $D_f = N_f \text{ and } D_p = N_p$ $D_f =N_f \text{ and } D_p \subset N_p$
answered
in
Theory of Computation
Nov 15, 2017
4.2k
views
gatecse-2005
theory-of-computation
easy
non-determinism
–1
vote
15
GATE CSE 2005 | Question: 55
Consider the languages: $L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m > 0\right\}$ Which one of the following statements is FALSE? $L_1 \cap L_2$ is a context-free language $L_1 \cup L_2$ is a context-free language $L_1 \text{ and } L_2$ are context-free languages $L_1 \cap L_2$ is a context sensitive language
answered
in
Theory of Computation
Nov 15, 2017
8.6k
views
gatecse-2005
theory-of-computation
identify-class-language
normal
0
votes
16
GATE CSE 2005 | Question: 16, ISRO2009-18, ISRO2015-2
The range of integers that can be represented by an $n$ bit $2’s$ complement number system is: $-2^{n-1} \text{ to } (2^{n-1} -1)$ $-(2^{n-1} -1) \text{ to } (2^{n-1} -1)$ $-2^{n-1} \text{ to } 2^{n-1}$ $-(2^{n-1} +1) \text{ to } (2^{n-1} -1)$
answered
in
Digital Logic
Nov 14, 2017
9.6k
views
gatecse-2005
digital-logic
number-representation
easy
isro2009
isro2015
11
votes
17
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
answered
in
DS
Nov 14, 2017
13.3k
views
gateit-2005
data-structures
normal
binary-search-tree
1
vote
18
GATE CSE 2005 | Question: 4
Which one of the following are essential features of an object-oriented programming language? Abstraction and encapsulation Strictly-typedness Type-safe property coupled with sub-type rule Polymorphism in the presence of inheritance I and II only I and IV only I, II and IV only I, III and IV only
answered
in
Object Oriented Programming
Nov 14, 2017
5.8k
views
gatecse-2005
programming
normal
object-oriented-programming
non-gate
1
vote
19
GATE IT 2004 | Question: 57
Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm. ... $\text{P-III, Q-II, R-IV, S-I}$ $\text{P-IV, Q-II, R-I, S-III}$
answered
in
Algorithms
Nov 13, 2017
5.9k
views
gateit-2004
algorithms
recurrence-relation
normal
match-the-following
5
votes
20
GATE IT 2004 | Question: 86
In the TCP/IP protocol suite, which one of the following is NOT part of the IP header? Fragment Offset Source IP address Destination IP address Destination port number
answered
in
Computer Networks
Nov 13, 2017
6.2k
views
gateit-2004
computer-networks
ip-packet
normal
14
votes
21
GATE IT 2004 | Question: 8
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{-input EXCLUSIVE-OR}$ function without using any other logic gate? $2$ $4$ $5$ $6$
answered
in
Digital Logic
Nov 13, 2017
11.2k
views
gateit-2004
digital-logic
min-no-gates
normal
0
votes
22
GATE IT 2004 | Question: 64
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); The number of new processes created is $n$ $((n(n + 1))/2)$ $2^n - 1$ $3^n - 1$
answered
in
Operating System
Nov 13, 2017
11.9k
views
gateit-2004
operating-system
fork-system-call
easy
5
votes
23
GATE IT 2004 | Question: 5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n-1$ $n$ $n+1$ $2n-1$
answered
in
Graph Theory
Nov 11, 2017
6.9k
views
gateit-2004
graph-theory
graph-connectivity
normal
–2
votes
24
GATE IT 2004 | Question: 21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency
answered
in
Databases
Nov 11, 2017
18.6k
views
gateit-2004
databases
normal
transaction-and-concurrency
3
votes
25
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$
answered
in
Programming in C
Nov 11, 2017
12.4k
views
gatecse-2003
programming
programming-in-c
normal
pointers
2
votes
26
GATE CSE 2001 | Question: 1.5
Which of the following statements is true? If a language is context free it can always be accepted by a deterministic push-down automaton The union of two context free languages is context free The intersection of two context free languages is a context free The complement of a context free language is a context free
answered
in
Theory of Computation
Nov 9, 2017
13.8k
views
gatecse-2001
theory-of-computation
context-free-language
easy
4
votes
27
GATE CSE 2001 | Question: 2.16
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$? One Two Three Four
answered
in
DS
Nov 9, 2017
24.2k
views
gatecse-2001
data-structures
easy
stack
queue
3
votes
28
UGC NET CSE | November 2017 | Part 3 | Question: 32
You are given a sequence of $n$ elements to sort. The input sequence consists of $\dfrac{n}{k}$ subsequences, each containing $k$ elements. The elements in a given subsequence are all smaller than the elements in the succeeding subsequence and larger than the elements ... $\Omega \bigg( \dfrac{n}{k} \: \lg \: \dfrac{n}{k} \bigg)$
answered
in
Unknown Category
Nov 8, 2017
579
views
ugcnetcse-nov2017-paper3
0
votes
29
UGC NET CSE | December 2015 | Part 3 | Question: 44
In propositional logic, given $P$ and $P \rightarrow Q$, we can infer ________ $\sim Q$ $Q$ $P \wedge Q$ $\sim P \wedge Q$
answered
in
Mathematical Logic
Oct 25, 2017
3.3k
views
ugcnetcse-dec2015-paper3
propositional-logic
mathematical-logic
–2
votes
30
GATE CSE 2000 | Question: 2.24
Given the following relation instance. ... $YZ \rightarrow X$ and $Y \rightarrow Z$ $YZ \rightarrow X$ and $X \rightarrow Z$ $XZ \rightarrow Y$ and $Y \rightarrow X$
answered
in
Databases
Oct 9, 2017
14.5k
views
gatecse-2000
databases
database-normalization
easy
Page:
1
2
3
4
5
6
...
9
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 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:...