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 samarpita
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by samarpita
2
votes
1
Made Easy: Linear Algebra (MSQ)
Let $A$ be a $3$ x $3$ matrix with rank $2$. Then, $AX=0$ has The trivial solution $X=0$. One independent solution. Two independent solution. Three independent solution.
answered
in
Linear Algebra
Sep 19, 2022
1.0k
views
linear-algebra
engineering-mathematics
rank-of-matrix
matrix
system-of-equations
1
vote
2
Token generation or refresh rate: Token Bucket
Consider a token bucket with maximum rate = 20 Mbps. Suppose we want to make sure that maximum rate can only be sent for atmost 5 sec at a time and atmost 150 Mb can be sent over 10 sec window. Computer the required value for token refresh rate?
answered
in
Computer Networks
Sep 9, 2022
1.4k
views
computer-networks
token-bucket
2
votes
3
Is a Serial Schedule always Recoverable?
Is only conflict serializable schedules are recoverable? Or both view as well as conflict serializable schedules are recoverable? I have been seeing different answers in different forum.
answered
in
Databases
Aug 29, 2022
1.9k
views
databases
concurrency
transaction-and-concurrency
serializability
2
votes
4
Transaction and concurrency control
Does Conservative 2PL ensures Recoverability ? If Yes then Does it ensures Cascadeless or Strict recoverable schedule ?
answered
in
Databases
Aug 29, 2022
480
views
transaction-and-concurrency
2
votes
5
State True or False: Classes of Grammar and respective automata
Consider the following statements:- I) Type-0 grammar generate exactly all language that can be accepted by a total Turing machine. II) Type-1 grammar generate exactly all languages that can be recognized by a linear bounded automata. ... a both are type 3 grammar but both represent same regular expression as a+ what is wrong in this??
answered
in
Theory of Computation
May 22, 2022
2.0k
views
theory-of-computation
regular-expression
regular
finite-automata
0
votes
6
GO Classes Weekly Quiz 2 | Programming in C | Propositional Logic | Question: 1
What is the last digit in the decimal representation of $7^{19522}$?
answered
in
Quantitative Aptitude
May 18, 2022
958
views
goclasses_wq2
numerical-answers
goclasses
quantitative-aptitude
number-system
modular-arithmetic
remainder-theorem
1-mark
0
votes
7
No of spanning Trees
Let $K_n$ denote the complete undirected graph with $n$ vertices where n is an even number. Find the maximum number of spanning trees of $K_n$ that can be formed in such a way that no two of these spanning trees have a common edge.
answered
in
Graph Theory
May 13, 2022
5.5k
views
spanning-tree
graph-theory
0
votes
8
GATE IT 2005 | Question: 52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
answered
in
Algorithms
May 12, 2022
20.6k
views
gateit-2005
algorithms
spanning-tree
normal
1
vote
9
GATE CSE 1999 | Question: 1.13
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is $n-1$ $n$ $n+1$ None of the above
answered
in
Algorithms
May 1, 2022
19.8k
views
gate1999
algorithms
time-complexity
normal
4
votes
10
GATE CSE 2020 | Question: 31
Let $G = (V, E)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) \in V \times V$ is added to $G$. The worst case time complexity of determining if $T$ is still an MST ... $\Theta (\mid E \mid \mid V \mid) \\$ $\Theta(E \mid \log \mid V \mid) \\$ $\Theta( \mid V \mid)$
answered
in
Algorithms
Mar 25, 2022
19.0k
views
gatecse-2020
algorithms
minimum-spanning-tree
graph-algorithm
2-marks
0
votes
11
Are all Irrecoverable/Non-Recoverable schedules cascading?
Suppose, T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: Abort Here we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it cascading?
answered
in
Databases
Jan 31, 2022
718
views
databases
transaction-and-concurrency
data
0
votes
12
SQL - databases
Consider the following relations: How many number of records will be returned by the following query?
answered
in
Databases
Jan 31, 2022
816
views
databases
sql
made-easy-test-series
0
votes
13
GATE CSE 1991 | Question: 10b
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol ... with redundant parentheses. Do this with minimum number of changes to the given production rules and adding at most one more production rule.
answered
in
Compiler Design
Jan 22, 2022
4.1k
views
gate1991
grammar
compiler-design
normal
descriptive
0
votes
14
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 11
Synthesized attribute can easily be simulated by an LL grammar ambiguous grammar LR grammar none of the above
answered
in
Compiler Design
Jan 4, 2022
1.3k
views
nielit2017oct-assistanta-cs
compiler-design
syntax-directed-translation
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:...