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 reena_kandari
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by reena_kandari
1
vote
1
answer
1
Doubt: modulus of asynchronous counter
mod of following asynchronous counter is?? Due to the delay of OR gate I think mod is $10$.
asked
in
Digital Logic
Jan 9, 2018
938
views
digital-logic
3
votes
1
answer
2
Data rate per connection in transport Layer
In a network that has a maximum TPDU size of $128$ bytes, a maximum TPDU lifetime of $30$ sec, and an $8- bit$ sequence number, what is the maximum data rate per connection? My attempt: in $30 sec$ we can identify $256 bytes$ because ... giving sequence number to each segment and thus calculating the data rate as $256*128*8$ bits in $30 sec$ or $8.7Kbps$.
asked
in
Computer Networks
Nov 26, 2017
2.4k
views
transport-layer
sequencenumber
0
votes
0
answers
3
Resynchroniation in TCP connection establishment-Andrew S.Tanenbaum
Suppose that the clock-driven scheme for generating initial sequence numbers is used with a 15-bit wide clock counter. The clock ticks once every $100msec$, and the maximum packet lifetime is $60 sec$. How often need resynchronization take place (a) in the worst case? (b) when the data consumes $240$ sequence numbers/min?
asked
in
Computer Networks
Nov 25, 2017
234
views
computer-networks
tanenbaum
2
votes
0
answers
4
Any problem whose domain is finite is Decidable or not?
Question no:$1$ "Any problem whose domain is finite is always Decidable" lets take a TM,$M$ and finite domain of problem i.e. finite set of strings for eg. {a,abaa,bba}, Now the problem "whether ... me what is really mean by "Domain of a problem" and "single instance of turing machine's halting problem"?
asked
in
Theory of Computation
Nov 12, 2017
747
views
theory-of-computation
2
votes
1
answer
5
advantages of segmented paging over pure paging
As we know segmented paging is an improvement over segmentation and paging but I am having some doubts regarding the memory overhead of these three system.It is clear that segmentation need less memory overhead.But about other two system ... of frag mention is much more than pure paging and also extra segmentation table is required in this system?
asked
in
Operating System
Oct 28, 2017
1.8k
views
operating-system
memory-management
segmentation
23
votes
1
answer
6
B+tree with sparse/Dense indexing
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search key size $22$ bytes and both block pointer and record pointer of size $12$ bytes each.Find out a)minimum index block required b)maximum index block required my answers a)$143$ b)$325$.
asked
in
Databases
Oct 26, 2017
5.8k
views
databases
indexing
bplustrees
4
votes
1
answer
7
Keys of Relationship set
Suppose the key of entity set A is attribute A, the key of B is B , the key of C is C, the key of D is D. If we translate relationship set R into a relation R (A,B, C,D), what are the keys of R? a) {A} b) {B,C} AND {C,D} c) {A,C} d) {ABC,ACD}
asked
in
Databases
Oct 14, 2017
750
views
databases
relationship
0
votes
1
answer
8
Resource preemption
Which of the following transitions are not possible? (Assume resource preemption is not allowed) A) 2 and 4 B) 3 and 5 C)4 and 5 D)3 and 5 if resource preemption is not allowed then answer should be A) but answer given is D) how it is possible?
asked
in
Operating System
Sep 29, 2017
2.2k
views
operating-system
process
0
votes
0
answers
9
GROUP-congruence classes
State true or false 1)Let n be an integer,The set Zn of congruence classes of integers n with respect to operation of addition is a GROUP. 2)The set Zn* of non-zero congruence classes modulo of n, with respect to the operation of multiplication is NOT a GROUP, where n is a prime number.
asked
in
Mathematical Logic
Sep 27, 2017
329
views
discrete-mathematics
group-theory
0
votes
0
answers
10
TRUE/FALSE
1) For Bottom-up implementation of L-attributed definition all the semantic actions must be at the end of productions(Postfix SDT). I think it is true because for BU implementation of L-attributed definition it must be based on LL(1) grammar.and we can convert ... then we will get different outputs during BU and TD parsing and this case is not desired in SDT. please share your views.
asked
in
Compiler Design
Sep 19, 2017
545
views
compiler-design
syntax-directed-translation
5
votes
1
answer
11
Data Structure
Given the following declaration: Node declaration: struct LLNode{ int data; struct LLNode *next; } typedef struct LLNode Node; following are the functions to insert a node at start of Linked List. Assume "head"is pointer to first Node of the Linked List. ... (head_ref); *(head_ref)=NewNode; } Which Of the following is correct Implementation A)ONLY A B)ONLY B C)both D)None
asked
in
Programming in C
Sep 7, 2017
773
views
data-structures
linked-list
0
votes
0
answers
12
floating point representation
Consider a computer system that stores a floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two’s complement. find The smallest and largest positive values which can be stored in the system.
asked
in
Digital Logic
Aug 31, 2017
678
views
floating-point-representation
8
votes
2
answers
13
LCM/HCF
Find the number of combinations of (a, b, c) if LCM (a, b) = 1000, LCM (b, c) = 2000, LCM (c, a) = 2000. I am getting total 96 combinations
asked
in
Verbal Aptitude
Aug 26, 2017
799
views
8
votes
1
answer
14
LL(1) AND LALR(1)
As I know that LL(1) and LALR(1) grammars are incomperable ,but if a grammar is LL(1) then, it may be LALR(1) if the following conditions hold. 1.A ε-free LL(1) grammar is also a SLR(1) grammar and thus LALR(1) too. 2. A LL ... empty derivation may or may not be LALR(1). can anyone explain each point with example. and what is this "non-empty derivation/empty derivation"?
asked
in
Compiler Design
Aug 15, 2017
2.5k
views
ll-parser
parsing
compiler-design
2
votes
1
answer
15
Ullman 4.3
Is this grammar ambiguous? S-->SxA|A A-->AyB|B B-->zB|(S)|m|n I cant prove it ambiguos.As this grammar is not in LR(1) it may or may not be ambiguous.
asked
in
Compiler Design
Aug 14, 2017
489
views
compiler-design
parsing
ambiguous-grammar
lr-parser
descriptive
1
vote
0
answers
16
Ullman 4.1
What language does this grammar generate? S-->(L)|a L-->L,S|S
asked
in
Compiler Design
Aug 14, 2017
167
views
compiler-design
9
votes
2
answers
17
classification of lexical and syntactic errors in complier phases
I am writing down some errors and its type with a reason.If there something wrong please correct it with a valid reason. 1.fi(a==10) this is not a lexical error, because lexical analyzer cannot tell whether fi is a misspelling ... token. but this says it is streams of valid tokens 6.int d=10.10.10 lexical error as invalid num token.
asked
in
Compiler Design
Aug 14, 2017
2.3k
views
lexical-analysis
compiler-tokenization
2
votes
0
answers
18
Kenneth Rosen Edition 6th Exercise 8.4 Question 17 (Page No. 575)
Find the number of paths of length n between two different vertices in K4 if n is a) 2. b) 3. c) 4. d) 5.
asked
in
Graph Theory
Aug 8, 2017
1.2k
views
kenneth-rosen
discrete-mathematics
graph-theory
1
vote
0
answers
19
Probability
Suppose that in the production of 60-ohm radio resistors, nondefective items are those that have a resistance between 58 and 62 ohms and the probability of a resistor's being defective is 0.1%.The resistors are sold in lots of 200, with the ... are nondefective. What is the probability that a given lot will violate this guarantee? (Use the Poisson distribution.) Using bernoulli:18%
asked
in
Engineering Mathematics
Aug 7, 2017
650
views
probability
1
vote
0
answers
20
FirstThird of a regular set
asked
in
Theory of Computation
Jul 31, 2017
201
views
regular-language
Page:
1
2
3
4
5
6
7
next »
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:...