NTANET (Based on NTAUGC) Computer Science (PaperII): Questions 893  897 of 2012
Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exampattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.
Rs. 550.00 or
How to register?
Question number: 893
» Networks, Virtualization, & Cloud Computing » Network Fundamentals » Local Area Networks (LAN)
Appeared in Year: 2017
Question
The number of bits used for addressing in Gigabit Ethernet is ________. (November Paper II)
Choices
Choice (4)  Response  

a.  128 bits 

b.  48 bits 

c.  64 bits 

d.  32 bits 

Question number: 894
» Discrete Mathematics » Prepositional Logic
Appeared in Year: 2017
Question
The first order logic (FOL) statement is equivalent to which of the following? (January Paper III)
Choices
Choice (4)  Response  

a. 


b. 


c. 


d. 


Question number: 895
» Analysis and Design of Algorithms » Introduction, Types, & Design of Algorithms
Appeared in Year: 2017
Question
Dijkstra’s algorithm is based on (January Paper III)
Choices
Choice (4)  Response  

a.  Divide and conquer paradigm 

b.  Dynamic programming 

c.  Backtracking paradigm 

d.  Greedy Approach 

Question number: 896
» Analysis and Design of Algorithms » Analysis of Algorithms
Appeared in Year: 2016
Question
The following numbers are inserted into an empty binary search tree in the given order:
What is the height of the binary search tree? (November Paper II)
Choices
Choice (4)  Response  

a.  5 

b.  3 

c.  4 

d.  6 

Question number: 897
» Operating Systems with Unix » Memory Management » Paging, Segmentation,Page Fault
Appeared in Year: 2017
Question
In a paging system, it takes 30 ns to search translation Lookaside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is: (January paper II)
Choices
Choice (4)  Response  

a.  120ns 

b.  84ns 

c.  48ns 

d.  147ns 
