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 amitarp818
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by amitarp818
3
answers
1
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 54
Of the following, which gives the best upper bound for the value of $f(N)$ where $f$ is a solution to the recurrence $ f(2 N+1)=f(2 N)=f(N)+\log N \text { for } N \geq 1, $ with $f(1)=0?$ $O(\log N)$ $O(N \log N)$ $O\left((\log N)^2\right)$ $O(N)$
commented
in
Algorithms
Jan 22
849
views
goclasses2024-mockgate-12
goclasses
algorithms
recurrence-relation
time-complexity
2-marks
1
answer
2
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 33
Consider the following grammar: $ \begin{aligned} & S \rightarrow a S^{\prime} \\ & S^{\prime} \rightarrow b S^{\prime} \mid \epsilon \end{aligned} $ Which of the following is/are CORRECT right sentential form of the given grammar? $a b S^{\prime}$ $bS'$ $a S^{\prime} b$ $bbS$
commented
in
Compiler Design
Jan 22
459
views
goclasses2024-mockgate-12
goclasses
compiler-design
parsing
multiple-selects
2-marks
2
answers
3
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 18
The number of ways that one can divide $10$ distinguishable objects in $3$ indistinguishable non-empty piles, is: $ \left\{\begin{array}{c} 10 \\ 3 \end{array}\right\}=9330 $ In how many different ways can one do this if the objects are also indistinguishable?
commented
in
Combinatory
Jan 21
879
views
goclasses2024-mockgate-12
goclasses
numerical-answers
combinatory
counting
1-mark
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 1
Consider the two statements regarding the Huffman's algorithm - $\text{S1:}$ The character with the highest probability (all probabilities are unique) is guaranteed to be one of the leaves that is closest to the root (i.e it ... $\mathrm{S} 2$ is correct Both are correct statements Both are incorrect statements
commented
in
Algorithms
Jan 21
866
views
goclasses2024-mockgate-12
goclasses
algorithms
greedy-algorithm
huffman-code
1-mark
2
answers
5
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 39
The circuit shown below is designed using two multiplexers. This circuit is equivalent to: a positive edge triggered $\mathrm{T}$ flip flop a negative edge triggered $\mathrm{T}$ flip flop a negative edge triggered $\text{D}$ flip flop a positive edge triggered $\mathrm{D}$ flip flop
commented
in
Digital Logic
Jan 16
777
views
goclasses2024-mockgate-11
goclasses
digital-logic
sequential-circuit
flip-flop
2-marks
1
answer
6
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 34
Which of the following is the best justification for using the middle bits of an address as the set index into a cache rather than the most significant bits? Indexing with the most significant bits would necessitate a smaller ... is likely to make more efficient use of the cache with middle-bit indexing than with high-bit indexing.
answered
in
CO and Architecture
Jan 15
425
views
goclasses2024-mockgate-11
goclasses
co-and-architecture
cache-memory
1-mark
1
answer
7
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 32
On a wireless link, the probability of successfully sending a packet is $0.1.$ A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be independent of ... is the expected number of packets that experience timeout to send one packet? (Timeout occurs on unsuccessful transmission)
commented
in
Computer Networks
Jan 15
526
views
goclasses2024-mockgate-11
goclasses
numerical-answers
computer-networks
stop-and-wait
1-mark
4
answers
8
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 60
In a relational database relation, we say a non-empty set of attributes $\mathrm{X}$ is closed (with respect to a given set of functional dependencies FD) if $X^{+}=X$ (where $X^{+}$is the closure of $X).$ ... $2.$ $R$ is in $2 N F$. $R$ is in $3 N F$.
commented
in
Databases
Jan 14
953
views
goclasses2024-mockgate-11
goclasses
databases
database-normalization
functional-dependency
multiple-selects
2-marks
2
answers
9
GO Classes Scholarship 2023 | Test | Question: 18
Consider the following declaration of pointer variable $p.$ int (*p)[10][5]; If the initial value of $p$ is $1000,$ then what will be the value of $p+1?$ It is given that system has $8$ bytes of address size and $4$ bytes of integer size.
commented
in
Programming in C
Jan 12
864
views
goclasses-scholarship-test1
numerical-answers
goclasses
array-of-pointers
programming
programming-in-c
pointers
1-mark
2
answers
10
GATE CSE 2005 | Question: 6
An undirected graph $G$ has $n$ nodes. its adjacency matrix is given by an $n \times n$ square matrix whose (i) diagonal elements are 0's and (ii) non-diagonal elements are 1's. Which one of the following is TRUE? Graph $G$ has no minimum ... cost $n-1$ Graph $G$ has multiple distinct MSTs, each of cost $n-1$ Graph $G$ has multiple spanning trees of different costs
commented
in
Algorithms
Jan 4
13.9k
views
gatecse-2005
algorithms
spanning-tree
normal
1
answer
11
number system
A particular number system has 18 symbols from 0 to 9 , A,S,C,D,E,F,G and T. If two numbers GATE and CSE are given to the adder the output of the adder is a) G7CA b) T76C c) T7CA d) T5SA
commented
in
Digital Logic
Dec 29, 2023
2.0k
views
2
answers
12
GATE CSE 2023 | Question: 32
A $4$ kilobyte $\text{(KB)}$ byte-addressable memory is realized using four $1 \mathrm{~KB}$ memory blocks. Two input address lines $\text{(IA4 and IA3)}$ are connected to the chip select $\text{(CS)}$ port of these memory blocks through a decoder as shown in the figure. The ... options is $\text{CORRECT}?$ $(0,1,2,3)$ $(0,1024,2048,3072)$ $(0,8,16,24)$ $(0,0,0,0)$
commented
in
CO and Architecture
Dec 29, 2023
6.1k
views
gatecse-2023
co-and-architecture
memory-interfacing
2-marks
0
answers
13
Decidability
L(M)={0} We can have Tyes for {0} and Tno for Σ∗ ({0}⊂Σ∗{0}⊂Σ∗). Hence, L={M ∣ L(M)={0}} is not Turing recognizable (not recursively enumerable) I don’t understand why this is not decidable. We can easily create a turing that accepts this language
asked
in
Theory of Computation
Dec 28, 2023
240
views
decidability
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
5
answers
14
GATE CSE 1990 | Question: 3-i
Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function $Y,$ implemented by the circuit is, $Y=ABC + DE$ $Y=\overline{ABC + DE}$ $Y=ABC.DE$ $Y=\overline{ABC.DE}$
commented
in
Digital Logic
Dec 26, 2023
7.3k
views
gate1990
normal
digital-logic
circuit-output
2
answers
15
GATE CSE 2008 | Question: 83
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is Which of the following is a correct attribute set for one of the tables for the minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$? ${M1, M2, M3, P1}$ ${M1, P1, N1, N2}$ ${M1, P1, N1}$ ${M1, P1}$
answered
in
Databases
Dec 26, 2023
10.6k
views
gatecse-2008
databases
er-diagram
normal
2
answers
16
ER Diagram to Tables
Please Clear My Doubts here:- 1. In one to one Cardinality if we have Total Participation on One Side or Total Participation on both sides Then only 1 Table is Required. In that table the primary key will be of Entity with total participation.? 2. ... ://gateoverflow.in/143186/minimum-number-of-tables-to-represent-er-diagram How to solve such questions. Plz hep me out here :(
answered
in
Databases
Dec 26, 2023
1.3k
views
databases
er-to-relational
0
answers
17
self doubt
what is the principle of inclusion in cache . pleasse explain in simple terms
commented
in
CO and Architecture
Dec 25, 2023
271
views
co-and-architecture
cache-memory
inclusion
self-doubt
3
answers
18
A memory leak happens when
A memory leak happens when a) a program allocates memory in heap but forgets to deallocate it b) when an un-assigned pointer is used is freed using free function c) when realloc() is called on a pointer that is not allocated d) A program allocates memory in stack
answered
in
Programming in C
Dec 23, 2023
5.2k
views
6
answers
19
GATE CSE 2008 | Question: 64, ISRO2009-13
Which of the following statements about synchronous and asynchronous I/O is NOT true? An ISR is invoked on completion of I/O in synchronous I/O but not in asynchronous I/O In both synchronous and asynchronous I/O, an ISR (Interrupt Service ... process waiting for the completion of I/O is woken up by the ISR that is invoked after the completion of I/O
commented
in
CO and Architecture
Dec 18, 2023
17.6k
views
gatecse-2008
operating-system
io-handling
normal
isro2009
3
answers
20
GATE CSE 1990 | Question: 4-iii
State whether the following statements are TRUE or FALSE with reason: The flags are affected when conditional CALL or JUMP instructions are executed.
commented
in
CO and Architecture
Dec 18, 2023
3.2k
views
gate1990
true-false
co-and-architecture
instruction-execution
6
answers
21
GATE CSE 2016 Set 1 | Question: 31
The size of the data count register of a $\text{DMA}$ controller is $16\;\text{bits}$. The processor needs to transfer a file of $29,154$ kilobytes from disk to main memory. The memory is byte addressable. The minimum number of times ... needs to get the control of the system bus from the processor to transfer the file from the disk to main memory is _________.
comment edited
in
CO and Architecture
Dec 17, 2023
18.5k
views
gatecse-2016-set1
co-and-architecture
dma
normal
numerical-answers
1
answer
22
GO Classes Test Series 2023 | Calculus | Test 1 | Question: 12
Which of the following is/are FALSE? The absolute maximum value of $f(x)=\dfrac{1}{x}$ on the interval $[2,4]$ is $2.$ If $f(x)$ is a continuous function and $f(3)=2$ and $f(5)=-1$, then $f(x)$ has a root between $3$ and $5 .$ ... $h(x)$ is a continuous function and $h(1)=4$ and $h(2)=5$, then $h(x)$ has no roots between $1$ and $2.$
comment edited
in
Calculus
Dec 14, 2023
573
views
goclasses2024-calculus-1
goclasses
calculus
differentiation
maxima-minima
multiple-selects
2-marks
3
answers
23
GO Classes Test Series 2023 | Calculus | Test 1 | Question: 7
Let $q(x)$ be a continuous function which is defined for all real numbers. A portion of the graph of $q^{\prime}(x)$, the derivative of $q(x)$, is shown below. On which of the following interval(s) is $q(x)$ increasing? $(0,2)$ $(2,4)$ $(7,9)$ None of these
answered
in
Calculus
Dec 14, 2023
809
views
goclasses2024-calculus-1
goclasses
calculus
differentiation
multiple-selects
1-mark
1
answer
24
GO Classes Test Series 2023 | Calculus | Test 1 | Question: 6
Suppose that the derivative of a function $h$ is given by: $ h^{\prime}(x)=x(x-1)^{2}(x-2) $ On what interval(s) is $h$ increasing? $(-\infty, 0)$ $(-\infty, 0)$ and $(2, \infty)$ $(0,2)$ $(0,1)$ and $(2, \infty)$
comment edited
in
Calculus
Dec 14, 2023
565
views
goclasses2024-calculus-1
goclasses
calculus
differentiation
1-mark
5
answers
25
GATE CSE 2013 | Question: 28
Consider the following sequence of micro-operations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence? Instruction fetch Operand fetch Conditional branch Initiation of interrupt service
comment edited
in
CO and Architecture
Dec 14, 2023
15.0k
views
gatecse-2013
co-and-architecture
microprogramming
normal
1
answer
26
COA - DMA
A hard disk with a transfer rate of 1 Mbytes/ second is constantly transferring data to memory using DMA. The processor runs at 500 MHz, and takes 500 and 1000 clock cycles to initiate and complete DMA transfer respectively. If the size of the transfer is 1 Kbytes, what is the percentage of processor time consumed for the transfer operation?________(Rounded off to three decimal)
answered
in
CO and Architecture
Dec 11, 2023
432
views
co-and-architecture
dma
interrupts
zeal-workbook
0
answers
27
Made easy DBMS
asked
in
Databases
Dec 5, 2023
209
views
made-easy-test-series
databases
conflict-serializable
0
answers
28
Made easy DBMS
asked
in
Databases
Dec 5, 2023
161
views
made-easy-test-series
databases
2
answers
29
Made Easy Operating system
answer selected
in
Operating System
Dec 4, 2023
196
views
operating-system
made-easy-test-series
1
answer
30
Made Easy Test Series 2024
anyone explain why option B is wrong?
answered
in
Mathematical Logic
Nov 29, 2023
348
views
made-easy-test-series
first-order-logic
discrete-mathematics
made-easy-test-series-2024
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:...