Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by atulcse
0
votes
1
answer
1
pumping length - TOC
What is meant by ‘pumping length’ and how can we find it?
What is meant by ‘pumping length’ and how can we find it?
596
views
asked
Jan 28, 2022
Theory of Computation
theory-of-computation
pumping-lemma
+
–
1
votes
1
answer
2
regular languages - TOC
Which of the following languages is/are regular?
Which of the following languages is/are regular?
489
views
asked
Jan 28, 2022
Theory of Computation
regular-language
theory-of-computation
made-easy-test-series
+
–
0
votes
2
answers
3
sets - mathematics - made easy test series
A newspaper agent sells the TOI, the HT and the IN in equal numbers to 302 persons. 7 persons get the HT and the IN, 12 get the TOI and the IN, 9 get the TOI and the HT and 3 get all three newspapers. Then the number of persons who get only one paper is ____
A newspaper agent sells the TOI, the HT and the IN in equal numbers to 302 persons. 7 persons get the HT and the IN, 12 get the TOI and the IN, 9 get the TOI and the HT a...
2.1k
views
asked
Jan 26, 2022
Set Theory & Algebra
set-theory
made-easy-test-series
+
–
2
votes
2
answers
4
normalization - DBMS
If AD is the only candidate key for some relation R(A,B,C,D,E) then will CD → E be considered a partial dependency?
If AD is the only candidate key for some relation R(A,B,C,D,E) then will CD → E be considered a partial dependency?
639
views
asked
Jan 22, 2022
Databases
databases
database-normalization
+
–
0
votes
1
answer
5
computer networks - queuing delay
Consider the queuing delay in a router buffer (preceding an outbound link). Suppose packet length is L bits and the link rate is R bps, and that N packets arrive to the buffer every LN/R seconds. Find the average queuing delay of the packets.
Consider the queuing delay in a router buffer (preceding an outbound link). Suppose packet length is L bits and the link rate is R bps, and that N packets arrive to...
5.6k
views
asked
Jan 22, 2022
Computer Networks
computer-networks
+
–
1
votes
2
answers
6
DCFL - TOC
Is the following language a DCFL? Please explain your reasoning.
Is the following language a DCFL? Please explain your reasoning.
737
views
asked
Jan 21, 2022
Theory of Computation
theory-of-computation
dcfl
context-free-language
pushdown-automata
+
–
0
votes
1
answer
7
parse tree - context-free grammars - TOC
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?
888
views
asked
Jan 21, 2022
Theory of Computation
context-free-language
theory-of-computation
compiler-design
finite-automata
+
–
4
votes
0
answers
8
made east test series - synchronization - OS
Consider the following proposed solution to Dining Philosopher's problem to avoid deadlock. The binary semaphore lock is initialized to 1. Which of the following is correct? Removing (i) and (ii) will not affect the code. It will work fine. Removing (iii) ... fine. All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.
Consider the following proposed solution to Dining Philosopher’s problem to avoid deadlock. The binary semaphore lock is initialized to 1.Which of the following is corr...
1.0k
views
asked
Jan 19, 2022
Operating System
operating-system
process-synchronization
made-easy-test-series
concurrency
critical-section
+
–
0
votes
1
answer
9
max heap - algorithms - made easy test series
Consider the following graph: Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the above tree and element 10 occupies only the left child node of its parent.
Consider the following graph:Find the total number of max-heap possible orderings with elements 12, 10, 1, 5, 7, 9, 8 such that each element is filled in one node of the ...
726
views
asked
Jan 16, 2022
DS
data-structures
binary-heap
made-easy-test-series
numerical-answers
+
–
0
votes
2
answers
10
SQL - databases
Consider the following relations: How many number of records will be returned by the following query?
Consider the following relations:How many number of records will be returned by the following query?
835
views
asked
Jan 16, 2022
Databases
databases
sql
made-easy-test-series
+
–
0
votes
2
answers
11
made easy test series - parsing - context-free grammar
Consider the following context-free grammar: Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
Consider the following context-free grammar:Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
925
views
asked
Jan 16, 2022
Compiler Design
context-free-language
context-free-grammar
parsing
made-easy-test-series
+
–
2
votes
2
answers
12
program output - C
Consider the following program int find (int n) { int a = 1; for (i = 1; i < = n; i ++) for (j = 1; j < = i; j++) for (k = 1; k <= j, k++) a = a + 1; return a; } The value returned by find (9) is ______ .
Consider the following programint find (int n) { int a = 1; for (i = 1; i < = n; i ++) for (j = 1; j < = i; j++) for (k = 1; k <= j, k++) a = a + 1; ...
699
views
asked
Jan 15, 2022
Programming in C
programming-in-c
output
programming
+
–
1
votes
1
answer
13
GeeksForGeeks AIM 2 - computer networks
Consider a message with 60000 bits long, that is to be sent from a source to a destination, there are two routers between source to destination. Each of link in the path has bandwidth 1 Mbps, each packet is 1000 bit long, total time taken (in msec) to reach the last bit to the destination, propagation delay is 10 msec ________.
Consider a message with 60000 bits long, that is to be sent from a source to a destination, there are two routers between source to destination. Each of link in the path ...
877
views
asked
Jan 15, 2022
Computer Networks
computer-networks
+
–
0
votes
1
answer
14
GeeksForGeeks AIM 2 - BCNF - databases
How many minimum relations are required for the following Relation R(A, B, C, D, E) with FD {A → BC, CD → E, B → D, E → A} to convert into BCNF without violation of lossless and dependency preserving decomposition _________.
How many minimum relations are required for the following Relation R(A, B, C, D, E) with FD {A → BC, CD → E, B → D, E → A} to convert into BCNF without violation ...
708
views
asked
Jan 15, 2022
Databases
databases
bcnf-decomposition
+
–
1
votes
0
answers
15
GeeksForGeeks AIM 2 - instruction format
Assume that the control memory is 32 bit wide. The micro-instruction format is divided into 3 fields. A micro operation field of 14 bits specifies the micro-operations to be performed. An address selection field specifies a condition based ... . How many bits are in address selection field, address field and the size of control memory in words respectively?
Assume that the control memory is 32 bit wide. The micro-instruction format is divided into 3 fields. A micro operation field of 14 bits specifies the micro-operations to...
618
views
asked
Jan 15, 2022
CO and Architecture
co-and-architecture
instruction-format
+
–
0
votes
1
answer
16
linear algebra - eigenvalues
What are the eigenvalues of the following matrix?
What are the eigenvalues of the following matrix?
416
views
asked
Jan 13, 2022
Linear Algebra
linear-algebra
eigen-value
matrix
engineering-mathematics
+
–
1
votes
0
answers
17
made easy test series - cache addressing
Consider a 4-way set associative cache of 64 KB used in a 32-bit CPU, organized into 32-word blocks. System supports 64 GB RAM. Cache is designed with a write back protocol to handle the updation issues. In each line a valid bit is present to specify the status of a block. What is the size (in bits) of a tag directly in the cache controller?
Consider a 4-way set associative cache of 64 KB used in a 32-bit CPU, organized into 32-word blocks. System supports 64 GB RAM. Cache is designed with a write back protoc...
1.1k
views
asked
Jan 13, 2022
CO and Architecture
made-easy-test-series
co-and-architecture
+
–
1
votes
2
answers
18
made easy test series - instruction format
Consider a hypothetical CPU which supports 16-bit instruction, 64 registers and 1 KB memory space. If there exist 12 2-address instructions which use register references and 12 1-address memory reference instructions then how many 0-address instructions are possible?
Consider a hypothetical CPU which supports 16-bit instruction, 64 registers and 1 KB memory space. If there exist 12 2-address instructions which use register references ...
655
views
asked
Jan 13, 2022
CO and Architecture
co-and-architecture
instruction-format
made-easy-test-series
+
–
0
votes
1
answer
19
made easy test series - minimum spanning tree
How many minimum spanning trees are possible in this graph?
How many minimum spanning trees are possible in this graph?
512
views
asked
Jan 13, 2022
Algorithms
minimum-spanning-tree
algorithms
numerical-answers
+
–
0
votes
0
answers
20
made easy test series - linear algebra
If 2 and -4 are the eigenvalues of a non-singular matrix A and |A| = -8, then the eigenvalues of adj(A) are x and -y. What is the value of x+y?
If 2 and -4 are the eigenvalues of a non-singular matrix A and |A| = -8, then the eigenvalues of adj(A) are x and -y. What is the value of x+y?
431
views
asked
Jan 13, 2022
Linear Algebra
linear-algebra
engineering-mathematics
made-easy-test-series
eigen-value
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register