Recent questions and answers in Unknown Category

0 votes

1 answer

1

UGCNET-Oct2020-II: 80
Given below are two statements: Statement $I$: $5$ divides $n^5-n$ wherever $n$ is a nonnegative integer Statement $II$: $6$ divides $n^3-n$ whenever $n$ is a nonnegative integer In the light of the above statements, choose the correct answer ... $II$ are incorrect Statement $I$ is correct but Statement $II$ is incorrect Statement $I$ is incorrect but Statement $II$ is correct

Given below are two statements: Statement $I$: $5$ divides $n^5-n$ wherever $n$ is a nonnegative integer Statement $II$: $6$ divides $n^3-n$ whenever $n$ is a nonnegative integer In the light of the above statements, choose the correct answer from the ... Statement $II$ are incorrect Statement $I$ is correct but Statement $II$ is incorrect Statement $I$ is incorrect but Statement $II$ is correct

answered 13 hours ago in Unknown Category Sanjay Sharma 13 views

0 votes

1 answer

2

UGCNET-Oct2020-II: 81
Given below are two statements: Statement $I$: Hardwired control unit can be optimized to produce fast mode of operation Statement $II$: Indirect addressing mode needs two memory reference to fetch operand In the light of the above statements, choose the correct ... false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true

Given below are two statements: Statement $I$: Hardwired control unit can be optimized to produce fast mode of operation Statement $II$: Indirect addressing mode needs two memory reference to fetch operand In the light of the above statements, choose the correct answer from the ... are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true

answered 13 hours ago in Unknown Category Sanjay Sharma 6 views

0 votes

1 answer

3

UGCNET-Oct2020-II: 26
Let $G$ be a directed graph whose vertex set is the set of numbers from $1$ to $100$. There is an edge from a vertex $i$ to a vertex $j$ if and only if either $j=i+1$ or $j=3i$. The minimum number of edges in a path in $G$ from vertex $1$ to vertex $100$ is ______ $23$ $99$ $4$ $7$

Let $G$ be a directed graph whose vertex set is the set of numbers from $1$ to $100$. There is an edge from a vertex $i$ to a vertex $j$ if and only if either $j=i+1$ or $j=3i$. The minimum number of edges in a path in $G$ from vertex $1$ to vertex $100$ is ______ $23$ $99$ $4$ $7$

answered 15 hours ago in Unknown Category Ashwani Kumar 2 12 views

0 votes

1 answer

4

UGCNET-Oct2020-II: 79
Consider the following regular expressions: $r=a(b+a)^*$ $s=a(a+b)^*$ $t=aa^*b$ Choose the correct answer from the options given below based on the relation between the languages generated by the regular expressions above: $L(r) \subseteq L(s) \subseteq L(t)$ $L(r) \supseteq L(s) \supseteq L(t)$ $L(r) \supseteq L(t) \supseteq L(s)$ $L(s) \supseteq L(t) \supseteq L(r)$

Consider the following regular expressions: $r=a(b+a)^*$ $s=a(a+b)^*$ $t=aa^*b$ Choose the correct answer from the options given below based on the relation between the languages generated by the regular expressions above: $L(r) \subseteq L(s) \subseteq L(t)$ $L(r) \supseteq L(s) \supseteq L(t)$ $L(r) \supseteq L(t) \supseteq L(s)$ $L(s) \supseteq L(t) \supseteq L(r)$

answered 19 hours ago in Unknown Category Sanjay Sharma 7 views

0 votes

1 answer

5

UGCNET-Oct2020-II: 77
Arrange the following types of Cohesion from the best to worst type. Logical Cohesion Sequential Cohesion Communication Cohesion Temporal Cohesion Procedural Cohesion Choose the correct answer from the options given below: ... $b \rightarrow c \rightarrow e \rightarrow d \rightarrow a$

Arrange the following types of Cohesion from the best to worst type. Logical Cohesion Sequential Cohesion Communication Cohesion Temporal Cohesion Procedural Cohesion Choose the correct answer from the options given below: ... $b \rightarrow c \rightarrow e \rightarrow d \rightarrow a$

answered 19 hours ago in Unknown Category Sanjay Sharma 7 views

0 votes

1 answer

6

UGCNET-Oct2020-II: 57
Which of the following grammars is(are ambiguous? $s \rightarrow ss \mid asb \mid bsa \mid \lambda$ $s \rightarrow asbs \mid bsas \mid \lambda$ $s \rightarrow aAB \\ A \rightarrow bBb \\ B \rightarrow A \mid \lambda \text{ where } \lambda \text{ denotes empty string}$ Choose the ... options given below: $(a)$ and $(c)$ only $(b)$ only $(b)$ and $(c)$ only $(a)$ and $(b)$ only

Which of the following grammars is(are ambiguous? $s \rightarrow ss \mid asb \mid bsa \mid \lambda$ $s \rightarrow asbs \mid bsas \mid \lambda$ $s \rightarrow aAB \\ A \rightarrow bBb \\ B \rightarrow A \mid \lambda \text{ where } \lambda \text{ denotes empty string}$ Choose the correct answer from the options given below: $(a)$ and $(c)$ only $(b)$ only $(b)$ and $(c)$ only $(a)$ and $(b)$ only

answered 20 hours ago in Unknown Category Sanjay Sharma 8 views

0 votes

1 answer

7

UGCNET-Oct2020-II: 53
Consider the following statements: Any tree is $2$-colorable A graph $G$ has no cycles of even length if it is bipartite A graph $G$ is $2$-colorable if is bipartite A graph $G$ can be colored with $d+1$ colors if $d$ is the maximum degree of any vertex in the graph ... $(b)$ and $(c)$ are incorrect $(b)$ and $(e)$ are incorrect $(a)$ and $(d)$ are incorrect

Consider the following statements: Any tree is $2$-colorable A graph $G$ has no cycles of even length if it is bipartite A graph $G$ is $2$-colorable if is bipartite A graph $G$ can be colored with $d+1$ colors if $d$ is the maximum degree of any vertex in the graph $G$ ... and $(e)$ are incorrect $(b)$ and $(c)$ are incorrect $(b)$ and $(e)$ are incorrect $(a)$ and $(d)$ are incorrect

answered 21 hours ago in Unknown Category Sanjay Sharma 7 views

0 votes

1 answer

8

UGCNET-Oct2020-II: 68
Match $\text{list I}$ with $\text{List II}$ ... $A-IV, B-III, C-I, D-II$ $A-IV, B-III, C-II, D-I$ $A-III, B-IV, C-I, D-II$

Match $\text{list I}$ with $\text{List II}$ ... $A-IV, B-III, C-I, D-II$ $A-IV, B-III, C-II, D-I$ $A-III, B-IV, C-I, D-II$

answered 22 hours ago in Unknown Category Sanjay Sharma 8 views

0 votes

1 answer

9

UGCNET-Oct2020-II: 74
Find the lexicographic ordering of the bit strings given below based on the ordering $0<1$. $001$ $010$ $011$ $0001$ $0101$ Choose the correct answer from the options given below: $001 < 010 < 011 < 0001 < 0101$ $0001 < 001 < 010 < 0101 < 011$ $0001 < 0101 < 001 < 010 < 011$ $001 < 010 < 0001 < 0101 < 011$

Find the lexicographic ordering of the bit strings given below based on the ordering $0<1$. $001$ $010$ $011$ $0001$ $0101$ Choose the correct answer from the options given below: $001 < 010 < 011 < 0001 < 0101$ $0001 < 001 < 010 < 0101 < 011$ $0001 < 0101 < 001 < 010 < 011$ $001 < 010 < 0001 < 0101 < 011$

answered 1 day ago in Unknown Category Sanjay Sharma 6 views

0 votes

1 answer

10

UGCNET-Oct2020-II: 73
Match $\text{List I}$ with $\text{List II}$ ... $A-II, B-III, C-I, D-IV$ $A-III, B-II, C-IV, D-I$ $A-III, B-IV, C-II, D-I$

Match $\text{List I}$ with $\text{List II}$ ... $A-II, B-III, C-I, D-IV$ $A-III, B-II, C-IV, D-I$ $A-III, B-IV, C-II, D-I$

answered 1 day ago in Unknown Category Sanjay Sharma 7 views

0 votes

1 answer

11

UGCNET-Oct2020-II: 66
Match $\text{List I}$ with $\text{List II}$. $\text{List I}$ gives $\3 \times 3$ matrices representing $2D$ transformations and $\text{List II}$ shows the corresponding transformation diagrams. Choose the correct answer from the options given below: $A-IV, B-II, C-III, D-I$ $A-IV, B-III, C-II, D-I$ $A-III, B-II, C-IV, D-I$ $A-II, B-IV, C-III, D-I$

Match $\text{List I}$ with $\text{List II}$. $\text{List I}$ gives $\3 \times 3$ matrices representing $2D$ transformations and $\text{List II}$ shows the corresponding transformation diagrams. Choose the correct answer from the options given below: $A-IV, B-II, C-III, D-I$ $A-IV, B-III, C-II, D-I$ $A-III, B-II, C-IV, D-I$ $A-II, B-IV, C-III, D-I$

answered 1 day ago in Unknown Category Sanjay Sharma 8 views

0 votes

1 answer

12

UGCNET-Oct2020-II: 71
Match $\text{List I}$ with $\text{List II}$ $L_R:$ Regular language, $LCF$: Context free language $L_{REC}:$ Recursive langauge, $L_{RE}$ ... : $A-II, B-III, C-I$ $A-III, B-I, C-II$ $A-I, B-I, C-III$ $A-II, B-I, C-III$

Match $\text{List I}$ with $\text{List II}$ $L_R:$ Regular language, $LCF$: Context free language $L_{REC}:$ Recursive langauge, $L_{RE}$ ... options given below: $A-II, B-III, C-I$ $A-III, B-I, C-II$ $A-I, B-I, C-III$ $A-II, B-I, C-III$

answered 1 day ago in Unknown Category Sanjay Sharma 7 views

0 votes

1 answer

13

UGCNET-Oct2020-II: 30
Which of the following is not an intermediate code form? Syntax trees Three address codes Quadrupules Post fix Notation

Which of the following is not an intermediate code form? Syntax trees Three address codes Quadrupules Post fix Notation

answered 1 day ago in Unknown Category Sanjay Sharma 9 views

0 votes

1 answer

14

UGCNET-Oct2020-II: 24
In a binary max heap containing $n$ numbers, the smallest element can be found in ______ $O(n)$ $O(\log _2 n)$ $O(1)$ $O(\log_2 \log_2 n)$

In a binary max heap containing $n$ numbers, the smallest element can be found in ______ $O(n)$ $O(\log _2 n)$ $O(1)$ $O(\log_2 \log_2 n)$

answered 2 days ago in Unknown Category Ashwani Kumar 2 11 views

0 votes

1 answer

15

UGCNET-Oct2020-II: 23
A complete $n$-ary tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complete $n$-ary tree. If $L=41$, and $I=10$, what is the value of $n$? $3$ $4$ $5$ $6$

A complete $n$-ary tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complete $n$-ary tree. If $L=41$, and $I=10$, what is the value of $n$? $3$ $4$ $5$ $6$

answered 2 days ago in Unknown Category Ashwani Kumar 2 7 views

0 votes

1 answer

16

UGCNET-Oct2020-II: 91
Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If $T$ is the capacity of a track in bytes, and $S$ is the capacity of ... $(50 K, 50000 K)$ $(25 K, 25000 K)$ $(25 K, 50000 K)$ $(40 K, 36000 K)$

Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If $T$ is the capacity of a track in bytes, and $S$ is the capacity of each surface in ... $(T,S)=$ _______ $(50 K, 50000 K)$ $(25 K, 25000 K)$ $(25 K, 50000 K)$ $(40 K, 36000 K)$

answered 2 days ago in Unknown Category Ashwani Kumar 2 6 views

0 votes

1 answer

17

UGCNET-Oct2020-II: 95
For the question given below, concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If one track of data can be transferred per revolution, ... is the data transfer rate? $2,850$ KBytes/second $4,500$ KBytes/second $5,700$ KBytes/second $2,250$ KBytes/second

For the question given below, concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If one track of data can be transferred per revolution, then what is the data transfer rate? $2,850$ KBytes/second $4,500$ KBytes/second $5,700$ KBytes/second $2,250$ KBytes/second

answered 2 days ago in Unknown Category Ashwani Kumar 2 6 views

0 votes

1 answer

18

UGCNET-Oct2020-II: 94
Comprehension: For the question given below, concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ ... , then approximately what is the maximum rotational delay? $0.011$ seconds $0.11$ seconds $0.0011$ seconds $1.1$ seconds

Comprehension: For the question given below, concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. If the disk platters rotate at $5400$ rpm ( ... minute), then approximately what is the maximum rotational delay? $0.011$ seconds $0.11$ seconds $0.0011$ seconds $1.1$ seconds

answered 2 days ago in Unknown Category Ashwani Kumar 2 6 views

0 votes

1 answer

19

UGCNET-Oct2020-II: 93
Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. Given below are two statements: ... are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true

Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. Given below are two statements: Statement $I$: The ... $II$ are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true

answered 2 days ago in Unknown Category Ashwani Kumar 2 6 views

0 votes

1 answer

20

UGCNET-Oct2020-II: 92
Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. What is the capacity of the disk, in bytes? $25,000 K$ $500,000 K$ $250,000 K$ $50,000 K$

Comprehension: For the question given below: concern a disk with a sector size of $512$ bytes, $2000$ tracks per surface, $50$ sectors per track, five double-sided platters, and average seek time of $10$ milliseconds. What is the capacity of the disk, in bytes? $25,000 K$ $500,000 K$ $250,000 K$ $50,000 K$

answered 2 days ago in Unknown Category Ashwani Kumar 2 8 views

0 votes

1 answer

21

UGCNET-Oct2020-II: 49
Software reliability is described with respect to Execution Time Calender Time Clock Time Choose the correct answer from the options given below: $(a)$ and $(b)$ only $(b)$ and $(c)$ only $(a)$, $(b)$ and $(c)$ $(a)$ and $(c)$ only

Software reliability is described with respect to Execution Time Calender Time Clock Time Choose the correct answer from the options given below: $(a)$ and $(b)$ only $(b)$ and $(c)$ only $(a)$, $(b)$ and $(c)$ $(a)$ and $(c)$ only

answered 2 days ago in Unknown Category Sanjay Sharma 7 views

0 votes

1 answer

22

UGCNET-Oct2020-II: 25
If algorithm $A$ and another algorithm $B$ take $\log_2 (n)$ and $\sqrt{n}$ microseconds, respectively, to solve a problem, then the largest size $n$ of a problem these algorithms can solve, respectively, in one second are ______ and ______. $2^{10^n}$ and $10^6$ $2^{10^n}$ and $10^{12}$ $2^{10^n}$ and $6.10^6$ $2^{10^n}$ and $6.10^{12}$

If algorithm $A$ and another algorithm $B$ take $\log_2 (n)$ and $\sqrt{n}$ microseconds, respectively, to solve a problem, then the largest size $n$ of a problem these algorithms can solve, respectively, in one second are ______ and ______. $2^{10^n}$ and $10^6$ $2^{10^n}$ and $10^{12}$ $2^{10^n}$ and $6.10^6$ $2^{10^n}$ and $6.10^{12}$

answered 2 days ago in Unknown Category Sanjay Sharma 12 views

0 votes

1 answer

23

UGCNET-Oct2020-I: 4
The following table shows total number of students in the Department of the Institute along with percentage of Females and Male students. Answer the question based on the data given below: ... together to the number of males in the same departments together? $311: 270$ $329:261$ $411:469$ $311 : 269$

The following table shows total number of students in the Department of the Institute along with percentage of Females and Male students. Answer the question based on the data given below: ... Electrical departments together to the number of males in the same departments together? $311: 270$ $329:261$ $411:469$ $311 : 269$

answered 2 days ago in Unknown Category himanshu2021 9 views

0 votes

1 answer

24

UGCNET-Oct2020-I: 3
The following table shows total number of students in the Department of the Institute along with percentage of Females and Male students. Answer the question based on the data given below: ... $266$ $886$ $786$ $686$

The following table shows total number of students in the Department of the Institute along with percentage of Females and Male students. Answer the question based on the data given below: ... $266$ $886$ $786$ $686$

answered 2 days ago in Unknown Category himanshu2021 9 views

0 votes

1 answer

25

UGCNET-Oct2020-I: 2
The following table shows total number of students in the Department of the Institute along with percentage of Females and Male students. Answer the question based on the data given below: ... $2210$ $3210$ $3400$ $3310$

The following table shows total number of students in the Department of the Institute along with percentage of Females and Male students. Answer the question based on the data given below: ... $2210$ $3210$ $3400$ $3310$

answered 2 days ago in Unknown Category himanshu2021 7 views

0 votes

1 answer

26

UGCNET-Oct2020-I: 1
The following table shows total number of students in the Department of the Institute along with percentage of Females and Male students. Answer the question based on the data given below: ... of females in Mechanical Department to the number of females in Electronics Department? $4:3$ $23:22$ $24:21$ $23:21$

The following table shows total number of students in the Department of the Institute along with percentage of Females and Male students. Answer the question based on the data given below: ... the number of females in Mechanical Department to the number of females in Electronics Department? $4:3$ $23:22$ $24:21$ $23:21$

answered 2 days ago in Unknown Category himanshu2021 11 views

0 votes

1 answer

27

UGCNET-Oct2020-I: 35
Match $\text{List I}$ with $\text{List II}$ ... $(A)-(III), (B)-(II), (C)-(I), (D)-(IV)$ $(A)-(I), (B)-(II), (C)-(III), (D)-(IV)$

Match $\text{List I}$ with $\text{List II}$ $\begin{array}{llll} & \text{List I} & \text{List II} \\ (A) & \text{Input} & (I) & \text{Mouse} \\ (B) & \text{Output} & (II) & \text{Monitor} \\ (C) & \text{Memory} & (III) & \text{Cache} \\ (D) & \text{Software} & (IV) & \text{Python} \end{array}$ ... $(A)-(III), (B)-(II), (C)-(I), (D)-(IV)$ $(A)-(I), (B)-(II), (C)-(III), (D)-(IV)$

answered 2 days ago in Unknown Category himanshu2021 7 views

0 votes

1 answer

28

UGCNET-Oct2020-II: 51
Which of the following is/are behavioral testing technique(s)? Equivalence Partitioning Graph-Based Treating Method Boundary Value Analysis Data flow Testing Loop Testing Choose the correct answer from the options given below: $(b)$ and $(d)$ only $(a)$, $(b)$ and $(c)$ only $(d)$ and $(e)$ only $(a)$, $(c)$ and $(e)$ only

Which of the following is/are behavioral testing technique(s)? Equivalence Partitioning Graph-Based Treating Method Boundary Value Analysis Data flow Testing Loop Testing Choose the correct answer from the options given below: $(b)$ and $(d)$ only $(a)$, $(b)$ and $(c)$ only $(d)$ and $(e)$ only $(a)$, $(c)$ and $(e)$ only

answered 2 days ago in Unknown Category Sanjay Sharma 7 views

0 votes

1 answer

29

UGCNET-Oct2020-II: 54
Which among the following statement(s) is(are) true? A hash function takes a message of arbitrary length and generates a fixed length code A hash function takes a message of fixed length and generates a code of variable length A hash function may give same hash value for distinct messages Choose ... given below: $(a)$ only $(b)$ and $(c)$ only $(a)$ and $(c)$ only $(b)$ only

Which among the following statement(s) is(are) true? A hash function takes a message of arbitrary length and generates a fixed length code A hash function takes a message of fixed length and generates a code of variable length A hash function may give same hash value for distinct messages Choose the correct ... options given below: $(a)$ only $(b)$ and $(c)$ only $(a)$ and $(c)$ only $(b)$ only

answered 2 days ago in Unknown Category himanshu2021 10 views

0 votes

1 answer

30

UGCNET-Oct2020-II: 48
In the context of concurrency control, a given pair of operations in a schedule is called conflict schedule if At least one of the operations is write operation Both the operations are performed on the same data item Both the operations are performed by different transactions Both the operations are ... $(c)$ only $(a)$, $(c)$ and $(d)$ only $(c)$ and $(d)$ only

In the context of concurrency control, a given pair of operations in a schedule is called conflict schedule if At least one of the operations is write operation Both the operations are performed on the same data item Both the operations are performed by different transactions Both the operations are performed on different ... $(b)$ and $(c)$ only $(a)$, $(c)$ and $(d)$ only $(c)$ and $(d)$ only

answered 2 days ago in Unknown Category himanshu2021 6 views

0 votes

1 answer

31

UGCNET-Oct2020-II: 58
Which of the following cloud concept/s is/are related to pooling and sharing of resources? Virtual Memory Service Virtualization Choose the correct answer from the options given below: $(c)$ only $(a)$ and $(b)$ only $(a)$ only $(b)$ only

Which of the following cloud concept/s is/are related to pooling and sharing of resources? Virtual Memory Service Virtualization Choose the correct answer from the options given below: $(c)$ only $(a)$ and $(b)$ only $(a)$ only $(b)$ only

answered 2 days ago in Unknown Category himanshu2021 6 views

0 votes

1 answer

32

UGCNET-Oct2020-II: 59
Post office protocol (POP) is a message access protocol which is used to extract message for client. In this regards, which of the following are true? POP has two modes, Delete mode and keep In Delete mode, mail is deleted from mail box after each retrival In Delete mode, mail is deleted from mail box ... $(a)$, $(b)$, $(c)$ and $(d)$ only $(a)$, $(b)$ and $(e)$ only

Post office protocol (POP) is a message access protocol which is used to extract message for client. In this regards, which of the following are true? POP has two modes, Delete mode and keep In Delete mode, mail is deleted from mail box after each retrival In Delete mode, mail is deleted from mail box before each ... $(e)$ only $(a)$, $(b)$, $(c)$ and $(d)$ only $(a)$, $(b)$ and $(e)$ only

answered 2 days ago in Unknown Category himanshu2021 7 views

0 votes

1 answer

33

UGCNET-Oct2020-II: 64
Match $\text{List I}$ with $\text{List II}$ Let $R_1=\{(1,2), (2,2), (3,3)\}$ and $R_2=\{(1,1), (1,2), (1,3), (1,4)\}$ ... given below: $A-I, B-II, C-IV, D-III$ $A-I, B-IV, C-III, D-II$ $A-I, B-III, C-II, D-IV$ $A-I, B-IV, C-II, D-III$

Match $\text{List I}$ with $\text{List II}$ Let $R_1=\{(1,2), (2,2), (3,3)\}$ and $R_2=\{(1,1), (1,2), (1,3), (1,4)\}$ ... answer from the options given below: $A-I, B-II, C-IV, D-III$ $A-I, B-IV, C-III, D-II$ $A-I, B-III, C-II, D-IV$ $A-I, B-IV, C-II, D-III$

answered 2 days ago in Unknown Category himanshu2021 7 views

0 votes

1 answer

34

UGCNET-Oct2020-II: 67
Match $\text{List I}$ with $\text{List II}$ Choose the correct answer from the options given below: $A-II, B-IV, C-III, D-I$ $A-IV, B-I, C-II, D-III$ $A-II, B-I, C-IV, D-III$ $A-III, B-IV, C-I, D-II$

Match $\text{List I}$ with $\text{List II}$ Choose the correct answer from the options given below: $A-II, B-IV, C-III, D-I$ $A-IV, B-I, C-II, D-III$ $A-II, B-I, C-IV, D-III$ $A-III, B-IV, C-I, D-II$

answered 2 days ago in Unknown Category himanshu2021 5 views

0 votes

1 answer

35

UGCNET-Oct2020-II: 70
Match $\text{list I}$ with $\text{List II}$ ... $A-III, B-I, C-IV, D-II$ $A-III, B-I, C-II, D-IV$ $A-I, B-III, C-II, D-IV$

Match $\text{list I}$ with $\text{List II}$ ... : $A-I, B-III, C-IV, D-II$ $A-III, B-I, C-IV, D-II$ $A-III, B-I, C-II, D-IV$ $A-I, B-III, C-II, D-IV$

answered 2 days ago in Unknown Category himanshu2021 7 views

0 votes

1 answer

36

UGCNET-Oct2020-II: 43
Which of the following statements with respect to $K$-segment pipelining are true? Maximum speedup that a pipeline can provide is $k$ theoretically It is impossible to achieve maximum speed up $k$ in $k$-segment pipeline All segments in pipeline take same time in computation Choose the correct answer ... $(b)$ and $(c)$ only $(a)$ and $(c)$ only $(a), (b)$ and $(c)$

Which of the following statements with respect to $K$-segment pipelining are true? Maximum speedup that a pipeline can provide is $k$ theoretically It is impossible to achieve maximum speed up $k$ in $k$-segment pipeline All segments in pipeline take same time in computation Choose the correct answer from the options ... $(b)$ and $(c)$ only $(a)$ and $(c)$ only $(a), (b)$ and $(c)$

answered 3 days ago in Unknown Category Sanjay Sharma 8 views

0 votes

1 answer

37

UGCNET-Oct2020-II: 33
Protocols in which the sender sends one frame and then waits for an acknowledgment before proceeding for next frame are called as ______ Simplex protocols Unrestricted simplex protocols Simplex stop and wait protocols Restricted simplex protocols

Protocols in which the sender sends one frame and then waits for an acknowledgment before proceeding for next frame are called as ______ Simplex protocols Unrestricted simplex protocols Simplex stop and wait protocols Restricted simplex protocols

answered 3 days ago in Unknown Category Sanjay Sharma 8 views

0 votes

1 answer

38

UGCNET-Oct2020-II: 40
Consider the following argument with premise $\forall _x (P(x) \vee Q(x))$ and conclusion $(\forall _x P(x)) \wedge (\forall _x Q(x))$ ... Steps $(C)$ and $(E)$ are not correct inferences Steps $(D)$ and $(F)$ are not correct inferences Step $(G)$ is not a correct inference

Consider the following argument with premise $\forall _x (P(x) \vee Q(x))$ and conclusion $(\forall _x P(x)) \wedge (\forall _x Q(x))$ ... valid argument Steps $(C)$ and $(E)$ are not correct inferences Steps $(D)$ and $(F)$ are not correct inferences Step $(G)$ is not a correct inference

answered 3 days ago in Unknown Category Sanjay Sharma 6 views

0 votes

1 answer

39

UGCNET-Oct2020-II: 39
Consider the following properties: Reflexive Antisymmetric Symmetric Let $A=\{a,b,c,d,e,f,g\}$ and $R=\{(a,a), (b,b), (c,d), (c,g), (d,g), (e,e), (f,f), (g,g)\}$ be a relation on $A$. Which of the following property (properties) is (are) satisfied by the relation $R$? Only $a$ Only $c$ Both $a$ and $b$ $b$ and not $a$

Consider the following properties: Reflexive Antisymmetric Symmetric Let $A=\{a,b,c,d,e,f,g\}$ and $R=\{(a,a), (b,b), (c,d), (c,g), (d,g), (e,e), (f,f), (g,g)\}$ be a relation on $A$. Which of the following property (properties) is (are) satisfied by the relation $R$? Only $a$ Only $c$ Both $a$ and $b$ $b$ and not $a$

answered 3 days ago in Unknown Category Sanjay Sharma 9 views

0 votes

1 answer

40

UGCNET-Oct2020-II: 27
Consider $L=L_1 \cap L_2$ where $L_1 = \{ 0^m 1^m 20^n 1^n \mid m,n \geq 0 \}$ $L_2 = \{0^m1^n2^k \mid m,n,k \geq 0 \}$ Then, the language $L$ is Recursively enumerable but not context free Regular Context free but not regular Not recursive

Consider $L=L_1 \cap L_2$ where $L_1 = \{ 0^m 1^m 20^n 1^n \mid m,n \geq 0 \}$ $L_2 = \{0^m1^n2^k \mid m,n,k \geq 0 \}$ Then, the language $L$ is Recursively enumerable but not context free Regular Context free but not regular Not recursive

answered 3 days ago in Unknown Category Sanjay Sharma 8 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Subjects

Network Sites

Recent questions and answers in Unknown Category

Log In

Register

Recent Posts

Subjects

Recent Blog Comments

Network Sites

Recent questions and answers in Unknown Category