Introduction
In India, the UGC NET Exam is a very popular exam for people who want to pursue a career in research. Previous Year Questions are a great way to get a feel for the exam format. You will gain a fundamental understanding of your preparedness by completing the PYQs. You can assess your weak areas and practice on them to improve your exam performance. We have included the UGC NET 2017 January Paper-III next 25 questions in this blog. We've also thoroughly detailed each problem to aid your learning.You can check out the first 25 questions in Jan 2017 Paper III - Part 1 .
Question 26 to 50
1. Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is
(1) 20
(2) 10
(3) 30
(4) 40
Answer: 2
Explanation:
Bottleneck bandwidth = 64 kbps=64x103 bps
Round trip delay = 40 ms =40x10^{-3} sec
Total data 40×64×10^{3}×10^{-3}bits=40×648bytes=320bytes
1 packet size = 32 byte
No. of packets 320/32 = 10
2. Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be:
(1) (1+x) is factor of G(x)
(2) (1-x) is factor of G(x)
(3) (1+x2) is factor of G(x)
(4) x is a factor of G(x)
Answer: 1
Explanation:
In this case polynomial generator should satisfy
(A) Polynomial generated shouldn’t be divisible by x
(B) It should be divisible by 1 + x i.e 1 + x is a factor of polynomial
3. In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is ................
(1) 2 bytes
(2) 1 byte
(3) 4 bytes
(4) 5 bytes
Answer: 4
Explanation:
There are 24 packets and 48 bytes of data, So 48 / 24 = 2-byte data for each packet.
Header size is 3 byte
2 + 3 = 5 bytes will be the size of the data packet.
4. In RSA public key cryptosystem suppose n=p*q where p and q are primes. (e,n) and (d,n) are public and private keys respectively. Let M be an integer such that 0<M<n and ɸ(n)=(p-1)(q-1).
Which of the following equations represent RSA public key cryptosystem?
I. C≡Me (mod n), M≡(C)d(mod n)
II. ed≡1(mod n)
III. ed≡(mod ɸ(n))
IV. C≡Me (mod ɸn), M≡Cd(mod ɸn)
Codes:
(1) I and II
(2) I and III
(3) II and III
(4) I and IV
Answer: 2
Explanation:
Comparing it with RSA algorithm , I and III is correct ahere...see the example
Choose p = 3 and q = 11
Compute n = p * q = 3 * 11 = 33
Compute φ(n) = (p - 1) * (q - 1) = 2 * 10 = 20
Choose e such that 1 < e < φ(n) and e and n are coprime. Let e = 7
Compute a value for d such that (d * e) % φ(n) = 1. One solution is d = 3 [(3 * 7) % 20 = 1]
Public key is (e, n) => (7, 33)
Private key is (d, n) => (3, 33)
The encryption of m = 2 is c = 2^{7} % 33 = 29
The decryption of c = 29 is m = 29^{3} % 33 = 2
Hence 2 is correct answer here
5. A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum
duration taken by X to transmit at full rate of 10 Mbps is ............ secs.
(1) 1
(2) 2
(3) 3
(4) 4
Answer: 2
Explanation:
Maximum duration taken by X for transmission = b / (M - r)
i.e. = 16 / (10 - 2)
= 2 seconds
You can also check about Java Tokens here.
6. The asymptotic upper bound solution of the recurrence relation given by
T(n)= 2T(n/2)+n/log n is:
(1) O(n2)
(2) O(n log n)
(3) O(n log log n)
(4) O(log log n)
Answer: 3
Explanation:
by master's theorem. A = 2, B = 2 and K =1 and P = -1.
As a = bk and p = -1
Hence answer is 3
7. Any decision tree that sorts n elements has height ..............
(1) Ω(log n)
(2) Ω(n)
(3) Ω(n log n)
(4) Ω(n2)
Answer: 3
Explanation:
Any decision tree that sorts n elements has height Omega(n log n).
8. Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case.
(1) O(1)
(2) O(log n)
(3) O(n)
(4) O(n log n)
Answer: 2
Explanation:
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take O(lg n) time in the worst case.
9. The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is <5,10,3,12,5> is
(1) 630
(2) 580
(3) 480
(4) 405
Answer: 4
Explanation:
If A1=5*10
A2=10*3
A3=3*12
A4=12*5
((A1 A2)(A3 A4))=405 which is minimum
10. Dijkstra’s algorithm is based on
(1) Divide and conquer paradigm
(2) Dynamic Programming
(3) Greedy Approach
(4) Backtracking paradigm
Answer: 3
Explanation:
Dijkstra’s algorithm is based on Greedy Approach.
11. Match the following with respect to algorithm paradigms:
List-I List-II
a. Merge sort i. Dynamic Programming
b. Huffman coding ii. Greedy approach
c. Optimal polygon triangulation iii. Divide and conquer
d. Subset sum problem iv. Back tracking
Codes:
a b c d
(1) iii i ii iv
(2) ii i iv iii
(3) ii i iii iv
(4) iii ii i iv
Answer: 4
Explanation:
- Merge sort is a Divide and conquer algorithm
- Huffman coding is a Greedy approach
- Optimal polygon triangulation is Dynamic programming algorithm
- Subset sum problem is a Back tracking algorithm
12. Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements?
I. Abstraction allows us to focus on what something does without considering the complexities of how it works.
II. Encapsulation allows us to consider complex ideas while ignoring irrelevant detail that would confuse us.
(1) Neither I nor II is correct.
(2) Both I and II are correct.
(3) Only II is correct.
(4) Only I is correct
Answer: 1
Explanation:
Encapsulation allows us to focus on what something does without considering the complexities of how it works.
Abstraction allows us to consider complex ideas while ignoring irrelevant detail that would confuse us.
13. Given the array of integers ‘array’ shown below:
What is the output of the following JAVA statements?
int [ ] p = new int [10];
int [ ] q = new int [10];
for (int k = 0; k < 10; k ++)
p[k] = array [k];
q = p;
p[4] = 20;
System.out.println(array [4] + “:” + q[4]);
(1) 20:20
(2) 18:18
(3) 18:20
(4) 20:18
Answer: 3
Explanation:
for (int k = 0; k < 10; k ++)
p[k] = array [k];
in this loop we are copying all the values from the array to the array P
now
Q=p
Q is pointing P
now p[4]=20
but Q contains the old P array where in 4 th index i.e Q[4] is is also 20(as the location is updated by the previous P )
Note: here pointer is involved, so the location is being updated,so Q is getting 20 here.
but the question is about array[4] which was initial array,so value 18
so the answer is 18:20
14. Consider the following JAVA program:
public class First { public static int CBSE (int x) { if (x < 100) x = CBSE (x +10); return (x - 1); } public static void main (String[] args){ System.out.print(First.CBSE(60)); } } |
What does this program print?
(1) 59
(2) 95
(3) 69
(4) 99
Answer: 2
15. Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE?
I. An abstract class is one that is not used to create objects.
II. An abstract class is designed only to act as a base class to be inherited by other classes.
(1) Only l
(2) Only II
(3) Neither I nor II
(4) Both l and II
Answer: 4
Explanation:
A class that is declared as abstract is known as abstract class. It needs to be extended and its method implemented. It cannot be instantiated.
An abstract class is designed only to act as a base class to be inherited by other classes.It is a design concept in program development and provides a base upon which other classes can be built.
16. Which of the following HTML code will affect the vertical alignment of the table content?
(1) <td style = “vertical-align : middle”>Text Here</td>
(2) <td valign = “centre”>Text Here</td>
(3) <td style = “text-align : center”>Text Here</td>
(4) <td align = “middle”>Text Here</td>
Answer: 1
Explanation:
When used in table cells, vertical-align does what most people expect it to, which is mimic the (old, deprecated) valign attribute. In a modern, standards-compliant browser, the following three code snippets do the same thing:
<td valign="middle"> <!-- but you shouldn't ever use valign --> </td> <td style="vertical-align:middle"> ... </td> <div style="display:table-cell; vertical-align:middle"> ... </div> |
17. What can you say about the following statements?
I. XML tags are case-insensitive.
II. In JavaScript, identifier names are case-sensitive.
III. Cascading Style Sheets (CSS) cannot be used with XML.
IV. All well-formed XML documents must contain a document type definition.
(1) only I and II are false.
(2) only III and IV are false.
(3) only I and III are false.
(4) all are incorrect.
Answer: 4
Explanation:
XML tags are case-sensitive. So, option I is false.
In JavaScript, identifier names are case-insensitive.
Cascading Style Sheets (CSS) can be used with XML.
It is not necessary that all well-formed XML documents must contain a document type definition.
All statements are incorrect.
18. Which of the following statement(s) is/are TRUE with regard to software testing?
I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance.
II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived.
(1) only I
(2) only II
(3) both I and II
(4) neither I nor II
Answer: 1
Explanation:
Regression testing technique ensures that the software product runs correctly after the changes during maintenance. This statement is correct regarding to Regression testing.
Equivalence partitioning is not a white-box testing technique it is a black box testing, in this testing code is not visible to tester and we can divide the condition into partition and it will considered to be same.
I statement is correct but II is not.
19. Which of the following are facts about a top-down software testing approach?
I. Top-down testing typically requires the tester to build method stubs.
II. Top-down testing typically requires the tester to build test drivers.
(1) only I
(2) Only II
(3) Both I and II
(4) Neither I nor II
Answer: 1
Explanation:
Top-down testing typically requires the tester to build method stubs but it doesn’t requires the tester to build test drivers.
Option I is correct but II is not correct regarding to Top-down Testing.
20. Match the terms related to Software Configuration Management (SCM) in List-I with the descriptions in List-II.
List-1 List-II
I. Version A. An instance of a system that is
distributed to customers.
II. Release B. An instance of a system which
is functionally identical to other
instances, but designed for different
hardware/software configurations.
III. Variant C. An instance of a system that differs,
in some way, from other instances.
Codes:
I II III
(1) B C A
(2) C A B
(3) C B A
(4) B A C
Answer: 2
Explanation:
- Version is an instance of a system that differs, in some way, from other instances.
- Release is an instance of a system that is distributed to customers.
- Variant is an instance of a system which is functionally identical to other instances, but designed for different hardware/software configurations.
21. A software project was estimated at 352 Function Points (FP). A four person team will be assigned to this project consisting of an architect, two programmers, and a tester. The salary of the architect is Rs.80,000 per month, the programmer Rs.60,000 per month and the tester Rs.50,000 per month. The average productivity for the team is 8 FP per person month. Which of the following represents the projected cost of the project?
(1) Rs.28,16,000
(2) Rs.20,90,000
(3) Rs.26,95,000
(4) Rs.27,50,000
Answer: 4
Explanation:
Total 352 FP
avg 8 FP per person per month
total 4 person.
so 352/(8*4) =11
now,
(1 architect+2 programmer+1 tester)* 11 = (80000+2*60000+50000)*11=2750000
22. Complete each of the following sentences in List-I on the left hand side by filling in the word or phrase from the List-II on the right hand side that best completes the sentence:
List-I List-II
I. Determining whether you
have built the right system
is called ............. A. Software testing
II. Determining whether you
have built the system right
is called ......... B. Software verification
III. ............ is the process of
demonstrating the existence
of defects or providing
confidence that they do not
appear to be present. C. Software debugging
IV. .......... is the process of
discovering the cause of a
defect and fixing it. D. Software validation
Codes:
I II III IV
(1) B D A C
(2) B D C A
(3) D B C A
(4) D B A C
Answer: 4
Explanation:
- Determining whether you have built the right system is called Software validation
- Determining whether you have built the system right is called Software verification
- Software testing is the process of demonstrating the existence of defects or providing confidence that they do not appear to be present.
- Software debugging is the process of discovering the cause of a defect and fixing it
23. A software company needs to develop a project that is estimated as 1000 function points and is planning to use JAVA as the programming language whose approximate lines of code per function point is accepted as 50. Considering a=1.4 as multiplicative factor, b=1.0 as exponention factor for the basic COCOMO effort equation and c=3.0 as multiplicative factor, d=0.33 as exponention factor for the basic COCOMO duration equation, approximately how long does the project take to complete?
(1) 11.2 months
(2) 12.2 months
(3) 13.2 months
(4) 10.2 months
Answer: 2
Explanation:
In basic COCOMO we know that:
E effort = a(KLOC)^{b}
According to given data
a = 1.4 b = 1.0 total loc = 1000x50 = 50000 = 50 KLOC.
E effort = 1.4(50)1
= 70
Development time = c(E)d
it is given that c = 3 and d = 0.33
So, Development time = 3(70)0.33
i.e. = 12.18 months.
24. A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively:
(1) 14 and 15
(2) 14 and 29
(3) 15 and 14
(4) 16 and 32
Answer: 3
Explanation:
we know, Number of page =Virtual adress space / Page size
so virtual address space=Number of page*page size
=2^{6}*2^{9}=2^{15}
so we need 15 bit for VA
and Physical dress=Page size*frames =2^{9}*2^{5}=2^{14}
so 14 bit required for PA
25. Consider a disk queue with I/O requests on the following cylinders in their arriving order:
6,10,12,54,97,73,128,15,44,110,34,45
The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. The total number of cylinders in the disk is 150. The disk head movement using the SCAN-scheduling algorithm is:
(1) 172
(2) 173
(3) 227
(4) 228
Answer: 151 (All options Incorrect)
Explanation:
The question says, the total number of cylinders in the disk = 150.
Let's say - 1 to 150
Now initially it is serving at = 23.
So, total head movement= [23 to 1] +[ 1 to 128]
= 22 + 127 = 149 ??
If it starts from 0 to 149 ,
So, total head movement= [23 to 0] +[ 0 to 128]
= 23 + 128 = 151 ??