Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
faisal_sayyed
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by faisal_sayyed
1
answer
1
TIFR CSE 2024 | Part B | Question: 15
Consider the following automata: Let $N$ be the number of $0 / 1$-strings of length exactly $6$ accepted by this automata. Which of the following is true about $\text{N}$? $\text{N} \leq 4$. $4$ $8$ $16$ $32$
Consider the following automata:Let $N$ be the number of $0 / 1$-strings of length exactly $6$ accepted by this automata. Which of the following is true about $\text{N}$?...
117
views
answered
Feb 4
Others
tifr2024
+
–
13
answers
2
GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to...
14.9k
views
commented
Jan 26, 2023
CO and Architecture
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
+
–
12
answers
3
GATE CSE 2016 Set 2 | Question: 30
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two...
22.4k
views
answer edited
Jan 9, 2023
CO and Architecture
gatecse-2016-set2
co-and-architecture
data-path
normal
numerical-answers
+
–
1
answer
4
GO Classes Test Series 2023 | Algorithms | Test 2 | Question: 12
Let $T(n)$ be $ T(n)=T(\sqrt{n})+1 $ What will be asymptotic bound on $T(n)$? $\Theta(\log n)$ $\Theta(\sqrt{n})$ $\Theta(\log \log n)$ $\Theta\left((\log n)^ 2\right)$
Let $T(n)$ be$$T(n)=T(\sqrt{n})+1$$What will be asymptotic bound on $T(n)$?$\Theta(\log n)$$\Theta(\sqrt{n})$$\Theta(\log \log n)$$\Theta\left((\log n)^ 2\right)$
213
views
commented
Dec 9, 2022
Algorithms
goclasses2024-algo-2-weekly-quiz
goclasses
algorithms
recurrence-relation
asymptotic-notation
time-complexity
2-marks
+
–
2
answers
5
GO Classes Test Series 2023 | Theory of Computation | Test 1 | Question: 14
Let $L$ be the language accepted by the following non-deterministic finite automaton with $\epsilon$-transitions: The number of states in the minimal DFA that accepts the language that is recognized by the above NFA over alphabet $\{a\},$ is ________
Let $L$ be the language accepted by the following non-deterministic finite automaton with $\epsilon$-transitions:The number of states in the minimal DFA that accepts the ...
503
views
commented
Nov 16, 2022
Theory of Computation
goclasses2024-toc-1-weekly-quiz
numerical-answers
goclasses
theory-of-computation
finite-automata
minimal-state-automata
2-marks
+
–
2
answers
6
GATE2018 CE-2: GA-9
Given that $\frac{\log P}{y-z} = \frac{\log Q}{z-x} = \frac{\log R}{x-y} = 10$ for $x \neq y \neq z$, what is the value of the product $PQR$? 0 1 $xyz$ $10^{xyz}$
Given that $\frac{\log P}{y-z} = \frac{\log Q}{z-x} = \frac{\log R}{x-y} = 10$ for $x \neq y \neq z$, what is the value of the product $PQR$?01$xyz$$10^{xyz}$
2.3k
views
answered
Nov 8, 2022
Quantitative Aptitude
gate2018-ce-2
general-aptitude
quantitative-aptitude
logarithms
+
–
2
answers
7
GATE CSE 2016 Set 2 | Question: 06
Suppose that the eigenvalues of matrix $A$ are $1, 2, 4$. The determinant of $\left(A^{-1}\right)^{T}$ is _________.
Suppose that the eigenvalues of matrix $A$ are $1, 2, 4$. The determinant of $\left(A^{-1}\right)^{T}$ is _________.
11.5k
views
commented
Nov 6, 2022
Linear Algebra
gatecse-2016-set2
linear-algebra
eigen-value
normal
numerical-answers
+
–
1
answer
8
GO Classes Test Series 2023 | Digital Logic | Test 3 | Question: 10
In an $SR$ latch created by cross coupling two NOR gates, which of the following values for $S$ and $R$ will lead to an indeterminate state? $S = 0, R = 0$ $S = 0, R = 1$ $S = 1, R = 0$ $S = 1, R = 1$
In an $SR$ latch created by cross coupling two NOR gates, which of the following values for $S$ and $R$ will lead to an indeterminate state?$S = 0, R = 0$$S = 0, R = 1$$S...
204
views
commented
Oct 27, 2022
Digital Logic
goclasses2024-dl-3-weekly-quiz
goclasses
digital-logic
sequential-circuit
flip-flop
1-mark
+
–
1
answer
9
Can anyone explain about the free exams on GO site in a video?
This is part of the site features explanation videos contest as explained here Exam links: https://gateoverflow.in/blog/5682/list-of-available-exams
This is part of the site features explanation videos contest as explained hereExam links: https://gateoverflow.in/blog/5682/list-of-available-exams
454
views
answered
Jul 14, 2022
Others
free-exams
+
–
4
answers
10
GATE CSE 1998 | Question: 1.9
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is true? $A \subset B$ $B \subset A$ $A$ and $B$ are incomparable $A = B$
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is t...
11.1k
views
answered
Jan 13, 2022
Theory of Computation
gate1998
theory-of-computation
regular-expression
normal
+
–
4
answers
11
Probability Binomial Distribution
Probability of getting a total of 7 atleast once in three toss of a fair die is 125/216 91/216 117/216 9/216
Probability of getting a total of 7 atleast once in three toss of a fair die is125/21691/216117/2169/216
2.1k
views
answered
Oct 31, 2021
Probability
binomial-theorem
probability
+
–
1
answer
12
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 41 (Page No. 336)
How many disk operations are needed to fetch the i-node for a file with the path name /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in memory, but nothing else along the path is in memory. Also assume that all directories fit in one disk block.
How many disk operations are needed to fetch the i-node for a file with the path name /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in m...
1.7k
views
answered
Oct 6, 2021
Operating System
tanenbaum
operating-system
file-system
disk
descriptive
+
–
5
answers
13
OS Memory Management
Consider a paging system with page size of 8 KB. If a process of size 34 KB is in logical address space, find the internal fragmentation in Kbytes. a - 4 b- 5 c -6 d -7 Internal fragmentation is always half the page size I guess So the answer should be 4 KB but it is 6 KB How????
Consider a paging system with page size of 8 KB. If a process of size 34 KB is in logical address space, find the internal fragmentation in Kbytes.a - 4b- 5c -6d -7 Inter...
7.4k
views
answered
Dec 9, 2020
Operating System
operating-system
memory-management
virtual-memory
test-series
+
–
3
answers
14
UGC NET CSE | July 2018 | Part 2 | Question: 28
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number): 45 72 360 450
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):4572360450
17.1k
views
answered
Oct 8, 2020
DS
ugcnetcse-july2018-paper2
data-structures
radix-sort
+
–
4
answers
15
Find he minimum number of scalar multiplications in matrix multiplication
Four matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of total scalar multiplications. For example, when multiplied as ((M1 x M2 ... 100, r = 20, s = 5, and t = 80, then what is the minimum number of scalar multiplications needed ?
Four matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of total scalar multi...
21.9k
views
comment edited
Oct 2, 2020
Algorithms
algorithms
matrix-chain-ordering
+
–
3
answers
16
Link state routing
True / False ) LSR uses dijkstra algorithm ? ) LSR working is similar to dijkstra algorithm ? ) DVR uses bellman algorithm for finding the shortest distance to other routers/hops?
True / False) LSR uses dijkstra algorithm ?) LSR working is similar to dijkstra algorithm ?) DVR uses bellman algorithm for finding the shortest distance to other routers...
1.6k
views
answered
Dec 6, 2019
Computer Networks
computer-networks
routing
link-state-routing
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register