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 Paatni22
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Paatni22
7
answers
1
GATE CSE 2021 Set 2 | Question: 3
Consider the following $\text{ANSI C}$ program: int main () { Integer x; return 0; } Which one of the following phases in a seven-phase $C$ compiler will throw an error? Lexical analyzer Syntax analyzer Semantic analyzer Machine dependent optimizer
commented
in
Compiler Design
Feb 28, 2021
17.1k
views
gatecse-2021-set2
compilation-phases
compiler-design
1-mark
4
answers
2
Test by Bikram | Digital Logic | Test 2 | Question: 16
Karnaugh map is used for the purpose of: Reducing the electronic circuits used. Mapping the given Boolean logic function. Minimizing the terms in a Boolean expression. Maximizing the terms of a given a Boolean expression.
commented
in
Digital Logic
Jan 14, 2021
428
views
tbb-digital-logic-2
7
answers
3
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
commented
in
Algorithms
Jan 13, 2021
36.4k
views
gatecse-2008
normal
algorithms
time-complexity
5
answers
4
TIFR CSE 2013 | Part A | Question: 9
There are $n$ kingdoms and $2n$ champions. Each kingdom gets $2$ champions. The number of ways in which this can be done is: $\frac{\left ( 2n \right )!}{2^{n}}$ $\frac{\left ( 2n \right )!}{n!}$ $\frac{\left ( 2n \right )!}{2^{n} . n!}$ $\frac{n!}{2}$ None of the above
commented
in
Combinatory
Jan 10, 2021
3.3k
views
tifr2013
combinatory
discrete-mathematics
normal
balls-in-bins
3
answers
5
TIFR CSE 2010 | Part A | Question: 3
The function $f (x) = 2.5 \log_e \left( 2 + \exp \left( x^2 - 4x + 5 \right)\right)$ attains a minimum at $x = $? $0$ $1$ $2$ $3$ $4$
commented
in
Calculus
Jan 6, 2021
1.9k
views
tifr2010
calculus
maxima-minima
4
answers
6
GATE CSE 1997 | Question: 4.1
What is the maximum value of the function $f(x) = 2x^2 - 2x + 6$ in the interval $\left[0,2 \right]$? 6 10 12 5.5
commented
in
Calculus
Jan 6, 2021
5.8k
views
gate1997
calculus
maxima-minima
normal
4
answers
7
GATE CSE 2012 | Question: 9
Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are One, at $\dfrac{\pi}{2}$ One, at $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{2}$ and $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{4}$ and $\dfrac{3\pi}{2}$
commented
in
Calculus
Jan 6, 2021
13.9k
views
gatecse-2012
calculus
maxima-minima
normal
11
answers
8
GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$
commented
in
Calculus
Jan 5, 2021
20.9k
views
gatecse-2014-set1
calculus
continuity
normal
3
answers
9
GATE CSE 2008 | Question: 28
How many of the following matrices have an eigenvalue 1? $\left[\begin{array}{cc}1 & 0 \\0 & 0 \end{array} \right]\left[\begin{array}{cc}0 & 1 \\0 & 0 \end{array} \right] \left[\begin{array}{cc}1 & -1 \\1 & 1 \end{array} \right]$ and $\left[\begin{array}{cc}-1 & 0 \\1 & -1 \end{array} \right]$ one two three four
commented
in
Linear Algebra
Jan 3, 2021
8.5k
views
gatecse-2008
eigen-value
linear-algebra
2
answers
10
TIFR CSE 2012 | Part B | Question: 12
Let $A$ be a matrix such that $A^{k}=0$. What is the inverse of $I - A$? $0$ $I$ $A$ $1 + A + A^{2} + ...+ A^{k - 1}$ Inverse is not guaranteed to exist.
commented
in
Linear Algebra
Jan 2, 2021
3.2k
views
tifr2012
linear-algebra
matrix
7
answers
11
GATE IT 2008 | Question: 29
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct? S1: Each row of $M$ can be represented as a linear combination of the other rows S2: Each column of $M$ can be represented as a linear combination of the other columns S3 ... solution S4: $M$ has an inverse $S3$ and $S2$ $S1$ and $S4$ $S1$ and $S3$ $S1, S2$ and $S3$
commented
in
Linear Algebra
Jan 2, 2021
9.6k
views
gateit-2008
linear-algebra
normal
matrix
4
answers
12
GATE CSE 2011 | Question: 33
Consider a finite sequence of random values $X=[x_1,x_2,\dots x_n]$. Let $\mu_x$ be the mean and $\sigma_x$ be the standard deviation of $X$. Let another finite sequence $Y$ of equal length be derived from this as $y_i=a*x_i+b$, where $a$ and $b$ are positive ... $Y$ in $Y$ $\mu_y=a \mu_x + b$ $\sigma_y=a \sigma_x + b$
commented
in
Probability
Dec 28, 2020
8.3k
views
gatecse-2011
probability
random-variable
normal
7
answers
13
GATE CSE 2011 | Question: 34
A deck of $5$ cards (each carrying a distinct number from $1$ to $5$) is shuffled thoroughly. Two cards are then removed one at a time from the deck. What is the probability that the two cards are selected with the number on the first card being one higher than the number ... $\left(\dfrac{4}{25}\right)$ $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{2}{5}\right)$
commented
in
Probability
Dec 28, 2020
18.1k
views
gatecse-2011
probability
normal
6
answers
14
GATE CSE 1995 | Question: 2.14
A bag contains $10$ white balls and $15$ black balls. Two balls are drawn in succession. The probability that one of them is black and the other is white is: $\frac{2}{3}$ $\frac{4}{5}$ $\frac{1}{2}$ $\frac{1}{3}$
commented
in
Probability
Dec 28, 2020
8.5k
views
gate1995
probability
normal
4
answers
15
GATE CSE 2014 Set 2 | Question: 1
The security system at an IT office is composed of $10$ computers of which exactly four are working. To check whether the system is functional, the officials inspect four of the computers picked at random (without replacement). The system is ... are working. Let the probability that the system is deemed functional be denoted by $p.$ Then $100p =$ _____________.
commented
in
Probability
Dec 27, 2020
11.8k
views
gatecse-2014-set2
probability
numerical-answers
normal
4
answers
16
GATE CSE 2014 Set 2 | Question: 2
Each of the nine words in the sentence $\text{"The quick brown fox jumps over the lazy dog”}$ is written on a separate piece of paper. These nine pieces of paper are kept in a box. One of the pieces is drawn at random from the box. The $\text{expected}$ length of the word drawn is _____________. (The answer should be rounded to one decimal place.)
commented
in
Probability
Dec 27, 2020
6.4k
views
gatecse-2014-set2
probability
expectation
numerical-answers
easy
5
answers
17
TIFR CSE 2013 | Part B | Question: 4
A set $S$ together with partial order $\ll$ is called a well order if it has no infinite descending chains, i.e. there is no infinite sequence $x_1, x_2,\ldots$ of elements from $S$ such that $x_{i+1} \ll x_i$ and $x_{i+1} \neq x_i$ for all $i$. ... $2^{24}$ words. $W$ is not a partial order. $W$ is a partial order but not a well order. $W$ is a well order.
comment edited
in
Set Theory & Algebra
Dec 18, 2020
3.2k
views
tifr2013
set-theory&algebra
partial-order
2
answers
18
parent and child address space
"In a technique called COPY ON WRITE, when a fork occurs, the parent process's pages are not copied for the child process. Instead, the pages are shared between the child and the parent process. Whenever a process (parent or child) ... modify any page then that particular page will be copied for child and it will point to a different frame in main memory.
answered
in
Operating System
Dec 15, 2020
3.8k
views
operating-system
9
answers
19
GATE CSE 2004 | Question: 18, ISRO2007-31
In an $SR$ latch made by cross-coupling two NAND gates, if both $S$ and $R$ inputs are set to $0$, then it will result in $Q = 0, Q' = 1$ $Q = 1, Q' = 0$ $Q = 1, Q' = 1$ Indeterminate states
commented
in
Digital Logic
Dec 13, 2020
22.0k
views
gatecse-2004
digital-logic
easy
isro2007
flip-flop
7
answers
20
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
commented
in
DS
Nov 23, 2020
23.3k
views
gatecse-2002
data-structures
binary-tree
normal
5
answers
21
General Doubt
the complement of every context-free language is recursive ? or recursive enumerable? or both?
comment edited
in
Theory of Computation
Nov 8, 2020
13.3k
views
general-topic-doubt
theory-of-computation
closure-property
9
answers
22
GATE CSE 2010 | Question: 41
Let $w$ be any string of length $n$ in $\{0,1\}^*$. Let $L$ be the set of all substrings of $w$. What is the minimum number of states in non-deterministic finite automation that accepts $L$? $n-1$ $n$ $n+1$ $2^{n-1}$
commented
in
Theory of Computation
Nov 6, 2020
23.9k
views
gatecse-2010
theory-of-computation
finite-automata
normal
minimal-state-automata
3
answers
23
GATE IT 2008 | Question: 61
Let $R (A, B, C, D)$ be a relational schema with the following functional dependencies : $A → B$, $B → C$, $C → D$ and $D → B$. The decomposition of $R$ into $(A, B), (B, C), (B, D)$ gives a ... a lossless join, but is not dependency preserving does not give a lossless join, but is dependency preserving does not give a lossless join and is not dependency preserving
commented
in
Databases
Oct 24, 2020
35.3k
views
gateit-2008
databases
database-normalization
normal
2
answers
24
GATE CSE 1996 | Question: 23
A file system with a one-level directory structure is implemented on a disk with disk block size of $4K$ ... What is the maximum possible number of files? What is the maximum possible file size in blocks
commented
in
Operating System
Oct 23, 2020
9.8k
views
gate1996
operating-system
disk
normal
file-system
descriptive
2
answers
25
GATE CSE 1993 | Question: 7.6
A simple two-pass assembler does the following in the first pass: It allocates space for the literals. It computes the total length of the program. It builds the symbol table for the symbols and their values. It generates code for all the load and store register instructions. None of the above.
commented
in
Compiler Design
Oct 20, 2020
19.7k
views
gate1993
compiler-design
assembler
easy
multiple-selects
4
answers
26
GATE CSE 1989 | Question: 2-iv
Match the pairs in the following: ...
commented
in
Operating System
Oct 19, 2020
12.9k
views
match-the-following
gate1989
operating-system
virtual-memory
6
answers
27
ISRO2007-11, GATE CSE 2001 | Question: 1.19
Consider a set of n tasks with known runtimes $r_1, r_2, \dots r_n$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput? Round Robin Shortest job first Highest response ratio next first come first served
commented
in
Operating System
Sep 28, 2020
12.9k
views
isro2007
operating-system
process-scheduling
gatecse-2001
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:...