0% found this document useful (0 votes)
17 views8 pages

NTA NET December 2018 Computer Science Applications Part 1

Uploaded by

abhijeet kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views8 pages

NTA NET December 2018 Computer Science Applications Part 1

Uploaded by

abhijeet kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

7/1/23, 11:54 AM NTA NET December 2018 Computer Science Applications Part 1〰Download All the Papers to Prepare

epare for NET 2023- Examr…

Examrace: Downloaded from examrace.com [https://www.examrace.com/]


For solved question bank visit doorsteptutor.com [https://www.doorsteptutor.com] and for free video
lectures visit Examrace YouTube Channel [https://youtube.com/c/Examrace/]

📣 Paper 3 has been removed from NET from 2018 (Notification [https://www.examrace.com/NTA-
UGC-NET/NTA-UGC-NET-Updates/NEWS-UGC-NET-Exam-Changes-2018.htm])- now paper 2 and 3
syllabus is included in paper 2. Practice both paper 2 and 3 from past papers.

NTA NET December 2018 Computer Science Applications Part


1Download All the Papers to Prepare for NET 2023

Detailed solutions to these questions are available at doorsteptutor.com


[https://www.doorsteptutor.com/Exams/UGC/]

Q-1 The Boolean expression is equivalent to

Options:-

1.

2.

3.

4.

Q-2 Data Scrubbing is

Options:-

1. A process to upgrade the quality of data after it is moved into a data warehouse.

2. A process to reject data from the data warehouse and to create the necessary indexes.

3. A process to load the data in the data warehouse and to create the necessary indexes.

4. A process to upgrade the quality of data before it is moved into a data warehouse.

Q-3 The decimal floating point number -40.1 represented using IEEE-754 32 bit representation and
written in hexadecimal form is

Options:-

1. 0xC2006666

2. 0xC2206666

3. 0xC2006000

4. 0xC2206000

Q-4 Consider the following recursive Java function f that takes two long arguments and returns a float
value:

public static float f (long m, long n)

1 of 8
7/1/23, 11:54 AM NTA NET December 2018 Computer Science Applications Part 1〰Download All the Papers to Prepare for NET 2023- Examr…

float result = (float) m⟋ (float) n;

if (m < 0 || n < 0)

return 0.0f;

else

result += f (m⚹2, n⚹3) ;

return result;

Which of the following integers best approximates the value of f (2,3) ?

Options:-

1. 3

2. 2

3. 0

4. 1

Q-5 Consider the following minimax game tree search

What will be the value propagated at the root?

Options:-

1. 6

2. 3

3. 4

4. 5
2 of 8
7/1/23, 11:54 AM NTA NET December 2018 Computer Science Applications Part 1〰Download All the Papers to Prepare for NET 2023- Examr…

Q-6 Use Dual Simplex Method to solve the following problem:

Maximize z =

Subject to:

Options:-

1.

2.

3.

4.

Q-7 The relation on a Boolean algebra are defined as:

Considering the above definitions, which of the following is not true in the Boolean algebra?

1. If

2.

3.

4.

Choose the correct answer from the code given below:

Options:-

1. (iii) only

2. (ii) and (iii) only

3. (i) and (ii) only

4. (iv) only

Q-8 Consider the midpoint (or Bresenham) algorithm for rasterizing lines given below:

1. Input ) and (

2.

3 of 8
7/1/23, 11:54 AM NTA NET December 2018 Computer Science Applications Part 1〰Download All the Papers to Prepare for NET 2023- Examr…

3. ⟋ ⟋⟋ f is the implicit form of a line⧵

4. for

5. do

6. plot (x, y)

7. if (d < 0)

8. then

9. y = y + 1

10.

11.

12.

13.

14. end

Which statements are true?

P: For a line with slope m > 1, we should change the outer loop in line (4) to be over y.

Q: Lines (10) and (12) update the decision variable d through an incremental evaluation of the line
equation f.

R: The algorithm fails if d is ever 0.

Choose the correct answer from the code given below:

Options:-

1. P, Q and R

2. P only

3. P and Q only

4. Q and R only

Q-9 ________ system call creates new process in Unix.

Options:-

1. Create

2. Fork new

3. Fork

4. Create new

Q-10 Suppose that everyone in a group of N people wants to communicate secretly with (N-1) other
people using symmetric key cryptographic system. The communication between any two persons
should not be decodable by the others in the group. The number of keys required in the system as a
whole to satisfy the confidentiality requirement is
4 of 8
7/1/23, 11:54 AM NTA NET December 2018 Computer Science Applications Part 1〰Download All the Papers to Prepare for NET 2023- Examr…

Options:-

1. 2N

2.

3. N (N-1) ⟋2

4. N (N-1)

Q-11 Software coupling involves dependencies among pieces of software called modules. Which of the
following are correct statements with respect to module coupling?

P: Common coupling occurs when two modules share the same global data.

Q: Control coupling occurs when modules share a composite data structure and use only parts of it.

R: Content coupling occurs when one module modifies or relies on the internal working of another
module.

Choose the correct answer from the code given below:

Options:-

1. P and R only

2. All of P, Q and R

3. Q and R only

4. P and Q only

Q-12 Consider R to be any regular language and be any two context-free languages.

Which one of the following is correct?

Options:-

1. is context free

2. is context free

3. is context free

4. is context free

Q-13 A legacy software system has 940 modules. The latest release required that 90 of these modules
be changed.In addition, 40 new modules were added and 12 old modules were removed.Compute the
software maturity index for the system.

Options:-

1. 0.923

2. 0.725

3. 0.849

4. 0.524

Q-14 Which of the following statements is⟋are true?


5 of 8
7/1/23, 11:54 AM NTA NET December 2018 Computer Science Applications Part 1〰Download All the Papers to Prepare for NET 2023- Examr…

1. Windows XP supports both peer-peer and client-server networks.

2. Windows XP implements Transport protocols as drivers that can be loaded and unloaded form
the system dynamically.

Choose the correct answer from the code given below:

Options:-

1. Both (i) and (ii)

2. Neither (i) nor (ii)

3. (i) only

4. (ii) only

Q-15 In computers, subtraction is generally carried out by

Options:-

1. 1՚s complement

2. 2՚s complement

3. 9՚s complement

4. 10՚s complement

Q-16 Which of the following statements is⟋are true?

1. Facebook has the world՚s largest Hadoop Cluster.

2. Hadoop 2.0 allows live stream processing of Real time data.

Choose the correct answer from the code given below:

Options:-

1. (i) only

2. Both (i) and (ii)

3. (ii) only

4. Neither (i) nor (ii)

Q-17 Which of the following statements is⟋are true?

1. Firewalls can screen traffic going into or out of an organization.

2. Virtual private networks can simulate an old leased network to provide certain desirable
properties.

Choose the correct answer from the code given below:

Options:-

1. (i) only

2. Neither (i) nor (ii)

6 of 8
7/1/23, 11:54 AM NTA NET December 2018 Computer Science Applications Part 1〰Download All the Papers to Prepare for NET 2023- Examr…

3. (ii) only

4. Both (i) and (ii)

Q-18 Match each UML diagram in List I to its appropriate description in List II.

List I List II

1. State Described how the external entities (people, devices) can interact with the
Diagram system.

Use-Case
Used to describe the static or structural view of a system.
Diagram

Class Used to show the flow of a business process, the steps of a use-case or the logic
Diagram of object behaviour.

Activity Used to describe the dynamic behaviour of objects and could also be used to
Diagram describe the entire system behaviour.

Table Supporting: NTA NET December 2018 Computer Science Applications Part 1Download All the Papers to Prepare for NET 2023

Options:-

1. (a) - (i) , (b) - (iv) , (c) - (ii) , (d) - (iii)

2. (a) - (i) , (b) - (iv) , (c) - (iii) , (d) - (ii)

3. (a) - (iv) , (b) - (i) , (c) - (ii) , (d) - (iii)

4. (a) - (iv) , (b) - (ii) , (c) - (i) , (d) - (iii)

Q-19 Consider a singly linked list. What is the worst case time complexity of the best-known algorithm
to delete the node a, pointer to this node is q, form the list?

Options:-

1. O (n lg n)

2. O (lg n)

3. O (1)

4. O (n)
⚹ ⚹ and
Q-20 Let ⚹ be three regular expressions. Consider the following:

1.

2.

Choose the correct answer from the code given below:

Options:-
7 of 8
7/1/23, 11:54 AM NTA NET December 2018 Computer Science Applications Part 1〰Download All the Papers to Prepare for NET 2023- Examr…

1. Neither (i) nor (ii) is correct.

2. Both (i) and (ii) are correct.

3. Only (i) is correct.

4. Only (ii) is correct.

8 of 8

You might also like