Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
atul_21
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by atul_21
0
votes
1
Multiplication of two long intergers
939
views
answered
Jan 2, 2018
Algorithms
divide-and-conquer
recurrence-relation
ace-test-series
+
–
0
votes
2
Probability
Two cards are drawn together from a pack of 52 cards. The probability that one is spade and other is king, is a) 1/26 b)2/51 c)8/221 d)None of these
Two cards are drawn together from a pack of 52 cards. The probability that one is spade and other is king, isa) 1/26b)2/51c)8/221d)None of these
330
views
answered
Dec 29, 2017
1
votes
3
Theory_of_computation
Q-1) What are the things that are not decidable about DCFL or DCFG? 2)How complexity theory is related to formal langauages ,I know that pure complexity lies in decidable region but question like this confuses me : 3) Apart from this this question : ... how we calculate the quotient and moreover question asks to draw the dfa for the same language,how to work with quotient .?
Q-1) What are the things that are not decidable about DCFL or DCFG? 2)How complexity theory is related to formal langauages ,I know that pure complexity lies in decidable...
691
views
answered
Dec 27, 2017
Theory of Computation
theory-of-computation
decidability
+
–
0
votes
4
Set theory
I thought it is multi set, each of the 4 places have 6 choices. so 64 . .?? please clear this out. What is multiset means??
I thought it is multi set, each of the 4 places have 6 choices. so 64 . .?? please clear this out. What is multiset means??
401
views
answered
Dec 23, 2017
0
votes
5
Probability
556
views
answered
Dec 21, 2017
0
votes
6
flags in BCD correction
824
views
answered
Dec 15, 2017
1
votes
7
Threads
The primary difference between process and thread ? (A) The number of I/O requests mode. (B) The amount of overhead associated with creation and context switching . (C) The amount of memory allocation (D) The average number of instructions executed
The primary difference between process and thread ?(A) The number of I/O requests mode.(B) The amount of overhead associated with creation and context switching .(C) The ...
1.8k
views
answered
Dec 14, 2017
Operating System
threads
operating-system
process
+
–
0
votes
8
Made easy test series
A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory access time is 10 time units. The probability of a page fault is 0.3. In case of ... is P. It is observed that average access time is 50 time units. Then, the value of P is ______? [upto four decimal places]
A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory acc...
1.7k
views
answered
Dec 6, 2017
Operating System
operating-system
demand-paging
memory-management
+
–
0
votes
9
made easy test series
A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory access time is 10 time units. The probability of a page fault is 0.3. In case of ... is P. It is observed that average access time is 50 time units. Then, the value of P is ______? [upto four decimal places]
A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory acc...
530
views
answered
Dec 5, 2017
2
votes
10
Turing Machine
L1={<M>| M is a Turing Machine , P is a TM that halts on all input, and P$\epsilon$L(M)} L2={<M>| M is a Turing Machine , P is a TM that halts on all input, and M$\epsilon$L(P)} Which one REC, or RE or non RE ?
L1={<M>| M is a Turing Machine , P is a TM that halts on all input, and P$\epsilon$L(M)}L2={<M>| M is a Turing Machine , P is a TM that halts on all input, and M$\epsilon...
1.0k
views
answered
Dec 1, 2017
Theory of Computation
turing-machine
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
1
votes
11
MadeEasy Subject Test: Theory of Computation - Context Free Language
is there any short-cut to this type questions
is there any short-cut to this type questions
344
views
answered
Oct 10, 2017
Theory of Computation
made-easy-test-series
theory-of-computation
context-free-language
+
–
0
votes
12
MadeEasy Test Series: Digital Logic - Ieee Representation
Q: The decimal number -0.329 x 2^15 is to be represented using a 16 bit floating point format without normalization as shown above. mantissa is pure fraction in sign magnitude form. Answer using rounding off is.. My Try: As it is 16 bit IEEE , ... them by three.. So, 4th digit should br 1 and not 5. (They have taken Expo - 64 = 15) why???
Q: The decimal number -0.329 x 2^15 is to be represented using a 16 bit floating point format without normalization as shown above. mantissa is pure fraction in sign magn...
1.4k
views
answered
Oct 10, 2017
CO and Architecture
made-easy-test-series
digital-logic
ieee-representation
+
–
0
votes
13
Tanenbaum- Q34 (Network Layer)
Suppose that host A is connected to a router R 1, R 1 is connected to another router, R2, and R2 is connected to host B. Suppose that a TCP message that contains 900 bytes of data and 20 bytes of TCP header is passed to the IP code at ... including an 8-byte frame header, and link R2-B can support a maximum frame size of 512 bytes including a 12-byte frame header.
Suppose that host A is connected to a router R 1, R 1 is connected to another router, R2, and R2 is connected to host B. Suppose that a TCP message that contains 900 byte...
2.2k
views
answered
Oct 9, 2017
Computer Networks
computer-networks
+
–
0
votes
14
cn
A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/μsec. Repeaters are not allowed in this system. Data frames are 256 bits long, including 32 bits of header, checksum, and other overhead. The first bit slot after a ... to send a 32-bit acknowledgement frame. What is the effective data rate, excluding overhead, assuming that there are no collisions? ans=3.8 mbps
A 1-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of200 m/μsec. Repeaters are not allowed in this system. Data frames are 256 bits long,including 32 b...
823
views
answered
Oct 9, 2017
2
votes
15
MadeEasy Subject Test: Compiler Design - Intermediate Code
537
views
answered
Oct 6, 2017
Compiler Design
compiler-design
made-easy-test-series
intermediate-code
+
–
0
votes
16
MadeEasy Subject Test: Compiler Design - Syntax Directed Translation
How do we know when to execute which semmentic action?
How do we know when to execute which semmentic action?
1.1k
views
answered
Oct 6, 2017
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
numerical-answers
+
–
6
votes
17
GATE IT 2008 | Question: 84
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP addresses $192.168.1.135$ and $192.168.1.110$. $R2$ ... $1$ $2$ $3$ $6$
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP address...
11.8k
views
answered
Sep 28, 2017
Computer Networks
gateit-2008
computer-networks
subnetting
normal
+
–
0
votes
18
Analysis Of Prims Algorithm Time Complexity
Explain Prims Algorithm Analysis Of Time Complexity How does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
Explain Prims AlgorithmAnalysis Of Time ComplexityHow does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
2.5k
views
answered
Sep 22, 2017
Algorithms
algorithms
prims-algorithm
time-complexity
+
–
4
votes
19
Minimum number of tables to represent ER-Diagram
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
11.5k
views
answered
Aug 12, 2017
Databases
er-diagram
databases
er-to-relational
relational
+
–
0
votes
20
Identify the class of the language
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$ Identify the class of the language.
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$ Identify the class of the language.
736
views
answered
Jul 4, 2017
Theory of Computation
theory-of-computation
identify-class-language
+
–
0
votes
21
Identify the language
L1 = {w | length of w is odd and its middle symbol is 0, w $\epsilon$ (0,1)*} Is it regular, a CFL or a CSL?
L1 = {w | length of w is odd and its middle symbol is 0, w $\epsilon$ (0,1)*}Is it regular, a CFL or a CSL?
503
views
answered
Jul 4, 2017
Theory of Computation
theory-of-computation
identify-class-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register