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

A network with bandwidth of $10$ Mbps can pass only an average of $12000$ frames per minute with each frame carrying an average of $10000$ bits. What is the throughput of this network?

Solution

Throughput means actual data transferred per second.

Given,

Number of frames per minute $=12000$

Bits per frame $=10000$

Total bits per minute:

$12000\times 10000=120000000$

Now convert into bits per second:

$\dfrac{120000000}{60}=2000000\ bps$

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

Nearest first
1
Piconet is a basic unit of a bluetooth system consisting of $...............$ master node and up to $...............$ a…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
Consider a subnet with $720$ routers. If a three-level hierarchy is chosen, with eight clusters, each containing $9$ re…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
Which of the following class of IP address has the last address as $223.255.255.255$?
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
 Let $A={001,0011,11,101}$ and $B={01,111,111,010}$. Similarly, let $C={00,001,1000}$ and $D={0,11,011}$. Which of…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
Consider the following statements: $S_1:$ There exists no algorithm for deciding if any two Turing machines $M_1$ and $…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
 Consider the following language families: $L_1\equiv$ The context-free languages $L_2\equiv$ The context-sensitiv…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
Let $G=(V,T,S,P)$ be any context-free grammar without any $\lambda$-productions or unit productions. Let $K$ be the max…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
Consider the following languages: $L_1={a^n b^n c^m}\cup{a^n b^m c^m},\ n,m\ge 0$ $L_2={ww^R\mid w\in{a,b}^*}$ where $R…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
Consider the following statements with respect to the language $L={a^n b^n\mid n\ge 0}$ $S_1:L^2$ is context free langu…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
Consider $\Sigma={w,x}$ and $T={x,y,z}$. Define homomorphism $h$ by: $h(x)=xzy$ $h(w)=zxyy$ If $L$ is the regular langu…
Topic: UGC NET Computer Science Dec 2019 (Paper II)

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

Ascending by ID
1
 The full form of ICANN is:
Topic: UGC NET Computer Science Dec 2019 (Paper II)
2
According to Dempster-Shafer theory for uncertainty management, where $Bel(A)$ denotes belief of event $A$.
Topic: UGC NET Computer Science Dec 2019 (Paper II)
3
Consider the following statements: $S_1:\forall xP(x)\vee \forall xQ(x)$ and $\forall x(P(x)\vee Q(x))$ are not logical…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
4
Consider the game tree given below.Here $\circ$ and $\square$ represent MIN and MAX nodes respectively. The value of th…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
5
Consider the following models: $M_1:$ Mamdani model $M_2:$ Takagi-Sugeno-Kang model $M_3:$ Kosko's additive model $($SA…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
6
A fuzzy conjunction operator $t(x,y)$ and a fuzzy disjunction operator $s(x,y)$ form a pair if they satisfy: $t(x,y)=1-…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
7
Let $W_{ij}$ represents weight between node $i$ at layer $k$ and node $j$ at layer $(k-1)$ of a given multilayer percep…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
8
The order of schema $?10?101?$ and $???0??1$ are $...............$ and $...............$ respectively.
Topic: UGC NET Computer Science Dec 2019 (Paper II)
9
. Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength of fitn…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
10
Consider the following statements: $S_1:$ If a group $(G,*)$ is of order $n$, and $a\in G$ is such that $a^m=e$ for som…
Topic: UGC NET Computer Science Dec 2019 (Paper II)
Ask Your Question or Put Your Review.

loading...