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 Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Prashant.
3
votes
1
GATE CSE 2020 | Question: 18
Let $G$ be a group of $35$ elements. Then the largest possible size of a subgroup of $G$ other than $G$ itself is _______.
answered
in
Set Theory & Algebra
Feb 12, 2020
9.1k
views
gatecse-2020
numerical-answers
group-theory
easy
1-mark
5
votes
2
GATE CSE 2020 | Question: 34
Each of a set of $n$ processes executes the following code using two semaphores $a$ and $b$ initialized to $1$ and $0$, respectively. Assume that $\text{count}$ is a shared variable initialized to $0$ ... all processes execute CODE SECTION P mutually exclusively. It ensures that at most $n-1$ processes are in CODE SECTION P at any time.
answered
in
Operating System
Feb 12, 2020
13.6k
views
gatecse-2020
operating-system
semaphore
2-marks
20
votes
3
GATE CSE 2020 | Question: 20
If there are $m$ input lines and $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is ________ .
answered
in
Digital Logic
Feb 12, 2020
9.6k
views
gatecse-2020
numerical-answers
digital-logic
decoder
1-mark
18
votes
4
GATE CSE 2020 | Question: 48
Consider the following C functions. int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } return (i); } int pp(int a, int b) { int arr[20]; int i, tot = 1, ex, len; ex = a; len = tob(b ... ; i<len ; i++) { if (arr[i] ==1) tot = tot * ex; ex= ex*ex; } return (tot) ; } The value returned by $pp(3,4)$ is _______.
answered
in
Algorithms
Feb 12, 2020
11.3k
views
gatecse-2020
numerical-answers
identify-function
2-marks
15
votes
5
GATE CSE 2020 | Question: 3
Consider the following statements. Daisy chaining is used to assign priorities in attending interrupts. When a device raises a vectored interrupt, the CPU does polling to identify the source of interrupt. In polling, the CPU periodically checks the status bits to know if any ... . Which of the above statements is/are TRUE? Ⅰ and Ⅱ only Ⅰ and Ⅳ only Ⅰ and Ⅲ only Ⅲ only
answered
in
CO and Architecture
Feb 12, 2020
8.6k
views
gatecse-2020
co-and-architecture
interrupts
1-mark
6
votes
6
GATE CSE 2020 | Question: 50
Consider the following set of processes, assumed to have arrived at time $0$. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order$P_1, P_2, P_3, P_4$ ... of the difference between the average turnaround times (in ms) of SJF and RR (round off to $2$ decimal places is_______
answered
in
Operating System
Feb 12, 2020
10.3k
views
gatecse-2020
numerical-answers
operating-system
process-scheduling
2-marks
15
votes
7
GATE CSE 2020 | Question: 32
Consider the following languages. $\begin{array}{ll} L_1= \{ wxyx \mid w,x,y \in (0+1)^{+} \} \\ L_2= \{xy \mid x,y \in (a+b)^{*}, \mid x \mid=\mid y \mid, x \neq y \} \end{array}$ ... context- free but not regular and $L_2$ is context-free. Neither $L_1$ nor $L_2$ is context- free. $L_1$ context- free but $L_2$ is not context-free.
answered
in
Theory of Computation
Feb 12, 2020
17.9k
views
gatecse-2020
theory-of-computation
identify-class-language
2-marks
33
votes
8
GATE CSE 2020 | Question: 14
Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram? Diamonds with double/bold border Rectangles with double/bold border Ovals with double/bold border Ovals that contain underlined identifiers
answered
in
Databases
Feb 12, 2020
12.9k
views
gatecse-2020
databases
er-diagram
1-mark
13
votes
9
GATE CSE 2020 | Question: 9
Consider the following statements. Symbol table is accessed only during lexical analysis and syntax analysis. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment. Errors violating the condition any ... the above statements is/are TRUE? I only I and III only Ⅱ only None of Ⅰ, Ⅱ and Ⅲ
answered
in
Compiler Design
Feb 12, 2020
14.4k
views
gatecse-2020
compiler-design
compilation-phases
runtime-environment
1-mark
2
votes
10
GATE CSE 2020 | Question: 5
The preorder traversal of a binary search tree is $15, 10, 12, 11, 20, 18, 16, 19$. Which one of the following is the postorder traversal of the tree? $10,11,12,15,16,18,19,20$ $11,12,10,16,19,18,20,15$ $20,19,18,16,15,12,11,10$ $19,16,18,20,11,12,10,15$
answered
in
DS
Feb 12, 2020
18.6k
views
gatecse-2020
binary-search-tree
1-mark
1
vote
11
GATE CSE 2020 | Question: 8
Consider the following statements. If $L_1 \cup L_2$ is regular, then both $L_1$ and $L_2$ must be regular. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE? Ⅰ only Ⅱ only Both Ⅰ and Ⅱ Neither Ⅰ nor Ⅱ
answered
in
Theory of Computation
Feb 12, 2020
13.4k
views
gatecse-2020
theory-of-computation
regular-language
1-mark
3
votes
12
GATE CSE 2020 | Question: 7
Which one of the following regular expressions represents the set of all binary strings with an odd number of $1’$s? $((0+1)^*1(0+1)^*1)^*10^*$ $(0^*10^*10^*)^*0^*1$ $10^*(0^*10^*10^*)^*$ $(0^*10^*10^*)^*10^*$
answered
in
Theory of Computation
Feb 12, 2020
23.5k
views
gatecse-2020
regular-expression
normal
theory-of-computation
1-mark
41
votes
13
GATE CSE 2020 | Question: 6
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially? $\Theta (n^{4})$ $\Theta (n^{2})$ $\Theta (n^{2}\log n)$ $\Theta (n^{3})$
answered
in
DS
Feb 12, 2020
13.4k
views
gatecse-2020
binary-tree
avl-tree
1-mark
2
votes
14
Test Datastructure
We are provided with an undirected connected graph such that weight of all the edges is equal to some constant k. We wish to find the shortest distance between given pair of nodes. Which of the following statements is(are) true? I. We can use Depth First Search to ... correct result only if the given graph is a tree. Only I and II Only II and IV Only III and IV Only II and III
answered
in
Algorithms
Aug 20, 2018
968
views
algorithms
graph-algorithm
16
votes
15
GATE CSE 1997 | Question: 76-b
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined attributes are the primary ... makes a copy of $\text{EMP}$ and names it $E$ ($\rho$ is called the rename operator))
answered
in
Databases
Jun 28, 2018
3.2k
views
gate1997
databases
sql
descriptive
normal
12
votes
16
GATE CSE 2006 | Question: 19
Let $L_1=\{0^{n+m}1^n0^m\mid n,m\geq 0 \}$, $L_2=\{0^{n+m}1^{n+m}0^m\mid n,m\geq 0\}$ and $L_3=\{0^{n+m}1^{n+m}0^{n+m}\mid n,m\geq 0\} $. Which of these languages are NOT context free? $L_1$ only $L_3$ only $L_1$ and $L_2$ $L_2$ and $L_3$
answered
in
Theory of Computation
Mar 22, 2018
15.2k
views
gatecse-2006
theory-of-computation
context-free-language
normal
6
votes
17
GATE CSE 2018 | Question: 36
Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$. L(M) denotes the language accepted by a machine $M$. For an unrestricted grammar $G$ and a string $w$, whether $w \in L(G)$ Given a Turing machine ... is correct? Only I and II are undecidable Only II is undecidable Only II and IV are undecidable Only I, II and III are undecidable
answered
in
Theory of Computation
Feb 14, 2018
16.8k
views
gatecse-2018
theory-of-computation
decidability
easy
2-marks
26
votes
18
GATE CSE 2018 | Question: 35
Consider the following languages: $\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$ $\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \geq 0 \}$ ... Which of the above languages are context-free? I and IV only I and II only II and III only II and IV only
answered
in
Theory of Computation
Feb 14, 2018
21.1k
views
gatecse-2018
theory-of-computation
identify-class-language
context-free-language
normal
2-marks
18
votes
19
GATE CSE 2018 | Question: 38
Consider the following parse tree for the expression a#b$\$c$\$d#e#f, involving two binary operators $\$ ... has higher precedence and is right associative; # is left associative
answered
in
Compiler Design
Feb 14, 2018
9.3k
views
gatecse-2018
compiler-design
parsing
normal
2-marks
12
votes
20
GATE CSE 2018 | Question: 11
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and that the cardinality of E1 is greater than the cardinality of E2. Which ... Every entity in E2 is associated with exactly one entity in E1 Every entity in E2 is associated with at most one entity in E1
answered
in
Databases
Feb 14, 2018
27.7k
views
gatecse-2018
databases
er-diagram
normal
1-mark
34
votes
21
GATE CSE 2018 | Question: 40
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is $N$. Three semaphores $empty$, $full$ and $mutex$ are defined with respective initial values of $0, N$ and $1$. Semaphore $empty$ denotes the number of available slots in the buffer, ... $P: empty, \ \ \ Q:full, \ \ \ R:full, \ \ \ S:empty$
answered
in
Operating System
Feb 14, 2018
14.4k
views
gatecse-2018
operating-system
process-synchronization
normal
2-marks
82
votes
22
GATE CSE 2018 | Question: 46
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
answered
in
DS
Feb 14, 2018
38.8k
views
gatecse-2018
binary-heap
numerical-answers
combinatory
2-marks
36
votes
23
GATE CSE 2018 | Question: 6
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true? $k \geq 2^n$ $k \geq n$ $k \leq n^2$ $k \leq 2^n$
answered
in
Theory of Computation
Feb 14, 2018
10.3k
views
gatecse-2018
theory-of-computation
minimal-state-automata
normal
1-mark
2
votes
24
GATE CSE 2018 | Question: 5
Consider the following processor design characteristics: Register-to-register arithmetic operations only Fixed-length instruction format Hardwired control unit Which of the characteristics above are used in the design of a RISC processor? I and II only II and III only I and III only I, II and III
answered
in
CO and Architecture
Feb 14, 2018
12.0k
views
gatecse-2018
co-and-architecture
cisc-risc-architecture
easy
1-mark
41
votes
25
GATE CSE 2018 | Question: 41
Consider the relations $r(A, B)$ and $s(B, C)$, where $s.B$ is a primary key and $r.B$ is a foreign key referencing $s.B$. Consider the query $Q: r \bowtie (\sigma_{B<5} (s))$ Let LOJ denote the natural left outer-join operation. Assume that $r$ and $s$ contain no null ... $r \: LOJ \: (\sigma_{B<5} (s))$ $\sigma_{B<5} (r) \: LOJ \: s$
answered
in
Databases
Feb 14, 2018
15.6k
views
gatecse-2018
databases
relational-algebra
normal
2-marks
2
votes
26
GATE CSE 2018 | Question: 17
Consider a matrix $A= uv^T$ where $u=\begin{pmatrix}1 \\ 2 \end{pmatrix} , v = \begin{pmatrix}1 \\1 \end{pmatrix}$. Note that $v^T$ denotes the transpose of $v$. The largest eigenvalue of $A$ is ____
answered
in
Linear Algebra
Feb 14, 2018
10.1k
views
gatecse-2018
linear-algebra
eigen-value
normal
numerical-answers
1-mark
20
votes
27
GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true
answered
in
Linear Algebra
Feb 14, 2018
27.2k
views
gatecse-2018
linear-algebra
matrix
eigen-value
normal
2-marks
13
votes
28
GATE CSE 2018 | Question: 18
The chromatic number of the following graph is _____
answered
in
Graph Theory
Feb 14, 2018
12.1k
views
graph-theory
graph-coloring
numerical-answers
gatecse-2018
1-mark
12
votes
29
GATE CSE 2018 | Question: GA-1
"From where are they bringing their books? _______ bringing _______ books from ________" The words that best fill the blanks in the above sentence are $\text{Their, they're, there}$ $\text{They're, their, there}$ $\text{There, their, they're}$ $\text{They're, there,there}$
answered
in
Verbal Aptitude
Feb 14, 2018
5.0k
views
gatecse-2018
verbal-aptitude
most-appropriate-word
easy
1-mark
Page:
1
2
3
4
5
6
...
21
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:...