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 felics moses 1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by felics moses 1
5
answers
1
GATE IT 2004 | Question: 8
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{-input EXCLUSIVE-OR}$ function without using any other logic gate? $2$ $4$ $5$ $6$
commented
in
Digital Logic
Jan 9
10.1k
views
gateit-2004
digital-logic
min-no-gates
normal
4
answers
2
GATE CSE 2022 | Question: 42
Which of the properties hold for the adjacency matrix $A$ of a simple undirected unweighted graph having $n$ vertices? The diagonal entries of $A^{2}$ ... . If there is at least a $1$ in each of $A\text{'s}$ rows and columns, then the graph must be connected.
answered
in
Graph Theory
Apr 22, 2022
3.8k
views
gatecse-2022
graph-theory
graph-connectivity
multiple-selects
2-marks
3
answers
3
GATE CSE 2022 | Question: 12
Consider an enterprise network with two Ethernet segments, a web server and a firewall, connected via three routers as shown below. What is the number of subnets inside the enterprise network? $3$ $12$ $6$ $8$
answered
in
Computer Networks
Mar 27, 2022
8.5k
views
gatecse-2022
computer-networks
ethernet
1-mark
3
answers
4
GATE IT 2005 | Question: 64
The availability of a complex software is 90%. Its Mean Time Between Failure (MTBF) is 200 days. Because of the critical nature of the usage, the organization deploying the software further enhanced it to obtain an availability of 95%. In the process, the ... (MTTR) increased by 5 days. What is the MTBF of the enhanced software? 205 days 300 days 500 days 700 days
commented
in
IS&Software Engineering
Nov 15, 2021
3.7k
views
gateit-2005
is&software-engineering
software-testing
normal
2
answers
5
GATE CSE 2020 | Question: 45
For $n>2$, let $a \in \{0,1\}^n$ be a non-zero vector. Suppose that $x$ is chosen uniformly at random from $\{0,1\}^n$. Then, the probability that $\displaystyle{} \Sigma_{i=1}^n a_i x_i$ is an odd number is______________
commented
in
Probability
Oct 14, 2021
9.2k
views
gatecse-2020
numerical-answers
probability
uniform-distribution
2-marks
3
answers
6
GATE CSE 2018 | Question: 28
Consider the first-order logic sentence $\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(s, t, u, v, w, x, y)$ ... or equal to $3$ There exists no model of $\varphi$ with universe size of greater than $7$ Every model of $\varphi$ has a universe of size equal to $7$
comment edited
in
Mathematical Logic
May 29, 2021
18.4k
views
gatecse-2018
mathematical-logic
normal
first-order-logic
2-marks
6
answers
7
GATE CSE 2014 Set 2 | Question: 30
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ ... $s(S)$ is more than $0.5$. join selection factor between $r(R)$ and $s(S)$ is less than $0.5$.
answered
in
Databases
May 27, 2021
17.4k
views
gatecse-2014-set2
databases
normal
joins
12
answers
8
GATE CSE 2005 | Question: 70
Consider a disk drive with the following specifications: $16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is operated in cycle stealing mode whereby whenever one $4$ byte word is ready it is sent ... $40$ nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is: $10$ $25$ $40$ $50$
answered
in
CO and Architecture
May 20, 2021
33.3k
views
gatecse-2005
co-and-architecture
disk
normal
dma
2
answers
9
GATE CSE 2021 Set 2 | Question: 27
Assume a two-level inclusive cache hierarchy, $L1$ and $L2$, where $L2$ is the larger of the two. Consider the following statements. $S_1$: Read misses in a write through $L1$ cache do not result in writebacks of dirty lines to the $L2$ $S_2$: Write ... false $S_1$ is false and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
commented
in
CO and Architecture
Mar 24, 2021
5.2k
views
gatecse-2021-set2
co-and-architecture
cache-memory
2-marks
7
answers
10
GATE CSE 2006 | Question: 24
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = \min(\pi(B))$, where $\min(S)$ is the smallest integer in the set of integers $S$, and $\pi$(S) is the set of ... $n! \frac{|A ∩ B|}{|A ∪ B|}$ $\dfrac{|A ∩ B|^2}{^n \mathrm{C}_{|A ∪ B|}}$
commented
in
Set Theory & Algebra
Feb 4, 2021
9.0k
views
gatecse-2006
set-theory&algebra
normal
set-theory
5
answers
11
GATE IT 2007 | Question: 84
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions? $1$ $2$ $3$ $4$
commented
in
Databases
Dec 19, 2020
13.8k
views
gateit-2007
databases
b-tree
normal
4
answers
12
GATE IT 2007 | Question: 76
Consider the sequence $\langle x_n \rangle , \: n \geq 0$ defined by the recurrence relation $x_{n+1} = c . x^2_n -2$, where $c > 0$. Suppose there exists a non-empty, open interval $(a, b)$ such that for all $x_0$ satisfying $a < x_0 < b$, the ... sequence converges to the value? $\frac{1+\sqrt{1+8c}}{2c}$ $\frac{1-\sqrt{1+8c}}{2c}$ $2$ $\frac{2}{2c-1}$
commented
in
Combinatory
Dec 19, 2020
4.3k
views
gateit-2007
combinatory
normal
recurrence-relation
3
answers
13
GATE CSE 2017 Set 2 | Question: 18
Consider socket API on a Linux machine that supports connected UDP sockets. A connected UDP socket is a UDP socket on which $connect$ function has already been called. Which of the following statements is/are CORRECT? A connected UDP socket can be used ... $connect$ function again for an already connected UDP socket. I only II only Both I and II Neither I nor II
commented
in
Computer Networks
Dec 18, 2020
12.5k
views
gatecse-2017-set2
computer-networks
udp
3
answers
14
GATE CSE 2017 Set 2 | Question: 20
The maximum number of $\textsf{IPv4}$ router addresses that can be listed in the record route (RR) option field of an $\textsf{IPv4}$ header is______.
commented
in
Computer Networks
Dec 18, 2020
13.7k
views
gatecse-2017-set2
computer-networks
ip-addressing
numerical-answers
1
answer
15
GATE IT 2004 | Question: 72
What is the availability of a software with the following reliability figures? Mean Time Between Failure (MTBF) = 25 days Mean Time To Repair (MTTR) = 6 hours 1% 24% 99% 99.009%
commented
in
IS&Software Engineering
Dec 1, 2020
4.4k
views
gateit-2004
is&software-engineering
software-reliability
normal
13
answers
16
GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
commented
in
Operating System
Apr 23, 2020
64.5k
views
gatecse-2008
operating-system
virtual-memory
normal
6
answers
17
GATE CSE 2020 | Question: 40
Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in E$, define ${w}'(u,v)$ as $w(u,v)+f(u)-f(v)$. Which one of the ... from $s$ to $u$ in the graph obtained by adding a new vertex $s$ to $G$ and edges of zero weight from $s$ to every vertex of $G$
answer reshown
in
Algorithms
Mar 17, 2020
13.8k
views
gatecse-2020
algorithms
graph-algorithms
2-marks
8
answers
18
GATE CSE 2020 | Question: 42
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ______.
answered
in
Combinatory
Mar 15, 2020
12.5k
views
gatecse-2020
numerical-answers
combinatory
2-marks
4
answers
19
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 Ⅲ
commented
in
Compiler Design
Feb 21, 2020
10.5k
views
gatecse-2020
compiler-design
compilation-phases
runtime-environment
1-mark
4
answers
20
GATE CSE 2020 | Question: 2
For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is $\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$) $\Theta (\log_{b} \log_{a} \: n$) $\Theta (\log_{2} \log_{2} n$)
commented
in
Algorithms
Feb 18, 2020
14.3k
views
gatecse-2020
algorithms
recurrence-relation
1-mark
6
answers
21
GATE CSE 2006 | Question: 63, UGCNET-June2012-III: 45
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to ... more efficient now Hardware support for memory management is no longer needed CPU scheduling can be made more efficient now
answered
in
Operating System
Jan 2, 2020
22.0k
views
gatecse-2006
operating-system
virtual-memory
normal
ugcnetcse-june2012-paper3
6
answers
22
GATE CSE 2019 | Question: 54
In an RSA cryptosystem, the value of the public modulus parameter $n$ is $3007$. If it is also known as that $\phi(n)=2880$ where $\phi()$ denotes Euler’s Totient Function, then the prime factor of $n$ which is greater than $50$ is _________
answer reshown
in
Computer Networks
Dec 4, 2019
7.6k
views
gatecse-2019
numerical-answers
computer-networks
network-security
out-of-gate-syllabus
2-marks
5
answers
23
GATE CSE 2019 | Question: 48
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... Consider the language $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______
commented
in
Theory of Computation
Sep 22, 2019
16.2k
views
gatecse-2019
numerical-answers
theory-of-computation
finite-automata
minimal-state-automata
difficult
2-marks
12
answers
24
GATE CSE 2006 | Question: 54
Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a_{i}+a_{i+1}+\dots+a_{j}=b_{i}+b_{i+1}+\dots+b_{j}$ ... time in the key comparison mode Takes $\Theta (n)$ time and space Takes $O(\sqrt n)$ time only if the sum of the $2n$ elements is an even number
commented
in
Algorithms
Oct 25, 2018
22.6k
views
gatecse-2006
algorithms
normal
algorithm-design
time-complexity
1
answer
25
LHS of 3NF and BCNF
Why LHS of a 3NF or BCNF should be a super key and why not just a candidate key?
commented
in
Databases
Jun 16, 2018
687
views
6
answers
26
GATE CSE 2018 | Question: 31
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the product of $n$ matrices $G_1G_2G_3 \dots G_n$ can be done by parenthesizing ... the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_1F_2$ and $F_4F_5$ only
commented
in
Algorithms
May 20, 2018
15.5k
views
gatecse-2018
algorithms
dynamic-programming
2-marks
5
answers
27
GATE CSE 2017 Set 1 | Question: 30
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ -1}{2}$
answered
in
Linear Algebra
Mar 26, 2017
11.7k
views
gatecse-2017-set1
linear-algebra
normal
vector-space
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
IIITA M.TECH IT COMPLETE EXPLANATION FROM ADMISSION TO PLACEMENT
GO Classes NIELIT Test Series For 2023
Interview Experience : MTech Research(Machine Learning) at IIT Mandi
DRDO Scientist -B
ISRO Scientist-B 2023
Subjects
All categories
General Aptitude
(2.8k)
Engineering Mathematics
(9.8k)
Digital Logic
(3.4k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.4k)
Others
(2.5k)
Admissions
(667)
Exam Queries
(1.0k)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(867)
Recent Blog Comments
This story is same like my tier 3 college btech...
@Nikhil_dhamaHi , now i am in 2nd semester...
You can attempt now:...
where is the free test link ? how i can attempt...
Left with 10days, nothing heard back from them,...