Register

NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 12
closed

• closed by
262 views
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
admin asked Apr 1, 2020
983 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 11
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel? $16.15$ kbps $23.24$ kbps $40.12$ kbps $24.74$ kbps
If the channel is band limited to $6\;kHz$ and signal to noise ratio is $16,$ what would be the capacity of channel?$16.15$ kbps$23.24$ kbps$40.12$ kbps$24.74$ kbps
User Avatar
1 votes
1 votes
2 answers
2
admin asked Apr 1, 2020
3,717 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 12
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations? $O(n),O(n)$ $O(n),O(1)$ $O(1),O(n)$ $O(1),O(1)$
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$
User Avatar
0 votes
0 votes
1 answer
4
admin asked Apr 1, 2020
933 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 2
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is$max(f(n),g(n))$$min(f(n),g(n))$$f(n) + ...
User Avatar
Link Copied!