Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Questions by Debapaul
User Debapaul
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Debapaul
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
0
answers
Self Doubt: AUTOMATA DCFL
$wxw^rw,x\epsilon(0,1)^*$ $,x=5$ Is this $DCFL$ or $not?$
asked
Feb 6
in
Theory of Computation

40
views
automata
0
votes
0
answers
SELF DOUBT: CONSERVATIVE 2PL
Can $conservative$ $2PL$ be $NONRECOVERABLE?$ according to me they can be, but in some places i find them to be mentioned as recoverable.. which is true?
asked
Feb 5
in
Databases

44
views
database
0
votes
0
answers
MADE EASY: PREVIOUS QUESTION REVISION
The number of ways, we can arrange 5 books in 3 shelves ?
asked
Feb 4
in
Mathematical Logic

40
views
+1
vote
1
answer
GATE 2020: MECHANICAL: APTI
asked
Feb 3
in
Mathematical Logic

62
views
0
votes
0
answers
GATE 2020 ME: EIGEN VALUES
asked
Feb 3
in
Mathematical Logic

26
views
0
votes
0
answers
GATE 2020 ME: PROBABILITY
asked
Feb 3
in
Mathematical Logic

36
views
#probability
0
votes
0
answers
ECE 2020: ENTROPY
asked
Feb 3
in
Mathematical Logic

47
views
#probability
+1
vote
1
answer
ECE 2020 PROBABILITY
asked
Feb 3
in
Mathematical Logic

141
views
#probability
0
votes
0
answers
MADE EASY : DMA CYCLE STEALING
An $8Bit$ DMA Device is operating is Cycle Stealing Mode (Single Transfer Mode). Each DMA cycle is of $6$ clock states and DMA clock is $2$ $MHZ$. Intermediate CPU machine cycle takes $2 μs$, the DMA Data Transfer Rate is ?
asked
Feb 2
in
CO & Architecture

41
views
madeeasytestseries
0
votes
0
answers
SELF DOUBT:LINK LiST
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is. a) $O(n)$ and $O(nlogn)$ b) $O(n)$ and $O(n)$ c) $O(nlogn)$ and $O(nlogn)$ d) $O(nlogn)$ and $O(n)$
asked
Feb 2
in
Programming

43
views
0
votes
0
answers
SELF DOUBT: REGULAR LANGUAGE AND CFL
Let $A$ be a $regular$ $language$ and $B$ be a $CFL$ over the alphabet $\sum$. Which of the following statement about the given language $R$, where $R=\bar{A}B$ is $True?$ $R$ is $necessarily$ $CFL$ but $not$ $necessarily$ $regular$ R is $necessarily$ $regular$ but $infinite$ R is $necessarily$ $non$ $regular$ $None$
asked
Feb 1
in
Theory of Computation

33
views
theoryofcomputation
0
votes
0
answers
GATE GURU: Pointers
asked
Feb 1
in
Programming

40
views
cprogrammingforgate
0
votes
0
answers
GATE GURU: C PROGRAMMING
#include<stdio.h> int rec(int n) { static int num=5; if (n<=0) return 10; if (n>3) { num=50; return (num + rec(n1)); } return (num  rec(n1)); } int main() { printf("%d",rec(8)); } $What$ $is$ $the$ $output$ $of$ $the$ $following$ $code?$ $and$ $WHY?$
asked
Feb 1
in
Linear Algebra

33
views
cprogrammingforgate
0
votes
0
answers
GATE FORUM: AMBIGUITY
asked
Jan 31
in
Theory of Computation

63
views
automata
compilerdesign
0
votes
0
answers
GATE FORUM: HUFFMAN CODING
asked
Jan 31
in
Programming

30
views
algorithms
huffmancode
0
votes
1
answer
GATE FORUM: STARVATION AND DEADLOCK
asked
Jan 31
in
Operating System

51
views
operatingsystem
0
votes
0
answers
MADE EASY: COMBINATORICS
The number of ways can $5$ letter be put in $3$ boxes $A$,$B$,$C$, such that $A$ contains atleast $2$ letters is __________ ?
asked
Jan 30
in
Combinatory

60
views
madeeasytestseries
+1
vote
0
answers
MADE EASY: FRAGMENTATION
In the given network, station $A$ wish to sends a payload of $1600B$ from its $network$ $layer$ to station $B$. If fragmentation is done then, the actual data size to be transmitted is? My approach, the first network has an MTU of $1500B$ therefore ... arrive at $B$ and each has a header of $20B$, so total data size is $1700B$ Is my understanding and explanation correct?
asked
Jan 30
in
Computer Networks

38
views
madeeasytestseries
0
votes
0
answers
GATE GURU: STRUCTURES
asked
Jan 30
in
Programming

26
views
algorithms
0
votes
0
answers
Self Doubt: LL(1) parsers
If in the LL(1) parsing table, in the follow of a symbol we have 2 same terminals then is it LL(1)? According to me it should not be, as there is ambiguity whenever there are 2 productions possible for a symbol.
asked
Jan 29
in
Compiler Design

35
views
compilerdesign
+1
vote
0
answers
SELF DOUBT:SEGMENTED PAGING
Consider a system using segmentedpaging architecture with a V.A of 23 bits. The segment table has 32 entries and page table of segment is indexed with 9 bits. The size of largest segment is______KB.
asked
Jan 29
in
Operating System

23
views
operatingsystem
0
votes
0
answers
Self Doubt: Recurrence
asked
Jan 29
in
Programming

51
views
algorithms
0
votes
0
answers
SELF DOUBT: INTEGRATION
How to solve?
asked
Jan 29
in
Mathematical Logic

83
views
0
votes
0
answers
Found on Internet: ACE PREVIOUS YEAR
In the expansion of $(v+w+x+y+z)^{16}$, the coefficient of $wxy^{13}z$ is $?$ How to solve these types of problems?
asked
Jan 28
in
Mathematical Logic

38
views
engineeringmathematics
0
votes
0
answers
Self Doubt: Three address code
What will be the ans $4$ or $2?$ Should we assign new variable each and every time in the $LHS$ in $3address$ $code$ or is it only the case of $SSA?$
asked
Jan 28
in
Compiler Design

36
views
compilerdesign
0
votes
0
answers
GATE FORUM: COMPILERS
Consider the following translation rules $S→ A \{A.val=0\}$ $A→ A_1 1\{A.val=A_1.val+1\}$ $A→ A_1 0\{A.val=A_1.val\}$ $A→ B\{print(A.val)\}$ The number of $inherited$ $attributes$ are ______
asked
Jan 28
in
Compiler Design

18
views
compilerdesign
0
votes
0
answers
Self Evaluation: Ask me some question on minimum number of 2 input NOR and NAND required to realize a circuit
asked
Jan 28
in
Digital Logic

63
views
0
votes
0
answers
Previous Go: Digraph
asked
Jan 28
in
Mathematical Logic

14
views
discrete_maths
0
votes
0
answers
PREVIOUS GO: TIME OUT
The TCP congestion window is set to 2020 KB and a timeout occurs. Assume that the maximum segment size is 11 KB. Then, if the next four transmission bursts are all successful, the window size is _______ KB
asked
Jan 27
in
Computer Networks

146
views
0
votes
0
answers
Self Doubt: Previous GO: DM
Let the set of all natural numbers be N. Which of the following are countable sets? The set of all functions from N to {0,1} The set of all functions from {0,1} to N The largest subset of N I, II, and III I and II only ... previous year, but I am facing difficulty in understanding them and thereby answering such questions. Any suggestions will be of much help. Thank u..
asked
Jan 25
in
Compiler Design

44
views
discrete_maths
0
votes
0
answers
SELF DOUBT: PREVIOUS GO NUMBER OF STATES IN DFA
The number of possible Deterministic Finite Automation with two states $q0$ and $q1$, where $q0$ is always the initial state over the alphabet $\{a,b\}$ which accept empty language is : ____________. I have solved it like this, for $q0$ on $i/p$ $a$ ... or nonfinal so we have $2$ choices for it, hence total $2^2 * 2^2 * 2=32$ Is my approach right?
asked
Jan 25
in
Theory of Computation

20
views
theoryofcomputation
0
votes
0
answers
Self doubt:MADE EASY: COUNTERS
Is there any other states in the output other than $000$ and $111?$ All the flips flops are given only $toggle$ input right? So shouldnt it be $mod2$ counter?
asked
Jan 24
in
Digital Logic

22
views
digitallogic
0
votes
0
answers
Self Doubt: MADE EASY TLB
The virtual address generated by a CPU is $36 bits$, the Translation Lookaside Buffer (TLB) can hold $512$ $entries$ and a $8way$ set associative, page size is $4 KB$ the size of the TLB tag is ________. Though I have solved the above ... ans $18$. But I have confusion regarding the above questions that I have asked. It will be very helpful if the reader can help.
asked
Jan 24
in
CO & Architecture

52
views
madeeasytestseries
0
votes
0
answers
MADE EASY SELF DOUBT: INTEGRATION
$\int_{1}^{b} \dfrac{1}{x}=1$ Now while solving we appear at a stage where we have $logx=1$, now in this position what should be the value of $base$ $of$ $log$ that we should take? should we take $e$ or $10?$
asked
Jan 24
in
Mathematical Logic

18
views
0
votes
0
answers
SELF DOUBT: WELL ORDERED POSET
Can someone explain me in naive term what is a $well$ $ordered$ $poset$ and how it differs from $toset$?
asked
Jan 24
in
Mathematical Logic

16
views
discrete_maths
0
votes
0
answers
Self Doubt: Previous GO Discrete Maths
Consider a binary function $g:P P→\{true,false\},$ where $P$ is a nonempty subset of the natural numbers that contains an even number of distinct elements. Which of the following statements can be true about $g$ ? $g$ is ... two equivalence classes $g$ defines a total order but not a partial order $g$ is reflexive and antisymmetric but not a surjection
asked
Jan 23
in
Set Theory & Algebra

31
views
discrete_maths
0
votes
0
answers
SELF DOUBT: PREVIOUS GO COMPILERS
How to solve these types of questions quickly? is there any algorithm?
asked
Jan 23
in
Theory of Computation

28
views
#toc
0
votes
0
answers
SELF DOUBT: VARIANCE
When $n$ and $p$ is available can we apply $Binomial$ $theorem$ in ALL THE CASES to find the $variance$ by using the formula $npq?$
asked
Jan 23
in
Probability

23
views
probability
0
votes
0
answers
GATE GURU: PARSER
asked
Jan 22
in
Compiler Design

46
views
0
votes
0
answers
GATE GURU: TURING MACHINES
asked
Jan 22
in
Theory of Computation

38
views
turingmachine
Page:
1
2
3
4
...
7
next »
7,393
questions
1,744
answers
10,711
comments
90,368
users