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 Madhav
47
votes
3
answers
21
GATE CSE 2017 Set 2 | Question: 18
Consider socket API on a Linux machine that supports connected UDP sockets. A connected UDP socket is a UDP socket on which connect function has already been called. Which of the following statements is/are CORRECT? A connected UDP socket can be used to communicate with multiple ... $\text{I}$ and $\text{II}$ Neither $\text{I}$ nor $\text{II}$
Consider socket API on a Linux machine that supports connected UDP sockets. A connected UDP socket is a UDP socket on which connect function has already been called. Whic...
15.1k
views
asked
Feb 14, 2017
Computer Networks
gatecse-2017-set2
computer-networks
udp
+
–
29
votes
5
answers
22
GATE CSE 2017 Set 2 | Question: 15
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below? $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNROP}$ $\text{POQNMR}$
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the ...
8.1k
views
asked
Feb 14, 2017
Algorithms
gatecse-2017-set2
algorithms
graph-algorithms
graph-search
+
–
47
votes
9
answers
23
GATE CSE 2017 Set 2 | Question: 25
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left | w_{1} \right | = 2, \left | w_{2} \right |\geq 3$} is ______________ .
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$ | $w_{1},w_{2}$ $\in$ $\left \{ a,b \righ...
16.6k
views
asked
Feb 14, 2017
Theory of Computation
theory-of-computation
gatecse-2017-set2
finite-automata
numerical-answers
minimal-state-automata
+
–
62
votes
3
answers
24
GATE CSE 2017 Set 2 | Question: 17
An ER model of a database consists of entity types $A$ and $B$. These are connected by a relationship $R$ which does not have its own attribute. Under which one of the following conditions, can the relational table for R be merged with that of A? Relationship ... of $A$ in $R$ is total Relationship $R$ is many-to-one and the participation of $A$ in $R$ is partial
An ER model of a database consists of entity types $A$ and $B$. These are connected by a relationship $R$ which does not have its own attribute. Under which one of the fo...
22.4k
views
asked
Feb 14, 2017
Databases
gatecse-2017-set2
databases
er-diagram
normal
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register