Recent questions and answers in Others

0 votes

2 answers

1

TIFR2021-B: 10
Let $G$ be a connected bipartite simple graph (i.e., no parallel edges) with distinct edge weights. Which of the following statements on $\text{MST}$ (minimum spanning tree) need $\text{NOT}$ be true? $G$ has a unique $\text{MST}$. Every $\text{MST}$ in ... lightest edge. Every $\text{MST}$ in $G$ contains the third lightest edge. No $\text{MST}$ in $G$ contains the heaviest edge.

Let $G$ be a connected bipartite simple graph (i.e., no parallel edges) with distinct edge weights. Which of the following statements on $\text{MST}$ (minimum spanning tree) need $\text{NOT}$ be true? $G$ has a unique $\text{MST}$. Every $\text{MST}$ in $G$ ... the second lightest edge. Every $\text{MST}$ in $G$ contains the third lightest edge. No $\text{MST}$ in $G$ contains the heaviest edge.

answered 13 hours ago in Others asqwer 61 views

2 votes

1 answer

2

#preparation advice #Gate2019
Hi , I need a suggestion from those who got decent rank while studying in m.tech first year at nits/iits. This year I have prepared well but dint get much time to practice. So,I am planning to join m.tech and will appear next time with better ... , Is this possible to give that much time if i join m.tech? And what about the course load there for first two semesters?

Hi , I need a suggestion from those who got decent rank while studying in m.tech first year at nits/iits. This year I have prepared well but dint get much time to practice. So,I am planning to join m.tech and will appear next time with better preparation. So, Is this possible to give that much time if i join m.tech? And what about the course load there for first two semesters?

answered 13 hours ago in Others asqwer 267 views

0 votes

5 answers

3

UGCNET-Dec2019-II: 3
The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$

The Boolean expression $AB+A \overline{B}+\overline{A}C+AC$ is unaffected by the value of the Boolean variable _________. $A$ $B$ $C$ $A, B$ and $C$

answered 1 day ago in Others Nilesh_01 244 views

1 vote

2 answers

4

UGCNET-Dec2019-II: 1
A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent

A basic feasible solution of an $m \times n$ transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocation in ______ positions. $m+n+1$, independent $m+n-1$, independent $m+n-1$, appropriate $m-n+1$, independent

answered 4 days ago in Others Manokirish 351 views

0 votes

1 answer

5

UGCNET-Dec2019-II: 15
Let $A$ be the base class in $\text{C++}$ and $B$ be the derived class from $A$ with protected inheritance. Which of the following statement is false for class $B$? Member function of class $B$ can access protected data of class $A$ Member ... $B$ cannot access private data of class $A$ Object of derived class $B$ can access public base class data

Let $A$ be the base class in $\text{C++}$ and $B$ be the derived class from $A$ with protected inheritance. Which of the following statement is false for class $B$? Member function of class $B$ can access protected data of class $A$ ... $A$ Member function of class $B$ cannot access private data of class $A$ Object of derived class $B$ can access public base class data

answered Jun 30 in Others august54 61 views

0 votes

1 answer

6

UGCNET-Dec2019-II: 55
Piconet is a basic unit of a bluetooth system consisting of __________ master node and up to _________ active slave nodes. one, five one, seven two, eight one, eight

Piconet is a basic unit of a bluetooth system consisting of __________ master node and up to _________ active slave nodes. one, five one, seven two, eight one, eight

answered Jun 29 in Others Shubham Sulakhe 24 views

1 vote

2 answers

7

December_2007_II
Let e: B˄m→B˄n be a group code. The minimum distance of ‘e’ is equal to: (A) the maximum weight of a non zero code word (B) the minimum weight of a non zero code word (C) m (D) n

Let e: B˄m→B˄n be a group code. The minimum distance of ‘e’ is equal to: (A) the maximum weight of a non zero code word (B) the minimum weight of a non zero code word (C) m (D) n

answered Jun 24 in Others Manokirish 619 views

0 votes

1 answer

8

UGCNET-Dec2019-II: 72
Which of the following are legal statements in $C$ programming language? int *P=&44; int *P=&r; int P=&a; int P=a; Choose the correct option: (a) and (b) (b) and (c) (b) and (d) (a) and (d)

Which of the following are legal statements in $C$ programming language? int *P=&44; int *P=&r; int P=&a; int P=a; Choose the correct option: (a) and (b) (b) and (c) (b) and (d) (a) and (d)

answered Jun 24 in Others aryavart 23 views

0 votes

1 answer

9

UGCNET-Dec2005-II: 8
Consider the following sequence of instructions : $a= a \oplus b, b= a \oplus b, a= b \oplus a$ This Sequence retains the value of the $a$ and $b$ complements the value of $a$ and $b$ swap $a$ and $b$ negates values of $a$ and $b$

Consider the following sequence of instructions : $a= a \oplus b, b= a \oplus b, a= b \oplus a$ This Sequence retains the value of the $a$ and $b$ complements the value of $a$ and $b$ swap $a$ and $b$ negates values of $a$ and $b$

answered Jun 15 in Others Jagat_Jyoti 126 views

0 votes

1 answer

10

UGCNET-Dec2019-II: 37
What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be accomodated. $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(1), \theta(1)$ $\theta(n), \theta(n)$

What is the worst case running time of Insert and Extract-min, in an implementation of a priority queue using an unsorted array? Assume that all the insertions can be accomodated. $\theta(1), \theta(n)$ $\theta(n), \theta(1)$ $\theta(1), \theta(1)$ $\theta(n), \theta(n)$

answered Jun 12 in Others Snorlax 27 views

0 votes

1 answer

11

UGCNET-Dec2019-II: 32
Java Virtual Machine $\text{(JVM)}$ is used to execute architectural neutral byte code. Which of the following is needed by the $\text{JVM}$ for execution of Java Code? Class loader only Class loader and Java Interpreter Class loader, Java Interpreter and $\text{API}$ Java Interpreter only

Java Virtual Machine $\text{(JVM)}$ is used to execute architectural neutral byte code. Which of the following is needed by the $\text{JVM}$ for execution of Java Code? Class loader only Class loader and Java Interpreter Class loader, Java Interpreter and $\text{API}$ Java Interpreter only

answered Jun 12 in Others Snorlax 26 views

0 votes

1 answer

12

UGCNET-Dec2019-II: 26
Which of the following $\text{CPU}$ scheduling algorithms is/are supported by $\text{LINUX}$ operating system? Non-preemptive priority scheduling Preemptive priority scheduling and time sharing $\text{CPU}$ scheduling Time sharing scheduling only Priority scheduling only

Which of the following $\text{CPU}$ scheduling algorithms is/are supported by $\text{LINUX}$ operating system? Non-preemptive priority scheduling Preemptive priority scheduling and time sharing $\text{CPU}$ scheduling Time sharing scheduling only Priority scheduling only

answered Jun 11 in Others blackvivek 31 views

0 votes

1 answer

13

UGCNET-Dec2019-II: 25
Which of the following is not needed by an encryption algorithm used in Cryptography? $\text{KEY}$ Message Ciphertext User details

Which of the following is not needed by an encryption algorithm used in Cryptography? $\text{KEY}$ Message Ciphertext User details

answered Jun 7 in Others vivek9837 31 views

1 vote

1 answer

14

UGCNET-Dec2019-II: 4
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $(z^+, / )$? $\text{A(GLB - 3, LUB - 36); B(GLB - 1, LUB - 20)}$ ... $\text{A(GLB - 1, LUB - 36); B(GLB - 2, LUB - 20)}$ $\text{A(GLB - 1, LUB - 12); B(GLB - 2, LUB - 10)}$

What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $(z^+, / )$? $\text{A(GLB – 3, LUB – 36); B(GLB – 1, LUB – 20)}$ $\text{A(GLB – 3, LUB – 12); B(GLB – 1, LUB – 10)}$ $\text{A(GLB – 1, LUB – 36); B(GLB – 2, LUB – 20)}$ $\text{A(GLB – 1, LUB – 12); B(GLB – 2, LUB – 10)}$

answered Jun 7 in Others mockingmoon 116 views

0 votes

2 answers

15

UGCNET-Dec2019-II: 16
Which tag is used to enclose any number of javascript statements in HTML document? <code> <script> <title> <body>

Which tag is used to enclose any number of javascript statements in HTML document? <code> <script> <title> <body>

answered Jun 4 in Others dexter_n 42 views

0 votes

1 answer

16

UGCNET-Dec2019-II: 20
Which of the component module of $\text{DBMS}$ does rearrangement and possible ordering of operations, eliminate redundancy in query and use efficient algorithms and indexes during the execution of a query? query compiler query optimizer Stored data manager Database processor

Which of the component module of $\text{DBMS}$ does rearrangement and possible ordering of operations, eliminate redundancy in query and use efficient algorithms and indexes during the execution of a query? query compiler query optimizer Stored data manager Database processor

answered Jun 4 in Others dexter_n 55 views

1 vote

1 answer

17

UGCNET-Dec2019-II: 5
Let $P$ be the set of all people. Let $R$ be a binary relation on $P$ such that $(a, b)$ is in $R$ if $a$ is a brother of $b$. Is $R$ symmetric transitive, an equivalence relation, a partial order relation? $\text{NO, NO, NO, NO}$ $\text{NO, NO, YES, NO}$ $\text{NO, YES, NO, NO}$ $\text{NO, YES, YES, NO}$

Let $P$ be the set of all people. Let $R$ be a binary relation on $P$ such that $(a, b)$ is in $R$ if $a$ is a brother of $b$. Is $R$ symmetric transitive, an equivalence relation, a partial order relation? $\text{NO, NO, NO, NO}$ $\text{NO, NO, YES, NO}$ $\text{NO, YES, NO, NO}$ $\text{NO, YES, YES, NO}$

answered May 30 in Others himanshu2021 68 views

0 votes

2 answers

18

UGCNET-Dec2019-II: 11
A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text{CD}$ for four status bits, branch field $\text{BR}$ having four options used in conjunction with ... $128$ memory words. The size of micro instruction is: $19$ $18$ $17$ $20$

A micro instruction format has microoperation field which is divided into $2$ sunbfields $F1$ and $F2$ , each having $15$ distinct microoperations, condition field $\text{CD}$ for four status bits, branch field $\text{BR}$ having four options used in conjunction with address field $\text{AD}$. The address space is of $128$ memory words. The size of micro instruction is: $19$ $18$ $17$ $20$

answered May 30 in Others himanshu2021 49 views

0 votes

1 answer

19

UGCNET-Dec2019-II: 98
An organization needs to maintain database having five attributes $\textbf{A, B, C, D, E}$. These attributes are functionally dependent on each other for which functionality dependency set $F$ ... in which relation $R$ belong to $1 \text{ NF}$ $2 \text{ NF}$ $3 \text{ NF}$ $\text{BCNF}$

An organization needs to maintain database having five attributes $\textbf{A, B, C, D, E}$. These attributes are functionally dependent on each other for which functionality dependency set $F$ ... normal form in which relation $R$ belong to $1 \text{ NF}$ $2 \text{ NF}$ $3 \text{ NF}$ $\text{BCNF}$

answered May 29 in Others girish13 21 views

2 votes

2 answers

20

UGCNET-Dec2019-II: 8
How many reflexive relations are there on a set with $4$ elements? $2^4$ $2^{12}$ $4^2$ $2$

How many reflexive relations are there on a set with $4$ elements? $2^4$ $2^{12}$ $4^2$ $2$

answered May 21 in Others Sudhanshu10 69 views

0 votes

3 answers

21

UGCNET-Dec2019-II: 14
What is the output of the following $C$ program? # include <stdio.h> main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”, x); } $6$ $5$ $4$ $3$

What is the output of the following $C$ program? # include <stdio.h> main () { int i, j, x=0; for (i=0; i<5; ++i) for (j=0; j<i; ++j) { x+=(i+j-1); break; } printf(“%d”, x); } $6$ $5$ $4$ $3$

answered May 21 in Others Sudhanshu10 109 views

0 votes

3 answers

22

TIFR2021-B: 3
What is the prefix expression corresponding to the expression: $\left ( \left ( 9+8 \right ) \ast 7+\left ( 6\ast \left ( 5+4 \right ) \right )\ast 3\right )+2?$ You may assume that $\ast$ has precedence over $+$? $\ast + +\: 987 \ast \ast \: 6 + + \:5432$ ... $+ + \ast +\: 987 \ast \ast \: 6 + \:5432$ $+ \ast + \ast \: 987+ + \: 6 \ast \:5432$

What is the prefix expression corresponding to the expression: $\left ( \left ( 9+8 \right ) \ast 7+\left ( 6\ast \left ( 5+4 \right ) \right )\ast 3\right )+2?$ You may assume that $\ast$ has precedence over $+$? $\ast + +\: 987 \ast \ast \: 6 + + \:5432$ ... $+ + \ast +\: 987 \ast \ast \: 6 + \:5432$ $+ \ast + \ast \: 987+ + \: 6 \ast \:5432$

answered May 18 in Others Hira Thakur 80 views

0 votes

1 answer

23

UGCNET-Dec2019-II: 30
Given $\text{CPU}$ time slice of $2\text{ms}$ ... average turnaround time and average waiting time using round robin $\text{CPU}$ scheduling? $4, 0$ $5.66, 1.66$ $5.66, 0$ $7, 2$

Given $\text{CPU}$ time slice of $2\text{ms}$ and following list of processes. $\begin{array}{ccc} \text{Process} & \text{Burst time} & \text{Arrival time} \\ & \text{(ms)} \\ p_1 & 3 & 0 \\ p_2 & 4 & 2 \\ p_3 & 5 & 5 \end{array}$ Find average turnaround time and average waiting time using round robin $\text{CPU}$ scheduling? $4, 0$ $5.66, 1.66$ $5.66, 0$ $7, 2$

answered May 18 in Others Hira Thakur 28 views

0 votes

1 answer

24

UGCNET-Dec2019-II: 64
The order of schema $?10?101?$ and $???0??1$ are _______ and _______ respectively. $5,3$ $5,2$ $7,5$ $8,7$

The order of schema $?10?101?$ and $???0??1$ are _______ and _______ respectively. $5,3$ $5,2$ $7,5$ $8,7$

answered May 18 in Others Hira Thakur 36 views

0 votes

1 answer

25

UGCNET-Dec2019-II: 46
Consider $\sum=\{w, x\}$ and $T=\{x, y, z\}$. Define homomorphism $h$ by: $h(x)=xyz$ $h(w)=zxyy$ If $L$ is the regular language denoted by $r=(w+x^*)(ww)^*$, then the regular language $h(L)$ is given by $(z\:x\:yy+x\:z\:y)(z\:x\:yy)$ $\left(zxyy+(xzy)^*\right)(zxyy\:zxyy)$ $(zxyy+xzy)(zxyy)^*$ $\left(zxyy+(xzy)^*\right)(zxyy\:zxyy)$

Consider $\sum=\{w, x\}$ and $T=\{x, y, z\}$. Define homomorphism $h$ by: $h(x)=xyz$ $h(w)=zxyy$ If $L$ is the regular language denoted by $r=(w+x^*)(ww)^*$, then the regular language $h(L)$ is given by $(z\:x\:yy+x\:z\:y)(z\:x\:yy)$ $\left(zxyy+(xzy)^*\right)(zxyy\:zxyy)$ $(zxyy+xzy)(zxyy)^*$ $\left(zxyy+(xzy)^*\right)(zxyy\:zxyy)$

answered May 18 in Others Hira Thakur 30 views

0 votes

1 answer

26

CMI-2018-DataScience-A: 18
Given the following definition of the function $foo$, what does $foo(1037,2)$ return? Note that $a//b$ denotes the quotient (integer part) of $a\div b$, for integers $a$ and $b$. For instance $7//3$ is $2$. function foo(n,d) { x:=0; while(n>=1) { x:=x+1; n:=n//d; } return(x); }

Given the following definition of the function $foo$, what does $foo(1037,2)$ return? Note that $a//b$ denotes the quotient (integer part) of $a\div b$, for integers $a$ and $b$. For instance $7//3$ is $2$. function foo(n,d) { x:=0; while(n>=1) { x:=x+1; n:=n//d; } return(x); }

answered May 17 in Others Hira Thakur 74 views

0 votes

2 answers

27

UGCNET-Dec2019-II: 9
A non-pipelined system takes $\text{30ns}$ to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of $\text{10ns}$. Determine the speed up of the pipeline for $100$ tasks. $3$ $4$ $3.91$ $2.91$

A non-pipelined system takes $\text{30ns}$ to process a task. The same task can be processed in a four-segment pipeline with a clock cycle of $\text{10ns}$. Determine the speed up of the pipeline for $100$ tasks. $3$ $4$ $3.91$ $2.91$

answered May 17 in Others Hira Thakur 81 views

0 votes

2 answers

28

UGCNET-Dec2019-II: 50
Consider the following language families: $L_1 \equiv$ The context-free languages $L_2 \equiv$ The context-sensitive languages $L_3 \equiv$ The recursively enumerable languages $L_4 \equiv$ ... $L_1 \subseteq L_2 \subseteq L_4 \subseteq L_3$ $L_2 \subseteq L_1 \subseteq L_4 \subseteq L_3$

Consider the following language families: $L_1 \equiv$ The context-free languages $L_2 \equiv$ The context-sensitive languages $L_3 \equiv$ The recursively enumerable languages $L_4 \equiv$ ... $L_1 \subseteq L_2 \subseteq L_4 \subseteq L_3$ $L_2 \subseteq L_1 \subseteq L_4 \subseteq L_3$

answered May 17 in Others Hira Thakur 28 views

0 votes

1 answer

29

UGCNET-Dec2019-II: 88
Match $\text{List-I}$ with $\text{List-II}$ ... $\text{(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)}$

Match $\text{List-I}$ with $\text{List-II}$ ... $\text{(a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)}$

answered May 17 in Others Hira Thakur 19 views

0 votes

2 answers

30

UGCNET-Dec2019-I: 32
The term one gigabyte refers to: $1024$ petabytes $1024$ megabytes $1024$ kilobytes $1024$ bytes

The term one gigabyte refers to: $1024$ petabytes $1024$ megabytes $1024$ kilobytes $1024$ bytes

answered May 16 in Others Hira Thakur 56 views

0 votes

1 answer

31

UGCNET-Dec2019-II: 69
Which of the following binary codes for decimal digits are self complementing? $8421$ code $2421$ code excess-$3$ code excess-$3$ gray code Choose the correct option: (a) and (b) (b) and (c) (c) and (d) (d) and (a)

Which of the following binary codes for decimal digits are self complementing? $8421$ code $2421$ code excess-$3$ code excess-$3$ gray code Choose the correct option: (a) and (b) (b) and (c) (c) and (d) (d) and (a)

answered May 16 in Others Hira Thakur 28 views

0 votes

1 answer

32

UGCNET-Dec2019-II: 92
A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: What is the cyclomatic complexity of flowgraph $F$? $2$ $3$ $4$ $5$

A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: What is the cyclomatic complexity of flowgraph $F$? $2$ $3$ $4$ $5$

answered May 16 in Others Hira Thakur 25 views

0 votes

1 answer

33

UGCNET-Dec2019-II: 91
A flow graph $\textsf{F}$ with entry node $(1)$ and exit node $(11)$ is shown below: How many nodes are there in flowgraph $\text{F}$ $9$ $10$ $11$ $12$

A flow graph $\textsf{F}$ with entry node $(1)$ and exit node $(11)$ is shown below: How many nodes are there in flowgraph $\text{F}$ $9$ $10$ $11$ $12$

answered May 16 in Others Hira Thakur 25 views

0 votes

1 answer

34

UGCNET-Dec2019-II: 95
A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: How many predicate nodes are there and what are their names? Three: $(1,(2,3),6)$ Three: $(1,4,6)$ Four: $((2,3), 6, 10, 11)$ Four: $((2,3), 6, 9, 10)$

A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: How many predicate nodes are there and what are their names? Three: $(1,(2,3),6)$ Three: $(1,4,6)$ Four: $((2,3), 6, 10, 11)$ Four: $((2,3), 6, 9, 10)$

answered May 16 in Others Hira Thakur 26 views

0 votes

1 answer

35

UGCNET-Dec2019-II: 93
A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: How many regions are there in flowgraph $F$? $2$ $3$ $4$ $5$

A flow graph $F$ with entry node $(1)$ and exit node $(11)$ is shown below: How many regions are there in flowgraph $F$? $2$ $3$ $4$ $5$

answered May 16 in Others Hira Thakur 23 views

0 votes

1 answer

36

UGCNET-Dec2019-I: 18
The sum of a number and its inverse is $-4$. The sum of their cubes is: $-52$ $52$ $64$ $-64$

The sum of a number and its inverse is $-4$. The sum of their cubes is: $-52$ $52$ $64$ $-64$

answered May 16 in Others Hira Thakur 25 views

0 votes

1 answer

37

UGCNET-Dec2019-I: 33
_________ is a wireless technology built in electronic gadgets for transferring data over short distance WiFi Bluetooth Modem $\text{USB}$

_________ is a wireless technology built in electronic gadgets for transferring data over short distance WiFi Bluetooth Modem $\text{USB}$

answered May 16 in Others Hira Thakur 26 views

0 votes

1 answer

38

UGCNET-Dec2019-I: 16
In a certain coding language, $\text{‘AEIOU’}$ is written as $\text{‘TNHDZ’}$. Using the same coding language, $\text{‘BFJPV’}$ will be written as $\text{UOIEA}$ $\text{AEIOU}$ $\text{CGKQW}$ $\text{WQKGC}$

In a certain coding language, $\text{‘AEIOU’}$ is written as $\text{‘TNHDZ’}$. Using the same coding language, $\text{‘BFJPV’}$ will be written as $\text{UOIEA}$ $\text{AEIOU}$ $\text{CGKQW}$ $\text{WQKGC}$

answered May 16 in Others Hira Thakur 28 views

0 votes

1 answer

39

UGCNET-Dec2019-II: 2
Consider the following Linear programming problem $\text{(LPP)}$: Maximize $z=x_1+x_2$ Subject to the constraints: $x_1+2x_2 \leq 2000 \\ x_1+x_2 \leq 1500 \\ x_2 \leq 600 \\ \text{and } x_1, x_2 \geq 0$ The solution of the above $\text{LPP}$ is $x_1=750, x_2= 750, z=1500$ $x_1=500, x_2= 1000, z=1500$ $x_1=1000, x_2= 500, z=1500$ $x_1=900, x_2= 600, z=1500$

Consider the following Linear programming problem $\text{(LPP)}$: Maximize $z=x_1+x_2$ Subject to the constraints: $x_1+2x_2 \leq 2000 \\ x_1+x_2 \leq 1500 \\ x_2 \leq 600 \\ \text{and } x_1, x_2 \geq 0$ The solution of the above $\text{LPP}$ is $x_1=750, x_2= 750, z=1500$ $x_1=500, x_2= 1000, z=1500$ $x_1=1000, x_2= 500, z=1500$ $x_1=900, x_2= 600, z=1500$

answered May 16 in Others Sathvik 128 views

0 votes

2 answers

40

UGCNET-Dec2019-II: 53
Which of the following class of $\text{IP}$ address has the last address as $223.255.255.255$? Class $A$ Class $B$ Class $C$ Class $D$

Which of the following class of $\text{IP}$ address has the last address as $223.255.255.255$? Class $A$ Class $B$ Class $C$ Class $D$

answered May 16 in Others Hira Thakur 27 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

GO Book for GATECSE 2022

Subjects

Network Sites

Recent questions and answers in Others

Log In

Register

GO Book for GATECSE 2022

Recent Posts

Subjects

Recent Blog Comments

Network Sites

Recent questions and answers in Others