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 Harit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Harit
2
answers
1
find the number of safe sequences
Consider the following system Find the total number of safe sequences?
answered
in
Operating System
Jan 11, 2017
1.0k
views
operating-system
6
answers
2
GATE CSE 1994 | Question: 1.23
Consider the following two functions: $g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n > 10,000 \end{cases}$ $g_2(n) = \begin{cases} n \text{ for } 0 \leq n \leq 100 \\ n^3 \text{ for } n > 100 \end{cases}$ Which of the ... $g_1(n) \text{ is } O(n^3)$ $g_2(n) \text{ is } O(g_1(n))$ $g_2(n) \text{ is } O(n)$
commented
in
Algorithms
Jan 5, 2017
15.5k
views
gate1994
algorithms
asymptotic-notation
normal
multiple-selects
6
answers
3
GATE CSE 2001 | Question: 10
Is the $3\text{-variable}$ function $f= \Sigma(0,1,2,4)$ its self-dual? Justify your answer. Give a minimal product-of-sum form of the $b$ output of the following $\text{excess-3}$ to $\text{BCD}$ converter.
answered
in
Digital Logic
Jan 2, 2017
4.1k
views
gatecse-2001
digital-logic
normal
descriptive
min-sum-of-products-form
4
answers
4
GATE CSE 1992 | Question: 02-ii
All digital circuits can be realized using only Ex-OR gates Multiplexers Half adders OR gates
answered
in
Digital Logic
Jan 2, 2017
10.5k
views
gate1992
normal
digital-logic
digital-circuits
multiple-selects
functional-completeness
combinational-circuit
4
answers
5
GATE CSE 1993 | Question: 8.1
Consider a simple connected graph $G$ with $n$ vertices and $n$ edges $(n > 2)$. Then, which of the following statements are true? $G$ has no cycles The graph obtained by removing any edge from $G$ is not connected $G$ has at least one cycle The graph obtained by removing any two edges from $G$ is not connected None of the above
commented
in
Graph Theory
Dec 27, 2016
9.8k
views
gate1993
graph-theory
graph-connectivity
easy
multiple-selects
5
answers
6
GATE CSE 1999 | Question: 5
Let $G$ be a connected, undirected graph. A cut in $G$ is a set of edges whose removal results in $G$ being broken into two or more components, which are not connected with each other. The size of a cut is called its cardinality. A min-cut of $G$ is a cut ... $n$ vertices has a min-cut of cardinality $k$, then $G$ has at least $\left(\frac{n\times k}{2}\right)$ edges.
answered
in
Graph Theory
Dec 27, 2016
6.4k
views
gate1999
graph-theory
graph-connectivity
normal
descriptive
proof
6
answers
7
GATE CSE 2016 Set 1 | Question: 53
An IP datagram of size $1000$ $\text{bytes }$arrives at a router. The router has to forward this packet on a link whose MTU (maximum transmission unit) is $100$ $\text{bytes }$. Assume that the size of the IP header is $20$ $\text{bytes }.$ The number of fragments that the IP datagram will be divided into for transmission is________.
commented
in
Computer Networks
Dec 24, 2016
16.6k
views
gatecse-2016-set1
computer-networks
ip-packet
normal
numerical-answers
10
answers
8
GATE CSE 2014 Set 3 | Question: 28
An $IP$ router with a $\text{Maximum Transmission Unit (MTU)}$ of $1500$ bytes has received an $IP$ packet of size $4404\text{ bytes}$ with an $IP$ header of length $20\text{ bytes}$. The values of the relevant fields in the header of the third $IP$ ... $1,$ Datagram Length$: 1500;$ Offset$: 370$ $\text{MF bit}$: $0,$ Datagram Length$: 1424;$ Offset$: 2960$
answered
in
Computer Networks
Dec 23, 2016
21.2k
views
gatecse-2014-set3
computer-networks
ip-packet
normal
2
answers
9
UGC NET CSE | Junet 2015 | Part 3 | Question: 20
The regular expression corresponding to the language L where $L=\{ x \in \{0,1\}^* \mid x \text{ ends with 1 and does not contain substring 00} $ is (1+01)* (10+01) (1+01)* 01 (1+01)* (1+01) (10+01)* 01
commented
in
Theory of Computation
Aug 1, 2016
6.5k
views
ugcnetcse-june2015-paper3
theory-of-computation
regular-expression
4
answers
10
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
commented
in
Compiler Design
Apr 25, 2016
5.5k
views
compiler-design
context-free-grammar
parsing
numerical-answers
normal
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:...