Aspire Faculty ID #19043 · Topic: UGC NET Computer Science Dec 2019 (Paper II) · Just now
UGC NET Computer Science Dec 2019 (Paper II)

In a system for a restaurant, the main scenario for placing an order is given below:

(a) Customer reads menu
(b) Customer places order
(c) Order is sent to the kitchen for preparation
(d) Ordered items are served
(e) Customer requests for a bill for the order
(f) Bill is prepared for this order
(g) Customer is given the bill
(h) Customer pays the bill

A sequence diagram for the scenario will have at least how many objects among whom the messages will be exchanged.

Solution

In this restaurant ordering system, the minimum important objects are:

Customer

Menu

Order

Kitchen

Bill

Messages are exchanged among these objects during order placement, food preparation, serving, bill generation and payment.

So, at least $5$ objects are required in the sequence diagram.

Previous 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Nearest first
1
Java Virtual Machine $($JVM$)$ is used to execute architectural neutral byte code. Which of the following is needed by …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
Which of the following methods are used to pass any number of parameters to the operating system through system calls?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
Given a CPU time slice of $2$ ms and the following list of processes. Process Burst time $($ms$)$…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
Which of the following interprocess communication model is used to exchange messages among co-operative processes?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
Suppose a system has $12$ magnetic tape drives and at the time $t_0$, three processes are allotted tape drives out of t…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
Consider a paging system where translation lookaside buffer $($TLB$)$, a special type of associative memory, is used wi…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
Which of the following CPU scheduling algorithms is/are supported by LINUX operating system?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
Which of the following is not needed by an encryption algorithm used in Cryptography?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
A counting semaphore is initialized to $8$. $3$ wait $()$ operations and $4$ signal $()$ operations are applied. Find t…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
Find the minimum number of tables required for converting the following entity relationship diagram into a relational d…
Topic: UGC NET Computer Science Dec 2019 (Paper II)

Next 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Ascending by ID
1
An $...............$ chart is a project schedule representation that presents project plan as a directed graph. The cri…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
Let $a^{2c}\bmod n=(a^c)^2\bmod n$ and $a^{2c+1}\bmod n=a\cdot(a^c)^2\bmod n$. For $a=7,\ b=17$ and $n=561$, what is th…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
A clique in an undirected graph $G=\langle V,E\rangle$ is a subset $V'\subseteq V$ of vertices, such that
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsort…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
Give asymptotic upper and lower bound for $T(n)$ given below. Assume $T(n)$ is constant for $n\le 2$. $T(n)=4T(\sqrt n)…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
Consider a weighted directed graph. The current shortest distance from source $S$ to node $x$ is represented by $d[x]$.…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
When using Dijkstra's algorithm to find shortest path in a graph, which of the following statement is not true?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
The time complexity to multiply two polynomials of degree $n$ using Fast Fourier transform method is:
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
 Consider the following grammars: $G_1:S\rightarrow aSb\mid bSa\mid aa$ $G_2:S\rightarrow aSb\mid bSa\mid SS\mid \…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...