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 sanjaysharmarose
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sanjaysharmarose
9
answers
1
GATE CSE 2021 Set 1 | GA Question: 9
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$ $\text{Statement 1:}$ All bacteria are microorganisms. $\text{Statement 2:}$ All pathogens are microorganisms. $\text{Conclusion I:}$ Some pathogens are ... Either conclusion $\text{I}$ or $\text{II}$ is correct Neither conclusion $\text{I}$ nor $\text{II}$ is correct
comment edited
in
Analytical Aptitude
Mar 1, 2021
14.4k
views
gatecse-2021-set1
analytical-aptitude
logical-reasoning
statements-follow
2-marks
3
answers
2
GATE CSE 2020 | Question: 54
Consider a database implemented using $\text{B+}$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 bytes}$ ... that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______
commented
in
Databases
Feb 10, 2021
22.3k
views
gatecse-2020
numerical-answers
databases
b-tree
indexing
2-marks
4
answers
3
GATE CSE 2016 Set 2 | Question: 31
Consider a processor with $64$ registers and an instruction set of size twelve. Each instruction has five distinct fields, namely, opcode, two source register identifiers, one destination register identifier, and twelve-bit immediate value. Each ... program has $100$ instructions, the amount of memory (in bytes) consumed by the program text is _________.
commented
in
CO and Architecture
Feb 7, 2021
20.9k
views
gatecse-2016-set2
instruction-format
machine-instruction
co-and-architecture
normal
numerical-answers
2
answers
4
System Performance
Consider a system with cycles per instruction (CPI) is 1.0 when all memory accesses hit in the cache. The only data accesses are loads and stores, and these are 50% of the total instructions. If the miss penalty is 30 clock cycles and the miss rate is 4%, how much faster would the computer be if all instructions were cache hits? (A) 1 (B) 2.8 (C) 1.6 (D) 3.5
commented
in
CO and Architecture
Dec 14, 2020
1.7k
views
co-and-architecture
4
answers
5
GATE CSE 2000 | Question: 2.14
Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + B executed on a computer where floating point numbers are represented with $32$ bits. The values for $X$ and $Y$ will be $X = 1.0, Y = 1.0$ $X = 1.0, Y = 0.0$ $X = 0.0, Y = 1.0$ $X = 0.0, Y = 0.0$
commented
in
Digital Logic
Dec 10, 2020
12.0k
views
gatecse-2000
digital-logic
number-representation
normal
6
answers
6
GATE IT 2008 | Question: 64
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/s}.$ What should be the packet size for a channel utilization of $25\%$ for ... there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$
commented
in
Computer Networks
Nov 4, 2020
24.7k
views
gateit-2008
computer-networks
sliding-window
normal
2
answers
7
memory management
A computer whose processes have 1024 pages in their address spaces keeps its page tables in memory. The overhead required for reading a word from the page table is 500 nsec. To reduce this overhead, the computer has an associative memory which holds 32 (virtual page, ... frame) pairs and can do look up in 100 nsec. What hit rate is needed to reduce the mean overhead to 200 nsec?
answered
in
Operating System
Oct 28, 2020
4.1k
views
memory-management
operating-system
1
answer
8
GATE CSE 2001 | Question: 21-c
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number. Suppose the relation $\text{appears (regno, centr_code)}$ specifies the center where an examinee appears. Write an SQL query to list the centr_code having an examinee of score greater than $80.$
commented
in
Databases
Oct 24, 2020
1.9k
views
gatecse-2001
databases
sql
normal
descriptive
6
answers
9
GATE CSE 2009 | Question: 56
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... $\text{2NF}$ but not in $\text{3NF}$ The schema is not in $\text{2NF}$
commented
in
Databases
Oct 19, 2020
28.0k
views
gatecse-2009
databases
sql
database-normalization
normal
3
answers
10
GATE CSE 2000 | Question: 1.23, ISRO2016-57
Given the relations employee (name, salary, dept-no), and department (dept-no, dept-name,address), Which of the following queries cannot be expressed using the basic relational algebra operations ... whose name is the same as their department name The sum of all employees' salaries All employees of a given department
commented
in
Databases
Oct 18, 2020
14.8k
views
gatecse-2000
databases
relational-algebra
easy
isro2016
7
answers
11
MadeEasy Subject Test: Theory of Computation - Identify Class Language
Consider the following language, $L= \big\{ xy \mid x, \ y \in \big\{0,1\big\}^{*} \ where \ x \neq y \ but \ |x| = |y| \big\}$ The language is ___________. Regular CFL but not regular CSL but not CFL Recursive but not CSL
commented
in
Theory of Computation
Oct 10, 2020
4.1k
views
made-easy-test-series
theory-of-computation
identify-class-language
2
answers
12
GATE CSE 1997 | Question: 17
An array $A$ contains $n \geq 1$ positive integers in the locations $A[1], A[2], \dots A[n]$. The following program fragment prints the length of a shortest sequence of consecutive elements of $A$, $A[i], A[i+1], \dots,A[j]$ ... ◻ end else begin if(j-i) < min then min:=j-i; sum:=sum -A[i]; i:=i+1; end writeln (min +1); end.
comment edited
in
DS
Sep 20, 2020
5.0k
views
gate1997
data-structures
array
normal
descriptive
3
answers
13
DCFLs
S1: Every DCFL has unambiguous grammar S2: Every language accepted by DPDA with final state is also accepted by DPDA with empty stack S1 is given as true and S2 false. Explain how?!
commented
in
Theory of Computation
Sep 14, 2020
3.4k
views
theory-of-computation
dcfl
unambiguous-grammar
2
answers
14
Grammars
Please provide example to disapprove the following points:- 1.every DCFG need not be a LR(K). 2.every DCFG need not be a LL(K). 3.every DCFL is not LL(k).
commented
in
Compiler Design
Sep 14, 2020
797
views
compiler-design
grammar
2
answers
15
GATE CSE 2006 | Question: 33
Let $L_1$ be a regular language, $L_2$ be a deterministic context-free language and $L_3$ a recursively enumerable, but not recursive, language. Which one of the following statements is false? $L_1 \cap L_2$ is a deterministic CFL $L_3 \cap L_1$ is recursive $L_1 \cup L_2$ is context free $L_1 \cap L_2 \cap L_3$ is recursively enumerable
commented
in
Theory of Computation
Sep 5, 2020
12.5k
views
gatecse-2006
theory-of-computation
normal
identify-class-language
2
answers
16
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.}$
commented
in
Theory of Computation
Sep 4, 2020
16.2k
views
gatecse-2010
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
normal
6
answers
17
GATE CSE 2011 | Question: 45
A deterministic finite automaton ($\text{DFA}$) $D$ with alphabet $\Sigma = \{a, b\}$ is given below. Which of the following finite state machines is a valid minimal $\text{DFA}$ which accepts the same languages as $D$?
commented
in
Theory of Computation
Sep 2, 2020
10.7k
views
gatecse-2011
theory-of-computation
finite-automata
easy
minimal-state-automata
5
answers
18
GATE CSE 1998 | Question: 3b
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed integer)
commented
in
Theory of Computation
Sep 1, 2020
8.8k
views
gate1998
theory-of-computation
regular-expression
easy
descriptive
3
answers
19
TIFR CSE 2014 | Part B | Question: 12
Consider the following three statements: Intersection of infinitely many regular languages must be regular. Every subset of a regular language is regular. If $L$ is regular and $M$ is not regular then $L ∙ M$ is necessarily not regular. Which of the ... above? true, false, true. false, false, true. true, false, true. false, false, false. true, true, true.
commented
in
Theory of Computation
Sep 1, 2020
4.9k
views
tifr2014
theory-of-computation
regular-language
7
answers
20
GATE CSE 2015 Set 2 | Question: 45
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the ... $(a, $ left_end$, k)$ $(a, n-$left_end$-1, k-$left_end$-1)$ and $(a, $left_end$, k)$
commented
in
Algorithms
Aug 10, 2020
16.6k
views
gatecse-2015-set2
algorithms
normal
sorting
8
answers
21
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
commented
in
Algorithms
Aug 10, 2020
28.0k
views
gatecse-2013
algorithms
sorting
normal
heap-sort
3
answers
22
GATE CSE 1996 | Question: 2.15
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot $1, 2, 3, \dots n$ $n, n-1, n-2, \dots, 2, 1$ Let $C_1$ and $C_2$ be the number of comparisons made for the inputs (i) and (ii) respectively. Then, $C_1 < C_2$ $C_1 > C_2$ $C_1 = C_2$ we cannot say anything for arbitrary $n$
comment edited
in
Algorithms
Aug 10, 2020
11.0k
views
gate1996
algorithms
sorting
normal
7
answers
23
GATE IT 2004 | Question: 55
Let $f(n)$, $g(n)$ and $h(n)$ be functions defined for positive integers such that $f(n) = O(g(n))$, $g(n) \neq O(f(n))$, $g(n) = O(h(n))$, and $h(n) = O(g(n))$. Which one of the following statements is FALSE? $f(n) + g(n) = O(h(n) + h(n))$ $f(n) = O(h(n))$ $h(n) \neq O(f(n))$ $f(n)h(n) \neq O(g(n)h(n))$
commented
in
Algorithms
Aug 9, 2020
13.2k
views
gateit-2004
algorithms
asymptotic-notation
normal
11
answers
24
GATE CSE 2004 | Question: 85
A program takes as input a balanced binary search tree with $n$ leaf nodes and computes the value of a function $g(x)$ for each node $x$. If the cost of computing $g(x)$ ... time complexity of the program is? $\Theta (n)$ $\Theta (n \log n)$ $\Theta(n^2)$ $\Theta (n^2\log n)$
commented
in
DS
Aug 5, 2020
31.4k
views
gatecse-2004
binary-search-tree
normal
data-structures
4
answers
25
GATE CSE 2003 | Question: 2
Assume the following C variable declaration: int *A[10], B[10][10]; Of the following expressions: $A[2]$ $A[2][3]$ $B[1]$ $B[2][3]$ which will not give compile-time errors if used as left hand sides of assignment statements in a C program? I, II, and IV only II, III, and IV only II and IV only IV only
commented
in
Programming in C
Jul 24, 2020
29.9k
views
gatecse-2003
programming
programming-in-c
easy
pointers
6
answers
26
GATE CSE 2004 | Question: 24
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ ... $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$
comment edited
in
Set Theory & Algebra
Jul 14, 2020
9.8k
views
gatecse-2004
set-theory&algebra
easy
relations
17
answers
27
GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
commented
in
Combinatory
Jul 12, 2020
25.9k
views
gatecse-2016-set1
combinatory
generating-functions
normal
numerical-answers
7
answers
28
TIFR CSE 2011 | Part A | Question: 19
Three dice are rolled independently. What is the probability that the highest and the lowest value differ by $4$? $\left(\dfrac{1}{3}\right)$ $\left(\dfrac{1}{6}\right)$ $\left(\dfrac{1}{9}\right)$ $\left(\dfrac{5}{18}\right)$ $\left(\dfrac{2}{9}\right)$
commented
in
Probability
Jun 25, 2020
2.9k
views
tifr2011
probability
independent-events
7
answers
29
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)$
comment edited
in
Probability
Jun 25, 2020
18.1k
views
gatecse-2011
probability
normal
2
answers
30
TIFR CSE 2012 | Part A | Question: 13
The maximum value of the function $f\left(x, y, z\right)= \left(x - 1 / 3\right)^{2}+ \left(y - 1 / 3\right)^{2}+ \left(z - 1 / 3\right)^{2}$ subject to the constraints $x + y + z=1,\quad x \geq 0, y \geq 0, z \geq 0$ is $1 / 3$ $2 / 3$ $1$ $4 / 3$ $4 / 9$
commented
in
Calculus
Jun 22, 2020
1.4k
views
tifr2012
calculus
maxima-minima
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:...