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 dan31
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by dan31
0
answers
1
JEST 2019 Descriptive Q4 (8 Marks)
Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)] (Memory based – Original question had a lot of added details)
asked
in
Algorithms
Feb 17, 2019
390
views
jest
2019
algorithms
0
answers
2
JEST 2019 Descriptive Q1 (8 Marks)
Suppose that G contains a cycle C, and a path of length at least k between some two vertices of C. Show that G contains a cycle of length at least √k.
edited
in
Graph Theory
Feb 17, 2019
404
views
jest
2019
discrete-mathematics
0
answers
3
JEST 2019 Descriptive Q3 (8 Marks)
Determine the number of functions f:{1,2,3…,n}→{1995,1996} satisfying the condition that f(1)+f(2)+…f(n) is odd.
asked
in
Set Theory & Algebra
Feb 17, 2019
583
views
jest2019
discrete-mathematics
0
answers
4
JEST 2019 Descriptive Q2 (8 Marks)
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.
asked
in
Graph Theory
Feb 17, 2019
471
views
jest
2019
discrete-mathematics
4
answers
5
GATE CSE 1998 | Question: 2.5
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
commented
in
Theory of Computation
Jan 29, 2019
17.3k
views
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
5
answers
6
GATE CSE 2005 | Question: 57
Consider the languages: $L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$ $L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ ... of the following is TRUE? $L_1$ is a deterministic CFL $L_2$ is a deterministic CFL $L_3$ is a CFL, but not a deterministic CFL $L_3$ is a deterministic CFL
commented
in
Theory of Computation
Jan 28, 2019
8.4k
views
gatecse-2005
theory-of-computation
context-free-language
easy
1
answer
7
Test by Bikram | Databases | Test 2 | Question: 10
We are using timestamp-based concurrency control, and there are two transactions T1 and T2 with timestamps 100 and 200, respectively. The following schedule is executed in the order shown below using time stamping protocols: ... Basic Timestamp Ordering Protocol and Thomas Write Rule, but is allowed under Multi-version Timestamp Ordering Protocol.
commented
in
Databases
Jan 25, 2019
854
views
tbb-dbms-2
databases
transaction-and-concurrency
1
answer
8
Operating system test zeal
Consider a paged virtual memory system with 32-bit virtual addresses and 1K-byte pages. Each page table entry requires 32 bits. It is desired to limit the page table size to one page. One page table size is smaller. The smaller page size could be used at the top level or the ... .......... respectively. 1. 8321, 32987 2. 16,641, 65,973 3. 64, 256 4. 4161, 16494
answered
in
Operating System
Jan 9, 2019
348
views
process-synchronization
1
answer
9
what is the regular expression equivalent to the DFA ?
I tried it through state elimination method but I am getting stucked at the outgoing edge from D to A .
commented
in
Theory of Computation
Jan 6, 2019
1.2k
views
10
answers
10
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
commented
in
Algorithms
Jan 4, 2019
22.7k
views
gatecse-2000
algorithms
asymptotic-notation
normal
4
answers
11
Tanenbaum NAK and Retransmission
Compute the fraction of the bandwidth that is wasted on overheads(headers and retransmission ) for protocol 6 on a heavily loaded 50 kbps satellite channel with data frames consisting of 40 headers and 3960 data bits.Assume that the signal propagation time ... for data frames is 1%, and the error rate for NAK frames is negligible.The sequence numbers are 8 bits.
commented
in
Computer Networks
Dec 31, 2018
3.3k
views
tanenbaum
computer-networks
3
answers
12
Testbook Test Series: Computer Networks - Sliding Window
commented
in
Computer Networks
Dec 31, 2018
542
views
computer-networks
testbook-test-series
sliding-window
1
answer
13
flow control
Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 4 packets each. Data packets (sent only from A to B) are all 1500 bytes long and the transmission time ... What is the maximum achievable throughput in this communication? 3.75 10^6 Bps 7.5 10^6 Bps 10 10^6 Bps 12.75 10^6Bps
commented
in
Computer Networks
Dec 30, 2018
1.3k
views
computer-networks
flow-control-methods
1
answer
14
UGC NET CSE | December 2013 | Part 3 | Question: 45
Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence numbers to ensure correct re-composition from end to end of the network? Physical Data-link Transport Application
commented
in
Computer Networks
Dec 27, 2018
3.7k
views
ugcnetcse-dec2013-paper3
computer-networks
network-layering
0
answers
15
ACE PreGate vs Made Easy CBT
I only want to appear for one Centre-based mock. I am in a dilemma between Ace PreGate vs Made Easy CBT2. Could anyone please help me decide?
asked
in
GATE
Dec 18, 2018
1.6k
views
general
2
answers
16
GATE CSE 1999 | Question: 1.14, ISRO2015-42
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: $20, \ 47, \ 15, \ 8, \ 9, \ 4, \ 40, \ 30, \ 12, \ 17$ ... $4, \ 8, \ 9, \ 15, \ 20, \ 47, \ 12, \ 17, \ 30, \ 40$
commented
in
Algorithms
Dec 14, 2018
22.6k
views
gate1999
algorithms
merge-sort
normal
isro2015
9
answers
17
GATE CSE 2008 | Question: 58
A computer on a $10\text{Mbps}$ network is regulated by a token bucket. The token bucket is filled at a rate of $2\text{Mbps}$. It is initially filled to capacity with $16\text{Megabits}$. What is the maximum duration for which the computer can transmit at the full $10\text{Mbps}$? $1.6$ seconds $2$ seconds $5$ seconds $8$ seconds
commented
in
Computer Networks
Dec 5, 2018
24.7k
views
gatecse-2008
computer-networks
token-bucket
8
answers
18
GATE CSE 2010 | Question: 48
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ words. The memory access times are $2$ ... $L1$ cache. What is the time taken for this transfer? $2$ nanoseconds $20$ nanoseconds $22$ nanoseconds $88$ nanoseconds
commented
in
CO and Architecture
Dec 4, 2018
40.7k
views
gatecse-2010
co-and-architecture
cache-memory
normal
barc2017
2
answers
19
64 word cache and Main memory is divided into 16 words block.
64 word cache and main memory is divided into 16 words block.The access time of cache is 10ns/word and for main memory is 50ns/word. The hit ratio for read operation is .8 and write operation is.9. Whenever there is ... to cache for read and write operation. 40% reference is for write operation. Avg access time if write through is used.
commented
in
CO and Architecture
Dec 4, 2018
6.7k
views
co-and-architecture
cache-memory
write-through
effective-memory-access
numerical-answers
9
answers
20
exponential backoff
Nodes A and B are connected with 100 Mbps ethernet segment with 6 microsec pop.delay between them.Suppose A,B send frames at t=0 and frames get collided.after first collision A draws k=0 and bdraws k=1.if jam signal is ignored and timeout ... what time A's packet gets completely delivered to B...assume packet size 1000 bits. 28 microsec 16 microsec 22 microsec 38 microsec
commented
in
Computer Networks
Dec 1, 2018
3.0k
views
1
answer
21
geeksforgeeks
Suppose that the one-way propagation delay for a 100 Mbps Ethernet having 48-bit jamming signal is 1.04 micro-seconds. The minimum frame size in bits is: 112 160 208 256
commented
in
Computer Networks
Dec 1, 2018
1.2k
views
csma-cd
5
answers
22
GATE IT 2004 | Question: 81
In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ensure correct operation of the $ARQ$ scheme is $\min (M, N)$ $\max (M, N)$ $M + N$ $MN$
commented
in
Computer Networks
Nov 19, 2018
10.4k
views
gateit-2004
computer-networks
sliding-window
normal
1
answer
23
Set Theory
If A = {1,2,3...n}, then number of equivalence relations possible on A , which are also surjection on A is ________________? How to approach this type of problems?
asked
in
Set Theory & Algebra
Nov 8, 2018
509
views
discrete-mathematics
set-theory&algebra
set-theory
1
answer
24
Bijective function
Let R be set of all real numbers, and A = B = R*R A function A-> B is defined by f(a,b) = (a+b,a-b) How to prove it is a bijective function?
asked
in
Set Theory & Algebra
Nov 8, 2018
597
views
discrete-mathematics
functions
1
answer
25
Set Theory
A relation R on a set of positive integers is defined by (a,b) belongs to R iff a and b are relatively prime. Which of the following is true about R? a. Symmetric and Reflexive b. Symmetric and irreflexive c.Symmetric and transitive d. Symmetric and not transitive The Ans is given as (d) but I think (b) is true. Any thoughts?
commented
in
Set Theory & Algebra
Nov 8, 2018
936
views
discrete-mathematics
set-theory&algebra
set-theory
engineering-mathematics
2
answers
26
Graph Connectivity
Consider the given statements S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G. S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected. Which of the following is/are true?
commented
in
Graph Theory
Nov 6, 2018
2.3k
views
graph-theory
euler-graph
graph-connectivity
0
answers
27
Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
commented
in
Graph Theory
Nov 6, 2018
1.2k
views
graph-theory
graph-coloring
0
answers
28
Graph connectivity
Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?
commented
in
Graph Theory
Nov 6, 2018
1.4k
views
graph-theory
graph-connectivity
0
answers
29
Regular Graph
If a 2-regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 S3: G is connected S4: Every component of G is an even cycle Options- A) S1,S2 B)S2,S4 C)S3,S4 D)S1,S4
asked
in
Graph Theory
Nov 6, 2018
864
views
graph-theory
discrete-mathematics
4
answers
30
GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
commented
in
Theory of Computation
Oct 27, 2018
18.5k
views
gatecse-2001
theory-of-computation
finite-automata
minimal-state-automata
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:...