Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Sanandan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Sanandan
0
votes
31
UGC NET CSE | January 2017 | Part 3 | Question: 20
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$? $\{\in \}$ $\{\in,1\}$ $\phi$ $1^{\ast}$
Consider the languages $L_{1}= \phi$ and $L_{2}=\{1\}$. Which one of the following represents $L_{1}^{\ast}\cup L_{2}^{\ast} L_{1}^{\ast}$?$\{\in \}$$\{\in,1\}$$\phi$$1^{...
1.5k
views
answered
Oct 3, 2020
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
0
votes
32
UGC NET CSE | January 2017 | Part 3 | Question: 19
Which of the following are not regular? Strings of even number of a’s Strings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s. Strings of a’s whose length is a perfect square. (i) and (ii) only (i), (ii) and (iii) only (ii),(iii) and (iv) only (ii) and (iv) only
Which of the following are not regular?Strings of even number of a’sStrings of a’s , whose length is a prime number. Set of all palindromes made up of a’s and b’s...
1.3k
views
answered
Oct 3, 2020
Theory of Computation
ugcnetcse-jan2017-paper3
theory-of-computation
regular-language
+
–
0
votes
33
NIELIT 2016 DEC Scientist B (CS) - Section B: 3
If $L1$ is CFL and $L2$ is regular language which of the following is false? $L1-L2$ is not Context free $L1$ intersection $L2$ is Context free $\sim L1$ is Context free Both (A) and (C)
If $L1$ is CFL and $L2$ is regular language which of the following is false?$L1-L2$ is not Context free$L1$ intersection $L2$ is Context free$\sim L1$ is Context freeBoth...
744
views
answered
Oct 3, 2020
Theory of Computation
nielit2016dec-scientistb-cs
theory-of-computation
context-free-language
+
–
0
votes
34
NIELIT 2016 MAR Scientist B - Section C: 28
Which of the following statements is correct? $A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular language Set $B$ of all strings of equal number of $a$'s and $b$'s defines a regular language $L(A^*B^*) \cap B$ gives the set $A$ None of these.
Which of the following statements is correct?$A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular languageSet $B$ of all strings of equal number of $a$'s and $b$'s defines a re...
766
views
answered
Oct 3, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
regular-language
+
–
0
votes
35
NIELIT 2016 MAR Scientist B - Section C: 27
If $L$ be a language recognizable by a finite automaton, then language from $\{L\} = \{w$ such that $w$ is a prefix of $v$ where $v\in L\}$, is a regular language. context-free language. context-sensitive language. recursive enumeration language
If $L$ be a language recognizable by a finite automaton, then language from $\{L\} = \{w$ such that $w$ is a prefix of $v$ where $v\in L\}$, is aregular language.context-...
850
views
answered
Oct 3, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
regular-language
+
–
0
votes
36
NIELIT 2016 MAR Scientist B - Section C: 26
If $L_1$ and $L_2$ are context free language and $R$ a regular set, then which one of the languages below is not necessarily a context free language? $L_1L_2$ $L_1\cap L_2$ $L_1\cap R$ $L_1\cup L_2$
If $L_1$ and $L_2$ are context free language and $R$ a regular set, then which one of the languages below is not necessarily a context free language?$L_1L_2$$L_1\cap L_2$...
903
views
answered
Oct 3, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
context-free-language
+
–
0
votes
37
NIELIT 2017 DEC Scientific Assistant A - Section B: 15
If $L1$ and $L2$ are regular sets then intersection of these two will be : Regular Non Regular Recursive Non Recursive
If $L1$ and $L2$ are regular sets then intersection of these two will be :RegularNon RegularRecursiveNon Recursive
1.7k
views
answered
Oct 3, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
regular-language
+
–
0
votes
38
NIELIT 2016 MAR Scientist B - Section C: 55
A packet switching network is free. can reduce the cost of using an information utility. allows communications channel to be shared among more than one user. both (B) and (C).
A packet switching networkis free.can reduce the cost of using an information utility.allows communications channel to be shared among more than one user.both (B) and (C)...
1.2k
views
answered
Sep 17, 2020
Computer Networks
nielit2016mar-scientistb
computer-networks
ip-packet
+
–
0
votes
39
GATE CSE 2019 | Question: 16
Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)? $\textsf{IMAP, POP3}$ $\textsf{SMTP, POP3}$ $\textsf{SMTP, MIME}$ $\textsf{IMAP, SMTP}$
Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)?$\textsf{IMAP, POP3}$$\textsf{SMTP, POP3}$$\textsf{SMTP, MIME}$$\textsf{IMA...
12.4k
views
answered
Sep 17, 2020
Computer Networks
gatecse-2019
computer-networks
application-layer-protocols
1-mark
+
–
0
votes
40
GATE CSE 2012 | Question: 10
The protocol data unit (PDU) for the application layer in the Internet stack is: Segment Datagram Message Frame
The protocol data unit (PDU) for the application layer in the Internet stack is:SegmentDatagramMessageFrame
27.9k
views
answered
Sep 17, 2020
Computer Networks
gatecse-2012
computer-networks
application-layer-protocols
easy
+
–
0
votes
41
GATE CSE 2008 | Question: 14, ISRO2016-74
What is the maximum size of data that the application layer can pass on to the TCP layer below? Any size $2^{16}$ bytes - size of TCP header $2^{16}$ bytes $1500$ bytes
What is the maximum size of data that the application layer can pass on to the TCP layer below?Any size$2^{16}$ bytes - size of TCP header$2^{16}$ bytes$1500$ bytes
17.6k
views
answered
Sep 17, 2020
Computer Networks
gatecse-2008
easy
computer-networks
application-layer-protocols
isro2016
+
–
0
votes
42
MadeEasy Test Series: Computer Networks - Network Layering
Consider the following statements with respect to application layer: S1 : Datagram is the PDU (Protocol data unit) used. S2 : There is a fixed limit on the maximum size of data that it can pass on the TCP layer. Which of the following options is ... A Only S1 is true B Only S2 is true C Both S1 and S2 are true D Neither of S1 or S2 is true
Consider the following statements with respect to application layer:S1 : Datagram is the PDU (Protocol data unit) used.S2 : There is a fixed limit on the maximum size of ...
1.7k
views
answered
Sep 17, 2020
Computer Networks
made-easy-test-series
computer-networks
datagram
tcp
network-layering
+
–
0
votes
43
Kurose and Ross Edition 6 Exercise 1 Question R23 (Page No 70)
What are the five layers in the Internet protocol stack? What are the principal responsibilities of each of these layers?
What are the five layers in the Internet protocol stack? What are the principal responsibilities of each of these layers?
1.1k
views
answered
Sep 17, 2020
Computer Networks
computer-networks
kurose-and-ross
network-layering
osi-model
descriptive
+
–
0
votes
44
Kurose and Ross Edition 6 Exercise 1 Question R25 (Page No 70)
Which layers in the Internet protocol stack does a router process? Which layers does a link-layer switch process? Which layers do a host process?
Which layers in the Internet protocol stack does a router process? Which layers does a link-layer switch process? Which layers do a host process?
4.4k
views
answered
Sep 17, 2020
Computer Networks
computer-networks
kurose-and-ross
network-layering
descriptive
+
–
0
votes
45
GATE CSE 2018 | Question: 5
Consider the following processor design characteristics: Register-to-register arithmetic operations only Fixed-length instruction format Hardwired control unit Which of the characteristics above are used in the design of a RISC processor? I and II only II and III only I and III only I, II and III
Consider the following processor design characteristics:Register-to-register arithmetic operations onlyFixed-length instruction formatHardwired control unitWhich of the c...
11.9k
views
answered
Sep 16, 2020
CO and Architecture
gatecse-2018
co-and-architecture
cisc-risc-architecture
easy
1-mark
+
–
1
votes
46
GATE CSE 1995 | Question: 1.6
The principle of locality justifies the use of: Interrupts DMA Polling Cache Memory
The principle of locality justifies the use of:InterruptsDMAPollingCache Memory
8.6k
views
answered
Sep 15, 2020
CO and Architecture
gate1995
co-and-architecture
cache-memory
easy
+
–
0
votes
47
UGC NET CSE | June 2019 | Part 2 | Question: 78
Consider the following grammar: $S \rightarrow XY$ $X \rightarrow YaY \mid a \text{ and } Y \rightarrow bbX$ Which of the following statements is/are true about the above grammar? Strings produced by the grammar can have consecutive three $a$ ... by the grammar have $b$'s in multiple of $2$. i only ii and iii only iv only iii and iv only
Consider the following grammar:$S \rightarrow XY$$X \rightarrow YaY \mid a \text{ and } Y \rightarrow bbX$Which of the following statements is/are true about the above gr...
2.0k
views
answered
Sep 14, 2020
Theory of Computation
ugcnetcse-june2019-paper2
grammar
strings
+
–
0
votes
48
ISRO2020-75
A grammar is defined as $A \rightarrow BC$ $B \rightarrow x \mid Bx$ $C \rightarrow B \mid D$ $D \rightarrow y \mid Ey$ $E \rightarrow z$ The non terminal alphabet of the grammar is $\{A,B,C,D,E\}$ $\{B,C,D,E\}$ $\{A,B,C,D,E,x,y,z\}$ $\{x,y,z\}$
A grammar is defined as$A \rightarrow BC$$B \rightarrow x \mid Bx$$C \rightarrow B \mid D$$D \rightarrow y \mid Ey$$E \rightarrow z$The non terminal alphabet of the gram...
2.3k
views
answered
Sep 14, 2020
Compiler Design
isro-2020
compiler-design
grammar
parsing
easy
+
–
0
votes
49
ISRO2020-35
Given the grammar $s \rightarrow T ^{\ast} S\ \mid T$ $T \rightarrow U+T\ \mid U$ $U \rightarrow a \mid b$ Which of the following statements is wrong? Grammar is not ambiguous Priority of $+$ over $^{\ast}$ is ensured Right to left evaluation of $^{\ast}$ and $+$ happens None of these
Given the grammar$s \rightarrow T ^{\ast} S\ \mid T$$T \rightarrow U+T\ \mid U$$U \rightarrow a \mid b$Which of the following statements is wrong?Grammar is not ambiguou...
3.7k
views
answered
Sep 14, 2020
Compiler Design
isro-2020
compiler-design
grammar
easy
+
–
0
votes
50
ISRO2020-60
A given grammar is called ambiguous if two or more productions have the same non-terminal on the left hand side a derivation tree has more than one associated sentence there is a sentence with more than one derivation tree corresponding to it brackets are not present in the grammar
A given grammar is called ambiguous iftwo or more productions have the same non-terminal on the left hand sidea derivation tree has more than one associated sentencethere...
8.9k
views
answered
Sep 14, 2020
Compiler Design
isro-2020
compiler-design
ambiguous-grammar
easy
+
–
0
votes
51
NIELIT 2016 DEC Scientist B (CS) - Section B: 24
Given two DFA's $M1$ and $M2$. They are equivalent if $M1$ and $M2$ has the same number of states $M1$ and $M2$ accepts the same language i.e $L(M1)=L(M2)$ $M1$ and $M2$ has the same number of final states None of the above
Given two DFA's $M1$ and $M2$. They are equivalent if$M1$ and $M2$ has the same number of states$M1$ and $M2$ accepts the same language i.e $L(M1)=L(M2)$$M1$ and $M2$ has...
1.5k
views
answered
Sep 14, 2020
Theory of Computation
nielit2016dec-scientistb-cs
theory-of-computation
finite-automata
+
–
0
votes
52
NIELIT 2016 MAR Scientist B - Section C: 25
Regarding power of recognition of language, which of the following statements is false? Non deterministic finite-state automata are equivalent to deterministic finite-state automata. Non-deterministic push-down automata are equivalent to ... to deterministic push-down automata. Multi-tape Turing Machines are equivalent to Single-tape Turing Machines.
Regarding power of recognition of language, which of the following statements is false?Non deterministic finite-state automata are equivalent to deterministic finite-stat...
1.3k
views
answered
Sep 14, 2020
Theory of Computation
nielit2016mar-scientistb
theory-of-computation
identify-class-language
+
–
0
votes
53
NIELIT 2017 DEC Scientific Assistant A - Section B: 40
What is the relation between $DFA$ and $NFA$ on the basis of computational power ? $DFA$ > $NFA$ $NFA$ > $DFA$ Equal Can't be said
What is the relation between $DFA$ and $NFA$ on the basis of computational power ?$DFA$ $NFA$$NFA$ $DFA$EqualCan't be said
991
views
answered
Sep 14, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
0
votes
54
NIELIT 2017 DEC Scientific Assistant A - Section B: 31
A finite automaton accepts which type of language : Type $0$ Type $1$ Type $2$ Type $3$
A finite automaton accepts which type of language : Type $0$Type $1$Type $2$Type $3$
3.3k
views
answered
Sep 14, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
identify-class-language
finite-automata
+
–
0
votes
55
NIELIT 2017 DEC Scientific Assistant A - Section B: 4
Complement of a $DFA$ can be obtained by : making starting state as final state. make final as a starting state. making final states non-final and non-final as final. None of the options
Complement of a $DFA$ can be obtained by :making starting state as final state.make final as a starting state.making final states non-final and non-final as final.None of...
1.6k
views
answered
Sep 14, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
2
votes
56
MadeEasy Test Series: CO & Architecture - Dma
A hard disk with a transfer rate of 1 KBps is constantly transferring data to memory using DMA cycle stealing mode. The size of the data transfer is 16 bytes. The processor runs at 400 kHz clock frequency. The DMA controller requires ... time as 0.9375 sec and percentage time CPU gets blocked = transfer time/preparation time (IN case of cycle stealing)
A hard disk with a transfer rate of 1 KBps is constantly transferring data to memory using DMA cycle stealing mode. The size of the data transfer is 16 bytes. The process...
2.4k
views
answered
Sep 13, 2020
CO and Architecture
made-easy-test-series
co-and-architecture
dma
+
–
0
votes
57
Ace Test Series: CO & Architecture - Instruction Execution
CPU can leave current instruction execution, without completing it for : Service of interrupt DMA Both Neither
CPU can leave current instruction execution, without completing it for :Service of interruptDMABothNeither
670
views
answered
Sep 13, 2020
CO and Architecture
co-and-architecture
dma
ace-test-series
instruction-execution
+
–
0
votes
58
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 5 (Page No. 81)
On early computers, every byte of data read or written was handled by the CPU (i.e., there was no DMA). What implications does this have for multiprogramming?
On early computers, every byte of data read or written was handled by the CPU (i.e., there was no DMA). What implications does this have for multiprogramming?
1.8k
views
answered
Sep 13, 2020
Operating System
tanenbaum
operating-system
multi-programming
dma
descriptive
+
–
0
votes
59
UGC NET CSE | August 2016 | Part 3 | Question: 33
Consider a weighted complete graph $G$ on the vertex set $\left\{ν_{1} , ν_{2},.... ν_{n} \right\}$ such that the weight of the edge $(ν_{i} , ν_{j})$ is $4 | i – j|$. The weight of minimum cost spanning tree of $G$ is : $4n^{2}$ $n$ $4n – 4$ $2n – 2$
Consider a weighted complete graph $G$ on the vertex set $\left\{ν_{1} , ν_{2},.... ν_{n} \right\}$ such that the weight of the edge $(ν_{i} , ν_{j})$ is $4 | i – ...
1.7k
views
answered
Sep 12, 2020
DS
ugcnetcse-aug2016-paper3
data-structures
spanning-tree
+
–
0
votes
60
UGC NET CSE | December 2008 | Part 2 | Question: 3
The total number of spanning trees that can be drawn using five labeled vertices is: 125 64 36 16
The total number of spanning trees that can be drawn using five labeled vertices is:125 64 36 16
3.8k
views
answered
Sep 12, 2020
DS
ugcnetcse-dec2008-paper2
data-structures
spanning-tree
+
–
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register