FOR MORE CLASSES, NOTES, PREVIOUS QUESTION PAPER, MOCK TEST

RELATED TO UGC NET COMPUTER SCIENCE…

WHATSAPP ME ON – 9566 190 514

JOIN – NET ASPIRANT ACADEMY - PAPER I – TELEGRAM GROUP

https://t.me/joinchat/TFLwS3tksGobZ9tW

JOIN – NET ASPIRANT ACADEMY – PAPER II – COMPUTER SCIENCE –

TELEGRAM GROUP
https://t.me/joinchat/Gbj3OKVENKsd_HpM

JOIN – NET ASPIRANT ACADEMY – PAPER I - WHATSAPP GROUP

https://chat.whatsapp.com/DFoRePoEXNg2e0knHNcR8K

JOIN – NET ASPIRANT ACADEMY – PAPER II – COMPUTER SCIENCE –

WHATSAPP GROUP

https://chat.whatsapp.com/Hgt34eeqiGxG0Evhsliwh2

Website: www.netaspirants.com

Instagram: ntanetaspirantacademy

Facebook: https://www.facebook.com/groups/157842666514511/?ref=share

Whatsapp Number: 900 322 4906

Contact Number : 900 322 4906 / 9566 190 514

FOR MORE DETAILS

www.netaspirants.com

Thanks & Regard

M.PERIASAMY.,MCA.,SET.,NET

ASSISTANT PROFESSOR

DEPT OF COMPUTER SCIENCE

Signature and Name of Invigilator
1. (Signature) OMR Sheet No. : ..........................................................
(To be filled by the Candidate)
(Name)
Roll No.
2. (Signature)
(In figures as per admission card)
(Name)
PAPER - II Roll No.
J 0 8 7 1 8 COMPUTER SCIENCE AND (In words)

Time : 2 hours] APPLICATIONS [Maximum Marks : 200

Number of Pages in this Booklet : 24 Number of Questions in this Booklet : 100
Instructions for the Candidates ¬⁄UˡÊÊÁÕ¸ÿÙ¢ ∑§ Á‹∞ ÁŸŒ¸‡Ê
1. Write your roll number in the space provided on the top of
this page.
1. ß‚ ¬ÎDU ∑§ ™§¬⁄U ÁŸÿà SÕÊŸ ¬⁄U •¬ŸÊ ⁄UÙ‹U Ÿê’⁄U Á‹Áπ∞–
2. This paper consists of hundred multiple-choice type of 2. ß‚ ¬˝‡Ÿ-¬òÊ ◊¢ ‚ÊÒ ’„ÈÁfl∑§À¬Ëÿ ¬˝‡Ÿ „Ò¥–
questions. 3. ¬⁄UˡÊÊ ¬˝Ê⁄êU÷ „ÙŸ ¬⁄U, ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê •Ê¬∑§Ù Œ ŒË ¡ÊÿªË– ¬„‹U ¬UÊ°ø Á◊Ÿ≈U
3. At the commencement of examination, the question booklet •Ê¬∑§Ù ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê πÙ‹Ÿ ÃÕÊ ©‚∑§Ë ÁŸêŸÁ‹Áπà ¡Ê°ø ∑§ Á‹∞ ÁŒÿ
will be given to you. In the first 5 minutes, you are requested ¡Êÿ¢ª, Á¡‚∑§Ë ¡Ê°ø •Ê¬∑§Ù •fl‡ÿ ∑§⁄UŸË „Ò —
to open the booklet and compulsorily examine it as below :
(i) ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê πÙ‹Ÿ ∑§ Á‹∞ ¬ÈÁSÃ∑§Ê ¬⁄U ‹ªË ∑§Êª¡ ∑§Ë ‚Ë‹ ∑§Ê
(i) To have access to the Question Booklet, tear off the
paper seal on the edge of this cover page. Do not accept »§Ê«∏ ‹¢U– πÈ‹Ë „È߸ ÿÊ Á’ŸÊ S≈UË∑§⁄U-‚Ë‹U ∑§Ë ¬ÈÁSÃ∑§Ê SflË∑§Ê⁄U Ÿ ∑§⁄¢U–
a booklet without sticker-seal and do not accept an open (ii) ∑§fl⁄U ¬ÎDU ¬⁄U ¿U¬ ÁŸŒ¸‡ÊÊŸÈ‚Ê⁄U ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§ ¬ÎDU ÃÕÊ ¬˝‡ŸÙ¢ ∑§Ë
booklet. ‚¢ÅÿÊ ∑§Ù •ë¿UË Ã⁄U„ øÒ∑§ ∑§⁄U ‹¢U Á∑§ ÿ ¬Í⁄U „Ò¢U– ŒÙ·¬Íáʸ ¬ÈÁSÃ∑§Ê
(ii) Tally the number of pages and number of questions in Á¡Ÿ◊¢ ¬ÎDU/¬˝‡Ÿ ∑§◊ „Ù¢ ÿÊ ŒÈ’Ê⁄UÊ •Ê ªÿ „Ù¢ ÿÊ ‚ËÁ⁄Uÿ‹U ◊¢ Ÿ „Ù¢
the booklet with the information printed on the cover •ÕʸØ Á∑§‚Ë ÷Ë ¬˝∑§Ê⁄U ∑§Ë òÊÈÁ≈U¬Íáʸ ¬ÈÁSÃ∑§Ê SflË∑§Ê⁄U Ÿ ∑§⁄¢U ÃÕÊ
page. Faulty booklets due to pages/questions missing
or duplicate or not in serial order or any other ©‚Ë ‚◊ÿ ©‚ ‹Uı≈UÊ∑§⁄U ©‚∑§ SÕÊŸ ¬⁄U ŒÍ‚⁄UË ‚„Ë ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ‹
discrepancy should be got replaced immediately by a ‹¢– U ß‚∑§ Á‹∞ •Ê¬∑§Ù ¬Ê°ø Á◊Ÿ≈U ÁŒÿ ¡Êÿ¢ª– ©‚∑§ ’ÊŒ Ÿ ÃÙ
correct booklet from the invigilator within the period •Ê¬∑§Ë ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê flʬ‚ ‹Ë ¡ÊÿªË •ı⁄U Ÿ „Ë •Ê¬∑§Ù •ÁÃÁ⁄UQ§
of 5 minutes. Afterwards, neither the Question Booklet ‚◊ÿ ÁŒÿÊ ¡ÊÿªÊ–
will be replaced nor any extra time will be given.
(iii) ß‚ ¡Ê°ø ∑§ ’ÊŒ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ∑§Ê Ÿ¥’⁄U OMR ¬òÊ∑§ ¬⁄U •¢Á∑§Ã ∑§⁄¢U
(iii) After this verification is over, the Test Booklet Number
should be entered on the OMR Sheet and the OMR Sheet
•Uı⁄U OMR ¬òÊ∑§ ∑§Ê Ÿ¥’⁄U ß‚ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê ¬⁄U •¢Á∑§Ã ∑§⁄U Œ¢–
Number should be entered on this Test Booklet. 4. ¬˝àÿ∑§ ¬˝‡Ÿ ∑§ Á‹∞ øÊ⁄U ©ûÊ⁄U Áfl∑§À¬ (1), (2), (3) ÃÕÊ (4) ÁŒÿ ªÿ „Ò¢–
4. Each item has four alternative responses marked (1), (2), (3) •Ê¬∑§Ù ‚„Ë ©ûÊ⁄U ∑§ flÎûÊ ∑§Ù ¬Ÿ ‚ ÷⁄U∑§⁄U ∑§Ê‹Ê ∑§⁄UŸÊ „Ò ¡Ò‚Ê Á∑§ ŸËø
and (4). You have to darken the circle as indicated below on ÁŒπÊÿÊ ªÿÊ „Ò–
the correct response against each item.
©ŒÊ„⁄UáÊ — ¡’Á∑§ (3) ‚„Ë ©ûÊ⁄U „Ò–
Example : where (3) is the correct response.
5. ¬˝‡ŸÊ¥ ∑§ ©ûÊ⁄U ∑§fl‹ ¬˝‡Ÿ ¬ÈÁSÃ∑§Ê ∑§ •ãŒ⁄U ÁŒÿ ªÿ OMRU ¬òÊ∑§ ¬⁄U „Ë
5. Your responses to the items are to be indicated in the OMR
•¥Á∑§Ã ∑§⁄UŸ „Ò¥– ÿÁŒ •Ê¬ OMRU ¬òÊ∑§ ¬⁄U ÁŒÿ ªÿ flÎûÊ ∑§ •‹ÊflÊ Á∑§‚Ë
Sheet given inside the Booklet only. If you mark your
response at any place other than in the circle in the OMR •ãÿ SÕÊŸ ¬⁄U ©ûÊ⁄U ÁøqÊ¢Á∑§Ã ∑§⁄UÃ „Ò¥, ÃÙ ©‚∑§Ê ◊ÍÀUÿÊ¢∑§Ÿ Ÿ„Ë¢ „٪ʖ
Sheet, it will not be evaluated. 6. •ãŒ⁄U ÁŒÿ ªÿ ÁŸŒ¸‡ÊÙ¢ ∑§Ù äÿÊŸ¬Ífl¸∑§ ¬…∏¢U–
6. Read instructions given inside carefully. 7. ∑§ìÊÊ ∑§Ê◊ (Rough Work) ß‚ ¬ÈÁSÃ∑§Ê ∑§ •ÁãÃ◊ ¬ÎDU ¬⁄U ∑§⁄¢U–
7. Rough Work is to be done in the end of this booklet.
8. ÿÁŒ •Ê¬ OMR ¬òÊ∑§ ¬⁄U ÁŸÿà SÕÊŸ ∑§ •‹ÊflÊ •¬ŸÊ ŸÊ◊, ⁄UÊ‹ Ÿê’⁄U,
8. If you write your Name, Roll Number, Phone Number or
put any mark on any part of the OMR Sheet, except for the
»§ÊŸ Ÿê’⁄U ÿÊ ∑§Ê߸ ÷Ë ∞‚Ê Áøq Á¡‚‚ •Ê¬∑§Ë ¬„øÊŸ „Ê ‚∑§, •¥Á∑§Ã ∑§⁄UÃ
space allotted for the relevant entries, which may disclose „Ò¥ •ÕflÊ •÷Œ˝ ÷Ê·Ê ∑§Ê ¬˝ÿÊª ∑§⁄UÃ „Ò¥, ÿÊ ∑§Ê߸ •ãÿ •ŸÈÁøà ‚ÊœŸ ∑§Ê
your identity, or use abusive language or employ any other ¬˝ÿÊª ∑§⁄UÃ „Ò¥, ¡Ò‚ Á∑§ •¥Á∑§Ã Á∑§ÿ ªÿ ©ûÊ⁄U ∑§Ê Á◊≈UÊŸÊ ÿÊ ‚»§Œ SÿÊ„Ë ‚
unfair means, such as change of response by scratching or ’Œ‹ŸÊ ÃÊ ¬⁄UˡÊÊ ∑§ Á‹ÿ •ÿÊÇÿ ÉÊÊÁ·Ã Á∑§ÿ ¡Ê ‚∑§Ã „Ò¥–
using white fluid, you will render yourself liable to 9. •Ê¬∑§Ù ¬⁄UˡÊÊ ‚◊Ê# „ÙŸ §¬⁄U ◊Í‹ OMR ¬òÊ∑§ ÁŸ⁄UˡÊ∑§ ◊„ÙŒÿ ∑§Ù ‹Uı≈UÊŸÊ
disqualification. •Êfl‡ÿ∑§ „Ò •ı⁄U ¬⁄UˡÊÊ ‚◊ÊÁ# ∑§ ’ÊŒ ©‚ •¬Ÿ ‚ÊÕ ¬⁄UˡÊÊ ÷flŸ ‚ ’Ê„⁄U
9. You have to return the original OMR Sheet to the invigilators Ÿ ‹∑§⁄U ¡Êÿ¢– „Ê‹Ê¥Á∑§ •Ê¬ ¬⁄UˡÊÊ ‚◊ÊÁ# ¬⁄U ◊Í‹ ¬˝‡Ÿ-¬ÈÁSÃ∑§Ê •¬Ÿ ‚ÊÕ
at the end of the examination compulsorily and must not
carry it with you outside the Examination Hall. You are ‹ ¡Ê ‚∑§Ã „Ò¥–
however, allowed to carry original question booklet on 10. ∑§fl‹ ŸË‹/∑§Ê‹ ’Ê‹U åflÊßZ≈U ¬Ÿ ∑§Ê „Ë ¬˝ÿÊª ∑§⁄¢U–
conclusion of examination.
11. Á∑§‚Ë ÷Ë ¬˝∑§Ê⁄U ∑§Ê ‚¢ªáÊ∑§ (∑Ò§‹∑ȧ‹≈U⁄U) UÿÊ ‹Êª ≈U’‹ •ÊÁŒ ∑§Ê
10. Use only Blue/Black Ball point pen.
¬˝ÿÙª flÁ¡¸Ã „Ò–
11. Use of any calculator or log table etc., is prohibited.
12. ª‹Ã ©ûÊ⁄UÊ¥ ∑§ Á‹∞ ∑§Ê߸ Ÿ∑§Ê⁄UÊà◊∑§ •¥∑§ Ÿ„Ë¥ „Ò¥–
12. There are no negative marks for incorrect answers.

J-08718 !J-08718-PAPER-II! 1 P.T.O.

 COMPUTER SCIENCE AND APPLICATIONS

PAPER - II

Note : This paper contains hundred (100) objective type questions of two (2) marks each. All
questions are compulsory.

1. The definitions in an XML document are said to be __________ when the tagging system
and definitions in the DTD are all in compliance.

(1) well-formed (2) reasonable

(3) valid (4) logical

2. Consider the JavaScript Code :

var y= ’’12”;

function f( ) {

var y=’’6”;

alert (this.y);

function g( ) {alert (y); }

g( );

f( );

If M is the number of alert dialog boxes generated by this JavaScript code and D1, D2, ....,
DM represents the content displayed in each of the M dialog boxes, then :

(1) M=3; D1 displays ”12”; D2 displays ”6”; D3 displays ”12”.

(2) M=3; D1 displays ”6”; D2 displays ”12”; D3 displays ”6”.

(3) M=2; D1 displays ”6”; D2 displays ”12”.

(4) M=2; D1 displays ”12”; D2 displays ”6”.

J-08718 !J-08718-PAPER-II! 2 Paper-II

3. What is the output of the following JAVA program ?
class simple
{
public static void main(String[ ] args)
{
simple obj = new simple( );
obj.start( );
}
void start( )
{
long [ ] P= {3, 4, 5};
long [ ] Q= method (P);
System.out.print (P[0] + P[1] + P[2]+”:”);
System.out.print (Q[0] + Q[1] + Q[2]);
}
long [ ] method (long [ ] R)
{
R [1]=7;
return R;
}
} //end of class
(1) 12 : 15 (2) 15 : 12 (3) 12 : 12 (4) 15 : 15

4. What is the output of the following ‘C’ program ? (Assuming little - endian representation of
multi-byte data in which Least Significant Byte (LSB) is stored at the lowest memory address.)
#include <stdio.h>
#include <stdlib.h>
/* Assume short int occupies two bytes of storage */
int main ( )
{
union saving
{
short int one;
char two[2];
};
union saving m;
m.two [0] = 5;
m.two [1] = 2;
printf(’’%d, %d, %d\n”, m.two [0], m.two [1], m.one);
}/* end of main */
(1) 5, 2, 1282 (2) 5, 2, 52 (3) 5, 2, 25 (4) 5, 2, 517

J-08718 !J-08718-PAPER-II! 3 Paper-II

5. Given below are three implementations of the swap( ) function in C++ :

(a) (b) (c)

void swap (int a, int b) void swap (int &a, int &b) void swap (int *a, int *b)
{ { {
int temp; int temp; int *temp;
temp = a; temp = a; temp = a;
a = b; a = b; a = b;
b = temp; b = temp; b = temp;
} } }
int main( ) int main( ) int main( )
{ { {
int p = 0, q = 1; int p = 0, q = 1; int p = 0, q = 1;
swap (p, q); swap (p, q); swap (&p, &q);
} } }

Which of these would actually swap the contents of the two integer variables p and q ?
(1) (a) only (2) (b) only (3) (c) only (4) (b) and (c) only

6. In Java, which of the following statements is/are True ?

S1 : The ‘final’ keyword applied to a class definition prevents the class from being extended
through derivation.
S2 : A class can only inherit one class but can implement multiple interfaces.
S3 : Java permits a class to replace the implementation of a method that it has inherited. It
is called method overloading.
Code :
(1) S1 and S2 only (2) S1 and S3 only
(3) S2 and S3 only (4) All of S1, S2 and S3

7. Which of the following statements is/are True ?

P: C programming language has a weak type system with static types.
Q: Java programming language has a strong type system with static types.
Code :
(1) P only (2) Q only
(3) Both P and Q (4) Neither P nor Q

J-08718 !J-08718-PAPER-II! 4 Paper-II

8. A graphic display system has a frame buffer that is 640 pixels wide, 480 pixels high and 1 bit
of color depth. If the access time for each pixel on the average is 200 nanoseconds, then the
refresh rate of this frame buffer is approximately :
(1) 16 frames per second (2) 19 frames per second
(3) 21 frames per second (4) 23 frames per second

9. Which of the following statements is/are True regarding the solution to the visibility problem
in 3D graphics ?
S1 : The Painter’s algorithm sorts polygons by depth and then paints (scan - converts) each
Polygon on to the screen starting with the most nearest polygon.
S2 : Backface Culling refers to eliminating geometry with backfacing normals.
Code :
(1) S1 only (2) S2 only
(3) Both S1 and S2 (4) Neither S1 nor S2

2 0 2 
10. Consider the matrix M =  0 1 1  representing a set of planar (2D) geometric
 
 0 0 1 
transformations in homogeneous coordinates. Which of the following statements about the
matrix M is True ?
(1) M represents first, a scaling of vector (2, 1) followed by translation of vector (1, 1)
(2) M represents first, a translation of vector (1, 1) followed by scaling of vector (2, 1)
(3) M represents first, a scaling of vector (3, 1) followed by shearing of parameters (−1, 1)
(4) M represents first, a shearing of parameters (−1, 1) followed by scaling of vector (3, 1)

11. Assume the following regarding the development of a software system P :

- Estimated lines of code of P : 33, 480 LOC
- Average productivity for P : 620 LOC per person-month
- Number of software developers : 6
- Average salary of a software developer : ` 50,000 per month
If E, D and C are the estimated development effort (in person-months), estimated development
time (in months), and estimated development cost (in ` Lac) respectively, then (E, D, C)
=_________.
(1) (48, 8, 24) (2) (54, 9, 27) (3) (60, 10, 30) (4) (42, 7, 21)

J-08718 !J-08718-PAPER-II! 5 Paper-II

12. Match the following in Software Engineering :
List - I List - II
(a) Product Complexity (i) Software Requirements Definition
(b) Structured System Analysis (ii) Software Design
(c) Coupling and Cohesion (iii) Validation Technique
(d) Symbolic Execution (iv) Software Cost Estimation
Code :
(a) (b) (c) (d)
(1) (ii) (iii) (iv) (i)
(2) (iii) (i) (iv) (ii)
(3) (iv) (i) (ii) (iii)
(4) (iii) (iv) (i) (ii)

13. Which one of the following is not typically provided by Source Code Management
Software ?
(1) Synchronisation (2) Versioning and Revision history
(3) Syntax highlighting (4) Project forking

14. A software system crashed 20 times in the year 2017 and for each crash, it took 2 minutes to
restart. Approximately, what was the software availability in that year ?
(1) 96.9924% (2) 97.9924%
(3) 98.9924% (4) 99.9924%

15. Match the 5 CMM Maturity levels/CMMI staged representations in List- I with their
characterizations in List-II :
List - I List - II
(a) Initial (i) Processes are improved quantitatively and continually.
(b) Repeatable (ii) The plan for a project comes from a template for plans.
(c) Defined (iii) The plan uses processes that can be measured
quantitatively.
(d) Managed (iv) There may not exist a plan or it may be abandoned.
(e) Optimizing (v) There’s a plan and people stick to it.
Code :
(a) (b) (c) (d) (e)
(1) (iv) (v) (i) (iii) (ii)
(2) (i) (ii) (iv) (v) (iii)
(3) (v) (iv) (ii) (iii) (i)
(4) (iv) (v) (ii) (iii) (i)

J-08718 !J-08718-PAPER-II! 6 Paper-II

16. Coupling is a measure of the strength of the interconnections between software modules.
Which of the following are correct statements with respect to module coupling ?
P: Common coupling occurs when one module controls the flow of another module by
passing it information on what to do.
Q: In data coupling, the complete data structure is passed from one module to another
through parameters.
R: Stamp coupling occurs when modules share a composite data structure and use only
parts of it.
Code :
(1) P and Q only (2) P and R only
(3) Q and R only (4) All of P, Q and R

17. A software design pattern often used to restrict access to an object is :

(1) adapter (2) decorator (3) delegation (4) proxy

18. Reasons to re-engineer a software include :

P: Allow legacy software to quickly adapt to the changing requirements
Q: Upgrade to newer technologies/platforms/paradigm (for example, object-oriented)
R: Improve software maintainability
S: Allow change in the functionality and architecture of the software
Code :
(1) P, R and S only (2) P and R only
(3) P, Q and S only (4) P, Q and R only

19. Which of the following is not a key strategy followed by the clean room approach to software
development ?
(1) Formal specification (2) Dynamic verification
(3) Incremental development (4) Statistical testing of the system

20. Which of the following statements is/are True ?

P: Refactoring is the process of changing a software system in such a way that it does not
alter the external behavior of the code yet improves the internal architecture.
Q: An example of refactoring is adding new features to satisfy a customer requirement
discovered after a project is shipped.
Code :
(1) P only (2) Q only
(3) Both P and Q (4) Neither P nor Q

J-08718 !J-08718-PAPER-II! 7 Paper-II

21. The solution of the recurrence relation

T(m) = T( 3m 4) + 1 is :

(1) θ (lg m) (2) θ (m)

(3) θ (mlg m) (4) θ (lglg m)

22. Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A,
the depth of the heap and the right child of max-heap are _________ and _________
respectively. (Root is at level 0).
(1) 3, 14 (2) 3, 10 (3) 4, 14 (4) 4, 10

23. A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys
44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18 ?
(1) 3 (2) 4 (3) 5 (4) 6

24. Which of the following algorithms solves the single-source shortest paths ?
(1) Prim’s algorithm
(2) Floyd - Warshall algorithm
(3) Johnson’s algorithm
(4) Dijkstra’s algorithm

25. A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08,
0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding technique will have the average
length of :
(1) 2.4 (2) 1.87 (3) 3.0 (4) 2.15

26. A binary search tree in which every non-leaf node has non-empty left and right subtrees is
called a strictly binary tree. Such a tree with 19 leaves :
(1) cannot have more than 37 nodes
(2) has exactly 37 nodes
(3) has exactly 35 nodes
(4) cannot have more than 35 nodes

J-08718 !J-08718-PAPER-II! 8 Paper-II

27. Match the following with respect to algorithm paradigms :
List - I List - II
(a) The 8-Queen’s problem (i) Dynamic programming
(b) Single-Source shortest paths (ii) Divide and conquer
(c) STRASSEN’s Matrix multiplication (iii) Greedy approach
(d) Optimal binary search trees (iv) Backtracking
Code :
(a) (b) (c) (d)
(1) (iv) (i) (iii) (ii)
(2) (iv) (iii) (i) (ii)
(3) (iii) (iv) (ii) (i)
(4) (iv) (iii) (ii) (i)

28. The maximum number of comparisons needed to sort 9 items using radix sort is (assume
each item is 5 digit octal number) :
(1) 45 (2) 72 (3) 360 (4) 450

29. A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left
nodes in such a tree with 8 internal nodes will be :
(1) 30 (2) 33 (3) 45 (4) 125

30. Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines
whether the Boolean function produces a output 1 is :
(1) Logarithmic (2) Linear
(3) Quadratic (4) Exponential

31. Two finite state machines are said to be equivalent if they :

(1) Have the same number of edges
(2) Have the same number of states
(3) Recognize the same set of tokens
(4) Have the same number of states and edges

J-08718 !J-08718-PAPER-II! 9 Paper-II

32. The finite state machine given in figure below recognizes :

(1) any string of odd number of a’s

(2) any string of odd number of b’s
(3) any string of even number of a’s and odd number of b’s
(4) any string of odd number of a’s and odd number of b’s

33. A pushdown automata behaves like a Turing machine when the number of auxiliary memory
is :
(1) 0 (2) 1 (3) 1 or more (4) 2 or more

34. Pushdown automata can recognize language generated by_________.

(1) Only context free grammar
(2) Only regular grammar
(3) Context free grammar or regular grammar
(4) Only context sensitive grammar

35. To obtain a string of n Terminals from a given Chomsky normal form grammar, the number
of productions to be used is :
(1) 2n−1 (2) 2n (3) n+1 (4) n2

36. Consider the following two Grammars :

G1 : S → SbS|a
G2 : S → aB|ab, A→GAB|a, B→ABb|b
Which of the following option is correct ?
(1) Only G1 is ambiguous
(2) Only G2 is ambiguous
(3) Both G1 and G2 are ambiguous
(4) Both G1 and G2 are not ambiguous

J-08718 !J-08718-PAPER-II! 10 Paper-II

37. Context sensitive language can be recognized by a :
(1) Finite state machine
(2) Deterministic finite automata
(3) Non-deterministic finite automata
(4) Linear bounded automata

38. The set A={ 0n 1n 2n | n=1, 2, 3, ......... } is an example of a grammar that is :

(1) Context sensitive (2) Context free
(3) Regular (4) None of the above

39. A bottom-up parser generates :

(1) Left-most derivation in reverse
(2) Right-most derivation in reverse
(3) Left-most derivation
(4) Right-most derivation

40. Consider the following statements( ) :

S1 : There exists no algorithm for deciding if any two Turing machines M1 and M2 accept
the same language.
S2 : The problem of determining whether a Turing machine halts on any input is undecidable.
Which of the following options is correct ?
(1) Both S1 and S2 are correct
(2) Both S1 and S2 are not correct
(3) Only S1 is correct
(4) Only S2 is correct

41. A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200 Kbps
bandwidth. Find the throughput of the system, if the system (all stations put together) produces
250 frames per second :
(1) 49 (2) 368 (3) 149 (4) 151

42. The period of a signal is 100 ms. Its frequency is _________.

(1) 1003 Hertz (2) 10−2 KHz (3) 10−3 KHz (4) 105 Hertz

J-08718 !J-08718-PAPER-II! 11 Paper-II

43. The dotted-decimal notation of the following IPV4 address in binary notation is _________.
10000001 00001011 00001011 11101111
(1) 111.56.45.239 (2) 129.11.10.238
(3) 129.11.11.239 (4) 111.56.11.239

44. Which of the following statements are true ?

(a) Advanced Mobile Phone System (AMPS) is a second generation cellular phone system.
(b) IS - 95 is a second generation cellular phone system based on CDMA and DSSS.
(c) The Third generation cellular phone system will provide universal personnel
communication.
Code :
(1) (a) and (b) only (2) (b) and (c) only
(3) (a), (b) and (c) (4) (a) and (c) only

45. Match the following symmetric block ciphers with corresponding block and key sizes :
List - I List - II
(a) DES (i) block size 64 and key size ranges
between 32 and 448
(b) IDEA (ii) block size 64 and key size 64
(c) BLOW FISH (iii) block size 128 and key sizes 128, 192, 256
(d) AES (iv) block size 64 and key size 128
Code :
(a) (b) (c) (d)
(1) (iv) (ii) (i) (iii)
(2) (ii) (iv) (i) (iii)
(3) (ii) (iv) (iii) (i)
(4) (iv) (ii) (iii) (i)

46. Which of the following statements are true ?

(a) Three broad categories of Networks are
(i) Circuit Switched Networks
(ii) Packet Switched Networks
(iii) Message Switched Networks
(b) Circuit Switched Network resources need not be reserved during the set up phase.
(c) In packet switching there is no resource allocation for packets.
Code :
(1) (a) and (b) only (2) (b) and (c) only
(3) (a) and (c) only (4) (a), (b) and (c)

J-08718 !J-08718-PAPER-II! 12 Paper-II

47. In Challenge-Response authentication the claimant ________.
(1) Proves that she knows the secret without revealing it
(2) Proves that she doesn’t know the secret
(3) Reveals the secret
(4) Gives a challenge

48. Decrypt the message “WTAAD” using the Caesar Cipher with key=15.
(1) LIPPS (2) HELLO (3) OLLEH (4) DAATW

49. To guarantee correction of upto t errors, the minimum Hamming distance dmin in a block
code must be ________.
(1) t+1 (2) t−2 (3) 2t−1 (4) 2t+1

50. Encrypt the Message “HELLO MY DEARZ” using Transposition Cipher with

 Plain Text 2 4 1 3
Key 
Cipher Text 1 2 3 4
(1) HLLEO YM AEDRZ (2) EHOLL ZYM RAED
(3) ELHL MDOY AZER (4) ELHL DOMY ZAER

51. At a particular time of computation, the value of a counting semaphore is 10. Then 12 P
operations and “x” V operations were performed on this semaphore. If the final value of
semaphore is 7, x will be :
(1) 8 (2) 9 (3) 10 (4) 11

52. In a paged memory, the page hit ratio is 0.40. The time required to access a page in secondary
memory is equal to 120 ns. The time required to access a page in primary memory is 15 ns.
The average time required to access a page is ________.
(1) 105 (2) 68 (3) 75 (4) 78

53. In a multi-user operating system, 30 requests are made to use a particular resource per hour,
on an average. The probability that no requests are made in 40 minutes, when arrival
pattern is a poisson distribution, is _________.
(1) e−15 (2) 1−e−15 (3) 1−e−20 (4) e−20

54. Normally user programs are prevented from handling I/O directly by I/O instructions in
them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having
the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit
I/O instruction. Which one of the following is true for a CPU with memory mapped I/O ?
(1) I/O protection is ensured by operating system routines.
(2) I/O protection is ensured by a hardware trap.
(3) I/O protection is ensured during system configuration.
(4) I/O protection is not possible.

J-08718 !J-08718-PAPER-II! 13 Paper-II

55. Which UNIX/Linux command is used to make all files and sub-directories in the directory
“progs” executable by all users ?
(1) chmod− R a+x progs (2) chmod −R 222 progs
(3) chmod−X a+x progs (4) chmod −X 222 progs

56. Which of the following statements are true ?

(a) External Fragmentation exists when there is enough total memory space to satisfy a
request but the available space is contiguous.
(b) Memory Fragmentation can be internal as well as external.
(c) One solution to external Fragmentation is compaction.
Code :
(1) (a) and (b) only (2) (a) and (c) only
(3) (b) and (c) only (4) (a), (b) and (c)

57. Page information in memory is also called as Page Table. The essential contents in each entry
of a page table is/are _________.
(1) Page Access information
(2) Virtual Page number
(3) Page Frame number
(4) Both virtual page number and Page Frame Number

58. Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement
algorithm is implemented with 3 page frames in main memory. Then the number of page
faults are_________.
(1) 5 (2) 7 (3) 9 (4) 10

59. Consider the following three processes with the arrival time and CPU burst time given in
milliseconds :
Process Arrival Time Burst Time
P1 0 7
P2 1 4
P3 2 8
The Gantt Chart for preemptive SJF scheduling algorithm is _________.

(1)

(2)

(3)

(4)

J-08718 !J-08718-PAPER-II! 14 Paper-II

60. In which of the following scheduling criteria, context switching will never take place ?
(1) ROUND ROBIN (2) Preemptive SJF
(3) Non-preemptive SJF (4) Preemptive priority

61. In RDBMS, which type of Join returns all rows that satisfy the join condition ?
(1) Inner Join (2) Outer Join
(3) Semi Join (4) Anti Join

62. Consider a relation book (title, price) which contains the titles and prices of different books.
Assuming that no two books have the same price, what does the following SQL query list ?
Select title
from book as B
where (select count (*)
from book as T
where T.price > B.price) < 7
(1) Titles of the six most expensive books.
(2) Title of the sixth most expensive books.
(3) Titles of the seven most expensive books.
(4) Title of the seventh most expensive books.

63. In a Hierachical database, a hashing function is used to locate the ________.

(1) Collision (2) Root
(3) Foreign Key (4) Records

64. Relations produced from E - R Model will always be in ________.

(1) 1 NF (2) 2 NF (3) 3 NF (4) 4 NF

65. Consider the following schedules involving two transactions.

S1 : r1(X) ; r1(Y) ; r2(X) ; r2(Y) ; w2(Y) ; w1(X)
S2 : r1(X) ; r2(X) ; r2(Y) ; w2(Y) ; r1(Y) ; w1(X)
Which one of the following statements is correct with respect to above ?
(1) Both S1 and S2 are conflict serializable.
(2) Both S1 and S2 are not conflict serializable.
(3) S1 is conflict serializable and S2 is not conflict serializable.
(4) S1 is not conflict serializable and S2 is conflict serializable.

J-08718 !J-08718-PAPER-II! 15 Paper-II

66. For a database relation R(a, b, c, d) where the domains of a, b, c and d include only atomic
values, and only the following functional dependencies and those that can be inferred from
them hold :
a→c
b→d
The relation is in _________.
(1) First normal form but not in second normal form
(2) Second normal form but not in third normal form
(3) Third normal form
(4) BCNF

67. A many-to-one relationship exists between entity sets r1 and r2. How will it be represented
using functional depedencies if Pk(r) denotes the primary key attribute of relation r ?
(1) Pk(r1) → Pk(r2)
(2) Pk(r2) → Pk(r1)
(3) Pk(r2) → Pk(r1) and Pk(r1) → Pk(r2)
(4) Pk(r2) → Pk(r1) or Pk(r1) → Pk(r2)

68. Database systems that store each relation in a separate operating system file may use the
operating system’s authorization scheme, instead of defining a special scheme themselves.
In this case, which of the following is false ?
(1) The administrator enjoys more control on the grant option.
(2) It is difficult to differentiate among the update, delete and insert authorizations.
(3) Cannot store more than one relation in a file.
(4) Operations on the database are speeded up as the authorization procedure is carried
out at the operating system level.

69. Let R1(a, b, c) and R2(x, y, z) be two relations in which a is the foreign key of R1 that refers to
the primary key of R2. Consider following four options.
(a) Insert into R1 (b) Insert into R2
(c) Delete from R1 (d) Delete from R2
Which of the following is correct about the referential integrity constraint with respect to
above ?
(1) Operations (a) and (b) will cause violation.
(2) Operations (b) and (c) will cause violation.
(3) Operations (c) and (d) will cause violation.
(4) Operations (d) and (a) will cause violation.

J-08718 !J-08718-PAPER-II! 16 Paper-II

70. Consider a hash table of size seven, with starting index zero, and a hash function (7x+3)
mod 4. Assuming the hash table is initially empty, which of the following is the contents of
the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing ? Here
“__” denotes an empty location in the table.
(1) 3, 10, 1, 8, __ , __ , __
(2) 1, 3, 8, 10, __ , __ , __
(3) 1, __ , 3, __ , 8, __ , 10
(4) 3, 10, __ , __ , 8, __ , __

71. In Artificial Intelligence (AI), an environment is uncertain if it is ________.

(1) Not fully observable and not deterministic
(2) Not fully observable or not deterministic
(3) Fully observable but not deterministic
(4) Not fully observable but deterministic

72. In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of_________.
(1) current percept, completely ignoring rest of the percept history.
(2) rest of the percept history, completely ignoring current percept.
(3) both current percept and complete percept history.
(4) both current percept and just previous percept.

73. In heuristic search algorithms in Artificial Intelligence (AI), if a collection of admissible

heuristics h1.......hm is available for a problem and none of them dominates any of the others,
which should we choose ?
(1) h(n)=max{h1(n),....,h m(n)}
(2) h(n)=min{h1(n),....,hm(n)}
(3) h(n)=avg{h1(n),....,hm(n)}
(4) h(n)=sum{h1(n),....,hm(n)}

74. Consider following sentences regarding A* , an informed search strategy in Artificial

Intelligence (AI).
(a) A* expands all nodes with f(n) < C*.
(b) A* expands no nodes with f(n) /C*.
(c) Pruning is integral to A*.
Here, C* is the cost of the optimal solution path.
Which of the following is correct with respect to the above statements ?
(1) Both statement (a) and statement (b) are true.
(2) Both statement (a) and statement (c) are true.
(3) Both statement (b) and statement (c) are true.
(4) All the statements (a), (b) and (c) are true.

J-08718 !J-08718-PAPER-II! 17 Paper-II

75. Consider a vocabulary with only four propositions A, B, C and D. How many models are
there for the following sentence ?
BwC
(1) 10 (2) 12 (3) 15 (4) 16

76. Consider the following statements :

(a) False =
? True
(b) If α =
? (β ∧ γ) then α =
? β and α =
? γ.
Which of the following is correct with respect to the above statements ?
(1) Both statement (a) and statement (b) are false.
(2) Statement (a) is true but statement (b) is false.
(3) Statement (a) is false but statement (b) is true.
(4) Both statement (a) and statement (b) are true.

77. Consider the following English sentence :

“Agra and Gwalior are both in India”.
A student has written a logical sentence for the above English sentence in First-Order Logic
using predicate In(x, y), which means x is in y, as follows :
In(Agra, India) w In(Gwalior, India)
Which one of the following is correct with respect to the above logical sentence ?
(1) It is syntactically valid but does not express the meaning of the English sentence.
(2) It is syntactically valid and expresses the meaning of the English sentence also.
(3) It is syntactically invalid but expresses the meaning of the English sentence.
(4) It is syntactically invalid and does not express the meaning of the English sentence.

78. Consider the following two sentences :

(a) The planning graph data structure can be used to give a better heuristic for a planning
problem.
(b) Dropping negative effects from every action schema in a planning problem results in a
relaxed problem.
Which of the following is correct with respect to the above sentences ?
(1) Both sentence (a) and sentence (b) are false.
(2) Both sentence (a) and sentence (b) are true.
(3) Sentence (a) is true but sentence (b) is false.
(4) Sentence (a) is false but sentence (b) is true.

J-08718 !J-08718-PAPER-II! 18 Paper-II

79. A knowledge base contains just one sentence, ∃x AsHighAs (x, Everest). Consider the
following two sentences obtained after applying existential instantiation.
(a) AsHighAs (Everest, Everest)
(b) AsHighAs (Kilimanjaro, Everest)
Which of the following is correct with respect to the above sentences ?
(1) Both sentence (a) and sentence (b) are sound conclusions.
(2) Both sentence (a) and sentence (b) are unsound conclusions.
(3) Sentence (a) is sound but sentence (b) is unsound.
(4) Sentence (a) is unsound but sentence (b) is sound.

80. Consider the set of all possible five-card poker hands dealt fairly from a standard deck of
fifty-two cards. How many atomic events are there in the joint probability distribution ?
(1) 2, 598, 960 (2) 3, 468, 960 (3) 3, 958, 590 (4) 2, 645, 590

81. E is the number of edges in the graph and f is maximum flow in the graph. When the
capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by :
(1) O (E∗f) (2) O (E2∗f)
(3) O (E∗f2) (4) O (E2∗f2)

82. Which of the following statements is false about convex minimization problem ?
(1) If a local minimum exists, then it is a global minimum
(2) The set of all global minima is convex set
(3) The set of all global minima is concave set
(4) For each strictly convex function, if the function has a minimum, then the minimum is
unique

83. The following LPP

Maximize z=100x1+2x2+5x3
Subject to
14x 1+x 2−6x 3+3x 4=7
32x 1+x 2−12x 3≤10
3x 1−x 2−x 3≤0
x1, x2, x3, x4/0
has
(1) Solution : x1=100, x2=0, x3=0 (2) Unbounded solution
(3) No solution (4) Solution : x1=50, x2=70, x3=60

J-08718 !J-08718-PAPER-II! 19 Paper-II

84. Digital data received from a sensor can fill up 0 to 32 buffers. Let the sample space be
S={0, 1, 2, .........., 32} where the sample j denote that j of the buffers are full and
1
p(i) = (33−i) . Let A denote the event that the even number of buffers are full. Then
561
p(A) is :
(1) 0.515 (2) 0.785 (3) 0.758 (4) 0.485

85. The equivalence of

¬ ∃ x Q (x) is :
(1) ∃ x ¬ Q (x) (2) x ¬ Q (x) (3) ¬ ∃ x ¬ Q (x) (4) x Q (x)

86. If Ai={−i, ... −2,−1, 0, 1, 2, . . . . . i}

∞
then ∪ Ai is :
i=1

(1) Z (2) Q (3) R (4) C

87. Match the following in List - I and List - II, for a function f :
List - I List - II
(a) x y (f (x)=f (y) → x=y) (i) Constant
(b) y ∃ x (f (x)=y) (ii) Injective
(c) x f (x)=k (iii) Surjective
Code :
(a) (b) (c)
(1) (i) (ii) (iii)
(2) (iii) (ii) (i)
(3) (ii) (i) (iii)
(4) (ii) (iii) (i)

88. Which of the relations on {0, 1, 2, 3} is an equivalence relation ?

(1) { (0, 0) (0, 2) (2, 0) (2, 2) (2, 3) (3, 2) (3, 3) }
(2) { (0, 0) (1, 1) (2, 2) (3, 3) }
(3) { (0, 0) (0, 1) (0, 2) (1, 0) (1, 1) (1, 2) (2, 0) }
(4) { (0, 0) (0, 2) (2, 3) (1, 1) (2, 2) }

J-08718 !J-08718-PAPER-II! 20 Paper-II

89. Which of the following is an equivalence relation on the set of all functions from Z to
Z?
(1) { (f, g) ? f (x)−g (x)=1 xeZ}
(2) { (f, g) ? f (0)=g (0) or f (1)=g (1) }
(3) { (f, g) ? f (0)=g (1) and f (1)=g (0) }
(4) { (f, g) ? f (x)−g (x)=k for some k e Z }

90. Which of the following statements is true ?

(1) (Z, ≤ ) is not totally ordered
(2) The set inclusion relation ⊆ is a partial ordering on the power set of a set S
(3) (Z, ≠ ) is a poset

(4) The directed graph is not a partial order

91. CMOS is a Computer Chip on the motherboard, which is :

(1) RAM (2) ROM
(3) EPROM (4) Auxillary storage

92. In RS flip-flop, the output of the flip-flop at time (t+1) is same as the output at time t, after
the occurance of a clock pulse if :
(1) S=R=1 (2) S=0, R=1
(3) S=1, R=0 (4) S=R=0

93. Match the terms in List - I with the options given in List - II :
List - I List - II
(a) Decoder (i) 1 line to 2n lines
(b) Multiplexer (ii) n lines to 2n lines
(c) De multiplexer (iii) 2n lines to 1 line
(iv) 2n lines to 2n−1 lines
Code :
(a) (b) (c)
(1) (ii) (i) (iii)
(2) (ii) (iii) (i)
(3) (ii) (i) (iv)
(4) (iv) (ii) (i)

J-08718 !J-08718-PAPER-II! 21 Paper-II

94. What does the following logic diagram represent ?

(1) Synchronous Counter (2) Ripple Counter

(3) Combinational Circuit (4) Mod 2 Counter

95. The hexadecimal equivalent of the binary integer number 110101101 is :

(1) D24 (2) 1BD (3) 1AE (4) 1AD

96. Perform the following operation for the binary equivalent of the decimal numbers
(−14)10+(−15)10
The solution in 8 bit representation is :
(1) 11100011 (2) 00011101
(3) 10011101 (4) 11110011

97. Match the items in List - I and List - II :

List - I List - II
(a) Interrupts which can be delayed when a much highest (i) Normal
priority interrupt has occurred
(b) Unplanned interrupts which occur while executing (ii) Synchronous
a program
(c) Source of interrupt is in phase with the system clock (iii) Maskable
(iv) Exception
Code :
(a) (b) (c)
(1) (ii) (i) (iv)
(2) (ii) (iv) (iii)
(3) (iii) (i) (ii)
(4) (iii) (iv) (ii)

J-08718 !J-08718-PAPER-II! 22 Paper-II

98. Which of the following mapping is not used for mapping process in cache memory ?
(1) Associative mapping (2) Direct mapping
(3) Set-Associative mapping (4) Segmented - page mapping

99. Simplify the following using K-map :

F (A, B, C, D) = Σ (0, 1, 2, 8, 9, 12, 13)
d (A, B, C, D) = Σ (10, 11, 14, 15)
d stands for don’t care condition.

(1) A + B D + BC (2) A+B D + B C

(3) A+B C (4) A+B C+B D

100. In 8085 microprocessor, what is the output of following program ?

LDA 8000H
MVI B, 30H
ADD B
STA 8001H
(1) Read a number from input port and store it in memory
(2) Read a number from input device with address 8000H and store it in memory at location
8001H
(3) Read a number from memory at location 8000H and store it in memory location 8001H
(4) Load A with data from input device with address 8000H and display it on the output
device with address 8001H

-o0o-

J-08718 !J-08718-PAPER-II! 23 Paper-II

 Space For Rough Work

J-08718 !J-08718-PAPER-II! 24 Paper-II

 UGC-JULY-2018 PAPER-2 Exam Date 08/07/2018 Set :- Date. 31/07/2018 Pg. 71
SUBJECT CODE & NAME:- (087) Computer Science and App
---------------------------------------------------------------------------
| QNO ANS | QNO ANS | QNO ANS | QNO ANS |
---------------------------------------------------------------------------
| 1 3 | 26 2 | 51 2 | 76 4 |
--------------------------------------------------
| 2 4 | 27 4 | 52 4 | 77 1 |
--------------------------------------------------
| 3 4 | 28 3 | 53 4 | 78 2 |
--------------------------------------------------
| 4 4 | 29 9 | 54 1 | 79 4 |
--------------------------------------------------
| 5 2 | 30 4 | 55 1 | 80 1 |
--------------------------------------------------
| 6 1 | 31 3 | 56 3 | 81 9 |
--------------------------------------------------
| 7 3 | 32 4 | 57 3 | 82 3 |
--------------------------------------------------
| 8 1 | 33 4 | 58 2 | 83 2 |
--------------------------------------------------
| 9 2 | 34 3 | 59 2 | 84 1 |
--------------------------------------------------
| 10 2 | 35 1 | 60 3 | 85 2 |
--------------------------------------------------
| 11 2 | 36 3 | 61 1 | 86 1 |
--------------------------------------------------
| 12 3 | 37 4 | 62 3 | 87 4 |
--------------------------------------------------
| 13 3 | 38 1 | 63 2 | 88 2 |
--------------------------------------------------
| 14 4 | 39 2 | 64 3 | 89 4 |
--------------------------------------------------
| 15 4 | 40 1 | 65 4 | 90 2 |
--------------------------------------------------
| 16 3 | 41 1 | 66 1 | 91 1 |
--------------------------------------------------
| 17 4 | 42 2 | 67 1 | 92 4 |
--------------------------------------------------
| 18 4 | 43 3 | 68 1 | 93 2 |
--------------------------------------------------
| 19 2 | 44 2 | 69 4 | 94 2 |
--------------------------------------------------
| 20 1 | 45 2 | 70 1 | 95 4 |
--------------------------------------------------
| 21 1 | 46 3 | 71 2 | 96 1 |
--------------------------------------------------
| 22 2 | 47 1 | 72 1 | 97 4 |
--------------------------------------------------
| 23 3 | 48 2 | 73 1 | 98 4 |
--------------------------------------------------
| 24 4 | 49 4 | 74 2 | 99 2 |
--------------------------------------------------
| 25 4 | 50 3 | 75 2 | 100 4 |
--------------------------------------------------
9=The marks have been awarded to all the Candidates against the question(s)