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


 How many nodes are there in flowgraph $F$?

Solution

In the given flowgraph, some statements are combined into one node, like $(2,3)$ and $(4,5)$.

Nodes are:

$1,\ (2,3),\ (4,5),\ 6,\ 7,\ 8,\ 9,\ 10,\ 11$

Total number of nodes:

$9$

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

Nearest first
1
The Data Encryption Standard $($DES$)$ has a function consists of four steps. Which of the following is correct order o…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
The sequence diagram given in Figure $1$ for the Weather Information System takes place when an external system request…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
Match List-I with List-II: List-I Term List-II Description (a) …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
Match List-I and List-II: List-I Term List-II Description (a) …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
An instruction is stored at location $500$ with its address field at location $501$. The address field has the value $4…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
Match List-I with List-II: List-I HTML Element / Attribute List-II Use …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
Match the Agile Process models with the task performed during the model: List-I Agile Process Mode…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
According to the ISO-9126 Standard Quality Model, match the attributes given in List-I with their definitions in List-I…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
Match List-I and List-II: List-I Layer List-II Description (a) …
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
Consider the following learning algorithms:(a) Logistic regression (b) Back propagation (c) Linear regression Which of…
Topic: UGC NET Computer Science Dec 2019 (Paper II)

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

Ascending by ID
Ask Your Question or Put Your Review.

loading...