Youth Competition Times

NTA/UGC-NET-JRF/SET
COMPUTER SCIENCE
&
APPLICATIONS
Solved Papers
(Also Useful for Other State Level Competitive Examinations)

Compiled and Edited by

YCT Expert Team

Computer Graphics by
Balkrishna, Charan Singh, Ashish Giri

Editorial Office
12, Church Lane Prayagraj-211002
9415650134
Email : [email protected]
website : www.yctbooks.com/www.yctfastbook.com/www.yctbooksprime.com
 All Rights Reserved with Publisher
Publisher Declaration
Edited and Published by A.K. Mahajan for YCT Publications Pvt. Ltd.
and E:Book by APP Youth Prime BOOKS In order to Publish the book,
full care has been taken by the Editor and the Publisher,
still your suggestions and queries are welcomed.
In the event of any dispute, the judicial area will be Prayagraj.
 CONTENT
University Grant Commission (UGC) NET : Computer Science & Applications
NTA/UGC NET/JRF ENGLISH Exam Syllabus ...............................................................................................3-6
UGC NET/JRF Exam. Computer Science June-2012 Solved Paper II .........................................................7-12
UGC NET/JRF Exam. Computer Science June-2012 Solved Paper III .....................................................13-24
UGC NET/JRF Exam. Computer Science December-2012 Solved Paper II ..............................................25-31
UGC NET/JRF Exam. Computer Science December-2012 Solved Paper III ............................................32-43
UGC NET/JRF Exam. Computer Science June-2013 Solved Paper II (Cancel) ........................................44-50
UGC NET/JRF Exam. Computer Science June-2013 Solved Paper III (Cancel) .......................................51-61
UGC NET/JRF Exam. Computer Science September-2013 Solved Paper II .............................................62-69
UGC NET/JRF Exam. Computer Science September-2013 Solved Paper III ...........................................70-81
UGC NET/JRF Exam. Computer Science December-2013 Solved Paper II ..............................................82-88
UGC NET/JRF Exam. Computer Science December-2013 Solved Paper III ..........................................89-100
UGC NET/JRF Exam. Computer Science June-2014 Solved Paper II ...................................................101-109
UGC NET/JRF Exam. Computer Science June-2014 Solved Paper III .................................................110-122
UGC NET/JRF Exam. Computer Science December-2014 Solved Paper II ..........................................123-129
UGC NET/JRF Exam. Computer Science December-2014 Solved Paper III ........................................130-142
UGC NET/JRF Exam. Computer Science June-2015 Solved Paper II ...................................................143-150
UGC NET/JRF Exam. Computer Science June-2015 Solved Paper III .................................................151-163
UGC NET/JRF Exam. Computer Science December-2015 Solved Paper II ..........................................164-171
UGC NET/JRF Exam. Computer Science December-2015 Solved Paper III ........................................172-183
UGC NET/JRF Exam. Computer Science June-2016 Solved Paper II ...................................................184-191
UGC NET/JRF Exam. Computer Science June-2016 Solved Paper III .................................................192-204
UGC NET/JRF Exam. Computer Science August-2016 Solved Paper II ...............................................205-211
UGC NET/JRF Exam. Computer Science August-2016 Solved Paper III .............................................212-225
UGC NET/JRF Exam. Computer Science June-2017 Solved Paper II ...................................................226-233
UGC NET/JRF Exam. Computer Science June-2017 Solved Paper III .................................................234-246
UGC NET/JRF Exam. Computer Science November-2017 Solved Paper II .........................................247-254
UGC NET/JRF Exam. Computer Science November-2017 Solved Paper III ........................................255-267
NTA/UGC NET/JRF Exam. Computer Science June-2018 Solved Paper II .........................................268-284
NTA/UGC NET/JRF Exam. Computer Science December-2018 Solved Paper II ................................285-304
NTA/UGC NET/JRF Exam. Computer Science June-2019 Solved Paper II .........................................305-330
NTA/UGC NET/JRF Exam. Computer Science December-2019 Solved Paper II ................................331-356
NTA/UGC NET/JRF Exam. Computer Science June -2020 Solved Paper II ........................................357-380
NTA/UGC NET/JRF Exam. Computer Science December 2020-June 2021 Solved Paper II ..............381-400
NTA/UGC NET/JRF Exam. Computer Science December 2021-June 2022 Solved Paper II ..............401-422
NTA/UGC NET/JRF Exam. Computer Science December 2022 (11.03.2023) Solved Paper II ..........423-445
NTA/UGC NET/JRF Exam. Computer Science December 2022 (15.03.2023) Solved Paper II ...........446-464
NTA/UGC NET/JRF Exam. Computer Science June -2023 Solved Paper II ........................................465-488
NTA/UGC NET/JRF Exam. Computer Science December -2023 Solved Paper II ...............................489-512
2
 Search on TG: @apna_pdf

NTA/UGC-NET Syllabus
New Pattern
As per the revised scheme, the test will consist of two papers as below:
Paper Marks Number of Questions Duration
I 100 50 questions. All are compulsory 1 Hour (09:30 AM to 10:30 AM) IST
II 200 100 questions. All are compulsory 2 Hour (11:00 AM to 1:00 PM) IST
Paper-I Shall consist of 50 objective type compulsory questions each carrying 2 marks. The questions which will be of general
nature, intended to assess the teaching/research aptitude of the candidate. It will primarily be designed to test reasoning ability,
comprehension, divergent thinking and general awareness of the candidate.
Paper-II Shall consist of 100 objective type compulsory questions each carrying 2 marks which will be based on the subject
selected by the candidate.
All the questions of Paper – II will be compulsory, covering entire syllabi of earlier Paper II & Paper III (including all electives,
without options).
SYLLABUS FOR PAPER-II
1. Discrete Structures : Sets, Relations, Functions, Pigeonhole Principle, Inclusion-Exclusion Principle, Equivalence and Partial
Orderings. Elementary Counting Techniques. Probability. Measure(s) for information and Mutual information. Computability.
Models of computation – Finite Automata, Pushdown Automata, Non-determinism and NFA, DPDA and PDAs and Languages
accepted by these structures. Grammars, Languages, Non-computability and examples of non-computable problems.
Graph. Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles and circuits, tree and rooted tree.
Spanning trees. Central Graphs. Centre(s) of a tree. Hamiltonian and Eulerian graphs, Planar graphs.
Groups. Finite fields and Error correcting/detecting codes.
2. Computer Arithmetic : Propositional (Boolean) Logic, Predicate Logic, Well-formed-formulae (WFF), Satisflability and
Tautology.
Logic Families. TCL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flip-flops-types, race
condition and comparison. Design of combinational and sequential circuits.
Representation of Integers. Octal, Hex, Decimal and Binary. 2′s complement and I′s complement arithmetic. Floating point
representation.
3. Programming in C and C++ : Programming in C. Element of C– Tokens, identifiers, data types in C. Control structures in C.
Sequence, selection and iteration (s). Structured data types in C–arrays, struct, union, string and pointers.
O-O Programming Concepts. Class, object, instantiation. Inheritance polymorphism and overloading.
C++ Programming. Elements of C++ – Takens, identifiers. Variables and constants, Data types, Operators, Control statements.
Functions parameter passing. Class and objects. Constructors and destructors. Overloading, inheritance, templates, exception
handling.
4. Relational Database Design and SQL : E-R diagrams and their transformation to relational design, normalisation – 1 NF,
2NF, 3NF, BCNF and 4NF. Limitations of 4NF and BCNF.
SQL. Data Definition Language (DDL), Data Manipulation Language (DML), Data Control Language (DCL) commands.
Database objects like–views, indexes, sequences, synonyms, data dictionary.
5. Data and File Structures : Data, information, Definition of data structure. Arrays, stacks, queues, linked lists, trees, graphs,
priority queues and heaps.
File Structures. Fields, records and files. Sequential, direct, index sequential and relative files. Hashing, inverted lists and multi-
lists. B trees and B+ trees.
6. Computer Networks : Network Fundamentals. Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide
Area Networks (WAN), Wireless Networks. Inter Networks.
Reference Models. The OSI model, TCP/IP model.
Data Communication. Channel capacity, Transmission media–twisted pair, coaxial cables, fibre-optic cables, wireless
transmission-radio, microwave infrared and millimetre waves. Lightwave transmission. The Telephones – local loop, trunks,
multi-plexing, switching, narrowband ISDN, broadband ISDN, ATM, High Speed LANS. Cellular Radio. Communication
satellites–geosynchronous and low-orbit.

3
 Search on TG: @apna_pdf
Internetworking. Switch/Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls.
Routing: Virtual circuits and datagrams. Routing algorithms. Conjestion control.
Network Secuity. Cryptography – public key, secret key. Domain Name System (DNS) – Electronic Mail and World Wide Web
(WWW). The DNS, Resource Records, Name servers, E-mail-architecture and Servers.
7. System Software and Compilers : Assembly language fundamentals (8085 based assembly language programming).
Assemblers-2-pass and single-pass. Macros and macroprocessors.
Loading, linking, relocation, program relocatability. Linkage editing. Text editors, Programming Environments, Debuggers and
program generators.
Compilation and Interpretation. Bootstrap compiler. Phases of compilation process. Lexical analysis. Lex package on Unix
system.
Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees as rightmost and leftmost derivations.
Bottom up parsers–Shift–reduce, operator precedence and LR. YACC package on Unix system.
8. Operating Systems (with Case Study of Unix) : Main functions of operating systems, Multiprogramming, multiprocessing
and multitasking.
Memory Management. Virtual memory, paging, fragmentation.
Concurrent Processing. Mutual exclusion, Critical regions, lock and unlock.
Scheduling. CPU scheduling, IO scheduling, Resource scheduling, Deadlock and scheduling algorithms. Banker's algorithm for
deadlock handling.
UNIX. The Unix System File system process management, bourne shell, shell variables, command line programming.
Filters and Commands. Pr, head, tail, cut, paste, srt, uniq, tr. join, etc., grep, egrep, fgrep, etc., sed, awk, etc.
System Calls (like). Create, open, close, read, write, iseek, link, unlink, fstat. umask, chmod, exec, fork, wait, system.
9. Software Engineering : System Development Life Cycle (SDLC). Steps, water fall model, Prototypes, Spiral model.
Software Metrics. Software Project Management.
Software Design. System design, detailed design, function oriented design, object oriented design, user interface design. Design
level metrics.
Coding and Testing. Testing level metrics. Software quality and reliability. Clean room approach, software re-engineering.
10. Current Trends and Technologies : The topics of current interest in Computer Science and Computer Applications shall be
covered. The experts shall use their judgement from time to time include the topics of popular interest, which are expected to be
known for an application development software professional, currently, they include:
Parallel Computing : Parallel virtual machine (pvm) and message passing interface (mpi) libraries and calls. Advanced
architectures. Today's fastest computers.
Mobile Computing : Mobile connectivity - Cells, Framework, wireless delivery technology and switching methods, mobile
information access devices, mobile data internetworking standards, cellular data communication protocols, mobile computing
applications. Mobile databases – protocols, scope, tools and technology. M-business.
E-Technologies : Electronic Commerce. Framework, Media Convergence of Applications, Consumer Applications, Organisation
Applications. Electronic Payment Systems. Digital Token, Smart Cards, Credit Cards, Risks in Electronic Payment System,
Designing Electronic Payment Systems.
Electronic Data Interchange (EDI). Concepts, Applications, (Legal, Security and Privacy) issues, EDI and Electronic Commerce,
Standardisation and EDI, EDI Software Implementation, EDI Envelope for Message Transport, Internet-Based EDI.
Digital Libraries and Data Warehousing. Concepts, Types of Digital documents, Issues behind document. Infrastructure,
Corporate Data Warehouses.
Software Agents. Characteristics and Properties of Agents, Technology behind Software Agents (Applets, Browsers and Software
Agents).
Broadband Telecommunications. Concepts, Frame Relay, Cell Relay, Switched Multi-megabit Data Service, Asynchronous
Transfer Mode.
Main concepts in Geographical Information System (GIS), E-cash, E-Business, ERP packages.
Data Warehousing. Data Warehouse environment architecture of a data warehouse methodology, analysis, design, construction
and administration.
Data Mining. Extracting models and patterns from large database, data mining techniques, classification, regression, clustering,
summarisation, dependency modelling, link analysis, sequencing analysis, mining scientific and business data.
Windows Programming. Introduction to Windows programming - Win 32, Microsoft Foundation Classes (MFC), Documents
and views, Resources, Message handling in windows.
Simple Applications (in windows). Scrolling, splitting views, docking toolbars, status bars, common dialogs.
Advanced Windows Programming. Multiple Document Interface (MDI), Multithreading, Object Linking and Embedding (OLE).
Active X controls, Active Template Library (ATL). Network programming.

4
 Search on TG: @apna_pdf
PAPER-III
(CORE Group)
Unit-I : Combinational Circuit Design, Sequential Circuit Design, Hardwired and Micro-programmed processor design,
Instruction formats. Addressing modes, Memory types and organisation, Interfacing peripheral devices, Interrupts.
Microprocessor architecture, Instruction set and Programming (8085, P-III/P-IV), Micro-processor applications.
Unit-II : Database Concepts, ER diagram, Data Models, Design of Relational Database, Normalisation, SQL and QBE, Query
Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and
Distributed Database Systems, Object Oriented Database Management Systems (Concepts, Composite objects, Integration with
RDBMS applications), ORACLE.
Unit-III : Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard,
Applications. Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.
Unit-IV : Programming language concepts, paradigms and models. Data, Data types, Operators, Expressions, Assignment. Flow
of control–control structures, I/O statements, User-defined and built-in functions, Parameter passing.
Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference semantics and their implementation.
Principles, functions, lists, types and polymorphisms, higher order functions, lazy evaluation, equations and pattern matching.
Principles, horn clauses and their execution, logical variables, relations, data structures, controlling the search order, program
development in prolog, implementation of prolog, example programs in prolog.
Principles of parallelism, coroutines, communication and execution. Parallel Virtual Machine (PVM) and Message Passing
Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well as MPI paradigm for simple problems like matrix
multiplication.
Preconditions, post-conditions, axiomatic approach for semantics, correctness, denotational semantics.
Compiler structure, compiler construction tools, compilation phases. Finite Automata, Pushdown Automata. Non-determinism
and NPA, DPDA and PDAs and languages accepted by these structures. Grammars, languages-types of grammars-type 0, type 1,
type 2 and type 3. The relationship between types of grammars and finite machines. Pushdown automata and Context Free
Grammars, Lexical Analysis – regular expressions and regular languages. LEX package on Unix Conversion of NFA to DFA.
Minimising the number of states in a DFA. Compilation and Interpretation. Bootstrap compilers.
Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees as rightmost and leftmost derivations.
Bottom up parsers - shift-reduce, operator precedence and LR. YACC package on Unix system. Topdown parses-left recursion
and its removal .Recursive descent parser. Predictive parser, Intermediate codes – Quadruples, triples, intermediate code
generation, code generation, code optimization.
Unit-V : Analog and Digital transmission, Asynchronous and Synchronous transmission, Transmission media, Multiplexing and
Concentration, Switching techniques, Polling.
Topologies, Networking Devices, OSI Reference Model, Protocols for - (i) Data link layer, (ii) Network layer and (iii) Transport
layer, TCP/IP protocols, Networks security. Network administration.
Unit-VI : Definition, Simple and Composite structures, Arrays, Lists, Stacks queues, Priority queues, Binary trees, B-trees,
Graphs.
Sorting and searching Algorithms, Analysis of Algorithms, Interpolation and Binary Search, Asymptotic notations – big ohm;
omega and theta. Average case analysis of simple programs like finding of a maximum of n elements. Recursion and its
systematic removal. Quicksort–non-recursive imple-mentation with minimal stack storage. Design of Algorithms (Divide and
Conquer, Greedy method, Dynamic programming, Back tracking, Branch and Bound). Lower bound theory, Non-deterministic
algorithm-Non-deterministic programming constructs. Simple non-deterministic programs. NP-hard and NP-complete problems.
Unit-VII : Object, messages, classes, encapsulation, inheritance, polymorphism, aggregation, abstract classes, generalization as
extension and restriction. Object oriented design. Multiple inheritance, metadata.
HTML, DHTML, XML, Scripting, Java, Servelets, Applets.
Unit-VIII : Software development models, Requirement analysis and specifications, Software design, Programming techniques
and tools, Software validation and quality assurance techniques, Software maintenance and advanced concepts, Software
management.
Unit-IX : Introduction, Memory management, Support for concurrent process, Scheduling, System deadlock, Multiprogramming
system, I/O management, distributed operating systems, Study of Unix and Windows NT.
Unit-X : Definitions, Al approach for solving problems. Automated Reasoning with propositional logic and predicate logic-
fundamental proof procedure, refutation, resolution, refinements to resolution (ordering/pruning/restriction strategies).
State space representation of problems, bounding functions, breadth first, depth first, A, A & AO*, etc. performance comparison
of various search techniques.

5
 Search on TG: @apna_pdf
Frames, scripts, semantic nets, production systems, procedural representations. Prolog programming.
Components of an expert system, knowledge representation and Acquisition techniques, Building expert system and Shell.
RTNs, ATNs, Parsing of Ambiguous CFGs. Tree Adjoining Grammars (TAGs). Systems approach to planning, Designing,
Development. Implementation and Evaluation of MIS.
Decision-making processes, evaluation DSS, group decision support System and case studies, Adaptive design approach to DSS
development, Cognitive style in DSS, Integrating expert and decision support systems.

PAPER-III (Electives)
Elective-I : Theory of Computation. Formal language, Need for formal computational models, Non-computational problems,
diagonal argument and Russel's paradox.
Deterministic Finite Automation (DFA), Non-deterministic Finite Automation (NFA), Regular languages and regular sets,
Equivalence of DFA and NFA. Minimising the number of states of a DFA. Non-regular languages and Pumping lemma.
Pushdown Automation (PDA), Deterministic Pushdown Automation (DPDA), Non-equivalence of PDA and DPDA.
Context free Grammars. Grelbach Normal Form (GNF) and Chomsky Normal Form (GNF), Ambiguity, Parse Tree
Representation to Derivations. Equivalence of PDA's and CFG's. Parsing techniques for parsing of general CFG's – Early's,
Cook-Kassami-Younger (CKY) and Tomita's parsing.
Linear Bounded Automata (LBA). Power of LBA. Closure properties.
Turing Machine (TM). One type, multitape. The notions of time and space complexity in terms of TM. Construction of TM of
simple problems. Computational complexity.
Chomsky Hierarchy of Languages. Recursive and recursively-enumerable languages.
Elective-II : Models for Information Channel: Discrete Memoryless Channel, Binary Symmetric Channel (BSC), Burst Channel,
Bit-error rates, Probability, Entropy and Shannon's measure of information. Mutual information. Channel capacity theorem. Rate
and optimality of Information transmission.
Variable length Codes: Prefix Codes. Huffmann Codes, Lempel Ziew (LZ) Codes. Optimality of these codes, Information content
of these codes.
Error Correcting and detecting Codes. Finite fields. Hamming distance, Bounds of codes, Linear (Parity Check) codes, Parity
check matrix, Generatory matrix, Decoding of linear codes, Hamming codes. Image Processing. Image registration, Spatial
Fourier Transforms, Discrete Spatial (20 dimensional) Fourier Transforms, Restoration, Lossy Compression of images (pictures).
Data Compression Techniques. Representation and compression of text, sound, picture and video files (based on the JPEG and
MPEG standards).
Elective-III : Linear Programming Problem (LPP) in the standard form, LPP in Canonical form. Conversion of LPP in Standard
form to LPP in Canonical form. Simplex – Prevention of cyclic computations in Simplex and Tableau, Big-M method, dual
simplex and revised simplex.
Complexity of simplex algorithms.
Exponential behaviour of simplex.
Ellipsoid method and Karmakar's method for solving LPPs. Solving simple LPPs through these methods. Comparison of
complexity of these methods.
Assignment and Transportation Problems. Simple algorithms like Hungarian method, etc.
Shortest Path Problems. Dijkstra's and Moore's method. Complexity.
Network Flow Problem. Formulation. Max-Flow Min-Cut theorem. Ford and fulkerson's algorithm. Exponential behaviour of
Ford and Fulkerson's algorithm. Malhotra-Pramodkumar-Maheshwari (MPM) Polynomial algorithm for solving Network flow
problem. Bipartite Graphs and Matchings: Solving matching problems using Network flow problems.
Matroids: Definition. Graphic and Co-graphic matroids. Matroid intersection problem.
Non-linear Programming. Kuhn-Tucker conditions. Convex functions and Convex regions. Convex programming problems.
Algorithms for solving convex programming problems-Rate of convergence of iterative methods for solving these problems.
Elective-IV : Neural Networks. Perception model, Linear separability and XOR problem. Two and three layered neural nets,
Back propagation-Convergence, Hopfield nets, Neural net learning. Applications.
Fuzzy Systems. Definition of a Fuzzy set, Fuzzy relations, Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures, Fuzzy
reasoning, Applications of Fuzzy systems.
Elective-V : Unix. Operating System, Structure of Unix Operating System, Unix commands, Interfacing with Unix, Editors and
Compilers for Unix. LEX and YACC, File system, System calls, Filters, Shell programming.
Windows. Windows environment, Unicode, Documents and Views. Drawing in a windows, Message handling, Scrolling and
Splitting views, Docking toolbars and Status bars, Common dialogs and Controls, MDI, Multithreading, OLE, Active X controls,
ATL, Database access, Network programming.

6
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2012

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. The postfix expression AB + CD–* can be 5. Networks that use different technologies can be
evaluated using a connected by using
(a) Stack (b) Tree (a) Packets (b) Switches
(c) Queue (d) Linked list (c) Bridges (d) Routers
Ans. (a) : Postfix expression can be evaluated using Ans. (d): Routers–is a networking device that
forwards data packets between computer networks.
operand stack.
Router performs the traffic directing functions on the
2. The post order traversal of a binary tree is internet. A data packet is typically forwarded from one
DEBFCA. Find out the preorder traversal. router to another through the networks that consitude
(a) ABFCDE (b) ADBFEC their internetwork until it reaches its destination node.
(c) ABDECF (d) None of the above Router works at layer 3 of OSI model.
Ans. (c) ABDECF – Because 6. Both hosts and routers are TCP/IP protocol
software. However, routers do not use protocol
By post order traversal, we cannot draw unique binary
from all layers. The layer for which protocol
tree even with preorder and post order cannot define software is not needed by a router is
unique binary tree. (a) Layer–5 (Application)
A (b) Layer–1 (Physical)
(c) Layer–3 (Internet)
B C (d) Layer–2 (Network Interface)
Ans. (a) : Layer–5 (Application)–Because Routing is
D E F a way to get one packet from one destination to the
next. So (Application) layer–5 includes all the higher
⇒ After considering this chart or binary tree, the
protocols. So the answer is Layer–5 (Application)
entire traversal of the tree would be ABDECF.
7. In multiuser database if two users wish to
So the answer is option c.
update the same record at the same time, they
Type First Second Third are prevented from doing so by
in order L-Left RO-Root R-Right (a) Jamming (b) Password
pre order RO-Root L-Left R-Right (c) Documentation (d) Record lock
post order L-Left R-Right RO-Root Ans. (d): Record lock– is the technique of preventing
simultaneous access to data in a database, to prevent
3. The branch logic that provides making inconsistent results. If a collision is occure, both of the
capabilities in the control unit is known as senders will send a jamming signal over the Ethernet.
(a) Controlled transfer 8. A binary search tree is a binary tree
(b) Conditional transfer (a) All items in the left subtree are less than root
(c) Unconditional transfer (b) All items in the right subtree are greater than
(d) None of the above or equal to the root
Ans. (a) : Controlled transfer–that provider making (c) Each subtree is itself a binary search tree
capabilities in the control unit is unknown as control (d) All of the above
transfer. Ans. (d) : All of the above–The above mentioned
properties are mentioned in book of Data Structures
4. The number of colours required to properly
(DS). According to summary on binary search trees the
colour the vertices of every planer graph is following properties are
(a) 2 (b) 3 ⇒ All items in the left subtree are less than root.
(c) 4 (d) 5 ⇒ All items in the right subtree are greater than
Ans. (a) : According to the 4-color theorem states that or equal to root.
the vertices of every planar graph can be colored with ⇒ Each subtree is itself a binary search tree
at most 4 colors so that no two adjacent vertices (BST).
receive the same color. So the correct answer would be (d).
UGC NET JRF Computer Science June 2012 Paper-II 7 YCT
 Search on TG: @apna_pdf
9. What deletes the entire file except the file A non-leaf node with k children contains (k-1) keys.
structure? All leaves appear in the same level.
(a) ERASE (b) DELETE It cannot be guaranteed in binary tree, AVL tree and
(c) ZAP (d) PACK expression tree.
Ans. (C) : ZAP–Because ZAP Command removes all 14. Which of the following TCP/IP Internet
records from a table, leaving just a table structure. protocol is diskless machine uses to obtain its
ERASE command deletes a file from disk. IP address from a server?
10. Which command is the fastest among the (a) RAP (b) RIP
following? (c) ARP (d) X. 25
(a) COPY TO <NEW FILE> Ans. (c) : Because, ARP (Address Resolution
(b) COPY STRUCTURE TO <NEW FILE> Protocol) is a protocol in TCP/IP protocol suite. This
(c) COPY FILE <FILE 1> <FILE 2> protocol is used for Basic TCP/IP Operations. ARP is
(d) COPY TO MFILE-DAT DELIMITED used to find the Ethernet (H/W) address from a
specific IP number.
Ans. (b) : Copy structure to <new file> is just copying
the structure only. 15. Decryption and encryption of data are the
responsibility of which of the following layer?
11. B + tree are preferred to binary tree in
(a) Physical layer (b) Data Link layer
Database because
(c) Presentation layer (d) Session layer
(a) Disk capacity are greater than memory
capacities Ans. (c) : Service by Presentation layer:
(b) Disk access is much slower than memory Data conversion
access Character code translation
(c) Disk data transfer rates are much less than Compression
memory data transfer rate Encryption and decryption
(d) Disks are more reliable than memory 16. In which circuit switching, delivery of data is
Ans. (b) : Disk access is much slower than memory delayed because data must be stored and
+ retrieved from RAM?
access. The major advantage of B tree is in reducing
the number of last level access which would be from (a) Space division (b) Time division
disk in case of large data size, so B+ tree preferred (c) Virtual (d) packet
option (b). Ans. (b) : Time division
12. A Transaction Manager is which of the Because, Time division multiplexing (TDM) is a
following? method of transmitting and receiving independent
(a) Maintains a log of transactions signals over a common signal Path by means of
(b) Maintains before and after database images synchronized switches at each end of the transmission
(c) Maintains appropriate concurrency control line so that each signal appears on the line only a
(d) All of the above fraction of time in alternating pattern.
Ans. (d) : All of the above 17. In which Routing Method do all the routers
have a common database?
Because transaction manager performs all the
(a) Distance vector (b) Link state
operation mentioned in option A, B & C. So the
answer is option (d). (c) Link vector (d) Dijkestra method
Ans. (b) : Link state necessary database require more
13. Leaves of which of the following trees are at the
memory than a distance vector requires.
same level?
Link state, the complex algorithm requires more CPU
(a) Binary tree (b) B–tree
time than a distance vector protocol requires.
(c) AVL–tree (d) Expression tree
The flooding of link state packets adversely affects
Ans. (b) : A B–tree is a tree data structure in which available bandwidth, particularly in unstable
each node has at most two children, which one referred internetworks.
as left child and the right child.
18. Page Shift Keying (PSK) Method is used to
According to Knuth’s definition, a B-tree of order m
modulate digital signal at 9600 bps using 16
is a tree which satisfies the following properties: level. Find the line signals and speed (i.e.
Every node has at most m children Modulation rate).
Every non-leaf node has at least m/2 children (a) 2400 bauds (b) 1200 bauds
The root has at least two children if it is not leaf node. (c) 4800 bauds (d) 9600 bauds
UGC NET JRF Computer Science June 2012 Paper-II 8 YCT
 Search on TG: @apna_pdf
Ans. (a) : 2400 bauds 22. Validation means
Modulation Baud rate Bit rate (a) Are we building the product right
4 – PSK N 2N (b) Are we building the right product
8 – PSK N 3N (c) Verification of fields
(d) None of the above
16 – PSK N 4N
Because, two values are provided, one is bps which is Ans. (b) : Are we building the right product
nothing but bits per second which is 9600 and also Because validation means "are we building the right
level which is 16. According to table given above for product" and verification means "are we building the
a 16–PSK give a baud rate N. the bit rate would be product right".
4N. Here bps is provides which is 9600. In order to 23. If a process is under statistical control, then
calculate the baud rate we have to divide bs/4. it is
Because the signal level is 16. So the answer would be (a) Maintainable (b) Measurable
9600/4 = 2400 baud. (c) Predictable (d) Verifiable
19. The station to hub distance in which it is 2000 Ans. (c) : Predictable is a real valued stochastic
metres. process whose values are known in a sense, just in
(a) 100 Base-Tx (b) 100 Base-Fx advance of time. Because, predictable process is also
(c) 100 Base-T4 (d) 100 Base-T1 said to be under statistical control.
Ans. (b) : 100 Base-Fx 24. In a function oriented design, we
Fast Ethernet is refered by 100 Base-x standard has (a) Minimize cohesion and maximize coupling
three specification. Here 100 refers to the speed.
(b) Maximize cohesion and minimize coupling
1. 100 Base T4
(c) Maximize cohesion and maximize coupling
2. 100 Base Tx
(d) Minimize cohesion and minimize coupling
3. 100 Base Fx
Ans. (b) : Maximize cohesion and minimize
⇒ 100 Base Fx uses the 2-standard fibre optic
cable and the station to hub distance is 2000 coupling.
meters. Because, the design purpose is to making coupling
minimize and maximize the cohesion. Cohesion is a
20. Main aim of software engineering is to produce
way to understand that how close or bound your
(a) Program
module is, and coupling is the level of interactivity
(b) Software
between modules for a good design to happen.
(c) Within budget
Cohesion should be more and coupling should be less.
(d) Software within budget in the given schedule
25. Which of the following metric does not depend
Ans. (d) : Because every software would be produce
on the programming language used?
within the specific budget and in the specific time.
(a) Line of code (b) Function count
21. Key process areas of CMM level 4 are also
(c) Member of token (d) All of the above
classified by a process which is
(a) CMM level 2 (b) CMM level 3 Ans. (b) : Function count.
(c) CMM level 5 (d) All of the above Because function count does not depend on
programming language. Function count are a unit of
Ans. (c) : CMM level 5
measure a software just like a unit of measure for
Because, In CMM Model there are five maturity levels
temperature would be degree.
is identified by the number 1 to 5. They are–
(1) Initial, (2) Managed, (3) Defined, (4) Quantitavely 26. A/B + tree index is to be built on the name
Managed, (5) Optimizing attribute of the relation STUDENT, Assume
If a organisation is at level 2. It means it has crossed that all students names are of length 8 bytes,
over level 1 and the same holds true and subsequent disk block are of size 512 bytes and index
levels. At level 4, the process at level 3 is also pointers are of size 4 bytes. Given this scenario
included. CMM Level 5 is not correct because the what would be the best choice of the degree (i.e.
question only talks about level 4. CMM level 2 is not number of pointers per node) of the B + tree?
correct because level 3 includes level & as well. So (a) 16 (b) 42
option (c) is correct. (c) 43 (d) 44
UGC NET JRF Computer Science June 2012 Paper-II 9 YCT
 Search on TG: @apna_pdf
Ans. (c) : (43) Ans. (d) : Varies irregularly
Because, Now we see how it comes, Because, ⇒ Turn around time is the interval of time
Let n be the degree between the submission of a process and its
given, key size (length of the name attribute of student) completion.
= 8 bytes (k), index pointer size = 4 bytes (b) ⇒ Wait time is the amount of time a process has
Disk Block Size = 512 bytes been waiting in the ready queue
Degree of B+ tree can be calculated if we know the ⇒ Response time is the time taken between the
maximum number of key a internal code can have. The process submission and the first response
formula is, produced.
⇒ (n–1) k + n * b = block size In RR algorithm, value of time slice, plays a crucial
⇒ (n–1) * 8 + n * 4 = 512 role in deciding how effective the algorithm is. If
⇒ 8n – 8 – 4n = 512 quantum time is too small then it could be like context
⇒ 12 = 520 switching and if quantum time is high, the RR be
⇒ n = 520/12 = 43 (Option c) haves like FCFS, the average response time varies
27. The In order traversal of the tree will yield a irregularly. So the answer is option (d).
sorted listing of elements of tree in 31. Resources are allocation to the process non-
(a) Binary tree (b) Binary search tree share below basis is :
(c) Heaps (d) None of the above (a) Mutual exclusion (b) Hold and wait
Ans. (b) : Binary search tree (c) No pre-emption (d) Circular wait
Because, In BST all elements to the root of the tree will Ans. (a) : Mutual exclusion is a program object that
lesser than the root. Also elements greater than the root prevents simultaneous access to a shared resource.
will be right of the root, so the answer is Option (b) This concept is used in concurrent programming with a
28. Mobile IP provides two basic functions critical section, a piece of code in which processes or
(a) Route discovery and registration threads access a shared resource.
(b) Agent discovery and registration 32. Catch on and interleaved memories are ways of
(c) IP binding and registration speeding up memory access between CPU and
(d) None of the above slower RAM. Which memory models are best
Ans. (b) : Agent discovery and registration suited (i.e. Improves the performance mostly
Because, Mobile IP is the basic behind how wireless which program)
devices offer IP connectivity. (1) Cached memory is best suited for small loops.
Agent discovery: A mobile node discovers its foreign (2) Interleaved memory is best suited for small
and home agents during discovery. loops
Registration: the mobile node registers its current (3) Interleaved memory is best suited for large
location with the foreign agent and him agent during sequential code.
registration. Are two basic functions involved here, so (4) Cached memory is best suited for large
the option is (b). sequential code.
29. Pre-emptive scheduling is the strategy of (a) 1 and 2 are true (b) 1 and 3 are true
temporarily suspending a gunning process (c) 4 and 2 are true (d) 4 and 3 are true
(a) Before the CPU time slice expires Ans. (b) : Interleaved memory is best suited for
(b) To allow starving processes to run small 100 ps.
(c) When it requests I/O Because, Here multiple memory chips are grouped
(d) To avoid collision together to form what we are known as banks. Each of
Ans. (a) : Before the CPU time slice expires then take turns for supplying data. An interleaved
Because, Every process is allocated a specific time memory with "n" banks is said to be n-way
slice in the CPU and it runs for that entire time. In pre- interleaved. Macintosh system are considered to be one
emptive scheduling even before the process time slice using memory interleaving.
expires. It is temporarily suspended from its execution. 33. Consider the following page trace : 4, 3, 2, 1, 4,
So the option is (a). 3, 2, 1, 5 Percentage of page fault that would
30. In round robin CPU scheduling as time occur if FIFO page replacement algorithm is
quantum is increased the average turn around used with number of frame for JOB m = 4 will
time be :
(a) Increases (b) Decreases (a) 8 (b) 9
(c) Remains constant (d) Varies irregularly (c) 10 (d) 12
UGC NET JRF Computer Science June 2012 Paper-II 10 YCT
 Search on TG: @apna_pdf
Ans. (c) : 10 37. Interrupts which are initiated by an instruction
Because, reference string is 4, 3, 2, 1, 4, 3, 2, 1, 5 are
number of frames m = 4 (a) Internal (b) External
⇒ First 4 references (4, 3, 2, 1) cause page faults and (c) Hardware (d) Software
brought into empty frames Ans. (c) : Hardware
⇒ next reference (4) is already available and so there Interrupts are of three types–(1) External interrupts,
is no page fault (2) Internal interrupts, (3) Software interrupts.
⇒ next reference (3) is also ready available and so Hardware interrupts are used by devices to
there is no page fault communicate that they require attention from the
⇒ the next reference (5) replaces page 4 which was operating system.
brought the first no. of page fault = 5
38. printf("%c" 100)
⇒ next reference (4) replace page 3 which is the next
to come in no. of page faults = 6 (a) Prints 100
⇒ next reference (3) replaces 2 no. of page faults till (b) Prints ASCII equivalent of 100
now = 7 (c) Prints garbage
⇒ next reference (2) replaces 1 a which was to last (d) None of the above
pages to come in no. of page fault till now = 8 Ans. (b) : Prints ASCII equivalent of 100
⇒ next reference (1) replaces 5 which as the first to Because the %c format prints the ASCII equivalent of
come in the second cycle no. of page faults till now the value.
=9
39. For the transmission of the signal, Bluetooth
⇒ the last reference in the reference string is 5 which
wireless technology uses
will replace 4 no. of page faults till now = 10
(a) Time division multiplexing
⇒ the page faults are the 10 so the answer is option (c).
(b) Frequency division multiplexing
34. Check sum used along with each packet
computes the sum of the data, where data is (c) Time division duplex
treated as a sequence of (d) Frequency division duplex
(a) Integer (b) Character Ans. (c) : Time division duplex is the application of
(c) Real numbers (d) Bits time division multiplexing to separate outward and
Ans. (b) : Character return signals.
Because, check sum is the error detecting mechanism Here Bluetooth technology uses time division duplex
when data is treated as a sequence of character. parity transmission duplex.
is a mechanism used when data is treated as a sequence 40. Consider the following statements
of bits. a. Recursive languages are closed under
35. If an integer needs two bytes of storage, then complementation.
the maximum value of a signed integer is b. Recursively enumerable languages are closed
(a) 216 – 1 (b) 215 – 1 under union.
16
(c) 2 (d) 215 c. Recursively enumerable languages are closed
Ans. (b) : 215 – 1 under complementation.
In case of magnitude Representation the Range is from Which of the above statements are true?
(2n–1–1) to (2n–1–1)
(a) 1 only (b) 1 and 2
Min no. that can be represent in this system is –(2n–1–1)
(c) 1 and 3 (d) 2 and 3
Max no. that can be represent in this system is (2n–1–1)
In case 2's complement no. system the range is –2n–1 Ans. (b) : 1 and 2
to 2n–1–1 Because, recursive languages are closed under the
Max no. that can be represent in this system 2n–1–1 following operations–
So, Max no. can be represented here which 2n–1–1 is (1) Keene star, (2) concatenation, (3) union, (4)
2 –1 → 215–1
16 intersection, (5) complement, (6) set difference
36. Which of the following logic families is well Recursively enumerable languages are enclosed under
suited for high-speed operations? the following operation.
(a) TTI (b) ECL (1) Keene star, (2) concatenation, (3) union, (4)
(c) MOS (d) CMOS intersection
Ans. (b) : ECL Recursively enumerable languages are not closed
Because, ECL (Emitter coupled logic) is a high speed under compliment, so the statement (1) and (2) are
integrated circuit bipolar transistor logic family. only true.

UGC NET JRF Computer Science June 2012 Paper-II 11 YCT

 Search on TG: @apna_pdf
41. What is the routing algorithm used by RIP and 45. .................... is a satellite based tracking system
IGRP? that enables the determination of person's
(a) OSPF (b) Link-state position.
(c) Dynamic (d) Dijkstra vector (a) Bluetooth
(b) WAP
Ans. (d) : Dijkestra vector
(c) Short Message Service
Because, RIP (Routing information Protocol) and
(d) Global Positioning System
IGRP (interior Gateway Routing Protocol) are the
example of distance Vector Routing Protocol and open Ans. (d) : Global Positioning System is a satellite
based navigation system.
shortest path (OSPF) is an example of Link State
Routing Protocols. Distance vector algorithms are 46. A complete microcomputer system consists of
based on Belma and ford algorithm. Link State (a) Microprocessor
Routing Protocols is based on Dijkestra algorithm. So (b) Memory
the options are OSPF, link state, dynamic are ruled out. (c) Peripheral equipment
So the answer is option (d). (d) All of the above
42. Identify the incorrect statement Ans. (d) : All of the above
(a) The overall strategy drives the E-Commerce Because, In complete microcomputer system there is a
Microprocessor or and a memory part as well and there
data warehousing strategy.
is peripheral equipment part is also there, so the correct
(b) Data warehousing in an E-Commerce option is (d).
environment should be done in a classical
47. Where does a computer add and compare
manner.
data?
(c) E-Commerce opens up an entirely new world (a) Hard disk (b) Floppy disk
of web server.
(c) CUP chip (d) Memory chip
(d) E-Commerce security threats can be grouped
Ans. (c) : CUP chip
into three major categories.
Because, Hard disk, Floppy disk, Memory chip are the
Ans. (d) : The threat environment for E-Commerce storage devices so these are ruled out and now the
data warehousing application, security threats can be correct option is (c).
grouped into three major categories. 48. Pipelining strategy is called implement
Loss of data secrecy (a) Instruction execution
Loss of data integrity (b) Instruction prefetch
Loss of denial of service (c) Instruction decoding
Because, E-commerce security threats are more than 3 (d) Instruction manipulation
in number and so the incorrect statement is d. Ans. (b) : Instruction prefetch is often combined with
43. Reliability of software is directly dependent on pipelining in an attempt to keep the pipeline busy.
(a) Quality of the design So the option is (b).
(b) Number of errors present 49. Which of the following data structure is linear
(c) Software engineers experience type?
(d) User requirement (a) Strings (b) Lists
(c) Queues (d) All of the above
Ans. (b) : Software reliability is measured in term of
Mean time between failures. Reliability of software is Ans. (d) : All of the above
number between 0 and 1. Reliability increases when Because, strings, Link lists and queues are linear type
errors or bugs from the program are removed, so the data structure because the data of these option were
arranged or organized in sequential or linearly, where
option is b.
data elements attached one after another.
44. ..................... is not an E-Commerce application.
50. To represent hierarchical relationship between
(a) House banking
elements, which data structure is suitable?
(b) Buying stocks (a) Dequeue (b) Priority
(c) Conducting an auction (c) Tree (d) All of the above
(d) Evaluating an employee Ans. (c) : A Tree structure is a way of representing the
Ans. (d) : Evaluating an employee is not an E- hierarchical nature of a structure in a graphical form.
commerce application. so the answer is option (c).
UGC NET JRF Computer Science June 2012 Paper-II 12 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2012

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. Consider the following pseudo code segment: 3. The concept of pipelining is most effective in
K: = O for i1: = 1 to n for i2 : = 1 to i1 : For im: improving performance if the tasks being
=1to im – 1 K: = K + 1 The value of K after the performed in different stages:
execution of this code shall be (a) require different amount of time
(a) C (n + m – 1, m) (b) require about the same amount of time
(b) C (n – m + 1, m) (c) require different amount of time with time
difference between any two tasks being same
(c) C (n + m – 1, n)
(d) require different amount with time difference
(d) C (n – 1 + 1, n)
between any two tasks being different
Ans. (a) : C (n + m – 1, m)
Ans. (b) : Require about the same amount of time.
Because, In order to understand the solution to this
Because, Pipe lining is a technique to build fast
problem let us consider some sample value of n and m. processors it allows the execution of multiple
Let us say n = 3 and m = 2. The value of m also instruction by overlapping them. Pipe lining can
decides the number of inner loop we have. When we executes multiple instructions. So it requires the same
say m = 2, the total number of loops we have is 2 only amount of time. So that the answer is B.
n decides the range of outer most loop, so the 4. What is Granularity?
psudocode can be under stood as (a) The size of database
k=0 (b) The size of data item
for i = 1 to n (c) The size of record
for m = 1 to i (d) The size of file
k=k+1 Ans. (b) : The size of data item is often called the data
⇒ For the value of n = 3 and m = 2, the value of k item granularity.
would be incriminated in following manner 5. Suppose that given application is run on a 64-
process or machine and that 70 percent of the
application can be parallelized. Then the
expected performance improvement using
Amdahl's law is
(a) 4.22 (b) 3.22
(c) 3.32 (d) 3.52
Ans. (b) : 3.22
Because, According to Amdahl's law, in case
of parallelization, if p is the proportion of the program
that can be made parallel, then (1-p) is the proportion
2. In Delta Rule for error minimization can be paralyzed. Then the maximum speedup that can
(a) Weights are adjusted w.r. To change in the be achieved by using N processor, S (N) = 1/(1-P) +
output P/N, where N refers the number of processor and P
(b) Weights are adjusted w.r. To difference refers to the proportion that can be paralyzed.
between desired output and actual output 6. If two fuzzy sets A and B are given with
(c) Weights are adjusted w.r. To difference membership functions µA(x) = {0.2, 0.4, 0.8,
between input and output 0.5, 0.1} µB(x) = {0.1, 0.3, 0.6, 0.3, 0.2} Then
(d) None of the above the value of µ ––– A∩B will be
(a) {0.9, 0.7, 0.4, 0.8, 0.9}
Ans. (b) : in delta rule for error minimization, weights
(b) {0.2, 0.4, 0.8, 0.5, 0.2}
are adjusted with respect to difference between desired
(c) {0.1, 0.3, 0.6, 0.3, 0.1}
output and actual output. (d) {0.7, 0.3, 0.4, 0.2, 0.7}
UGC NET JRF Computer Science June 2012 Paper-III 13 YCT
 Search on TG: @apna_pdf
Ans. (a) : 10. In an image compression system 16384 bits are
Give two fuzzy set used to represent 256 × 256 image with 256
µÁ ={0,2,0.4,0.8, 0.5, 0.1} gray level. What is the compression ratio for
µÁ ={0.1,0.3,0.6,0.3,0.2} this system?
(a) 1 (b) 2
so, µÁUB(x)= {0.2,0.4, 0.8, 0.5, 0.2}
(c) 4 (d) 8
and
Ans. (*) number of bits required to store a 256×256
µÁUB(x)= {0.8, 0.6, 0.2, 0.5, 0.8}
image with 256 gray level is
= 1-{0.1,0.3, 0.6, 0.3, 0.1}
256 gray level is=28
={0.9, 0.7, 0.4, 0.7, 0.9} Therefore, compression ratio = 256×256×8/16384 =32
7. Match the following: 11. X.25 is .......... Network.
(a) OLAP 1. Regression (a) Connection Oriented Network
(b) OLTP 2.Data Warehouse (b) Connection less Network
(c) Decision Tree 3. RDBMS (c) Either Connection Oriented or Connection
(d) Neural Network 4. Classification Less
(a) 2 3 1 4 (b) 2 3 4 1 (d) Neither Connection Oriented nor Connection
(c) 3214 (d) 3241 Less
Ans. (b) : In OLTP database there is detailed and Ans. (a) X.25 is an ITU-T standard protocol suite for
current data. In OLTP database schema used to store packet switched Wide Area Network communication.
transaction data usually 3NF. OLAP is characterized NSAP addressing facility was added in the X.25
revision of the specification, and this enabled X.25 to
by relatively low volume of transactions.
better meet the requirements of OSI connection-
Decision tree is used for classification of data in data
Oriented Network service (CONS).
mining and AI.
12. Which of the following can be used for
Neural networks are used for the purpose of
clustering of data?
unsupervised learning, regression or classification.
(a) Single lever perception
8. Which level of Abstraction describes what data (b) Multilayer Perception
are stored in the Database? (c) Self organizing map
(a) Physical level (d) Radial basis function
(b) View level Ans. (c) : Self Organizing map is a type of Artificial
(c) Abstraction level Neural Network that is trained using unsupervised
(d) Logical level learning to produce a low dimensional maps. In maps
Ans. (d) : Logical level consisting of thousands of nodes, it is possible to
Because, Logical level describes what data are stored perform cluster operations on the map itself.
in the data base and what relationship among those 13. Which of the following is scheme to deal with
data. deadlock?
(a) Time out (b) Time in
9. The problem that occurs when one transaction
(c) Both A & (B) (d) None of the above
updates a database item and them the
Ans. (a) : Time out
transaction fails for some reason is .........
Because, One of the strategy to avoid dead lock
(a) Temporary Select Problem
situation in java multithreading is using timeout.
(b) Temporary Modify Problem Suppose, one thread has acquired lock on one resource
(c) Dirty Read Problem and now waiting for lock on another resource. After
(d) None certain time period if it can not acquire lock on
Ans (c) : The temporary (or dirty read) problem this resource and then it should stop waiting for lock on
problem occurs when one transaction updates a resource 2. Also it should release lock on resource 1.
database item and then transaction fails for some Thus lock is avoided, so the Answer is a
reason. The updated item is accessed by another 14. It the pixels of an image are shuffled then the
transaction before it is changed back to its original parameter that may change is
value. (a) Histogram (b) Mean
(c) Entropy (d) Covariance
UGC NET JRF Computer Science June 2012 Paper-III 14 YCT
 Search on TG: @apna_pdf
Ans. (d) : Covariance 18. Consider a schema R (A. B. C. D) and
Because, Covariance is a measure of how much two functional dependencies A→B and C→D. Then
random variable change together. So when pixel of an the decomposition R1 (A, B) and R2 (C, D) is
image suffered then covariance is changed. (a) Dependency preserving but not lossless join
15. The common property of functional language (b) Dependency preserving and lossless join
and logical programming language (c) Lossless join but not dependency preserving
(a) Both are declarative
(d) Lossless Join
(b) both are based on 1-calculus
(c) Both are procedural Ans. (a) : Dependency preserving but not lossless join
(d) Both are functional Because, for lossless after decomposition of relation
Ans. (a) : Both are declarative into if there is any common attribute in the
Functional and logical programming languages are decomposed relation and that attribute is key in any of
characterized by declarative programming style. In relation then it is lossless.
logical programming languages, programs consist of Here no attribute are common R1 and R2
logical statements and program executes by searching so this one is not lossless
for proof of the statements. For dependency from the dependencies of the spited
16. Given the following statements: schemas then it is dependency preserving
(1) The power of deterministic finite State
here from R1 === A → B from R2 === C → D can be
machine and nondeterministic finite state
divided so it is DP, then the answer is (a)
machine are same
(2) The power of deterministic pushdown 19. The quantiser in an image-compression system
automaton and nondeterministic is a
pushdown automaton are same (a) lossy element which exploits the psycho
Which of the above is the correct statement visual redundancy
(s)? (b) lossless element which exploits the psycho
(a) Both 1 and 2 (b) Only 1 visual redundancy
(c) Only 2 (d) Neither 1 nor 2 (c) lossy element which exploits the statistical
Ans. (b) : Only (1) redundancy
Because, we are now that finite machine is of two (d) lossless element which exploits the statistical
types one is deterministic finite state machine and the redundancy
other one non deterministic finite state machine. Both
Ans. (a) : Lossy element which exploits the psycho
machine accept regular language only, so the power of
DFA = NFA, so the first statement is true. visual redundancy
There is no algorithm exist which convert NPDA into Because, Quantization, involved in image processing is
DPDA. So, power of NDPA is more than DPDA. a lossy compression technique achieved by
hence the answer is (b) compressing a range of values to single quantum
17. Let Q(x, y) denote “x + y = 0” and let there be value. When the number of discrete symbols in a given
two quantifications given as stream is reduced and the stream becomes more
(i) ∃y∀x Q(x, y) compressible.
(ii) ∀x∃y Q(x, y) which of the following is so the answer is a
valid? where x & y are real numbers. Then 20. Data Warehouse provides
(a) (i) is true & (ii) is false. (a) Transaction Responsiveness
(b) (i) is false & (ii) is true. (b) Storage. Functionality Responsiveness to
(c) (i) is false & (ii) is also false. queries
(d) both (i) & (ii) are true. (c) Demand and Supply Responsiveness
Ans. (b) (d) None of the above
∃y∀x Q(x+ y= 0 ) is false
Ans. (b) : Storage functionality responsiveness to
Since for all x single y not exist whose addition
queries
produce result 0.
i.e., x+y = 0 Because, data warehouses are supposed to provide
∀x∃y Q(x+ y=0) is true storage functionality and responsiveness oriented
Because for every x then exist y=-x whereas addition databases. Also data warehouse are set to improve the
produce result as 0. data access performance of database.

UGC NET JRF Computer Science June 2012 Paper-III 15 YCT

 Search on TG: @apna_pdf
21. A * algorithm f = g + h to estimate the cost of (c) malloc () (d) real loc ()
getting from the initial state to the goal state, Ans. (d) : real loc ()
where g is a measure of the cost of getting from Because, mal loc and cal loc are used to allocate
initial state to the current node and the dynamic memory.
function h is an estimate of the cost of getting free is used to frees the allocated memory be cal loc
from the current node to the goal state. To find and mal loc
a path involving the fewest number of steps, we Real loc is used to reallocated or modifies the previous
should set
allocated space, hence the answer is d
(a) g = 1 (b) g = 0
(c) h = o (d) h = 1 25. Which is not the correct statement (s)?
(a) Every context sensitive language is recursive.
Ans. (a) : g= 1
Because, a* algorithm is the most important form of (b) There is a recursive language that is not
best first search, context sensitive.
F=g+h (i) 1 is true, 2 is false.
g is the measure of cost getting from initial to the (ii) 1 is true and 2 is true.
current node and the function, (iii) 1 is false, 2 is false.
h is and estimate of the cost of getting from the current (iv) 1 is false and 2 is true.
node to the goal state. Ans. (b) : Since context sensitive languages are subset
Now if want to find a path involving the first number of recursive languages.
of steps then we set the cost of going from a node to its Therefore, both statements are correct.
successor (i.e. g) as a constant usually 1. hence the 26. The mechanism that binds code and data
answer is a
together and keeps them secure from outside
22. The transform which possesses the highest world is known as
'energy compaction' property is
(a) Abstraction (b) Inheritance
(a) Slant transform
(c) Encapsulation (d) Polymorphism
(b) Cosine transforms
(c) Fourier transforms Ans. (c) : Encapsulation is an OOP concept that binds
(d) Karhunen-Loeve transforms together the data and functions that manipulate the data
Ans. (d) : Karhunen-Loeve transforms and that keeps both safe form outside interference and
Because, most of the signal information is misuse. Data encapsulation led to the important OOP
concentrated in few low frequency components of the concept of data hiding.
transform, so approaching the Karjunen-Loeve 27. Identify the addressing modes of below
transforms, which is optimal in the decor relation instructions and match them:
sense. (a) ADI 1. Immediate addressing
23. Which one of the following prolog programs (b) STA 2. Direct addressing
correctly implement "if G succeeds then (c) CMA 3. Implied addressing
execute goal Pelse execute goal θ? (d) SUB 4. Register addressing
(a) if–else (G, P, θ) :– !, call (G), call (P). (i) a – 1, b – 2, c – 3, d – 4
if–else (G, P, θ) :– call (θ) (ii) a – 2, b – 1, c – 4, d – 3
(b) if–else (G, P, θ) :– call (G), !, call (P). (iii) a – 3, b – 2, c – 1, d – 4
if–else (G, P, θ) :–call (θ) (iv) a – 4, b – 3, c – 2, d – 1
(c) if–else (G, P, θ) :– call (G), call (P), !. Ans. (a) : ADI. Immediate addressing
if-else (G, P, θ) :– call (θ) Because. the instruction ADI adds same content to the
(d) All of the above accumulator. It is an immediate addressing made
Ans. (b) : If G succeeds then execute goal P else instruction. The instruction STA stores the content of
execute goal θ : the accumulator in the particular memory location
If else (G, P, θ) : call (G), !, call (P) specified as operand, CMA takes complement of the
If else (G, P, θ) : call (θ) contents of the accumulator. SUB instruction subtracts
24. The ........ memory allocation function modifies the content of the register to the contents of the
the previous allocated space. accumulator.
(a) cal loc () (b) free () Hence the answer is a
UGC NET JRF Computer Science June 2012 Paper-III 16 YCT
 Search on TG: @apna_pdf
28. Which one of the following is not a Greibach 32. The equivalent grammar corresponding to the
Normal from grammar? grammar
(a) S → a bA aA bB G : S → aA,
A → BB,
A→a
B → aBb|∈
B→b
is
(b) S → a aA AB (a) S → aA, A → BB, B → aBb
A→a (b) S → a|aA, A → BB, B → aBb|ab
B→b (c) S → a|aA, A → BB|B, B → aBb
(c) S → a A aA (d) S → a|aA, A → BB|B, B →aBb|ab
Ans. (d) : Given grammar is :
A→a
S → aA
(a) 1 and 2 (b) 1 and 3
A → BB
(c) 2 and 3 (d) 1, 2 and 3
B → aBb|∈
Ans. (c) : (2) and (3) Removing null–production from the grammar :
Because, the symbol on the right hand side of the Nullable variables are {A, B}, so,
production must be terminal. It can be followed by S→ a|aA
zero or more variables in grammar (2) of the question A → B|BB
S → ABv is the production. AB are two non-terminals B → aBb|ab
can be in GNF (Greiback Normal Form Grammar). In
33. Which one of the following statements is
grammar not allowed in GNF. So the grammar which
incorrect?
is not in GNF is (2) and (3) so the option is c (a) The number of regions corresponds to the
29. Which of the following IP address class is a cyclomatic complexity.
multicast address? (b) Cyclometric complexity for a flow graph G is
(a) Class A (b) Class B V G = N – E + 2, where E is the number of
(c) Class C (d) Class D edges and N is the number of nodes in the
Ans. (d) : IPv4 multicast addresses are defined by the flow graph.
leading address bits of 1110, originating from the class (c) Cyclometric complexity for a flow graph G is
full network design of the early internet when this V G = E – N + 2, where E is the number of
group of addresses was designated as Class D. edges & N is the number of nodes in the flow
30. While unit testing a module, it is found that for graph.
a set of test data, maximum 90% of the code (d) Cyclometric complexity for a flow graph G is
VG= P+1, where P is the number of predicate
alone were tested with a probability of success
nodes contained in the flow graph G.
0.9. The reliability of the module is
(a) at least greater than 0.9 Ans. (b) : Cyclometric complexity is a software metric
(measurement) used to indicate the complexity of a
(b) equal to 0.9
program. The complexity M is defined as :
(c) at most 0.81
M = E – N + 2P
(d) at least 1/0.81
where, E is the number of edges, N is number of
Ans. (c) : almost 0.81 vertices and P is number of connected component of
Because, code tested maximum 90% flow graph. For a single program (component) P is
Probability of success is 0.9 always equal to 1.
so the reliability of module almost 0.9 × 0.9 = 0.81 Also, the number of regions corresponds to the
hence the answer is option c cyclomatic complexity (M) and
31. The upper bound computing time of m M=P+1
coloring decision problem is where P (nodes whereas out degree more than 1) is number
(a) O (nm) (b) O (nm) of predicated notes contained in the flow graph G.
(c) O (nmn) (d) O (nmmn)
34. Consider a weighted undirected graph with
Ans. (c) : O (nmn) positive edge weights and let (u, v) be an edge
Because, the O (nmn) is the only bound of computing in the graph. It is known that the shortest path
time of M coloring. from source vertex s to u has weight 53 and
UGC NET JRF Computer Science June 2012 Paper-III 17 YCT
 Search on TG: @apna_pdf
shortest path from s to v has weight 65. Which Ans. (a) : 6, 1
statement is always true? Because, hence the answer is a (6, 1)
(a) Weight (u, v) < 12
(b) Weight (u, v) = 12
(c) Weight (u, v) ≥ 12
(d) Weight (u, v) > 12
Ans. (c) : Weight (u, v) ≥ 12
Because, if weight (u, v) < 12 then the min. weight of
(s, u) = weight of (s, u) + weight of (u, v) = 53+( <12)
will be less than 65
so that answer is c
35. Consider the regular expression (a + b) ... (a +
b) (n-times). The minimum number of states in
finite automaton that recognizes the language
represented by this regular expression contains
(a) n states 39. The following CFG S → aB | bA, A → a | as |
(b) n + 1 states bAA, B → b | bs | aBB Generates strings of
(c) n + 2 states terminals that have
(d) 2n states (a) Odd number of a's and odd number of b's
(b) Even number of a's and even number of b's
Ans. (b) : n + 1 states (c) Equal number of a's and b's
Because, without trap for 1 symbol (a + b) or b, (d) Not equal number of a's and b's
required 2 states and for 2 symbols (a + b) required 3 Ans. (c) : Given CFG is :
states and so on ............ so, n + 1 states for NFA S → aB|bA
n + 2 states for DFA (include trap state) A → a|aS|bAA
B → b|bS|aBB
asking for minimum so n + 1 states
The language of given CFG is set of all strings that
36. Number of binary trees formed with 5 nodes is have equal number of a's and b's. Other CFG may also
(a) 32 (b) 36 possible for this language.
(c) 120 (d) 42 40. Consider the following pseudo-code: If (A > B)
and (C > D) then
Ans. (d) : 42
A=A+1
2n 10 B=B+1
Cn C5 256
Because, C = = = = 42 Endif
n +1 6 6
The cyclomatic complexity of the pseudo-code
so the option is d
is
37. Are we building the right product? This (a) 2 (b) 3
statement refers to (c) 4 (d) 5
(a) Verification Ans. (b) : Cyclomatic complexity directly measures
the number of linearly independent paths through a
(b) Validation
program's source code :
(c) Testing Given, if (A > B) and (C > D) then
(d) Software quality assurance A=A+1
Ans. (b) : B=B+1
end if
Validation : Are we building the right product? Case (i) :
Verification : Are we building the product right? if (true) and (true) then
38. The following postfix expression is evaluated //execute some code
using a stack 823^/23 * + 51 * – The top two end if
Case (ii) :
elements of the stack after first * is evaluated
if (true) and (false) then
(a) 6, 1 (b) 5, 7 //don't execute code
(c) 3, 2 (d) 1, 5 end if
UGC NET JRF Computer Science June 2012 Paper-III 18 YCT
 Search on TG: @apna_pdf
Case (iii) : 43. The regular expression following DFA is
If (false) and (2nd part won't be executed) then
//don't execute code
end if
So cylomatic complexity will be 3.
41. Which layer of OSI reference model uses the
ICMP (Internet Control Message Protocol)? (a) ab*(b + aa*b)*
(a) Transport layer (b) Data link layer (b) a*b(b + aa*b)*
(c) Network layer (d) Application layer (c) a*b(b* + aa*b)
Ans. (c) : The internet Control Message Protocol
(d) a*b(b* + aa*b)*
(ICMP) is a network layer protocol that is used by
network devices, like routers, to send error message Ans. (b, d) Regular expression is
and operational information indicating, for example, L = a*b(b + aa*b)
that a requested service is not available or that a host = a*b(b* + aa*b)*
or router could not be reached.
42. Which one of the following binary search tree Both option (b) and (d) are true.
is optimal, if probabilities of successful search 44. Which diagram provides a formal graphic
and unsuccessful search are same? notation for modelling objects, classes and their
(a) relationships to one another?
(a) Object diagram (b) Class diagram
(c) Instance diagram (d) Analysis diagram
Ans. (a) Object diagram provide a formal graphic
notation for modeling objects, classes and their
relationship to another. Object diagrams are useful for
both abstract modeling and for designing actual
(b) program.
45. A computer system supports 32 bit virtual
address as well as 32 bit physical addresses.
Since the virtual address space is of same size
as that of physical address space, if we want to
get rid of virtual memory, which one of the
following is true?
(c) (a) Efficient implementation of multiuser support
is no longer possible.
(b) The processor cache can be made more
efficient.
(c) Hardware support for memory management is
not needed.
(d) CPU scheduling can be made more efficient.
(d) Ans. (c) : Virtual memory is a memory management
B technique that is implemented using both hardware and
C A software. Virtual machine can employ hardware
support to increase performance of their virtual
memory implementations.
Ans. (d) 46. The feasible region represented by the
B constraints x1 – x2 < 1, x1 + x2 ≥ 3, x1 ≥ 0, x2 ≥ 0
C A of the objective function Max Z = 3x1 + 2x2 is
(a) A polygon
(b) Unbounded feasible region
Given binary tree is balanced binary tree. So, it gives (c) A point
optimal.
(d) None of these
UGC NET JRF Computer Science June 2012 Paper-III 19 YCT
 Search on TG: @apna_pdf
Ans. (b) : The objective function is 49. In any simplex table, if corresponding to any
Max = 3x1 + 2x2 ....(i) negative ∆j, all elements of the column are
and constraints are negative or zero, the solution under the test is :
x1 + x2 = 1 ....(ii) (a) degenerate solution
x1 ≥ 0, x2 ≥ 0; x1 + x2 ≥ 3 .....(iii) (b) unbounded solution
(c) alternative solution
(d) non–existing solution
Ans. (b) : Procedure to test the basic feasible solution
for optimality by the rules given :
Rule (i) : If all ∆j ≥0, the solution under the test will be
optimal. Alternate optimal solution will exist if any
non–basic ∆j is also zero.
Feasible region is unbounded. Rule (ii) : If atleast one ∆j is negative, the solution is
47. The colour of an object is largely determined not optimal and then proceeds to improve the solution
by its diffuse reflection coefficient. If Kd = (0.8, in the next step.
0.4, 0), then what shall be the colour of the Rule (iii) : If corresponding any negative ∆j, all
object, if the light used is blue and magenta? elements of the column xj are negative or zero, then the
(a) White and Red (b) Red and Blue
solution under test will be unbounded. So, according to
(c) Black and White (d) Black and Red
rule (iii) that is unbounded solution.
Ans. (d) : The color of an object is largely determined
by its diffuse reflection coefficient (Kd). Kd is assigned 50. How many relations are there on a set with n
a value between 0.0 and 1.0. elements that are symmetric and a set with n
0.0 – for dull surface that absorbs almost all light. elements that are reflexive and symmetric?
1.0– for string surface that reflects almost all light. (a) 2n(n + 1)/2 and 2n. 3n(n – 1)/2
For the value (0.8, 0.4, 0) the color of the object will (b) 3n(n – 1)/2 and 2n(n – 1)
be black and red. (c) 2n(n + 1)/2 and 3n(n – 1)/2
48. If an instruction takes 'i' microseconds and a (d) 2n(n + 1)/2 and 2n(n – 1)/2
page fault takes an additional 'j' microseconds.
Ans. (d) : Symmetric relation : A relation R on set A is
The effective instruction time, if on the average
a page fault occurs every k instructions, is said to be symmetric if
j (xRy) then (yRx), ∀x, y ∈A
(a) 1 + (b) 1 + j * k Total number of symmetric relation with n element set
k
n 2 −n n ( n +1)
(i + j)
(c) (d) (i + j) * k = 2 n
× 2 2 =2 2
k
Total number of symmetric reflexive relation with n
1
Ans. (a) : Given page fault rate (1 − p ) = element set
K
n 2 −n n ( n −1)
Service time (m) = i
Page fault service time (S) = i + j = 1× 2 2 =2 2
Therefore, 51. The strategy used to reduce the number of tree
Effective memory access time is: branches and the number of static evaluations
 1 1 applied in case of a game tree is
EMAT = i.1 −  + ( i + j) ×
 k k (a) Minmax strategy
(b) Alpha-beta pruning strategy
k.i − i i + j
= + (c) Constraint satisfaction strategy
k k
(d) Static max strategy
ki − i + i + j ki + j
= = Ans. (b) : Alpha–beta pruning is a search algorithm
k k
j that seeks to decrease the number of nodes that are
EMAT = i +
k evaluated by the minimum algorithm in its search tree.

UGC NET JRF Computer Science June 2012 Paper-III 20 YCT

 Search on TG: @apna_pdf
52. Match of following: 55. Match the following with respect to java. Util. *
List–I List–II class methods:
A. Regular 1. Pushdown List-I List-II
Grammar automaton (a) Bit Set (1) Time zone gettime
B. Context free 2. Linear bounded zone ()
Grammar automaton (b) Calendar (2) int hashcode ()
C. Unrestricted 3. Deterministic finite (c) Time zone (3) int nextInt ()
Grammar (d) Random (4) Void setID (String
D. Context Sensitive 4. Turning machine tzName)
Grammar A B C D
Codes : (a) 2 1 4 3
A B C D (b) 3 4 1 2
(a) 3 1 2 4 (c) 4 3 2 1
(b) 3 1 4 2 (d) 2 1 3 4
(c) 3 2 1 4 Ans. (a) :
(d) 3 2 4 1 56. .......... is sometimes said to be object oriented,
Ans. (b) : because the only way to manipulate kernel
53. Consider the below circuit and find the output objects is by invoking methods on their
function f(x, y, z) handles.
(a) Windows NT (b) Windows XP
(c) Windows VISTA (d) Windows 95/98
Ans. (a) : Windows NT is sometimes said to object–
oriented because the only way to manipulate Kernel
objects is by invoking methods (API functions) on
(a) xz + xy + yz (b) xz + xy + yz their handles. On the other hand, it lacks some of the
(c) xz + xy + yz (d) xz + xy + yz most basic properties of object oriented systems such
as inheritance and polymorphism.
Ans. (a) : Given logic diagram is :
57. A user level process in Unix traps the signal
sent on a Ctrl + C input and has a signal
handling routine that saves appropriate files
before terminating the process. When a Ctrl
+ C input is given to this process, what is the
mode in which the signal handling routine
Function f is :
executes?
= y'(g) + y(x)
(a) User mode (b) Kernel mode
= y'(x.Z' + y'z) + x.y
(c) Super user mode (d) Privileged mode
= x.y'z' + y'z + x.y
= x(y + y'z') + y'z Ans. (b) : The Kernel handles signals in the context of
= x(y + z') + y'z the process that receives them, so a process must run to
= xy + x'z + y'z handle signals.
54. What is the size (in terms of bits) of Header 58. CPU generally handles an interrupt by
length field in IPv4 header? executing an interrupt service routine
(a) 2 (b) 4 (a) As soon as an interrupt is raised
(c) 8 (d) 16 (b) By checking the interrupt register at the end
of fetch cycle
Ans. (b) : Header length : The second field (4 bits) is
(c) By checking the interrupt register after
the internet header length (IHL), which is the number
finishing the executing the current instruction
of 32–bit words in the header. Since an IPv4 header
(d) By checking the interrupt register at fixed
may contain a variable number of options, this field
time intervals
specifies the size of the header (this is also coincides
with the offset to the data). As a 4–bit field the Ans. (c) : After finishing the execution of each
minimum and maximum value of 5 and 15 instruction the CPU reads the interrupt pins to
respectively. recognize the interrupts.

UGC NET JRF Computer Science June 2012 Paper-III 21 YCT

 Search on TG: @apna_pdf
59. The perspective projection matrix, on the view Ans. (a) :
plane z = d where the centre of projection is the A USART (Universal synchronous/ asynchronous
origin (0, 0, 0) shall be : receiver/transmitter) is manufacturer by Intel
0 0 0 d  d 0 0 0  number as 8251A.
0 0 d 0  0 d 0 0
A microcontroller is a small computer on a single
(a)   (b)  
0 d 0 0  0 0 d 0 integrated circuit. Small device C compiler as 8051.
   
 d 0 0 1   0 0 1 0  One of best known programmable interrupt
0 0 0 d  d 0 0 0  controller is 8259A, was included in the X86 PC.
0 0 d 0  0 d 0 0 8257 is known as microprocessor 8257 DMA
(c)   (d)  
controller.
0 d 0 0  0 0 d 0
    62. The optimal solution of the following
1 0 0 0  0 0 0 1 
assignment problem using Hungarian method
Ans. (b) : The projection transformation as a matrix
is
d 0 0 0 0  (i) (ii) (iii) (iv)
 
 0 d 0 0 0 A 8 26 17 11
=
 0 0 d 0 0
  B 13 28 4 26
 n1 n 2 n 3 0  C 38 19 18 15
The place z = d is parallel, to the x y plane (N = K) D 19 26 24 10
N(n1, n2, n3) = (0, 0, 1) and R0 (x0, y0, z0) = (0, 0, d) Codes :
So, A B C D
d0 = n1 x0 + n2 y0 + n3 z0 = d (a) (i) (ii) (iii) (iv)
Therefore, the projection matrix is : (b) (i) (iii) (ii) (iv)
d 0 0 0  (c) (i) (iii) (iv) (ii)
0 d 0 0
(d) (i) (iv) (ii) (iii)
= 
0 0 d 0 Ans. (b) :
 
0 0 1 0 (a) Cost = 8 + 28 + 18 + 10 = 64
60. Radio signals generally propagate according to (b) Cost = 8 + 4 + 19 + 10 = 41
the following mechanisms: (c) Cost = 8 + 4 + 15 + 26 = 53
(a) Modulation, Amplification, Scattering
(d) Cost = 8 + 26 + 19 + 24 = 77
(b) Reflection, Diffraction, Scattering
(c) Amplification, Diffraction, modulation 63. If a and b are the end points of a line, then
which one of the following is true?
(d) Reflection, Amplification, Diffraction
(a) If both end points are left, right, above or
Ans. (b) : Reflection, diffraction and scattering are the
below the window, the line is invisible.
three fundamental phenomenon that cause signal
(b) If both end points are left, right, above or
propagation in a mobile communication, apart from
LOS communication. below the window, the line is completely
visible.
61. Identify the devices given below with their IC
numbers: (c) If both end points are left, right, above or
List-I List-II below, the line is trivially visible.
(A) USART (1) 8251 (d) If both end point are left, right, above or
(B) Micro controller (2) 8051 below the window, the line is trivially
(C) Interrupt controller (3) 8259 invisible.
(D) DMA controller (4) 8257 Ans. (d) : In simple visibility algorithm, if a and b are
A B C D
the end points of the line, with components x and y for
(a) 1 2 3 4
each line. Visibility is true then check for totally
(b) 2 1 4 3
invisible lines. If both endpoints are left, right, above
(c) 3 4 1 2
(d) 4 1 2 3 or below the window, then line is trivially invisible.

UGC NET JRF Computer Science June 2012 Paper-III 22 YCT

 Search on TG: @apna_pdf
64. Identify the devices given below with their IC 67. Let a* H and b * H be two co–sets of H.
numbers : (i) Either a * H and b * H are disjoint
List-I List-II (ii) a * H and b * H are identical
(A) Networked- (1) MS connect to BS Then
Controlled Hand (a) only (i) is true (b) only (ii) is true
off (NCHO) (c) (i) or (ii) is true (d) (i) and (ii) is false
(B) Mobile-Assisted (2) Process via channel Ans. (c) : Theorem : Any two right (or left) co–sets of
Handoff (MAHO) the target BS H are either disjoint or identical.
(C) Forward Handoff (3) First Generation 68. HTML is defined using SGML an .......
Analog Cellular standard, information processing-text and
System office systems (SGML) for text information
(D) Hard Handoff (4) Second Generation processing.
Digital Cellular (a) ISO – 8878 (b) ISO – 8879
System (c) ISO – 8880 (d) ISO – 8881
A B C D Ans. (b) : The Standard Generalized Markup
(a) 3 4 2 1 Language (SGML; ISO 8879 : 1986) is a standard for
(b) 2 3 1 4 defining generalized markup language for documents.
(c) 2 1 4 3 69. What is the meaning of 'Hibernate' in
(d) 4 3 1 2 Windows XP/Windows 7?
Ans. (a) : (a) Restart the computers in safe mode.
65. Consider the methods used by processes P1 and (b) Restart the computers in normal mode.
P2 for accessing their critical sections. The (c) Shutdown the computer terminating all the
initial values of shared Boolean variables S1 running applications.
and S2 are randomly assigned, (d) Shutdown the computer without closing the
P1 P2 running applications.
While While Ans. (d) : Hibernation (or suspend to disk) in
(S1 = = S2); critical (S1= = S2); critical computing is powering down a computer while
section S1 = S2; section S1 = S2; retaining its state. Upon hibernation the computer
saves the contents its Random Access Memory (RAM)
Which one of the following statements
to a hard disk or other non–volatile storage.
describes the properties achieved?
(a) Mutual exclusion but not progress 70. Assume that we have constructor functions for
(b) Progress but not mutual exclusion both base class and derived class. Now consider
the declaration in main(). Base * P = New
(c) Neither mutual exclusion nor progress
Derived: in what sequence will the constructor
(d) Both mutual exclusion and progress
be called?
Ans. (c) : On first attempt both process can go into
(a) Derived class constructor followed by Base
critical section simultaneously. So mutual exclusion is class constructor
not satisfied. (b) Base class constructor followed by derived
After first attempt neither process can go into critical class constructor.
section. So progress is also not satisfied. (c) Base class constructor will not be called.
66. If the period of a signal is 1000 ms, then what is (d) Derived class constructor will not be called.
its frequency in kilohertz? Ans. (b) : Here A derived class object is created first
(a) 10–3 KHz (b) 10–2 KHz
and then assigned to a base class pointer, whenever a
(c) 10–1 KHz (d) 1 KHz
derived class object is created, the base class
1 constructor gets called first and then the derived class
Ans. (a) : Frequency = = = 10−3 KHz
1000 m sec constructor.

UGC NET JRF Computer Science June 2012 Paper-III 23 YCT

 Search on TG: @apna_pdf
71. Which one of the following options is not a Ans. (c) :
shell in UNIX system? Text files are stored in a form (usually ASCII) that
(a) Bourne Shell (b) C Shell is human readable.
(c) Net Shell (d) Korn Shell Control file is a small binary file that records the
Ans. (c) : Net shell is a command line–based tool that physical structure of the database.
enables administrators to remotely administer and A binary file is computer readable but not human
configure critical network service. Net shell is not a readable.
shell of UNIX shell. Object file, and organized machine code file
72. G1 and G2 are two graphs as shown : created by a complier.
Microsoft windows computer test files are identified
with the. txt file extension.
74. On a disk with 1000 cylinders (0 to 999) find
the number of tracks, the disk arm must move
to satisfy all the requests in the disk queue.
Assume the last request service was at track
345 and the head is moving toward track 0.
The queue in FIFO order contains requests for
(a) Both G1 and G2 are planar graphs.
the following tracks; 123, 874, 692, 475, 105,
(b) Both G1 and G2 are not planar graphs.
376 (Assume SCAN algorithm)
(c) G1 is planar and G2 is not planar graph. (a) 2013 (b) 1219
(d) G1 is not planar and G2 is planar graph (c) 1967 (d) 1507
Ans. (d) : In planner graph : Ans. (b) : Scan algorithm :
(i) e ≤ 2n –4, (ii) e ≤ 3n – 6 if ∆
G1 : n = 6, e = 9
⇒ e ≤ 2n – 4
⇒ 9≤2×6–4
⇒ 9 ≤ 8 false
G2 : N = 6, e = 11 Total path = (345 – 0) + (874 – 0) = 1219

⇒ 11 ≤ 3 × 6 – 6 75. Half toning is defined as:

⇒ 11 ≤ 12 true (a) A technique to obtain increased visual
resolution using multiple intensity levels.
(b) A technique for using minimum number of
intensity levels to obtain increased visual
resolution.
(c) A technique to obtain increased visual
resolution using maximum number of
intensity levels.
(d) A technique for using appropriate number
intensity levels to obtain increased visual
Therefore, only G2 is planner graph. resolution.
73. In which file the compiler manage the various Ans. (b) : Antialising is a technique using multiple
objects, which are used in windows intensity levels to obtain increased visual resolution .
programming? Halftoning on the other hand, is a technique for using a
(a) Control File (b) Binary File minimum number of intensity levels, i.e. gray scaling
(c) Text File (d) Obj File or multiple intensity levels.

UGC NET JRF Computer Science June 2012 Paper-III 24 YCT

 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2012

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. Consider the circuit shown below. In a certain Ans. (b) : {φ, {φ}}
steady state, Y is at logical 'I'. What are
possible values of A, B, C? Because If A is a infinite set then set of all subset of A
is called power set A denoted by p(A)
Here, A = {φ}
P(A) = {φ, {φ}}
So answer is (b)
(a) A = 0, B = 0, C = 1 5. If the disk head is located initially at 32, find
(b) A = 0, B = C = 1 the number of disk moves required with FCFS
(c) A = 1, B = C = 0 if the disk queue of I/O blocks requests are 98,
(d) A = B = 1, C = 1 37, 14, 124, 65, 67
(a) 239 (b) 310
(
Ans. (a) : f = A f .B.C = Af + B. C ) (c) 321 (d) 325
When the output is logic 1 the output equation is Ans. (c) : Because according to FCFS algorithm, Total
1=(Af+ B ).C To justify this equation ‘C’ must disk moves = (98–32) + (98–37) + (37–14) + (124–14)
be always ‘1’ + (124–65) + (67–65) = 321
So answer is (c)
So, C=1, A=1,B=0
Or A=1, B=1 6. Component level design is concerned with
Or A=0, B=0 (a) Flow oriented analysis
(b) Class based analysis
2. The worst case time complexity of AVL tree is
better in comparison to binary search tree for (c) Both of the above
(a) Search and Insert Operations (d) None of the above
(b) Search and Delete Operations Ans. (c) : Because Analysis model, manifested by
(c) Insert and Delete Operations scenario based, class based, flow oriented and
(d) Search, Insert and Delete Operations behavioral elements, feed the design task.
using design notations and design methods, design
Ans. (d) : Because search is O(log n) since AVL tree
produces a data design, an architectural design, an
are always balanced, insertion & detection are also 0
interface design and a component level design.
(log n)
where as in case of BST is O(n) 7. The 'C' language is
(a) Context free language
3. The GSM network is divided into the following
(a) SS, BSS, OSS (b) BSS, BSC, MSC (b) Context sensitive language
(c) CELL, BSC, OSS (d) SS, CELL, MSC (c) Regular language
(d) None of the above
Ans. (a) : SS, BSS, OSS
Because, GSM describe the protocols for second Ans. (b) : Most of the programming languages like C,
generation (ZG) digital cellular network used by C++, Java etc. can be well approximated by CFG, and
mobile phones, GSM supports voice call & data the compilers are made taking into account CFGs.
transfer speed of up to 9.6 kbps. It is based on the time However, C language itself contains context
division multiple access (TDMA) system. Currently sensitive properties
GSM Network operate on the 850 Mhz, 900 Mhz, 8. The Mobile Application Protocol (MAP)
1800 Mhz, 1900 Mhz frequency band. typically runs on top of which protocol?
4. The power set of the set {φ} is (a) SNMP (Simple Network Management
Protocol)
(a) {φ} (b) {φ, {φ}} (b) SMTP (Simple Mail Transfer Protocol)
(c) SS7 (Signalling System 7)
(c) {0} (d) {0, φ, {φ}}
(d) HTTP (Hyper Text Transfer Protocol)
UGC NET JRF Computer Science Dec. 2012 Paper-II 25 YCT
 Search on TG: @apna_pdf
Ans. (c) : Because, main SS7 functions are 13. Which of the following is true?
Setting up and tearing down circuit switched (a) A relation in BCNF is always in 3NF.
connections (b) A relation in 3NF is always in BCNF.
Advanced network features such as those (c) BCNF and 3NF are same.
offered by supplementary service (d) A relation in BCNF is not in 3NF.
SMS & EMS Ans. (a) : BCNF: FD x͢→y, where x is superkey of
Mobility Management in Cellular Networks relation and y is attribute(s).
Support for in services 3NF: FD x→y, where either x is a superkey of relation
9. If a packet arrive with an M-bit value is 'I' and or y is a prime attributes.
a fragmentation offset value '0', then it is –––– There, BCNF is stronger than 3NF, means 3NF
fragment. relations are subset of BCNF relations but converse
(a) First (b) Middle may not be true.
(c) Last (d) All of the above
14. Given memory partitions of 100 K, 500 K, 200
Ans. (a) : Because, M = 1 indicates that this packet is
K, 300 K and 600 K (in order) and processes of
not the last packet among all fragments
212 K, 417 K, 112 K, and 426 K (in order),
offset = 0 means this packet carries 0 * 8 = 0th byte
using the first-fit algorithm, in which partition
from the original packet
would the process requiring 426 K be placed?
Hence answer is (a)
(a) 500 K (b) 200 K
10. The number of bit strings of length eight that
(c) 300 K (d) 600 K
will either start with a 1 bit or end with two
bits 00 shall be Ans. (*) 400 K cannot be placed. So, none option is
(a) 32 (b) 64 true.
(c) 128 (d) 160 15. What is the size of the Unicode character in
Ans. (d) : Because string starting with 1-8 places, 1 Windows Operating System?
places fixed, 7 places have 2 choices 2 ^ 7 = 128 (a) 8-Bits (b) 16-Bits
ending with 00 - 8 places 2 fixed = 2 ^ 6 = 64 (c) 32-Bits (d) 64-Bits
Common string will be there that have been counted Ans. (b) : Because, Unicode is a worldwide character
twice are starting with 1 and ending with 00. Such encoding standard. The system uses unicode
number of string will be. exclusively and string manipulation.
Fix 3 position rest have a choices = 32 These function use UTF – 16 (wide character)
total = 128 + 64– 32= 160 encoding. Which is most common encoding of unicode
11. In compiler design 'reducing the strength' and the one used for native unicode encoding on
refers to windows operating system..
(a) reducing the range of values of input 16. In which tree, for every node the height of its
variables. left subtree and right subtree differ almost by
(b) code optimization using cheaper machine one?
instructions. (a) Binary search tree
(c) reducing efficiency of program
(b) AVL tree
(d) None of the above
(c) Threaded Binary Tree
Ans. (b) : Strength reduction is a compiler (d) Complete Binary Tree
optimization technique where expensive operations are
replaced with equivalent but less expressive Ans. (b) : AVL tree is a self balancing binary search
operations. The classic example of strength reduction tree where the difference between heights of left and
converts “strong” multiplications inside a loop weaker right subtrees cannot be more than one for all nodes. If
addition. Something that frequently occurs in array at any time they differ by more than one, nodes. If at
addressing. any time they differ by more than one, rebalancing is
12. In which addressing mode, the effective done to restore this property.
address of the operand is generated by adding Hence the correct answer is (b)
a constant value to the contents of register? 17. The design issue of Datalink Layer in OSI
(a) Absolute (b) Indirect Reference Model is
(c) Immediate (d) Index (a) Framing
Ans. (d) : Index mode: The address of the operand is (b) Representation of bits
obtained by adding to the contents of the general (c) Synchronization of bits
register (called index register) a constant value. (d) Connection control
UGC NET JRF Computer Science Dec. 2012 Paper-II 26 YCT
 Search on TG: @apna_pdf
Ans. (a) : Because, framing is related to data link layer (c) Round Rect ( ) (d) Pie ( )
and option (b) and (c) are related to physical layer and Ans. (b) : Because, Ellips is the API which is use to
option (D) is related to transport layer means framing draw a circle.
is done at the data link layer whereas fragmentations is example : ellipse (56, 46, 55, 55);
done as network layer and segmentation is done at ⇒ An ellipse with an equal height and width is a
transport layer. circle. The first two parameters set the location,
18. Given the following expressions of a grammar third sets the width and fourth sets the height.
E→E*F/F+E/F 22. In DML, RECONNECT command cannot be
F → F – F / id used with
Which of the following is true? (a) OPTIONAL Set (b) FIXED Set
(a) * has higher precedence than + (c) MANDATOR Set (d) All of the above
(b) – has higher precedence than * Ans. (b) : Fixed: a member record cannot exist on its
(c) + and – have same precedence own. Moreover, once it is inserted in a set occurrence,
(d) + has higher precedence than * it is fixed if cannot be reconnected to another set
Ans. (b) : Because to check the precedence check the occurrence.
level in which the operator occurs lower the leveled Reconnect command: if the connection to the server
higher the priority and vice versa as – is lower *, – has is lost, automatically try to reconnect attempt is made
higher priority than * each time the connection is lost. To suppress
So answer is (b) reconnection behavior, use “skip-reconnect”.
19. The maturity levels used to measure a proces 23. Coaxial cables are categorized by Radio
are Government rating are adapted for specialized
(a) Initial, Repeatable, Defined, Managed, functions. Category RG-59 with impedance
Optimized. 75ΩΩ used for
(b) Primary, Secondary, Defined, Managed, (a) Cable TV (b) Ethernet
Optimized. (c) Thin Ethernet (d) Thick Ethernet
(c) Initial, Stating, Defined, Managed,
Ans. (a) : Because, Coaxial cable is a type of electrical
Optimized.
cable that has an inner conductor surrounded by a
(d) None of the above tubular insulating layer and RG – 59/U is a specific
Ans. (a) : Because, capability maturity model (CMM) type of Coaxial cable, often used for low-power video
is a development model created after a study of data and RF signal connections. RG–59 Coaxial cable is
collected from organizations. The term "maturity" commonly packed with consumer equipment, such as
relates to degree of formality and optimization of VCP's or digital cable receivers.
processes to formality defined steps, to managed result
24. RAD stands for
metrics, to active optimization of the process.
(a) Rapid and design
CMM Levels
Level 1 > initial (b) Rapid Aided Development
Level 2 > Repeatable (c) Rapid Application Development
Level 3 > Defined (d) Rapid Application Design
Level 4 > Managed Ans. (c): Rapid application development (RAD) is a
Level 5 > Optimized software development methodology that uses minimal
planning in favor of rapid prototyping. A prototype is
20. The problem of indefinite blockage of low-
working model which is functionality equivalent to a
priority jobs in general priority scheduling
component of the product.
algorithm can be solved using :
(a) Parity bit (b) Aging 25. Suppose that someone starts with a chain
letter. Each person who receives the letter is
(c) Compaction (d) Timer
asked to send it on to 4 other people. Some
Ans. (b) : Because a major problem with priority people do this, while some do not send any
scheduling is indefinite blocking or starvation. A letter. How many people have seen the letter,
solution to the problem of indefinite blockage to the including the first person, if no one receives
low priority process is aging. Aging is a technique of
more than one letter and if the chain letter ends
gradually increasing the priority of processes that wait
after there have been 100 people who read it
in the system for a long period of time.
but did not send it out? Also find how many
So option (b) is right choice. people sent out the letter?
21. Which API is used to draw a circle? (a) 122 & 22 (b) 111 & 11
(a) Circle ( ) (b) Ellipse ( ) (c) 133 & 33 (d) 144 & 44
UGC NET JRF Computer Science Dec. 2012 Paper-II 27 YCT
 Search on TG: @apna_pdf
Ans. (c) : Because, from basic, consider one sender, he 29. Which of the following are two special
sent to four other who only read "two" they send to functions that are meant for handling
seven other "three" they send to ten other receiver who exception that occurs during exception
only recall this form AP having common difference–3, handling itself?
& a/q total number of receiver who only read is 100 (a) Void terminate ( ) and Void unexpected ( )
that is over last term.
(b) Non void terminate ( ) and void unexpected ( )
So, 4 + (n–1) * 3 = 100
(c) Void terminate ( ) and non void unexpected ( )
n = 33 this is the number of reader who send to four
other already there are 100 viewer who only read (d) Non void terminate ( ) and non void
So total viewer will 100 + 33 = 133 unexpected ( )
26. A hash function f defined as f (key) = key mod Ans. (a) : The exception handling mechanism relies on
13, with linear probing is used to insert keys two function, terminate () and unexpected (), for
55, 58, 68, 91, 27, 145. What will be the location coping with errors related to the exception handling
of 79? mechanism itself.
(a) 1 (b) 2 Void terminate ()
(c) 3 (d) 4 If an exception is thrown but not caught
Ans. (d) : Given, hash function f(key) = key mod 13 If the exception handling mechanism find the stack
with linear probing to resolve collision. is corrupted.
Key are : 55, 58, 68, 71, 27, 145 and 79 If a destructor propagates an exception during stack
55 mod 13 = 3 unwinding due to another exception.
58 mod 13 = 6 Void unexpected
65 mod 13 = 3 (collision, so next) = 4 If a function throws an exception by its exception
91 mod 13 = 0 specification then:
27 mod 13 = 2
The stack is unwounded for the function
145 mod 13 = 2
The function unexpected () is called
79 mod 13 = 1 (collision, so next
= 2 (again collision, so next) 30. Which of the following memory allocation
= 3 (again collision, so next) scheme suffers from external fragmentation?
= 4 (again collision, so next) (a) Segmentation
=5 (b) Pure demand paging
So, index 5 is alloted to key 79. (c) Swapping
27. Which of the following is true while converting (d) Paging
CFG to LL (I) grammar? Ans. (a): Segmentation is a memory management
(a) Remove left recursion alone technique in which each job is divided into several
(b) Factoring grammar alone segments of different sizes, one for each module that
(c) Both of the above contains pieces that perform related function. Each
(d) None of the above segment is loaded into a contiguous block of available
Ans. (c): LL (1) is top-down parser, for top down memory.
parser the grammar should be unambiguous, External fragmentation exists when total free
deterministic and free from infinite loop. That means memory is enough for the new process but it’s not
grammar should be free from ambiguity, left factoring contiguous and cannot satisfy the request.
and left recursion. All the 3 condition must be satisfied Segmentation suffers from external fragmentation and
for LL (1) parser.
paging suffers from internal fragmentation.
So option (c) is the right answer.
31. Basis path testing falls under
28. Identify the Risk factors which are associated
with Electronic payment system. (a) system testing
(a) Fraudulent use of Credit Cards. (b) white box testing
(b) Sending Credit Card details over internet. (c) black box testing
(c) Remote Storage of Credit Card details. (d) unit testing
(d) All of the above Ans. (b): White Box testing is technique that
Ans. (d) : All are given risk factors that which are examines the program structure and derives test data
associated with electronic payment system. from the program code.
Fraudulent use of credit card Basic path testing or structural testing is white box
Sending credit card details over internet method for designing test cases. The method analyzes
Remote storage of credit card details the control flow graph of program to find a set of
So answer is (D) linearly independent paths of execution.

UGC NET JRF Computer Science Dec. 2012 Paper-II 28 YCT

 Search on TG: @apna_pdf
32. The User Work Area (UWA) is a set of md − 1
Program variables declared in the host (d)
m −1
program to communicate the contents of
Ans. (a)
individual records between
no → (m –1) keys children m, node 1
(a) DBMS & the Host record
n1 → m × (m –1) keys children
(b) Host program and Host record
(c) Host program and DBMS n2 → m × m × (m –1) keys
(d) Host program and Host language .
.
Ans. (c): The User Work Area (UWA) is set of
nd → md × (m – 1) keys
program variables declared in host program to
communicate contents of individual records between = (m – 1) + m (m – 1) + m2 (m – 1)
DBMS and host program, one program variable for + ------- md (m – 1)
each record type with same format. = (m – 1) . (1 + m + m ......... md)
2

33. Consider the tree given below : = (m – 1) ((m(d+1) –1) / m –1)

= m (d+1) –1 should be ans.
35. Which of the following is the most powerful
parring method?
(a) LL(1) (b) Canonical LR
(c) SLR (d) LALR
Ans. (b) : Canonical LR
Because, LR > LALR > SLR

(a) d & h (b) c & k

(c) g, b, c, h, i, m (d) c & h
Ans. (d) : Eccentricity of vertex : The maximum
distance between a vertex to all other vertices is
considered as the eccentricity of vertex denoted by (v).
The distance from a particular vertex to all other
vertices in the graph is taken and among those A canonical LR parser or LR(1) parser is a LR(k)
distances, the eccentricity is the highest of distances parser for K=1, i.e., with single look ahead terminal.
for this graph, LR(1) parser are more powerful than LALR parsers
e(a) = 5 e(b) = 4 e(c) = 3 and LALR parsers are more powerful than SLR.
e(d) = 4 e(e) = 5 e(f) = 5 36. In UNIX, which of the following command is
e(a) = 4 e(h) = 3 e(i) = 4 used to set the task priority?
e(j) = 5 e(k) = 4 e(l) = 5 (a) init (b) nice
e(m) = 4 e(n) = 5 (c) kill (d) PS
Radivs Ans. (b): Nice command directly maps to a kernel call
r (c) = 3 & r (n) = 3 which is the minimum of the same name. Nice is used to invoke a utility or
eccentricity for c 7 h. shell script with a particular priority, thus giving the
Center process more or less CPU time than other processes.
e (v) = r (v), 37. AES is a round cipher based on the Rijndal
Then v is the central point of graph G. Algorithm that uses a 128-bit block of data.
Here AES has three different configurations. ––––
e(o) = r (c) = 3 & e(h) = r(h) = 3 rounds with a key size of 128 bits, rounds with
Hence both c & h are center of tree a key size of 192 bits and rounds with a key size
Hence option (d) is right answer. of 256 bits.
(a) 5, 7, 15 (b) 10, 12, 14
34. The maximum number of keys stored in a B-
(c) 5, 6, 7 (d) 20, 12, 14
tree of order m and depth d is
(a) md + 1–1 Ans. (b) AES is a round cipher based on the Rijndael
algorithm that uses a 128 bit block of data.
md + 1 − 1
(b) 10 rounds with a key size of 128 bits, 12 rounds with a
m −1 key size of 192 bits, 14 rounds with a key size of 256
(c) (m – 1) (md + 1 – 1) bits.
UGC NET JRF Computer Science Dec. 2012 Paper-II 29 YCT
 Search on TG: @apna_pdf
38. Match the following IC families with their Ans. (d) Because operation
basic circuits:
P P P P P P P P P
a. TTL 1. NAND
u u o u u o o u o
b. ECL 2. NOR
s s p s s p p s p
c. CMOS 3. Inverter
Code : h h h h h
a b c (1) (2) (3) (4) (5)
(a) 1 2 3 4
(b) 3 2 1 2 3 3 3 5
(c) 2 3 1 1 1 1 1 1 2 1 1
(d) 2 1 3 1
Push is the operation that which adds an element to
Ans. (a)
the collection, pop that is present in the stack.
(a) TTL–Transistor–transistor logic is a logic family
Therefore, popped sequence is: 2, 4, 3and 5 remaining
built from bipolar junction transistors. It satisfies the
element to be popped is only 1 on the stack. So answer
NAND. is (d)
(b) ECL–Emitter coupled logic is a high speed
41. Enumeration is a process of
integrated circuit bipolar transistor logic family. It
(a) Declaring a set of numbers
satisfies the NOR.
(b) Sorting a list of strings
(c) CMOS – Complementary metal oxide
(c) Assigning a legal values possible for a
semiconductor is a technology for constructing
variable
Integrated Circuits. It satisfies inverter.
(d) Sequencing a list of operators
So answer is (a).
Ans. (c): An enumeration is a complete ordered listing
39. Match the following with respect to C++ data
of the entire item in a collection. The term is
types :
commonly used in mathematic and computer science
a. User defined type 1. Qualifier to refer to a listing of all of the elements of a set.
b. Built in type 2. Union Only certain pre-defined values are allowed.
c. Derived type 3. Void Each valid value is assigned a name, which is then
d. Long double 4. Pointer normally used instead of integer when working with
Code : this data type.
a b c d 42. Which of the following mode declaration is
(a) 2 3 4 1 used in C++ to open a file for input?
(b) 3 1 4 2 (a) ios : : app (b) in : : ios
(c) 4 1 2 3 (c) ios : : file (d) ios : : in
(d) 3 4 1 2 Ans. (d) : iOS :: in//open for input operations.
Ans. (a) 43. Data Encryption Techniques are particularly
(a) User defined data type–This technique of used for –––––––.
grouping different values is referred to as class. It (a) protecting data in Data Communication
offers three techniques of defining a new data type, a System.
structures class, a union, so it satisfies (2) union. (b) reduce Storage Space Requirement.
(b) Built in type–This is use to store information of (c) enhances Data Integrity.
various data types. So it is a void. (d) decreases Data Integrity.
(c) Derived type–Derived type can mean a composite Ans. (a) : Because, Data encryption is a security in
data type, a subtype, a derived class, So it satisfies (4) which information is encoded in such away that only
pointer authorized reader can read it and data encryption is
(d) Long double–It refers to a floating point data type, particularly used for protecting data in data
8 it satisfies qualifier. communication system.
40. Given an empty stack, after performing push So answer is (a).
(1), push (2), Pop, push (3), push (4), Pop, Pop, 44. Let L be a set accepted by a non-deterministic
push (5), Pop, what is the value of the top of the finite automaton. The number of states in non-
stack? deterministic finite automaton is Q . The
(a) 4 (b) 3 maximum number of states in equivalent finite
(c) 2 (d) 1 automaton that accepts L is
UGC NET JRF Computer Science Dec. 2012 Paper-II 30 YCT
 Search on TG: @apna_pdf
(a) Q (b) 2 Q 48. –––––– is an "umbrella" activity that is applied
throughout the software engineering process.
Q Q
(c) 2 − 1 (d) 2 (a) Debugging
Ans. (d): Because, conversion from NFA to DFA is (b) Testing
done by subset construction. It a problem can be (c) Designing
solved with state in NFA then in worst case number of (d) Software quality assurance
states in the resulting DFA is 2n Ans. (d): Because, umbrella activities include:
Given number of states in NFA = Q (1) Software Project Management
(2) Formal Technical reviews
Then maximum number of states in equivalent (3) Software Quality assurance
Q
DFA = 2 (4) Measurement
Hence, option (d) is correct choice. (5) Risk Management
45. What is the result of the following expression? (6) Reducibility Management
(1 & 2) + (3 & 4) Hence (d) is the answer.
(a) 1 (b) 3 49. Identify the operation which is commutative
(c) 4 (d) 0 but not associative?
Ans. (d): Given (1&2) + (3&4) in decimal (a) OR (b) NOR
= (001 & 010) + (011 & 100) in binary (c) EX-OR (d) NAND
= (000) + (000) = (000) Ans. (d) : Because, O NAND1 = 1 NAND0 = 1 ⇒
=0 in decimal. Cumulative
Hence answer is (d). (O NAND1) NAND1 = 1 NAND1 = 0
46. Back propagation is a learning technique that O NAND (1NAND1) = 0 NAND0 = 1 ⇒ Not
adjusts weights in the neural network by associative
propagating weight changes. Every logic gate follows commutative law
(a) Forward from source to sink AND, OR, Ex–OR, Ex–NOR follows associative
(b) Backward from sink to source law, NOR does not follow associative law.
(c) Forward from source to hidden nodes AND, OR, follows distributive law. Ex-OR, Ex-
(d) Backward from since to hidden nodes NOR, NAND, NOR does not follow distributive
law.
Ans. (b): Back propagation, an abbreviation for
So answer is (d).
"backward propagation of error" is a learning
technique that adjusts weights in neural network by 50. Given a Relation POSITION (Posting No,
propagating weight changes backward from the sink to Skill), then query to retrieve all distinct pairs of
the source nodes. posting-nos. requiring skill is
(a) Select p.posting-No, p.posting-
47. Match the following: No
a. TTL 1. High fan out from position p
b. ECL 2. Low propagation delay where p.skill = p.skill
c. CMOS 3. High power dissipation and p.posting-No < p.posting-No
Code: (b) Select p1.posting-No, p2.posting-
a b c No
(a) 3 2 1 from position p1, position p2
(b) 1 2 3 where p1.skill = p2.skill
(c) 1 3 2 (c) Select p1.posting-No, p2.posting-
(d) 3 1 2 No
Ans. (a) from position p1, position p2
(a) TTL–Transistor-transistor logic is a digital logic where p1.skill = p2.skill
design. TTL is characterized by high switching speed. and p1.posting-No < p2.posting-
It has high power dissipation. No
(b) ECL–Emitter coupled logic is a high speed (d) Select p1.posting-No, p2.posting-
integrated circuit bipolar transistor logic family. In No
ECL, transistor are never in saturation, the input/output from position p1, position p2
voltage have a swing (0.8v), the input impedance is where p1.skill = p2.skill
high and output resistance is low. So it has low and p1.posting-No = p2.posting-
propagation delay. No
(c) CMOS – Complementary metal oxide Ans. (c) : Because, we need to join position with itself
semiconductor is a technology for constructing IC's based on skill.
CMOS technology is used in microprocessors, static Then it is given distinct pairs so we need to consider
RAM & other digital logic circuit. It has high fan out. only P1 Posting – no < p2. Posting – no.
UGC NET JRF Computer Science Dec. 2012 Paper-II 31 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2012

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. Eco system is a Frame work for (a) Bit stuffing (b) Piggy backing
(a) Building a Computer System (c) Pipelining (d) Broadcasting
(b) Building Internet Market Ans. (b) : The technique of temporarily delaying
(c) Building Offline Market outgoing acknowledgments, so that they can be hooked
(d) Building Market onto the next outgoing data frame is known as piggy
Ans. (b) : Eco system is a Frame work for building backing.
internet market means once you built content, it needs 5. ____is process of extracting previously non
to be shared across the web so it will done by building known valid and actionable information from
internet market. large data to make crucial business and
2. The efficiency (E) and speed up (sp) for strategic decisions.
Multiprocessor with p processors satisfies (a) Data Management (b) Data base
(a) E ≤ p and sp ≤ p (c) Data Mining (d) Meta Data
(b) E ≤ 1 and sp ≤ p Ans. (c) : Data mining is defined as extracting
(c) E ≤ p and sp ≤ 1 information from huge sets of data, we can say that
(d) E ≤ 1 and sp ≤ 1 mining is the procedure of mining knowledge of data.
Ans. (b) : Efficiency (E) can be 0 to 1or not more than 6. The aspect ratio of an image is defined as
0 to 100%. even 1 is just theoretical speed up for (a) The ratio of width to its height measured in
multiprocessor. Speed of multiprocessor Sp can never unit length.
exceed (p) number of processors. (b) The ratio of height to width measured in
So answer is (b). number of pixels.
3. Match the following : (c) The ratio of depth to width measured in unit
List–I List–II length
A. Critical region 1. Hoares Monitor (d) The ratio of width to depth measured in
B. Wait/signal 2. Mutual exclusion number of pixels.
C. Working set 3. Principal of locality Ans. (a) : Because the aspect ratio of an image
describes the proportional relationship between its
D. Dead lock 4. Circular wait
width and height. It is commonly expressed as two
Codes : number separated by a color, as in 16:9.
A B C D
7. Which of the following features will
(a) 2 1 3 4 characterize an OS as multi-programmed OS?
(b) 1 2 4 3 (A) More than one program may be loaded into
(c) 2 3 1 4 main memory at the same time.
(d) 1 3 2 4 (B) If a program waits for certain event another
Ans. (a) : program is immediately scheduled.
(a) Critical region–Critical region is the region of (C) If the execution of a program terminates,
values that corresponds to the rejection of the null another program is immediately scheduled.
hypothesis at some chosen probability level. So it (a) (A) only
satisfies, (ii) Mutual exclusion (b) (A) and (B) only
(b) Wait/Signal holds Hoares Monitor (c) (A) and (C) only
(c) Working Set–It directly address thrashing problem (d) (A), (B) and (C) only
in which is the set of pages referenced by the process Ans. (d) : A Multiprogramming system permits
during the most recent w page reference is the multiple programs to be loaded into memory and
principle of locality. execute the programs concurrently. Concurrent
(d) Dead lock–It hold circular wait because circular execution of programs results into improved system
wait is a condition of dead lock. throughput and resource, utilization. This potential is
4. The technique of temporarily delaying realized by a class of operating system among a
outgoing acknowledgements so that they can be multiple of active programs. Such operating systems
hooked onto the next outgoing data frame is usually have the prefix multi in their names, such as
known as multitasking or multiprogramming.
UGC NET JRF Computer Science Dec. 2012 Paper-III 32 YCT
 Search on TG: @apna_pdf
8. Using RSA algorithm, what is the value of Protocol (HTTP) to interact with the Network. HTTP
cipher text C, if the plain text M = 5 and p = 3, is an application layer protocol.
q = 11 & d = 7 ? (b) Transport layer–It offers peer to peer & end to
(a) 33 (b) 5 end connection between two processes on remote
(c) 25 (d) 26 hosts. It have TCP (Transmission Control Protocol) &
Ans. (d) : UDP (User Datagram Protocol).
Given P = 3, Q = 11, n = (p × q) = 3 × 11 = 33 (c) Network layer–It takes the responsibility for
m = (P–1) x (Q–1) = (2 × 10) = 20 routing packets from source to destination within or
outside a subnet. So it refers BGP (Border Gateway
find a small odd integer, that is relatively prime to M.
Protocol)
If e = 3, than GCD (3, 20) = 1.e should be small &
(d) Data link layer–It hides the details of underlying
prime & So we let e = 3, d is given, d = 7
H/W and represents itself to upper layer as the medium
public key = (e, n). (values of e and n are known)
to communicate. So it refers HDLC (High Level Data
To encrypt a message we apply the public key to the
e Link Control).
function E(s) = S (mod n)
Where S is the given message and e and n represents 11. The time complexities of some standard graph
the public key integer pair. In the above question, the algorithms are given. Match each algorithm
plain text M = 5 plain text needs to be encrypted using with its time complexity? (n and m are no. of
above formula nodes and edges respectively)
3
= 5 (mod 33) a. Bellman Ford 1. O (m log n)
= 125 (mod 33) algorithm
= 26 b. Kruskals algorithm 2. O (n3)
9. You are given an OR problem and a XOR c. Floyd Wrashall 3. O (mn)
problem to solve. Then, which one of the algorithm
following statements is true? d. Topological sorting 4. O (n + m)
(a) Both OR and XOR problems can be solved Codes :
using single layer perception. a b c d
(b) OR problem can be solved using single layer (a) 3 1 2 4
perception and XOR problem can be solved (b) 2 4 3 1
using self organizing maps.
(c) 3 4 1 2
(c) OR problem can be solved using radial basis
(d) 2 1 3 4
function and XOR problem can be solved
using single layer perception. Ans. (a) :
(d) OR problem can be solved using single layer (a) Bellman Ford algorithm time complexity is O (mn)
perception and XOR problem can be solved (b) Kruskals algorithm time complexity is O (m log n)
using radial basis function. (c) Floyd Wrashall algorithm time complexity is O (n3)
Ans. (d) : OR problem can be solved using single (d) Topological sorting time complexity is O (n + m)
layer perception and XOR problem can be solved Where n & m are number of nodes and edges
using radial basis function. respectively.
10. Match the following : 12. Let V1 = 2I – J + K and V2 = I + J – K, then the
List–I List–II angle between V1 & V2 and a vector
a. Application layer 1. TCP perpendicular to both V1 & V2 shall be :
0
b. Transport layer 2. HDLC (a) 90 and (–2I + J – 3K)
(b) 600 and (2I + J + 3K)
c. Network layer 3. HTTP
(c) 900 and (2I + J – 3K)
d. Data layer 4. BGP
(d) 900 and (–2I – J + 3K)
Codes :
Ans. (d) : V1.V2=(2I-J+K) (I+J-K)
a b c d
(a) 2 1 4 3 =2-1-1=0
(b) 3 4 1 2 Hence angle between V1 and V2 is 90o
(c) 3 1 4 2 I K J
(d) 2 4 1 3 V1×V2= 2 -1 1
1 1 -1
Ans. (c) :
= I(-1-1)-J(-2-10 + K ( 2+1)
(a) Application layer–It is the top most layer in OSI
& TCP/IP layered model & when we use a web = –2I – J + 3K
browser, which is actually using Hyper Text Transfer So answer will be (b).
UGC NET JRF Computer Science Dec. 2012 Paper-III 33 YCT
 Search on TG: @apna_pdf
13. Consider a fuzzy set A defined on the interval of the complex quadratic polynomial zn+1 = zn2 +
X = [0, 10] of integers by the membership c remains bounded.
Junction That is, a complex number c is part of the Mandelbrot
x set if, when starting with z0 = 0 and applying the
µ A (x) = iteration repeatedly, the absolute value of zn remains
x+2
bounded however large n gets. So answer will be (b)
Then the α cut corresponding to α = 0.5 will be
(a) {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10} 17. Which of the following permutations can be
(b) {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} obtained in the output using a stack of size 3
elements assuming that input, sequence is 1, 2,
(c) {2, 3, 4, 5, 6, 7, 8, 9, 10}
3, 4, 5 ?
(d) { }
(a) 3, 2, 1, 5, 4 (b) 5, 4, 3, 2, 1
Ans. (c) : Because, putting value of X from 0 to 10 in (c) 3, 4, 5, 2, 1 (d) 3, 4, 5, 1, 2
membership function µA(x) = x / x + 2 we get
Ans. (c)
0/2, 1/3, 2/4, 3/5, 4/6, 5/7, 6/8, 7/9, 8/10, 9/11, 10/12 Operation P P P P P P P P P P
means they are belonging with degree 0, 0.33, 0.5, 0.6 u u u o u o u o o o
-------- 0.83. s s s p s p s p p p
h h h h h
here α-cut = 0.5 so first two elements will not be (1) (2) (3) (4) (5)
included in the result as their degree of belongingness 3 4 5
2 2 2 2 2 2 2
0.5. So answer will be (c). 1 1 1 1 1 1 1 1 1
Output 3 3 34 34 345 352
14. Let T(n) be the function defined by T(n) = 1
34521
and T(n) = 2T (n/2) + n , which of the
following is TRUE? So option (c) is correct.
18. In a Linear Programming Problem, suppose
(a) T(n) = O( n )
there are 3 basic variables and 2 non-basic
(b) T(n) = O(log 2 n) variables, then the possible number of basic
(c) T(n) = O(n) solutions are
(d) T(n) = O(n2) (a) 6 (b) 8
Ans. (c): T(n) = O(n2) (c) 10 (d) 12
Because, when you apply master theorem on the Ans. (c) : Because, Total number of basic solution are
function T(n) then you get T(n) = 0(n) so answer will given by the equation
be (c). n ! / m ! * (n–m)!
15. In classful addressing, an IP address 123. 23. where m = 3 no. of basic variables & n = 3 + 2 = 5
156.4 belongs to class format. total no. of variable.
(a) A (b) B hence total solution = 5 ! 3 ! 2 ! = 5 × 4/2 = 10
(c) C (d) D So answer is (c).
Ans. (a) : 19. Identify the following activation function :
Because, 0 – 126 = Class A 1
128 – 191 = Class B φ(V) = Z + ,
1 + exp( − x * V + Y)
192 – 223 = Class C
Z, X, Y are parameters
224 – 239 = Class D
(a) Step function (b) Ramp function
240 – 255 = Class E
(c) Sigmoid function (d) Gaussian function
There, given address 123.23.256.4 belongs to class A
So answer will be (a). Ans. (c) : A Sigmoid function is a mathematical
function having an ‘S’ shape (Sigmoid-curve). A
16. The Mandelbrot set used for the construction
sigmoid function is a bounded differentiable real
of beautiful images is based on the following
function that is defined for all real input values and has
transformation:
a positive everywhere.
xn+1 = xn2 + z 20. The no. of ways to distribute n distinguishable
Here, objects into k distinguishable boxes, so that n1
(a) Both x & z are real numbers. objects are placed into box i, i = 1, 2, ............ k
(b) Both x & z are complex numbers. equals which of the following?
(c) x is real & z is complex. n!
(d) x is complex & z is real. (a)
n1 !+ n 2 !+ ....... + n k !
Ans. (b) : Both x & z are complex numbers
n !+ n 2 !+ ........ + n k !
The Mandelbrot set is the set of values of c in the (b) 1
complex plane for which the orbit of 0 under iteration n1 !+ n 2 !n 3 !.......n k !

UGC NET JRF Computer Science Dec. 2012 Paper-III 34 YCT

 Search on TG: @apna_pdf
n! Ans. (d) :
(c)
n1 !n 2 !n 3 !.......n k ! T Qn+1 T0 Q0 T1 Q1
n1 !n 2 !........ + n k ! 0 Qn Initially 0 0
(d)
n1 !− n 2 !− n 3 !....... − n k ! 1 Qn 1 1 1 1
Ans. (c) : Because, the number of ways to distribute n 1 0 1 1
distinguishable objects into K distinct boxes so that ni 1 1 1 0
objects are placed in box i, i = 1, ......, k & n1 + .....+ni
1 0 1 0
= n is n1!/n1, n2, n3 ........ nk.
Therefore, Q1 Q0 sequence is:
21. How many solutions do the following equations 00initial →111st→102nd→013rd→004th
have?
x1 + x2 + x3 = 11 24. If dual has an unbounded solution, then its
corresponding primal has
where x1 ≥ 1, x2 ≥ 2, x3 ≥ 3
(a) no feasible solution
(a) C(7, 11) (b) C(11,3) (b) unbounded solution
(c) C(14, 11) (d) C(7, 5) (c) feasible solution
Ans. (d) : Given, equation is: x1+x2+x3=11 (d) none of these
where x1 ≥ 1, x2 ≥ 2, x3 ≥ 3 Ans. (a) : no feasible solution
when we satisfied given conditions, then Because, few property of primal & dual
x1+x2+x3= 11 – (1+2+3)=5 (1) The dual of dual linear programming problem is
again the primal solution.
x1+x2+x3=5 (2) If either the primal or dual problem has
hence, number of possible solutions are: unbounded solution the other problem has no
(n-1)+k
Ck = (3-1)+5C5 = 7C5= 7C2 feasible solution.
22. Which provides an interface to the TCP/IP suit (3) If either the primal has a finite optimal solution
the other one also possesses the same & the
protocols in Windows 95 and Windows NT? optimal value of the objective function of 2
(a) FTP Active-X Control problems are same.
(b) TCP/IP Active-X Control So answer is (a).
(c) Calinsock Active-X Control 25. The number of distinct bracelets of five beads
(d) HTML Active-X Control made up of red, blue, and green beads (two
bracelets are indistinguishable if the rotation of
Ans. (c) : Calinsock Active-X Control
one yield another) is,
Because, the window Sockets API (WSA), which was (a) 243 (b) 81
later shortened to winsock, is a technical specification (c) 51 (d) 47
that defines how windows network software should Ans. (c) Verify that any necklace may be characterized
access network services. It defines a standard interface via one of the patterns below.
between a windows TCP/IP client application and the 3!
underlying TCP/IP protocol stack. The nomenclature is Recall that there are ways to put 3 things into
( 3 − n )!
based on the Berkeley Sockets API model used in BSD
n ordered slots.
for communication between programs.
3!
23. What are the final values of Q1 and Q0 after 4 xxxxx : 3 =
( 3 − 1)!
clock cycles, if initial values are 00 in the
sequential circuit shown below : 3!
xxxxy : 6 =
( 3 − 2 )!
1 T Q 3!
xxxyy : 6 =
T Q ( 3 − 2 )!
Cx 3!
xxxyz : 6 =
( 3 − 3 )!
Q0 Q1
3!
(a) 11 (b) 10 xxyyz : 6 =
(c) 01 (d) 00 ( 3 − 3 )!
UGC NET JRF Computer Science Dec. 2012 Paper-III 35 YCT
 Search on TG: @apna_pdf

3! (b) x11 = 20, x12 = 20, x13 = 10,

xxyxy : 6 = x22 = 20, x23 = 20, x24 = 10,
( 2 )!
3 −
Total cost = 180
3! (c) x11 = 20, x13 = 10, x22 = 20,
xxyxz : 6 =
( 3 )!
3 − x23 = 20, x24 = 10, x32 = 10,
3! Total cost = 180
xxyzy : 6 = (d) None of the above
( 3 )!
3 −
Ans. (c) :
3!
xyzyz : 6 =
( 2 )!
3 − D1 D2 D3 D4 Supply
3+6+6+6+6+6+6+6+6 = 51 S1 1(20) 2(10) 1 4 30
26. Which are the classifications of data used in S2 3 3(10) 2(30) 1(10) 50
Mobile Applications?
S3 4 2(20) 5 9 20
(a) Private data, User data, Shared data.
(b) Public data, User data, Virtual data. Demand 20 40 30 10
(c) Private data, Public data, Shared data.
(d) Public data, Virtual data, User data. The minimum total transportation cost is=
Ans. (c) : private data are those data that are not 1×20+2×10+3×10+2×30+1×10+2×20= 180
made available to the general public such as password So answer is (c).
and accounts. Public data are those data that are for 29. 58 lamps are to be connected to a single electric
the public good. Shared data are those data that are a outlet by using an extension board each of
set amount of data for all smart phones user on a which has four outlets the number of extension
specific plan. Shared data plans include both text boards needed to connect all the light is
message & calling. (a) 29 (b) 28
27. In an enhancement of a CPU design, the speed (c) 20 (d) 19
of a floating point unit has been increased by Ans. (d) : Because, Connect first 4 lamps (L , L , L ,
1 2 3
20% and the speed of a fixed point unit has L ) to extension 1 & take power from extension 2. In
4
been increased by 10%. What is the overall extension 2 we can connect only 3 lamps because out
speed achieved if the ratio of the number of of 4 one port is busy to supply power to extension 1.
floating point operations to the number of fixed Similarly, for other extension we can connect only 3
point operations is 2 : 3 and the floating point lambs because one port is busy to supply power to
operation used to take twice the time taken by other extension.
the fixed point operation in original design? We can connect 4 lamps to first extension.
(a) 1.2 (b) 1.55 number of extension required for remaining 54 lamps
(c) 1.85 (d) 1.285 = 18 extension.
Ans. (b) : Because, speed up = original time taken/new Total extension required to connect all 58 lamps = 18 +
time taken 1 = 19
Let x be the time for a fixed point operation original 30. Match the following with respect to the Mobile
time taken = (3x + 2*2x) / 5 = 7x / 5 Computing Architecture.
New time taken = ((3x / 1.1) + 4x / 1.2) /5 = 8x / 1.32*
List–I List–II
5
So speed up = 7 * 1.32 / 8 = 1.155 a. Downlink control 1. 100 Mbps
28. The initial basic feasible solution to the b. Radio communication 2. Residency
following transportation problem using Vogel's data rate latency (RL)
approximation method is c. The average duration 3. Sending data
D1 D2 D3 D4 Supply of user's stay in cell from a BS to
MD
S1 1 2 1 4 30
d. FDDI bandwidth 4. 2-Mbps
S2 3 3 2 1 50
Codes :
S3 4 2 5 9 20
a b c d
Demand 20 40 30 10 (a) 2 1 4 3
(a) x11 = 20, x13 = 10, x21 = 20, (b) 3 4 2 1
x23 = 20, x24 = 10, x32 = 10, (c) 4 1 2 1
Total cost = 180 (d) 4 3 1 2
UGC NET JRF Computer Science Dec. 2012 Paper-III 36 YCT
 Search on TG: @apna_pdf
Ans. (b) : Because, 34. The power set of AUB, where
(1) Downlink control is sending a data from BS to A = {2, 3, 5, 7} and B = {2, 5, 8, 9} is
MD. Use of Downlink Control in Mobile (a) 256 (b) 64
computing Architecture: The base station (c) 16 (d) 4
subsystem (BSS) is the section of a traditional Ans. (b) : Because, A = {2, 3, 5, 7} and B = {2, 5, 8, 9}
cellular telephones network which is AUB = {2, 3, 5, 7, 8, 9}
responsible for handling traffic & signaling Power set going to have 26 elements which is 64
between a Mobile Device & the network So the answer is (b)
switching subsystem. 35. In Win 32, which function is used to create
(b) Data Communication data rate is 2 Mbps Windows Applications?
(c) User are highly mobile and randomly enter nad (a) Win APP (b) Win API
exit from cells. There is a parameter called (c) Win Main (d) Win Void
Residence Latency (RL), which characterizes
Ans. (c) : Win main is the function which is provided
the average duration of a user’s stag in the cell. to create windows application. The user provided entry
(d) FDDI (Fiber Distributed Data Interfere) point for a graphical windows based application.
specifies 100 mbps token passing, dual-ring
36. Suppose a processor does not have any stack
LAN using fiber-optic cable. pointer registers, which of the following
statements is true?
31. Which of the following flags are set when (a) It cannot have subroutine call instruction.
'JMP' instruction is executed? (b) It cannot have nested subroutine calls.
(a) SF and CF (b) AF and CF (c) Interrupts are not possible.
(c) All flags (d) No flag is set (d) All subroutine calls and interrupts are
Ans. (d) : The JMP is instruction transfers extension to possible.
the address generated by adding the 8-bits value in the Ans. (d) : It cannot have subroutine call instruction
accumulator to the 16-bits value in the DPTR register. because in nested subroutine calls we used to push old
Neither the accumulator nor the DPTR register are subroutines into stack and pointing most recent call
altered. No flags are affected by this instruction. with stack pointer.
32. A thread is a light weight process. In the above 37. Everything below the system call interface and
statement, weight refers to above the physical hardware is known as
(a) time (a) Kernel (b) Bus
(b) number of resources (c) Shell (d) Stub
(c) speed Ans. (a) : The kernel: consists of everything below the
system call interface and above the physical hardware.
(d) All the above
Provides the file system, CPU-scheduling, memory
Ans. (b) : A thread is a light weight process, light management and other operating system functions; a
weight process means same-resources like memory can large number of functions for one level.
be shared between threads. 38. Which is not the correct statement?
So answer is (b). (a) The class of regular sets is closed under
33. The Z-buffer algorithm is used for Hidden homomorphisms.
surface removal of objects. The maximum (b) The class of regular sets is not closed under
number of objects that can be handled by this inverse homomorphisms.
algorithm shall (c) The class of regular sets is closed under
(a) Depend on the application quotient.
(b) be arbitrary no of objects (d) The class of regular sets is closed under
(c) Depend on the memory availability substitution.
(d) Depend on the processor Ans. (b) : Because, The class of regular set is not
Ans. (b) : In z-buffer-algorithm at each pixel we keep enclosed under inverse homomorphism but actually
track of the distance to the closest surface that has been regular sets is closed under inverse homomorphism.
drawn so for; and we throw away fragments that are 39. When a programming Language has the
farther away than that distance. The closest distance is capacity to produce new data type, it is called
stored by allocating an extra value for each pixel, in as
addition to the red, green and blue cooler values, (a) Overloaded Language
which is known as the depth or value. The maximum (b) Extensible Language
number of objects that can be handled by this (c) Encapsulated Language
algorithm shall be arbitrary number of objects. (d) Abstraction Language
UGC NET JRF Computer Science Dec. 2012 Paper-III 37 YCT
 Search on TG: @apna_pdf
Ans. (b) : Because, It supports the style of computer switch takes a seconds. What must be the
programming that focuses on mechanisms to extend quantum size q such that the overhead
the programming language, compiler & runtime resulting from process switching is minimized
environment. It must be possible to add new keywords, but, at the same time each process is
concepts, and structures to the source languages. guaranteed to get its turn at the CPU at least
40. Which of the following operating system is every t seconds?
better for implementing client-server network? t − ns t − ns
(a) q ≤ (b) q ≥
(a) Windows 95 (b) Windows 98 n −1 n −1
(c) Windows 2000 (d) All of these t − ns t − ns
(c) q ≤ (d) q ≥
Ans. (c) : Because, windows 2000 is the latest one. n +1 n +1
window Server 2000 is an operating system for use on Ans. (a) : according to given data
both client and server computers.
41. Consider a system having m resources of the
same type. These resources are shared by 3
processes A, B and C which have peak
demands of 3, 4 and 6 respectively. For what
value of m deadlock will not occur?
(a) 7 (b) 9 Therefore, q(n-1) + n.s≤ t
(c) 10 (d) 13 q(n-1)≤ t-n.s
Ans. (d) : Because, There are 3 processes A, B and C t − ns
q≤
which have peak demands of 3, 4 and 6 respectively. n −1
Maximum number of resources that deadlock can be So answer is (a).
happen: ≤ (3-1) + (4-1) + (6-1) 44. The Default Parameter Passing Mechanism is
Minimum number of resources that deadlock can not called as
be happen: m ≥ (3-1) + (4-1) + (6-1)+1 (a) Call by Value
m≥11 (b) Call by Reference
42. The grammar 'G1' (c) Call by Address
S → OSO ISI 0 1 ∈ and the grammar 'G2' is (d) Call by Name
Ans. (a) : Call by Value
S → as asb X, X → Xa a. The call by value method of passing arguments to a
Which is the correct statement? function copies the actual value of an argument into
(a) G1 is ambiguous, G2 is unambiguous the formal parameter of the function. C does not
(b) G1 is unambiguous, G2 is ambiguous support call by reference, call be address directly. It
(c) Both G1 and G2 are ambiguous access call by reference or address by point.
(d) Both G1 and G2 are unambiguous So the default Parameter Passing Mechanism is call by
value, Hence the answer is (a).
Ans. (b) given grammar G1:
45. Which of the following regular expression
s→0S0│1S1│0│1│∈ is unambiguous.
identities are true?
Grammar G2: S→aS│aSb│X
(a) (r + s)* r* s*
X→Xa│a
(b) (r + s)* = r* + s*
For string w=aaab, there are two parse tree:
(c) (r + s)* = (r* s*)*
(d) r* + s* = r*+ s*
Ans. (c) : (r + s)* = (r* s*)*
Because, Try generating string from both sides.
(r+s)* = (r*+s*)* = (r*s*)* = (r*+s*)* = (r + s*)* =
a* (ba*)* = b* (ab*)*
Hence answer is option (c).
46. Two graphs A and B are shown below : Which
one of the following statement is true?

Hence, grammar G2 is ambiguous grammar,

43. Consider n processes sharing the CPU in round
robin fashion Assuming that each process
UGC NET JRF Computer Science Dec. 2012 Paper-III 38 YCT
 Search on TG: @apna_pdf
(a) Both A and B are planar. 1 P
(b) Neither A nor B is planar. (a) (b)
1− f − f / P P − f ( P + 1)
(c) A is planar and B is not.
(d) B is planar and A is not. 1 P
(c) (d)
Ans. (a) : Both A and B are planar. 1− f + f / P P + f ( P − 1)
A planar graph is a graph that can be embedded in the 1
plane. i.e. it can be drawn on the plane in such a way Ans. (c) :
1− f + f / P
that its edges intersect only at their-end points. It
Because,
means, it can be drawn in such a way that no edges
Let execution time without parallelisms 1
cross each other.
If f is the fraction of parallel computation (1-f)
time must be spend for sequential computation.
f fraction of computation can be distributed
among P processors : So it will take f/p time to
complete computation
Total time for computation with parallelism = 1 –
f + f/p speed up = time without parallelism/time
Hence correct option is (a). with parallelism.= 1/1–F + f/p
50. Which of the following definitions generates
47. The minimum number of states of the non-
the same Language as L,
deterministic finite automation which accepts
the language where L = {WW R W ∈ {a,b}*}
{a b a bn n ≥ 0} ∪ {a b an n ≥ 0} is (a) S → asb bsa ∈
(a) 3 (b) 4 (b) S → asa bsa ∈
(c) 5 (d) 6
Ans. (c) : 5 (c) S → asb bsa asa bsb ∈

Because, L = {a b a b n n ≥ 0} ∪ {a b a n n ≥ 0} (d) S → asb bsa asa bsb

L = {ab, aba, abaa, abab, ababb ------} Ans. (b) : A palindrome is a word, phrase number or
other sequence of characters which reads the same
backward or forward, given language
S → asa bsa ∈
L = {WWR Wε {a,b}*}
This language accepts even length of palindrome.
The set of strings generated by L =
The minimum number of states of the non {ε, aa, abba, baab, bbbbbb, bbaabb–}
deterministic finite automation which accepts the ⇒ We eliminate the (A), (C) because that is not
language = 5 even length palindrome, In option (b) accepts all
Hence option (c) is the answer. even length palindrome. Ex : – ε, aa, bb, aaaa,
48. Functions defined with class name are called as abba, baab, bbbb.
(a) Inline function (b) Friend function ⇒ So option (b) is the answer.
(c) Constructor (d) Static function 51. Suppose there are logn sorted lists of n logn
Ans. (c) : Constructor elements each. The time complexity of
Because, constructor has same name as class it producing a sorted list of all these elements is
Constructors don’t have return type. (use heap data structure)
Constructor is called when object is created. (a) O (n log logn) (b) θ (n log n )
If we do not specify constructor then compiler (c) Ω (n logn) (d) Ω (n3/2)
generates a default constructor Ans. (a) : O (n log logn)
49. Let f be the fraction of a computation (in terms Since we have logn lists we can make a min heap of
of time) that is parallelizable, P the number of logn elements by taking the first element from each of
processors in the system, and sp the speed up the logn sorted lists. Now, we start deleting the min-
achievable in comparison with sequential element from the heap and put the next elements from
execution – then the sp can be calculated using the sorted list from which that element was added to
the relation : the heap. In this way each delete and the corresponding
UGC NET JRF Computer Science Dec. 2012 Paper-III 39 YCT
 Search on TG: @apna_pdf
insert will take O(log logn) time as delete in heap size n 54. The Object Modeling Technique (OMT) uses
is O(logn) & inserting an element on a heap of size n is the following three kinds of model to describe a
n system
also O(logn). Now, we have a total of logn x =n
log n (a) Class Model, Object Model and Analysis
elements. Model.
So total time will be O(n log logn) (b) Object Model, Dynamic Model, and
52. Consider the program below in a hypothetical Functional Model.
programming language which allows global (c) Class Model, Dynamic Model and Functional
variables and a choice of static or dynamic Model.
scoping int i; (d) Object Model, Analysis Model and Dynamic
program Main( ) Model.
{ Ans. (b) : Object Modeling technique (OMT) has
i = 10; types of models.
call f ( ); (i) Object Model – It represents the static
} modeled domain. Main concepts are classes
procedure f( ) are association with attributes & operations.
{ Aggregation & generalization are predefined
int i = 20; relationships.
call g ( ); (ii) Dynamic Model – It represents view on the
} model main concepts are states, transitions
procedure g( ) between states, and events to trigger
{ transitions. Action can be modeled as
print i; occurring within states generalization and
Let x be the value printed under static scoping aggregation are predefined relationship.
and y be the value printed under dynamic (iii) Functional model – It handles the process
scoping. Then x and y are persecuting of the model, corresponding
(a) x = 10, y = 20 (b) x = 20, y = 10 roughly to data flow diagrams. Main concepts
(c) x = 20, y = 20 (d) x = 10, y = 10 are process, data store, and data flow. OMT is
Ans. (a) : In static scoping, the scope of an identifier a predecessor of the unified modeling language
is determined by its location in the code, and since that (UML)
doesn’t change, the scope doesn’t either.
In dynamic scoping, the scope is determined by 55. The factors that determine the quality of a
sequence of calls that has held to the use of an software system are
identifier and since that can be different each time that (a) Correctness, reliability
use is reached, is dynamic. (b) efficiency, usability, maintainability
x = 10, y = 20 (c) testability, portability, accuracy, error
Since the value of x is based on static scoping in tolerances, expandability, access control,
the procedure g() print i will directly look into the audit.
global scope & find i = 10 which was previously set by (d) All of the above
main()
Ans. (d) : All of the above
Since the value of y is based on dynamic point,
procedure g() will first look into the function which The ISO 9126 – 1 Software Quality
called its i.e. procedure f() which has a local i = 20, Model identifies 6 main qualities
which will be taken & 20 will be printed. Characteristics namely: Functionality, Reliability,
53. If the parse tree of a word w generated by a Usability, Efficiency, Maintainability, Portability
Chomsky normal form grammar has no path 56. If a relation with a Schema R is decomposed
of length greater than i, then the word w is of into two relations R1 and R2 such that
length (R1 ∪ R 2 ) = R1 then which one of the following
(a) no greater than 2i+1 (b) no greater than 2i
is to be satisfied for a lossless joint
(c) no greater than 2i-1 (d) no greater than i
decomposition →indicates
(→ functional
Ans. (c) : no greater than 2i-1
dependency)
It a parse tree for a word string w is generated by a
MF & the parse tree (a) (R1 ∩ R2) → R1 or R1 ∩ R2 →R2
has a path length of at most i, (b) R1 ∩ R2 → R1
(i-1)
then the length of w is at most 2 (c) R1 ∩ R2 → R2
So answer is (c). (d) R1 ∩ R2 → R1 and R1 ∩ R2 → R2

UGC NET JRF Computer Science Dec. 2012 Paper-III 40 YCT

 Search on TG: @apna_pdf
Ans. (a) : Let R (A, B, C) and B is the key 61. Which one is a collection of templates and
Let R1 = (A, B) and R2 = (B) So R1 UR2 = R1 rules?
Definition of lossless D : says that if the intersection of (a) XML (b) CSS
two relation has a common attribute and that is a key (c) DHTML (d) XSL
in any of the relation then it is lossless Ans. (d) : XSL stands for extensible style sheet
Now R1∩R2 = B ... AND B → R1 language and is a style sheet language for XML
So lossless and it can also be stated that documents. An XSL style sheet is like with CSS, a file
R1∩R2 = B ... AND B → R2........... that describes how to display an XML document of a
So lossless therefore if we have any one of the above given type.
then it is lossless 62. A program P calls two subprograms P1 and P2.
57. Given the following statements : P1 can fail 50% times and P2 40% times. Then
P can fail
(i) Recursive enumerable sets are closed under
complementation. (a) 50% (b) 60%
(ii) Recursive sets are closed under (c) 10% (d) 70%
complementation. Ans. (d) : Program P fails when either P1 fails or P2
Which is/are the correct statements? fails i.e. failure of P1 failure of P2.
(a) only (i) (b) only (ii) But this will also contain the case when both P1 & P2
(c) both (i) and (ii) (d) neither (i) nor (ii) fails at same time i.e. failure of P1 failure of P2, since
this case will be already be counted on (P1 + P2)
Ans. (b) : only (ii)
Therefore, our final answer will be failure of P1 +
Recursive enumerable sets are not closed under
complementation. failure of P2 – (failure of P1 ∩ failure of P2)
Recursive languages are closed under complement.  50   40   50 40 
So the answer is (b).
⇒  100  +  100  −  100 × 100 
     
58. Skolmization is the process of  90   2000 
(a) bringing all the quantifiers in the beginning of ⇒  100  −  10000 
a formula in FDL.    
(b) removing all the universal quantifiers.  20   200   70 
(c) removing all the existential quantifiers.
=  100  −  1000  =  100  = 70%
     
(d) all of the above
Ans. (c) : Because, Skolemization is the process of
63. Third normal form is based on the concept of –
removing all the existential quantifiers. It is one of the
–––––––.
steps in conversion of first order logic sentences into
(a) Closure Dependency
its equivalent CNF (conjunctive normal form)
(b) Transitive Dependency
59. Which level of Abstraction describes how data
(c) Normal Dependency
are stored in the data base?
(d) Functional Dependency
(a) Physical level (b) View level
(c) Abstraction level (d) Logical level Ans. (b) : Transitive Dependency
Third normal form (3NF) is a normal used in data base
Ans. (a) : Physical level is the lowest level of data
abstraction. This level describes how data is actually normalization.
stored in the physical memory or database. The relation R (table) is in second normal form
2MF
60. The transform which possesses the "multi-
Every non-prime attribute of R is not-transitively
resolution" property is
dependent on every key of R.
(a) Fourier transform
A non-prime attribute of R is an attribute that does not
(b) Short-time-Fourier transform
belong to any candidate key of R.
(c) Wavelet transform
A transitive dependency is a functional dependency in
(d) Karhunen-Loere transform
which X → Z indirectly, by virtue of
Ans. (c) : A multi resolution analysis (MRA) or multi X →Y & Y → Z (where it is not the case that Y → X)
scale approximation (MSA) is the design method of
So the option is (b).
most of the practically relevant discrete wavelet
transform (DWT) & the justification for the algorithm 64. If the Fourier transform of the function f(x, y)
of the fast wavelet transform (FWT) is F(m, n), then the Fourier transform of the
Wavelet transforms are broadly divided into three function f(2x, 2y) is :
classes continuous, discrete and multi-resolution 1 m n 1
(a) F ,  (b) F(2m, 2n)
based. 4  2 2 4

UGC NET JRF Computer Science Dec. 2012 Paper-III 41 YCT

 Search on TG: @apna_pdf

1 1 m n Codes :
(c) F(m, n) (d) F ,
4 4  4 4  a b c d
(a) 3 1 4 2
Ans. (a) : To determine the factor by which the
(b) 2 3 1 4
frequency change, recalls
∞
(c) 4 2 3 1
f ( ω) = ∫ f ( x ) e 2π / ω
dx (d) 1 3 4 1
−∞ Ans. (a) :
Replace x with 2x. Then (a) CITE – defines the title of a work.
∞ (b) EM – defines emphasized text.
f ( ω) = ∫ f ( 2x ) e 4 π / xωdx (c) VAR – defines the variable
−∞
(d) SAMP – defines the sample output from a
Let, 2x = u, computer system.
du du So answer is (a).
Then, = 2 or dx =
dx 2
67. An expert system shell is an expert system
Substituting gives :
without
∞
1 (a) domain knowledge
f ( ω) = ∫ f (u)e 2π / ω
du
2 −∞ (b) explanation facility
But this integral is the same as the defining integral for (c) reasoning with knowledge
the Fourier transform for f(x) with x' replaced with u's. (d) all of the above
Therefore, Ans. (a) : domain knowledge: A shell is an expert
1 system without a knowledge base. A shell furnishes
f ( ω) = F ( ω ' )
2 the expert system developer with the inference engine,
But we know ω ' = m / 2 user interface, and the explanation and knowledge
1 m acquisition facilities.
so F(ω) for f(2x) is F   68. An example of a dictionary-based coding
2 2
technique is
By similar argument,
(a) Run-length coding (b) Huffman coding
1 m
for f(3y), F(ω) = F   (c) Predictive coding (d) LZW coding
2 2
Ans. (d) : LZW coding
Combining the functions gives the Fourier transform, Option A, B, C all are statistical based coding
1 m n techniques. In statistical based coding techniques we
for f(2x, 2y) as F  , 
2  2 2 will encode text according to the frequent occurrence
65. establishes information about when, why and of the alphabets.
by whom changes are made in a software. Hence option (d) : LZW Coding is universal lossless
(a) Software Configuration Management. data compression algorithms is the algorithm the
(b) Change Control. widely used in the GIF image format. It’s an example
(c) Version Control. for dictionary based compression algorithm. It uses a
(d) An Audit Trail. dictionary to code the input text
Ans. (d) : An Audit Trail. 69. Which is the method used to retrieve the
A record showing who has accessed a computer current state of a check box?
system and what operations he or she has performed (a) get State ( ) (b) put State ( )
during a given period of time. Audit trails are useful (c) retrieve State ( ) (d) write State ( )
both for maintaining security and for recovering lost
Ans. (a) : get State ( )
transactions.
Get state method returns the current state. Java.lan.
66. Match the following with respect to HTML
Thread. get state () method returns the state of this
tags and usage.
thread. It is designed for use in monitoring of the
List–I List–II system state, not for synchronization control.
a. CITE 1. Italic representation So get state () can retrieve the current state of check
b. EM 2. Represents output from box.
programmes
70. Referential integrity is directly related to
c. VAR 3. Represents to other source
(a) Relation key (b) Foreign key
d. SAMP 4. Argument to a programme
(c) Primary key (d) Candidate key
UGC NET JRF Computer Science Dec. 2012 Paper-III 42 YCT
 Search on TG: @apna_pdf
Ans. (b) : Foreign key: is a field is one table that Codes :
uniquely identifies a row of another table or the same a b c d
table. This is sometimes called a referencing to any (a) 1 2 3 4
other data. (b) 2 3 1 4
71. You are given four images represented as (c) 3 2 4 1
0 0 0 1  (d) 3 2 1 4
I1   , I2 =  , Ans. (d) : Reinforcement learning is an area of
0 0 0 0
machine learning inspired by behaviorist psychology
0 1 1 1 
I3   , I4 =  , concerned with how software agent ought to take
1 0 1 0  actions in an environment so as to maximize some
The value of entropy is maximum for image notion of cumulative reward C-1
(a) I1 (b) I2 Inductive learning uses lean by example system.
(c) I3 (d) I4 Supervised learning is the machine learning task of
Ans. (c) : I3 inferring a function from labeled training data. There
Entropy of image represents the randomness in pixels. may manual labels of inputs are used.
In I2 all pixels are same entropy is 0 : in I3 2 pixels are Unsupervised learning is a type of machine learning
same other 2 different in i2, i4, 3 are same algorithm used to draw inferences from data sets
So most random is in I3 consisting of input data without labeled responses.
72. A cyptarithmetic problem of the type Hence answer is (d)
SEND 74. A algorithm is guaranteed to find an optimal
+ MORE solution if
MONEY (a) h' is always 0.
Can be solved efficiently using (b) g is always 1.
(a) depth first technique (c) h' never overestimates h.
(b) breadth first technique (d) h' never underestimates h.
(c) constraint satisfaction technique
Ans. (c) : h' never overestimates h
(d) bidirectional technique
A* is a computer algorithm that is widely used in path
Ans. (c) : Constraint satisfaction technique is a genre finding & graph traversal.
of mathematical puzzles in which the digits are
A* is an informed search algorithm, or a best-first
replaced by letters of the alphabet or other symbols. It
search, meaning that it solves problems by searching
has one to one correspondence.
among all possible paths to the solution for the one that
In this cyptarithmetic problem there are some
incurs the smallest cost.
constraints like.
(1) no two alphabets can have same number A* algorithm is guaranteed to find an optimal solution
it h' never overestimates h.
(2) every number can have values in the range 0 –
9 75. Let θ (x, y, z) be the statement "x + y = z" and
By considering these constraints we will solve the let there be two quantifications given as
above problem which satisfy these constraints like M (i) ∀x ∀y ∃Zθ(x, y, z)
will be 1as it is carry & so on. (ii) ∃Z ∀x ∀y θ(x, y, z)
73. Match the following :
Where x, y, z are real numbers. Then which
List–I List–II one of the following is correct?
a. Supervised learning 1. The decision (a) (i) is true and (ii) is true.
system receives (b) (i) is true and (ii) is false.
rewards for its
(c) (i) is false and (ii) is true.
action at the end
of a sequence of (d) (i) is false and (ii) is false.
steps. Ans. (b) : (i) is true and (ii) is true.
b. Unsupervised 2. Manual labels of x + y = z for all x for all y there exist some z which
learning inputs are not will satisfy this equation as e.g. x = 4351 y = 1111
used. then some z = 5462 is there and so on
c. Re-inforcement 3. Manual labels of for some z say z = 100 there do not exist all x and all 4
learning inputs are used. (there exist only some x, 4) which satisfies this
d. Inductive learning 4. System learns by equation hence II is false.
example So answer is (b).
UGC NET JRF Computer Science Dec. 2012 Paper-III 43 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2013

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
Note: This paper contains fifty (50) objective Ans (b) Lines of Code (LOC) is a software metric used
type questions of two (2) marks each. All to measure the size of a computer program by counting
questions are compulsory. The candidates are the number of lines in the text of the program's source
code.
required to select the most appropriate answer A function point is a "unit of measurement" to express
of each question. the amount of business functionally an information
1. COCOMO stands for system (as a product) provides to a user. Function points
(a) Composite Cost Model are used to compute a functional size measurement of
(b) Constructive Cost Model software. The cost (in dollars or hours) of a single unit
(c) Constructive Composite Model is calculated from past projects.
(d) Comprehensive Construction Model 4. A good software design must have
Ans (b) The constructive cost model (COCOMO) is a (a) High module of coupling, High module
procedural software cost estimation model developed by cohesion
W. Boehm. The model uses a basic regression formula (b) High module coupling, Low module cohesion
with parameters that are derived from historical project (c) Low module coupling, High module cohesion
(d) Low module coupling, Low module cohesion
data and current as well as future project characteristics.
Ans (c) Cohesion is a measure that defines the degree
2. Match the following : of intra-dependability within elements of a module.
List-I Coupling is a measure that defines the lines of inter-
(a) Good quality dependability among modules of a program. It tells at
(b) Correctness what lines the modules interface and interact with each
(c) Predictable other.
(d) Reliable All good software have low coupling and high
List-II cohesion.
1. Program does not fail for a specified time in a 5. Cyclometric complexity of a flow graph G with
given environment n vertices and e edges is
(2) Meets the functional requirements (a) V(G) = e + n - 2
(3) Meets both functional and non-functional (b) V(G) = e - n + 2
requirements (c) V(G) = e + n + 2
(4) Process is under statistical control (d) V(G) =e - n - 2
Codes: Ans (b) The cyclomatic complexity of a structured
A B C D program is defined with reference to the control flow
(a) 3 2 4 1 graph of the program, a directed graph containing the
(b) 2 3 4 1 basic blocks of the program, with an edge between two
(c) 1 2 4 3 basic blocks if control may pass from the first to the
(d) 1 2 3 4 second. The complexity M is then defined as
M = E - N + 2P
Ans (a) Correctness meets the functional requirements.
where, E is the number of edges, N is the number of
Good quality more than just correctness meets both vertices and P is the number of connected components.
functional and non-functions requirements. For a single program (or subroutine or method), P is
Reliability is a characteristic which states that program always equal to 1. So, a simpler formula for a single
does not fail for a specific time in given environment. subroutine is:
Predictable means process in under statistical control M=E-N+2
and so is predictable. 6. When the following code is executed what will
3. While estimating the cost of software, Lines Of be the value of x and y ?
Code (LOC) and Function Points (FP) are used int x = 1, y = 0
to measure which one of the following? y = x+ + ;
(a) Length of code (a) 2, 1 (b) 2, 2
(b) Size of software (c) 1, 1 (d) 1, 2
(c) Functionality of software Ans (a) y = x++; returns y then increases x. Initially given
(d) None of the above x is 1. So, y is set to 1 and then x is incremented to 2.
UGC NET JRF Computer Science June 2013 Paper-II 44 YCT
 Search on TG: @apna_pdf
7. How many values can be held by an array A(-1, There are three form of schema, physical conceptual
m; 1, m)? and external.
(a) m (b) m2 External data hiding is tailored to the needs of a
(c) m (m + 1) (d) m (m + 2) particular category of users. Portions of stored data
should not be seen by some users and begins to
Ans (d) A[-1, m] [1, m] is two dimensional array implement a level of security and simplifies the view
where, for these users.
Total number of rows = m - (-1) + 1 = (m + 2)
12. A Network Schema
Total number of columns = m -1 + 1 = m
(a) restricts to one to many relationship
Therefore, size of the array is = m * (m + 2)
(b) permits many to many relationship
8. What is the result of the expression (1 & 2) + (c) stores Data in a Database
3/4)? (d) stores Data in a Relation
(a) 1 (b) 2 Ans (b) 1. Network model permits the modeling of
(c) 3 (d) 4 many to many relationships in data. A set consists of an
Ans (d) 01 owner record type, a set name, and member a member
AND 10 record type.
(1 & 2) is a bitwise AND operation, i.e., 00 2. The network data structure looks like a tree structure,
(3/4) give 4 as integer result. except that a dependent node called a child node may
Therefore, (1 & 2) + (3/4) = 0 + 4 = 4 have more than one parent or owner node. So, one or
more nodes may have multi-parents. Therefore a
9. How many times the word 'print' shall be network model allows a more natural modeling of
printed by the following program segment? relationship between entities. There is no superior or
for (i = 1, i ≤ 2, i + +) subordinate relationship in network model as exists in
for ( j = 1, j ≤ 2, j + +) hierarchical models.
for ( k = 1, k ≤ 2, k + +) 13. Which normal form is considered as adequate
Printf ("print / n") for usual database design?
(a) 1 (b) 3 (a) 2 NF (b) 3 NF
(c) 6 (d) 8 (c) 4 NF (d) 5 NF
Ans (d) For i = 1, j = 1 Ans (b) BCNF does not guarantee dependency
2 times the word will be printed. preserving, but 3 NF satisfied both dependency
for i = 1, j = 2 preserving and lossless join. These are goal of database
2 times the word will be printed. design.
for i = 2, j = 1 So, 3 NF is considered as adequate normal form.
2 times the word will be printed. 14. If D1, D2 ...Dn are domains in a relational
for i = 2, j = 2 model, then the relation is a table, which is a
2 times the word will be printed. subset of
10. Which of the following is not a type of (a) D1 + D2 + ... + Dn
(b) D1 × D2 × ... × Dn
Database Management System?
(c) D1 ∪ D2 ∪ ... ∪ Dn
(a) Hierarchical (b) Network
(d) D1 - D2 - ... - Dn
(c) Relational (d) Sequential
Ans (b) The (x) Cartesian product operator is a binary
Ans (d) There are four structural types of database operator to combines the tuples of the relation with all
management systems. the tuples of the other relation.
1. Hierachical database. The value of relation is a subset of the cartesian product
2. Network database. (x) of D1 , D 2 ,.....D n .
3. Relational database.
4. Object oriented database. 15. Which of the following addresses is used to
But sequential is not a database model. deliver a message to the correct application
program running on a host?
11. Manager's salary details are to be hidden from
(a) Port (b) IP
Employee Table. This Technique is called as (c) Logical (d) Physical
(a) Conceptual level Datahiding Ans (a) A port number is a way to identity a specific
(b) Physical level Datahiding process to which an Internet or other network message
(c) External level Datahiding is to be forwarded when it arrives at a server. For the
(d) Logical level Datahiding TCP (transmission control protocol) and UDP (user
Ans (c) Data hiding is a software development datagram protocol), a port number is a 16 bit integer
technique used in OOP. It is mainly used to hide that is put in the header appended to a message unit.
internal object details, i.e., the design decisions in a Specific port numbers are often used to identity specific
program that are most likely to change. services.
UGC NET JRF Computer Science June 2013 Paper-II 45 YCT
 Search on TG: @apna_pdf
16. In _______ substitution, a character in the Ans (a) 1. The identification field is needed to allow
plaintext is always changed to the same the destination host to determine which datagram a
character in the ciphertext, regardless of its newly arrived fragment belongs to all the fragments of a
datagram contain the same identification value.
position in the text. 2. Time of live (TTL) field is a counter used to limit
(a) polyalphabetic (b) monoalphabetic packet lifetimes.
(c) transpositional (d) multialphabetic 3. The header checksum verifies the header only.
Ans (b) In monoalphabetic substitution, a character (or 20. Given L1 = L (a* baa* and L2 = L(ab*). The
a symbol) in the plain text is always changed to the regular expression corresponding to language
same character (or symbol) in ciphertext regardless of L3=L1/L2 (right quotient) is given by
its position in the text. In other words, the relationship (a) a*b (b) a*baa*
between letters in the plaintext and the ciphertext in one (c) a*ba* (d) None of these
to one. Ans (c) The right quotient (or simply) quotient of a
Whereas polyalphabetic is one to many. formal language L1 with a formal language L 2 is the
17. In classful addressing, the IP address language consisting of strings w such that wx is in L1
190.255.254.254 belongs to for some string x in L 2 i.e.,
(a) Class A (b) Class B L1 / L 2 = {w | ∃x ((x ∈ L 2 ) ∧ ( wx ∈ L1 ))}
(c) Class C (d) Class D Since given
Ans (b) Range of IPv4 addresses: L1 = a *baa * = {ba, aba, abaa, baa,....}
Class Range (First First octet L 2 = ab * = {a, ab, abb, abbb,....}
octet in (from MSB) Therefore,
Decimal) L1 / L 2 = {b, ab, ba, aba,....} = (a * ba*)
A 1-126 0
we have used only string 'a' of language L 2 .
B 128-191 10
C 192-223 110 21. Given the production rules of a grammar G1 as
D 224-239 1110 S1 → AB aaB
E 240-255 1111 A → a Aa
So, first octet (190) of given IP address B→ b
and the production rules of a grammar G2 as
(190.225.254.254) belongs to class B.
S2 → aS2 bS2  bS2 aS2 λ
18. In hierarchical routing with 4800 routers, what Which of the following is correct statement?
region and cluster size should be chosen to (a) G1 is ambiguous and G2 is not ambiguous.
minimize the size of the routing table for a (b) G1 is ambiguous and G2 ambiguous.
three layer hierarchy? (c) G1 is not ambiguous and G2 is ambiguous.
(a) 10 clusters, 24 regions and 20 routers (d) G1 is not ambiguous and G2 is not
ambiguous.
(b) 12 clusters, 20 regions and 20 routers
Ans (b) An ambiguous grammar is a context free
(c) 16 clusters, 12 regions and 25 routers
grammar for which there exists a string that can have
(d) 15 clusters, 16 regions and 20 routers more than one parse tree.
Ans (d) Assume that there is one 'a' clusters, 'b' regions Given, grammar G1 is
in each region and 'c' routers per region.
S1 → AB|aaB
And abc = 4800 (all the options quality multiplications
rule). A → a |Aa
Now, the formula to minimize is B→b
(a - 1) + (b - 1) + c G1 can have two parse tree for string w = aab.
Therefore,
(a) sums 52
(b) sums 50
(c) sums 51
(d) sums 49
So, in option (d) will have to keep minimum routing Grammar G 2 is S2 → aS2 bS2| bS2 aS2 | ∈
table.
G 2 can have two derivation tree for string w = abab.
19. In IPv4 header, the_____ field is needed to allow
the destination host to determine which
datagram a newly arrived fragments belongs to.
(a) identification
(b) fragment offset
(c) time to live
Both grammar G1 and G 2 are ambiguous grammar.
(d) header checksum
UGC NET JRF Computer Science June 2013 Paper-II 46 YCT
 Search on TG: @apna_pdf
22. Given a grammar: S1 → Sc, S SA A, A → 25. Which is the correct statement(s) for Non
aSbab, there is a rightmost derivation S1 ⇒ Sc Recursive predictive parser?
⇒ SAC ⇒ SaSbc. α) = {t
S1: First (α α ⇒ tβ
β for some string β }⇒ tββ
Thus, SaSbc is a right sentential form, and its S2: Follow (X) = {a S ⇒ aXaβ β for some string α
handle is and β }
(a) SaS (b) bc (a) Both statements S1 and S2 are incorrect.
(c) Sbc (d) aSb (b) S1 is incorrect and S2 is correct.
Ans (d) (c) S1 is correct and S2 is incorrect.
SaSbc (d) Both statements S1 and S2 are correct.
Sac [A→aSb] Ans (d) We associate each grammar symbol A with the
Sc[S→SA] first (A). The implication of this set is that the grammar
S1[S1→Sc] ⇒ aSb symbol A can in some steps of transition produce the
23. The equivalent production rules corresponding elements of the set first (A).
to the production rules S → Sα α1Sα α2β 1β 2 is Follow is defined only for non-terminals of the
(a) S → β 1β2, A → α1 Aα2 Aλ grammar G. It can be defined as the set of terminals of
(b) S → β 1β2β1 Aβ2 A, A → α1 Aα2 A grammar G. which can immediately follow the non-
(c) S → β 1β2, A → α1 Aα2 A terminal in a production rule from start symbol.
(d) S → β 1β2β1 Aβ2 A, A → α1 Aα2 Aλ Both statements are true.
Ans (d) S → Sα1 |Sα 2 | β1 | β2 26. Given an open address hash table with load
Left factoring the given grammar gives. factor α < 1, the expected number of probes in
S →β1 | β2 |Aβ1 |Aβ2 . a
A → α1 A| α 2 A| λ successful search is
1  1− α 
24. Given a Non-deterministic Finite Automation (a) Atmost In  
(NFA) with states p and r as initial and final states α  1 
respectively and transition table as given below: 1  1 
(b) Atmost In  
a b α  1− α 
p – q
q r s 1  1 
(c) Atmost In  
r r s α  1− α 
s r s 1  α 
The minimum number of states required in (d) Atmost In  
α  1− α 
Deterministic Finite Automation (DFA)
equivalent to NFA is Ans (b) Theorem: Given an open address hash table
(a) 5 (b) 4 with load factor α = n / m <1 , the expected number of
(c) 3 (d) 2 probes in an unsuccessful and a successful search are at
Ans (b) NFA will be most 1/(1 − α) and (1/ α) In (1/(1 − α)) respectively.
Assuming uniform hashing and assuming that each key
in the table is equally likely to be searched for.
27. For a B-Tree of height h and degree t, the total
Transition table of DFA will be CPU time used to insert a node is
(a) O(h log t) (b) O(t log h)
(c) O(t2 h) (d) O(th)
Ans (d) Inserting a key K into a B-tree T of height h is
done in a single pass down tree, requiring O(h) disk
accesses. The CPU time required is
O(t.h) = O(t.log t (n)).
We can merge state q and s as same transition. 28. The time complexity to build a heap with a list
So, required DFA is : of n-numbers is
(a) O(log n) (b) O(n)
(c) O(n logn) (d) O(n2)
Ans (b) The time complexity of build heap tree
procedure is O(n).

UGC NET JRF Computer Science June 2013 Paper-II 47 YCT

 Search on TG: @apna_pdf
29. The value of postfix expression: 32. The task of correcting and pre processing data
834 + - 382 / + × 2 $ 3 + is is called as
(a) 17 (b) 131 (a) Data streaming (b) Data cleaning
(c) 64 (d) 52 (c) Data mining (d) Data storming
Ans (d) Given, postfix expression is Ans (b) Data scubbing, also called data cleansing is the
834+-382/+*2$3+ process of amending or removing data in a database that
Evaluation of postfix expression using operand stack is is incorrect, incomplete, improperly formatted, or
duplicated.
33. Using data p = 3, q = 11, n = pq, d = 7 in RSA
algorithm find the cipher text of the given plain
text SUZANNE:
(a) BUTAEEZ (b) SUZANNE
(c) XYZABCD (d) ABCDXYZ
Ans (a) Given, P = 3, q = 11, d = 7, n = 33.
Therefore, using RSA algorithm
φ(n) = (P −1) (q −1) = 2 ×10 = 20
and ed =1mod φ(n)
G(1)(e, φ(n)) = 1
30. Consider the following statements for priority
so, e = 3, d = 7
queue : Now, a = 1, b = 2, c = 3, ..... z = 26
S1: It is data structure in which the intrinsic Given SUZANNE = 19, 21, 26, 1, 14, 14, 5
ordering of the elements does determine Since, m ' = m e mod N.
the result of the elements does determine So,
the result of its basic operations.
⇒193 mod 33 = 28(i.e., 28 − 26 = 2)
S2: The elements of a priority queue may be
complex structures that are ordered on one = 2⇒ B
or several fields. ⇒ 213 mod 33 = 21⇒ U
Which of the following is correct?
⇒ 263 mod 33 = 20 ⇒ T
(a) Both S1 and S2 are correct.
(b) S1 is correct and S2 is incorrect. ⇒13 mod 33 =1⇒ A
(c) S1 is incorrect and S2 is correct. ⇒143 mod 33 = 5 ⇒ E
(d) Both S1 and S2 are correct.
⇒ 53 mod 33 = 26 ⇒ Z
Ans (d) 1. A priority queue is a data structure in which
Therefore ciphertext is BUTAEEZ.
the intrinsic ordering of the elements determines the
results of its basic operations. 34. The relation "divides" on a set of positive
2. There are two types of priority queues: integers is ________.
ascending order and descending order priority (a) Symmetric and transitive
queues. The elements of a priority queue need not be (b) Anti symmetric and transitive
numbers or characters that can be compared directly. (c) Symmetric only
(d) Transitive only
They may be complex structures that are ordered on one
or several fields. Ans (b) 1. A relation R on a set A is called
antisymmetric if and only if for any a and b in A,
31. Repository of information gathered from
whenever (a, b)∈ R and (b, a)∈ R then a = b must
multiple sources, storing under unified scheme
at a single site is called as. hold.
(a) Data mining (b) Meta data 2. Since, a/b and b/a is true if and only if a = b then the
(c) Data warehousing (d) Database relation satisfies the property of being antisymmetric.
3. A relation R on a set A is called transitive if (a, b) ∈
Ans (c) 1. A data warehouse is constructed by
integrating data from multiple heterogeneous sources. It R and (b, c) ∈ R the (a, c) ∈ R must hold.
supports analytical reporting, structured and/or adhoc 4. If a/b and b/c hold then a/c also hold so, given
queries and decision making. relation is antisymmetric and transitive.
2. Collections of database that work together are called 35. Give as good a big-O estimate as possible for
data warehouses. This makes in possible to integrate the following functions:
data from multiple database. (n log n + n2) (n3 + 2) and
3. Data mining is used to help individuals and (n! + 2n) (n3 + log ( n2 + 1))
organizations make better decisions. Meta data is data (a) O(n5 + 2n2) and O(n3 × n!)
that describes other data. (b) O(n5) and O(n3 × 2n)
UGC NET JRF Computer Science June 2013 Paper-II 48 YCT
 Search on TG: @apna_pdf
(c) O(n5) and O(n3 × n!) 40. The truth value of the statements:
(d) O(n5 + 2n2) and O(n3 × 2n) ∃! xP( x) → ∃xP(x) and ∃!x¬P ( x ) → ¬∀xP( x )
Ans (c) Let f and g be two functions defined on some
subset of the real numbers one writes f(x) = O(g(x)) as (Where the notation ∃! xP( x) denotes the
x → 0. If and only if there is a positive constant m such proposition "There exists a unique x such that
that for all sufficiently large value of x. In other words P(x) is true") are:
(a) True and False (b) False and True
⇒ f ( x) ≤ m g ( x) ∀ x ≥ x0
(c) False and False (d) True and True
⇒ f ( x) = O (g( x)) Ans : (d) (i) If there exists a unique x with p(x) true,
f ( x) then there exist and x with p(x) true. This is true as
⇒ lim =0
n →∞ g(n) exactly one is a subset of at least one.
(ii) If there exists a unique x with p(x) false, then there
36. A test contains 100 true/false questions. How
exist an x with p(x) false. This is also true since exactly
many different ways can a student answer the one is a subset of atleast one and ¬∀x p( x) = ∃x¬p( x).
questions on the test, if the answer may be left
blank also. 41. How many different Boolean functions of
100 100
(a) P2 (b) C2 degree 4 are there?
(c) 2100 (d) 3100 (a) 2 4 (b) 28
Ans (d) There is three options of each question, i.e., (c) 2 12
(d) 216
either answer true or answer false or leave it blank. So,
Ans : (d) Total number of boolean functions with total
total number of answering the test.
= 3 × 3 × 3 × .... × (100 times) = 3100 2n
n

37. Which of the following connected simple graph Combinations = 2 2 .

has exactly one spanning tree? Given, n = 4, therefore,
Number of boolean functions = 22 = 216.
4
(a) Complete graph (b) Lord Harvey
(c) Thomas Shadwell (d) Joseph Addison
42. A Boolean operator θ is defined as follows:
Ans (d) A connected simple graph has unique spanning
tree only if graph edges have distinct edge weights. 1 θ1 =1, 1θ 0 = 0, 0 θ1 = 0 and 0 θ 0 =1
38. How many edges must be removed to produce What will be the truth value of the expression
the spanning forest of a graph with N vertices, ( x θ y) θ z = x θ (y θ z)?
M edges and C connected components? (a) Always false
(a) M + N - C (b) M - N - C (b) Always true
(c) M - N + C (d) M + N + C (c) Sometimes true
Ans : (c) [M – N + C] edges must be remove to produce (d) True when x, y, z are all true
to spanning fastest of a graph with 'N' vertices.
Ans : (b) (xy + x y) = xθy always true.
39. Which of the following shall be a compound
proposition involving the propositions p, q and 43. Which one of the following is decimal value of
r, that is true when exactly two of the p, q and r a signed binary number 1101010, if it is in 2's
are true and is false otherwise? complement form?
(a) (p ∨ q ∧ ¬ r) ∨ (p ∧ q ∨ r) ∧ (¬p ∧ q ∨ r) (a) -42 (b) -22
(c) -21 (d) -106
(b) (p ∧ q ∨ r) ∧ (p ∧ q ∧ r) ∨ (¬q ∧ ¬ p ∧ ¬ r)
Ans : (b) If MSB (most significant bit) of 2's
(c) (p ∧ q ∧ ¬ r) ∨ (p ∧ ¬ q ∧ r) ∨ (¬p ∧ q ∧ r) complement representation is 1 then number is negative
(d) (p ∨ r ∧ q) ∨ (p ∧ q ∧ r) ∨ (¬p ∧ q ∧ r) (magnitude is 2's complement) else number is positive
Ans : (c) Draw the truth table of boolean function that itself.
involves p, q and r that is true when exactly two of the Since MSB of given 2's complement representation is 1,
p, q and r are true and is false otherwise. so, given number is negative and its magnitude is:
⇒ 2's complement of 1101010
⇒ 0010101 + 1 = (0010110) 2
⇒ (22)10
So, number is - 22.
44. A set of processors P1 , P2 ,........Pk can execute in
parallel if Bernstein's conditions are satisfied
Therefore, on a pairwise basis; that is P1~~ P2 ~~ P3......~~ Pk
f = (¬ p ∧ q ∧ r) ∨ (p ∧ ¬ q ∧ r) ∨ (p ∧ q ∧ ¬ r) if and only if:
UGC NET JRF Computer Science June 2013 Paper-II 49 YCT
 Search on TG: @apna_pdf
(a) Pi ~~ Pj for all i ≠ j 48. Let the page fault service time be 10
(b) Pi ~~ Pj for all i = j +1 millisecond (ms) in a computer with average
(c) Pi ~~ Pj for all i ≤ j memory access time being 20 nanosecond (ns).
(d) Pi ~~ Pj for all i ≥ j If one page fault is generated for every 106
Ans : (a) A set of processes can execute in parallel if memory accesses, what is the effective access
Bernstein's conditions are satisfied on a pair wise basis; time for memory?
that is P1~~ P2......Pk if and only if P1~~ Pj for all i ≠ j. (a) 21 ns (b) 23 ns
(c) 30 ns (d) 35 ns
45. When a mobile telephone physically moves
Ans : (c) Given, page fault service time (c) = 10 msec
from one of the another cell, the base station
= 10 ×106 n sec
transfers ownership to the cell getting strongest
signal. This process is known as _______ . Memory access time (m) = 20 nsec
(a) handoff (b) mobile switching Pagefault rate = 1/ 106
(c) mobile routing (d) cell switching Therefore,
Ans : (a) In a cellular telephone network, handoff is the 1  1 
transition for any given user of signal transmission from EMAT = 6 ×10 ×106 +  1 − 6  × 20
10  10 
one base station to a geographically adjacent base
20
station as the user moves around. = 10 + 20 − 6 ⇒ 30 n sec
46. A virtual memory based memory management 10
algorithm partially swaps out a process. This is 49. Consider the following UNIX command:
an example of sort <in> temp; head - 30 <temp; rm temp
(a) short term scheduling Which of the following functions shall be
(b) long term scheduling performed by this command?
(c) medium term scheduling (a) Sort, taking the input from "temp", prints 30
(d) mutual exclusion lines from temp and delete the file temp
Ans : (c) Medium term scheduling is a part of (b) Sort the file "temp", removes 30 lines from
swapping. It removes the processes from the memory. It temp and delete the file temp
reduces the degree of multiprogramming. The medium (c) Sort, taking the input from "in" and writing
term scheduler is in charge of handling the swapped-out the output to "temp" then prints 30 lines from
processes. temp on terminal. Finally "temp" is removed.
A long term schedules determines which program are (d) Sort, taking the input from "temp" and then
admitted to the system for processing. It select prints 30 lines from "temp" on terminal.
processes from the queue and load them into memory Finally "temp" is removed.
for execution.
Ans : (c) Sort, taking the input from "in" and writing
The short-term scheduler decides which of the ready,
the output to "temp" then prints 30 lines from temp on
in-memory processes is to be executed after a clock
terminal. Finally "temp" is removed.
interrupt, an I/O interrupt, an operating system call, or
another form of signal. 50. The mv command changes
47. Assuming that the disk head is located initially (a) the inode
(b) the inode-number
at 32, find the number of disk moves required (c) the directory entry
with FCFS if the disk queue of I/O block
(d) both the directory entry and the inode
requests are 98, 37, 14, 124, 65, 67:
(a) 310 (b) 324 Ans : (c) mv (short for move) is a Unix command that
(c) 320 (d) 321 moves one or more files or directories from one places
Ans : (d) Given request is: 98, 37, 14, 124, 65, 67 to another. If both filenames are on the same file
Using FCFS (first come first serve) disk system, this results in a simple file rename, otherwise
scheduling. the file content is copied to the new location and the old
file is removed.
Using mv requires the user to have write permission for
directories the file will move between. This is because
mv changes the content of both directories (i.e., the
So, total number of disk moves: source and the target) involved in the move. The files
= 66 + 84 + 110 + 59 + 2 = 321 'i'-number (short for "i-node number") does not change.

UGC NET JRF Computer Science June 2013 Paper-II 50 YCT

 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2013

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. The Software Maturity Index (SMI) is defined Ans : (d) Watson-Felix model is a cost estimation
as SMI=[M1–(Fa+Fc+Fd]/M1 Where model similar to cost estimation which says effort,
M1=the number of modules in the current release. E = 5.2 (KLOC)0.91 .
Fa=the number of modules in the current release
Quick fix model is a maintenance approach in which
that have been added. we wait till problem occurs and fix it as quickly as
Fc= the number of modules in the current release possible.
that have been changed. Putnam resource allocation model is used for effort
Fd= the number of modules in the current release estimation for a project and is used while planning a
that have been deleted. project.
The product begins to stabilize when A logarithmic Poisson execution time model is for
(a) SMI approaches 1 software reliability measurement.
(b) SMI approaches 0 3. ____is a process model that removes defects
(c) SMI approaches –1
before they can precipitate serious hazards.
(d) None of the above
(a) Incremental model
Ans : (a) Software maturity index: Based on number (b) Spiral model
of modules in current release and number of modules (c) Cleanroom software engineering
changed, added, deleted in current release: (d) Agile model
SMI = [M t − (Fa + Fc + Fd )]/ M t Ans : (c) Clean Room Software Engineering (CSE) is
where, a process model that removes defects before they can
M t = # modules in current release precipitate serious hazards. It is a team oriented, theory
Fc = modules changed in current release based software, which is developed using the formal
methods, correctness verification and Statistical Quality
Fa = # modules added Assurance (SQA). Clean room management is based on
Fd = # modules deleted the incremental model of software development, which
SMI = [M t − (0 + 0 + 0)]/ M t =1(good) accumulates into the final product.
The goal of clean room-engineering is to produce zero
The product begins to stabilized when no new module is error based software by allowing correct designs.
added in current release (i.e., Fa = 0), no change happen
4. Equivalence partitioning is a ______ method
in old release, (i.e., Fc = 0), no module is removed from that divides the input domain of a program
old release (Fd = 0). into classes of data from which test cases can
be derived.
2. Match the following:
(a) White–box testing
List–I (b) Black–box testing
A. Watson-Felix model (c) Orthogonal array testing
B. Quick-Fix model (d) Stress testing
C. Putnam resource allocation model Ans : (b) The general tendency is to relate equivalence
D. Logarithmetic-Poisson Model partitioning to black box testing which is strictly
List–II checking a software component at its interface, without
1. Failure intensity any consideration of internal structures of the software.
2. Cost estimation 5. The following three golden rules:
3. Project planning
(i) Place the user in control
4. Maintenance
(ii) Reduce the user's memory load
Codes: (iii) Make the interface consistent
A B C D are for :
(a) 2 1 4 3 (a) User satisfaction
(b) 1 2 4 3 (b) Good interface design
(c) 2 1 3 4 (c) Saving system's resources
(d) 2 4 3 1 (d) None of these
UGC NET JRF Computer Science June 2013 Paper-III 51 YCT
 Search on TG: @apna_pdf
Ans : (b) There are certain universal golden rules of Ans : (d) Select deptname
user interface design regardless of the domain, user From employee
interface, or intended device (Computer, Tablet or Where sex = 'M'
Phone) group by dept name
These are: having avg (salary) > (select avg (salary) from
1. Place users in control employee)
2. Reduce users memory load We are selecting male employee by grouping all the
3. Make the interface consistent male employee of a department whose average salary is
Each of these groups contains a number of specific greater than the average salary of organization.
rules. 9. For a database relation R (a,b,c,d) where the
6. Software safety is a _____ activity that focuses domains of a, b, c, d include only the atomic
values. The functional dependency a→ →c, b→
→d
on the identification and assessment of
holds in the following relation
potential hazards that may affect software (a) In 1NF not in 2 NF
negatively and cause an entire system to fail. (b) In 2 NF not in 3 NF
(a) Risk mitigation, monitoring and management (c) In 3 NF
(b) Software quality assurance (d) In 1 NF
(c) Software cost estimation Ans : (a) Given relation is R(a, b, c, d) with functional
(d) Defect removal efficiency dependencies:
Ans : (b) Software safety is a software quality {a → c, b → d}
assurance activity that focuses on the identification and
So candidate key is {ab}.
assessment of potential hazards that may affect software
The given relation has partial dependency (both a → c ,
negatively and cause an entering system to fail.
Examples of possible failures are: and b → d ). Such kind of dependencies (are not
1. Uncontrolled acceleration of a vehicle. allowed in 2NF.
2. Locked doors. So, relation R is not in 2NF, but is in 1NF.
3. Prevention braking. 10. Match the following:
7. The "PROJECT" operator of a relational List–I List–II
algebra creates a new table that has always A. RAID 0 1. Bit interleaved parity
(a) More columns than columns in original table B. RAID 1 2. Non redundant stripping
(b) More rows than original table C. RAID 2 3. Mirrored disks
(c) Same number of rows as the original table D. RAID 3 4. Error correcting codes
(d) Same number of columns as the original table Codes:
A B C D
Ans : (*) Project in relation algebra remove duplicate. (a) 4 1 2 3
The project operation is unary operation. This operation (b) 3 4 1 2
returns a set of tuples containing a subset of the (c) 3 1 4 2
attributes in the original relation. It discards the (d) 2 3 4 1
duplicate rows. Ans : (d) 1. RAID 0 (also known as a stripe set or
So, none option is true. Note that official key is given striped volume) splits data evenly across two or more
option (c) which is wrong. disks, without parity information redundancy, or fault
8. The employee information of an Organization tolerance.
is stored in the relation: 2. RAID 1 consists of an exact copy (or mirror) of a set
Employee (name, sex, salary, deptname) of data on two or more disks: a classic RAID 1 mirrored
Consider the following SQL query pair contains two disks.
Select deptname from Employee 3. RAID 2, which is rarely used in practice, stripes data
Where Sex ='M' at the bit (rather than block) level, and uses a Hamming
code for error correction.
Group by deptname
4. RAID 3, which is rarely used in practice, consist of
Having avg (salary)>
byte-level striping with a dedicated parity disk.
{select avg (salary)from Employee}
Output of the given query corresponds to 11. The golden ratio ϕ both satisfy the equation
(a) Average salary of employee more than (a) x3–x–1=0 (b) x3+x–1=0
2
average salary of the organization (c) x –x–1=0 (d) x3+x–1=0
2
(b) Average salary less than average salary of the  1+ 5   1+ 5 
organization Ans : (c) φ − φ −1 = 
2
 −   −1 = 0
(c) Average salary of employee equal to average  2   2 
salary of the organization. And now the conjugate:
2
(d) Average salary of male employees in a  1− 5   1− 5 
department is more than average salary of the φˆ 2 − φˆ −1 =   −   −1 = 0
organization.  2   2 
UGC NET JRF Computer Science June 2013 Paper-III 52 YCT
 Search on TG: @apna_pdf

Therefore, the golden ratio φ and its conjugate φ̂ both Ans : (d) Huffman tree is:
satisfy the equation
x2 − x −1= 0
12. The solution of recurrence relation,
T(n)=2T(floor ( n )+logn is
(a) O(n log log log n)
(b) O(n log log n)
(c) O(log log n)
(d) O(logn log log n)
Ans : (d) Given recurrence relation is: So, total weight is:
T (n) = 2T ([ n ]) + log n Sum of internal node's value
= 100 + 55 + 45 + 30 + 14 = 224
Substituting = 224,000 bits
n = 2m 15. A vertex cover of an undirected graph G (V,E)
⇒ m = log n is a subset V1⊆V vertices such that
(a) Each pair of vertices in V1 is connected by an
T (2 m ) = 2T (2m / 2 ) + m edge
We can rename S (m) = T (2m ) to produce the (b) If (u,v)∈ E then u∈ V1 and v∈V1
(c) If (u,v) ∈E then u∈ V1 or v∈V1
new recurrence (d) All pairs of vertices in V1 are not connected
S(m) = 2S (m/2) + m by an edge
a = 2, b = 2, f(m) = m Ans : (c) Vertex cover: Given an undirected graph G =
O(m
log
2( 2 )
) = f (m) [case (2) master theorem] (V, E), a vertex cover is a subset of vertices S ⊆ V such
So, T (n) = Θ(m log 2 m) that for each edge (U, V) ∈ E, either U ∈ S or V ∈ S or
both.
replace m = log 2 (n), therefore,
16. In a fully connected mesh network with n
T (n) = Θ(log n log log n) devices, there are ______ physical channels to
13. In any n-element heap, the number of nodes of link all devices.
(a) n(n–1)/2 (b) n(n+1)/2
height h is (c) 2n (d) 2n+1
 n  Ans : (a) A fully connected network, complete
(a) less than equal to  
 2h  topology, or full mesh topology is a network topology
in which there is a direct link between all pairs of
 n  nodes. In a fully connected network with n nodes, there
(b) greater than  
 2h  n(n −1)
are direct link.
 n  2
(c) greater than   17. The baud rate of a signal is 600 baud/second. If
 2h + 1 
each signal unit carries 6 bits, then the bit rate
 n  of a signal is ______.
(d) less than equal to   (a) 3600 (b) 100
 2h + 1 
(c) 6/600 (d) None of these
Ans : (d) Theorem: The number of nodes at height h in Ans : (a) Baud rate 600 baud/second means where 600
 n  characters are transmitted in a second each character is
a heap tree are almost  h + 1  . of 6 bits.
2 
Therefore, Bit rate = 600 × 6 = 3600 bps
14. A data file of 1,00,000 characters contains only 18. Match the following :
the characters g–I, with the frequencies as List-I
indicated in table: A. Data link layer
g h i j k l B. Network layer
Frequency 45 13 12 16 9 5 C. Transport layer
D. Application layer
in thousand
List-II
using the variable-length code by Huffman 1. Flow control
codes the file can be encoded with. 2. Node to node delivery
(a) 2,52,000 bits (b) 2,64,000 bits 3. Mail services
(c) 2,46,000 bits (d) 2,24,000 bits 4. Routing
UGC NET JRF Computer Science June 2013 Paper-III 53 YCT
 Search on TG: @apna_pdf
Codes: (a) 10 megabaud (b) 20 megabaud
A B C D (c) 30 megabaud (d) 40 megabaud
(a) 2 1 4 3 Ans : (b) The Ethernet uses Manchester encoding,
(b) 2 4 1 3 which means it has two signal periods per bit sent. The
(c) 2 1 3 4 data rate of the standard ethernet is 10 Mbps, so the
(d) 2 4 3 1 baud rate is twice, or 20 megabaud.
Ans : (b) Data link layer is responsible for node (hop) 23. At any iteration of simplex method, if ∆j(zj–Cj)
to node (hop) delivery and transport layer is responsible corresponding to any non-basic variable xj is
for process (end) to process (end) delivery. obtained as zero, the solution under the test is
Routing is the process of construction of routing table. (a) Degenerate solution
At the transport layer flow control will allow the (b) Unbounded solution
transport protocol entity in a host to restrict the flow of (c) Alternative solution
data over a logical connection from the transport (d) Optimal solution
protocol entity is another host.
SMTP (Simple Mail Transfer Protocol) is an Ans : (c) Rule: If all ∆J ≥ 0,the solution under the text
application layer protocol for electronic mail (email) will be optimal. Alternate optimal solution will exist if
transmission. any non-basic ∆J, is also zero.
19. An image is 1024 × 800 pixels with 3 24. A basic feasible solution to a m-origin, n-
bytes/pixel. Assume the image is destination transportation problem is said to be
uncompressed. How long does it take to _____ if the number of positive allocations are
transmit it over a 10 Mbps Ethernet? less than m+n–1.
(a) 196.6 seconds (a) degenerate (b) non-degenerate
(b) 19.66 seconds (c) unbounded (d) unbalanced
(c) 1.966 seconds Ans : (a) Basic feasible solution: Feasible solution to a
(d) 0.1966 seconds m-origin and n-destination problem is said to be basic
Ans : (c) Transmission time feasible solution if the number of positive allocation are
Data (m + n - 1). If the number of allocations in a basic
= feasible solution are less than (m + n - 1); it is called
Bandwidh
degenerate basic feasible solution (otherwise non-
1024 × 800 × 3× 8 degenerate).
=
10 ×106 25. The total transportation cost in an initial basic
= 1.96608 seconds feasible solution to the following transportation
20. The______ measures the relative strengths of problem using Vogel's Approximation method is
two signals or a signal at two different points.
(a) frequency (b) attenuation W W W W W5 Supply
(c) throughput (d) decibel 1 2 3 4
Ans : (d) To show that a signal has lost or gained F1 4 2 3 2 6 8
strength, engineers use the concept of decibel. The F2 5 4 5 2 1 12
decibel (dB) measures the relative strengths of two F3 5 5 4 7 3 14
Demand 4 4 6 8 8
signals or a signal at two different points. Note that the
dB is negative if a signal is attenuated and positive if a (a) 76 (b) 80
signal is amplified. (c) 90 (d) 96
dB =10 log10 ( P1 / P2 ) Ans : (b) Optimality test using stepping stone method.
Where P1 and P2 are the power of a signal at point 1 Allocation table is:
and 2 respectively. D1 D2 D3 D4 D5 Dummy Suppl
y

21. Which one of the following media is S1 4(4) 2(4) 3 2(d 6 0 8

multidrop? )

(a) Shielded Twisted pair cable S2 5 4 5( 2( 1 0 12

(b) Unshielded Twisted pair cable 6) 6)
(c) Thick Coaxial cable S3 6 5 4 7( 3( 0(4) 14
(d) Fiber Optic cable 2) 8)
Supply
Ans : (c) In a bus network, a single length of wire, 4 4 6 8 8 4
cable or optical fiber connects a number of computers. The minimum total transportation cost is
All the computers are connected to a single =4×4+2×4+2×8+1×4+4×6+3×4
transmission media normally a thin or thick coaxial +0×4
cable, in the form of tapings. = 80
22. What is the baud rate of the standard 10 Mbps Note: Alternative solution is available with unoccupied
Ethernet? cell S3 D1 = 0 , but with the same optimal value.

UGC NET JRF Computer Science June 2013 Paper-III 54 YCT

 Search on TG: @apna_pdf
26. An actor in an animation is a small program and vertical resolution may differ. If 40 black lines that
invoked _____ per frame to determine the are interleaved with 40 white lines can be distinguished
characteristics of some object in the animation. across one inch, the resolution is 80 lines per inch, the
(a) once (b) twice resolution is 80 lines per inch (also referred to as 40
(c) 30 times (d) 60 times lines pairs per inch).
Ans : (a) The use of actors is a high-level form of 31. Images tend to be very large collection of data.
procedural control. An actor in an animation is a small The size of memory required for a 1024 by
program involved once per frame to determine the 1024 image in which the colour of each pixel is
characteristics of same object in the animation. An represented by a n-bit number, (in an 8 bit
actor, in the course of its once-per-frame execution, machines) is
may send message to other actors to control their (a) n×8 MB (b) n/8 MB
behaviors. (c) (1024×1024)/8 MB (d) 1024 MB
27. Bresenham line drawing algorithm is attractive Ans : (b)
Size of 1 pixel = n bit = n/8 Bytes
because it used Size of 1024 × 1024 image
(a) Real arithmetic only = 1024 × 1024 × n/8 Bytes
(b) Integer arithmetic only = n / 8 220 Bytes
(c) Floating point arithmetic
(d) Real and integer arithmetic = n/8 MB
Ans : (b) Bresenham's algorithm offers a significant 32. Arrays in C language can have _____ with
advantage over the other method, as it avoids floating- reference to memory representation.
point arithmetic and rounding. It is a classic example of (a) n-subscripts
an incremental algorithm that computes the location of (b) two-subscripts
each pixel along the line, based on information about (c) only one subscript
the previous pixel. It uses only integer values and (d) three subscripts only
avoids any multiplications. Ans : (c) Every individual element of an array is
referenced by appending a subscript in square brackets
28. There fresh rate above which a picture stops behind the name.
flickering and fuses into a steady image is Array in C can have only one-subscript, but arrays can
called ______. have arrays as elements, thus supporting
(a) Crucial fusion frequency multidimensional arrays. This is an example of
(b) Current frequency fusion orthogonality.
(c) Critical fusion frequency 33. Refer the points as listed below:
(d) Critically diffused frequency (i) What are the operator precedence rules?
Ans : (c) The refresh rate of a CRT is the number of (ii) What are the operator associativity rules?
times per second the image is redrawn. It is typically 60 (iii) What is the order of operand evaluation?
per second for raster displays. As the refresh rate (iv) Are there restrictions on operand
decreases, flicker develops because the eye can no evaluation side effects?
longer integrate the individual light impulses coming Which of the above must be considered as
from a pixel. The refresh rate above which a pictures primary
stop flickering and fuses into a steady image is called (a) (i), (ii) and (iii)
the critical fusion frequency or CFF. The process of (b) (i), (iii) and (iv)
fusion is familiar to all of us, it generally occurs (c) (i), (ii) and (iv)
whenever we watch television or motion pictures. (d) (i), (ii), (iii) and (iv)
29. In homogenous coordinate system (x, y, z) the Ans : (d) Arithmetic expressions: Unary, binary and
ternary operators meaning an operator can have one,
points with z=0 are called
two or three operand respectively. Design issues
(a) Cartesian points (b) Parallel points
include:
(c) Origin point (d) Point at infinity
1. What are the operator precedence rules?
Ans : (d) In homogenous coordinates system (x, y, z) 2. What are the operator associativity rules?
the points with z = 0 are called point at infinity. 3. What is the order of operand evaluation?
30. If 40 black lines interleaved with 40 white lines 4. Are there restrictions on operand evalution side
can be distinguished across one inch, the effects?
resolution is 5. Does the language allow user-defined-operator
(a) 40 line-pairs per inch overloading?
(b) 80 line-pairs per inch 6. What type mixing is allowed in expressions?
(c) 1600 lines per inch 34. Horn clauses are special kinds of propositions
(d) 40 lines per inch
which can be described as
Ans : (a) Resolution is defined as the closest spacing at (a) Single atomic proposition on left side.
which adjacent black and white lines can be (b) Single or multiple atomic proposition on left
distinguished to observers which implies that horizontal side.
UGC NET JRF Computer Science June 2013 Paper-III 55 YCT
 Search on TG: @apna_pdf
(c) A single atomic proposition on left side and a (i) δ(q, a, b) contains at most one element.
single atomic proposition on right side.
(ii) if δ(q, λ, b) is not empty, then δ(q, c, b) must be
(d) A single atomic proposition on left side or an
empty left side. empty for every c∈∑ .
Ans : (d) Horn clauses: These are restricted kind of The first condition states that for any given input
clauses which must be used to specify-propositions that symbol and any stack top, at most one move can be
are used for resolution. These propositions either have a made. The second condition states that if a λ − move is
single atomic proposition on the left side or an empty possible for some configuration no input consuming
left side. alternative should be possible for that configuration.
35. Which of the following is/are the fundamental 38. For every context free grammar (G) there
semantic model (s) of parameter passing? exists an algorithm that passes any w∈ L (G) in
(a) in mode (b) out mode number of steps proportional to
(c) in-out mode (d) all of these (a) In |w| (b) |w|
Ans : (d) Formal parameters are characterized by one (c) |w|2 (d) |w|3
of three distinct semantic models: Ans : (d) Convert CFG to CNF and then are CYK
1. In mode: They can receive data from corresponding algorithm which runs in steps proportional to O(| w |3 ).
actual parameters.
2. Out mode: They can transmit data to the actual 39. Match the following :
parameter. List-I
3. In-out Mode: They can do the functionally of both A. Context sensitive language
IN and OUT mode. B. Regular grammar
36. The grammar with production rules C. Context free grammar
D. Unrestricted grammar
S→aSb|SS|λ
List-II
generates language L given by:
1. Deterministic finite automation
(a) L={w∈{a,b}*|na(w)=nb(w) and na(v) ≥ nb(v)
2. Recursive enumerable
where v is any prefix of w}
3. Recursive language
(b) L={w∈{a,b}*|na(w)=nb(w) and na(v) ≤ nb(v) 4. Pushodown automation
where v is any prefix of w}
Codes:
(c) L={w∈{a,b}*|na(w) ≠ nb(w) and na(v) ≥ nb(v) A B C D
where v is any prefix of w} (a) 2 1 4 3
(d) L={w∈{a,b}*|na(w) ≠ nb(w) and na(v) ≤ nb(v) (b) 3 4 1 2
where v is any prefix of w} (c) 3 1 4 2
Ans : (a) Given grammar is (d) 2 4 1 3
S → aSb | SS |∈ Ans : (c) 1. Regular grammar - Deterministic finite -
Each S generates equal number of a's and b's. automation
i.e. na ( w) = nb ( w). 2. Context - free grammar - pushdown automation
3. Context sensitive language - Recursive language
Since, before each 'b', one 'a', is produced,
4. Unrestricted grammar - Recursive enumerable
number of a's will be greater or equal to number of b's
in any prefix of string. 40. The statements s1 and s2 are given as:
Therefore, language is: S1: Context sensitive languages are closed
L = {w∈{a, b}*| na ( w) = nb ( w) under intersection, concatenation, substitution
and inverse homomorphism.
and na (V ) ≥ nb (V ) where v is any prefix of w} S2: Context free languages are closed under
37. A pushdown automation M = (Q, Σ, Γ, δ, q0, Z, complementation, substitution and
homomorphism.
F) is set to be deterministic subject to which of
Which of the following are correct statements?
the following condition (s), for every
(a) Both S1 and S2 are correct.
q∈Q,a∈Σ∪{λ} and b∈Γ (b) S1 is correct and S2 is not correct
S1: δ(q, a ,b) contains at most one element (c) S1 is not correct and S2 is correct
S2: If δ(q, λ, b) is not empty then δ(q, c, b)must (d) Both S1 and S2 are not correct
be empty for every c∈Σ Ans : (b) 1. Context sensitive languages are closed
(a) only S1 (b) only S2 under complement, union, intersection, concatenation,
(c) both S1 and S2 (d) neither S1 nor S2 substitution, inverse-homomorphism and kleen closure.
Ans:(c) A pushdown automata M = {Q, ∑, Γ, q0 , z , F , δ} But are not closed under homomorphism property.
is said to be deterministic if it is an automata as 2. Context free languages are closed under substitution
subjected to the restrictions that, for every and homomorphism but are not closed under
q ∈Q, a ∈∑ ∪{∈} and b ∈Γ, complement, intersection operation.

UGC NET JRF Computer Science June 2013 Paper-III 56 YCT

 Search on TG: @apna_pdf
41. Which one of the following is not an addressing (c) (W'+X')(Y'+Z)(X'+Z)
mode? (d) (W'+X')(Y+Z')(X'+Z)
(a) Register indirect Ans : (a) Given Boolean function is:
(b) Auto increment f ( w, x, y, z ) = ∑(0,1, 2,5,8,9,10)
(c) Relative indexed K-map is:
(d) Immediate operand
Ans : (c) Relative indexed is not an addressing mode.
42. Computers can have instruction formats with
(a) only two address and three address
instructions
(b) only one address and two address instructions
(c) only one address, two address and three
address instructions
(d) zero address, one address, two address and
three address instructions
Ans : (d) 1. Stack operations uses zero-address, that is
there is no address field in the computational
instructions.
2. One address instructions use an accumulator (AC) Product of sum is:
register for all data manipulation. f = ( w + x ).( y + z ).( x + z )
3. Two-address instructions are the most common in 46. Match the following :
commercial computers. List–I
4. Computers with three-address instruction formats A. TTL
can use each address field to specify either a processor B. ECL
register of a memory operand. C. MOS
43. Which is not a typical program control D. CMOS
instruction? List–II
(a) BR (b) JMP 1. High component density
(c) SHL (d) TST 2. Low power consumption
Ans : (c) Typical program control instructions: 3. Evolution of ''diode-transistor-logic''
4. High speed digital circuit
Codes:
Name Mnemonic A B C D
Branch BR (a) 3 2 1 4
Jump JMP (b) 1 4 3 2
Skip SKP (c) 3 4 1 2
Call CALL (d) 1 2 3 4
Return RET Ans : (c) TTL: Evolution of diode-transistor-logic
Compare (by subtraction) CMP ECL: High speed digital circuits
Test (by ANDing) TST MOS: High component density
SHL (shift left) operation is not a typical program CMOS: Low power consumption
control instruction. 47. Match the following :
44. Interrupt which arises from illegal or List–I
erroneous use of an instruction or data is A. Foreign keys
(a) Software interrupt B. Private key
(b) Internal interrupt C. Event control action model
(c) External interrupt D. Data security
(d) All of the above List–II
Ans : (b) 1. Internal interrupts arise from illegal or 1. Domain constraint
erroneous use of an instruction or data. 2. Referential integrity
Example of conditions that raises internal interrupts are 3. Encryption
registers overflow, attempt to divide by zero, an invalid 4. Trigger
operation code, stack overflow and protection violation. Codes:
2. External interrupts generally occurs as a result of A B C D
outside interference. A software interrupt often used (a) 3 2 1 4
to implement system call. (b) 2 1 4 3
45. The simplified function in product of sums of (c) 3 4 1 2
Boolean function F (W, X, Y, Z) = Σ(0, 1, 2, 5, (d) 1 2 3 4
8, 9, 10) is Ans : (b) A foreign key is an attribute that references to
(a) (W'+X')(Y'+Z')(X'+Z) some attribute of another table. The purpose of the
(b) (W'+X')(Y'+Z')(X'+Z') foreign key is to ensure referential integrity of the data.
UGC NET JRF Computer Science June 2013 Paper-III 57 YCT
 Search on TG: @apna_pdf
A trigger is a special kind of stored procedure that List–II
automatically executes when an event occurs in the 1. Frees previously allocated space
database server. It's action control model. Domain 2. Modifies previously allocated space
constraints states that the value of every attribute must 3. Allocates space for array
only belong to the predefined domain. 4. Allocates requested size of space
Encryption is the most effective way to achieve data Codes:
security. A B C D
48. When an array is passed as a parameter to a (a) 3 1 4 2
function which of the following statements is (b) 3 2 1 4
correct? (c) 3 4 1 2
(a) The function can change values in the (d) 4 2 3 1
original array. Ans : (a) calloc ( ): allocates space for array.
(b) The function cannot change values in the free ( ): frees previously allocated space.
original array. malloc ( ): allocates requested size of space.
(c) Results in compilation error realloc ( ): modifies previously allocated space.
(d) Results in runtime error. 53. Binary symmetric channel uses
Ans : (a) Since we are passing array in C, we will pass (a) Half duplex protocol
it by reference. Hence whatever changes we made in (b) Full duplex protocol
called function, that will be reflected in calling function. (c) Bit oriented protocol
49. Suppose you want to delete the name that (d) None of the above
occurs before ''Vivek'' in an alphabetical Ans : (a) A binary symmetric channel is a common
listing. Which of the following data structures communication channel model used in coding theory
shall be most efficient for this operation? and information theory. In this model transmitter wishes
(a) Circular linked list (b) Double linked list to send a bit (0 or 1) and receiver receive a bit. At a
(c) Linked list (d) Dequeue time only one node can send and other will be in
Ans : (b) We have to search a key and delete the receiving mode. It used half-duplex protocol.
previous node of the node to which key belongs. 54. Hamming distance between 100101000110 and
In linked list and circular linked list we cannot go to
previous node directly. 110111101101 is
But in doubly linked list we can access previous node of (a) 3 (b) 4
a given node directly since there is a pointer to previous (c) 5 (d) 6
node in O(1) time. Ans : (d) The Hamming distance between two strings
50. What will be the output of the following of equal length is the number of positions at which the
corresponding symbols (bits) are different.
segment of the program?
main() Apply bit wise EXOR (⊕) operation:
{ 1001 0100 0110
char*s=''hello world''; ⊕ 1101 1110 1101
int I=7; 0100 1010 1011
printf(''%,*s'',i,s); So, hamming distance is 6 bits.
} 55. Given code word 1110001010 is to be
(a) Syntax error
(b) hello w transmitted with even parity check bit. The
(c) hellow encoded word to be transmitted for this code is
(d) o world (a) 11100010101 (b) 11100010100
Ans : (a) Syntax error. (c) 1110001010 (d) 111000101
51. Trace the error: Ans : (a) Even parity refers to a parity checking mode
void main ( ) in asynchronous communication systems in which an
{ extra bit, called a parity bit, is set to one if there is odd
int*b, & a; number of 1's else 0.
*b=20 Given code is 1110001010 has odd number of 1's. So,
Print(''%d, %d'', a, *b) we add 1 to LSB to make even number of 1's in total
} before send. Therefore, transmitted data would be:
(a) No error (b) Logical error 11100010101
(c) Syntax error (d) Semantic error 56. The number of distinct binary images which
Ans : (c) There is syntax error 'a' declared as reference can be generated from a given binary image of
but not initialized. right M×N are
52. Match the following : (a) M+N (b) M × Ν
List–I (c) 2M+N (d) 2MN
A. calloc Ans : (d) The number of distinct binary images which
B. free ( ) can be generate from a given binary image of right M ×
C. malloc ( ) N are 2 M × N .
D. realloc ( )
UGC NET JRF Computer Science June 2013 Paper-III 58 YCT
 Search on TG: @apna_pdf
57. If f(x, y) is a digital image, then x, y and (P1) (P2)
amplitude values of f are wait (S) wait (Q);
(a) Finite wait (Q) wait (S);
(b) Infinite critical section 1; critical section2:
(c) Neither finite nor infinite signal (S); signal (Q);
(d) None of the above signal (Q); signal (S);
Ans : (a) If 'x', 'y' and the amplitude values of 'f' are Their execution may sometimes lead to an
finite and discrete quantities, then this imaged is called undesirable situation called
a digital image. A digital image is composed of a finite (a) Starvation (b) Race condition
number of elements called pixel, each of which has a (c) Multithreading (d) Deadlock
particular location and value.
58. Consider the following processes with time slice Ans : (d) If the process P1 executes wait (S) and
of 4milliseconds (I/O requests are ignored): preempted then P2 executes wait (Q) then no further
execution of either of the processes is possible. This
Process A B C D situation is called deadlock.
Arrival time 0 1 2 3 61. An operating system using banker's algorithm
CPU cycle 8 4 9 5
The average turnaround time of these for deadlock avoidance has ten dedicated
processes will be devices (of same type) and has three processes
(a) 19.25 milliseconds P1, P2 and P3 with maximum resource
(b) 18.25 milliseconds requirements of 4, 5 and 8 respectively. There
(c) 19.5 milliseconds are two states of allocation of devices as
(d) 18.5 milliseconds follows:
Ans : (b) The system uses Round Robin algorithm with State 1
time quantum 4 ms.
Gantt chart is: Processes P1 P2 P3
A B C D A C D C Devices allocated 2 3 4
0 4 8 12 16 20 24 25 26 State2
Average TAT Processes P1 P2 P3
(20 − 0) + (8 −1) + (26 − 2) + (25 − 3) Devices allocated 0 2 4
= Which of the following is correct?
4 (a) State 1 is unsafe and state 2 is safe.
73 (b) State 1 is safe and state 2 is unsafe.
= =18.25 milliseconds
4 (c) Both, state 1 and state 2 are safe.
59. A job has four pages A, B, C, D and the main (d) Both, state 1 and state 2 are unsafe.
memory has two page frames only. The job Ans : (a) State 1:
needs to process its pages in following order: Total number of devices allocated
ABACABDBACD =2+4+3=9
Assuming that a page interrupt occurs when a Number of available
new page is brought in the main memory, = 10 - 9 = 1
irrespective of whether the page is swapped out Process Remaining need
or not. The number of page interrupts in FIFO P1 4-2=2
and LRU page replacement algorithms are 5-3=2
(a) 9 and 7 (b) 7 and 6 P2
8-4=4
(c) 9 and 8 (d) 8 and 6 P3
Ans : (c) Therefore, no process can be executed.
(i) FIFO algorithm:
Hence system is in unsafe state.
A B A C A B D B A C D
State 2:
A A hit C C B B hit A A D
Total number of device allocated
B hit B A A D hit D C C
=0+2+4=6
Total number of page faults = 9 Number of available
(ii) LRU algorithm:
= 10 - 6 = 4
A B A C A B D B A C D
A A hit A hit A D hit A A D Process Remaining need
B hit C hit B B hit B C C P 1
4-0=4
Total number of page faults = 8 P2 5-2=3
8-4=4
60. Suppose S and Q are two semaphores P3
initialized to 1. P1 and P2 are two processes
Therefore, any process can start execution. Hence,
which are sharing resources.
system is in safe stable.
UGC NET JRF Computer Science June 2013 Paper-III 59 YCT
 Search on TG: @apna_pdf
62. Let the time taken to switch between user mode (c) OS does not maintain a separate stack for
and kernel mode of execution be T1 while time each thread.
taken to switch between two user processes be (d) OS does not maintain virtual memory state
T2. Which of the following is correct? for each thread.
(a) T1 < T2 Ans : (d) OS on per thread basis, maintains only CPU
(b) T1 < T2 register state and stack. Threads share address space of
(c) T1 = T2 process. Virtually memory is concerned with processes
(d) Nothing can be said about the relation not with thread.
between T1 and T2. 66. The versions of windows operating system like
Ans : (a) Time taken to switch between two process is windows XP and window Vista uses following
large as compared to time taken to switch between file system :
Kernel and user mode of execution. When you switch (a) FAT–16
process, you have to do a context switch, save the PCB (b) FAT–32
of previous process, then save registers and then load (c) NTFS (NT File System)
the PCB of new process and load its registers etc. When (d) All of the above
you switch between Kernel and user mode of execution, Ans : (d) Windows XP professional supports the FAT-
OS has to just change a single bit at hardware level 16, FAT-32 and NTFS file systems. Because NTFS has
which is a fast operation. all the basic capabilities of FAT-16 and FAT-32, with
Therefore, T1 < T2 . the added advantage of advanced storage feature such
as compression, improved security and larger partitions
63. Working set model is used in memory
and file sizes. It is a recommended file system for
management to implement the concept of windows vista.
(a) Swapping 67. Which one of the following is a correct
(b) Principal of Locality
(c) Segmentation implementation of the meta-predicate ''not'' in
(d) Thrashing PROLOG (Here G represents a goal)?
(a) not (G): –1, call (G), fail, not(G)
Ans : (b) Working set is a concept which defines the (b) not (G):–call (G), !, fail. not(G)
amount of memory that a process requires in a given (c) not (G):–call (G), fail,!, not (G)
time interval. The concept is important for effective use (d) not (G):–call (G), fail, not (G):–!
of caches, which has principle of locality.
Ans : (b) By for the most common version of 'not'
64. A UNIX file system has 1 KB block size and 4– (or\+) available in PROLOG systems can be
byte disk addresses. What is the maximum file implemented as follows:
size if the inode contains ten direct block not (G): - call (G), ! fail
entries, one single indirect block entry, one not (G)
double indirect block entry and one triple Inequality can be implemented using 'not', but is
indirect block entry? normally implemented as a special case, as follows:
(a) 30 GB (b) 64 GB x\ = x: - !, fail
(c) 16 GB (d) 1 GB x\ = y
Ans : (c) Maximum file size If not (G) is called and the call to G fails, then not (G)
succeeds. This is correct by the NAF role. If the call to

3
 G succeed, cut and fail are called so not (G) fails. This
Disk block size
=  × Disk block size is not part of the NAF role and can cause incorrect
 Direct block address size  behaviour of G contains variables.
 1KB 
3 68. Which one of the following is not an informed
=  ×1K Bytes search technique?
 4B  (a) Hill climbing search
= (28 )3 ×1K Bytes (b) Best first search
(c) A* search
= 224 × 210 bytes (d) Depth first search
= 16 × 230 bytes Ans : (d) Hill climbing is a mathematical optimization
technique which belongs to the family of local search. It
= 16 G bytes
is an informed search
65. A thread is usually defined as a light weight A* search is an informed search algorithm used for
process because an Operating System (OS) path-finding and graph traversal.
maintains smaller data structure for a thread Informed methods add domain - specific information to
than for a process. In relation to this, which of select the best path to continue searching along.
Depth first search is not informed search algorithm.
the following statement is correct?
(a) OS maintains only scheduling and accounting 69. If we convert
information for each thread. ∃u∀v∀x∃y(P(f(u),v,x,y)→Q(u,v,y)) to
(b) OS maintains only CPU registers for each ∀v∀x(P(f(a), v,x,g(v,x)→Q(a,v,g(v,x)))
thread. This process is known as
UGC NET JRF Computer Science June 2013 Paper-III 60 YCT
 Search on TG: @apna_pdf
(a) Simplification (b) Unification 73. A fuzzy set A on R is ______ iff
(c) Skolemization (d) Resolution A(λx1+(1–λ)x2) ≥ min [A(x1), A(x2)]
Ans : (c) The process of removing all the existential for all x1, x2∈ R and all λ∈[0, 1], where min
quantifiers from a formula is known as skolemization. denotes the minimum operator.
The resultant formula is skolem normal from that is (a) Support (b) α-cut
equivalent to computational complexity of the original. (c) Convex (d) Concave
70. Given two jugs of capacities 5 litres and 3 litres
Ans : (c) A fuzzy set A defined on R n is convex iff
with no measuring markers on them. Assume A(λx1 + (1 − λ) x2 ) ≥ min ( A( x1 ), A( x2 )),
that there is endless supply of water. Then the
minimum number of states to measure 4 litres for all λ∈[0,1], x1 , x2 ∈ R n and all α∈[0,1], or,
water will be equivalently, A is convex if and only if all its α − cuts
(a) 3 (b) 4 (c) 4 (d) 7 are convex sets, for any α in the interval α∈(0,1].
Ans : (d)
74. If A and B are two fuzzy sets with membership
functions
µA(x)= {0. 6, 0.5, 0.1, 0.7, 0.8}
µB(x)= {0. 9, 0.2, 0.6, 0.8, 0.5}
Then the value of µA∪ ∪B(x) will be
(a) {0.9, 0.5, 0.6, 0.8, 0.8}
(b) {0.6, 0.2, 0.1, 0.7, 0.5}
(c) {0.1, 0.5, 0.4, 0.2, 0.2}
(d) {0.1, 0.5, 0.4, 0.2, 0.3}
Ans : (c) Union operation is fuzzy set takes maximum
value between two and its complement will be
calculated by subtracting each number from '1'.
Therefore, minimum number of 7 states are required. Therefore,
71. The map colouring problem can be solved µ
( A ∪ B ) ( x ) = {0.9, 0.5, 0.6, 0.8, 0.8}and
using which of the following technique?
(a) Means–end analysis µ ( A∪ B ) ( x) = {0.1, 0.5, 0.4, 0.2, 0.2}
(b) Constraint satisfaction 75. Consider a single perception with weights as
(c) AO* search given in the following figure :
(d) Breadth first search
Ans : (b) Constraint satisfaction problems are
mathematical problems defined as a set of objects
whose state must satisfy a number of constraints or
limitations. Examples of simple problems that can be
modeled as a constant satisfaction - problem include:
1. Eight queens puzzle
2. Map coloring problem  1, t > 0
3. Crosswords, Sudoku, other logic puzzles. and f(t) defined as f (t) = 
72. Which of the following is a knowledge  0, t ≤ 0
The above perception can solve
representation technique used to represent
knowledge about stereotype situation? (a) OR problem (b) And problem
(a) Semantic network (c) XOR problem (d) All of these
(b) Frames Ans : (b) Perception after multiplying weights with
(c) Scripts input will give:
(d) Conceptual Dependency ⇒ 1(−1.5) + x .1 + y .1 = f (t )
Ans : (c) Knowledge representation and reasoning ⇒ f (t ) = x + y −1.5
(KR) is the field of artificial intelligence (AI) dedicated
According to given definition of f(t).
to representing information about the world in a form
that a computer system can utilize to solve complex if f (t ) =1, if t > 0 else f(t) = 0.
tasks such as diagnosing a medical condition or having So, truth table is:
a dialog in a natural language. All of these, in different x y f(t)
ways, involve hierarchical representation of data:
0 0 0
1. Lists
0 1 0
2. Trees
3. Semantic networks - nodes and links 1 0 0
1 1 1
4. Schemes - used to represent common sense or
stereotyped knowledge. e.g. if x = 0, y = 0
(i) Frames - Describes objects ⇒ f (t ) = −1.5 < 0,
(ii) Scripts - Describes event rather than object. Consist of So, f(t) = 0
stereotypically ordered - causal or temporal chain of events. So, table is truth table of AND.
UGC NET JRF Computer Science June 2013 Paper-III 61 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. September, 2013

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. A file is downloaded in a home computer using 5. The _______ is a set of standards that defines
a 56 kbps MODEM connected to an Internet how a dynamic web document should be
Service Provider. If the download of file written, how input data should be supplied to
completes in 2 minutes, what is the maximum the program, and how the output result should
size of data downloaded? be used.
(a) 112 Mbits (b) 6.72 Mbits (a) Hyper Text Markup Language
(c) 67.20 Mbits (d) 672 Mbits
(b) File Transfer Protocol
Ans : (b) We can download 56 kbits in one second. (c) Hyper Text Transfer Protocol
Then data download in 2 minutes.
(d) Common Gateway Interface
= 56 K × 2 × 60
= 56 × 120 = 6720 K bits Ans : (d) 1. Common Gateway Interface (CGI) is a
= 6.72 M bits technology that creates and handles dynamic
documents. CGI is a set of standards that defines how a
2. In ______ CSMA protocol, after the station dynamic document should be written, what input data
finds the line idle, it sends or refrains from should be supplied to the program, and how the output
sending based on the outcome of a random result should be used.
number generator.
2. HTML (Hypertext markup Lan
(a) Non-persistent (b) 0–persistent 0000000000000000000000guage) is a markup language.
(c) 1-persistent (d) p-persistent 3. FTP (file transfer protocol) is a standard application
Ans : (d) In P-persistent CSMA protocol, when station layer protocol used to transfer computer files between a
found channel idel, then it send or refrain from sending client and server on a computer network.
based on probability P. 4. The HTTP (hypertext transfer protocol) is an
3. Which of the following substitution technique application layer protocol for distributed, collaborative,
have the relationship between a character in hypermedia information systems.
the plaintext and a character in the ciphertext 6. The count-to-infinity problem is associated
as one-to -many?
(a) Monoalphabetic (b) Polyalphabetic with
(c) Transpositional (d) None of these (a) Flooding algorithm
Ans : (b) Substitution ciphers encrypt plaintext by (b) Hierachical routing algorithm
replacing one symbol with another. In polyalphabetic (c) Distance vector routing algorithm
substitution, each occurance of a character may have a (d) Link state routing algorithm
different substitute. Thus, the relationship between a Ans : (c) The Bellman-Ford algorithm does not prevent
character in the plaintext to a character in the ciphertext routing loops from happening and suffers from the
is one too many. While, in monoalphabetic, count-to-infinity problem.
substitution, the relationship between a symbol in the Distance-vector routing protocols use the Bellman-ford
plaintext to a symbol in the ciphertext is always one-to-
algorithm and link-state routing protocols uses the
one.
dijkstra's algorithm.
4. What is the maximum length of CAT–5 UTP
7. The IEEE single-precision and double-
cable in Fast Ethernet network?
(a) 100 meters (b) 200 meters precision format to represent floating-point
numbers, has a length of ______ and _______
(c) 1000 meters (d) 2000 meters
respectively.
Ans : (a) Category 5 cable, commonly referred to as cat (a) 8 bits and 16 bits
5, is a twisted pair cable for carrying signals. This type
(b) 16 bits and 32 bits
of cable is used in structured cabling for computer
network such as ethernet. The cable standard provides (c) 32 bits and 64 bits
performance of up to 100 MHz and is suitable for (d) 64 bits and 128 bits
10Base-T, 100Base-TX (fast ethernet), 1000Base-T Ans : (c) 1. Single precision floating point format is a
(Gigabit ethernet) and 2.5GBase-T. cat 5 is also used computer format that occupies 4 bytes (32 bits) in
telephony and video. The maximum length for a cable computer memory and represents a wide, dynamic
segment is 100 m per TIA/EIA 568-5-A. range of values by using a floating point.
UGC NET JRF Computer Science Sept. 2013 Paper-II 62 YCT
 Search on TG: @apna_pdf
2. Double precision floating point format is a 11. The minimum number of nodes in a binary
computer number format that occupies 8 bytes (64 bits) tree of depth d (root is at level 0) is
in computer memory and represents a wide, dynamic (a) 2d - 1 (b) 2d+1 - 1
range of values by using a floating point. (c) d + 1 (d) d
8. Consider an undirected graph G with 100 Ans : (b) In a binary tree, you have 1 root, 2 sons of
nodes. The maximum number of edges to be that root, 4 grandsons, 8 grand-grandsons, and so on.
included in G so that the graph is not So, the total number of nodes is the sum of the
geometric series.
connected is
(a) 2451 (b) 4950 2 d +1 − 1 d + 1
1 + 2 + 4 + 8 + .... + 2d = = 2 −1
(c) 4851 (d) 9900 2 −1
Ans : (c) Maximum number of edges in a simple graph where, d is the depth (i.e., for d = 0, we have 1 node).
(n − k )(n − k + 1) 12. The efficient data structure to insert/delete a
e=
2 number is a stored set of numbers is
where, k is the number of connected component (i.e., if (a) Queue (b) Linked list
graph is connected graph then k =1). (c) Doubly linked list (d) Binary tree
Since, given graph is disconnected, so, we take k =2 for Ans : (c) Among given data structure double linked list
maximum number of edges. is best data structure since we can traverse in any
direction. Searching take O(n) and insertion and
(n −1)(n − 2)
e= deletion take O(1) time.
2
13. The number of states in a minimal
we assume k( n − 1) complete graph and other one vertex.
deterministic finite automaton corresponding
Therefore, to the language
(n − 1)(n − 2) 99 × 98 L = {an|n ≥ 4} is
e= = = 4851 (a) 3 (b) 4
2 2
(c) 5 (d) 6
9. The amortized time complexity to perform
______ operation (s) in Splay trees is O(lg n). Ans : (c) Given, language is L = {a n " | n ≥ 4} minimal
(a) Search deterministic finite automation is
(b) Search and Insert
(c) Search and Delete
(d) Search, Insert and Delete
Ans : (d) A splay tree is a self-adjusting binary search Total number of states is 5.
tree with the additional property that recently accessed
14. Regular expression for the language L = {W ∈
elements are quick to access again. It performs basic
operations such as insertion, look-up and removal in {0, 1}*| W has no pair of consecutive zeros} is
O(log n) amortized time. (a) (1 + 010)* (b) (01 + 10)*
(c) (1 + 010) (0 + λ ) (d) (1 + 01)* (0 + λ )
*
10. Suppose that the splits at every level of
Ans : (d)
Quicksort are in proportion 1–β β to β , where 0 <
(a) (1 + 010) * = {∈,1, 010,1010, 0101, 010010,11,....}
<ββ <0.5 is a constant. The number of elements
in an array is n. The maximum depth is string 010010 contains pair of consecutive
approximately zeros.
(a) 0.5 β lg n (b) 0.5 (1–β) lg n (b) (01 + 10) * = {∈, 01,10, 0110,1001,....}
(c) –(lg n)/(lgβ) (d) –(lg n)/lg(1–β) string 1001 contains pair of consecutive zeros.
Ans : (d) First calculated in the maximum height. (c) (1 + 010) * (0 +∈) = {∈,1, 010, 010010,....}
⇒ n(1 −β) x ≤ 1 string 010010 contains pair of consecutive
zeros.
1 (d) (1 + 01) * (0 +∈) = {∈,1, 0, 01,10,11,....}
⇒ x ≥ log (1 −β )  
n it can not have any string with pair of
log(n) consecutive zeros.
⇒ x≥−
log(1 − β) 15. Consider the following two languages:
Note that we can also find minimum height L1 = {an bl ak| n + l + k > 5}
replace (1 − β) to β . L2 = {an bl ak| n> 5, l > 3, k ≥ l}
UGC NET JRF Computer Science Sept. 2013 Paper-II 63 YCT
 Search on TG: @apna_pdf
Which of the following is true? 18. The number of eight-bit strings beginning with
(a) L1 is regular language and L2 is not regular either 111 or 10 is___.
language. (a) 64 (b) 128
(b) Both L1 and L2 are regular languages. (c) 265 (d) None of these
(c) Both L1 and L2 are not regular languages.
Ans : (a) Total number of 8 bit string starting with 111.
(d) L1 is not regular language and L2 is not
regular language.
1 1 1
Ans : (a) Given, L1 = {a n bl a k | n + l + k > 5} we can write
Remaining five places we can fill either 0 or 1, (i.e., 2
L1 as given below
choices are available). Then number of strings =
L1 = {a * b * c*} ∩{| w | > 5| w∈{a, b}*} we can draw 25 = 32.
DFA for L1 , so it is regular. Similarly, total number of 8 bit strings starting with 101
Given L2 = {a n bl c k | n > 5, l > 3, k ≤ l} language L2 can = 25 = 32.
not be regular since it has infinite comparison (i.e., So, total number of strings = 32 + 32 = 64.
k ≤ l ) but, L2 is context free language, since, we can 19. Find the number of ways to paint 12 office so
identify any string of L2 using only one stack. that 3 of them will be green, 2 of them pink, 2
16. LL grammar for the language L = {an bm cn+m|m of them yellow and the rest ones white.
≥ 0, n ≥ 0} is (a) 55,440 (b) 1,66,320
(a) S → aSc|S1; S1 → bS1c| ∈ (c) 4790E+08 (d) 39,91,680
(b) S → aSc|S1| ∈ ; S1 → bS1c Ans : (b) Total number of ways 12 offices can be
painted = 12!. But 3 of them will be green 2 of them
(c) S → aSc|S1| ∈ ; S1 → bS1c| ∈ pink, 2 of them yellow and remaining 5 to them will be
(d) S → aSc| λ ; S1 → bS1c| ∈ white.
Ans : (c) Given language is: Therefore, using permutations of multi-sets
L = {a n b m c n + m | m, n ≥ 0} 12!
= =166320
L = {a n b m c m c n | m, n ≥ 0} 3!× 2!× 2!× 5!
Context free grammar for L is 20. Consider the following statements:
S → aSc |∈| S1 (i) A graph in which there is a unique path
between every pair of vertices is a tree.
S1 → bS1c |∈ (ii) A connected graph with e = v -1 is a tree.
17. Assume the statements S1 and S2 given as: (iii) A graph with e = v -1 has no circuit is a tree.
S1: Given a context free grammar G, there Which of the above statement is/are true?
exists an algorithm for determining whether (a) (i) and (iii) (b) (ii) and (iii)
L(G) is infinite. (c) (i) and (ii) (d) All of these
S2: There exits an algorithm to determine Ans : (d) A tree is an undirected graph in which any
whether two context free grammars generate two vertices are connected by exactly one path (i.e.,
the same language. minimally connected graph) with e = (n - 1) edges.
Which of the following is true? Therefore, all statements are true.
(a) S1 is correct and S2 is not correct. 21. Consider the in-order and Post-order
(b) Both S1 and S2 are correct. traversals of a tree a given below:
(c) Both S1 and S2 are not correct. In-order: J e n k o p b f a c l g m d h i
(d) S1 is not correct and S2 is correct. Post-order: j n o p k e f b c l m g h i d a
Ans : (a) S1 : Given a context-free grammar G = (V, T, The pre-order traversal of the tree shall be
S, P) there exists an algorithm for determining whether (a) a b f e j k n o p c d g l m h i
or not L(G) is infinite. (b) a b c d e f j k n o p g l m h i
Since, we have an algorithm for deciding whether a (c) a b e j k n o p f c d g l m h i
grammar has a repeating variable, we have an algorithm (d) j e n o p k f b c l m g h i d a
for determining whether or not L(G) is infinite. Ans : (*) We assume that given in order and postorder
S 2 : There does not exist any algorithm to determine traversal of a binary tree.
whether two context free grammars generate the same Inorder: j e n k o p b f a c l g m d h i
language since, it is impossible to even decide whether Postorder: j n o p k e f b c l m g h i d a
a CFG is equivalent to the trivial CFG defining the Construction of binary tree using in order and
language of all strings. postorder:
UGC NET JRF Computer Science Sept. 2013 Paper-II 64 YCT
 Search on TG: @apna_pdf
both be built using XOR gates. To generate odd parity,
simply invert the even parity. The Ex-OR (XOR) gate
can be EXNOR gate.
24. The quantification ∃ !xP(x) denotes the
proposition "There exists a unique x such the
P(x) is true". express the quantification using
universal and existential quantification and
logical operations:
(a) ∃xP ( x) ∨ ∀x∀y (( P ( x) ∨ P( y ) → x = y )
(b) ∀xP ( x ) ∧ ∀x∀y (( P ( x) ∨ P( y ) → x = y )
(c) ∃xP ( x) ∧ ∀x∀y (( P ( x) ∧ P( y ) → x = y )
Therefore, preorder is:
abejknpofdglcmih (d) ∃xP ( x) ∧ ∃x∃y (( P( x) ∨ P ( y ) → x = y )
But none option is matched. Ans:(c)
22. A simple graph G with n-vertices is connected ∃! x( P( x)) = [∃x P ( x)] ∧ ∀x ∀y[ P( x) ∧ P ( y ) → x = y ]
if the graph has On LHS, hence the ∃! x P ( x) first clauses says there is
(a) (n-1) (n - 2)/2 edges
at least one, ∀x ∀y[ P ( x) ∧ P( y ) → x = y ] second says
(b) more than (n - 1) (n -2)/2 edges
(c) less than (n - 1) (n -2)/2 edges there is at most one x, x for which P(x) is true.
k 25. If F and G are Boolean functions of degree n.
(d) ∑ C (n , 2) edges
i =1
i
Then, which of the following is true?
(a) F ≤ F + G and FG ≤ F
Ans : (b) Let e be the number of edges n the number of
vertices and k the number of connected component of a (b) G ≤ F + G and FG ≥ G
graph G. Then maximum number of edges are (c) F ≥ F + G and FG ≤ F
(n − k )(n − k + 1) (d) G ≥ F + G and FG ≤ F
e≤
2 Ans : (b) Given F and G are boolean functions of
For connected graph maximum number of edges will be degree n, i.e., number of boolean functions.
n
as edges of complete graph kn (when connected F = 22 = G
component k = 1), then Therefore,
n(n −1) ⇒G ≤ F +G
e≤
2 n n
⇒ 22 ≤ 2 2 + 2 2
n

For disconnected graph maximum number of edges will n n

be as edges of complete graph k( n −1) and single vertex ⇒ 22 ≤ 2(22 )is true.
and also.
(when connected component k = 2).
⇒ G ≤ FG
(n −1) * (n − 2)
e≤ n n n
⇒ 22 ≤ (22 ).(22 )
2
Therefore, graph to be connected graph has more than ⇒ 22n ≤ 2(2n + 2n ) is also true.
(n - 1)*(n - 2)/2 edges.
26. Match the following identities/laws to their
23. Which one of the following set of gates is best
corresponding name:
suited for 'parity' checking and 'parity'
List-1 List-II
generation?
A. x + x = x 1. Dominance
(a) AND, OR, NOT (b) NAND, NOR
x x=x
(c) EX-OR, EX-NOR (d) None of these
B. x + 0 = x 2. Absorption
Ans : (c) A parity bit or check bit is a bit added to a x 1=x
string of binary code that indicates whether the number C. x + 1 = 1 3. Idempotent
of 1 bits in the string is even or odd. Parity bits are used
x 0=0
as the simplest from of error detecting code. There are
two variants of parity bits: even parity bit and odd D. x (x + y) 4. Identity
parity bit. Parity has the advantage that it uses only a Codes:
single bit and requires only a number of XOR gates to A B C D
generate. The parity generate and parity checker can (a) 3 4 1 2
UGC NET JRF Computer Science Sept. 2013 Paper-II 65 YCT
 Search on TG: @apna_pdf
(b) 4 3 1 2 Ans : (a) 1. The waterfall model is a sequential (non-
(c) 4 3 2 1 iterative) design process. In this model, no working
(d) 3 4 2 1 software is produced until late during the life cycle.
Ans : (a) Identity law: x + 0 = x and x; 1 = x 2. The prototyping model is systems development
Dominance law: x + 1 = 1 and x.0 = 0 method (SDM) in which a prototype (an early
Absorption law: x(x + y) = x approximation of a final system or product) is built,
Idempotent law: x + x = x and x.x = x tested, and then reworked as necessary until an
acceptable prototype is finally achieved from which the
27. In which one of the following, continuous
complete system or product can now be developed.
process improvement is done?
3. The incremental build model is a method of
(a) ISO9001 (b) RMMM software development where the product is designed,
(c) CMM (d) None of these implemented and tested incrementally (a little more is
Ans : (c) 1. The CMM (capability maturity model) is added each time) until the product is finished. It
a methodology used to develop and refine an involves both development and maintenance.
organization is software development process. The
30. Equivalence partitioning is a _____ testing
model describes a five level evolutionary path of
increasingly organized and systematically more mature method that divides the input domain of a
processes. The CMM model continues to be a general program into classes of data from which test
theoretical process capability model used in the public cases can be derived.
domain. (a) White box (b) Black box
2. ISO 9001 certified means an organization has met (c) Regression (d) Smoke
the requirements in ISO 9001. Ans : (b) The tendency is to relate equivalence
3. The risk mitigation, monitoring and management partitioning to so called black box testing which is
(RMMM) plan documents all works performed as part strictly checking a software component at its interface,
of risk analysis and is used by the project manager as without consideration of internal structure of the
part of overall project plan. software.
28. The ______ of a program or computing system 31. Consider the following characteristics:
is the structure of structure of the system, (i) Correct and unambiguous
which comprise software components, the (ii) Complete and consistent
externally visible properties of these (iii) Ranked for importance and/or stability
components, and the relationship among them. and verifiable
(a) E-R diagram (iv) Modifiable and Traceable
(b) Data flow diagram Which of the following is true for a good SRS?
(c) Software architecture (a) (i), (ii) and (iii)
(d) Software design (b) (i), (iii), and (iv)
Ans : (c) 1. The software architecture of a program (c) (ii), (iii) and (iv)
or computing system is the structure or structures of (d) (i), (ii), (iii) and (iv)
the system, which comprise software elements, the
Ans : (d) To property satisfy the basic goals, an SRS
externally visible properties of those elements, and
should have certain properties and should contain
relationships among them.
different types of requirements. Given, some of the
2. A data flow diagram (DFD) is a graphical desirable characteristics of on SRS (software
representation of the flow data through an information requirement specification) and components of an SRS.
system, modeling its process aspects. A DFD is often A good SRS is:
used as preliminary step to create an overview of the
1. Correct 2. Complete
system, which can later be elaborated.
3. Unambiguous 4. Verifiable
3. An entity relationship diagram (ERD) shows the
relationships of entity sets stored in a database. An 5. Consistent 6. Modifiable
entity in this content is a component of data. In other 7. Traceable 8. Ranked for importance and
words, ER diagrams illustrate the logical structure of and / or stability
database. 32. Linked Lists are not suitable for _____
29. Working software is not available until late in (a) Binary Search
the process in (b) Polynomial Manipulation
(a) Waterfall model (c) Insertion
(b) Prototyping model (d) Radix Sort
(c) Incremental model Ans : (a) Finding middle element on array O(1).
(d) Evolutionary Development model Finding mid element on linked list O(n).
UGC NET JRF Computer Science Sept. 2013 Paper-II 66 YCT
 Search on TG: @apna_pdf
Therefore, recurrence relation of binary search on else
sorted array: y = y - x;
T (n) = T (n / 2) + O (1) = θ(log n) print ("%d, x);
Recurrence relation of binary search on sorted linked }
list: (a) Computes LCM two numbers
T (n) = T (n / 2) + O (n) = θ(n) (b) Computes GCD of two numbers
(c) Divides large number with small number
Since, binary search on linked taking time θ(n), so, it
(d) Subtracts smaller number form large number
is inefficient on linked list. Ans : (b) Given algorithm is Euclidean algorithm to
33. What is the size of the following Union? computes greatest common divisor (GCD) of two
Assume that the size of int = 2, size of float = 4, numbers. Function gcd (a, b)
size of char =1 While (a ≠ b)
union =1 if a > b
{ int a ; a: = a - b;
float b ; else
char c ; b: = b - a;
};
36. Consider the following program segment:
(a) 2 (b) 4
(c) 1 (d) 7 d = 0;
for (i = 1; / < 31, ++i)
Ans : (b) The amount of memory required to store a
structure variable is the sum of the size of all the for (j = 1; / < 31, ++ j)
members. On the other hand, in case of unions, the for (k = 1; k < 31, ++ k)
amount of memory required is always equal to that if ((i + j + k) % 3 ==0);
required by its largest member. d = d + 1;
Therefore, size of union = max {2, 4, 1} = 4 print ("%d", d);
34. What is the output of the following program The output will be
segment? (a) 9000 (b) 3000
sum (n) (c) 90 (d) 2700
{ if (n < 1) return n; Ans : (a) (a + b + c) % 3 will be 0 if (a + b + c) is a
else return (n + sum (n-1)); multiple of 3. This will happen in one of the following
ways. All is can only c are multiples of 3. This can only
}
happen if a, b and c take of the 10 values, 3, 6, 9, .... 27,
main ( )
30 independent of one another.
{ print ("%d", sum (5));
So, there are 10 × 10 × 10 = 1000 ways this can
} happen. Another possibility is that a, b and c all leave a
(a) 10 (b) 16 remainder 1 so that (a + b + c) is evenly divisible by 3.
(c) 15 (d) 14 Considering all the different possibilities and adding.
Ans : (c) we get 9000. That will be integer that get printed.
37. Usage of preemption and Transaction Rollback
prevents______.
(a) Unauthorized usage of data file
(b) Deadlock situation
(c) Data manipulation
(d) File preemption
Ans : (b) If there is no rule to use the system resources.
Means if all the system resources are not allocated in
the manner of scheduling. Then this will also create a
problem for a deadlock because there is no surety that a
35. Assume that x and y are non-zero positive process will release the system resources after
integers. What does the following program completion, so, preemption and transaction rollback
while (x! = 0) prevents deadlock situation.
{ 38. The ______ language was originally designed
if (x > y) as the Transformation Language for style
x=x-y Sheet facility.
UGC NET JRF Computer Science Sept. 2013 Paper-II 67 YCT
 Search on TG: @apna_pdf
(a) XSTL (b) XML (c) One phase locking protocol
(c) XQuery (d) XPath (d) Sliding window protocol
Ans : (a) XSTL (Extensible Style sheet Language Ans : (b) The Thomas write rule is a rule in timestamp
Transformations) is a language for transforming XML ordering protocol in which write to write conflict are
documents into other XML documents, or other formats ignored.
such as HTML for web pages, plain text or XSL,
formatting objects, which may subsequently be 44. Match the following
converted to other formats, such as PDF, Postscript and List-I (Process state transition)
PNG. While XML (Extensible Markup Language) is a A. Ready → Running
markup language that defines a set of rules for encoding B. Blocked → Ready
documents in a format that is both human-readable and
C. Running → Blocked
machine readable.
D. Running → Ready
39. Views are useful for _____ unwanted
1. Request made by the process is satisfied or
information, and for collecting together
and event for which it was waiting occurs.
information from more than one relation into a
single view. 2. Process wishes to wait for some action by
(a) Hiding (b) Deleting another process.
(c) Highlighting (d) All of these 3. The process is dispatched.
Ans : (a) A view is a virtual table based on the result set 4. The process is preempted.
of an SQL statement. A view contains rows and Code:
columns, just like a real table. The field in a view are A B C D
fields from one or more real tables in the database. (a) 3 1 2 4
Views can hide the complexity of data. (b) 4 1 3 2
40. The decision tree classifier is a widely used (c) 4 3 1 2
technique for____. (d) 3 3 2 1
(a) Classification (b) Association Ans : (a) The state diagram for a process captures its
(c) Partition (d) Clustering life-cycles. The states represent the execution status of
Ans : (a) Decision tree classifier is a simple and the process; the transactions represent changes of
widely used classification technique. It applies a execution state.
straightforward idea to solve the classification problem.
Decision tree classifier poses a series of carefully
crafted questions about the attributes of the test record.
Each time it receive an answer a follow-up question is
asked until a conclusion about the class label of the
record is reached. 45. The hit ratio of a Translation Look Aside
41. Cross_tab displays permits users to view____ Bullet (TLAB) is 80%. It takes 20 nanoseconds
(ns) to search TLAB and 100 ns to access main
of multidimensional data at a time.
memory.
(a) One dimension (b) Two dimensions
(c) Three dimensions (d) Multidimensions The effective memory access time is______
(a) 36 ns (b) 140 ns
Ans : (b) A crosstab query is a type of select query
which allows data to view as both horizontally and (c) 122 ns (d) 40 ns
vertically so that the data can be more compact and Ans : (b) Given, hit ratio (x) = 0, 8
easier to read. TLB access time (c) = 20 nsec
42. A method to provide secure transmission of Main memory access time (m) = 100 nsec
email is called_____. Then, effective memory access time is:
(a) TLS (b) SA EMAT = x(c + m) + (1 - x)(c + 2m)
(c) IPSec (d) PGP = 0.8 × (20 + 100) + 0.2 × (20 + 2 × 100)
Ans : (d) Pretty good privacy (PGP) is an encryption = 0.8 × 120 + 0.2 × 220
program that provides cryptographic privacy and = 140 nsec.
authentication for data communication. PGP is often 46. Consider the input/output (I/O) requests made
used for singing, encryption, and decryption, e-mails, at different instants of time directed at a
files, directories, and whole disk partitions and to hypothetical disk having 200 tracks as given in
increase the security of e-mail communication. the following table:
43. Thomas-write rule is_____. Serial No. 1 2 3 4 5
(a) Two phase locking protocol
Track No. 12 85 40 100 75
(b) Timestamp ordering protocol
UGC NET JRF Computer Science Sept. 2013 Paper-II 68 YCT
 Search on TG: @apna_pdf
Time of 65 80 110 100 175 (c) title = WELCOME; export title ; sh -c 'echo
arrival $title"
Current head position is at track number 65. (d) title = WELCOME; echo $title
Direction of last movement is towards higher Ans : (c) title = WELCOME; export title ; sh -c 'echo
numbered tracks Current clock time is numbered $title" will always display "WELCOME".
tracks Current clock time is 160 milliseconds. 49. What type of logic circuit is represented y the
Head movement time per track is 1 millisecond figure show below?
"look" is a variant of "SCAN" disk-arm
scheduling algorithm. In this algorithm, if no more
I/O requests are left in current direction, the disk
head reverses its direction. The seek times in
Shortest Seek First (SSF) and "Look" disk-arm
scheduling algorithms respectively are:
(a) 144 and 123 milliseconds (a) XOR (b) XNOR
(b) 143 and 123 milliseconds (c) XAND (d) XNAND
(c) 149 and 124 milliseconds Ans : (b) Given diagram is
(d) 256 and 186 milliseconds
Ans : (b) At clock time 160 millisecond only request
number 1 2 3 4 are there to be serviced request number
5(with track no 75) will be ready after 15 millisecond
starting head position 65.
Now for SSTF 12 40 75 85 100
It will serve 85(since 75 is not come yet) first then 75 Function f is:
then 100 then 40 and finally12. f = A ' B ' + AB = A B = A ( XNOR ) B
So, total movements = 20 + 10 + 25 + 60 + 28 = 143 50. The speed up of a pipeline processing over an
Total time = 143 × 1 ms = 143 ms equivalent non-pipeline processing is defined
Now for look 12 40 75 85 100 direction towards highest by the ratio:
no. of tracks. ntn ntn
(a) S = (b) S =
It will serve 85(since 75 is not come yet) first then 100 (k + n − 1)t p (k + n + 1)t p
then 75 then 40 and finally 12.
ntn (k + n − 1)t p
So, total movement = 20 + 15 + 25 + 35 + 28 (c) S= (d) S=
= 123 total time 123 × 1 ms (k − n + 1)t p ntn
= 123 ms Where,
47. Assume that an implementation of Unix n → Number of tasks
tn → Time of completion of each task
operating system uses-i-nodes to keep track of
k → Number of segments of pipeline
data blocks allocated to a file. It supports 12
tp → Clock cycle time
direct block addresses, one indirect block
S → speed up ratio
address and one double indirect block address.
The file system has 256 bytes block size and 2 Ans : (a) A non-pipeline unit that performs the same
bytes for disk block address. The maximum operation and take a time equal to tn to complete each
possible size of a file this system is task. The total time required for n tasks is n.tn .
(a) 16 MB (b) 16 KB The case where a k-segment pipeline with a clock cycle
(c) 70 KB (d) 71 KB time is t p is used to execute n tasks. The first task T1
Ans : (*) Given, 12 direct, one indirect and one double
requires a time equal to kt p to complete its operation
indirect block addresses. The file system size has 256
since there are k segments in the pipe the remaining (n -
bytes and 2 bytes for disk block addresses. Then, 1) task emerge from the pipe at the rate of one task per
maximum possible size of file in system is clock cycle and they will be completed after a time
= [12 + (27 ) + (27 )2 ] × 256 Byte
equal to (n −1).t p .
= 4131 KB Therefore, to complete n tasks using k-segment pipeline
So, none option is true. requires k + (n - 1) clock cycles.
The speed-up of a pipeline processing over an
48. Which of the following set o Unix commands
equivalent non-pipeline processing is defined by the
will always display "WELCOME"? ratio.
(a) export title = Welcome; Echo $title n.tn
(b) title = WELCOME; export $ title ; sh - c S=
(k + n −1).t p
"echo $title"
UGC NET JRF Computer Science Sept. 2013 Paper-II 69 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. September, 2013

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
Note: This paper contains seventy five (75) objective 62513
type questions of two (2) marks each. The candidates are 158746
required to select the most appropriate answer for each There are two fairly obvious (but worth starting)
question. All questions are compulsory. rates which every alphabetic obeys:
1. Which of the following is a correct predicate (i) The mapping of letters to numbers is one-to-one.
logic statement for "Every Natural number has (ii) the digit zero is not allowed to appear as the left
one successor"? most digit in any of the addends or the sum.
(a) ∀x∃y (succ( x, y ) ∧ (∃z succ( x, z ) ⇒ Note that you can find other possible solutions too.
equal (y, z))) 4. Which of the following is not a part of an
(b) ∀x∃y (succ( x, y ) ∨ (∃z succ( x, z ) ⇒ expert system shell?
equal (y, z))) (a) Knowledge Base (b) Inference Engine
(c) Explanation Facility (d) None of the above
(c) ∃x∀y (succ( x, y ) ∧ (∃z succ( x, z ) ⇒
Ans : (a) SHEELS - A shell is nothing but on expert
equal (y, z)))
system without knowledge base. A shell provides the
(d) ∃x∀y (succ( x, y ) developers with knowledge acquisition, inference
Ans : (a) Statement says: For all element x their is engine, user interface, and explanation facility.
element y which is successor of x, and if another E.G. Java Expert system shell (JESS) that provides fully
element z is successor of x then y and z are equal. Every developed Java API for creating an expert system.
natural number has one successor. 5. The Blocks World Problem in Artificial
∀x∃y (succ( x, y ) ∧ (∃z succ( x, z ) ⇒ equal (y,z))) Intelligence is normally discussed to explain a
-

2. cutoff are applied to _____. ____.

(a) Search technique
(a) Depth first search
(b) Planning System
(b) Best first search
(c) Constraint satisfaction system
(c) Minimax search
(d) Knowledge base system
(d) Breadth first search
Ans : (b) The blocks word is one of the most famous
Ans : (c) Alpha-beta pruning is a search algorithm that
planning domains in artificial intelligence. Imagine a set
seeks to decrease the number of nodes that are
of wooden blocks of various shape and colors sitting on
evaluated by the min-max algorithm in its search tree.
a table.
3. Assume that each alphabet can have a value The goal is to build one or more vertical stacks of
between 0 to 9 in a cryptoarithmetic problem blocks.
CROSS 6. Means-Ends Analysis process canters around
+ROADS
the detection of difference between the current
DANGER state and the goal state. Once such a difference
Which of the following statement is true? is found, then to reduce the difference one
(i) No two alphabets can have the same applies ______.
numeric value. (a) a forward search that can reduce the
(ii) Any two alphabets may have the same difference.
numeric value. (b) a backward search that can reduce the
(iii) D = 0 difference.
(iv) D = 1 (c) a bidirectional search that can reduce the
(a) (i) and (iii) (b) (i) and (iv) difference.
(c) (ii) and (iii) (d) (ii) and (iv) (d) an operator that can reduce the difference.
Ans : (b) Given CROSS Ans : (d) The Means Ends analysis process centers
ROADS around the detection of differences between the current
DANGER state and the goal state. Once such a difference is
whose solution is: isolated, an operator that can reduce the difference must
96233 be found.
UGC NET JRF Computer Science Sept. 2013 Paper-III 70 YCT
 Search on TG: @apna_pdf
7. Suppose a file of 10,000 characters is to be sent B. OSPF
over a line at 2400 bps. Assume that the data is C. SMTP
sent in frames. Each frame consists of 1000 D. HDLC
characters and an overhead on 48 bits per List- I
frame. Using synchronous transmission, the 1. Message Transfer Protocol
total overhead time is _____. B. Bit-oriented Protocol
(a) 0.05 second (b) 0.1 second C. Interior Gateway Routing Protocol
D. Connectionless Transport Protocol
(c) 0.2 second (d) 2.0 second
Code:
Ans : (c) For synchronous transmission: A B C D
= 10000 characters/1000 character per frame (a) 3 4 2 1
= 10 frames required to transmit file (b) 4 3 2 1
Now, overhead in bits is 10 × 48 = 480 bits. (c) 4 3 1 2
480 (d) 3 4 1 2
Time overhead is = = 0.2 second.
2400 Ans : (c) 1. UDP (User Datagram Protocol) is a
8. Which of the following is the size of network connectionless transport layer protocol.
2. OSPF (Open Shortest Path First) is a routing
bits and Host bits of Class A to IP address? protocol for internet protocol (IP) networks. OSPF is
(a) Network bits 7, Host bits 24 perhaps the most widely used interior gateway protocol
(b) Network bits 14, Host bits 16 (IGP) in large enterprise networks.
(c) Network bits 15, Host bits 16 3. SMTP (Simple Mail Transfer Protocol) is a TCP/ IP
(d) Network bits 16, Host bits 16 protocol used in sending an e-mail.
Ans : (a) Classful IPv4 network structure: 4. HDLC (High Level Data Link Control) is a bit data
Class Leading Size of Size of link layer protocol.
bits network host bit 12. Given the IP address 201.14.65 and the subnet
number bit field mask 255.255.255.224. What is the subnet
field address?
A 0 7 24 (a) 201.14.78.32 (b) 201.14.78.64
B 10 14 16 (c) 201.14.78.65 (d) 201.14.78.224
C 110 21 8 Ans : (b) To find subnet id from subnet mask and given
For class A network bits and host bits are 7 bits and 24 IP address, we do a bitwise ANDing operation.
bit respectively. Therefore, given IP address:
(201.14.79.65)10 = (11001001.00001110.01001110.01000001)2
9. Which of the following field of the TCP header
Subnet mask is:
tells how many bytes may be sent starting at (255.255.255.244)10 = (11111111.11111111.11111111.11100000)2
the byte acknowledged? After ANDing, we get subnet id is:
(a) TCP header length (201.14.78.64)10 = (11001001.00001110.01001110.01000000) 2
(b) Window size
(c) Acknowledgement number 13. If an artificial variable is present in the basic
(d) urgent pointer variable of optimal simplex table then the
Ans : (b) 1. The Window Size field tells how many solution is
bytes will be sent starting at the byte acknowledged. (a) Alternative solution
2. TCP Header field gets its name from the fact that it (b) Infeasible solution
(c) Unbounded solution
is also the offset from the start of the TCP segment to
(d) Degenerate solution
the actual data.
Ans : (b) If an artificial variable is present in the "basic
10. Which of the following is a bit rate of an 8-PSK variable" of optimal simplex table then the solution is
signal having 2500 Hz bandwidth? infeasible else if condition is false. It may be degenerate
(a) 25000 bps (b) 5000 bps or unbounded.
(c) 7500 bps (d) 20000 bps 14. An optimal assignment requires that the
Ans : (c) Since 8 = 23 bit rate is 3 times of baud rate in minimum number of horizontal and vertical
8 PSK. lines that can be drawn to cover all zeros be
So, bit rate = 3 × 2500 = 7500 bps equal to the number of
(a) rows or columns
11. Match the following
(b) rows + columns
List- I (c) rows + columns - 1
A. UDP (d) rows + columns +1
UGC NET JRF Computer Science Sept. 2013 Paper-III 71 YCT
 Search on TG: @apna_pdf
Ans : (a) If number of lines are less than row or column Which of the following is true?
then we again subtract the smallest uncovered number (a) The language corresponding to the given
to obtain more number of zeroes so that number of lines grammar is a set of even number of a's.
covering all zeroes equal to number of rows and (b) The language corresponding to the given
columns only then assignments can be made. grammar is a set of odd number of a's.
(c) The language corresponding to the given
15. Which of the following is the minimum cost for grammar is a set of even number of a's
an assignment problem given below? followed by odd number to b's.
A B C D (d) The language corresponding to the given
I 5 3 2 8 grammar is a set of odd number of a's
II 7 9 2 6 followed by even number of b's.
Workers Ans : (b) Given grammar is
III 6 4 5 7
IV 5 7 7 8 S → aA | aBB useless production
(a) 13 (b) 16 A → aaA | λ
(c) 17 (d) 18
B → bB | bbC useless production
Ans : (c) Worker (i) charges minimum for job C,
assign him with cost 2, worker (ii) charges minimum C → B useless production
for job C with cost 2, but C is already assigned; assign regular expression is
him D with cost 6. L = a (aa ) *
Worker (iii) charges minimum for job B, assign him
The language corresponding to the given
with cost 4. Worker (iv) is assigned with pending job A
grammar is a set of odd number of a's.
with cost 5.
Therefore, minimum cost is 19. The language accepted by the non-
2 + 6 + 4 + 5 = 17 deterministic pushdown automaton.
M = ({q0, q1, q2}, {a, b}, {a, b, z}, δ q0, z, {q2})
16. Assume, L is regular language. Let statements
with transition
S1 and S2 be defined as: δ (q0, a, z) = {( q1, a) (q2 λ )};
S1: SQRT(L) = {x| for some y with |y| = |x|2, δ (q1, ba) = {( q1, b)}
xy ∈ L.}
δ (q0, b, b) = {( q1 b)}
S2: LOG(L) = {x| for some y with |y| = 2|x|,
δ (q1, a, b) = {( q2, λ )};
xy ∈ L.}
is
Which of the following true?
(a) L(abb*a) (b) {a} ∪ L(abb*a)
(a) S1 is correct and S2 is not correct. (c) L(ab a) *
(d) {a} ∪ L(ab*a)
(b) Both S1 and S2 are correct.
(c) Both S1 and S2 are not correct. Ans : (d) Given states q0 , q1 , q2 with q0 and q2 are
(d) S1 is not correct ans S2 correct. starting state and final state respectively alphabet
Ans : (b) Regular languages are closed under square ∑ (a, b).
root, half, log operations. Language accepted by NPDA is
17. A regular grammar for the language L = {an L = {a} ∪{ab * a}
bm|n even and m even is given by 20. The language L = {an bn am bm|n ≥ 0, n ≥ 0} is
(a) S → aSb | S1 ; S1 → bS1a | λ (a) Context free but not linear.
(b) S → aab | S1 ; S1 → bSb | λ (b) Context free and linear
(c) Not Context free and not linear
(c) S → aSb | S1 ; S1 → S1ab | λ (d) Not Context free but linear
(d) S → aaS | S1 ; S1 → bbS1 | λ Ans : (a) Given language is
Ans : (d) Given language is: L = {a n b n a m b m | n ≥ 0, m ≥ 0}
L = {a n b m | n is even and m is even} Grammar for L is
Grammar for L is: S → AB
S → aaS | S1 | λ A → aAb |∈
S1 → bbS1 | λ B → aBb |∈
Regular expression is L = (aa ) * (bb) *. Therefore, grammar is context-free but not linear since
comparison are done here.
18. Given the following production of a grammar. 21. Assume statements S1 and S2 defined as:
S → aA | aBB; S1: L2 - L1 si recursive enumerable where L1
A → aaA | λ ; and L2 are recursive and recursive enumerable
B → bB | bbC ; respectively.
S2: The set of all Turning machines is
C→B countable.
UGC NET JRF Computer Science Sept. 2013 Paper-III 72 YCT
 Search on TG: @apna_pdf
Which of the following is true? 4. Pointer swizzing
(a) S1 is correct and S2 are correct. Codes:
(b) Both S1 and S2 are correct. A B C D
(c) Both S1 and S2 are not correct. (a) 3 4 2 1
(d) S1 is correct and S2 are are correct. (b) 4 3 2 1
(c) 4 3 1 2
Ans : (b) 1. Recursive Language are closed under
(d) 3 4 1 2
complement property. So, statement (i) is true.
Ans : (a) 1. Dangling pointers arise object destruction,
2. The set of all turing machine is countable is also
when an object that has an incoming reference is
true. deleted or deallocated, without modifying the value of
22. Non-deterministic pushdown automaton that the pointer, so that the pointer still points to the memory
accepts the language generated by the location of the deallocated memory.
grammar. 2. Pointer swizzling at page fault time is a novel
S → aSS|ab is address translation mechanism that exploits
conventional address translation hardware.
(a) δ(q0 , λ , z ) = {(q1 , z )};
3. List representation is used to variable length
δ(q0 , a, S ) = {(q1 , SS )};(q1 , B)} records.
δ(q0 , b, B) = {(q1 , λ)} 4. Toss immediate is a buffer replacement policy.
24. _____ Constraints ensure that a value that
δ(q1 , λ, z ) = {(q1 , λ)}
appears in one relation for a given set of
(b) δ(q0 , λ, z ) = {(q1 , Sz )}; attributes also appears for a certain set of
δ(q0 , a, S ) = {(q1 , SS )};(q1 , B)} attributes in another relation.
(a) Logical Integrity
δ(q0 , b, B) = {(q1 , λ)} (b) Referential Integrity
δ(q1 , X , z ) = {(qf , λ)} (c) Domain Integrity
(c) δ(q0 , λ, z ) = {(q1 , Sz )}; (d) Data Integrity
Ans : (b) A value that appears in one relation for a
δ(q0 , a, S ) = {(q1 , S )},(q1 , B )} given set of attributes also appears for a certain set of
δ(q0 , b, λ) = {(q1 , B )}, attributes in another relation. This is called attributes in
another relation. This is called referential integrity,
δ(q1 , λ, z ) = {q f , λ )}
which is expressed in terms of foreign key.
(d) δ(q1 , X , z ) = {(qf , z )}; 1. Domain integrity specifies that all columns in a
δ(q0 , a, S ) = {(q1 , SS )},(q1 , B )} relational database must be declared upon a defined
domain.
δ(q0 , b, λ) = {(q1 , B )}, 2. Data integrity is a fundamental component of
δ(q1 , λ, z ) = {q f , λ )} information security.
25. The SQL expression
Ans : (b) Given grammar is
S → aSS | ab Select distinct T, branch_name from branch T,
branch S
Non-deterministic push down automata is: where T, assets > S. assets and S.branch_city =
δ(q0 , λ, z ) = {(q1 , Sz )}; ''Mumbai" finds the name of
δ(q0 , a, S ) = {(q1 , SS )};(q1 , B)} (a) All branches that have greater assets than
some branch located in Mumbai.
δ(q0 , b, B) = {(q1 , λ)} (b) All branches that have greater assets than all
δ(q1 , X , z ) = {(qf , λ)} branches in Mumbai
(c) The branch that has greatest assets in
23. Match the following Mumbai.
List-I (d) Any branch that has greater assets than any
A. Dangling pointer branch Mumbai.
B. Page fault Ans : (a) Find all branches that have greater assets
C. List representation than some branch located in Mumbai:
D. Toss immediate Select branch_name
List-II From branch
1. Buffer replacement policy Where assets > Some (Select assets
2. Variable length records From branch
3. Object identifier Where_city = "Mumbai")
UGC NET JRF Computer Science Sept. 2013 Paper-III 73 YCT
 Search on TG: @apna_pdf
Or Ans : (c) The perception learning algorithm, which
Select distinct T. branch_name can be put into the following form:
From branch as T, branch as S w(n + 1) = w (n) + η[d (n) − y (n)]× x(n)
Where T. assets > S. assets and where, η is the step size, y is the network output and d
S. branch_city = "Mumbai" is the desired response.
26. Let A be the set comfortable house given as 29. _______ refers to the discrepancy among a
 x1 x2 x3 x4  computed, Observed or measured value and
A= , , , ,
 0.8 0.9 0.1 0.7  the true specified or theoretically correct
and B be the set of affordable houses values.
(a) Fault (b) Failure
x x x x 
B =  1 , 2 , 3 , 4 , (c) Defect (d) Error
 0.9 0.8 0.9 0.2  Ans : (d) Error is discrepancy between a computed,
Then the set of comfortable and affordable observed, or measured value and the true, specified or
houses is theoretically correct value or condition.
 x1 x2 x3 x4  30. Which logic family dissipates the minimum
(a)  , , , ,
 0.8 0.8 0.1 0.2  power?
 x1 x2 x3 x4  (a) DTL (b) TTL
(b)  , , , , (c) ECL (d) CMOS
 0.9 0.9 0.6 0.7 
Ans : (d) By lowering the power supply voltage CMOS
x x x x  chips often work a broader range of power supply
(c)  1 , 2 , 3 , 4 , 
 0.8 0.8 0.6 0.7  voltages than other logic families. Early TTL ICs
x x x x  required a power supply voltage of 5 V, but CMOS
(d)  1 , 2 , 3 , 4 ,  could use 3 to 15 V.
 0.7 0.7 0.7 0.7 
31. Which of the following electronic component is
Ans : (a) To find the set of comfortable and affordable
not found in IC's?
house, we need to find A ∩ B. (a) Diode (b) Resistor
A ∩ B = min [ Ai , Bi ] ∀i (c) Transistor (d) Inductor
So, A ∩ B = {min (0.8, 0.9), min (0.9, 0.8), min (0.1, Ans : (d) 1. An IC is a collection of electronic
0.6), min (0.7, 0.2)} component registers, transistors, capacitors etc.
2. A transistor is a semiconductor device just like a
 x1 x2 x3 x4  diode.
= , , , ,
 0.8 0.8 0.1 0.2  32. A given memory chip has 14 address pins and 8
27. Support of a fuzzy set data pins. It has the following number of
locations.
x x x x x 
A= 1 , 2 , 3 , 4 , 5  (a) 28 (b) 214
 0.2 0.15 0.9 0.15 0.15  (c) 2 6
(d) 212
within a universal set X is given as Ans : (b) Memory chip has 14 address pins each pin
 x1 x2 x3 x4 x5  can be 0 or 1. So, there are total 214 possible addresses.
(a)  , , , , 
 0.15 0.15 0.15 0.15 0.15  33. The instruction: MOV CL, [BX][DI] + 8
 x1 x2 x3 x4 x5  represents the _____ addressing mode.
(b)  , , , , 
 0.95 0.95 0.95 0.95 0.95  (a) Based Relative (b) Based Indexed
(c) Indexed Relative (d) Register indexed
(c) { x3 , x4 }
Ans : (b) The based indexed addressing mode is a
(d) { x1 , x2 , x3 , x4 , x5 } combination of the based relative addressing mode and
the indexed relative addressing mode. In this mode each
Ans : (d) Support of a fuzzy set A within a universal set
instruction requires one base and one index register.
X is
34. The power dissipation of a flip-flop is 3 mW.
{x1 , x2 , x3 , x4 , x5 }
The power dissipation of a digital system with 4
28. In a single perception, the updation rule of flip-flops is given by
weight vector is given by (a) 34 mW (b) 44 mW
4
(a) W(n +1) = W(n) + n[d(n) - y(n)] (c) 4/3 mW (d) 12 mW
(b) W(n +1) = W(n) - n[d(n) - y(n)] Ans : (d) Given, power dissipation of one flip-flop is 3
(c) W(n +1) = W(n) + n[d(n) - y(n)]*×(n) mW. So, power dissipation of 4 flip-flops = 4 × 3 = 12
(d) W(n +1) = W(n) - n[d(n) - y(n)]*×(n) mW.
UGC NET JRF Computer Science Sept. 2013 Paper-III 74 YCT
 Search on TG: @apna_pdf
35. An as table multivibrator using the 555 timer there are only 365 possible birthday, excluding
to generate a square wave of 5 KHz with 70% February 29).
duty cycle will have However, 99.9% probability is reached with just 70
(a) Ra = 40.4KΩ, Rb =17.25K Ω, C = 2000pF people, and 50% with 23 people. These conclusions are
(b) Ra = 17.25KΩ, Rb = 40.4 K Ω, C = 2000pF based on the assumption that each day of the year
(except February 29) is equal probable for a birthday.
(c) Ra = 40.4KΩ, Rb =17.25K Ω, C = 5000pF 365
P23
(d) Ra = 17.25KΩ, Rb = 40.4 K Ω, C = 5000pF P( A) =1 − =1 − 0.4927
(365)23
Ans : (*) This question were marks to all. Because on
solving we get P( A) = 0.5072
RA =1.15 Kohm 39. The number of possible parenthesizations of a
RB = 0.864 Kohm sequence of n matrices is
C = 0.100 uF (a) O(n) (b) Θ (n log n)
None option matches. (c) Ω (n2) (d) None of these
36. A binary ripple counter is required to count up Ans : (c) Denote the number of alternative
paranthesizations of a sequence of n matrices by p(n).
to 16383. How many flip-flops are required?
Thus recurrence relation is:
(a) 16382 (b) 8191
(c) 512 (d) 14  1 if n =1
 n −1
Ans : (d) Total number of flip-flop required to count p ( n) = 
mod n on a ripple counter is: ∑ p(k ). p (n − k ) if n ≥ 2
 k =1
# flip-flop = log 2 (n)  The problem reduces to matrix multiplication problem
Therefore, which takes Ω(n 2 ).
# flip-flop = log 2 (16383)  = 13.99
40. The time complexity of an efficient algorithm
= 14
to find the longest monotonically increasing
37. The time complexity of recurrence relation subsequence of n numbers is
T(n) = T(N/3) + T(2n/3) + O(n) is (a) O(n)
(a) O(lg n) (b) O(n) (b) O(n log n)
(c) O(n lg n) (d) O(n2) (c) O(n2)
Ans : (c) Given recurrence relation is (d) None of these
T (n) = T (n / 3) + T (2n / 3) + O (n) Ans : (b) The longest increasing subsequence problem
Exploding out the first few levels, the is solvable in time O(n log n), where n denotes the
recurrence is: length of the input sequence.
41. Given a binary search trees for a set of n = 5
keys with the following probabilities:
i 0 1 2 3 4 5
Pi — 0.15 0.10 0.10 0.10 0.20
qi 0.05 0.10 0.05 0.05 0.05 0.10
The expected optimal cost of the search is
Note that the tree here is not balanced the longest path (a) 2.65 (b) 2.70
is the rightmost one, and its length is log 3 / 2 (n). (c) 2.75 (d) 2.80
Hence time complexity of given recurrence is Ans : (c) Optimal binary search tree is:
O(log 3 / 2 (n)) or O(n log n).
38. How many people must there be in a room
before there is a 50% chance that two of them
were born on the same day of the year?
(a) At least 23 (b) At least 183
(c) At least 366 (d) At least 730
Ans : (a) 1. The birthday problem concerns the
probability that, in a set of n randomly chosen people,
some pair of them will have the same birthday.
2. By the pigeon hole principle, the probability reaches
100% when the number of people reaches 366 (since, This tree has optional expected cost is 2.75.
UGC NET JRF Computer Science Sept. 2013 Paper-III 75 YCT
 Search on TG: @apna_pdf
42. Given 0-1 knapsack problem and fractional Ans : (c) The decrement of failure intensity per failure
knapsack problem and the following is:
statements: dλ λ  10
⇒ =− 0 =−
S1: 0-1 knapsack is efficiently solved using dµ Y 100
 0
Greedy algorithm.
⇒ − 0.1 per CPU hr.
S2: Fractional knapsack is efficiently solved using
Dynamic programming. 45. Improving processing efficiency or
Which of the following is true? performance or restructuring of software to
(a) S1 is correct and S2 is not correct. improve changeability is known as
(b) Both S1 and S2 are correct. (a) Corrective maintenance
(c) Both S1 and S2 are not correct. (b) Perfective maintenance
(c) Adaptive maintenance
(d) S1 is not correct and S2 is correct.
(d) Code maintenance
Ans : (*) Since, greedy algorithm optimized local and Ans : (b) 1. Perfective maintenance modification of a
dynamic algorithm optimized global. software product after delivery to improve performance
So, greedy algorithm does not work for 0 - 1 Knapsack or maintainability.
problems correctly 0-1 Knapsack efficiently dynamic 2. Corrective maintenance reactive modification of a
programming but fractional Knapsack solved efficiently software product performed after delivery to correct
using greedy algorithm. discovered problems.
43. Equivalence class partitioning approach is used 3. Adaptive maintenance modification of a software
product performed after delivery to keep a software
of divide the input domain into a set of product usable in a changed or changing environment.
equivalence classes, so that if a program works
46. In_____, modules A and B make use of a
correctly for a value, then it will work correctly
common data type, but perhaps perform
for all the other values in that class. This is
different operations on it.
used _______. (a) Data coupling (b) Stamp coupling
(a) to partition the program in the form of (c) Control coupling (d) Contents coupling
classes. Ans : (b) 1. Two modules are stamp coupled if they
(b) to reduce the number of test form cases communicate via a passed data structure that contains
required. more information than necessary for them to perform
(c) for designing test cases in white box testing. their functions.
(d) all of the above. 2. Two modules are data coupled if they communicate
Ans : (b) Equivalence class partitioning is a software by passing parameters.
testing technique that divides the input data of a 3. Two modules are control coupled if they
software unit into partitions of equivalent data from communicate using at least one "control flag".
which test cases can be derived. An advantage of this 47. Consider the following schemas:
approach is reduction in the time required for testing a Branch_Schema= (branch_name, assets, city)
software due to lesser number of test cases. Customer_Schema=(customer_name, street,
city)
44. The failure intensity for a basic model as a
Deposit_Schema = (branch_name, account
function of failures experience is given as _number, customer_name, balance)
λ(µ) − λ 0 [1 − (µ) / V0 )]. Borrow_Schema = (branch_name,
where λ 0 is the initial failure intensity at the loan_number, customer_name, amout)
Which of the following tuple relational calculus
start of the execution, µ is the average or finds all customers who have loan amount
expected number of V0 failure at a given point more than Rs. 12,000?
in time, the quantity V0 is the total number of (a) {t(customer_name)|t ∈ borrow ∧ t[amount >
12000}
failure that would occur in infinite time. (b) {t|t(customer_name)|t ∈ borrow ∧ t[amount >
Assume that a program will experience 100 12000}
failures in infinite time, the initial failure (c) {t|s ∈ borrow ∧ (t(cumtomer_name = s
intensity was 10 failures/CPU hr. Then the (customer_name)) s[amount]>12000}
decrement of failures intensity per failure will (d) {t|s ∈ borrow ∧ (t(cumtomer_name ∧ s
be (customer_name)) s[amount]>12000}
(a) 10 per CPU hr. Ans : (c) Query: Find all customers who have loan
(b) 0.1 per CPU hr. amount more than Rs. 12000.
(c) -0.1 per CPU hr. TRC:
{t | s ∈borrow ∧ (t (customer_name = s(customer_name)) s[amount] >12000}.
(d) 90 per CPU hr.
UGC NET JRF Computer Science Sept. 2013 Paper-III 76 YCT
 Search on TG: @apna_pdf
48. Match the following: Ans : (b) 60 reusable software components were
List-I List-II planed. If only 70 percent can be used then 30% i.e., 18
A. Create 1. The E-R Model components would have to be developed from scratch.
B. Select 2. Relationship Model Since the average component is 100 LOC and local data
C. Rectangle 3. DDL indicate that the software engineering cost for each
D. Record 4. DML LOC is Rs. 14 the overall cost (impact) to develop the
Code: components would be 18 × 100 × 14 = Rs. 25,200
A B C D So, Risk exposure = 0.8 × 25,200 = Rs. 20,160.
(a) 3 4 1 2 51. Consider the following two function
(b) 4 3 2 1 declarations:
(c) 4 3 1 2 (i) int f() (ii) int(*f)()
(d) 3 4 2 1
Which of the following is true?
Ans : (a) 1. Create used in DLL (data definition (a) Both are identical
language).
(b) The first is a correct declaration and the
2. Select used in DML (data manipulation language).
second is wrong.
3. Rectangle used in ER diagram as relationship.
(c) Both are different ways of declaring pointer
4. Record or information used in relationship model.
to a function.
49. Match the following: (d) The first declaration is a function returning a
List-I pointer to an integer and the second is a
pointer to function returning integer.
Ans : (d) int *f( ) is a function returning a pointer to an
integer.
int (*f) ( ) is a pointer to function returning integer.
52. Assume that we have constructor function for
both Base and Derived classes. Now consider
List-II the declaration:
1. One to one relationship main ( )
2. Relationship Base *P = new Derived;
3. Many to many relationship In what sequence, the constructor will be
4. Many to one relationship executed:
Codes: (a) Derived class constructor is followed by Base
A B C D class constructor.
(a) 3 4 2 1 (b) Base class constructor.
(b) 4 3 2 1 (c) Base class constructor is never called.
(c) 2 3 4 1 (d) Derived class constructor is never called.
(d) 3 4 1 2
Ans : (b) Whenever a derived class object is created,
Ans : (c) the base class constructor gets called first and then the
ER-diagram Description derived class constructor.
Relationship 53. What is the output of the following program?
Many-to-many #include <stdio.h>
relationship main ( )
Many-to-one relationship {
int a, b = 0;
One-to-one relationship
static int c[10] = 2, 3, 4, 5, 6, 7, 8, 9, 0]}
50. Sixty (60) reusable components were available for (a = 0; a < 10; + + a)
for an application. If only 70% of these if ((C[a]% 2==0) b+ = c [a];
components can be used, rest 30% would have print f("d", b);
to be developed from scratch. If average }
component is 100 LOC and cost of each LOC is (a) 15 (b) 25
Rs. 14, what will be the risk exposure if risk (c) 45 (d) 20
probability is 80%? Ans : (d) The print f statement will print 'b' which is
(a) Rs. 25,200 (b) Rs. 20,160 sum of those values from array C which get divided by
(c) Rs. 25,160 (d) Rs. 20,400 2, that is 2 + 4 + 6 + 8 = 20.
UGC NET JRF Computer Science Sept. 2013 Paper-III 77 YCT
 Search on TG: @apna_pdf
54. A Program contains the following declaration 58. A _______ can forward or block packets based
and initial assignments on the information in the network layer and
int i = 8, j = 5; transport layer header.
double x = 0.005, y = -0.01; (a) Proxy firewall
char c = 'c' d = 'd';. (b) Firewall
Determine the value of the following (c) Packer fitter firewall
expressions which involve the use of library (d) Message digest firewall
functions: Ans : (c) 1. A firewall can be used as a packet filter. It
abs (i - 2*j); log (exp(x)); toupper (d) can forward or block packets based on the information
(a) 2; 0.005; D (b) 1; 0.005; D in the network layer and transport layer headers: source
(c) 2; 0.005; E (d) 1; 0.005; e and destination IP addresses, source and destination
Ans : (a) abs(i -2j) returns the absolute value = 2 log port addresses, and type of protocol (TCP or UDP).
(exp(x)) = In (e x ) = 0.004.? 2. A packet filter firewall is a router that uses a
filtering table to decide which packets must be
toupper 'D' letter to be converted to upper case.
discarded (not forwarded).
55. MPEG involves both spatial compression and
59. Which of the following graphics devices are
temporal compression. The spatial
known as active graphics devices?
compression is similar to JPEG and temporal
compression removes _______ frames. (i) Alphanumeric devices
(a) Temporal (b) Voice (ii) Thumb wheels
(c) Spatial (d) Redundant (iii) Digitizers
(iv) Joy stick
Ans : (d) MPEG (Motion Pictures Experts Group)
(a) (i) and (ii)
compression is a method of compressing video. MPEG
involves both spatial compression and temporal (b) (iii) and (iv)
compression. (c) (i), (ii) and (iii)
The spatial compression is similar to JPEG and (d) (i), (ii), (iii) and (iv)
temporal compression removes redundant frames. Ans : (d) 1. Active graphics devices has dynamic nature
56. If the data unit is 111111 and the divisor in control, 2-way communications, interaction with high
1010 in CRC method, what is the dividend at bandwidth user.
the transmission before division? 2. These are modern applications with 2-D, 3-D
transformations.
(a) 1111110000 (b) 1111111010
3. All given devices are active graphics devices.
(c) 111111000 (d) 111111
60. A diametric projection is said to be trimetric
Ans : (c) In CRC generating method, if divisor is n bit
long then we add (n - 1) number of 0's to LSB in the projection when
data unit before division. (i) two of the three foreshortening factors are
So, here divisor is 1010 hence 3 0's are added to LSB of equal and third is arbitrary.
data unit before division. That is 111111000. (ii) all of the three foreshortening factors are
57. If user A wants to send an encrypted message equal.
(iii) all of the three foreshortening factors are
to user B. The plain text of A is encrypted with
arbitrary.
the _______ .
Which of the above is true?
(a) Public Key of user A
(a) (i) and (ii) (b) (ii) and (iii)
(b) Public Key of user B
(c) (i) only (d) (iii) only
(c) Private Key of user A
(d) Private Key of user B Ans : (c) A diametric projection is a special case of
trimetric projection where two of the three
Ans : (b) 1. Two parties (A and B) might use public foreshortening factors are equal and third arbitrary.
key encryption as follows: First A generate a Therefore only statement (i) is true.
public/private key pair. If A wants to send B an
encrypted message, A ask B for B's public key. B sends 61. Which of the following is / are fundamental
A the public key over an insecure network, and then A method(s) of antialiasing?
uses this key to encrypt a message. (i) Increase of sample rate.
2. A sends the encrypted message to B, and then B (ii) Treating a pixel as a finite area rather than
decrypts it by using B's private key. If A received B's as a point.
key over an insecure channel, such as public network, A (iii) Decrease of sample rate.
must verify with B that A has a correct copy of B's (a) (i) and (ii) (b) (ii) and (iii)
public key. (c) (i) only (d) (ii) only
UGC NET JRF Computer Science Sept. 2013 Paper-III 78 YCT
 Search on TG: @apna_pdf
Ans : (a) 1. Antialiasing is the smoothing of the image Ans : (c) Rotations in space are more complex, because
or sound roughness caused by aliasing. we can either rotate about the x-axis, the y-axis, or the
2. Antialiasing is the application of techniques that z-axis. When rotating about the z-axis, only coordinates
reduce or eliminate aliasing. Increasing the sample rateof x and y will change and z coordinate will be the
and treating a pixel as a finite area rather than as a point
same. In effect, it is exactly a rotation about the origin
are fundamental methods of antialiasing. in the xy-plane.
62. The two color systems - the HSV and HLS are Therefore, the rotation equation is:
(a) Hue, Saturation, Value and Hue, Lightness,  x '  cos θ − sin θ 0 0   x 
Saturation.  y '  sin θ cos θ 0 0   y 
 =  
(b) High, Standard, Value and High, Lightness,  z '  0 0 1 0  z 
Saturation.     
 1'   0 0 0 1  1 
(c) Highly, Standard, Value and Highly,
Lightened, Saturation.  x   cos θ sin θ 0 0   x ' 
 y   − sin θ cos θ 0 0   y '
(d) Highly, Standard, Value and Hue, Lightness,  =  
Saturation. z  0 0 1 0  z ' 
    
Ans : (a) HSL stands for hue, saturation and lightness 1   0 0 0 1   1' 
(or luminosity) and is also often called HLS. HSV With this set of equations, letting θ be 90 degree
Stands for Hue, saturation and value also called HSB (B
rotates (1, 0, 0) to (0, 1, 0) and (0, 1, 0) to (-1, 0, 0).
= brightness).
Therefore, the x-axis rotates to the y-axis and the y-axis
63. The parametric representation of the line rotates to the negative effect of rotating about the z-axis
segment between the position vectors P1 (2,3) 90 degree.
and P2 (5, 4) is given as 65. Consider the following sequence of operations:
(a) x (t ) = 2 + 7 t , y ( t ) = 0 ≤ t ≤ ∞ 3 + 7 t (i) Pointer p1 is set to point at a new heap-
(b) x(t ) = 2 + 10t , y (t ) = 0 ≤ t ≤ 1 3 + 12t dynamic variable.
(c) x(t ) = 2 + 3t , 0 ≤ t ≤1 y (t ) = 3 + t (ii) Pointer p2 is assigned p1 's value.
(d) t ( x, y ) =14t 0 ≤ t ≤1 (iii) The heap dynamic variable pointed to by
p1 is explicitly de-allocated, but p2 is not
Ans : (c) Given two points ( x1 , y1 ) and ( x2 , y2 ) the
changed by the operation.
point (x, y) is on the line determined by ( x1 , x2 ) and
This situation leads to which of the following:
( x2 , y2 ) if and only if there is a real number t such that
(a) p1 becomes a dangling pointer
x = (1 − t ) x1 + t1 x2
(b) p2 becomes a dangling pointer
y = (1 − t ) y1 + ty2
(c) Both p1 and p2 are now dangling pointers
Here, ( x1 , y1 ) = (2, 3) and ( x2 , y2 ) = (5, 4).
(d) Neither p1 nor p2 is now a dangling
Therefore,
pointer
x = (1 − t )2 + t ⋅ 5 = 3t + 2
Ans : (b) A dangling pointer is a pointer that contains
y = (1 − t )3 + t ⋅ 4 = t + 3 the address of a dynamically allocated memory that has
64. Consider the following transformation matrix been deallocated.
for rotation (clockwise): So, P2 is now a dangling pointer. If the deallocation
 COS θ Sin θ 0 0  operation did not change P1 , both P1 and P2 would be
 − Sin θ COS θ 0 0 
dangling.
[ T ] =  
0 0 1 0 66. The programming languages C and C++ are
 
 0 0 1 1 not strongly typed languages because:
This matrix rotates an object by an angle 9 (a) Both C and C++ allow functions for which
about: parameters are not type checked.
(a) X-axis (b) Y-axis (b) Both C and C++ allow functions for which
(c) Z-axis (d) All of these parameters are type checked.
UGC NET JRF Computer Science Sept. 2013 Paper-III 79 YCT
 Search on TG: @apna_pdf
(c) Both C and C++ allow functions for which Ans : (d) A distributed system is a model in which
parameters are not type checked and also the components located on networked computers
union types in these languages are not type communicate and coordinate their actions by passing
checked. messages. The components interact with each other in
order to achieve a common goal.
(d) Union types in these (C and C++) languages
69. A system contains 10 units of resource of same
are not type checked.
type. The resource requirement and current
Ans : (c) 1. In contrast, a language is weakly typed if allocation of these resources for three processes
type confusion can occur. Silently (undetected), and P, Q and R are as follows:
eventually case errors that are difficult to localize. P Q R
2. Also, C and C++ are considered weakly typed since, Maximum 8 7 5
due to typecasting, one can interpret a field of a requirement
structure that was an integer as a pointer. Current allocation 4 1 5
3. C and C++ are not strongly typed language because Now, consider the following resource requests:
both allow functions for which parameters is not type (i) P makes a request for 2 resource units.
checked. The union types of these checked. The union (ii) Q makes request for 2 resource units.
types of these languages are not type checked. (iii)R makes a request of 2 resource units.
67. The tracing model in Prolog describes program For a safe state, which of the following options
must be satisfied?
execution in terms of certain events. These
(a) Only request (i) (b) Only request (ii)
events are (c) Only request (iii) (d) Request (i) and (ii)
(a) call and exit Ans : (c)
(b) call and fail Process Max Allocated Available Remaining
(c) call, exit and redo Need Need
(d) call, exit, redo and fail P 8 4 2 4
Q 7 1 6
Ans : (d) The Tracing Model describes the execution R 5 3 2
of prolog program in terms of four kinds of events that 8
occurs. These are Call, Exit, Redo and Fail. The Available = 10 - 8 = 2
debugging aids tell us about when event of these four Only request of R (of 2 resources) must be satisfied so
kinds occur in the execution of our programs. These that it can be completed and release all 5 resources
events will take place for all of the various goals that which in turn will ensure the execution of P then Q
that is a safe sequence.
prolog considers during the execution.
70. Consider the following set of processes with the
68. Which of the following statements is not
length of CPU burst time in milliseconds (ms):
correct with reference to distributed systems? Process A B C D E
(a) Distributed system represents a global view Burst time 6 1 2 1 5
of the network and considers it as a virtual Priority 3 1 3 4 2
uni-processor system by controlling and
Assume that processes are stored in ready
managing resources across the network on all queue in following order:
the sites. A-B-C-D-E
(b) Distributed system is built on bare machine, Using round robin scheduling with time slice of
not an add-on to the existing software. 1 ms. the average turn around time is
(c) In a distributed system, kernel provides (a) 8.4 ms (b) 12.4 ms
smallest possible set of services on which (c) 9.2 ms (d) 9.4 ms
other services are built. This kernel is called Ans : (a) Gantt chart is
microkernel. Open serves provide other B E A C D E A C E A E A E A A
services and access to shared resources. 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
15
(d) In a distributed system, if a user wants to run
15 + 1 + 8 + 5 + 13
the program on other nodes or share the Therefore, average TAT =
5
resources on remote sites due to their
42
beneficial aspects, user has to log on to that = = 8.4 milliseconds
site. 5

UGC NET JRF Computer Science Sept. 2013 Paper-III 80 YCT

 Search on TG: @apna_pdf
71. Consider a main memory with 3 page frames List - II
for the following page reference string: 1. Starting all processes, emulation of
5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4 different operating systems, security
Assuming that the execution of process is functions, transform character based
initiated after loading page 5 in memory, the applications to graphical representation.
number of page faults in FIFO and second 2. Export a virtual memory interface,
chance replacement respectively are support for symmetric multiprocessing,
(a) 8 and 9 (b) 10 and 11 administration, details of mapping
(c) 7 and 9 (d) 9 and 8 memory, configuring I/O buses, setting up
DMA.
Ans : (d) Using FIFO (First in First out) replacement
3. Thread scheduling, interrupt and
algorithm (given page 5 already in memory, so, there is
exception handling, recovery after power
no page fault for 5 in first).
failure.
initial 5 4 3 2 1 4 3 5 4 3 4 1 4
4. Object manager, virtual memory manager,
5 5 5 2 2 2 3 3 3 4 process manager, plug-and-play and power
manager.
4 4 4 1 1 1 3 5 5
Codes:
3 3 3 4 4 4 1 1
A B C D
Therefore, total number of page fault in FIFO algorithm (a) 1 3 2 4
is 9 and replacement is 8. (b) 4 3 2 1
72. Which of the following shell scripts will (c) 2 3 4 1
produce the output "my first script"? (d) 3 2 1 4
(a) for i in my first script {echo - i $i} Ans : (c) There, (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
(b) for my first script; do echo - n; done 75. Which of the following statements is not true
(c) for i in my first script; do echo - i $i; done for UNIX Operating System?
(d) for n in my first script; do echo - i $i; done (a) Major strength of UNIX Operating System is
Ans : (c) For loop control variable i which will be its open standards which enabled large
assigned the value after it and do apply for loop to print number of organizations ranging from
it should be enclosed in do .... done block. academicia to industries to participate in its
Therefore, echo - i display the current content of i. development.
73. The portion of Windows 2000 operating system (b) UNIX kernel uses modules with well
specified interfaces and provides advantages
which is not portable is
like simplified testing and maintenance of
(a) processor management
kernel. It has better extensibility as the kernel
(b) user interface
is not monolithic.
(c) device management
(c) UNIX is kernel based operating system with
(d) virtual memory management two main components viz. process
Ans : (d) Each processor that windows 2000 supports management subsystem and file management
implements virtual memory through hardware subsystem.
differently; therefore, the portion of windows 2000 that (d) All devices are represented as files which
directly interfaces with virtual memory hardware is not simplify the management of I/O devices and
portable and must be recorded when moving to another files. The directions structure used is directed
platform to minimize problem. acyclic graph.
74. Match the following for Windows Operating Ans : (b) Use of Kernel modules with well specified
System: interfaces provides several advantages. Existence of the
List - I module interface simplifies testing and maintenance of
A. Hardware abstraction layer the kernel. An individual module can be modified to
B. Kernel provide new functionalities or enhance existing once.
C. Executive This feature overcomes the poor extensibility typically
D. Win32 subsystem associated with monolithic kernels.
UGC NET JRF Computer Science Sept. 2013 Paper-III 81 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2013

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. When data and acknowledgement are sent in In ground propagation, ratio waves travel through the
the same frame, this is called as lowest portion of the atmosphere. These low-frequency
(a) Piggy packing (b) Piggy backing signals travel in all directions from the transmitting
(c) Back packing (d) Good packing antenna.
Ans : (b) Piggy backing is a bi-directional data 5. Using the RSA public key crypto system, if p =
transmission technique in the network layer (OSI 13, q = 31 and d = 7, then the value of e is :
model). It marks the most of the sent data frames from (a) 101 (b) 103
receiver, to emitter adding the confirmation that the (c) 105 (d) 107
data frame sent by the sender was received successfully Ans : (b) φ(n) = (P – 1) (Q – 1) = 12 × 30 = 360
2. Encryption and Decryption is the responsibility choose an int e such that 1 < e < φ 8 e 8 are co prime
of .................... Layer. d.c. = 1 mod Q
(a) Physical (b) Network 7 e = 1 mod 360 = 361 mod 360 = 721 mod 360 ⇒ 7e =
(c) Application (d) Datalink 721 ⇒ e = 103
Ans : (c) The sixth layer of OSI model, responsible for 6. FAN IN of a component A is defined as :
translation, encryption, authentication and data (a) Number of components that call or pass
compression. control to component A.
The application layer of the TCP/IP model (b) Number of components that are called by
combines the functionalities of the session layer, the component A.
presentation layer, and the application layer of the OSI
(c) Number of components related to component
model. Encryption and Decryption is the responsibility
A.
of application layer (in TCP/IP model application layer
(d) Number of components dependent on
+ presentation layer + session layer).
component A.
3. An analog signal carries 4 bits in each signal
Ans : (a) FANIN ⇒ number of components that can
unit. If 1000 signal units are sent per second, call or pass control to component A
then band rate and bit rate of the signal are
FAN OUT ⇒ number of component that are called by
.............. and ................
component A
(a) 4000 bauds/sec & 1000 bps
(b) 2000 bauds/sec & 1000 bps 7. The relationship of data elements in a module
(c) 1000 bauds/sec & 500 bps is called
(d) 1000 bauds/sec & 4000 bps (a) Coupling (b) Modularity
(c) Cohesion (d) Granularity
Ans : (d) Bit rate is the number of bits per second. Baud
rate is the number of signal unit per second. Baud rate Ans : (c) The relationship of data elements in a module
is less than or equal to the bit rate. is called cohesion.
So here baud rate is given 1000 bauds (signal) per sec 8 Cohesion refers to the degree to which the elements of a
no. of bits per signal = 4 module belong together. Thus, cohesion measures the
So bit rate = 4000 bits per sec strength of relationship between pieces of functionality
within a given module. For example. in highly cohesive
4. The VLF and LF bauds use ..................
systems functionality is strongly related.
propagation for communication.
8. Software configuration management is the
(a) Ground (b) Sky
discipline for systematically controlling :
(c) Line of sight (d) Space
(a) the changes due to the evolution of work
Ans : (a) In general there are three types of propagation products as the project proceeds
(1) Ground propagation (b) the changes due to defects (bugs) being found
(2) Sky propagation and then fixed
(3) Line of sight propagation (c) the changes due to requirement changes
(d) All of the above
UGC NET JRF Computer Science Dec. 2013 Paper-II 82 YCT
 Search on TG: @apna_pdf
Ans: (d) In software engineering, software (a) 28th record (b) 27th record
configuration management is the task of tracking & (c) 3rd record (d) 4th record
controlling changes in the software, part of the larger Ans : (b) Database file contain 30 records:
cross-disciplinary field of configuration management. Go bottom then skip 3
SCM practices include revision control and the Go to bottom (at last 30th record) then skip 3 records
establishment of base line. (i.e., 30th, 29th, and 28th). Then you are at 27th record.
9. Which one of the following is not a step of 13. An ER model includes
requirement engineering? (i) An ER diagram portraying entity types
(a) Requirement elicitation (ii) Attributes for each entity type
(b) Requirement analysis (iii) Relationships among entity types
(c) Requirement design (iv) Semantic integrity constraints that reflects the
(d) Requirement documentation business rules about data not captured in the
Ans : (c) Requirements elicitation is requirements ER diagram
gathering. (a) 1, 2, 3 & 4 (b) 1 & 4
Requirement design is not a step of requirement (c) 1, 2 & 4 (d) 1 & 3
engineering. Ans : (a) ER model includes
10. Testing of software with actual data and in I. An ER diagram portraying entity types.
II. Attributes for each entity type
actual environment is called :
III. Relationships among entity types
(a) Alpha testing
IV. Semantic integrity constraints that reflects the
(b) Beta testing
business rules about data not captured in the ER
(c) Regression testing diagram.
(d) None of the above
14. Based on the cardinality ratio and
Ans : (b) Testing of software with actual data and in participation ........... associated with a
actual-environment is called Beta testing. relationship type, choose either the Foreign key
11. The student marks should not be greater than design, the cross referencing design or mutual
100. This is: referencing design.
(a) Integrity constraint (a) Entity (b) Constraints
(b) Referential constraint (c) Rules (d) Keys
(c) Over-defined constraint Ans : (b) Constraints enforce limits to the data or type
(d) Feasible constraint of data that can be inserted/updated/deleted from a
table. The whole purpose of constraints is to maintain
Ans : (a) Constraints are the condition that must be
the data integrity during an update/delete/insert into a
satisfied by all the tuples of the relation.
table.
The types of constraints are follows-
15. Data Integrity control uses................
- Key constraints
- Entity integrity constraints (a) Upper and lower limits on numeric data
(b) Passwords to prohibit unauthorized access to
- Referential integrity constraints
files
Key Constraints are the condition that must be satisfied
(c) Data dictionary to keep the data
by all the tuples of the relation.
(d) Data dictionary to find last access of data
Key constraint tells that there should be a key to
identify the unique tuple. Ans : (b) Passwords to prohibit unauthorized access to
because option (a) is defined by integrity constraints.
Entity integrity constraints tells that primary key value
And option (c) and (d) is not related to data integrity
cannot be null.
control.
Referential integrity rule 2 says that a foreign key in
table A refers to the primary key of B. Then every value 16. What does the following declaration mean? int
of foreign key in table A must be null or be available in (×ptr) [10]
table B. Create table abc(name varchar (20), marks (a) ptr is an array of pointers of 10 integers
integer check marks <= 100), It will not allow to insert (b) ptr is a pointer to an array of 10 integers
marks greater than 100. (c) ptr is an array of 10 integers
12. GO BOTTOM and SKIP-3 commands are (d) none of the above
given one after another in a database file of 30 Ans : (b) int (* ptr) [10]. means ptr is a pointer to an
records. It shifts the control to : array of 10 integers.
UGC NET JRF Computer Science Dec. 2013 Paper-II 83 YCT
 Search on TG: @apna_pdf
17. Which of the following has compilation error Ans : (d) Postfix expression = abcd + – ×
in C? ⇒ ab (c +d) – ×
(a) int n = 32 ⇒ a(b – (c + d)) ×
(b) char ch = 65 ⇒ (a × (b–(c + d)))
(c) float f = (float) 3.2 now put the values a = 5, b = 4, c = 2 d d = 5
(d) none of the above
= (8 × (4 – (2 + 5)))
Ans : (d) All are the valid declaration statement in C. = (8 × (4 – ×7)))
18. Which of the following operators cannot be = (8 × (–3))
overloaded in C++? = –24
(a) ? (b) + =
22. If the queue is implemented with a linked list,
(c) = = (d) : :
keeping track of a front pointer and a rear
Ans : (d) Following is the list of operators, which
pointer, which of these pointers will change
cannot be overloaded.
during an insertion into a non-empty queue?
(i) scope resolution operator (::) ?
(a) Neither of the pointer change
(ii) Member selection operator (.(dot), .*)
(b) Only front pointer changes
(iii) Conditional operator ? :
(c) Only rear pointer changes
(iv) Sizeof( ) operator
(d) Both of the pointers changes
These are the operators which cannot be overloaded, So
in given option :: cannot be over loaded. Ans : (c) In linked list implementation of 0 queue the
19. ................... Allows to create classed which are last inserted node is always pointed by 'rear' and first
node is always pointer by 'front'.
derived from other classes, so that they
automatically include some of its "parent's" Example :
members, plus its own members.
(a) Overloading (b) Inheritance
(c) Polymorphism (d) Encapsulation In above example, the last inserted node is 50 & it is
Ans : (b) Inheritance can be defined as the process pointed by 'rear' and the first inserted node is 10 & it is
where one class acquires the properties of another class. pointed by 'front'. The order of elements inserted is 10,
Inheritance allows to create classes which are derived 15, 22 and 50 since the insertion is done from the rear
from other classes, so that they automatically include of end in queue therefore the rear pointer will change only.
it parent's member plus it member.
23. ............... is often used prove the correctness of
20. The correct way to round off a floating number
a recursive function.
x to an integer value is
(a) Digitalization
(a) y = (int) (x + 0.5)
(b) Communitivity
(b) y = int (x + 0.5)
(c) Mathematical Induction
(c) y = (int) x + 0.5
(d) Matrix Multiplication
(d) y = (int) ((int) x+ 0.5)
Ans : (c) It is a mathematical proof technique, It is
Ans : (a) Lets take x = 10.3, so after round off it should
be 10 essentially used to prove that a property P(n) holds for
and if x = 10.5 after round off it should be 11 now all natural numbers 0, 1, 2, 3 & so on.
option (a) 10.3 + 0.5 = 10.5 ⇒ int (10.8) = 10 correct Correctness of recursive algorithms is after proven by
also 10.5 + 0.5 = 11 ⇒ int (ii) again correct mathematical induction.
(b) incorrect syntax 24. For any B-tree of minimum degree t ≥ 2, every
(c) y = (int) x + 0.5 ⇒ int (10.3) = 10 + 0.5 = int (10.5) node other than the root must have atleast
= 10 correct but int (10.5) = 10 + 0.5 = 10.5 ⇒ int ..........keys and every node can have at most
(10.5) = 10 incorrect ......... keys.
(d) int (int (10.5) + 0.5) = int (10 + 0.5) = int (10.5) = (a) t – 1, 2t + 1 (b) t + 1, 2t + 1
10 incorrect. (c) t – 1, 2t – 1 (d) t + 1, 2t – 1
21. What is the value of the postfix expression? a b Ans : (c) In B-tree every internal node other than the
c d + – × (where a = 8, b = 4, c = 2 and d = 5) root is at least half-full,
(a) –3/8 (b) –8/3 i.e. t –1 ≤ # keys ≤ 2 t – 1
(c) 24 (d) –24 t ≤ # children ≤ 2t
UGC NET JRF Computer Science Dec. 2013 Paper-II 84 YCT
 Search on TG: @apna_pdf
25. Given two sorted list of size 'm' and 'n' Ans : (c) S1 is correct & S2 is incorrect
respectively. The number of comparison • If L is regular then reversed of L is also regular,
needed in the worst case by the merge short hence U & V are regular
algorithm will be • Concatenation of regular languages are regular
(a) m × n (b) max (m, n) • Hence UV is regular
(c) min (m, n) (d) m + n –1 S1 is correct
Ans : (d) The number of comparisons needed in the • To find wwR need to remember what is w.
worst case by the merge sort algorithm will be m + n-1 • Regular grammar is checked by finite automata,
i.e. only last element will not be compare only. which has no memory (stack)
26. Given the following statements : • To find wwR we need at least NPDA
S1 : SLR uses follow information to guide reductions. S2 is incorrect.
In case of LR and LALR parsers, the look- 29. The process of assigning load addresses to the
aheads are associated with the items and they
various parts of the program and adjusting the
make use of left context available to the parser.
code and data in the program to reflect the
S2: LR grammar is a larger subclass of context free
assigned addresses is called......
grammar as compared to that SLR and LALR
(a) Symbol resolution (b) Parsing
grammars.
(c) Assembly (d) Relocation
Which of the following is true?
(a) S1 is not correct and S2 is not correct Ans : (d) Relocation is the process of replacing
symbolic references or names of libraries with actual
(b) S1 is not correct and S2 is correct
usable address in memory before running a program.
(c) S1 is correct and S2 is not correct
• It is typically done by the linker during compilation
(d) S1 is correct and S2 is correct
It can be done at runtime by a relocating loaded
Ans : (d) S1 is correct & S2 is correct.
Compilers or assemblers typically generate the
SLR parser uses the follow information to construct the executable with zero as the lower most starting address.
SLR parser table. LR and LALR uses the look-ahead Before the execution of object code, these address
symbols to generate the parse table-LR is powerful than should be adjusted so that they denote the correct
SLR and LALR. Therefore, LR will be able to
runtime address.
recognize large class of CFG than the SLR and LALR.
30. Which of the following derivations does a top–
27. The context free grammar for the language L =
down parser use while parsing an input string?
{am bm / n ≤ m + 3, n ≥ o, m ≥ o} is The input is scanned from left to right.
(a) S → aaa A; A → aAB / B, B → Bb/ λ (a) Leftmost derivation
(b) S → aaaA/λA → aAb/ B, B → Bb/λ (b) Leftmost derivation traced out in reverse
(c) S → aaaA/aaA / λA → aAb/ B, B → Bb λ (c) Rightmost derivation traced out in reverse
(d) S → aaaA/aaA / aA/ λA → aAb/ B, B → Bb/ (d) Rightmost derivation
λ Ans : (a) Top – down parser – leftmost derivation
n m
Ans : (b) L = {a b | n ≤ m + 3; n ≥ 0, m ≥ 0} bottom up parser – reverse of rightmost derivation
The grammar will be, A top down parser is called LL parser because it parser
the input from left to right and constructs a leftmost
S → aaaA | λ
derivation.
A → aAb | B 31. The dual of a Boolean expression is obtained by
B → Bb | λ interchanging
28. Given the following statements : (a) Boolean sums and Boolean products
(b) Boolean sums and Boolean products or
S1 : If L is a regular language then the language
interchanging 0's and 1's
∈L, v∈
{uv|u∈ ∈LR} is also regular.
(c) Boolean sums and Boolen products and
S2 : L = {wwR} is regular language. interchanging 0's & 1's
Which of the following is true? (d) Interchanging 0's and 1's
(a) S1 is not correct and S2 is not correct
Ans : (c) The dual of a boolean expression is obtained
(b) S1 is not correct and S2 is correct
by interchanging boolean sums and boolean products as
(c) S1 is correct and S2 is not correct
well as interchanging 0's as well as 1's.
(d) S1 is correct and S2 is correct

UGC NET JRF Computer Science Dec. 2013 Paper-II 85 YCT

 Search on TG: @apna_pdf
32. Given that (292)10 = (1204)x in some number 36. How many edges are there in a forest of t-trees
system x. The base x of that number system is : containing a total of n-vertices?
(a) 2 (b) 8 (a) n + t (b) n – t
(c) 10 (d) None of these (c) n * t (d) nt
Ans : (d) (292)10 = (1204)x Ans : (b) In each tree we have K–1 edge for K vertices,
2 × 102 + 9 × 10 + 2 = x3 + 2 × x2 + 0 + 4 so, for t trees with total n vertices (all trees are
200 + 90 + 2 = x3 + 2x2 + 4 disconnected in a forest) we would have n – t edges
x3 + 2x2 – 288 = 0 37. Let f and g be the functions from the set of
Solution for x= 6
integers to the set integers defined by
none of the option satisfy the solution.
f(x) = 2x + 3 and g (x) = 3x + 2
33. The sum products expansion for the function
Then the composition of f and g and g and f is
F(x, y, z) = (x + y)z is given as given as
(a) xyz + xyz + xyz (b) xyz + xyz + xyz (a) 6x + 7, 6x + 11
(c) xyz + xyz + xyz (d) xyz + xyz + xyz (b) 6x + 11, 6x + 7
Ans : (d) Use boolean identities to expand the product (c) 5x + 5, 5x + 5
and simplify: (d) None of these
f = (x + y) z' Ans : (a) Given f (x) = 2 x + 3
= xz' + yz' g(x) = 3x + 2
= xz' (1) + yz' (1) (fog) (x) = f (g(x))
= xz' (y + y') + yz' (x + x') f(g(x)) = f (3x + 2) = 2 (3x + 2) + 3 = 6x + 7
= xyz' + xy'z' + xyz' + x'yz' (gof) (x) = g (f(x))
= xyz' + xy'z' + xyz' g(f(x)) = g (2 x + 3) = 3 (2x + 3) + 2 = 6x + 11
34. Let P (m, n) be the statement "m divides n" 38. If n and r are non-negative integers and n ≥ r,
where the universe of discourse for both the
then p (n + 1, r) equals to:
variables is the set of positive integers.
Determine the truth values of each of the P(n, r )(n + 1) P(n, r )(n + 1)
(a) (b)
following propositions: (n + 1 − r ) (n −1 + r )
(i) ∀m ∀n P (m, n) P(n, r )(n + 1) P(n, r )(n + 1)
(ii) ∃m ∀n P (m, n) (c) (d)
(n + 1 − r ) (n + 1 + r )
(a) Both (i) and (ii) are true
(b) Both (i) and (ii) are false n!
Ans : (a) P(n, r ) =
(c) (i) false & (ii) true (n − r )!
(d) (i) true & (ii) false (n + 1)! (n + 1) × n !
P(n + 1, r ) = =
Ans : (c) P (3, 2) is True because 3 does not divides 2. (n + 1 − r )! (n + 1 − r ) × (n − r )!
So only II statement is true.
(n + 1)
35. Big – O estimate for f (x) = (x) + 1) log (x2 + 1) = × P (n, r )
(n + 1 − r )
+ 3x2 is given as
(a) O (x log x) (b) O (x2) 39. A graph is non-planar if and only if it contains
3 2
(c) O (x ) (d) O (x log x) a sub graph homomorphism to :
Ans : (b) Big O notation of f(x)= (x + 1) log (x2 + 1) + (a) K3, 2 or K5
3x2 (b) K3, 3 and K6
Note. (x + 1)is. O(x) and x 2 + 1.d ≤ .2 x 2 . When x > 1 (c) K3, 3 or K5
So, (d) K2, 3 and K5
log .x 2 + 1< d = log(2 x 2 ) = log .2 + log x 2 = log 2 + 2 log x ≤ 3log x if x 2 . Ans : (c) According to Kuratowski's theorem a finite
2
Thus, log.x + 1. is O ( x log x) graph is planer is and only if it does not contain a sub
graph that is a sub division of K5(the complete graph on
Also, 3x 2 . is O ( x 2 )
5 vertices) or of K3,3 (complete bipartite graph on six
So, f(x) is O (max ( x log x, x 2 )) = O.( x 2 ) as vertices, three of which connect to each of the other
x ≤ x 2 log x for x. three, also known as utility graph)

UGC NET JRF Computer Science Dec. 2013 Paper-II 86 YCT

 Search on TG: @apna_pdf
40. Which of the following statements are ture? Wireless data gram protocol is protocol in WAP
(i) A circuit that adds two bits, producing a sum architecture, covers the transport layer, protocol in the
bit and carry bit is called half adder. internet model 8 UDP is used for wireless Datagram
(ii) A circuit that adds two bits, producing a sum protocol, so it satisfies (iv)
bit and a carry bit is called full adder. wireless is a internet protocol (IP)
(iii) A circuit that adds two bits and a carry bit 43. Which of the following is widely used inside the
producing a sum bit and carry bit is called
full adder telephone system for long-haul data traffic?
(iv) A device that accepts that value of a Boolean (a) ISDN
variable as input and produces its (b) ATM
complements is called an inverter (c) Frame Relay
(a) (i) & (ii) (b) (ii) & (iii) (d) ISTN
(c) (i), (ii), (iii) (d) (i), (iii) & (iv)
Ans : (b) ATM is a core protocol used over the
Ans : (d) (i) A circuit that adds two bits, producing a sonet/SDH backbone of the public switched telephone
sum bit carry bit is caused half adder.
network and ISDN.
(iii) A circuit that adds two bits and a carry bit
producing a sum bit and carry bit is called full adder. 44. The document standards for EDI were first
(iv) A device that accepts the value of a Boolean developed by large business house during the
variable as input and produces its complement is called 1970s and are now under the control of the
an inverter. following standard organization :
41. Active X controls are Pentium binary (a) ISO
programs that can be embedded in ........... (b) ANSI
(a) Word pages (c) ITU-T
(b) URL pages (d) IEEE
(c) Script pages
Ans : (b) EDI service provides maintain a VAN and
(d) Web pages
establishes mail boxes for each business partner
Ans : (d) Active X control are Pentium binary programs involved in EDI. The provider stores and forwards EDI
that can be embedded in Web pages.
message between the partners. The main aspect here is
42. Match the following : standardization. All the parties involved in EDI
List-I List-II transaction must use an agreed set of document layout
A. Wireless Application 1. HTTP standards. The document stores for EDI were developed
Environment by large business houses during the 1970's and are now
B. Wireless Transaction 2. IP under the control of the American national standard
Protocol institute (ANSI)
C. Wireless Datagram 3. Scripts 45. Electronic Data Interchange Software consists
Protocol
of the following four layers :
D. Wireless 4. UDP
(a) Business application, Internal format
A B C D
conversion, Network translator, EDI
(a) 2 4 1 3
envelope
(b) 4 3 2 1
(c) 4 3 1 2 (b) Business application, Internal format
(d) 3 1 4 2 conversion, EDI translator, EDI envelope
Ans : (d) Wireless application environment provides an (c) Application layer, Transport layer, EDI
architecture for communication between wireless translator, EDI envelope
devices and web servers and full application can be (d) Application layer, Transport layer, IP layer,
made using scripts –(iii) EDI envelope
Wireless transaction protocol is a standard used in Ans : (b) EDI consist of four layers : Business
mobile telephony and HTTP is used for wireless application, internal format conversion, EDI translator,
transaction protocol so it satisfies–(i) EDI envelope
UGC NET JRF Computer Science Dec. 2013 Paper-II 87 YCT
 Search on TG: @apna_pdf
The page size is 4 KB. The minimum size of
TLB tag is :
(a) 12 bits (b) 15 bits
(c) 16 bits (d) 20 bits
Ans : (c) Page size of 4 KB, so offset bits are 12 bits.
Remaining bits of virtual address 32 – 12 = 20 bits will
be used for indexing.
Number of sets = 64/4 = 16 (4 – war set) ⇒ 4 bits
So tag bits = 20 – 4 = 16 bits
46. Consider a pre-emptive priority based 48. Consider a disk queue with request for
scheduling algorithm base on dynamically input/output to block on cylinders 98, 183, 37,
changing priority. Larger priority number 122, 14, 124, 65, 67 in that order. Assume that
implies higher priority. When the process is disk head is initially positioned at cylinder 53
waiting for CPU in the ready queue (but not and moving towards cylinder number 0. The
yet started execution), its priority changes at a total number of head movements using shortest
assigned priority value o when they enter ready seek time first (SSTF) and SCAN algorithms
queue. Assume that the following processes are respectively :
want to execute : Process ID Arrival Time (a) 236 and 252 cylinders
Service Time P1 0 4 P2 1 1 P3 2 2 P4 3 1. The (b) 640 and 236 cylinders
time quantum q = 1. When two processes want (c) 235 and 640 cylinders
to join ready queue simultaneously the process (d) 235 and 252 cylinders
which has not executed recently is given
Ans : No the these 236 and 252 cylinders According
priority. The finish time of processes P1, P2, P3
to SCAN 53 to 37 then to 14 then to 0 (16 + 23 + 14 =
and P4 will respectively be :
53) now direction will be reversed so 0 0 65 then to 67
(a) 4, 5 and 8 (b) 8, 2 7 and 5 then to 99, 122, 124, 183 ( 65 + 2 + 31 → 24 + 2 + 59 =
(c) 2, 5, 7 and 8 (d) 8, 2, 5 and 7 183) total head movements = 183 + 53 = 236
Ans : (b) According to SSTE 53 to 65 then to 67 then 37m 14, 98,
Following processes want to execute : 122, 124, 183 (so head movements = 12 + 2 + 30+ 23 +
Process ID Arrival time Service time 84 + 24 + 59 = 236)
P1 0 4 49. How much space will be required to store the
P2 1 1 bit map of a 1.3 GB disk with 512 bytes block
size ?
P3 2 2 (a) 332.8 KB
P4 3 1 (b) 83.6 KB
Time Priority (c) 266.2 KB
0 P1 = 1 (d) 256.6 KB
1 P2 = 1, P1 = 2 Ans : (a) 332.8 KB
2 P2 = 2, P1 = 2, P3 = 0 We need a bit for each block. Number of block = disk
3 P1 = 1, P3 = 2, P4 = 0 size/block size = 1.3 GB/ 512 MB
4 P3 = 1, P1 = 2, P4 = 4 This will give the size of bit map in bits. 70 get the byte
5 P1 = 1, P3 = 2, P4 = 2 size divide by 8 and we get 332.8 KB. For disk size, GB
Gantt chart is taken as 1024 × 1024 × 1024 bytes & KB it is 1024
bytes
0 – P1 – 1 – P2 – 2 – P1–3, – P3 – 4 – P4 – 5 – P1 – 6 –
P – 7 – P1 – 8 So answer is (a)
P1 finishes at 8 50. Linux operating system uses :
P2 finishes at 2 (a) Affinity scheduling
P3 finishes at 7 (b) Fair preemptive scheduling
P4 finishes at 5 (c) Hand shaking
So answer is (b) (d) Highest penalty ratio next
47. The virtual address generated by a CPU is 32 Ans : (b) (i) A time-sharing algorithm for fair
bits. The translation look-aside buffer (TLB) preemtive scheduling between multiple processes.
can hold total 64 page table entries and a 4-way (ii) A real-time algorithm for tasks where absolute
set associative (i.e. with 4-cache lines in the set). priorities are more important than fairness.

UGC NET JRF Computer Science Dec. 2013 Paper-II 88 YCT

 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2013

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. If the primal linear programming problem has Ans : (b) draw lines far two inequalities nothing is
unbounded solution, then it's dual problem will common in shaded area so infeasible solution.
have :
(a) feasible solution
(b) alternative solution
(c) no feasible solution at all
(d) no bounded solution at all
Ans : (c) If the primal problem is feasible, but
unbounded in the direction of optimization, then the
dual has no feasible solution otherwise, if the primal
problem has an optimal solution, then dual will also
have an optimal solution.
2. Given the problem to maximize 3 x1 - x2 + 3 ≤ 0
f ( x), X = ( x1 , x2 ,.....xn ) x1 - x2 ≥ 0
subject to m number of inequality constraints. 4. Given a flow graph with 10 nodes. 13 edges and
g , ( x) ≤ bi , i =1, 2, ..... m one connected components, the number of
including the non-negativity constraints x ≥ 0. regions and the number of predicate (decision)
Which of the following conditions is a Kuhn- nodes in the flow graph will be
Tucker necessary condition for a local maxima (a) 4, 5 (b) 5, 4
at x ? (c) 3, 1 (d) 13, 8
∂L ( X , λ, S ) Ans : (b) 5, 4
(a) = 0, j =1, 2, ..... m Predicate (decision) nodes are those nodes which has
∂x j
out degree at least 2.
(b) λ i [ g i ( X ) − bi ] = 0, i =1, 2,.... m Region (2) 13 – 10 + 12 = 5 [i.e. edges – vertex + (P +
(c) g i ( X ) ≤ bi , i = 0, i =1, 2,.... m 1)] since P = 1
(d) All of the above Predicate nodes (P) = region = P + 1 = 5
P=4
Ans : (d) Kuhn-Tucker necessary conditions:
The necessary conditions for a local maxima or 5. Function points can be calculated by :
stationary point(s) at x are. (a) UFP * CAF
δL (b) UFP * FAC
(i) = ( x , λ, δ ) = 0, j =1, 2,.... n
δx j (c) UFP * Cost
(d) UFP * Productivity
(ii) λ i [ g i , ( x ) − bi ] = 0
Ans : (a) UFP * CAF
(iii) g i , ( x ) ≤ bi Function points = UFP * CAF
(iv) λ i ≥ 0, i =1, 2,.... m where UFP = unadjusted function points
3. The following linear programming problem CAF = complexity adjustment factor
has Max Z = x1 + x2 6. Match the following :
Subject to x1 – x2 ≥ 0 List-I List-II
3x1 – x2 ≤ – 3 A. Data 1. Module A and Module
and x1 , x2 ≥ 0 coupling B have shared data
(a) Feasible solution B. Stamp 2. Dependency between
(b) No feasible solution coupling modules is based on the
(c) Unbounded solution fact they communicate
(d) single point as solution by only passing of data
UGC NET JRF Computer Science Dec. 2013 Paper-III 89 YCT
 Search on TG: @apna_pdf
C. Common 3. When complete data Ans : (b) Both are black box testing techniques as we
coupling structure is passed from only test at boundaries and at certain points.
one module to another Dividing the test input data into a range of values and
D. Content 4. When the control is selecting one input from each range is called
coupling passed from one Equivalence partition. It is not explore combination of
module to the middle of input circumstances.
another 9. Which once of the following is not a software
A B C D myth?
(a) 3 2 1 4
(a) Once we write the program and get it to
(b) 2 3 1 4 work, our job is done
(c) 2 3 4 1 (b) Project requirements continually change, but
(d) 3 2 4 1 change can be easily accommodated because
Ans : (b) software is flexible
(a) Data coupling is the depends between modules is (c) If we get behind schedule, we can add more
based on the fact they can communicate by only passing programmers and catch up
of data, so it satisfies (2) (d) If an organization does not understand how to
(b) Stamp coupling is when compute data structure is control software projects internally, it will
passed from one module to another is the stamp
invariably struggle when it outsourcers
coupling so it satisfies (3)
software projects
(c) Common coupling is a two modules that have shared
a data, so it satisfies (1) Ans : (d) Software myth is all people who come in
(d) Content coupling is when the control is passed from contact with software may suffer from various myths
one module to the middle of another so it satisfies (4) associated with developing and using software,
Management myths, customer myths, programmer
7. A process which defines a series of tasks that
myths, are the few common myths,
have the following four primary objectives is Here in question (a), (b), (c) are myths (programmer &
known as
managements myths).
(1) to identity all items that collectively define
the software configuration 10. Match the following with respect to
(2) to manage change to one or more of these relationship between objects and classes :
items List-I List-II
(3) to facilitate the construction of different A. State 1. Useful for both abstract
versions of an application. diagram modeling and for
(4) to ensure that software quality is designing actual
maintained as the configuration evolves program
over time.
B. Object 2. Describes object classes
(a) Software quality management process
diagram
(b) Software configuration management process
(c) Software version management process C. Class 3. Useful for documenting
(d) Software change management process diagram test cases
Ans : (b) Software configuration management process D. Instance 4. Describing the behavior
has following primary objective : diagram of a single class of
1. to identify all item that collectively define the objects
software configuration A B C D
2. to manage changes to one or more of those item (a) 4 1 2 3
3. to facilitate the construction of different version of an (b) 2 3 4 1
application (c) 3 4 2 1
4. to ensure that software quality is maintained as the (d) 2 4 1 3
configuration evolves over time. Ans : (a)
8. One weakness of boundary value analysis and (a) State diagram is a type of diagram used in computer
equivalence partitioning is : science and related fields to describe the behavior of
(a) they are not effective systems. State diagrams require that the system
(b) they do not explore combinations of input described is composed of a finite number of states. So it
circumstances satisfies (4)
(c) they explore combinations of input (b) Object diagram are derived from class diagram so
circumstances object diagram are dependent upon class diagrams
(d) none of the above object diagram represent an instance of a class diagram
UGC NET JRF Computer Science Dec. 2013 Paper-III 90 YCT
 Search on TG: @apna_pdf
also represent the static view of a system but this static initial focus of SOAP is remote procedure calls (RPC)
view is a snapshot of the system at a particular moment. transported via HTTP.
(c) Class diagram is united modeling language (UML) 13. The document that is used by SSLT to indicate,
is a type of static structure diagram that describes the how to transform the elements of the XML
structure of a system. So it satisfies (2) document to another format is:
(d) Instance diagram is a part of the unified modeling (a) HTML page
language that one does not mentioned too after the basic (b) DOC type procedure
idea is to make a static snap shot of instance in your (c) Style sheet
system.
(d) Stored procedure
11. Match the following style rules for reusability : Ans : (c) Under XSLT, A XLST stylesheet is used to
List-I List-II describe transformation rules in XML format. This is
A. Keep 1. Write a method to get read by an application called an "XSLT Processor",
methods the last element of a list transforming a designated XML document. The
transformation results are output in XML, HTML or
coherent
text format.
B. Keep 2. Maintain parallel
14. Which of the following concepts means adding
methods structure when possible
small new concepts to a program as it runs ?
(a) Data hiding (b) Dynamic loading
C. Keep 3. Breaking a method into
(c) Dynamic typing (d) Dynamic binding
methods smaller parts
consistent Ans : ( b ) Dynamic loading is a mechanism by which a
computer program can, at run time, load a library into
D. Provide 4. Performs a single memory. Retrieve the addresses of functions &
uniform function or a group of variables contained in the library, execute those
coverage closely related function or access those values & unload the library
functions from memory.
A B C D In oops dynamic binding reasons to linking a procedure
(a) 4 2 3 1 call to the code that will executed only at run time. The
(b) 2 1 4 3 code associated with the procedure is not known until
(c) 3 4 2 1 the program is executed, which is also known as late
(d) 2 3 4 1 binding.
Ans : (a) 15. Which of the following correctly descries
(a) Keep methods coherent to perform a single function overloading of functions?
or a group of a closely related functions, so it satisfies (a) Virtual polymorphism
(4) (b) Transient polymorphism
(b) Keep method small is breaking a method into (c) Ad-hoc polymorphism
smaller parts so it satisfies (3) (d) Pseudo polymorphism
(c) Keep methods consistent to maintain parallel Ans : (c) Ad – hoc polymorphism allows function with
structure when possible. So it satisfies (2) same name act differently for each type
(d) Provide uniform coverage to write a method to get In programming language, ad hoc polymorphism is a
the last element of a list, so it satisfies (1) kind of polymorphism in which functions can be
applied to arguments of different types, because a
12. Which is the protocol for performing RPCs polymorphic function can denote a number of distinct &
between applications in a language and system potentially heterogeneous implementation depending on
independent way? the type of arguments (s) to which it is applied.
(a) Hyper Text Transmission Protocol (HTTP) 16. Match the following with respect to
(b) Simple Network Management Protocol programming languages :
(SNMP)
List-I List-II
(c) Simple Object Access Protocol (SOAP)
A. Structured 1. JAVA
(d) Simple Mail Transfer Protocol (SMTP)
Language
Ans : (c) SOAP is an acronym for simple object access B. Non-Structured 2. BASIC
protocol. It is an XML based messaging protocol for Language
exchanging information among computers. SOAP is an
C. Object Oriented 3. PASCAL
application of the XML Specification.
Programming
Although SOAP can be used in a variety of messaging Language
system & can be delivered via a transport protocols, the
UGC NET JRF Computer Science Dec. 2013 Paper-III 91 YCT
 Search on TG: @apna_pdf
D. Interpreted 4. FORTRAN B. Unification 2. The entire
Programming conjunctive goal is
Language executed
A B C D C. Deep 3. Previous sub goal to
(a) 3 4 1 2 backtracking find alternative
solutions
(b) 4 3 2 1
(c) 2 4 1 3 D. Shallow 4. Chooses sub goal
backtracking with possible unifier
(d) 2 3 4 1
A B C D
Ans : (a) PASCAL - is a structured language
(a) 4 1 2 3
FORTRAN - is a non-structured language
(b) 2 4 1 3
JAVA - is an object oriented language
(c) 3 1 4 2
BASIC - is interpreted programming language.
(d) 2 3 4 1
17. The compiler converts all operands upto the
Ans : (a)
type of the largest operand is called
(a) Forward movement is choose a rule by remember
(a) Type Promotion (b) Type Evaluation the position of the matched rule, so it satisfies (4)
(c) Type Conversion (d) Type Declaration (b) Unification is a process of matching or finding the
Ans : (a) When constant and variable of different types most general unifier. So it satisfies (1)
are mixed in an expression, they are all converted to the (c) Deep back tracking is a previous sub goal to find
same type. The compiler converts all operands up to the alternative solutions, so it satisfies (2)
type of the largest operand, which is called type
(d) Shadow backtracking is the entire conjunctive goal's
promotion.
execution (3)
18. C++ actually supports the following two
21. Given the following statements:
complete dynamic systems :
(a) One defined by C++ and the other not defined S1 : The grammars S → aSb|bSa|SS| a and
by C S → aSb|bSa|a are not equivalent.
(b) One defined by C and one specific to C ++ S2: The grammars S → SS|SSS|aSb|bSa|λ λ
(c) Both are specific to C++ and S → SS|aSb|bSa|λ λ are equivalent.
(d) Both of them are improvements of C Which of the following is ture?
Ans : (b) C++ actually supports two complete dynamic (a) S1 is correct and S2 is not correct
allocation system: the one defined by C and the one (b) Both S1 and S2 are correct
specific to C++. The system specific to C++. contain (c) S1 is not correct and S2 is correct
several improvements over that. (d) Both S1 and S2 are not correct
19. Important advantage of using new and delete Ans : (b) S1: Given grammars are
operators in C++ is : G1 : S → aSb|bSa|SS| a
(a) Allocation of memory and G2 : S → aSb|bSa|a
(b) Frees the memory previously allocated Grammar G1 can generate string w = aa, but
(c) Initialization of memory easily Grammar G2 can not generate this string.
(d) Allocation of memory and frees the memory So, G1 and G2 are not equivalent.
previously allocated S2: Given grammar are
Ans : (d) C++ supports dynamic allocation and G3 : S → SS|SSS|aSb|bSa|λ
deallocation of objects using the new and delete
and G4 : S → SS|aSb|bSa|λ
operators. These operators allocate memory for objects
from a pool called the free-store. The new operator calls Both grammar G3 and G4 are generating set of
the special function operator 'new' and the delete all string with equal number of a's and b's.
operator calls the special function operator! "delete". 22. What are the final values of Q1 and Q0 after 4
20. Match the following control strategies of clock cycles, if initial values are 00 in the
prolog– sequential circuit shown below:
List-I List-II
A. Forward 1. Variable can be done
movement with a constant,
another variable or a
function
UGC NET JRF Computer Science Dec. 2013 Paper-III 92 YCT
 Search on TG: @apna_pdf
(a) 11 (b) 10 26. The mean-end analysis process centers around
(c) 01 (d) 00 the detection of differences between the current
Ans : (d) For T-flip-flop state and goal state. Once such a difference is
isolated, an operator that can reduce the
difference must be found. But perhaps that
T Q+ operator cannot be applied to the current state.
0 Q So a sub-problem of getting to a state in which
1 it can be applied is set up. The kind of
Q
backward chaining in which operators are
Initial: 11 state Q0 changed to 1 because T is 1 and selected and then sub goals are set up to
previous state was 0 and state Q1 changed to 1 because establish the precondition of operators is called
input T is 1 and previous state was 0. (a) backward planning
Similarly, (b) goal stack planning
Clock 2: 01 (c) operator subgoaling
Clock 3: 10 (d) operator overloading
Clock 4: 00 Ans : (c) A computer probem-solving method in which
23. High level knowledge which relates to the use the inability of the computer to take the desired next
of sentences in different context and how the step at any point in the problem solving process leads to
a subgoal of making that step feasible.
context affect the meaning of the sentences?
(a) Morphological (b) Syntactic 27. In alpha-beta pruning, ................ is used to cut
(c) Semantic (d) Pragmatic off the search at maximizing level only and
Ans : (d) Syntactic: relating to the structure of ......... is used to cut off the search at minimizing
level only.
statement or elements in a computer language.
(a) alpha, beta (b) beta, alpha
Semantic: of words and language connected with
(c) alpha, alpha (d) beta, beta
meaning.
Progmatics: is the third general area of language Ans : (b) Alpha beta prunning is a search algorithm
that seeks to decrease the number of nodes that are
description, refering to practical aspects of how
evaluated by the minimum algorithm in its search tree.
constructs and features of language may be used to Let's define the parameters Alpha and beta-
achieve various objectives. Alpha- is the best value that the maximizer currently
24. The objective of .............. procedure is to can guarantee at that level or above.
discover at least one ............. that cause twoBeta- is the best value that the minimizer currently can
literals to match. guarantee at the level or above. So answer is (b)
(a) unification, validation 28. If A and B are two fuzzy sets with membership
(b) unification, substitution functions
(c) Substitution, unification µA (x) = {0.2, 0.5, 0.6, 0.1, 0.9}
(d) minimum, maximum µB (x) = {0.2, 0.5, 0.6, 0.7, 0.8}
Ans : (b) In propositional logic unification algo need Then the value of µA ∩ B will be
one or more substitution that cause two literals like P & (a) {0.2, 0.5, 0.6, 0.7, 0.9}
~p to match so that they cancel out each other. (b) {0.2, 0.5, 0.2, 0.1, 0.8}
25. If h * represent an estimate of the cost of (c) {0.1, 0.5, 0.6, 0.1, 0.8}
(d) {0.1, 0.5, 0.2, 0.1, 0.8}
getting from the current node N to the goal
node and h represents actual cost of getting Ans : (d) Intersection of two fuzzy sets-
from the current node the goal node, then A * µA( x) ∩µB ( x) = µA( x) ∧ µB ( x) = min (µA( x), µB( x))
algorithm gives an optimal solution if µA( x) = {0.2, 0.5, 0.6, 0.1, 0.9}
(a) h * is equal to h µB( x) = {0.1, 0.5, 0.2, 0.7,0.8}
(b) h * overestimates h
µA ∩ B ( x) = {0.1, 0.5, 0.2,0.1, 0.8}
(c) h * underestimates h
(d) None of these 29. The height h(A) of a fuzzy set A is defined as
Ans : (c) Rule is algorithm gives an optimal solution if h(A) = sup A(x)
h * never over estimates h ( admissible heuristics) so b x∈A
is out. Then the fuzzy set A is called normal when
Underestimating h means algo is looking better solution (a) h(A) =0 (b) h(A) < 0
which may be found if these are optimal solution. (c) h(A) = 1 (d) h(A) < 1

UGC NET JRF Computer Science Dec. 2013 Paper-III 93 YCT

 Search on TG: @apna_pdf
Ans : (c) The height of a fuzzy set is the highest 33. The message 11001001 is to be transmitted
membership value of the membership function: using the CRC polynomial x3 + 1 to protect it
Height (A) = max µA( xi ) from errors. The message that should be
A fuzzy set with height 1 is called a normal fuzzy set. transmitted is :
In contrast, a fuzzy set whose height is less than 1 is (a) 110010011001 (b) 11001001
called a subnormal fuzzy set. So, according to the above (c) 110010011001001 (d) 11001001011
rule, the fuzzy set A is called normal when h(A) = 1 Ans : (d) As given polynomial is x3 + 1 ⇒ 1001 with
30. An artificial neuron receives n inputs x1, x2 this directly we can say option d because we add 3 digits
............., xn with weights w1, w2, ............ wn more for the data and this satisfied only by option d.
attached to the input links. The weighted sum But general solution could be
......... is computed to be passed on to a non- 1001 11001001000 (1100.011
linear filter ϕ called activation function to
release the output. 1001
(a) ∑ wi (b) ∑ xi 01011
(c) ∑ wi + ∑ xi (d) ∑ wi ⋅ xi 1001
Ans : (d) Weighted sum is calculated by multiplying 00100
inputs with their respective weights and then adding
0000
then all. Which can be shown as σ wi . xi.
31. Consider the formula in image processing 01000
1 10001
RD = 1-
CR 0001100
n1 1001
where CR =
n2 01010
CR is called as compression ratio n1 and n2 1001
denotes the number of information carrying 0011
units in two datasets that represent the same
information. In this situation RD is called as 34. .................. comparisons are necessary in the
relative ..................of the first data set. worst case to find both the maximum and
(a) Data Compression minimum of n numbers.
(b) Data Redundancy (a) 2n – 2
(c) Data Relation (b) n + floor lg n) – 2
(d) Data Representation  3n 
(c) floor   – 2
Ans : (b) Data redundancies is the repetition of data.  2 
Data redundancy is an common issue in computer data
(d) 2 lg n – 2
storage and database system. Data redundancies in
database means that some data fields are repeated in the Ans : (c) floor (3n/2) – 2 comparisons are necessary in
database. the worst case to find both the maximum and minimum
of n numbers.
32. Find the false statement :
35. Let A and B be two n×n matrices. The
(a) In Modern Cryptography, symmetric key
algorithms use same key both for Encryption efficient algorithm to multiply the two matrices
and Decryption. has the time complexity
(b) The symmetric cipher DES (Data Encryption (a) O (n3) (b) O (n2.81)
Standard) was widely used in the industry for (c) O (n2.67) (d) O (n2)
security product. Ans : (b) The efficient algorithm to multiply the two
(c) The AES (Advanced Encryption Standard) matrices has the complexity O (n2.81) using stressonr's
cryptosystem allows variable key lengths of algorithm.
size 56 bits and 124 bits.
n
(d) Public key algorithms use two different keys 36. The recurrence relation T (n) = mT   + n2 is
for Encryption and Decryption. 2
satisfied by
Ans : (c) The AES (Advanced Encryption Standard)
Cryptosystem allows variable key length of size 128 (a) O (n2) (b) O (n1gm)
2
bits, 192 bits & 256 bits & 56 bit is used DES. (c) O (n lg n) (d) O (n lg n)

UGC NET JRF Computer Science Dec. 2013 Paper-III 94 YCT

 Search on TG: @apna_pdf
Ans: (b) T (n) = mT (n/2) + n2 Ans: (d) Clique– A clique is a subset of vertices of a
now according to master theorem a = m, b = 2 & f(n) = graph such that every two distinct vertices are adjacent
log2 (Every two vertices adjacent means a complete sub
n log2m > f(n) for all m > 4 [using case – 1 : master graph)
theorem] Minimal vertex cover– A minimal vertex cover of a
so solution is O (n log2 m) graph is set of minimum vertices such that each edge of
37. The longest common subsequence of the a graph is incident to at least one vertex of set.
sequences X = < A, B, C, B, D, A, B > and Y = < 40. Pumping lemma for context-free languages
B, D, C, A, B, A > has length states: Let L be an infinite context free
(a) 2 (b) 3 language. Then there exists some positive
(c) 4 (d) 5 integer m such that any w ∈ L with w ≥m
Ans : (c) can be decomposed as w = uv.xy Z with vxy 
........... and vy
................. such that UVZ xyz
S1: ABCBDAB S2 : BDCABA LCSRe cursive LCSTable
Z∈ ∈ L for all z& = 0, 1, 2........
def LCS(S1, S2, x, 4): (a) ≤ m, ≤ 1 (b) ≤ m, ≥ 1
if (x = –1) or (4 = –1) (c) ≥ m, ≤ 1 (d) ≥ m, ≥ 1
return 0 Ans : (b) Let L be an infinite context free language.
else if (SI 1 × 1 = S2 y) The there is some positive integer m such that, if S is
return 1 + LCS (S1, S2, X –1, y – 1) string of L of length at least m, then
else return max (LCS (S1, S2, x – 1, y) LCS (S1, S2, x, S = uvwxy (for some u, v, w, x, y)
y – 1)) vw ×≤ m
Sequence BAAB vx1≥
uvwxy ∈ L
for all negative of i.
41. The Greibach normal form grammar for the
language L = { an bn +1  n ≥ o} is :
(a) S → a SB, B → bB λ
(b) S → a SB, B → bBb
(c) S → a SB, B → b
(d) S → a Sbb
38. Assuming there are n keys and each key is in Ans : (c) Option (a) & option (b) can't able to generate
the range [0, m – 1]. The run time of bucket any string because there is no terminal string present for S.
sort is Option (c) can generate all required string (b, abb,
(a) O (n) (b) O (n lgn) aabbb....)
(c) O (n lgm) (d) O (n + m) 42. Given the following statements :
Ans : (d) Assuming there are n keys one each key is in S1: Every context-sensitive language L is
the range (O, m –1). The run time of bucket sort is O(n). recursive.
Bucket – sort (A) S2: There exists a recursive language that is
1. n ← length [A] not context sensitive.
2. for i = 1 to n do Which statement is correct?
3. insert A [i] into list B [n A[i]] (a) S1 is not correct and S2 is not correct
4. for i = O to n –1 do (b) S1 is not correct and S2 is correct
5. Sort list B with insertion sort (c) S1 is correct and S2 is not correct
6. Concatenate the lists B [0], B[1], B[n – 1] together in (d) S1 is correct and S2 is correct
order and their run time is O (n + m) Ans : (d) S1 is correct : the set of all turing machines is
39. A.................. complete subgraph and a ............... constable.
subset of vertices of a graph G = (V, E) are a S1 is also true : L2 – L1 = L2 n L'1, since L1 is
clique and a vertex cover respectively. recursive L'1 is also recursive and hence i.e. also and
(a) minimal, maximal finally r.e. languages are closed under section.
(b) minimal, minimal 43. What is the bit rate for transmitting
(c) maximal, maximal uncompressed 800 × 600 pixel colour frames
(d) maximal, minimal with 8 bits/pixel at 40 frames/second?
UGC NET JRF Computer Science Dec. 2013 Paper-III 95 YCT
 Search on TG: @apna_pdf
(a) 2.4 Mbps (b) 15.36 Mbps 48. ........is a type of transmission impairment in
(c) 153.6 Mbps (d) 1536 Mbps which the signal looses strength due to the
Ans : (c) Uncompressed pixel = 800 * 600 resistance of the transmission medium
each of 8 bit = 800 * 600 * 8 (a) Attenuation (b) Distortion
Bit rate for transmitting = 800 * 600 * 8 * 40 (c) Noise (d) Decibel
= 153600000 = 153.6 Mbps Ans : (a) Attenuation is a general term that refers to
44. In IPv4, the IP address 200.200.200.200 belongs any reduction in the strength of a signal. Attenuation
to occurs with any type of signal whether digital or analog.
(a) Class A (b) Class B Some times called loss, Attenuation is a natural
(c) Class C (d) Class D consequence of signal transmission over long distance.
Ans : (c) Consider only the first octet's decimal value. 49. Match the following :
Ignore the rest. The first octet value is 200. Convert the List-I List-II
same to binary equivalent. It is 11001000. If the
converted bit equivalent has less than 8 bits, then fill its A. Indexed 1. is not used when an
left side with 0's and bring it to a count of 8 bits. The addressing operand is moved
first 3 bits are 110 here and so this IP address belongs to from memory into a
class c address. register or from a
register to memory
45. Which layer of OSI reference model is
B. Direct 2. Memory address is
responsible for decomposition of messages and
generation of sequence numbers to ensure addressing computed by adding
correct re-composition from end to end of the up two registers plus
network? an (optional) offset
(a) Physical (b) Data-link C. Register 3. Addressing memory
(c) Transport (d) Application addressing by giving a register
Ans : (c) Transport layer is the fourth layer in OSI plus a content offset
Reference model. It responds to service requests from D. Base- 4. Can only be used to
session layer & issues service request to network layer. Indexed access global variables
Transport layer is responsible for delivering message Addressing whose address is
between hosts. In transport layer, data travels in the known at compile time
form of segments. Transport layer is responsible for A B C D
creating an end to end connection between source IP (a) 2 1 4 3
and the destination IP.
(b) 2 4 1 3
46. A client-server system uses a satellite network, (c) 3 4 1 2
with the satellite at a height of 40,000 kms. (d) 3 1 4 2
What is the best-case delay in response to a
request? (Note that the speed of light in air is Ans : (c)
3,00, 000 km/second)? (a) Indexed addressing is the operand's offset is the sum
(a) 133.33 m sec (b) 266.67 m sec of the content of an index register S1 or D1 and an 8 bit
(c) 400.00 m sec (d) 533.33 m sec or 16 bit displacement, so it satisfies (3)
Ans : (d) The request has to go up & down & the (b) Direct addressing is the operand's offset is given in
response has to go up & come down. The total path the instruction as an 8 bit displacement. It this mode the
length traversed is thus 160,000 km. The speed of light 16 bit effective address of the data is the part of
in air and vacuum is 3,00,000 km/sec. instruction, so it satisfies (4)
So the propagation delay is 160,000/300,000 sec = (c) Register addressing is placed in one of 8 bit or 16 bit
533.33 m sec. general purpose register. So it satisfies (1)
47. The start and stop bits are used in serial (d) Base indexed addressing is the operand offset is sum
of the content of a base register BX or BP and an index
communication for
register S1 or D1. (2)
(a) error detection
(b) error correction 50. Which of the following is a design criteria for
(c) synchronization instruction formats?
(d) slowing down the communication (a) The size of instructions
Ans : (c) The start and stop bits are used in serial (b) The number of bits in the address fields
communication for synchronization i.e. to take the (c) The sufficient space in the instruction format
receiver data is come after me ready to accept it, and to express all the operations desired.
data is finish after me. (d) All of these
UGC NET JRF Computer Science Dec. 2013 Paper-III 96 YCT
 Search on TG: @apna_pdf
Ans: (d) Design criteria for instruction format (How to 54. The essential difference between traps and
atleast the current process or) interrupts is
1. Size of the instruction balance instruction size vs. (a) traps are asynchronous and interrupts are
Required capabilities, addressing, and inst. fetch times synchronous with the program
typically word length. (b) traps are synchronous and interrupts are
2. Include enough bits to define "All" operation allow asynchronous with the program
for future growth prouder some "unassigned" OP codes. (c) trap are synchronous and interrupts are
3. Determine any address range or size limitation of 32- asynchronous with the I/O devices
bit address by byte accesses only 4 GB of space the (d) None of these
number of RISC register defines the address field size. Ans : (b) Traps is a software interrupt or synchronous
51. Synchronization is achieved by a timing device interrupt.
called a .................... which generates a periodic Interrupt is hardware generated or synchronous interrupt
train of .......... Trap is a software driven and interrupt is hardware
(a) clock generator, clock pulse originated.
(b) master generator, clock pulse 55. Consider the following ER diagram:
(c) generator, clock DIAGRam
(d) master clock generator, clock pulse The minimum number of tables required to
Ans : (d) Synchronization is achieved by a timing represent M, N, P, R1, R2 is
device called a clock pulse generator which generates a (a) 2 (b) 3
periodic train of clock pulses. (c) 4 (d) 5
master clock generator also synchronizes all clock Ans : (b) Since R1 is many to one and participation of
52. Serial access memories are useful in M is total, M and R1 can be combined to form the table
applications where {M1 M2, M3, P1}. N is a week entity set, so it can be
(a) Data consists of numbers combined with P.
(b) Short access time is required 56. Consider the following schemas:
(c) Each stored word is processed differently Branch = (Branch-name, Assets, Branch-city)
(d) None of these Customer = (Customer-name, Bank name,
Ans : (d) Serial memories are used where data Customer city)
naturally needs to flow in and out in serial from. Borrow = (Branch-name, loan number,
customer account-number)
53. What will be the output of the following logic
Deposit = (Branch-name, Account number,
diagram?
Customer-name, Balance) Using relational
Algebra, the Query that finds customers who
have balance more than 10,000 is ............
(a) πcustomer-name (σbalance > 10000 (Deposit))
(b) σcustomer-name (σbalance > 10000 (Deposit))
(c) πcustomer-name (σbalance > 10000 (Barrow))
(d) σcustomer-name (πbalance > 10000 (Barrow))
Ans : (a) When use apply projection and use table
(a) x OR y (b) x AND y
deposit we get πcustomer-name (σbalance > 10000(Deposit))
(c) x XOR y (d) x XNOR y
57. Find the false statement :
Ans : (c) Given logic diagram is
(a) The relationship construct known as the weak
relationship type was defined by Dey, Storey
& Barron (1999).
(b) A weak relationship occurs when two
relationship types are linked by either Event-
Precedent sequence or Condition-Precedent
sequence.
(c) conceptual model is not accurate
Therefore, function f is: representation of "Universe of interest".
f = (x.y) + (x.y) = xy + xy = x ⊕ y (d) Ternary, Quaternary and Quintary
relationships are shown through a series of
f = x(XOR)y
application scenario's and vignette's.
UGC NET JRF Computer Science Dec. 2013 Paper-III 97 YCT
 Search on TG: @apna_pdf
Ans: (c) Detailed of requirement to model process using C. Composition rule 3. If X→Y and X →Z
ER modeling grammar and have implicitly assumed that then X→{Y, Z}
this process takes care of that namely conceptual model. D. Pseudo transitivity 4. If X→{Y, Z} then
The conceptual model thus developed is a true rule X→Y and X → Z
representation of the "universe of interest" being
modeled. A B C D
(a) 3 2 4 1
58. Consider the table
(b) 1 3 4 2
Student (stuid, name, course, marks). Which (c) 2 1 3 4
one of the following two queries is correct to
(d) 4 3 1 2
find the highest marks student in course 5?
Q1. Select S. stuid Ans : (d)
From student S Decomposition rule is if x → yz then x → y, x → z, is
the decomposition rule so it satisfies (4)
Where not exist
(Select * from student e where e course = '5' (b) Union rule is : if x → y, x → z then x →yz
and e marks ≥ S marks) so it satisfies (3)
Q2. Select S.stu.id (c) Composition rule is if x → y & z → w then xz
From student S →yw, so it can satisfies (1)
Where S.marks > any (d) Pseudo transivity rule can satisfy (2)
(select distinct marks from student S where 60. Match the following :
S.course = 5) List-I List-II
(a) Q1 A. Secondary Index 1. Functional
(b) Q2 Dependency
(c) Both Q1 and Q2 B. Nonprocedural 2. B-Tree
(d) Neither Q1 nor Q2 Query Language
Ans : (d) Both the queries are given not correct since, first C. Closure of set of 3. Relational Algebraic
query will not retrieve any tupple since ≥ condition is used. Attributes Operation
Second query gives stuid of students whose marks are D. Natural JOIN 4. Domain Calculus
greater than any who is student taking course 5.
A B C D
Correct queries should be as following:
(a) 1 2 4 3
Q1: Select S.stuid
(b) 2 1 4 3
From student S
(c) 1 3 4 2
where not exist (select *
(d) 2 4 1 3
From student e
Ans : (d) It is easy to observe that B-tree has secondary
where e. course = '5' and
index natural join is relational algebraic operation.
e.marks > S.marks)
Closure of set of attributes is related to functional
Q2: Select S.stuid dependency.
From student S Non procedural query language is related to domain
where S.marks ≥ All (select distinct calculus. hence answer is (d)
marks Primary index : It is an index on a set of fields that
From student S includes the unique primary key for the field and is
where S.course = '5') guaranteed not to duplicates
59. Armstrong (1974) proposed systematic Secondary index : It is an index that is not a primary
approach to derive functional dependencies. index and may have duplicates.
Match the following w.r.t. Functional 61. Which of the following is not true with respect
dependencies : to a trackball and/or spaceball?'
List-I List-II I. A trackball is a two dimensional
A. Decomposition rule 1. If X →Y and Z → positioning device while as a spaceball
W then {X, Z} provides six degrees of freedom.
→{Y,W} II. Unlike the trackball a spaceball does not
actually move.
B. Union rule 2. If X →Y and
III. A trackball is a three dimensional
{Y,W}→Z then {X, positioning device while as a spaceball
W}→Z provides six degrees of freedom.
UGC NET JRF Computer Science Dec. 2013 Paper-III 98 YCT
 Search on TG: @apna_pdf
(a) I & II (b) II & III origin and all which are less than (0.66, 0.28) will lie on
(c) II only (d) III only the same side as origin.
Ans : (d) First two statements are correct. So only point 0.5 & 0 will be lie on the same side as
origin
A space ball is a "six degrees of freedom" device. It
allows full rotation in multiple directions, such as with a 65. The transformation matrix required for
CAD model a trackball, however is merely a standard conversion of CMY colour model to RGB
mouse rather than having the base moved by the mouse colour model is given as:
platform, you manually actuate the ball. It just moves
the cursor around the libsball page has a nice image  R   C  1  R   C  1 
showing the spaceball's range and type of motion.    
(a) G  =  M  − 1   (b) G  =  M  −  2 
Trackball just does xy axis motion
 B   Y  1  B   Y   3 
62. Which of the following statement(s) is (are)
true?  R  1  C   R   C  0.5
I. Two successive translations are additive. (c) G  = 1 −  M  (d) G  =  M  − 0.5
II. Two successive rotations are additive.  B  1  Y   B   Y  0.5
III. Two successive scaling operations are Ans : (c) The RGB model is an additive model; ie. the
multiplicative. colour present in the light add to form new colours.
(a) I and II (b) I and III The CMY(Cyan-Magenta-Yellow) model is a
(c) II and III (d) All of the above subtractive model appropriate to absorption of colours.
Ans : (d) Statement II should be two successive  C  1  R 
rotations are additive  M  = 1 − G 
    
1. Since translation are just addition by translating  Y  1  B 
vector or displacement hence it is additive
2. Since rotation are done with some angles. So two 66. What steps shall be required to rotate an object
successive rotations are additive (angles will be added about the point P1 (as shown in fig. 1) and its
or subtracted) placement such that what was at P1 is now
reduced and is at P2 (as shown in fig. 2) ?
3. Scaling is done by multiplying by scaling vector so
every scaling will be multiplicative
63. Given below are three basic rules :
(I) Squash and Stretch
(II) Slow-in and Slow-out
(III) To stage the action properly I. Translate P1 to origin
II. Scale as required
These rules are applied in case of III. Rotate
(a) Rendering (b) Morphing IV. Translate to the final position P2.
(c) Animation (d) All of these (a) I, II and III (b) II, III and IV
Ans : (c) The animation were made with little or no (c) I, III and IV (d) All of the above
reference to nature out of these classes grace a new way Ans : (d)
of drawing moving human figures and animals.
The principle and rules of animation is :
(i) Timing
(ii) ARCS
(iii) Anticipation
(iv) Squash & stretch
(v) Appeal
(vi) Slow in slow out
(vii) To stage the action properly
64. Which of the following points lies on the same
side as the origin, with reference to the line 3x
+ 7y = 2?
(a) (3, 0) (b) (1, 0)
(c) (0.5, 0.5) (d) (0.5, 0)
Ans : (d) The X and Y intercept of line. 3X + 74 = 2 on
axes are (2/3,0), (0, 2/7) so all points greater than (0.66,
0.28) will lie on the other side of line with respect to
UGC NET JRF Computer Science Dec. 2013 Paper-III 99 YCT
 Search on TG: @apna_pdf
Rotation of the house about point P1, and placement Ans : (d) Kill one of the processes recovery through
such that what was at P1 is at P2. killing processes is the crudest but simplest way to
67. In Unix, how do you check that two given break a deadlock.
strings a and b are equal? Kill one of the processes in the deadlock cycle : the
(a) test $a – eq $b other processes get its resources.
(b) test $a – equal $b Choose process that can be return from the beginning.
(c) test $a = $b 72. The directory structure used in Unix file
(d) Sh – C test $ a = = $ b system is called
Ans : (c) In unix, test $ a = $b returns true if the string (a) Hierarchical directory
are same. (b) Tree structured directory
68. In windows 2000 operating system all the (c) Directed acyclic graph
processor-dependent code is isolated in a (d) Graph structured directory
dynamic link library called Ans : (c) Unix file system directory structure is a DAG
(a) NTFS file system due to presence of hard links which makes sharing of
(b) Hardware abstraction layer files & sub directories among different directories
(c) Microkernel possible
(d) Process Manager 73. Which statement is not true about process O in
Ans : (b) Hardware abstraction layer hardware
the Unix operating system?
abstraction layer is a logical division of code that serves
as an abstraction layer between computer physical (a) Process O is called init process.
hardware and its software. It provides a driven interface (b) Process O is not created by fork system call.
allowing a program to communicate with the hardware. (c) After forking process1, process O becomes
The main purpose of hardware abstraction layer is to swapper process.
conceal different hardware architectures from the OS by (d) Process O is a special process created when
providing a uniform interface to the system peripherals. system boots.
69. To place a sound into a word document, Ans : (a) Process O is called init process answer is (a)
following feature of windows is used : 74. Which of the following commands would
(a) Clip board (b) Task switching return process _id of sleep command?
(c) C Win App (d) OLE (a) Sleep 1 and echo $?
Ans : (d) (b) Sleep 1 and echo$#
• Object linking and embedding (OLE) allows (c) Sleep 1 and echo $×
embedding & linking to document & other objects. (d) Sleep 1 and echo $!
• The main objecting of OLE is to add different kinds Ans : (d) Sleep 1 & echo $!
of data to a document from different applications. $$ PID of current shell
• This creates a compound document and a master $! PID of last background command
file to which the document makes reference.
$? exit status of last command
70. Translation Look-aside Buffer (TLB) is:
$1 Name of current's command first parameter
(a) a cache-memory in which item to be $9 Name of current command's Ninth parameter
scratched is compared one-by-one with the
$@ All of current command's parameters
keys.
(b) a cache-memory in which item to be searched $* All of current command's parameters can't
is compared with all the keys simultaneously. preserving white space & quoting
(c) an associative memory in which item to be So answer is (d)
searched is compared one-by-one with the 75. Possible thread states in Windows 2000
keys. operating system include:
(d) an associative memory in which item to be (a) Ready, running and waiting
searched is compared with all the keys (b) Ready, standby, running, waiting, transition
simultaneously. and terminated
Ans : (d) Translation look aside buffer (TLB) is an (c) Ready, running, waiting, transition and
associative memory in which item is to be searched is terminated
compared with all the keys simultaneously. When the (d) Standby, running, transition and terminated
associative memory is presented with an item, the item
is compared with all keys simultaneously. If the item is Ans : (b) A thread in Windows 2000 can be in one of
found, the corresponding value field is returned. the six possible states, namely, ready, standby, running,
71. Simplest way of deadlock recovery is : waiting, transition and terminated. The standby state
and transition state are somewhat unique to Windows
(a) Roll back
2000. Other states of a thread (i.e., ready, running,
(b) Preempt resource
(c) Lock one of the processes waiting and terminated) are quite common across all the
(d) Kill one of the processes operating systems.
UGC NET JRF Computer Science Dec. 2013 Paper-III 100 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2014

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. Infrared signals can be used for short range c. Network layer iii. Process to
communication in a closed area using _______ process message
propagation. delivery
(a) ground (b) sky d. Transport layer iv. Transmission of
(c) line of sight (d) space bit stream
Ans : (c) Because, wireless communication is of three e. Application v. Formation of
types:- (1) Radio wave, (2) Micro wave, (3) Infrared Layer frames
Infrared signal are used for short range communication Codes :
in a closed area using line of sight propagation. a b c d e
2. A bridge has access to ______ address in the (a) iv v ii iii i
same network. (b) v iv i ii iii
(a) Physical (b) Network (c) i iii ii v iv
(c) Datalink (d) Application (d) i ii iv iii v
Ans : (a) Because, A function of a Bridge take place in
Ans : (a) Because, (a) Physical layer : Responsible for
the Data link layer that means it cannot read ID address
transmission of packet in the stream of bit with proper
so giving it access to the physical address of all stations
encoding method.
connected to it.
(b) Data Link Layer : Formation of frame means
3. The minimum frame length for 10 Mbps framing is done at this layer and maximum frame size is
Ethernet is ______ bytes and maximum is is 1500B.
_____ bytes.
(c) Network Layer : Door to door delivery of packet
(a) 64 & 128 (b) 128 & 1518
(d) Transport Layer : End to end delivery
(c) 1518 & 3036 (d) 64 & 1518
(e) Application Layer : Allow resources to Network
Ans : (d) The original ethernet IEEE 802.3 standard access.
define the minimum ethernet frame size as 64 bytes and
maximum as 1518 bytes. 6. A grammar G is LL(1) if and only if the
following conditions hold for two distinct
Where payload size in ethernet defined the minimum 46
bytes and maximum 1500 bytes. productions A → α | β
I. First (α) ∩ First (β) ≠ {a} where a is some
4. The bit rate of a signal is 3000 bps. If each
signal unit carries 6 bits, the baud rate of the terminal symbol of the grammar.
signal is _____. II. First (α) ∩ First (β) ≠ λ
(a) 500 baud/sec (b) 1000 baud/sec III. First (α) ∩ Follow (A) = φ if λ ∈ First (β)
(c) 3000 baud/sec (d) 18000 baud/sec (a) I and II (b) I and III
Ans : (a) Because, Bit rate = Numbers of bits per unit (c) II and III (d) I, II and III
time Ans : (d) Because, Assume S → aX | aYb
Baud rate = Number of signal element or signal units first (aX) = a
per unit time . first (aYb) = a
Here, baud rate = (1/6)th bit rate So there will 2 entries for S in terminal 'a' which
Therefore baud rate = (1/6) ∗ 3000 = 500 baud /sec violates the rule of LL(1) grammar because for every
5. Match the following : variable and for every terminal there can be at most 1
production.
List - I List – II
Hence their intersection should be φ
a. Physical layer i. Allow resources
So, first one statement is correct
to network access
Second one is true with similar reasoning as for first.
b. Datalink layer ii. Move packets
Now, third assume example
from one
destination to (1) S → aSA | ε
other (2) A → C | ε
UGC NET JRF Computer Science June 2014 Paper-II 101 YCT
 Search on TG: @apna_pdf
Now take 2) Production 10. The regular grammar for the language L =
first (c) = c {w|na (w) and nb(w) are both even, w ∈ {a, b} *}
follow (A) = follow (s) ⇒ first (A) = C, E, $ is given by :
Now the first (C) ∩ follow (A) = C (a) p → aq | br | λ, q → bs | ap
Means there will be again 2 entries for A in C place that r → as | bp, s → ar | bq, p and s
means again violation of LL(1) rules.
are initial and final states.
So first (C) ∩ follow (A) = φ is true
Hence the answer is (d). (b) p → aq | br, q → bs | ap
7. Which of the following suffices to convert an r → as | bp, s → ar | bq, p and s
arbitrary CFG to an LL(1) grammar? are initial and final states.
(a) Removing left recursion alone (c) p → aq | br | λ, q → bs | ap
(b) Removing the grammar alone r → as | bp, s → ar | bq
(c) Removing left recursion and factoring the
p is both initial and final states.
grammar
(d) None of the above (d) p → aq | br, q → bs | ap
Ans : (d) Removing left recursion and factoring from r → as | bp, s → ar | bq
the grammar do not suffice to covert an arbitrary CFG p is both initial and final states.
to LL(1) grammar.
Ans : (c) Because, This is Even − Even language.
Since, LL(1) parser is top down parser. For top-down
parsers, the grammar should be unambiguous, Number of a a's are divisible by 2 and number of b's are
deterministic and from left recursion. divisible by 2.
All the conditions must be satisfied. P → aA | bR | λ
8. A shift reduce parser suffers from Q → bS | aP
(a) shift reduce conflict only
(b) reduce reduce conflict only R → aS | ph
(c) both shift reduce conflict and reduce reduce S → aR | bQ
conflict
(d) shift handle and reduce handle conflicts ⇒ Design DFA for language.
Ans : (c) Because, A shift reduce and parses the input
text in one forward pass over the text, without backing
up (That forward direction is generally left to right
within a line, and top to bottom for multiline inputs)
9. The context free grammar for the language L =
{anbmck | k = |n − m|, n ≥ 0, m ≥ 0, k ≥ 0} is
(a) S → S1S3, S1 → aS1c | S2| λ, S2 → aS2b|λ,
S3 → aS3b| S4 | λ, S4 → bS4c|λ Convert DFA to CFG
(b) S → S1S3, S1 → aS1S2c | λ, S2 → aS2b|λ,
Hence option (c) is correct.
S3 → aS3b| S4 | λ, S4 → bS4c|λ
(c) S → S1|S2, S1 → aS1S2c | λ, S2 → aS2b | λ, 11. KPA in CMM stands for
S3 → aS3b | S4 | λ, S4 → bS4c|λ (a) Key Process Area
(d) S → S1 | S3, S1 → aS1c |S2 | λ, S2 → aS2b | λ, (b) Key Product Area
S3 → aS3b | S4 | λ, S4 → bS4c|λ (c) Key Principal Area
Ans : (d) Because, Elimination Method (d) Key Performance Area
(1) S → S1S3 → aS1c aS3b Ans : (a) Because, Key Process Area (KPA) used in
→ ac ab CMM identifies a cluster of related activities that, when
(which will not be generated by the Language.) performed collectively, achieve a set of goals
(2) S → S1S3 → aS1S2c aS3b considered important.
→ ac ab (same case as above) 12. Which one of the following is not a risk
(3) S → S1S2, S → S1 → aS1S2c management technique for managing the risk
aS1S2c → aaS1S2cS2c due to unrealistic schedules and budgets?
→ aaS2cS2c (a) Detailed multi source cost and schedule
→ aa ca S2 bc estimation.
→ aa ca bc (b) Design cost
(Which cannot be generated) (c) Incremental development
Hence the answer is (d). (d) Information hiding
UGC NET JRF Computer Science June 2014 Paper-II 102 YCT
 Search on TG: @apna_pdf
Ans : (d) Because, Risk management is the Process of 16. How many different truth tables of the
identifying, controlling threats to an organization's compound propositions are there that involve
capital and earning. Risk management can be the propositions p & q?
considered as dealing with the possibility and actual (a) 2 (b) 4
occurrence of those events that are not regular expected (c) 8 (d) 16
and information hiding is the principle of segregation of Ans : (d) Because, Number of different truth table
the design decision in a computer program that are most
means number of different function possible with P &
like to change, thus protecting other parts of the
Q
program from extensive modification if the design
decision is changed. Now a truth table involving 2 prepositions has 4 entries,
each entries can has two possible values, there 2 ^ 4
13. _______ of a system is the structure or
different table i.e. 16, so the answer is (d).
structures of the system which comprise
software elements, the externally visible 17. A Boolean function F is called self-dual if and
properties of these elements and the only if
relationship amongst them. F(x1, x2, .......xn) = F( x1 , x2 ,.....xn )
(a) Software construction How many Boolean function of degree n are self-
(b) Software evolution dual ?
(c) Software architecture 2n

(d) Software reuse

(a) 2n (b) ( 2)
n2 2n −1
Ans : (c) Because, Software architecture refers to the (c) ( 2) (d) ( 2)
high level structure of software system, the discipline of
creating such structures, and the documentation. Ans : (d) A function F is called self dual if it has equal
number of min terms and max terms, also mutually
14. In function point analysis, the number of
exclusive terms should not be included the number of
complexity adjustment factors is
mutually exclusive term is (pair wise) is 2n/2n-1 =
(a) 10 (b) 12
number of functions possible by taking any of the one
(c) 14 (d) 20
term from above mentioned mutually exclusive pair is
Ans : (c) There are 14 relative complexity adjustment n −1

( 2) .
2
factor are
(1) Requirement for reliable backup and recovery 18. Which of the following statement(s) is (are) not
(2) Require for data communication correct?
(3) Extent of distributing processing i. The 2's complement of 0 is 0.
(4) Performance requirement ii. In 2's complement, the left most bit cannot be
(5) Expected operational environment used to express a quantity.
(6) Extent of online data entries iii. For an n-bit word (2's complement) which
(7) Extent of multi-operation online data input. includes the sign bit, there are 2n−1 positive
(8) Extent of online updating of master files. integers, 2n+1 negative integers and one 0 for a
(9) Extent of complex inputs, outputs. total of 2n unique states.
(10) Extent of complex data processing. iv. In 2's complement the significant information
(11) Extent of currently developed code can be is contained in the 1's of positive numbers and
designed for reuse. 0's of the negative numbers.
(12) Extent of conversion and installation in the design. (a) i & iv (b) i & ii
(13) Extent of multiple installation in an organization. (c) iii (d) iv
(14) Extent of change and focus on ease of use. Ans : (c) Because, largest positive number that can be
15. Regression testing is primarily related to represented in n-bit 2's complement code is 2n−1 − 1 and
(a) Functional testing the greatest magnitude negative number that can be
(b) Development testing represented in n-bit 2's complement code is 2n−1. So the
(c) Data flow testing (iii) is not correct statement and the answer is (c).
(d) Maintenance testing 19. The notation ∃!xP(x) denotes the proposition
Ans : (d) Because, regression testing is the process of "there exists a unique x such that P(x) is true".
testing changes to computer program to make sure that Give the truth values of the following
the older programming still works with the new statements :
changes. This happens only in case of maintenance. So
I. ∃!xP(x) → ∃xP(x)
it relates to the maintenance testing, hence the answer is
option (d). II. ∃!x ¬ P(x) → ¬∀xP(x)
UGC NET JRF Computer Science June 2014 Paper-II 103 YCT
 Search on TG: @apna_pdf
(a) Both I & II are true. (a) Kh and 2k/2h−1 (b) K∗h and 2k/2h−1
(b) Both I & II are false. (c) Kh and 2k/2h−1 (d) K∗h and 2k/2h−1
(c) I − false, II − true Ans : (a) Because, consider a B-tree of degree K with
(d) I − true, II − false height h. So Kh & 2 (Ceil K/2)h−1 means Kh and 2
Ans : (a) Because, if there exists a particular X such [K/2]h−2, Hence the correct answer is option (a).
that P(x) is true then obviously there exists some x for 23. Consider a complete bipartite graph km,n. For
which P(x) is true ..... which values of m and n does this, complete
Hence I is correct graph have a Hamilton circuit
Now ∼∀P(x) means ∃∼P(x) (a) m = 3, n = 2 (b) m = 2, n = 3
Therefore 2 is also correct and the right answer is (c) m = n ≥ 2 (d) m = n ≥ 3
option (a).
Ans : (c) Because, Km,n is Hamilton circuit if and only
20. Give a compound proposition involving if m = n ≥ 2, (Circuit is a path similar to a cycle that
propositions p, q and r that is true when starts and ends at the same vertex) and Km,n is a
exactly two of p, q and r are true and is false
Hamilton circuit if m = n ≥ 2, so the correct answer
otherwise.
is (c).
(a) (p∨q∧¬r) ∧ (p∧¬q∧r) ∧ (¬p∧q∧r)
24. Big-O estimates for the factorial function and
(b) (p∧q∧¬r) ∧ (p∧q∧¬r) ∧ (¬p∧q∧r) the logarithm of the factorial function i.e. n!
(c) (p∧q∧¬r) ∨ (p∧¬q∧r) ∧ (¬p∧q∧r) and log n! is given by
(d) (p∧q∧¬r) ∨ (p∧¬q∧r) ∨ (¬p∧q∧r) (a) O(n!) and O(n log n)
Ans : (d) Because, (b) O(nn) and O(n log n)
P Q E Function Option Option Option Option (c) O(n!) and O(log n!)
A B C D
(d) O(nn) and O(log n!)
T T F T F T
Ans : (b) Because, In complexity theory n! = nn
T F T T F T
O(n!) = O(nn)
F T T T X T and O(log(n!)) = O(nlog(n))
Hence the answer is (d). So the answer is (b).
21. Consider the graph given below as: 25. How many cards must be chosen from a deck
to guarantee that at least
i. two aces of two kinds are chosen.
ii. two aces are chosen.
iii. two cards of the same kind are chosen.
iv. two cards of two different kinds are chosen.
Which one of the following graph is isomorphic (a) 50, 50, 14, 5 (b) 51, 51, 15, 7
to the above graph? (c) 52, 52, 14, 5 (d) 51, 51, 14, 5
Ans : (a) Because, since we have to be sure consider
the worst cases for all
(a) (b) (I) Two aces same kind are chosen and first 48 card
without ace then 49th is the type of ace and 50th
also be a type of ace.
(II) Here also 49th and 50th are different of aces, just
as above (I).
(c) (d) (III) We suppose that in the worst case we draw 4
cards of different kinds. Then the next card must
match with any one of the previously draw cards.
Ans : (c) Because, from given figure we can say that, So atleast 5 cards must be drawn.
every vertex has degree = 3 in all options but C, graphs (IV) We suppose that in the worst case we draw 13
has at least one vertex with degree = 4, and then (c) has cards of same kind. Then surely the 14th card
12 edge which is equal to above graph edge. from the remaining 39 cards will be of different
22. The upper bound and lower bound for the kind. So total 14 cards should be drawn.
number of leaves in a B-tree of degree K with Then the answer is 50, 50, 14, 5 means the correct
height h is given by : option is (a).
UGC NET JRF Computer Science June 2014 Paper-II 104 YCT
 Search on TG: @apna_pdf
26. Match the following with respect to the mobile 28. A software agent is defined as
computing technologies : I. A software developed for accomplishing a
List - I List – II given task.
a. GPRS i. An integrated digital II. A computer program which is capable of
radio standard acting on behalf of the user in order to
b. GSM ii. 3G wireless/Mobile accomplish a given computational task.
technology III. An open source software for accomplishing a
c. UMTS iii. Nine different given task.
schemes for (a) I (b) II
modulation and error
(c) III (d) All of the above
correction
d. EDGE iv. An emerging wireless Ans : (b) Because, A software agent is a piece of
service that offers a software that function as a agent for a user or another
mobile data program, working autonomously and continuously in a
Codes : particular environment. It is inhibited by other
a b c d processes and agents, but it is also able to learn from its
(a) iii iv ii i experience in functioning in an environment over a long
(b) iv i ii iii period of time.
(c) ii iii iv i 29. Match the following :
(d) ii i iv iii List - I List – II
Ans : (b) Because, GPRS (General Packet Radio a. Classification i. Principal component
Service). It is an emerging wireless service that offers a analysis
mobile data. It is a packet based wireless
communication that complement circuit switched b. Clustering ii. Branch and Bound
network. c. Feature iii. K-nearest neighbour
GSM (Global System for Mobile Communication) : Extraction
The technology behind the global system for mobile d. Feature iv. K-means
communication (GSMTM) uses Guassian minimum Selection
shifting keying (GMSK) modulation.
Codes :
UMTS (Universal Mobile Telecommunication System):
UMTS is an umbrella term for the third generation a b c d
radio technologies with 3GPP. The radio technologies (a) iii iv ii i
access specification provide for Frequency Division (b) iv iii i ii
Duplex (FDD) and time division duplex (TDD) variant. (c) iii iv i ii
EDGE (Enhanced GPRS or EGPRS) : It is a data (d) iv iii ii i
system used on top of GSM networks. It provide nearly
Ans : (c) Because List (I) List (II)
three times fastest speed than the GPRS system.
After considering all, the right answer is (b). (a) Classification ⇒ K-nearest neighbour
27. Object Request Broker (ORB) is (b) Clustering : K-means is one of the simplest
I. A software program that runs on the client as unsupervised learning algorithm to solve the well
well as on the application server. known clustering problem.
II. A software program that runs on the client (c) Feature Extraction : Feature extraction are in
side only. principle component analysis.
III. A software program that runs on the (d) Feature Selection : Feature extraction are in
application server, where most of the Branch and Bound.
components reside. Hence the correct answer is option (c).
(a) I, II & III (b) I & II
30. SET, an open encryption and security
(c) II & III (d) I only
specification model that is designed for
Ans : (d) Because, object request broker (ORB) is protecting credit card transactions on the
middle wave that uses the COBRA (Common Object
internet, stands for
Request Broker Architecture) specification. The ORB
takes care of all of the details in routing a request from (a) Secure Electronic Transaction
client to object and the response to its destination. ORB (b) Secular Enterprise for Transaction
runs on clients and as well as server application. Hence (c) Security Electronic Transmission
the answer is (d). (d) Secured Electronic Termination
UGC NET JRF Computer Science June 2014 Paper-II 105 YCT
 Search on TG: @apna_pdf
Ans : (a) Because, secure electronic transaction (SET) short process will jump to the head of the Queue over
protocol is used to facilitate the secure transmission of long jobs.
consumer credit card information via electronic Round Robin Scheduling : This type of scheduling
avenues, such as the internet. SET blocks out the details algorithm is basically designed for time sharing system.
of credit card information. It is similar to preemptive added. Round robin is also
31. In a paged memory management algorithm, known as time-slicing scheduling.
the hit ratio is 70%. If it takes 30 nanoseconds ⇒ After consider all the scheduling algorithm, the
to search Translation Look-aside Buffer (TLB) correct answer is option (d).
and 100 nanoseconds (ns) to access memory, 33. Consider a system with five processes P0
the effective memory access time is through P4 and three resource types R1, R2 and
(a) 91 ns (b) 69 ns R3. Resource type R1 has 10 instances, R2 has 5
(c) 200 ns (d) 160 ns instances and R3 has 7 instances. Suppose that
Ans : (d) Because, we can assume single level paging at time T0, the following snapshot of the system
and TLB look and page table look happens sequentially has been taken :
meaning TLB look time is to be considered even for Allocation
TLB miss on a TLB miss we need to access main R1 R2 R3
memory for getting the physical address for page table P0 0 1 0
doing the actual memory access for the data. P1 2 0 0
Effective access time = Hi + Ratio ∗ Time during hit + P2 3 0 2
Miss ratio ∗ Time during miss P3 2 1 1
⇒ 0.7 ∗ (30 + 100) + 0.3 (30 + 100 + 100) P4 0 2 2
⇒ 91 + 69 Max
⇒ 160 ns R1 R2 R3
⇒ Hence the answer is option (d). 7 5 3
32. Match the following : 3 2 2
9 0 2
List - I List - II
2 2 2
a. Multilevel i. Time-slicing
4 3 3
feedback
queue Available
R1 R2 R3
b. FCFS ii. Criteria to move
processes between 3 3 2
queues Assume that now the process P1 requests one
additional instance of type R1 and two instance of
c. Shortest iii. Batch
resource type R3. The state resulting after
process next
allocation will be
d. Round robin iv. Exponential
(a) Ready state (b) Safe state
scheduling smoothening
(c) Blocked state (d) Unsafe state
Codes :
Ans : (b) Because, By taking one instance of R1, P1 will
a b c d
fulfill its need maximum R1 and By taking two instance
(a) i iii ii iv of R3, P1 will fulfill its need of maximum R3 now, it
(b) iv iii ii i needs two instances of R2 after which it can complete
(c) iii i iv i execution and release all of its resources.
(d) ii iii iv i Hence the correct answer is option (b) safe state.
Ans : (d) Because, 34. Match the following :
Multilevel Feedback queue: In multilevel, except jobs List - I List – II
may be moved from one queue to another for a variety a. Contiguous i. This scheme supports
of reasons. allocation very large file sizes.
FCFS : It allocate the CPU in order in which the b. Linked ii. This allocation
process arrive. When the CPU is free, it is allowed to allocation technique supports
process, which is occupying the front is the queue. only sequential files.
Shortest Process Next : The process with the shortest c. Indexed iii. Number of disks
expected processing time is selected for execution, allocation required to access file
among the available process in the ready Queue. Thus a is minimal.
UGC NET JRF Computer Science June 2014 Paper-II 106 YCT
 Search on TG: @apna_pdf
d. Multi-level iv. This technique suffers 37. A text is made up of the characters α, β , γ, δ
indexed from maximum and σ with the probability 0.12, 0.40, 0.15, 0.08
wastage of space in
and 0.25 respectively. The optimal coding
storing pointers.
technique will have the average length of
Codes :
(a) 1.7 (b) 2.15
a b c d
(a) iii iv ii i (c) 3.4 (d) 3.8
(b) iii ii iv i Ans : (b) Because,
(c) i ii iv iii
(d) i iv ii iii
Ans : (b) Because,
(i) Contiguous Allocation : In this each file occupies a
set of contiguous blocks on the disk and it have
randomly accessed and a wasteful of space in this files
cannot grow.
(ii) Linked Allocation : In this each file is a linked list
of disk blocks and it need only starting address and it Now,
have no random accessed.
Path length with 4 = alpha, delta (.48 + .32)
(iii) Indexed Allocation : It brings all pointer into the
indexed block and it needs logical view and it needs Path length with 3 = gamma (.45)
index table and it have random access. Path length with 2 = sigma (.50)
(iv) Multilevel Indexed : A multilevel index can be Path length with 1 = beta (.40)
created for any type of first level index (Primary, Average path length = (4 × 0.12) + (1 × 0.40) + (3 ×
secondary, clustering) as long as the first level index
0.15) + (4 × 0.8) + (2 × 0.25)
consist of more than one disk block and it supports very
large files. Hence the correct answer is option (b) 2.15
⇒ So after considered all the allocation's the true 38. Searching for an element in the hash table
answer is option (b). requires O(1) time for the ______ time,
35. Which of the following commands will output whereas for direct addressing it holds for the
"one two three"? _______ time.
(a) for val; do echo-n $val; done < one two three (a) worst-case, average
(b) for one two three; do echo-n-; done
(b) worst-case, worst-case
(c) for n in one two three; do echo-n $n; done
(d) for n in one two three {echo -n $ n} (c) average, worst-case
Ans : (c) Because, for n in one two three; do echo-n-; (d) best, average
done is the command that give the output "one two Ans : (c) Because, In searching for an element in hash
three" So the answer is (c). table requires O(1) time for the average time, whereas
36. Merge sort makes two recursive calls. Which for direct it holds for the worst-case time. So the correct
statement is true after these two recursive calls answer is option (c).
finish, but before the merge step?
39. An algorithm is made up of 2 modules M1 and
(a) The array elements form a heap.
(b) Elements in each half of the array are sorted M2. If time complexity of modules M1 and M2
amongst themselves. are h(n) and g(n) respectively, the time
(c) Elements in the first half of the array are less complexity of the algorithm is
than or equal to elements in second half of (a) min (h(n), g(n)) (b) max (h(n), g(n))
the array. (c) h(n) + g(n) (d) h(n) ∗ g(n)
(d) All of the above
Ans : (b) Because, In determining the time complexity
Ans : (b) Because, merge sort is possible when two
of an algorithm, if there is a function T(n) = n2 − 11n−9,
arrays are sorted. If two unsorted arrays are submitted
to merge sort algorithm. It will sort each of them first n2 is always considered since it is of highest degree. The
before merging them, because merge sort is a divide lower terms are ignored since they contribute most
and conquer algorithm, Hence the answer is option (b). nothing to the sum when is sufficiently large.

UGC NET JRF Computer Science June 2014 Paper-II 107 YCT
 Search on TG: @apna_pdf
40. What is the maximum number of parenthesis (b) Register Storage Class : In this variable that is
that will appear on the stack at any one time allocated one register of the machine instead of
for parenthesis expression given by conventional memory allocation and values are stored
( ( ) ( ( ) ) ( ( ) ) ) in CPU register.
(a) 2 (b) 3 (c) Static Storage Class : In this the variable that is
local to a function in which it is define and holds the
(c) 4 (d) 5
value for the entire program.
Ans : (b) Because,
(d) External Storage Class : In this variable that
Input Stack recognized globally and can be accessed from any
(()(())(())) empty function that falls within its scope.
()(())(())) ([PUSH] ⇒ So after considered all the storage classes, we find
)(())(())) ( ( [PUSH] that the correct option is (b).
(())(())) (→ [Pop as 42. When we pass an array as an argument to a
parenthesis match] function, what actually gets passed?
())(())) ( ( [PUSH] (a) Address of the array
))(())) ( ( ( [PUSH] (b) Values of the elements of the array
)(())) ( ( → [Pop as (c) Base address of the array
Parenthesis match] (d) Number of elements of the array
())) ( ( [PUSH] Ans : (c) Because, Base address of an array is the
))) ( ( [PUSH] starting address of an array. One can easily access to all
)) ( ( [POP] the cells of an array if information about this can be
) ( [POP] achieved.
Empty Empty (POP) 43. While (87) printf ("computer");
⇒ As you seen the maximum 3 parenthesis appear at The above C statement will
stack at one time. So the answer is option (b). (a) print "computer" 87 times
41. Match the following : (b) print "computer" 0 times
(c) print "computer" 1 times
List - I List - II
(d) print "computer" infinite times
a. Automatic i. Scope of the variable
storage class is global. Ans : (d) Because, Parameter of a while statement in a
languages takes two valves true in the form of non-zero
b. Register ii. Value of the variable
and false in the form of zero. Here 87 is a non-zero
storage class persists between
valve and hence the while block gets true for infinite
different function
times.
calls.
44. A friend function can be used to
c. Static storage iii. Value stored in
(a) avoid arguments between classes.
class memory and local to
(b) allow access to classes whose source code is
the block in which the
unavailable.
variable is defined.
(c) allow one class to access an unrelated class.
d. External iv. Value stored in CPU
(d) None of the above
storage class registers.
Ans : (c) Because, unrelated class means the classes are
Codes :
not connected via inheritance. But a relation can be
a b c d
achieved between two unrelated classes through friend
(a) iii iv i ii function.
(b) iii iv ii i
45. Which of the following is the correct value
(c) iv iii ii i returned to the operating system upon the
(d) iv iii i ii successful completion of a program?
Ans : (b) Because, (a) 0
(a) Automatic Storage Class : In this variable (b) 1
Automatically created and destroyed within a function (c) − 1
and value is stored in memory and local to the block. (d) Program do not return a value.
UGC NET JRF Computer Science June 2014 Paper-II 108 YCT
 Search on TG: @apna_pdf
Ans : (a) Because, 0 is the identifier for a program to 49. Let R = {A, B, C, D, E, F} be a relation schema
inform the operating system (OS) about proper running with the following dependencies C → F, E → A,
of a program. Each of the non-zero valves signifies EC → D, A → B
unique error doing running of a program.
Which of the following is a key for R ?
46. Manager's salary details are hidden from the
employee. This is called as (a) CD (b) EC
(a) Conceptual level data hiding (c) AE (d) AC
(b) Physical level data hiding Ans : (b) Because,
(c) External level data hiding
(d) Local level data hiding
Ans : (c) Because, External level (highest level). It is
the user's view of the database and it describes part of
the database for Particular group of user and provides a
powerful and flexible security mechanism by hiding {CD}+ = {CDF}
part of the database from certain users. The user is not {FC}+ = {ABCDEF}
aware of the existence of any attribute that are missing {AE}+ = {ABE}
from the view. It permits user to access data in a way
{AC}+ = {ABCF}
that is customized to their needs. So that the same data
can be seen by different user in different ways, at the ⇒ So the correct option is (b).
same time. 50. Match the following :
47. Which of the following statements is false? List - I List - II
(a) Any relation with two attributes is in BCNF.
a. DDL i. LOCK TABLE
(b) A relation in which every key has only one
attribute is in 2NF. b. DML ii. COMMIT
(c) A prime attribute can be transitively c. TCL iii. Natural Difference
dependent on a key in 3NF relation. d. BINARY iv. REVOKE
(d) A prime attribute can be transitively
Operation
dependent on a key in BCNF relation.
Codes :
Ans : (d) Because, A relation is in BCNF, if and only if,
every determinant is a candidate key i.e. the left hand a b c d
side of every non trivial dependency is a super key or (a) ii i iii iv
there is a trivial dependency or both. After 3NF, there (b) i ii iv iii
may arise a situation that two candidate keys are having
(c) iii ii i iv
one attribute in common (overlapping) and this
overlapping must be cleared to satisfy BCNF. A prime (d) iv i ii iii
attribute (an attribute that is a part of a candidate key) Ans : (d) Because,
can on depend on a super key. So a prime attribute (a) DDL : Data definition language (DDL): Create,
cannot be transitively dependent on a key in BCNF
alter drop schema object. Grant and revoke
relation. So the false statement is option (d).
privileges and roles.
48. A clustering index is created when ______.
(a) primary key is declared and ordered (b) DML : Data manipulation language (DML)
(b) no key ordered statement access and manipulate data in existing
(c) foreign key ordered schema objects and the DML statements are :
(d) there is no key and no order (ALL, DELETE, INSERT, LOCK, TABLE,
Ans : (a) Because, clustered index determines the order MERGE etc.)
in which the rows of a table are stored on disk. If a table (c) TCL : Transaction control language (TCL) and
has a clustered index. Then the rows of that table will the TCL statements are : COMMIT, ROLL
be stored on disk in the same exact order as the BACK, SAVE POINT etc.
clustered index. In some cases, the index is created on
(d) BINARY Operation : Addition, difference,
non-primary key columns which may not be unique for
each record. Clustering index is defined as an ordered multiplication, division etc.
data files, So the correct answer is option (a) ⇒ So the correct answer is option (d).

UGC NET JRF Computer Science June 2014 Paper-II 109 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2014

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. Beam-penetration and shadow-mask are the Ans. (d) : Because,
two basic techniques for producing color Butt Cap : Chops off the stroke at the ends.
displays with a CRT. Which of the following is Round Cap : Extends the stroke past the ends with
not true? semicricular ends.
I. The beam-penetration is used with Projecting Cap : Extends the stroke past the ends with
random scan monitors. squared ends.
II. Shadow-mask is used in raster-scan 3. Given below are certain output primitives and
their associated attributes. Match each
systems.
primitive with its corresponding attributes :
III. Beam-penetration method is better than List–I List–II
shadow-mask method. a. Line i. Type, Size, Color
IV. Shadow-mask method is better than b. Fill Area ii. Color, Size, Font
beam-penetration method.
c. Text iii. Style, Color, Pattern
(a) I and II (b) II and III d. Marker iv. Type, Width, Color
(c) III only (d) IV only Codes :
Ans. (c) : Because, There are two ways to display an a b c d
object on the screen : Raster scan and Random scan (a) i ii iii iv
and the main method for producing color in CRT (b) ii i iii iv
Monitors are (c) iv iii ii i
(1) Beam Penetration method (d) iii i iv ii
(2) Shadow mask method Ans. (c) : Because,
⇒ Difference between beam penetration and shadow Line : It has attribute like color, line width.
mask method. Fill Area : We can fill a region with some color with
different style and patterns.
Beam Shadow Mask Text : Any texts can be written with different font,
Penetration color etc.
Where used It is used with It is used with Marker : The graphics attributes are the marker color,
Random scan Raster scan marker type, marker size. So the answer is option (d).
system to display system display 4. Consider a window bounded by the lines : x =
color. color. 0; y = 0; x = 5 and y = 3. The line segment
joining (–1, 0) and (4, 5), if clipped against this
Color It displays only It can display window will connect the points
four colors i.e million of (a) (0, 1) and (2, 3) (b) (0, 1) and (3, 3)
Red, green, colors. (c) (0, 1) and (4, 3) (d) (0, 1) and (3, 2)
orange, yellow Ans. (a) : Because,
Cost It is less It is more
expensive as expansive than
compared to others
shadow mask
Picture Quality Quality of Quality of
picture is not so picture is so
good. good.
2. Line caps are used for adjusting the shape of First find the equation of line segment joining (−1, 0)
the line ends to give them a better appearance. and (4, 5)
Various kinds of line caps used are 5−0
4−0⇒ ( x − (−1) )
(a) Butt cap and sharp cap 4 − (−1)
(b) Butt cap and round cap ⇒4=x+1
(c) Butt cap, sharp cap and round cap Now only choice A(0, 1) & (2, 3) satisfy this, Hence
(d) Butt cap, round cap and projecting square cap the answer is (a).
UGC NET JRF Computer Science June 2014 Paper-III 110 YCT
 Search on TG: @apna_pdf
5. Which of the following color models are Ans. (d) : Because, alpha cut means it is the cut off
defined with three primary colors? value. The number having member ship value more
(a) RGB and HSV color models than or equal to in the given fuzzy set will be
(b) CMY and HSV color models considered as present in the result. Now in the set OLP
(c) HSV and HLS color models person with age 40, 50, 60, 70, 80 are having
(d) RGB and CMY color models membership values more than or equal to 0.4 so they
Ans. (d) : Because, are considered as member with value 1 and 2030 with
RGB : Red, Green, blue values less than cut off are not member hence they are
CMY : Cyan, magenta, yellow, black is a subset of shown with value 0 so answer is (d).
RGB. 9. Perception learning, Delta learning and LMS
HSV : HUC, Saturation, Value (also known as HSB : learning are learning methods which falls
HUC, Saturation, Brightness). under the category of
HSL : HUC, Saturation , lightness/luminance (a) Error correction learning – learning with a
Hence the answer is (d). teacher
6. In a digital transmission, the receiver clock is (b) Reinforcement learning – learning with a
0.1 percent faster than the sender clock. How critic
many extra bits per second does the receiver (c) Hebbian learning
receive if the data rate is 1 Mbps? (d) Competitive learning – learning without a
(a) 10 bps (b) 100 bps teacher
(c) 1000 bps (d) 10000 bps Ans. (a) : Because, Error-correction learning is used
Ans. (c) : Receiver clock is 0.1% faster than sender with supervised learning, is the technique of
clock. At 1 mbps bits send by sender = 1000000 comparing the system output to the desired output
receiver clock is 0.1% faster than sender clock so extra value and perception learning, delta learning and LMS
0.1 learning method which falls under this category so the
bit received by receiver = 1000000 ×
100 answer is (a).
= 1000 bits 10. Code blocks allow many algorithms to be
total bits received by receiver = 1001000 bits implemented with the following parameters :
Extra bit per second received by receiver = 1000 bps (a) clarity, elegancy, performance
Hence option (c) 1000 bps is the correct. (b) clarity, elegance, efficiency
7. Given U = {1, 2, 3, 4, 5, 6, 7} (c) elegance, performance, execution
A = {(3, 0.7), (5, 1), (6, 0.8)} (d) execution, clarity, performance
then A will be : (where ~ → complement) Ans. (b) : Because, Code blocks allow many algorithm
(a) {(4, 0.7), (2, 1), (1, 0.8)} to be implemented with clarity elegance and
(b) {(4, 0.3), (5, 0), (6, 0.2)} efficiency. More over, they help the programmer better
(c) {(1, 1), (2, 1), (3, 0.3), (4, 1), (6, 0.2), &, 1)} conceptualize the true nature of algorithm being
(d) {(3, 0.3), (6, 0.2)} implement.
Ans. (c) : Because, 11. Match the following with respect to the jump
µA'(x) = ((µA(x)) = 1 − µA(x) for all x ∈ U statements :
The given set A will be seen as A = {(1, 0), (2, 0), (3, List–I List–II
0.7), (4, 0), (5, 2) (6, 0.8), (7, 0)} a. return i. The conditional test and
So the compliment of A will be {(1, 1), (2, 1), (3, 0.3) increment portions
(4, 2), (6, 0.2) (.7, 2)} b. goto ii. A value associated with it
Hence the answer is (c).
c. break iii. Requires a label for
8. Consider a fuzzy set old as defined below operation
Old = {(20, 0.1), (30, 0.2), (40, 0.4), (50, 0.6),
d. continue iv. An exit from only the
(60, 0.8), (70, 1), (80, 1)}
innermost loop
Then the alpha-cut for alpha = 0.4 for the set
old will be Codes :
(a) {(40, 0.4)} a b c d
(b) {50, 60, 80} (a) ii iii iv i
(c) {(20, 0, 1), (30, 0.2)} (b) iii iv i ii
(d) {(20, 0), (30, 0), (40, 1), (50, 1), (60, 1), (70, (c) iv iii ii i
1), (80, 1)} (d) iv iii i ii
UGC NET JRF Computer Science June 2014 Paper-III 111 YCT
 Search on TG: @apna_pdf
Ans. (a) : Because, II. Rules and facts are terminated by semicolon
(a) Return : Return the content of a variable after (;)
completion of the function body. III. Variables names must start with upper case
(b) go to : Control jumps from one statement to alphabets
another by following the label. IV. Variables names must start with lower case
(c) Break : Stops looping where the break statement alphabets.
appears. Codes :
Continue : It increments the loop controlling variable (a) I, II (b) III, IV
without executing the body of the loop. (c) I, III (d) II, IV
⇒ So the correct option is (a). Ans. (c) : Because, in prolog variable begin with an
12. The control string in C++ consists of three upper case letter. predicate names, function names and
important classifications of characters the names for objects must begin with a lowercase
(a) Escape sequence characters. Format specifies letter and rules and facts are terminated by full stop (⋅ )
and White-space characters So the right answer is option (c).
(b) Special characters, White-space characters 15. Let L be any language. Define even (W) as the
and Non-white space characters strings obtained by extracting from W the
(c) Format specifies, White-space characters and letters in the even-numbered positions and
Non-white space characters even (L) = {even (W)  W ε L}. We define
(d) Special characters, White-space characters another language Chop (L) by removing the
and Format specifies two leftmost symbols of every string in L given
Ans. (c) : Because, In programming language we use by Chop (L) = {W v W ∈ L. with v = 2}. It L is
unique keywords to store data, just like that, the
control string is use to access the different type of regular language then
keyword, and control strings are the characters that use (a) even (L) is regular and Chop (L) is not
with the % (percent) and it is a classification of format regular.
specifier, white space and non-white space characters. (b) Both even (L) and Chop (L) are regular.
13. Match the following with respect to I/O classes (c) even (L) is not regular and Chop (L) is
in object oriented programming : regular.
List–I List–II (d) Both even (L) and Chop (L) are not regular.
a. fopen() i. returns end of file Ans. (b) : Because, Regular languages are closed
b. fclose() ii. return for any problem under union, intersection, difference, concatenation,
report kleene closure, Reversal, homomorphism and inverse
c. ferror() iii. returns 0 homomorphism.
A homomorphism on an alphabet is a function that
d. feof() iv. returns a file pointer
gives a string for each symbol in that alphabet
Codes :
example h(0) = ab; h(1) = ε
a b c d
extending of string by h(a1 ....... an) = h(a1) ...... h(an)
(a) iv i ii iii
⇒ So the correct answer is option (b).
(b) iii i iv ii
(c) ii iii iv i 16. Software testing is
(d) iv iii i ii (a) the process of establishing that errors are not
present.
Ans. (a) : Because,
(b) the process of establishing confidence that a
fopen () : Creates a file and open an existing file
program does what it is supposed to do.
Syntax : FILE ∗ fp; (c) the process of executing a program to show
fp = fopen ("<file − name>", "<mode>"); that it is working as per specifications.
fclose : It closes a file and returns 0 on success and (d) the process of executing a program with the
EOF otherwise intent of finding errors
Syntax : fclose (<file − pointer>); Ans. (d) : Because, Software testing is a process of
ferror ( ) : Checks the error indicator for the given file executing a program or application with the intent of
stream and returning non-zero if set and 0 otherwise finding errors (the software bugs) and the main
feof ( ) : Checks the end of file indicator for the given objective of software testing is to find any bug present
file stream returning non-zero if set and 0 otherwise in the software program. Besides, through the process
14. Which one of the following describes the syntax of testing. One can determine the strengths and
of prolog program? weaknesses of the program in other criteria such as
I. Rules and facts are terminated by full stop(.) path testing, dependency testing etc.
UGC NET JRF Computer Science June 2014 Paper-III 112 YCT
 Search on TG: @apna_pdf
17. Assume that a program will experience 200 Codes :
failures in infinite time. It has now experienced a b c d
100 failures. The initial failure intensity was 20 (a) ii iv i iii
failures/CPU hr. Then the current failure (b) i ii iii iv
intensity will be (c) ii i iv iii
(a) 5 failures/CPU hr. (d) iv ii i iii
(b) 10 failures/CPU hr. Ans. (a) : Because,
(c) 20 failures/CPU hr. Correctness : Correctness is defined as adherence to
(d) 40 failures/CPU hr. the specification that determine how users can interact
Ans. (b) : Because, V0 = 200 failures with the software and how the software should behave
µ = 100 failures when it used correctly. Means, is the software meets its
specification.
λ0 = 20 failure / CPU hr.
Accuracy : It is defined as the combination of both
Current failure intensity = λ0 (1 − µ/V0)
types of observational error (random and systematic)
= 20 (1 − 100/200) = 20 (1 − 0.5) So high accuracy requires both high precision and high
⇒ 10 / failure / CPU hr trueness, means meeting specifications with precision.
and the answer is (b). Robustness : It is defined as the cope with error
18. Consider a project with the following during execution and cope with erroneous input means
functional units : which a software is tolerates the unexpected problems.
Number of user inputs = 50 Completeness : It is defined as which a software has
specified function.
Number of user outputs = 40
So the answer is (a).
Number of user enquiries = 35
Number of user files = 06 20. Which one of the following is not a definition of
error?
Number of external interfaces = 04
(a) It refers to the discrepancy between a
Assuming all complexity adjustment factors computed, observed or measured value and
and weighing factors as average, the function the true., specified or theoretically correct
points for the project will be. value.
(a) 135 (b) 722 (b) It refers to the actual output of a software and
(c) 675 (d) 672 the correct output.
Ans. (d) : Because, External inputs 50 × 4 = 200 (c) It refers to a condition that causes a system to
External outputs 40 × 5 = 200 fail.
(d) It refers to human action that results in
External inquiries 35 × 4 = 140
software containing a defect or fault.
Internal logic files 6 × 10 = 60
Ans. (c) : Because, Error mathematical is the
External interface files 4 × 7 = 28 difference between the observed value and
Count total = 628 approximate value and true value of a quantity.
Average value adjustment factor for each Fi = 3 Error is used to refer to human action that results in
So, ∑141 Fi = 3 × 14 = 42 software containing a defector fault whereas failure
So, Fp = 628 × (0.65 + 0.01 × 42) = 611.96 ≅ 672 refers to a condition that causes a system to fail.
So the answer is (d). Hence the answer is (c).
19. Match the following : 21. Which one of the following is not a key process
area in CMM level 5?
List–I List–II
(a) Defect prevention
a. Correctness i. The extent to which a
(b) Process change management
software tolerates the
(c) Software product engineering
unexpected problems
(d) Technology change management
b. Accuracy ii. The extent to which a
Ans. (c) : Because,
software meets its
specifications CMM (Capability maturity model) : It is framework
that describes an evolutionary improvement path for
c. Robustness iii. The extent to which a software organizations from an immature process to a
software has specified mature, discipline one.
functions The software process is at CMM level 5, if there is
d. Completeness iv. Meeting specifications continuous process improvement, if there is
with precision quantitative feedback from the process and from
UGC NET JRF Computer Science June 2014 Paper-III 113 YCT
 Search on TG: @apna_pdf
piloting innovative ideal and technologies. Software 24. Match the following :
processes are the CMM level 5, if there are process List–I List–II
change management, detect prevention and technology a. Timeout ordering i. Wait for graph
change management, So option (c) in not a key process protocol
area in CMM level 5 b. Deadlock prevention ii. Roll back
22. Consider the following relational schemas for a c. Deadlock detection iii. Wait-die
library database : scheme
Book (Title, Author, Catalog–No, Publisher, d. Deadlock recovery iv. Thomas Write
Year, Price) Rule
Collection (Title, Author, Catalog–no) with the Codes :
following functional dependencies : a b c d
I. Title, Author → Catalog–no (a) iv iii i ii
II. Catalog–no → Title, Author, Publisher, (b) iii ii iv i
Year (c) ii i iv iii
III. Publisher, Title, Year → Price (d) iii i iv iii
Assume (Author, Title) is the key for both Ans. (a) : Because,
schemas. Which one of the following is true? (a) Time Ordering Protocol : If an old transaction Ti
(a) Both Book and Collection are in BCNF. has time stamp Ts(Ti), a new transaction Tj is assigned
(b) Both Book and Collection are in 3 NF. time stamp. It is based Thomas write rule.
(c) Book is in 2NF and Collection in 3 NF. (b) Deadlock Prevention : It is based on wait-die
(d) Both Book and Collection are in 2 NF. scheme means if Ts(Ti) < Ts(Tj), Ti is allowed to wait,
otherwise, if Ts(Tj) < Ts(Ti) is aborted later started.
Ans. (c) : Because, 2NF says that all the non-key
(c) Deadlock Detection : It can be done with the help
attributes should depend the keys, partial dependency
(an attribute is defined by a part of a composite key) is of wait-for graph that corresponds to local or non local
not allowed 3NF says that any dependency between processes that either hold or request local resources. A
non-key attribute should be cleared. wait for graph resource allocation state.
BCNF says that all determinants in a table is key for (d) Deadlock Recovery : Deadlock can be recovered
every non trivial (no overlapping attributes) function. with a roll back of a transaction that will eventually
In the table book, (Title Author) identifies catalog-no. release a resource from a process.
Which if turn identifies publisher and year further Hence the answer is (a).
(publisher, Title, Year) identifies price. Now here the 25. Consider the schema
dependents are partially dependent on the key R = {S, T, U, V]
attributes on left hand side of (R). So the table book is and the dependencies
in 2NF. In the table collection, (Title, Author)
S → T, T → U, U → V and V → S
determines catalog-no., the only non-key attribute. So
If R = (R1 and R2) be a decomposition such that
it is in 3NF as well as BCNF.
R1 ∩ R2 = φ then the decomposition is
23. Specialization Lattice stands for
(a) not in 2 NF
(a) An entity type can participate as a subclass in
(b) in 2 NF but not in 3 NF
only one specialization.
(c) in 3 NF but not in 2 NF
(b) An entity type can participate as a subclass in
more than one specialization. (d) in both 2 NF and 3 NF
(c) An entity type that can participate in one Ans. (d) : Because, R1 ∩ R2 ≠ φ. This makes the
specialization. decomposition lossless join, as all the attributes are
(d) An entity type that can participate in one keys, R 1 ∩ R 2 will be a key of the decomposed relation
generalization. Now, even the original relation R is in 3NF (Even BCNF)
Ans. (b) : Because, as all the attributes are prime attributes (in fact attribute is
a candidate key) Hence, any decomposition will also be
Lattice : It is a partially-ordered set (POSET) that has
in 3NF and 2NF, So the answer is option (d).
a unique SUPREMUM and a unique INFIMUM for all
pairs of elements. 26. Which one of the following is not a Client-
Specialization : It is a process of creating one or more Server application?
subclasses of an entity type that should have some (a) Internet chat (b) Web browser
attributes uncommon with the given super-class. In (c) E-mail (d) Ping
specialization lattice, one type of subclass can have Ans. (D) : Ping is not a client server application. Ping
one or more types of super class whereas in Hierarchal is a computer network administration unility used to
lattice, one type of subclass can have only one type of test the reachability of a host on an Internet protocol
super class. ping there is no server that provides a service.
UGC NET JRF Computer Science June 2014 Paper-III 114 YCT
 Search on TG: @apna_pdf
27. Which of the following concurrency protocol Ans. (b) : Because,
ensures both conflict serializability and Frames : Frames are structured objects that represent
freedom from deadlock : knowledge and contain labeled slots with their values.
I. 2-phase locking Slots : Slots are almost similar to attributes as in ERD
II. Time phase ordering or object-oriented systems in the sense that they may
(a) Both I & II (b) II only contain declarative as well as procedural information.
(c) I only (d) Neither I nor II Facets : Facets are almost similar to description to the
Ans. (b) : Because, 2 phase locking is a concurrency slot values that may function as criteria or validity of
control method that guarantees serializability. The the values inserted into a slop.
protocol utilizes locks, applied by a transaction to a
data, which may block other transaction from
accessing the same data during the transactions life.
2PL may be lead to deadlocks that results from the
mutual blocking of two or more transaction.
Timestamp-based concurrency control is a non lock 31. Consider f (N) = g(N) + h(N)
concurrency method. In timestamp based method, Where function g is a measure of the cost of
deadlock occur as no transaction ever waits. getting from the start node to the current node
28. Match the following : N and h is an estimate of additional cost of
List–I List–II getting from the current node N to the goal
a. Expert systems i. Pragmatics node. Then f(N) = h(N) is used in which one of
b. Planning ii. Resolution the following algorithms?
c. Prolog iii. Means-end (a) A* algorithm
analysis (b) AO* algorithm
d. Natural language iv. Explanation (c) Greedy best first search algorithm
processing facility (d) Iterative A* algorithm
Codes : Ans. (c) : Because, the greedy algorithm work in a
a b c d way that it has same estimate (called a heuristic) of
(a) iii iv i ii how for from the goal any vertex is. Instead of
(b) iii iv ii i selecting the vertex closet to the starting point, it
(c) i ii iii iv selects the vertex closet to the goal, so the answer
(d) iv iii ii i is (c).
Ans. (d) : Because, 32. –––––––– predicate calculus allows quantified
variables to refer to objects in the domain of
(a) Expert System : Most of the expert system have a
module called explanation facility that helps the discourse and not to predicates or functions.
system to allow the user to ask a question and how the (a) Zero-order (b) First-order
module reached the goal. (c) Second-order (d) High-order
(b) Planning : Means-end-analysis is useful for Ans. (b) : Because, first-order logic is a collection of
planning activities. formal systems used in mathematics, philosophy and
(c) Prolog : Resolution is a mechanism for computer science. It also known as first-order
interference from two or more clauses. predicate calculus the lower predicate calculus,
(d) Natural Language Processing : Pragmatic quantification theory & the predicate logic first order
analysis means re-interpreting the sentence to find out logic uses quantified variable over objects. It allows
the overall communicative and social context of the the use of sentence that contain variables.
input text. So the answer is (d). 33. –––––––– is used in game trees to reduce the
29. STRIPS addresses the problem of efficiently number of branches of the search tree to be
representing and implementation of a planner. traversed without affecting the solution.
It is not related to which one of the following? (a) Best first search
(a) SHAKEY (b) SRI (b) Goal stack planning
(c) NLP (d) None of these (c) Alpha-beta pruning procedure
Ans. (c) : STRIPs was devised SRI in the early 1970s (d) Min-max search
to control a robot called SHAKEY strips is not related Ans. (c) : Because, It is a search algorithm that seeks
with NLP (Natural Language Processing). to decrease the number nodes that are evaluated by the
30. Slots and facets are used in Min-max algorithm in its search free. It is an adversial
(a) Semantic Networks (b) Frames search algorithm used commonly for machine playing
(c) Rules (d) All of these of two-player games.
UGC NET JRF Computer Science June 2014 Paper-III 115 YCT
 Search on TG: @apna_pdf
34. Consider a uniprocessor system where new (a) SSTF (shortest seek time first) algorithm
processes arrive at an average of five processes increases performance of FCFS.
per minute and each process needs an average (b) The number of requests for disk service are
of 6 seconds of service time. What will be the not influenced by file allocation method.
CPU utilization? (c) Caching the directories and index blocks in
(a) 80% (b) 50% main memory can also help in reducing disk
(c) 60% (d) 30% arm movements.
Ans. (b) : Because, Given in system there are on (d) SCAN and C-SCAN algorithms are less
average 5 new process arrive pertime. likely to have a starvation problem.
So, arrival rate = 5 process / min Ans. (b) : Because, option (b) is NOT CORRECT as
the number of request for disk drive can be greatly
 60  influenced by file allocation method So the answer is
In every 12 second a   new process arrive is
 5  (b).
system or we can say every process stays 12 second 37. ––––––– maintains the list of free disk blocks in
with the CPU. the Unix file system
Give service time = 6 seconds (a) I-node (b) Boot block
Service time (c) Super block (d) File allocation table
CPU utilization = ×100
Staring time Ans. (c) : Because, Super block describes the state of
file system, the total size of partition, the block size,
6
= × 100 = 50% pointers to a list of free blocks, the inode number of
12 root directory, magic number etc, so the answer is (c).
Hence the right option is (b). 38. A part Windows 2000 operating system that is
35. Consider a program that consists of 8 pages not portable is
(from 0 to 7) and we have 4 page frames in the (a) Device Management
physical memory for the pages. The page (b) Virtual Memory Management
reference string is : (c) Processor Management
123256346373153634243451 (d) User Interface
The number of page faults in LRU and optimal Ans. (b) : Because, The design of virtual memory
page replacement algorithms are respectively assumes that the underlying hardware supports virtual
(without including initial page faults to fill to physical mapping.
available page frames with pages) :
So the answer is (b).
(a) 9 and 6 (b) 10 and 7
(c) 9 and 7 (d) 10 and 6 39. Match the following with reference to Unix
shell scripts :
Ans. (b) : Because, first we finds the LRU page
List–I List–II
replacement
a. $? i. File name of the current
script
then, b. $# ii. List of arguments
c. $0 iii. The number of arguments
d. $* iv. Exit status of last
command
Codes :
So page faults a b c d
⇒ 10, means total replacement at LRU is 10. (a) iii ii i iv
Now, we final the optimal page replacement of given (b) ii iii i iv
above question. (c) iv iii i ii
(d) i iii i iv
Ans. (c) : Because,
$? : This command shows exit status of the last
command executed.
$# : This command shows number of argument
So total replacement at optimal page replacement is 7. supplied to a script.
So the correct answer is (b). $O : This command shows filename of current script.
36. Which of the following statements is not true $∗ ∗ : This command shows all the arguments are double
about disk-arm scheduling algorithms? quoted.
UGC NET JRF Computer Science June 2014 Paper-III 116 YCT
 Search on TG: @apna_pdf
40. The advantage of ––––––– is that it can 44. Which of the following flip-flops is free from
reference memory without paying the price of race condition?
having a full memory address in the (a) T flip-flop
instruction. (b) SR flip-flop
(a) Direct addressing (c) Master-slave JK flip-flop
(b) Indexed addressing (d) None of the above
(c) Register addressing Ans. (c) : Because, In the case of JK FF when
(d) Register Indirect addressing J = 1 K = 1 the Q toggle to 0 and 1.
Ans. (d) : Because, Register indirect addressing means It happens continuously fill the clock is enable ...... and
that the location of an operand is held in a register. It is prediction of Q is uncertain (race condition)......
also called indexed addressing Register indirect Master-slave JK flip flop is used to resolve this
addressing modes requires three read operation to problem.
access an operand. Hence the answer is (d). 45. One of the main features that distinguish
microprocessor from micro-computers is
41. The reverse polish notation equivalent to the
(a) words are usually larger in microprocessors.
infix expression
(b) words are shorter in microprocessors.
((A + B) * C + D)/(E + F + G)
(c) microprocessor does not contain I/O devices.
(a) A B + C * D + EF + G + /
(d) None of the above.
(b) A B + C D * + E F + G + /
Ans. (c) :A microprocessor is a computer processor
(c) A B + C * D + E F G + +/ which incorporates the functions of a computer's
(d) A B + C * D + E + F G +/ control processing unit (CPU) on a single integrated
Ans. (a) : Because, ((A + B) ∗ C + D) / (E + F + G) circuit (IC), or at most a few integrated circuits.
(AB + ∗C + D) / (E + F + G) A microcomputer is small, relatively, inexpensive
(AB + C ∗ + D) / (E + F + G) computer with a microprocessor as its control
processing unit (CPU). It includes a microprocessor,
AB + C ∗ D + / (E + F + G) memory, and minimal input/output (I/O) circuitry
AB + C ∗ D) + / (EF + G) mounted on a single printed circuit board.
AB + C ∗ D + / EF + G + That means, microprocessor does not contain
AB + C ∗ D + EF + G + / input/output devices.
Hence the answer is (a). 46. The output generated by the LINUX command :
42. The output of a sequential circuit depends on $ seq 1 2 10
(a) present input only will be
(b) past input only (a) 1 2 10
(b) 1 2 3 4 5 6 7 8 9 10
(c) both present and past input
(c) 1 3 5 7 9
(d) past output only
(d) 1 5 10
Ans. (c) : Because, There are 2 types of circuit Ans. (c) : In linux seq command is used to print
(1) Combinational, (2) Sequential sequence of number seq command print numbers from
Combinational circuit are those whose outputs depends first to last, in steps of increment.
upon correct input like ADDER, SUBTRACER, If first or incremented is omitted, it defaults to 1. That
MUX, DEMUX etc. is, an emitted INCREMENT defaults to 1 even when
Sequential circuits are those whose output depends on last is smaller than FIRST. FIRST, INCREMENT, and
both current and previous input. LAST are interpreted as floating point values
Hence the answer is (c). INCREMENTED is usually positive if FIRST is
smaller than LAST, and INCREMENTED is usually
43. A byte addressable computer has a memory negative if first is greater than LAST.
capacity of 2m K bytes and can perform 2n then,
operations. An instruction involving 3 $ seq First increment last
operands and one operator needs a maximum ↑ ↑ ↑
of 1 2 10
(a) 3m bits (b) m + n bits then the output sequence generated is = 13579
(c) 3m + n bits (d) 3m + n + 30 bits ⇒ Hence the correct choice is (c).
Ans. (d) : Because, Memory capacity is 2m Kbytes = 47. All the classes necessary for windows
2m+10 bytes. Whole memory can be represented by M + programming are available in the module :
10 bits.2n operations can be represented by n bits. (a) win.txt (b) win.main
Now instruction of from (c) win.std (d) MFC
Instruction OP1, OP2, OP3 will take (3m + 30 + n) bits. Ans. (a) : Because, win⋅txt is a group of classes that is
So the answer is (d). use for windows programming.
UGC NET JRF Computer Science June 2014 Paper-III 117 YCT
 Search on TG: @apna_pdf
48. Windows 32 API supports Codes :
(a) 16-bit Windows (b) 32-bit Windows a b c d
(c) 64-bit Windows (d) All of the above (a) iii iv ii i
Ans. (d) : Because, API (Application Program (b) iii ii iv i
Interface) Index are formally called the win32 API. (c) ii iii iv i
The name windows API more accurately reflects its
(d) iv i ii iii
root in 16-bit windows and in support on 64-bit
windows. Hence the correct choice is (d). Ans. (d) : Because,
49. Superficially the term "object-oriented", (a) Servlet Config : Servlet config is created by the
means that, we organize software as a web container for each servlet and this object can be
(a) collection of continuous objects that used to get configuration information and get
incorporates both data structure and initialization parameters.
behaviour. (b) Servlet Context : It is created by the web
(b) collection of discrete objects that incorporates container at time of developing the project and this can
both discrete structure and behaviour. be used to get configuration information from web.
(c) collection of discrete objects that incorporates XML file and it enables servlets to log events.
both data structure and behaviour. (c) Servlet Request : This is used to provide the client
(d) collection of objects that incorporates both request information to a servlet such as content type,
discrete data structure and behaviour. content length etc mean it used for read data from a
Ans. (c) : Because, object oriented development makes client.
software closet to abstractions the exists in the real (d) Servlet Response : Servlet response is used to
world and the term object oriented means that software
write data to a client.
is a collection of discrete objects that incorporate both
data structure and behavior. ⇒ Hence the answer is (d).
50. The "part-whole", or "a-part-of", relationship 53. The syntax of capturing events method for
in which objects representing the components document object is
of something associated with an object (a) CaptureEvents()
representing the entire assembly is called as (b) CaptureEvents(Orgs eventType)
(a) Association (b) Aggregation (c) CaptureEvents(eventType)
(c) Encapsulation (d) Generalisation (d) CaptureEvents(eventVal)
Ans. (b) : Because, Aggregation is defined as a group
Ans. (c) : Capture events (Event type) method
or mass of distinct or varied things, person, etc and
closets related concept of composition is said to instructs the window to capture all events of a
aggregation. Hence the answer is (b). particular type.
51. The pure object oriented programming 54. Linking to another place in the same or
language with extensive metadata available another webpage require two A (Anchor) tags,
and modifiable at run time is the first with the ________ attribute and the
(a) Small talk (b) C++ second with the _______ attribute.
(c) Java (d) Eiffel (a) NAME & LINK
Ans. (a) : Because, Small talk was one of the earliest (b) LINK & HREF
OOP's language (with other like simulate and Eiffel) and (c) HREF & NAME
can be said to be extremely "Pure" in an OOP sense. (d) TARGET & VALUE
In small talk everything is an object and objects are
Ans. (c) : Because, Name attribute specifies the name
only communicated with via the sending of message.
Hence the answer is (a). of an anchor and it is used to create a bookmark inside
a document.
52. Match the following interfaces of Java. Servlet
package : Syntax : <a name = "value">
List–I List–II ⇒ href attribute specifies the URL of the page the link
a. Servlet Config i. Enables Servlets goes to, and if the href attribute is not present, the <a>
to log events tag is nat a hyperlink.
b. Servlet Context ii. Read data from a Syntax : <a href = "URL">
client 55. Given an image of size 1024 × 1024 pixels in
c. Servlet Request iii. Write data to a which intensity of each pixel is an 8-bit quality.
client It requires _______ of storage space if the
d. Servlet Response iv. To get image is not compressed.
initialization (a) one Terabyte (b) one Megabyte
parameters (c) 8 Megabytes (d) 8 Terabytes
UGC NET JRF Computer Science June 2014 Paper-III 118 YCT
 Search on TG: @apna_pdf
Ans. (b) : Because, Each pixel needs to store 1 Byte (8 Ans. (a) : Because, in alternative optimal solution is
bit) also called an alternative optima, which is when a
Total 1024 × 1024 pixels linear programming problem has more than one
Then, optimal solution an optimal solution is a solution to a
problem. Which satisfies the set of constraints of the
Total storage space = 1024 × 1024 × 1 = 2 × 2 × 1 =
10 10
problem and the objective function which is to
220 = 1 MB
maximize and minimize. So the answer is (a).
So the answer is (b).
59. The given maximization assignment problem can
56. Match the following cryptographic algorithms be converted into a minimization problem by
with their design issues : (a) subtracting each entry in a column from the
List–I List–II maximum value in that column.
a. DES i. Message Digest (b) subtracting each entry in the table from the
b. AES ii. Public Key maximum value in that table.
c. RSA iii. 56-bit key (c) adding each entry in a column from the
d. SHA-1 iv. 128-bit key maximum value in that column.
(d) adding maximum value of the table to each
Codes :
entry in the table.
a b c d
(a) ii i iv iii Ans. (b) : Because, There are problem where certain
facilates have to be assigned to a number of jobs so as
(b) iii i iv ii
to maximize the overall performance of the
(c) iii iv ii i assignment. The problem can be converted into a
(d) iv i ii iii minimization problem in the following wars and then
Ans. (c) : Because, Hungarian method can be used for its solution
(a) DES : DES is an implementation of a fiestel (1) Change the signs of all values given in table.
cipher. It uses 16 round fiestel structure. DES has an (2) Select the highest element in the entire assignment
effective key length of 56 bits. table and subtract all the elements of the table from the
(b) AES : The more popular and widely adopted highest element.
symmetric encryption algorithm is AES. The features ⇒ So the answer is (b).
of AES is symmetric key symmetric block cipher and
60. The initial basic feasible solution of the
it has 128 bit key.
following transportion problem :
(c) RSA : RSA algorithm works on two different keys
i.e public key & private key. As the name public key Destination
given to everyone & private key is kept private. D1 D2 D3 Supply
(d) SHA-1 : It is message digest. O1 2 7 4 5
57. Consider a code with five valid code words of Origins O 2 3 3 1 8
length ten : O3 5 4 7 7
0000000000, 0000011111, O4 1 6 2 14
1111100000, 1110000011, Demand 7 9 18
1111111111 is given as
Hamming distance of the code is 5
(a) 5 (b) 10
8
(c) 8 (d) 9
7
Ans. (a) : Because, Max hamming distance =
st th
10(between 1 and 5 82 83 ) nd rd 2 2 10
min, hamming distance = 4(between 384) then the minimum cost is
1111100000 (a) 76 (b) 78
1110000011 (c) 80 (d) 82
So the answer is (a). Ans. (a) : Because,
58. Which of the following special cases does not Cost Matrix vi
require reformulation of the problem in order 2 7 4 v1 = 1
to obtain a solution?
3 3 1 v 2 = −1
(a) Alternate optimality
(b) Infeasibility 5 4 7 v3 = −2
(c) Unboundedness 1 6 2 v4 = 0
(d) All of the above vj v1 = 1, v2 = 6 v3 = 2
UGC NET JRF Computer Science June 2014 Paper-III 119 YCT
 Search on TG: @apna_pdf
unallocated cell penalties (Pij = vi + vj − cij) So E2 is false.
P12 = 1 + 6 − 7 = 0 for E1,
P13 = 1 + 2 − 4 = −1 Compare N ^ E = log n
P21 = −1 + 1 − 3 = −3 Since E > 0 N ^ E is large compared to log n
P22 = −1 + 6 − 3 = So E1 is correct.
P31 = −2 + 1 − 5 = −6 Since the right option is (b).
P33 = −2 + 2 − 7 = −7 62. Consider the fractional knapsack instance n =
∴ So P22 is identified ccr 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3,
Thus P22 should now be allocated which would result w4) = (2, 4, 6, 9) and M = 15. The maximum
in cost minimizing profit is given by
(Assume p and w denotes profit and weight of
objects respectively)
(a) 40 (b) 38
(c) 32 (d) 30
Ans. (b) : Because,
v1 = 0 v2 = 3 v3 = 1 P1 / W1 5
5]2 +2 7 4 v1 = 2 P2 / W2 2.5
3 13 8− 2 = 61 v2 = 0 P3 / W3 2
5 4 7 v3 = 1 P4 / W4 2
2]1 2 − 2 = 0 6 10 + 2 = 12 2 v 4 = 1 Now select the one which has max (P/W) ratio that is
Now penalties for non allocated cells are P1/W1 = 5 So select 10
P12 = 2 + 3 − 7 = −2  Next P2/W2 = 2.5 select 10
P13 = 2 + 1 − 4 = −1  Now P3/W3 and P4/W4 has same ratio but P4 gives
maximum profit 80 select P4,
P21 = 0 + 0 − 3 = −3  therefore total wcign = (2 + 4 + 9) = 15
 Optimel solu.
P31 = 1 + 0 − 5 = −4  8 Max profit = 10 + 10 + 18 = 38
P33 = 1 + 1 − 7 = −5  So the answer is (b).

P42 = 1 + 3 − 6 = −2  63. The solution of the recurrence relation of T(n)
Now cost are,   n 
= 3T  floor    + n is
5 × 2 + 3 × 2 + 1 × 6 + 4 × 7 + 2 × 12 + 1 × 2   4 
= 1 + 6 + 6 + 28 + 24 + 2 2
(a) O(n ) (b) O(n/g n)
= 76 (c) O(n) (d) O(/ g n)
So the answer is (a). Ans. (c) : Given recurrence relation is:
61. Given the following equalities :
n 
E1 : nK+∈∈ + nK lg n = θ(nK+∈∈) for all fixed K and T(n) = 3T     + n
∈. K ≥ 0 and ∈ > 0. 4
3 n 2 n 3 n
E2 : n 2 + 6n 3 = O(n 2 ) Using master theorem case 3 is:
Which of the following is true? (a )
(n log b ) ≤ f (n) then T(n) = Θ(n)
(a) E1 is correct and E2 is correct.
Given a = 3, b = 4 and f(n) = n then
(b) E1 is correct and E2 is not correct. (3)
(c) E1 is not correct and E2 is correct. (n log 4 ) ≤ n, then T(n) = Θ(n)
(d) E1 is not correct and E2 is not correct. So, T(n) = O(n) = O(n2)
Ans. (b) : Because, for E2; Both option (a) and (c) are true, but option (c) is best
find which one is large choice.
N ^ 3 * 2 ^ N = 6N ^ 2 * 3 ^ N 64. If h is chosen from a universal collection of
N * 2 ^ N = 6 * 3 ^ N (Now take log on both side) hash functions and is used to hash n keys into a
Log(N * 2 ^ N) = Log(6 * 3 ^ N) table of size m, where n ≤ m, the expected
Log N + N Log 2 = Log 6 + N Log 3 number of collisions involving a particular key
Log N + N = 1.5N (Log6 = Constant m Log3 = 1.5) K is
Log N = 0.5 N (a) less than 1 (b) less than lg n
O(0.5N) = O(6 * N ^ 2 * 3 ^ N) (c) greater than 1 (d) greater than lg n
UGC NET JRF Computer Science June 2014 Paper-III 120 YCT
 Search on TG: @apna_pdf
Ans. (a) : Because, This is a theorem in universal Ans. (b) : Because, Ten signal need 10 × 3000 =
hashing : 30000 Hz
"if n is chosen from a universal collection and is used 9(10 − 1) Guard bands (or gaps) needs = 300 × 9 =
for hash n keys in table of size m, where n < = m, the 2700 Kz
expected number of collision involving a particular So minimum bandwidth need 30000 + 2700 = 32700
key is less than 1") Hz
So the answer is (a). So the answer is (b).
65. Given the following statements : 68. A terminal multiplexer has six 1200 bps
S1 : The subgraph-isomorphism problem takes terminals and 'n' 300 bps terminals connected
two graphs G1 and G2 and asks whether G1 is a to it. If the outgoing line is 9600 bps, what is
subgraph of G2. the value of n?
S2 : The set-partition problem takes as input a (a) 4 (b) 8
set S of numbers and asks whether the (c) 16 (d) 28
numbers can be partitioned into two sets A and Ans. (b) : Because, the outgoing line = 9600 pbs
A = S − A such that terminal multiplexer has six 1200 pbs so total traffic
Σx Σx (1200 ∗ 6) = 7200 bps and then are n 300 bps terminals
=
x∈A x∈A So 7200 + 300 ∗ n = 9600 ⇒ 300n = 2400 ⇒ n = 8
Which of the following is true ? So the answer is (b).
(a) S1 is NP problem and S2 is P problem. 69. Which of the following is used in the options
(b) S1 is NP problem and S2 is NP problem. field of IPv4?
(c) S1is P problem and S2 is P problem. (a) Strict source routing
(d) S1 is P problem and S2 is NP problem. (b) Loose source routing
Ans. (b) : Because, (c) time stamp
⇒ S2 is a MP problem means it is solved in a (d) All of the above
polynomial time. Ans. (d) : Because, IPv4 is the fourth version in the
⇒ S1 is a P problem means if exists at least one development of the IP. and IPv4 use loose source for
algorithm to solve that problem. an IP option can be used for address translation and
⇒ So the answer is (b). IPv4 also use strict source routing for the contrast with
loose source routing, in every step of the route is
66. Suppose that the splits at every level of
decided in advance where the packet is send and IPv4
quicksort are in the proportion (1 − α) to α. also time stamp.
where 0 < α ≤ 1/2 is a constant. The minimum
So the correct answer is (d).
depth of a leaf in the recursion tree is
approximately given by 70. Which layers of the OSI reference model are
host-to-host layers ?
lgn lg(1 − α)
(a) − (b) − (a) Transport, Session, Presentation, Application
lg(1 − α) lgn
(b) Network, Transport, Session, Presentation
lgn lgα (c) Data-link, Network, Transport, Session
(c) − (d) −
lgα lgn (d) Physical, Data-link, Network, Transport
Ans. (a) : Because, if we split with α will get Ans. (a) : Because, The host-to-host layers main
minimum depth. Suppose α = 1/2 means pivot is the purpose is to shield the upper layer application from
middle element, with such case recursion tree will be the complexity of network.
with minimum depth.
(1) na ^ k = 1
k = logn / logα
(2) n(1 − α) ^ k = 1
k = logn / log(1 − α)
So the correct answer is (a).
67. Ten signals, each requiring 3000 Hz, are
multiplexed on to a single channel using FDM.
How much minimum bandwidth is required
for the multiplexed channel? Assume that the
guard bands are 300 Hz wide.
(a) 30,000 (b) 32,700
(c) 33,000 (d) None of the above So the answer is (a).
UGC NET JRF Computer Science June 2014 Paper-III 121 YCT
 Search on TG: @apna_pdf
71. A network on the internet has a subnet mask of 74. Match the following :
255, 255, 240, 0. What is the maximum number List–I List–II
of hosts it can handle? a. Chomsky Normal i. S→bSS|aS|c
(a) 1024 (b) 2048 form
(c) 4096 (d) 8192 b. Greibach Normal ii. S → a S b | ab
Ans. (none of these) : form
Because, Subnet mask :- 255.255.240.0 c. S-grammar iii. S → AS | a
11111111 ⋅11111111 ⋅11110000
14444244443 144 ⋅ 00000000
2443 A → SA | b
Act ID Host ID

It is a class B-Network for a class B d. LL grammar iv. S → a B S B

Network, the upper 16 bits form the network address B→b
and lower 16 bit are subnet and host fields of the lower Codes :
16 bits most significant bit are 1111. This haves 12 bits a b c d
for the host number, so 4096(212) host address exists (a) iv iii i ii
First and last address are special so the maximum (b) iv iii ii i
number of address. (c) iii iv i ii
⇒ 4096 − 2 = 4094, So the answer is (none of these). (d) iii iv ii i
72. Four bits are used for packed sequence Ans. (c) : Because,
numbering in a sliding window protocol used (a) Chomsky Normal Form : Its production rules
in a computer network. What is the maximum should be of the form
window size? A → BC, or
(a) 4 (b) 8 A→a
(c) 15 (d) 16 S→ε
Ans. (c) : Because, In case of Go Back N protocol iii satisfies this
sender window size is n − 1 and receiver window size (b) Greiback Normal Form : Its production rules
should be of form
is 1 the size is (2 ^ n) − 1
A → aA1A2  An or
So the answer is 15.
A→a
73. Given the following two grammars : iv satisfies this
G1 : S → AB | aaB (c) S-Grammar : If every production's right hand side
A → a | Aa begins with a terminal signal and this terminal is
B→b different for any two productions with the left hand
G2 : S → a S b S | b S a S | λ side i satisfies this
Which statement is correct ? (d) LL Grammar : It two production rules can begin
with same terminal symbols if they have same select
(a) G1 is unambiguous and G2 is unambiguous.
sets.
(b) G1 is unambiguous and G2 is ambiguous. So ii satisfies this then the right answer is (c).
(c) G1 is ambiguous and G2 is unambiguous.
75. Given the following two languages :
(d) G1 is ambiguous and G2 is ambiguous.
L1 = {anbn | n ≥ 1} ∪ {a}
Ans. (d) : Because, G1 : 3 → AB | aab L2 = {w C wR | w ∈ {a, b} }
A → a | Aa Which statement is correct ?
B→b (a) Both L1 and L2 are not deterministic.
To generate string "aab" (b) L1 is not deterministic and L2 is deterministic.
S → AB → AaB → aaB → aab (c) L1 is deterministic and L2 is not deterministic.
S → aaB → aab (d) Both L1 and L2 are deterministic.
So ambiguous Ans. (d) : Because, L2 ...... insert symbol into stack
G2 : S2 → aSbS | bSAs | λ until C doesn't appear...... if C the skip it and compare
generate "abab" top of stack with input symbol ....... Because of C it
becomes deterministic L1 is also deterministic because,
S → aSbS → abS → abaSbS → abab
if "a" comes then we can't divide .... but after "a", "a"
S → aSbS → aSb → abSaSb → abab or "b" comes then first part of given language is
So ambiguous considered.
⇒ So the correct answer is (d). So the correct answer is (d).
UGC NET JRF Computer Science June 2014 Paper-III 122 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2014

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. Consider a set A = {1, 2, 3, ............1000}. How 4. A computer program select an integer in the
many members of A shall be divisible by 3 or set {k : 1 ≤ k ≤ 10,00,000} at random and prints
by 5 or both 3 and 5? out the result. This process is repeated 1
(a) 533 (b) 599 million times. What is the probability that the
(c) 467 (d) 66 value k = 1 appears in the printout at least
Ans : (c) Because, number of member divisible by 3 = once?
{3, 6, 9 .......... 999} : 999/3 = 333 (a) 0.5 (b) 0.704
Number of member divisible by S = {5, 10, 15 (c) 0.632121 (d) 0.68
........1000} : 1000/5 = 200 Ans : (c) Because, probability of k = 1 is 1/1000000 =
Number of member divisible by 15 = {15, 30 .........990} 10–6
: 999/15 = 66 probability of k! = 1 is 1 – 10–6 = 0.999
So, no. divisible by 3 or by 5 or both 3 and 5.
probability that k = 1 is never printed in all 106 print
(A ∨ B) = (A + B) − (A ∧ B)A outs = 0.999 × 0.999 × ........ 0.999 (106 time)
Thus the total number in set = 333 + 200 - 66 = 467 = 0.999 10∧6
So the answer is (c) Probability that 1 is printed at least once = 1 –
2. A certain tree has two vertices of degree 4, one probability that 1 is never printed
vertex of degree 3 and one vertex of degree2. If ⇒ 1 – 0.999∧10∧6
the other vertices have degree 1, how many ⇒ 0.6321
vertices are there in the graph?
(a) 5 (b) n–3 5. If we define the functions f, g and h that map R
(c) 20 (d) 11 into R by :
Ans : (d) Number of edges in a tree with n vertices: f(x) = x4, g(x) = x 2 + 1,h(x) = r 2 + 72 , then the
e = n -1
value of the composite functions ho(gof) and
Now, using theorem Handshaking theorem
(hog) of are given as
V∈V
∑ deg(V) = 2| e | (a) x2 – 71 and x8 – 71
(b) x8 – 73 and x8 – 73
Therefore,
(c) x8 + 71 and x8 + 71
⇒ 2 × 4 + 1× 3 + 1× 2 + (n − (2 + 1 + 1)) ×1 (d) x8 + 73 and x8 + 73
= 2(n - 1) Ans : (d) f = x4
⇒13 + (n − 4) = 2n − 2
⇒13 + 2 − 4 = 2n − n gof = ( x + 1)
8

⇒ n = 11 ho(gof) = x8 + 1 + 72 = x8 + 73 // option d hold

3. Consider the Graph shown below : this!
ho(gof) = x8 + 73 = x8 + 73
So the answer is (d)
6. The BCD adder to add two decimal digits
needs minimum of
(a) 6 full adders and 2 half adders
(b) 5 full adders and 3 half adders
This graph is a ................. (c) 4 full adders and 3 half adders
(a) Complete graph (b) Bipartite graph
(c) Hamiltonian graph (d) All of the above (d) 5 full adders and 2 half adders
Ans : (c) Because, According to dirac's theorem, in a Ans : ( d ) Because, BCD adder to add two decimal digit
graph of n nodes, each node has degree greater than n/2, needs 5 full adders & 2 half adders.
graph is Hamilton So answer is (d)
• In given graph n = 6 7. The Excess-3 decimal code is self-
• All nodes have degree = 4 complementing code because
• Hence graph is Hamiltonian (a) The binary sum of a code and its 9's
• So Hamiltonian path is ABCDEF complement is equal to 9
So the answer is C (b) It is a weighted code
UGC NET JRF Computer Science Dec. 2014 Paper-II 123 YCT
 Search on TG: @apna_pdf
(c) Complement can be generated by inverting Ans : (b) Because, total input to the ROM decoder will
each bit pattern be (8 + 8(two 8 bit number) + 1(mode) + 1(carry in))
(d) The binary sum of a code and its 10's So total number of words out of decoder will be 2∧18.
complement is equal to 9 Result will be 8 bit so 8 vertical lines + (1 for carry) + 1
Ans : (a or c) The Excess-3 decimal code is a self- (for saying under flow) means 218 × 10
complementing code because the binary sum of a code So the answer is (b)
and its 9's complement is equal to 9 and complement 11. What will be the output of the following 'C'
can be generated by inverting each bit pattern. code?
8. How many PUSH and POP operations will be main ( )
needed to evaluate the following expression by { int x = 128 ;
reverse polish notation in a stack machine (A pritf("\n%d", 1 + x ++);
×B) + (C × D/E)? }
(a) 4 PUSH and 3 POP instructions (a) 128 (b) 129
(b) 5 PUSH and 4 POP instructions (c) 130 (d) 131
(c) 6 PUSH and 2 POP instructions Ans : (b) main ( )
(d) 5 PUSH and 3 POP instructions {
Ans : (b) To evaluate postfix expression we need int x = 128;
operand stack given expression is infix, so convert it printf ("\n%d", 1 + x++)
into postfix. So, resulting postfix expression: }
AB * CD * E/ + In the following C program There is post increment
operation: So, printf will print 1 + 128 as output. ++
will increment the x value i.e. x = 129.
12. What does the following expression means?
char *(*(*a[N])())( );
(a) a pointer to a function returning array of n
So, total 5 push and 9 POP. We can reduce POP since pointers to function returning character
keep one operand in separate register, so need only 1 pointers
POP operation instead of 2 POP. So, can be answer but (b) a function return array of N pointers to
if 5 push and 8 POP given then 'b' is wrong. functions returning pointers to characters
(c) an array of n pointers to function returning
9. The range of representable normalized pointer characters
numbers in the floating point binary fractional (d) an array of n pointers of function returning
representation in a 32-bit word with 1-bit sign, pointers to functions returning pointers to
8-bit excess 128 biased exponent and 23-bit characters
mantissa is : Ans : (d) Because,
(a) 2–128 to (1–2–23) × 2127 a –– a
(b) (1–2–23)×2–127 to 2128 a[N] – – is an N-element array
(c) (1–2–23) × 2–127 to 223 *a[N] – – of pointers
(d) 2–129 to (1–2–23) ×2127 (*a[N])( ) – – to functions
Ans : (d) Because, the range of respectable normalized *(*a[N])( ) – – returning pointers
number in the floating point binary fractional (*(*a[N]())( ) – – to function
representation in a 32–bit word *(*(*a[N]()) ( ) – – returning pointers
bais = 2n–1 = 28–1 = 128 Char *(*(*a[N]())( ) – – to char
Number 1 in normalized format = 0.00000......23 times means, an array of n pointers to functions returning
= 20–128 = 2–128 pointers to function returning pointers to characters.
Maximum number 111111..........22 time = 0.1111.....23 So the answer is (d)
times = (1 – 2–23) × (2555–228) = 1 – 2–23) × (2127) 13. Which of the following is not a member of
So the answer is (d)
class?
10. The size of the ROM required to build an 8-bit (a) Static function (b) Friend function
adder/subtracter with mode control, carry (c) Const function (d) Virtual function
input, carry output and two's complement Ans : (b) A friend function that is a "friend" of C
overflow output is given as : given class, is a function that is given the same access
(a) 216 × 8 than methods to private and protected data. A friend
(b) 218 × 10 function is declared by the class that is granting access,
(c) 216 × 10 so friend functions are part of the class interface like
(d) 218 × 8 methods.
UGC NET JRF Computer Science Dec. 2014 Paper-II 124 YCT
 Search on TG: @apna_pdf
14. When an array is passed as parameter to a III. Natural join and outer join operations
function, which of the following statements is are equivalent.
correct? (a) I and II are correct
(a) The function can change values in the (b) II and III are correct
original array (c) Only III is correct
(b) In C, parameters are passed by value, the (d) Only I is correct
function cannot change the original value in
the array Ans : (d) Because only I is correct. Self join is
implemented in a single table by alias names rest 2 are
(c) It results in compilation error when the
function tries to access the elements in the incorrect, so the answer is (d)
array 18. What kind of mechanism is to be taken into
(d) Results in a run time error when the function account for converting a weak entity set into
tries to access the elements in the array strong entity set in entity relationship
Ans : (a) When an array is passed as parameter to a diagram?
function then the function can change values in the (a) Generalization
original array. (b) Aggregation
15. Which of the following differentiates between (c) Specialization
overloaded functions and overridden (d) Adding suitable attributes
functions? Ans : (d) Weak entity is an entity which does not have
(a) Overloading is a dynamic or runtime binding sufficient attributes to form a primary key. Weak entity
and overridden is a static or compile time is represented by Double rectangle In an ER Diagram. It
binding must be in a 1:M relation. A member of a weak entity is
(b) Overloading is a static or compile time called a subordinate entity. For converting a weak entity
binding and overriding is dynamic or runtime set into strong entity set in entity-relationship diagram
binding
by simply adding appropriate attributes.
(c) Redefining a function in a friend class is
called overloading, while redefining a 19. The best normal form of relation scheme R(A,
function in a derived class is called as B, C, D) along with the set of functional
overridden function dependencies F = { AB → C, AB → D, C → A,
(d) Redefining a function in a derived class is D →B} is :
called function overloading, while redefining (a) Boyce-Codd Normal form
a function in a friend class is called function (b) Third Normal form
overriding
(c) Second Normal form
Ans : (b) Because, In method overloading, method call (d) First Normal form
to its definition has happens at compile time & while in
method overriding, method call to its definition happens Ans : (b) Because, keys are AB, CD, BC, AD
at run time. Here A, B, C, D all are prime attributes
So the answer is (b) So, no partial or transitive dependency are there
16. Division operation is ideally suited to handle So it in 3NF
queries of the type : Hence the answer is (b)
(a) customers who have no account in any of the 20. Identify the minimal key for relational scheme
branches in Delhi R(A, B, C, D, E) with functional dependencies
(b) customers who have an account at all F = {A → B, B → C, AC → D}
branches in Delhi (a) A (b) AE
(c) customers who have an account in atleast one (c) BE (d) CE
branch in Delhi
(d) customers who have only joint account in any Ans : (b) Because, {A} + = {A, B, C, D}
one branch in Delhi Here A can not be a key because we can't get attribute E
Ans : (b) Because division identify the attribute values from here.
from relation that are found to be paired with all of the {AE}= {A, B, C, D, E}
values from the other relation. Here AE is the minimal key we can't remove anything
So the answer is (b) from it
17. Which of the following is true? Hence the correct choice is (b)
I. Implementation of self-join is possible is 21. Convert the following infix expression into its
SQL with table alias equivalent post fix expression
II. Outer-join operation is basic operation (A + B∧ D)/(E – F) + G
in relational algebra (a) ABD∧ + EF –/G+ (b) ABD+ ∧EF –/G+
UGC NET JRF Computer Science Dec. 2014 Paper-II 125 YCT
 Search on TG: @apna_pdf
(c) ABD+ ∧EF/ –G+ (d) ABD∧ + EF /–G+ 26. The period of a signal is 10 ms. What is its
Ans : (a) Given infix notation is frequency in Hertz?
= (A + B ↑ D) /(E − F) + G (a) 10 (b) 100
= Convert it into postix expression (c) 1000 (d) 10000
Ans : (b) Because, frequency = 1/period = 1/10 ms =
= ((((A + (B ↑ D)) /(E − F)) + G)
1/10–2 s = 100 Hz
= ((((ABD ↑ + ) /(EF −)) + G) So the answer is (b)
= ABD ↑ + EF − / G + 27. In a classful addressing, first four bits in Class
22. You have to sort a list L. consisting of a sorted A IP address is :
list followed by a few 'random' elements. (a) 1010 (b) 1100
Which of the following sorting method would (c) 1011 (d) 1110
be most suitable for such a task? Ans : (none of these) In class A the first bit (MSB) of
(a) Bubble sort (b) Selection sort first octed is 0.
(c) Quick sort (d) Insertion sort Class A: 0xxx : x can be 0 or 1.
Ans : (d) For a sorted list with few random numbers: Class B: 10xx
(i) Bubble sort will take O(n2) time in best case. Class C: 110x
(ii) Selection sort will take O(n2) time in best case. Class D: 1110
(iii) Quick sort will take O(n2) time in this case Class E: 1111
because it is the worst case for quick sort. 28. Which of the following algorithms is not a
(iv) Insertion sort will take O(n) broadcast routing algorithm?
23. The directory can be viewed as .............. that (a) Flooding
translates filenames into their directory entries. (b) Multi destination routing
(a) Symbol table (b) Partition (c) Reverse path forwarding
(c) Swap space (d) Cache (d) All of the above
Ans : (a) The directory can be viewed as symbol table Ans : (d) Because, flooding is suited for ordinary point
that translates file-names into their directory entries. to point communication, for broadcasting it might be
Symbol table is an important data structure created and good solution. The problem with flooding is it generates
maintained by compilers in order to store information too may packets & consumes too much bandwidth
about the occurrence of various entities such as variable
Multi destination routing have each packet contains
names, function names, objects, classes, interfaces, etc.
either a list of destination and reverse path forwarding is
24. Consider an array A[20, 10], assume 4 words an attempt to approximate the spanning tree broadcast
per memory cell and the base address of array even when the routers do not know anything at all about
A is 100. What is the address of A [11, 5]? spanning tree
Assume row major storage. So the correct choice is (d)
(a) 560 (b) 565
29. An analog signal has a bit rate of 6000 bps and
(c) 570 (d) 575
Ans : (a) Because, Each cell needs 4 words a baud rate of 2000 baud. How many data
elements are carried by each signal element?
• A [0][0], A[0] [1],..... A[0][9] needs 4 × 10 = 40
(a) 0.336 bits/baud
words
(b) 3 bits/baud
• Since array starts at 100, A [0] [9] will be at 100 +
(c) 120,00,000 bits/baud
40 = 140th location
(d) None of the above
• Similarly from A[0][0] to A[10][9] there are 11 ×
10 = 110 elements Ans : (b) Because the analog signal 2000 bauds or
element in one second.
• From A[11][0] to A[11][5] there are 5 elements
• To send this 6000 bits are transmitted second
• Total 115 elements are present before A[11][15]
• Thus 6000/2000 = 3 bits/baud is transmitted
• Hence A[11][15] will be 100 + 4 × 115 = 560
So the answer is (a) 30. How may distinct stage are there in DES
25. A full binary tree with n leaves contains algorithm, which is parameterized by a 56-bit
(a) n nodes (b) log2 nodes key?
(c) 2n – 1 nodes (d) 2n nodes (a) 16 (b) 17
Ans : (c) Because, full binary tree with n leaves (c) 18 (d) 19
contains n–1 internal nodes Ans : (d) Because, DES (Data encryption Standard)
So total nodes = internal nodes + leaves = n – 1 + n algorithm which is parameterized by a 56 bit key has 19
= 2n–1 distinct edges including 16 rounds.
So the answer is (c) So the answer is (d)
UGC NET JRF Computer Science Dec. 2014 Paper-II 126 YCT
 Search on TG: @apna_pdf
31. Shift-Reduce parsers perform the following : Ans : (c) Because, debugger is computer program used
(a) Shift step that advances in the input stream by programmers to test and debug a target program and
by K(K >1) symbols and Reduce step that it use instructions - set simulators rather than running a
applies a completed grammar rule to some program directly on the processor to achieve a higher
recent parse trees, joining them together as level of control over its execution. It also use to allow,
one tree with a new root symbol. set breakpoints, execute a segment of program and
(b) Shift step that advances in the input steam by display content of register.
one symbol and Reduce step that applies a 35. The following context-free Grammar (CFG) :
completed grammar rule to some recent parse S → aB bA
trees, joining them together as one tree with a
A → a asbAA
new root symbol
(c) Shift step that advances in the input steam by B → b bs aBB
K(K =2) symbols and Reduce step that will generate
applies a completed grammar rule to form a (a) odd numbers of a's and odd numbers of b's
single tree. (b) even numbers of a's and even numbers of b's
(d) Shift step that does not advance in the input (c) equal numbers of a's and b's
stream and Reduce step that applies a (d) different numbers of a's and b's
completed grammar rule to form a single tree Ans : (c) Because, if you consider this CFG you can
Ans : (b) Because, Shift step advances in the input definitely generate odd no. of a's and odd no. of b's and
stream by one symbol. That shifted symbol becomes a we can generate the string aabb (which is a
new single-node parse tree contradiction of option b & a)
• Reduce step applies a completed grammar rule to Given CFL also can generate ab(which is contradiction
some of the recent parse tree, joining them together to the option d)
as one tree with a new root symbol. ⇒ Means when you consider option (c) in this you can
• If the input has no syntax errors, the parser generate all possible string out of this grammar is
continues with these steps until all of the input has which you are going to have equal no. of a's and
been consumed and all of the parse tree have been equal no. of b's
reduced to a single tree representing an entire legal ⇒ So the correct choice is (c)
input. 36. Consider the following justifications for
32. Which of the following is true? commonly using the two-level CPU scheduling:
(a) Canonical LR parser is LR (1) parser with I. It is used memory is too small to hold all
single look ahead terminal the ready processes
(b) All LR (K) parsers with K > 1 can be II. Because its performance is same as that
transformed into LR (1) parsers of the FIFO.
(c) Both (a) and (b) III. Because it facilitates putting some set of
(d) None of the above processes into memory and a choice is
Ans : (c) Because, A canonical LR parser or LR (1) is made from that.
an LR (k) parser for k = 1, i.e. with a single look ahead IV. Because it does not allow to adjust the set
all LR (k) parser's with k>1 can be transformed into a of in-core processes
LR (1) parser. Which of the following is true?
(a) I, III and IV (b) I and II
33. In a two-pass assembler, symbol table is : (c) III and IV (d) I and III
(a) Generated in first pass Ans : (d) Because, two level scheduling is a method to
(b) Generated in second pass more efficiently perform process scheduling that
(c) Not generated at all involved swapped out process. Two level scheduling
(d) Generated and used only in second pass uses two different schedulers, one lower-level
Ans : (a) In a two-pass assembler, symbol table is schedulers which can only select among those processes
generated in first pass but it need two pass to scan in memory to run. That scheduler could be a round
whole source file. While one pass assembler scan whole Robin scheduler. The other scheduler is the higher level
file in a go. scheduler whose only concern is to swap in and swap
34. Debugger is a program that : out processes from memory.
(a) allows to examine and modify the contents of 37. A specific editor has 200 K of program text, 15
registers K of initial stack, 50 K of initialized data, and
(b) does not allow execution of a segment of 70 K of bootstrap code. If five editors are
program started simultaneously, how much physical
(c) allows to set breakpoints, execute a segment memory is needed if shared text is used?
of program and display contents of register (a) 1135 K (b) 335 K
(d) All of the above (c) 1065 K (d) 320 K
UGC NET JRF Computer Science Dec. 2014 Paper-II 127 YCT
 Search on TG: @apna_pdf
Ans : (b) Because, initial stack, initialized data and 41. ................... are applied throughout the
bootstrap code can be shared among the editors. software process.
Because text is shared so no need to multiply 200 with 5 (a) Framework activities
and other need each for running. Then the total memory (b) Umbrella activities
is = 200 + 15 +150 + 70 = 335K (c) Planning activities
38. Which of the following conditions does hold (d) Construction activities
good for a solution to a critical section Ans : (b) The umbrella activities in a software
problem? development life cycle process include the following:
(a) No assumptions may be made about speeds software project management, formal technical reviews,
or the number of CPUs. software quality assurance and software configuration
(b) No two processes may be simultaneously management.
inside their critical sections. Umbrella activities occur throughout the software
(c) Processes running outside its critical section process and focus primarily on project management,
may block other processes tracking and control.
(d) Processes do not wait forever to enter its
critical section. 42. Requirement Development, Organizational
Ans : (c) Because, if a process is running outside the process focus, organizational training, risk
critical section we don't care whatever it is doing out management and integrated supplier
there either it is blocking some processes or not it is not management are process areas required to
going to affect the processes which are running inside achieve maturity level
the critical section. (a) Performed (b) Managed
39. For the implementation of a paging scheme, (c) Defined (d) Optimized
suppose the average process size be x bytes, the Ans : (c) Because, maturity level 3 – defined
page size be y bytes, and each entry requires z ATM : Acquisition technical management
bytes. The optimum page size that minimizes AVAL : Acquisition validation
the total overhead due to the page table and the IPM : Integrated project management
internal fragmentation loss is given by : OPF : organizational process focus
x xz OT : organizational training
(a) (b)
2 2 RSKM : Risk management
xz 43. The software ................. of a program of a
(c) 2xz (d) computing system is the structure or structures
2
Ans : (c) Because, average amount of internal of the system, which comprise software
fragmentation persegement is y/2 components, the externally visible properties of
Average no. of pages per process segment is x/y each those components, and the relationships among
page requires 'z' bytes of page table. them.
So each process segment require page table size of xz/y (a) Design (b) Architecture
bytes. (c) Process (d) Requirement
Total overload per segment, therefore, due to internal Ans : (b) Because, software architecture encompasses
fragmentation to minimize the overhead, differentiate the set of significant decisions about the organization of
with respect to page size, P & equal to 0 a software system including the selection of the
d(xz/y + y/2)/dy = –xz/y2 + 1/2 = 0 structural elements and their interfaces by which the
⇒ y = 2xz system is composed; behavior as specified n
collaboration among those elements, composition of
So the answer is (c) these structural and behavioral elements into larger
40. In a demand paging memory system, page table subsystems : software architecture also involves
is held in registers. The time taken to service a functionality, usability, performance etc.
page fault is 8 m. sec. if an empty frame is 44. Which one of the following set of attributes
available or if the replaced page is not modified, should not be encompassed by effective
and it takes 20 m. sec. if the replaced page is software metrics?
modified. What is the average access time to
service a page fault assuming that the page to be (a) Simple and computable
replaced is modified 70% of the time? (b) Consistent and objective
(a) 11.6 m. sec. (b) 16.4 m. sec. (c) Consistent in the use of units and dimensions
(c) 28 m. sec. (d) 14 m. sec. (d) Programming language dependent
Ans : (b) Because service a page fault = 8 m.sec. Ans : (d) Because, effective software metrics should be
simple, computable, consistent, objective and consistent
page is not modified = 20 m.sec. in the use of units and dimensions. But it should not be
page replace = 70% of time programming language dependent as them it will not be
then the average time of service a page fault consistent in measuring the software.
= 0.7 × 20 + 0.3 × 8 = 14.4.4 = 16.4 ms Hence the answer is option (d)
UGC NET JRF Computer Science Dec. 2014 Paper-II 128 YCT
 Search on TG: @apna_pdf
45. Which one of the following is used to compute 48. Which e-business model allows consumers to
cyclomatic complexity? name their own price for products and
(a) The number of regions–1 services?
(b) E – N + 1 , where E is the number of flow (A) B2 B (B) B2 G
graph edges and N is the number of flow (C) C2 C (D) C2 B
graph nodes Ans : (d) Because, C2B model called a reverse auction
(c) P – 1, where P is the number of predicate or demand collection model, enables buyers to name or
nodes in the flow graph G. demand their own price, which is often binding, for a
(d) P + 1, where P is the number of predicate specific good or service. The website collects the
nodes in the flow graph G. demand bids then offers the bids to participating sellers
Ans : (d) Because, cyclomatic complexity is a metric and C2C is a consumer to consumer business model and
to measure logical complexity of a program. B2B and B2G has nothing to concern about consumer
• Cyclomatic complexity defines the number of price setting.
independent paths in a program 49. __________ model is designed to bring prices
• It gives an upper bound for the number of tests that down by increasing the number of customers
must be conducted to ensure that all statements have who buy a particular product at once.
been executed at least once.
(A) Economic Order Quantity
⇒ Cyclomatic complexity is computed in one of three
(B) Inventory
ways.
(1) Number of regions of the flow graph (C) Data Mining
(2) Cyclometic complexity, V(G), for a flow graph (D) Demand-Sensitive Pricing
G, is defined as V(G) = E – N + 2 K where E is Ans : (d) Because, Inventory and data mining has
the number of flow graph edges, N. is the nothing to do with price. Economic order quality (ECQ)
number of flow graph and K is the number of is the order quantity that minimizes the total holding
connected components costs and ordering cost it is one of the oldest classical
(3) V(G) = P + 1 where P is the number of production scheduling models. So these three options
predicate nodes contain in the flow graph G. So are get neglect so the correct is (d)
the answer is (d) 50. Match the following :
46. Consider the following statements S1 and S2 : List – I List – II
S1 : A hard handover is one in which the
channel in the source cell is retained and a. Call control i. Interface between
used for a while in parallel with the protocol Base Transceiver
channel in the target cell. Station (BTS) and
S2 : A soft handover is one in which the Base Station
channel in the source cell is released and Controller (BSC)
only then the channel in the target cell is b. A-bis ii. Spread spectrum
engaged. c. BSMAP iii. Connection
(a) S1 is true and S2 is not true. management
(b) S1 is not true and S2 is true. d. CDMA iv. Works between
(c) Both S1 and S2 are true. Mobile Switching
(d) Both S1 and S2 are not true. Centre (MSC) and
Base Station
Ans : (d) Because, Hard handover is one in which the
Subsystem (BSS)
channel in the source cell is released and only the
channel in the target cell is engaged Codes :
⇒ Soft handover is one is which the channel in the A B C D
source cell is retained and used for a while parallel (a) iii iv i ii
with the channel in the target cell (b) iii i iv ii
⇒ So the both are hot true, hence the correct choice is (d) (c) i ii iii iv
47. Fact-less fact table in a data warehouse (d) iv iii ii i
contains Ans : (b) (i) Call control protocol do Connection
(a) only measures (b) only dimensions management.
(c) keys and measures (d) only surrogate keys (ii) BSMAP works between Mobile Switching
Ans : (b) A fact-less fact table is a fact table that does Centre (MSC) and Base Station Subsystem (BSS)
not have any measures. It is essentially an intersection (iii) A-bis is a interface between Base
of dimensions (it contains nothing but dimensional key) Transceiver Station (BTS) and Base Station Controller
there are two types of fact-less tables : one is for (BSC)
capturing an event and one is for describing conditions. (iv) CDMA is a spread spectrum.
UGC NET JRF Computer Science Dec. 2014 Paper-II 129 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2014

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. A hierarchical memory system that uses cache 4. Match the following 8085 instructions with the
memory has cache access time of 50 nano flags :
seconds, main memory access time of 300 nano List – I List – II
seconds, 75% of memory requests are for read, A. XCHG i. only carry flag is
hit ratio of 0.8 for read access and the write- affected
through scheme is used. What will be the B. SUB ii. no flags are affected
average access time of the system both for read
and write requests? C. STC iii. all flags other than carry
(a) 157.5 n.sec (b) 110 n.sec. flag are affected
(c) 75 n.sec. (d) 82.5 n.sec. D. DCR iv. all flags are affected
Ans : (a) Because, Tread = 0.8 × 50 + 0.2 × (300 + 50) = Code :
110 NS A B C D
(a) iv i iii ii
Twrite = 1 × max(300, 50) = 1 × 300 = 300 ns
(b) iii ii i iv
Hence average access time for both read and write is =
(c) ii iii i iv
0.75 × 110 + 0.25 × 300 = 157.5 ns (d) ii iv i iii
2. For switching from a CPU user mode to the Ans : (d) Because, (a) XCHG : Exchange H & L with
supervisor mode following type of interrupt is D & E no flag is affected in this instruction
most appropriate : (b) SUB : Subtract all flags (CY, S, Z, AC, P) are
(a) Internal interrupts (b) External interrupts affected by subtract operation
(c) STC : Set Carry flag to 1 so only carry flag is
(c) Software interrupts (d) None of the above
affected
Ans : (c) Because, internal interrupts occur due to (d) DCR : Decrement all flags other than carry flag are
some internal error (like division of zero) affected.
External interrupts occur due H/w problem Hence the answer is (d)
Software interrupts are the most appropriate method for 5. How many times will the following loop be
switching user mode to kernel mode. executed?
3. In a dot matrix printer the time to print a LOP : DCX B
character is 6 m.sec., time to space in between MOV A, B
ORA C
characters is 2 m.sec., and the number of
JNZ LOP
characters in a line are 200. The printing speed
(a) 05 (b) 07
of the dot matrix printer in characters per
(c) 09 (d) 00
second and the time to print a character line
Ans : (b) Because, value 7 is placed in register pair B
are given by which of the following options?
every time value is by one by DCX B
(a) 125 chars/seconds and 0.8 seconds
Contents of B are moved to accumulator and logical OR
(b) 250 chars/seconds and 0.8 seconds is performed with C but that don't affect the repetition
(c) 166 chars/second and 0.8 seconds of loop which is controlled by JNZ(JUMP is not zero)
(d) 250 chars/second and 0.4 seconds LOP instruction. So loop executes for B values 7, 6, 5,
4, 3, 2, 1 total 7 times
Ans : (*) Because, total characters = 200
total time to print 200 chars. = 200 × 6 = 1200 ms 6. Specify the contents of the accumulator and the
total time to space in = 200 × 2 = 400 ms status of the S, Z and CY flags when 8085
microprocessor performs addition of 87 H and
200 characters total print time = 1600 ms = 1.6 sec 79 H.
The printing speed of the dot matrix printer is character (a) 11, 1, 1, 1 (b) 10, 0, 1, 0
per second = 200/1.6 = 125 chars/sec. (c) 01, 1, 0, 0 (d) 00, 0, 1, 1
UGC NET JRF Computer Science Dec. 2014 Paper-III 130 YCT
 Search on TG: @apna_pdf
Ans : (d) Because, 87 H – 10000111 Ans : (b) {A}+ = {A, B, C, D}
79 H – 01111001 {F} = {E}
100000000 Hence the correct option is (b)
S–sign flag– Since MSB of result is 0, hence sign bit 11. Consider the following statements :
should be 0. I. Re-construction operation used in mixed
Z-zero flag– Since result is zero, hence zero bit should fragmentation commutative rule.
be 1. II. Re-construction operation used in vertical
Cy–Carry flag– Since these is carry from MSB, hence fragmentation satisfies commutative rule
Cy = 1 Which of the following is correct?
7. Location transparency allows : (a) I
I. Users to treat the data as if it is done at (b) II
one location (c) Both are correct
II. Programmers to treat data as if it is at one (d) None of the statements are correct
location Ans : (d) All reconstructions are need two operation
III. Managers to treat the data as if it is at one • Join
location • Union
Which of the following is correct? Because the operation above are commutative, the
(a) I, II and III (b) I and II only reconstructions are commutative too.
(c) II and III only (d) II only 12. Which of the following is false ?
Ans : (a) Because, In distributed computer networks, (a) Every binary relation is never be in BCNF
location transparency is the use of names to identify (b) Every BCNF relation is in 3NF
network resources, rather than their actual location.
(c) 1 NF, 2 NF, 3 NF and BCNF are based on
8. Which of the following is correct? functional dependencies
I. Two phase locking is an optimistic protocol (d) Multivalued dependency (MVD) is a special
II. Two phase locking is pessimistic protocol case of join dependency (JD)
III. Time stamping is an optimistic protocol Ans : (a) Every binary relation (a relation with only 2
IV. Time stamping is pessimistic protocol attributes) is always in BCNF. Because if both attributes
(a) I and III (b) II and IV form the primary key, the relation is in BCNF. If one of
(c) I and IV (d) II and III the attribute is a primary key, the other must be
determined by it and thus in BCNF.
Ans : (d) Two phase locking is pessimistic protocol
(assumes bad thing going to happen) since it applies 13 . Which of the following categories of language
locks (for safety) do not refer to animation language?
Time stamping is an optimistic protocol (assumes good (a) Graphical languages
thing going to happen) since it uses no locking. If bad (b) General-purpose languages
things happen, then they are handled later. (c) Linear-list notations
9. ..........rules used to limit the volume of log (d) None of the above
information that has to be handled and Ans : (d) All 3 mentioned are refer to animation
processed in the event of system failure language. Linear list notations are B rotate "Palm" etc.
involving the loss of volatile information: General purpose language eg. Grasp my-cube etc.
(a) Write-ahead log (b) Check-pointing General language describe animation in a usual way
(c) Log buffer (d) Thomas instead of using a scripts.
So the correct choice is (d)
Ans : (b) Check pointing is a technique to add fault
tolerance into computer system. It basically consist of 14. Match the following :
saving a snapshot of the application state, so that it can List –I List –II
restart from that point in case of failures A. Tablet, Joystick i. Continuous
10. Let R = ABCDE is a relational scheme with devices
functional dependency set F = {A → B, B → C, B. Light pen, Touch ii. Direct devices
AC → D}. The attribute closures of A and E screen
are : C. Locator, Keyboard iii. Logical devices
(a) ABCD, φ (b) ABCD, E D. Data Globe, Sonic iv. 3D interaction
(c) Φ, φ (d) ABC, E pen devices
UGC NET JRF Computer Science Dec. 2014 Paper-III 131 YCT
 Search on TG: @apna_pdf
Codes:
 2 2 
A B C D  0
2 2
(a) ii i iv iii  A '  A   0 0 1  
(b) i iv iii ii  B'  =  B  R p =  1 1 1  − 2 2 
    45   0
(c) i ii iii iv  C '   C   5 2 1  2 2 
 
(d) iv iii ii i 
−1 ( 2 −1 ) 1

Ans : (c) Keyboard is a logical device & so is locator  
data globe, sonic pen are 3D interaction devices  
Table joystick are continuous devices as we can not lift 

−1 2 −1 ( 1

)
our hand during their operation
Light Pen & touch screen are direct devices as we

= −1 (
2 2 − 1 1 )
directly touch them & get our work done.  
  3 2 − 1  9 2 − 1  1
15. A technique used to approximate halftones  2 
  2  
without reducing spatial resolution is known So
as............
A' = (
−1, 2 − 1 ,B' = −1, 2 2 − 1 & ) ( )
(a) Half toning (b) Dithering 3 9 
C' =  2 − 1, 2 − 1
(c) Error diffusion (d) None of the above 2 2 
Ans : (b) It is a technique can be used to approximate Hence the correct choice is (a)
halftones without reducing spatial resolution. In this 17. In Cyrus-Beck algorithm for line clipping the
approach the dither matrix is treated very much like a value of t parameter is computed by the
floor file that can be repeatedly positioned one copy relation :
next to another to cover entire floor. (Here P1 and P2 are the two end points of the
line, f is a point on the boundary, n1 is inner
16. Consider a triangle represented by A(0,0), normal)
B(1,1), C(5,2). The triangle is rotated by 45
(a)
( P1 − fi ) .n i (b)
( fi − P1 ) .n i
degrees about a point P(–1, –1). The co- ( 2 1) i
P − P .n ( P2 − P1 ) .n i
coordinates of the new triangle obtained after
rotation shall be– (c)
( P2 − fi ) .n i (d)
( fi − P2 ) .n i
( 1 2) i
P − P .n ( P1 − P2 ) .n i
(a) ( ) ( 3
A ' −1, 2 − 1 ,B' −1, 2 2 − 1 ,C"
9
2
) 
2 − 1, 2 − 1

2
Ans : (b)
( fi − P1 ) .n i
(b) A' ( ) ( )3
2 − 1, −1 ,B' 2 2 − 1, −1 ,C"
2
2 − 1,
9
2

2 − 1

( P2 − P1 ) .n i
18. Match the following :
(c) ( ) ( 3
A ' −1, 2 − 1 ,B' 2 2 − 1, −1 ,C"
 2
)
2 − 1,
9
2

2 − 1
 A. Cavalier i. The direction of
(d) ( ) ( 3
A ' −1, 2 − 1 ,B' 2 2 − 1, −1 ,C"
2
)
2 − 1,
9
2

2 − 1

Projection projection
chosen so that
is

Ans : (a) there is no

foreshortening of
 2 2  lines
 0
2 2 perpendicular to
 1 0 0   1 0 0 
R45, p =   − 2 2   the xy plane
 0 1 0  2 2
0  0 1 0 
B. Cabinet ii. The direction of
 1 1 1    −1 −1 1 
  0 0 1   Projection projection is
  chosen so that
 
lines
 2 2  perpendicular to
 0  the xy planes are
 2 2  foreshortened by
− 2 2  half their lengths
= 0
 2 2  C. Isometric iii. The direction of
 1
 ( 2 −1 ) 1

Projection projection makes
equal angles with
  all of the
Now, principal axis
UGC NET JRF Computer Science Dec. 2014 Paper-III 132 YCT
 Search on TG: @apna_pdf
D. Orthographic iv. Projections are 20. How many tokens will be generated by the
Projection characterized by scanner for the following statement?
the fact that the x = x * (a + b) –5;
direction of (a) 12 (b) 11
projection is (c) 10 (d) 07
perpendicular to
Ans : (a) x = x × (a + b) – 5
the view plane
Every character is taken here
Code :
Token no character
A B C D
1 x
(a) i iii iv ii
2 =
(b) ii iii i iv
3 x
(c) iv ii iii i
4 *
(d) i ii iii iv 5 (
Ans : (d) Cavalier projection : It sometimes called 6 a
cavalier perspective or high view point. A point of the 7 +
object is represented by three coordinates x,y & z. On
8 b
the drawing, it is represented by only two coordinates
9 )
"x" & "y" on the flat drawing, two axes, x & z on the
10 –
figure, are perpendicular to the view of plane.
11 5
(b) Cabinet projection : Like, cavalier, one face of the
project object is parallel to the viewing plane, In this the12 ;
third axis keeps its length, with cabinet projection of the 21. Which of the following statements is not true?
length of the receding lines is cut in half (a) MPI_Isend and MPI_Irecv are non-blocking
(c) Isometric projection : In this reflecting that the message passing routines of MPI
scale along each axis of the projection is the same. (b) MPI_Issend and MPI_Ibsend are non-
(d) Orthographic projection : It is a means of blocking message passing routines of MPI
representing a three dimensional object in two (c) MPI_Send and MPI_Recv are non-blocking
dimension it is a form of parallel projection. message passing routines of MPI
19. Consider the following statements S1, S2 and (d) MPI_Ssend and MPI_Bsend are blocking
S3 : message passing routines of MPI
S1 : In call–by–value, anything that is passed Ans : (c) Message-passing interface (MPI) standard.
into a function call is unchanged in the MPI_Isend & MPI_Irecv are non-blocking MPI_Isend
caller's scope when the function returns. buffered non blocking so statement A & B are correct &
MPI_Send & MPI_Bsend are blocking message, S, D is
S2 : In call-by-reference, a function receives
also correct statement
implicit reference to a variable used as
So the correct answer is (c)
argument.
S3 : In call-by-reference, caller is unable to 22. The pushdown automation M = ({q0, q1, q2}, {a,
see the modified variable used as b}, {0, 1}, δ, q0, 0, {q0}) with
argument δ(q0, a, 0) = {(q1, 10)}
(a) S3 and S2 are true δ(q1, a, 1) = {q1, 11)}
(b) S3 and S1 are true δ(q1, b, 1) = {q2, λ)}
(c) S2 and S1 are true δ(q2, b, 1) = {q2, λ)}
(d) S1, S2, S3 are true δ(q2, λ, 0) = {q0, λ)}
Ans : (c) Call-by-value : While passing parameters Accepts the language
using call by value, copy of original parameter is (a) L = {an bm|n, m ≥ 0 }
created & passed to the called function & any update (b) L = {an bn| n ≥ 0 }
made inside method will not effect the original value (c) L = {an bm|n, m > 0 }
variable in calling function. (d) L = {an bn|n > 0 }
Call-by-reference : This method copes the address of Ans : (b) This PDA clearly accepts an bn as its language
an argument into the formal parameter. but as we see that there is a production from Q2 to q0
So answer is c, because in call-by reference caller makes the input string half on Q0 , So out final state will
always sees the modified value of the argument. be Q0 So, it will accept empty strings.
UGC NET JRF Computer Science Dec. 2014 Paper-III 133 YCT
 Search on TG: @apna_pdf
23. Given two languages : Ans : (d) In mesh topology, every computer in the
L1 = {(ab) a | n > k, k ≥ 0}
n k network has a connection to each of the other computers
in that network. The number of connections in this
L2 = {an bm | n ≠ m}
network can be calculated using the following formula
Using pumping lemma for regular language, it
n(n–1)/2 (where n is the number of computer in the
can be shown that network)
(a) L1 is regular and L2 is not regular
26. How many characters per second (7 bits + 1
(b) L1 is not regular and L2 is regular
parity) can be transmitted over a 3200 bps line
(c) L1 is regular and L2 is regular
if the transfer is asynchronous? (Assuming 1
(d) L1 is not regular and L2 is not regular
start bit and 1 stop bit)
Ans : (d) Whenever pumping lemma is there it can (a) 300 (b) 320
only be used to prove that language is not regular or not (c) 360 (d) 400
context free
Ans : (b) In asynchronous transmission, for each
So the answer is (d)
character, we need to send data, parity, start & stop bits.
24. Regular expression for the complement of size of one character = 7 + 1 + 1 + 1 = 10 bits
language L = {an bm | n ≥ 4, m ≤ 3} is : Line transmits 3200 bits in one second.
(a) (a + b) × ba (a + B ) × no. of characters transmitted in one second = 3200/10 =
(b) A × bbbbb × 320
(c) (λ + a + aa + aaa)b × + (a + b) × ba(a + b)× 27. Which of the following is not a field in TCP
(d) None of the above header?
Ans : (d) n ≥ 4, then {aaaa, aaaaa, aaaaaa, aaaaaaa.....} (a) Sequence number (b) Fragment offset
= aaaa {E, a, aa, aaa, .........} = aaaaa* (c) Checksum (d) Window size
m ≤ 3, then {E, b, bb, bbb} Ans : (b)
L = {an bm n ≥ 4, m ≤ 3}
Regular expression will be aaaaa* (E + b + bb + bbb)
DFA for above regular expression will be

DFA for complement of L, i.e. L will be 28. What is the propagation time if the distance
between the two point is 48,000? Assume the
propagation speed to be 2.4 × 108 meter/second
in cable :
(a) 0.5 ms (b) 20 ms
(c) 50 ms (d) 200 ms
Ans : (d) Distance between points = 48000 km = 48 ×
106 meter
Propagation speed = 2.4 × 108 meter/sec
Will regular expression Distance between points
Propagation time =
(E + a + aa + aaa) (E + b) (a + b)*) + aaaaa* (b + bb) a Propagation speed
(a + b)* + aaaaa* bbb (a + b) (a + b)* 48×106
So the correct choice is (d) = = 0.2 sec = 200 ms
2.4 × 108
25. For n devices in a network, ............. number of
29. ........... is a bit-oriented protocol for
duplex-mode links are required for a mesh
communication over point-to-point and
topology.
multipoint links.
(a) n(n + 1) (b) n(n – 1) (a) Stop-and-wait (b) HDLC
(c) n(n + 1)/2 (d) n(n – 1)/2 (c) Sliding window (d) Go-back-N
UGC NET JRF Computer Science Dec. 2014 Paper-III 134 YCT
 Search on TG: @apna_pdf
Ans : (b) HDLC (High level data link control) is a The problem is to find shortest distance between every
classical bit oriented code transparent synchronous data pair of vertices and the time complexity is o(n3lgn).
link layer protocol by ISO protocol. 33. We can show that the clique problem is NP-
HDLC can be used for point to multipoint connections. hard by proving that :
But is now used almost exclusively to connect the one
(a) CLIQUE ≤ P 3–CNF_SAT
device to another.
(b) CLIQUE ≤ P VERTEX_COVER
30. Which one of the following is true for
(c) CLIQUE ≤ P SUBSET_SUM
asymmetric-key cryptography? (d) None of the above
(a) Private key is kept by the receiver and public
key is announced to the public Ans : (d) Clique : A clique in graph G is a complete
graph; that is, it is a subset S of the vertices such that
(b) Public key is kept by the receiver and private
every two vertices is S are connected by an edge in G
key is announced to the public
the decision problem is a NP complete.
(c) Both private key and public key are kept by
3 SAT : SAT asks whether the variable of a given
the receiver
Boolean formula can be consistently replaced by the
(d) Both private key and public key are
values TRUE or FALSE is such way that the formula
announced to the public
evaluates to TRUE SAT is one of the first problems that
Ans : (a) In asymmetric key cryptography uses two was proven to be NP-complete & vertex problem &
keys private key & public key. Private key is kept by subset sum are NP-complete problem. So option (a, b,
the receiver & public key is announced to the public c) match with rule (3, 4)
So answer is (a) So the correct answer is (d)
31. Any decision tree that sorts n elements has 34. Dijkstra algorithm, which solves the single-
height source shortest-paths problem, is a ................,
(a) Ω(n) (b) Ω(lgn) and the Floyd-Warshall algorithm, which finds
(c) Ω(nlgn) (d) Ω(n2) shortest paths between all pairs of vertices, is
Ans : (c) For any comparison based sorting algorithm a............
the decision will have n! leaf nodes, so height will be (a) Greedy algorithm, Divide-conquer algorithm
log (n!) = Ω(n log n) (b) Divide-conquer algorithm, Greedy algorithm
32. Match the following : (c) Greedy algorithm, Dynamic programming
algorithm
List –I List –II
(d) Dynamic programming algorithm, Greedy
A. Bucket sort i. O(n3lgn) algorithm
B. Matrix chain ii. O(n3) Ans : (c) Dijkstra algorithm, which solves the single
multiplication source shortest path problem, is a greedy algorithm &
C. Huffman codes iii. O(nlgn) the Floyd warshall algorithm, which finds shortest paths
D. All pairs shortest iv. O(n) between all pair of vertices, is a dynamic programming
paths algorithm.
Codes : 35. Consider the problem of a chain <A1, A2, A3 >
A B C D of three matrices. Suppose that the dimensions
(a) iv ii i iii of the matrices are 10 × 100, 100 × 5 and 5 × 50
(b) ii iv i iii respectively. There are two different ways of
(c) iv ii iii i parenthesization : (i) ((A1 A2)A3) and (ii) (A1
(d) iii ii iv i (A2A3)). Computing the product according to
Ans : (c) the first parenthesization is .................... times
faster in comparison to the second
(a) Bucket sort : Bucket sort is mainly useful when
parenthesization.
input is uniformly over a range. Time complexity is o(n)
time. (a) 5 (b) 10
(c) 20 (d) 100
(b) Matrix chain multiplication : In this no matter
how we parenthesize the product, the result will be Ans : (b) Assume one multiplication take 1 m sec.
same & the time complexity is o(n3) time I. will take 7500 multiplication = 7500 × 1 msec = 7500
(c) Huffman code : It is a lossless data compression msec
algorithm. The time complexity is o(nlgn) times II. will take 7500 multiplication = 75000 × 1 msec =
(d) All pairs shortest paths : The Floyd warshall 75000 msec faster = 75000/7500 = 10
algorithm is solving the all pairs shortest path problem. So answer is (b)

UGC NET JRF Computer Science Dec. 2014 Paper-III 135 YCT
 Search on TG: @apna_pdf
36. Suppose that we have numbers between 1 and Ans : (a) A person may have none or many animals as
1000 in a binary search tree and we want to pets (one to many relationships) which is shown by (a),
search for the number 365. Which of the Hence the correct answer is (a)
following sequences could not be the sequence 39. Converting a primitive type data into its
of nodes examined? corresponding wrapper class object instance in
(a) 4, 254, 403, 400, 332, 346, 399, 365 called
(b) 926, 222, 913, 246, 900, 260, 364, 365 (a) Boxing (b) Wrapping
(c) 927, 204, 913, 242, 914, 247, 365 (c) Instantiation (d) Auto boxing
(d) 4, 401, 389, 221, 268, 384, 283, 280, 365 Ans : (d) Autoboxing is the automatic conversion that
Ans : (c) the java compiler makes between the primitive types &
their corresponding object wrapper class.
40. The behavior of the document elements in
XML can be defined by :
(a) Using document object
(b) Registering appropriate event handlers
(c) Using element object
(d) All of the above
Ans : (b) Java script program can define the document
elements by registering appropriate event handless.
41. What is true about UML stereotypes?
(a) Stereotype is used for extending the UML
language
(b) Stereotyped class must be abstract
(c) The stereotype indicates that the UML
element cannot be changed
(d) UML Profiles can be stereotyped for
Option (c) is wrong because 914 can be traveled after backward compatibility
913 Ans : (a)
37. Which methods are utilized to control the • Stereotype, tags & constraints are used for
access to an object in multi-threaded extending the UML
programming? • They allow designers to extend the vocabulary of
(a) A synchronized methods UML in order to create new model elements,
derived from existing ones.
(b) Synchronized methods
• Stereotype is rendered as a name enclosed by << >>
(c) Serialized methods
(d) None of the above • Stereotype cannot be extends by another stereotype
Ans : (b) Synchronation is the capability to control the 42. Which method is called first by an applet
access of multiple threads to shared resources, It is program?
possible for one java thread to modify a shared variable (a) start ( ) (b) run ( )
while another thread is in the process of using or (c) init ( ) (d) begin ( )
updating same shared variable. Ans : (c) applet life cycle
38. How to express that some person keeps animals
as pets?

(a)

(b) So the answer is (c)

43. Which one of the following is not a source code
(c)
metric?
(a) Halstead metric
(d) (b) Function point metric

UGC NET JRF Computer Science Dec. 2014 Paper-III 136 YCT
 Search on TG: @apna_pdf
(c) complexity metric 48. Temporal cohesion means
(d) Length metric (a) Coincidental cohesion
Ans : (b) Function point metric, this approach is (b) Cohesion between temporary variables
independent of the language tools or methodologies
(c) Cohesion between local variables
used for implementation.
(d) Cohesion with respect to time
44. To compute function points (FP), the following
relationship is used Ans : (d) Temporal cohesion is when pairs of module
is grouped by when they are processed the parts are
FP = Count – total × (0.65 + 0.01 × Σ(Fi) where
Fi (i = 1 to n) are value adjustment factors processed at a particular time in program execution.
(VAF) based on n questions. The value of n is : 49. Various storage devices used by an operating
(a) 12 (b) 14 system can be arranged as follows in increasing
(c) 16 (d) 18 order of accessing speed :
Ans : (b) Number of value adjustment factor are based (a) Magnetic tapes → magnetic disks → optical
on response of 14 (Fi, i = 1 to 14) question
disks → electronic disks → main memory →
Fp = count total x (0.65 + 0.01 × Σ (Fi)) where count
cache → registers
total is the sum of all FP entries.
(b) Magnetic tapes → magnetic disks →
45. Assume that the software term defines a
electronic disks → optical disks → main
project risk with 80% probability of
occurrence of risk in the following manner: memory → cache → registers
Only 70 percent of the software components (c) Magnetic tapes → electronic disks →
scheduled for reuse will be integrated into the magnetic disks → optical disks → main
application and the remaining functionality memory → cache → registers
will have to be custom developed. If 60 (d) Magnetic tapes → optical disks → magnetic
reusable components were planned with
disks → electronic disks → main memory →
average component size as 100 LOC and
software engineering cost for each LOC as $ cache → registers
14, then the risk exposure would be : Ans : (d) The electronics are definitely faster because
(a) $ 25,200 (b) $ 20,160 they are ram or flash. So the answer is (d)
(c) $ 17,640 (d) $ 15,120 50. How many disk blocks are required to keep list
Ans : (b) Number of reusable components planed = 60 of free disk blocks in a 16 GB hard disk with 1
• Part of reusable component actually included = 70% kb block size using linked list of free disk
• Number of components developed freshly = 30% of blocks? Assume that the disk block number is
60 = 18 stored in 32 bits.
• Development cost = 18 × 100 × 14% (a) 1024 blocks (b) 16794 blocks
• Probability of occurrence risk = 80% (c) 20000 blocks (d) 1048576 blocks
• Risk exposure = 0.8 × 18 × 100 × 14 = 20160$ Ans : (none of these)
So the answer is (b)
256 disk block address → 1 disk block
46. Maximum possible value of reliability is :
16 M disk block address → X
(a) 100 (b) 100
16M
(c) 1 (d) 0 X= = 65794 {M → 220}
256
Ans : (c) Maximum possible reliability is 1 or 100%
So answer is (c) 51. Consider an imaginary disk 40 cylinders. A
47. 'FAN IN' of component A is defined as request come to read a block on cylinder 11.
While the seek to cylinder 11 is in progress,
(a) Count of the number of components that can
new requests come in for cylinders1, 36, 16, 34,
call, or pass control, to a component A
9 and 12 in that order. The number of arm
(b) Number of components related to component motions using shortest seek first algorithm is :
(c) Number of components dependent on (a) 111 (b) 112
component
(c) 60 (d) 61
(d) None of the above
Ans : (d) 11 – 12 – 9 – 16 – 34 – 36 sequences of
Ans : (a) FAN-in is the number of modules that call a
given module access
Fan-out is the number of modules that called by a given So, 1 + 3 + 7 + 15 + 33 + 2 = 61
module. Hence the answer is (d)
UGC NET JRF Computer Science Dec. 2014 Paper-III 137 YCT
 Search on TG: @apna_pdf
52. An operating system has 13 tape drives. There Ans : (b) DSM (Distributed shared memory) is a form
are three processes P1, P2 & P3. Maximum of memory architecture where the (physical separate)
requirement of P1 is 11 tape drives, P2 is 5 tape memories can be addressed as one (logical shared)
drives and P3 is 8 tape drives. Currently, P1 is address space. DSM system is to make interprocess
allocated 6 tape drives, P2 is allocated 3 tape communication transparent to end users.
drives and P3 is allocated 2 tape drives. Which 55. Equivalent logical expression for the Well
of the following sequences represent a safe Formed Formula (WFF)
state? ∀x)F[x] is :
~(∀
(a) P2 P1 P3 (b) P2 P3 P1 (a) ∀x (~F[x]) (b) ~(∃x)F[x]
(c) P1 P2 P3 (d) P1 P3 P2 (c) ∃x(~F[x]) (d) ∀xF[x]
Ans : (a) Ans : (c) ~((∀x) fx) = (∃ X) (~F(x))
Allocated Max need So answer is (c)
P1 6 11 5 56. An A* algorithm is a heuristic search
P2 3 5 2 technique which :
Total resources = 13 & free resources = 13 – 11 = 2 (a) is like a depth-first search where most
So clearly these 2 can only be given promising child is selected for expansion
allocated max need (20) (b) generates all successor nodes and computes
an estimate of distance (cost) form start node
P3 1 8 6
to a goal node through each of the successors.
to P2 which will be completed 8 release its all 5 It then chooses the successor with shortest
resource then next P1 can take 5 resource & be cost
completed & finally P3 (c) saves all path lengths (costs) from start node
So right answer is (a) P2 P1 P3 to all generated nodes and chooses shortest
53. Monitor is an Interprocess Communication path for further expansion
(IPC) technique which can be described as : (d) none of the above/j
(a) It is higher level synchronization primitive Ans : (b) A* is an informed search algorithm, or a
and is a collection of procedures, variables, best-first search, meaning that it solves problems by
and data structures grouped together in a searching among all possible paths to the solution for
special package the one that incurs the smallest cost (least distance
travelled, shortest time etc) and among these paths it
(b) It is a non-negative integer which apart from first consider the ones that appear to lead most quickly
initialization can be acted upon by wait and to the solution.
signal operations
57. The resolvent of the set of clauses
(c) It uses two primitives, send and receive
which are system calls rather than language (A ∨ B, ~A ∨ D, C ∨ ~B) is :
constructs (a) A ∨ B (b) C ∨ D
(d) It consists of the IPC primitives implemented (c) A ∨ C (d) A ∨ D
as system calls to block the process when Ans : (b) A∨ B, ~A∨D, C∨~B
they are not allowed to enter critical region to A & ~A will cancel out & so will B & ~B
save CPU time Hence answer is (b)
Ans : (a) Monitor is a thread-safe class, object or 58. Match the following :
module that uses wrapped mutual exclusion in order to
Script i. Directed graph
safely allows access to a method or variable by more A. with labelled
than one thread monitor is that its methods are executed nodes for
with mutual exclusion : at each point in time & monitor graphical
grouped their data's in a special package. representation
54. In a distributed computing environment, of knowledge
distributed shared memory is used which is : B. Conceptual ii. Knowledge
(a) Logical combination of virtual memories on Dependencies about objects
the nodes and events is
(b) Logical combination of physical memories stored in
record-like
on the nodes
structures
(c) Logical combination of the secondary
consisting of
memories on all the nodes slots and slot
(d) All of the above values
UGC NET JRF Computer Science Dec. 2014 Paper-III 138 YCT
 Search on TG: @apna_pdf
C. Frames iii. Primitive inferencing steps
concepts and at any time
rules to during
represent consultation
natural D. Knowledge iv. Permits the user
language base to communicate
statement with the system
D. Associative iv. Frame like in a natural way
Network structures used Codes :
to represent
A B C D
stereotypical
(a) i iii iv ii
patterns for
commonly (b) iv iii i ii
occurring (c) i iii ii iv
events in terms (d) iv i iii ii
of actors, roles, Ans : (b)
props and (a) I/O interface : Method is used to transfer
scenes information between internal storage & external I/O
Codes : device is know as I/O interface means it permits the
A B C D user to communicate with the system in a natural way.
(a) iv ii i iii (b) Explanation module : Gives the user, the ability to
(b) iv iii ii i follow inferencing steps at any time during consultation.
(c) ii iii iv i (c) Interference engine : The interference engine is the
main processing element of the expert system. The
(d) i iii iv i
interference engine chooses rules from the agendas to
Ans : (b) fire. It there are no rules on the agenda, the internee
(a) Script : Scripts are a development of the idea of engine must obtain information from the user in order to
representing action and events using semantic networks. add more rules
Script is the idea is that whole set of action fall into (d) Knowledge base : Where the information is stored
stereotypical patterns. in the expert system in the form of fact & rules.
(b) Conceptual Dependences : Conceptual dependency 60. A computer based information system is
is a model of natural language understanding used in AI
needed :
system means it is a primitive concepts & rules to
represent natural language statements. (I) as it is difficult for administrative staff to
process data
(c) Frames : consideration of the use of cases suggest
(II) due to rapid growth of information and
how we can tighten up on the semantic net notation to
communication technology
give something which is more consistent.
(III) due to growing size of organizations which
(d) Associative network : Associate networks are
need to process large volume of data
cognitive models that incorporate long-known
(IV) as timely and accurate decisions are to be
principles of association to represent key feature of
taken
memory means it is a directed graph with labelled nodes
for graphical representation of knowledge. Which of the above statement (s) is/are true?
(a) I and II (b) III and IV
59. Match the following components of an expert
(c) II and III (d) II and IV
system :
Ans : (b) A computer based information system is
I/O interface i. Accepts user's needed because of growing size of organizations which
A. queries and need to process large volume of data & so large data
responds to need timely & accurate decisions
question through So the correct choice is (b)
I/O interface
61. Given the recursively enumerable language
B. Explanation ii. Contains facts
(LRE), the context sensitive language (LCS), the
module and rules about
recursive language (LREC), the context free
the domain language (LCF) and deterministic context free
C. Inference iii. Gives the user, language (LDCF). The relationship between
engine the ability to these families is given by :
follow (a) LCF ⊆ LDCF ⊆ LCS ⊆ LRE ⊆ LREC
UGC NET JRF Computer Science Dec. 2014 Paper-III 139 YCT
 Search on TG: @apna_pdf
(b) LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE 63. According to pumping lemma for context free
(c) LDCF ⊆ LCF ⊆ LCS ⊆ LRE ⊆ LREC languages :
(d) LDCF ⊆ LCF ⊆ LCS ⊆ LREC ⊆ LRE Let L be an infinite context free language, then
Ans : (d) Elements of the Chomsky Hierarchy there exists some positive integer m such that
any w ∈ L with w ≥ m can be decomposed as
w=uvxyz
(a) with vxy ≤ m such that uvi xyi z ∈ L for all
i = 0, 1, 2
(b) with vxy ≤ m, and vy ≥ 1, such that uvi
xyi z ∈ L for all i = 0, 1, 2, ..........
(c) with vxy ≥ m, and vy ≤ 1, such that uvi
xyi z ∈ L for all i = 0, 1, 2, ..........
(d) with vxy ≥ m, and vy ≥ 1, such that uvi
xyi z ∈ L for all i = 0, 1, 2, ..........
Ans : (b) Context free pumping lemma to the
following. Let L be an infinite context language. Then
62. Match the following : there exists some positive integer m such that any w that
List –I List –II is a member of L with w  ≥ m can be decomposed as
A. Context free i. Linear bounded w = uvxyz
grammar automaton with v × y ≤ & vy ≥ 1
B. Regular ii. Pushdown such that wi = uvixyi z
grammar automaton is also in L for all i = 0, 1, 2, .....
C. Context iii. Turing machine 64. Given two spatial masks
sensitive
0 1 0  1 1 1
grammar
S1 = 1 -4 0  and S 2 = 1 -8 1
 
D. Unrestricted iv. Deterministic
grammar finite automaton 0 1 0  1 1 1

Codes : The Laplacian of an image at all points (x, y)

A B C D can be implemented by convolving the image
(a) ii iv iii i with spatial mask. Which of the following can
(b) ii iv i iii be used as the spatial mask?
(c) iv i ii iii (a) only S1 (b) only S2
(d) i iv iii ii (c) Both S1 and S2 (d) None of these
Ans : (b) Ans : (b) Spatial mask for point (x, y) used to
implement the digital laplacian of the 2-D is given by
[f(x + 1, y), + (x –1, y), f(x, 4–1)–4 f(x, y)] so possible
masks are.
0 1 0 1 1 1
1 −4 1 or 1 8 1
0 1 0 1 1 1
here in S1 a 1 is mission on the right side of –4
So the correct answer is (b)
65. Given a simple image of size 10 × 10 whose
histogram models the symbol probabilities and
is given by :
p1 p2 p3 p4
So the answer is (b) a b c d

UGC NET JRF Computer Science Dec. 2014 Paper-III 140 YCT
 Search on TG: @apna_pdf
The first order estimate of image entropy is 69. Five men are available to do five different jobs.
maximum when From past records, the time (in hours) that
(a) a = 0, b = 0, c = 0, d = 1 each man takes to do each job is known and is
1 1 given in the following table :
(b) a = ,b = ,c = 0,d = 0
2 2
1 1 1
(c) a = , b = ,c = ,d = 0
3 3 3
1 1 1 1
(d) a = ,b = ,c = ,d =
4 4 4 4
Ans : (d) In option (d) all elements are in class 1/4.
Hence entropy is least. In option c, a, 3 elements are in Find out the minimum time required to
single class & one in other class. In option b, maximum complete all the jobs.
diffusion, 2 in each class, hence max entropy means (a) 5 (b) 11
option d is the right answer. (c) 13 (d) 15
66. A Butterworth lowpass filter of order n, with Ans : (c) (By using Hungarian method)
cutoff frequency at distance D0 from the origin, Subtract smallest number from present in row/column
has the transfer function H(u, v) given by : (1) All rows
1 1 (2) All columns
(a) 2n
(b) n
 D ( u, v )   D ( u, v ) 
1+   1+  
 D0   D0 
1 1
(c) 2n
(d) n
 D0   D0 
1+   1+  
 D ( u, v )   D ( u, v ) 
Ans : (a) The transfer function of Butterworth low pass
filter of order n with cutoff frequency at distance do the
origin is defined as : H (u, v) = 1/1+(D(u, v) D0)2n
So answer will be (a)
67. If an artificial variable is present in the 'basic
variable' column of optimal simplex table, then
the solution is :
(a) Optimum (b) Infeasible
(c) Unbounded (d) Degenerate
Ans : (b) Else if condition is false it may be unbounded
So answer is (b)
So, P–2, Q–1, R–4, S–3, T–3
68. The occurrence of degeneracy while solving a
= 2 + 1 + 4 + 3 + 3 = 13
transportation problem means that
So the answer is (c)
(a) total supply equals total demand
70. Consider the following statements about a
(b) total supply does not equal total demand
perception :
(c) the solution so obtained is not feasible
I. Feature detector can be any function of the
(d) none of these
input parameters.
Ans : (c) Choice A is must be start for a solution
II. Learning procedure only adjusts the
Choice B is converted to case A first then we try
connection weights to the output layer.
solution we can find unfeasible solution i.e. allocations
Identify the correct statement out of the
are less than m+n–1 which is a case degenracy.
following :
UGC NET JRF Computer Science Dec. 2014 Paper-III 141 YCT
 Search on TG: @apna_pdf
(a) I is false and II is false Codes :
(b) I is true and II is false A B C D
(c) I is false and II is true (a) i ii iii iv
(d) I is true and II is true (b) i iii ii iv
(c) ii iv iii i
Ans : (d) (i) Feature detection includes methods for
(d) ii iii iv i
computing abstractions of image information & it can
Ans : (a) Supervise is under some guidance by some
be function of the input parameters
teacher
(ii) The learning procedure only adjust the connection to Reinforcement is evaluation in form of reward
the output layer because output layer calculate it's Unsupervised is no information about desired responses
output in the same way as the hidden layer. Recording is be some memory storage.
71. A......... point of a fuzzy set A is point x ∈ at 73. Which of the following versions of window O.S.
which µA(x) = 0.5 contain built-in partition manager which
(a) core (b) support allows us to shrink and expand pre-defined
drives?
(c) crossover (d) α-cut
(a) Windows vista (b) Window 2000
Ans : (c) The crossover of a fuzzy set is the element in (c) Window NT (d) Window 98
U at which its membership function is o.5. Ans : (a) Windows vista have logical disk manager
The support of a fuzzy set F is the crispset of all points that supports shrinking & expanding volumes vista also
in the universe of discourse U such that the membership have a program that allow a user to upgrade their
function of f is non-zero running vista to higher edition.
If membership is 1 then it is a core of fuzzy set alpha 74. A Trojan horse is :
cut can be anything term to 1 (0<=λ⇐1) (a) A program that performs a legitimate
µ A(x) = 0.5 function that is known to an operating system
or its user and also has a hidden component
72. Match the following learning modes w.r.t.
that can be used for nefarious purposes like
characteristics of available information for attacks on message security or impersonation
learning : (b) A piece of code that can attach itself to other
A. Supervised i. Instructive programs in the system and spread to other
information on systems when programs are copied or
transferred
desired
(c) A program that spreads to other computer
responses
systems by exploiting security holes like
explicitly
weaknesses in facilities for creation of
specified by a remote processes
teacher (d) All of the above
B. Recording ii. A priori design Ans : (a) Trojan horse is any malicious program which
information for is used to hack into a computer by misleading users of it
memory storing true intent. Trojan can achieved any number of attack
C. Reinforcement iii. Partial on the host from irritating the user to damaging the host
(deleting files, stealing data, spread other virus)
information
about desired 75 . Which of the following computing models is
responses, or not an example of distributed computing
environment?
only "right" or
(a) Cloud computing
"wrong"
(b) Parallel computing
evaluative
(c) Cluster computing
information
(d) Peer-to-peer computing
D. Unsupervised iv. No information
Ans : (b) Parallel computing means that different
about desired activities happen at same time. It means speed out a
responses single application over many processors to get it faster.
UGC NET JRF Computer Science Dec. 2014 Paper-III 142 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2015

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. How many strings of 5 digits have the property Which of the above statements are true?
that the sum of their digits is 7? (a) (S1) and (S2)
(a) 66 (b) 330 (b) (c) and (S4)
(c) 495 (d) 99 (c) (S1), (S2) and (S3)
Ans. (b) : Partition of 7: (d) (S1), (S2), (S3) and (S4)
7, 0, 0, 0, 0 6, 1, 0, 0, 0 5, 2, 0, 0, 0
Ans. (d) : All the statements are true, so answer is (d)
5, 1, 1, 0, 0 4, 3, 0, 0, 0 4, 2, 1, 0, 0
4, 1, 1, 1, 0 3, 3, 1, 0, 0 3, 2, 2, 0, 0 5. Consider a Hamiltonian Graph (G) with no
loops and parallel edges. Which of the
3, 2, 1, 1, 0 3, 1, 1, 1, 1 2, 2, 2, 1, 0
following is true with respect to this Graph
2, 2, 1, 1, 1
(G)?
Arrangement of above partition = 5!4!+5!3!+5!3!
+ 5!2!2!+5!3!+5!2!+5!3!+5!2!2! + 5!2!2! + 1. deg (v) ≥ n/2 for each vertex of G
5!2!+5!4!+5!3!+5!3!2! 2. E(G) ≥ 1/2 (n–1) (n–2) + 2 edges
= 5 + 20 + 20 + 30 + 20 + 60 + 20 +30 +30 +60 +50 3. deg (v) + deg (w) ≥ n for every v and ω not
+20 + 10 connected by an edge
= 330 (a) 1 and 2 (b) 2 and 3
2. Consider an experiment of tossing two fair (c) 1 and 3 (d) 1, 2 and 3
dice, one black and one red. What is the
probability that the number on the black die Ans. (d) : S1: Dirac theorem: A simple graph with n
divides the number on red die? vertices (n ≥ 3) is hamiltonian if every vertex has
degree n/2 or greater.
22 12
(a) (b) S2: Maximum number of edge is non-hamilton graph is
36 36
 (n −1) 
14 6 |E(G)| ≤   +1
(c) (d)  2 
36 36
Ans. (c) : (1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (2, Therefore, minimum number of edges in Hamilton
2), 2, 4), (2, 6) (3, 3), (3, 6), (4, 4), (5, 5), (6,6) graph is
Total number of possible pout comes = 14  (n −1) 
| E(G) | ≥  +2
Probability that the number of black dice divides the  2 
number dice = 14/36
(n −1) /(n − 2)
3. In how many ways can 15 indistinguishable | E(G) | ≥ +2
fish be placed into 5 different ponds, so that 2
each pond contains at least one fish? S3: ORe's theorem for hamiltonian graph states that
(a) 1001 (b) 3876 deg (v)+ deg(w) ≥ n for every v and w not connected
(c) 775 (d) 200 by an edge.
Ans. (a) : Number of ways it can be done = number of 6. Consider the following statements :
positive integer solution of S1: Boolean expressions and logic networks
⇒ x1 + x2 + x3 + x4 + x5 = 15 correspond to labeled acrylic digraphs.
⇒ (15–1)C4 = 14 c4 = 1001 S2: Optimal Boolean expressions may not
4. Consider the following statements : correspond to simplest networks.
S1: Depth - first search is used to traverse a S3: Choosing essential blocks first in a Carnage
rooted tree. map and then greedily choosing the largest
S2: Pre - order, Post-order and In order are used remaining blocks to cover may not give an
to list the vertices of an ordered rooted tree. optimal expression.
S3: Huffman's algorithm is used to find an Which of these statements(s) is/are correct?
optimal binary tree with given weights. (a) S1 only (b) S2 only
S4: Topological sorting provides a labeling such (c) S1 and S2 (d) S1, S2 and S3
that the parents have larger labels than their
Ans. (d) : All are correct.
children.
UGC NET JRF Computer Science June 2015 Paper-II 143 YCT
 Search on TG: @apna_pdf
7. Consider a full - adder with the following input c. (p→q) ⇔ [(p∧–q)→0) iii. Reduction
values : as absurdum
(a) x = 1, y = 0 and C1 (carry input) = 0 d. (p↔q) ⇔ [(p→q) ∧ iv. Equivalence
(b) x = 0, y = 1 and C1 = 1 (q→p)]
Compute the values of S(sum) and C0 (carry Codes :
output) for the above input values.
a b c d
(1) S = 1, C0 = 0 and S = 0, C0 = 1
(a) (i) (ii) (iii) (iv)
(2) S = 0, C0 = 0 and S = 1, C0 = 1
(b) (ii) (iii) (i) (iv)
(3) S = 1, C0 = 1 and S = 0, C0 = 1
(c) (iii) (ii) (iv) (i)
(4) S = 0, C0 = 1 and S = 1, C0 = 0
(d) (iv) (ii) (iii) (i)
Ans. (a) : A full adder can be implemented in many
Ans. (a) :
different ways such as with a custom transistor level
(a) The contra positive of a conditional statement is
circuit or composed of other gates.
formed by negating both the hypothesis & the
One implemented is with S = A ⊕ B ⊕ Cin and conclusion, and then interchanging the resulting
Cout = (A ⋅ B) + ( Cin (A ⊕ B)). negations.
Given, ex. (P → Q) ⇔ (7 Q → 7 P)
S1: x = A = 1, y = B = 0 and Cin = 0 (b) Exportation is a valid rule of replacement in
Then, S = 1 S = 1 ⊕ 0 ⊕ 0 = 1 ⊕ 0 = 1 propositional logic
((P ∧ Q) →R) ⇔ (P → (Q → R))
C = (1.0) + (0(1⊕ 0)) = 0
(c) Reduction and absurdum ⇒
S2: x = A = 0, y = B = 1 and Cin = 1 (P → Q) ⇔ [(P ∧ Q) → 0]
Then, S = 0 ⊕1 ⊕1 = 0 ⊕ 0 = 0 (d) Logical equality is an operation on two logical
C = (0.1) + (1(0 ⊕1)) = 0 + 1 =1 values, typically the values of two preposition that
produces a value of true & false
8. "If may computations are correct and I pay the
(P → Q) ∧ (Q → P)
electric bill, then I will run out of money. If 1
don't pay the electric bill, the power will be 10. Consider a proposition given as :
turned off. Therefore, if I don't run out of " x ≥ 6, if x2 ≥ 25 and its proof as :
money and the power is still on, then my If x ≥ 6, then x2 = x . x ≥ 6 . 6 = 36 ≥ 25
computations are incorrect." Which of the following is correct w.r.to the
Convert this argument into logical notations given proposition and its proof?
using the variables c, b, r, p for propositions of (1) The proof shows the converse of what is to be
computations, electric bills, out of money and proved
the power respectively. (Where – means NOT) (2) The proof starts by assuming what is to be
(a) if (c ^ b) → r and ¬ b → ¬ p, then (¬ r ^ p) → shown
¬c (3) The proof is correct and there is nothing
wrong
(b) if (c ^ b) → r and ¬ b → ¬ p, then (r ^ p) → c (a) (1) only (b) (3) only
(c) if (c ^ b) → r and ¬ p → ¬ b, then (¬ r ^ p) → (c) (1) and (2) (d) (2) only
¬c Ans. (c) : Let P : x > = 6 Q : x ∧ z = 25 then given
(d) if (c ^ b) → r and ¬ b → ¬ p, then (¬ r ^ p) → statement can be written as Q → P & its given proof
¬c may be written as P → Q which is converse of Q → P
80 (1) is correct
Ans. (a) : S1: (c ^ b) → r
we have to prove P & we are assuming it in our proof
S2: (¬b → ¬ p) so (2) is also true.
Conclusion = ( ¬r ^p ) → ¬c So answer is (c)
11. What is the output of the following program?
same as if (c ^ b) → r and ¬ b → ¬ p,
(Assume that the appropriate directive are
then (¬ r ^ p) → ¬ c included and there is no syntax error)
9. Match the following : main ()
List–I List–II { char S[ ] = "ABCDEFGH",
a. (p→q)⇔(¬q→¬p) i. Contra print f ("%C", * (&S[3]));
positive print f ("%s", S + 4);
b. [(p∧q)→r]⇔[p→(q→r)] ii. Exportation print f ("%u", S);
law /* Base address of S is 1000*/ }
UGC NET JRF Computer Science June 2015 Paper-II 144 YCT
 Search on TG: @apna_pdf
(a) ABCDEFGH1000 15. When the inheritance is private, the private
(b) CDEFGH1000 methods in base class are ................ in the
(c) DDEFGHH1000 derived class (in C++).
(d) DEFGH1000 (a) inaccessible (b) accessible
Ans. (d) : S is pointer of character array: (c) protected (d) public
1000 1001 1002 1003 1004 1005 1006 1007 1008 Ans. (a) : Inaccessible in the derived Class, only
A B C D E F G H \o public or protected members are inherited
So answer is (a)
S[3] is character at index 3 of array S which is 'D' and
& (S[3]) is address of 'D' but "%c" printed character at 16. An assertion is a predicate expressing a
address of 'D' which is 'D' itself. condition we wish database to always satisfy.
(S + 4) escapes 4 character of array of S then The correct syntax for Assertion is :
remaining printed till null which string is "EFGH". (a) CREATE ASSERTION 'ASSERTION Name'
"%u" printed address of array S which is given as CHECK 'Predicate'
1000. (b) CREATE ASSERTION 'ASSERTION Name'
Therefore final printed is "DEFGH1000". (c) CREATE ASSERTION, CHECK Predicate
12. Which of the following in C++, is inherited in a (d) SELECT ASSERTION
derived class from base class? Ans. (a) : CREATE ASSERTION 'ASSERTION
(a) constructor (b) destructor Name' CHECK 'Predicate' is the proper syntax for
(c) data members (d) virtual methods applying constraints.
Ans. (c) : Data members in C++ is inherited in a For example : This SQL statement creates an assertion
derived class from base class. to demand that there's no more than a single president
Constructor is a member function of a class which among the employees.
initialize objects of a class. In C++, constructor is auto Create assertion AT-MOST-ONE-PRESIDENT as
matically called when object create. It is special CHECK
member function of the class. (Select count (*) from EMPe where e job =
Destructor is a member function which destructs or PRESIDENT +4) < I)
deletes an object.
17. Which of the following concurrency protocol
Virtual methods is a method which is redefined (over-
ensures both conflict serializability and
ridden) in derived class.
freedom from deadlock?
13. Given that x = 7.5, j = – 1.0. n = 1.0, m = 2.0 (1) z - phase Locking
the value of – – x + j = = x > n > = m is : (2) Time stamp - ordering
(a) 0 (b) 1
(a) Both (a) and (b)
(c) 2 (d) 3
(b) (1) only
Ans. (a) : – – x + j = = x > n > = m (c) (2) only
Here we need to check LHS = = RHS. So we get
(d) Neither (1) nor (2)
answer as 0 or 1 only. By applying values
– – 7.5 + (– 1.0) = = (7.5 > 1.0) = 2.0 Ans. (c) : In basic two phase locking there is a chance
for deadlock.
(6.5 – 1.0) = = (0 > 2.0)
Conservative 2 phase is deadlock free
(5.5 = = 0)
Return false (0) since 5.5 is not equal to 0. So answer is (2) only
14. Which of the following is incorrect in C++? 18. Drop Table cannot be used to drop a Table
referenced by ......................constraint.
(a) When we write overloaded function we must
code the function for each usage (1) Primary key (2) Sub key
(b) When we write function template we code the (3) Super key (4) Foreign key
function only once (a) (1) (b) (1), (2) and (3)
(c) It is difficult to debug macros (c) (4) (d) (1) and (4)
(d) Templates are more efficient than macros Ans. (c) : If you drop child table first, the foreign key
Ans. (d) : First 3 choice are correct, & so it 4th will be dropped as well. If you attempt to drop percent
Templates undoubtedly take larger. table first you will get an "could not drop object "a"
However, templates are significantly more powerful because it is referenced by a foreign key constraint
and obey C++ syntactical rules, where as macros do error, Drop table can not be used to drop a table
not. reference by a foreign key constraint. The referencing
Template take more compilation time than macros. So, foreign key constraint or the referencing table must be
macros are more efficient in term of time. dropped.

UGC NET JRF Computer Science June 2015 Paper-II 145 YCT
 Search on TG: @apna_pdf
19. Database applications were built directly on (c)
top of file system to overcome the following
drawbacks of using file-systems :
(1) Data redundancy and inconsistency
(2) Difficulty in accessing Data
(3) Integrity problems
(a) (1) (b) (1) and (4)
(c) (1), (2) and (3) (d) (1), (2), (3) and (4)
Ans. (d) : Traditional file system has all mentioned
drawbacks. Database applications built by using tables (d)
are used to overcome them.
eg : Normalization and integrity constraints reduces
redundancy & inconsistency.
Select * from table provide easy access to data
references, joins etc removes data is action primary &
foreign key along with check predicates solves
integrity problem
20. For a weak entity set to be meaningful, it must
be associated with another entity set in
combination with some of their attribute Ans. (b) : Using
values, is called as :
(a) Neighbor Set (b) Strong Entity Set
(c) Owner Entity Set (d) Weak Set
Ans. (c) : Every weak entity must be associated with
an identifying entity i.e. the weak entity set is said to
be existence dependent on the identifying set. The
identifying entity set is said to own the weak entity set
that it identifies. It is also called owner entity set.
21. Consider the given graph MST :

Its Minimum cost spanning tree is ...........

(a)
Option (b) = MST : 10 + 12 + 14 + 16 + 22 + 25 = 99
So the minimum is option (b), hence the answer is (b)
22. The in order and preorder Traversal of binary
tree are dbeafcg and abdecfg respectively. The
post-order Traversal is ..........
(a) dbefacg (b) debfagc
(c) dbefcga (d) debfgca
Ans. (a) : Take the first node in preorder traversal a
(b) will be the root.
Now we construct the binary tree

Therefore, postorder is - debfgca

UGC NET JRF Computer Science June 2015 Paper-II 146 YCT
 Search on TG: @apna_pdf
23. Level order Traversal of a rooted Tree can be Codes :
done by starting from root and performing : A B C D
(a) Breadth first search (b) Depth first search (a) (iv) (i) (ii) (iii)
(c) Root search (d) Deep search (b) (ii) (i) (iv) (iii)
Ans. (a) : Level order traversal is similar to breadth (c) (ii) (iv) (iii) (i)
first search whereas preorder traversal is similar to (d) (ii) (iv) (i) (iii)
depth first search. Ans. (d) :
So answer is (a) 23 port number is (TELNET) that uses by remote login
24. The average case occurs in the Linear search 25 port number is (SMTP) that uses by E-mail
Algorithm when 80 port number is (HTTP) that uses by world wide web
(a) The item to be searched is in some where 119 port number is used by USENET news
middle of the array
28. Which of the following is not associated with
(b) The item to be searched is not in the array the session layer?
(c) The item to be searched is in the last of the (a) Dialog control
array
(b) Token management
(d) The item to be searcher is either in the last or
(c) Semantics of the information transmitted
not in the array
(d) Synchronization
Ans. (a) : Linear search runs in at worst linear time
and make at most n comparisons, where n is the length Ans. (c) : Semantics of the information transmitted is
of the list. If each element is equally likely to be not associated with the session layer but associated
searched then the linear search has an overage case of with presentation layer
(n/2) comparisons, but the average case can be affected So answer is (c)
if the search probability for each element vary. 29. What is the size of the 'total length' in IPv4
25. To determine the efficiency of an algorithm the datagram?
time factor is measured by: (a) 4 bits (b) 8 bits
(a) Counting micro seconds (c) 16 bits (d) 32 bits
(b) Counting number of key operations Ans. (c) : Total length 16 bit field define the entire
(c) Counting number of statements packet size in IPv4, including header and data, in
(d) Counting kilobytes of algorithm bytes. The minimum length packet is 20 bytes (20 byte
Ans. (b) : The complexity is commonly estimated by header. + 0 byte data) and maximum is 65, 535 bytes
counting the number of elementary operations the maximum value of a 16 bit word.
performed by the algorithm, where an elementary 30. Which of the following is/are restriction (s) in
operation takes a fixed amount of time to perform. classless addressing?
Thus the amount of time taken and the number of (a) The number of addresses needs to be power
elementary operations performed by the algorithm of 2
differ by at most a constant factor. (b) The mask needs to be include in the address
26. Which of the following protocols is an to define the block
application layer protocol that establish, (c) The starting address must be divisible by the
manages and terminates multimedia sessions? number of addresses in the block
(a) Session maintenance protocol (d) All of the above
(b) Real – time streaming protocol Ans. (d) : In class addressing : (1) the number of
(c) Real – time transport control protocol addresses needs to be power of 2
(d) Session Initiation protocol (2) The mask needs to be included in the address to
Ans. (d) : Session initiation protocol is an application define the block
layer control protocol that can establish, modify & (3) The starting address must be divisible by the
terminate multimedia sessions such as internet number of addresses in block
telephony calls. So answer is (d)
27. Match the following port numbers with their 31. Match the following :
uses : List – I List - II
List - I List - II (A) Forward (i) Assembler
(A) 23 (i) World wide web Reference directive
(B) 25 (ii) Remote login Table
(C) 80 (iii) USENET news (B) Mnemonic (ii) Uses array data
(D) 119 (iv) E-mail Table structure
UGC NET JRF Computer Science June 2015 Paper-II 147 YCT
 Search on TG: @apna_pdf
(C) Segment (iii) Contains 35. Which phase of compiler generates stream of
Register machine OP atoms?
Table code (a) Syntax Analysis (b) Lexical Analysis
(D) EQU (iv) Uses linked list (c) Code Generation (d) Code Optimization
data structure Ans. (a) : Syntax analysis is the second phase of a
Codes : compiler. A syntax analyzer takes the input from a
A B C D lexical analyzer in the form of taken streams. The
(a) (ii) (iii) (iv) (i) parser analyzer the source code against the production
(b) (iii) (iv) (ii) (i) rules to detect any errors in the code & the output of
(c) (iv) (i) (iii) (ii) the phase is stream of atoms.
(d) (iv) (iii) (ii) (i)
36. A disk drive has 100 cylinders, numbered 0 to
Ans. (d) : 99. Disk requests come to the disk driver for
(a) Forward reference table uses linked list data cylinders 12, 26, 24, 4, 42, 8 and 50 in that
structure so it satisfies (iv) order. The driver is currently serving a request
(b) Mnemonic table contains machine op code, so it at cylinder 24. A seek takes 6 msec per cylinder
satisfies (iii)
moved. How much seek time is needed for
(c) Segment register table uses array data structure so
shortest seek time first (SSTF) algorithm?
it satisfies (ii)
(d) EQO satisfies (i) (a) 0.984 sec (b) 0.396 sec
(c) 0.738 sec (d) 0.42 sec
32. The translator which performs macro calls
expansion is called : Ans. (d) : Given requests is: 12, 26, 24, 4, 42, 8, 50
(a) Macro processor Using SSTF (shortest seek time first) algorithm:
(b) Micro pre-processor Total distance covered
(c) Macro pre-processor = 2 + 22 + 46 = 70
(d) Dynamic Linker Total seek time is:
Ans. (c) : Translator which performs macro calls = 70 × 6 msec
expansion is called macro pre-processors = 70 × 6 × 10-3 sec = 0.42 sec
33. If all the production rules have single non- 37. Let Pi and Pj be two processes, R be the set of
terminal symbol on the left side, the grammar variables read from memory, and W be the set
defined is : of variables written to memory. For the
(a) context free grammar concurrent execution of two processes Pi and Pj
(b) context sensitive grammar which of the following conditions is not true?
(c) unrestricted grammar (a) R(Pi) ∩ W(Pj) = Φ
(d) phrase grammar (b) W(Pi) ∩ R(Pj) = Φ
Ans. (a) : Context free grammar is a set of recursive (c) R(Pi) ∩R(Pj) = Φ
rewriting rules used to generate patterns of strings. It is (d) W(Pi) ∩W(Pj) = Φ
consisting of finite set of grammar rules is a quadruple
& if all the production rule have single non-terminal Ans. (c) : Reading of two process won't create any
symbol on the left side, the grammar defined is context problem,
free grammar So answer is (c)
i.e. V → (T + V)+ 38. A LRU page replacement is used with four
34. Which one from the following is false? page frames and eight pages. How many page
(a) LALR parser is Bottom – up parser faults will occur with the reference string
0172327103 if the four frames are initially
(b) A parsing algorithm which performs a left to
empty?
right scanning and a right most deviation is
RL (1) (a) 6 (b) 7
(c) LR parser is Bottom - Up parser (c) 5 (d) 8
(d) In LL (1), the 1 indicates that there is a one - Ans. (b) :
symbol look - ahead. 1 2 3 4 5 hit hit hit 6 7
Ans. (b) : There is nothing RL (1) parsing we have LR 0 0 0 0 3 3 3 3 0 0
(1) parsing algorithm where L stands for left to right 1 1 1 1 1 1 1 1 1
scanning of the input string & R signifies that we will
7 7 7 7 7 7 7 7
get a right most derivation. LALR & LR are bottom up
parsers. 2 2 2 2 2 2 3
So answer (b) Total Page fault = 7
UGC NET JRF Computer Science June 2015 Paper-II 148 YCT
 Search on TG: @apna_pdf
39. What does the following command do? Codes :
grep – vn "abc" x A B C D
(a) It will print all of the lines in the file x that (a) (iii) (iv) (i) (ii)
match the search string "abc" (b) (ii) (i) (iv) (iii)
(b) It will print all of the lines in file x that do not
(c) (iv) (ii) (iii) (i)
match the search string "abc"
(c) It will print the total number of lines in the (d) (iii) (i) (iv) (ii)
file x that match the string "abc" Ans. (d) :
(d) It will print the specific line numbers of the (a) Size oriented metrics is directly implied with (iii)
file x in which there is a match for string (b) Function oriented metrics is number of user inputs,
"abc" number of user outputs, number of files, number of
Ans. (b) : Grep (globally search a regular expression external interfaces. So it satisfies (i)
& print it) with –V (verbose) option display those line (c) Extended function point metrics is a superset of the
which do not contain the specified string. function point measure that can be applied to system. It
So answer is (b) uses algorithm characteristics as one of the
40. The Unix Kernel maintains two key data measurement parameter.
structures related to processes, the process (d) Function point is a "unit of measurement" to
table and the user structure. Which of the express the amount of business functionality an
following information is not the part of user information provides to a user.
structure? 42. In which testing strategy requirements
(a) File descriptor table established during requirements analysis are
(b) System call state validated against developed software?
(c) Scheduling parameters (a) Validation testing (b) Integration testing
(d) Kernel stack (c) Regression testing (d) System testing
Ans. (c) : The unix kernal maintains two key data Ans. (a) : Validation is "Are we building the right
structures related to processes, the process table and
product? According to the capability maturity model
the user structure. In user structure there is no place for
scheduling parameter process table stores the Software validation : The process of evaluating
information of all running process. The process table software during or at the end of the development
contains process ID's, memory usage of the process, process to determine whether it satisfies specified
what are file descriptor used in the process. So, option requirements.
(c) is correct. 43. Which process model is also called as classic
41. Match the following : life cycle model?
List - I List - II (a) Waterfall model (b) RAD model
(A) Size- (i) Uses number of (c) Prototyping model (d) Incremental model
oriented external Ans. (a) : The waterfall model was first process model
metrics interfaces as one to be introduce.
of the
measurement • It is also referred as linear sequential life cycle
parameter model
(B) Function- (ii) Originally • It is very simple to understand and use. In this each
oriented designed to be phase must be complicated fully before the next
metrics applied to phase can begin.
business • In this model the testing stands only after the
information development is complete
system
• In this model phases do not overlap
(C) Extended (iii) Derived by
function normalizing 44. Cohesion is an extension of :
point quality and/or (a) Abstraction concept
metrics productivity (b) Refinement concept
measures by (c) Information hiding concept
considering the (d) Modularity
size of the
Ans. (c) : A cohesion module performs a single task
software
within a software procedure, requiring little interaction
(D) Function (iv) uses algorithm with little procedures in other parts of software.
point characteristics
as one of the Type of cohesion :
measurement • A module that performs takes that are related
parameter logically is logically cohesion
UGC NET JRF Computer Science June 2015 Paper-II 149 YCT
 Search on TG: @apna_pdf
• When a module contains takes that are related by PVM task and that there is no limit to the size
the fact that all must be executed with the same or number of such messages
span of time, the exhibits temporal cohesion (d) In PVM model, the message order is not
• At the low end of the spectrum, a module that preserved.
performs a set of takes that relate to each other Ans. (d) : Fault tolerance through dynamic addition &
loosely called coincidentally cohesive. deletion of hosts/processes.
45. Which one from the following is highly A widely used parallel message passing library defines
associated activity of project planning? • How takes communicative or synchronize with
(a) Keep track of the project progress each other
(b) Compare actual and planned progress and 48. Which of the following algorithms sort n
costs integers, having the range 0 to (n2 – 1), in
(c) Identify the activities, milestones and ascending order in O(n) time?
deliverables produced by a project (a) Selection sort (b) Bubble sort
(d) Both (b) and (c) (c) Radix sort (d) Insertion sort
Ans. (c) : Project planning is commonly perceived as Ans. (c) : Radix sort take O(n) time, so answer is (c)
creating 'Gantt chart', which is incorrect. Gantt chart is 49. Which of the following statements is FALSE
merely visual representation of project schedule. about weak entity set?
(a) Weak entities can be deleted automatically
when their strong entity is deleted
(b) Weak entity set avoids the data duplication
and consequent possible inconsistencies
caused by duplicating the key of the strong
entity
(c) A weak entity set has no primary keys unless
attributes of the strong entity set on which it
depends are included
(d) Topples in a weak entity set are not
46. In the case of parallelization, Amdahl's law partitioned according to their relationship
states that if P is the proportion of a program with topples in a strong entity set
that can be made parallel and (1–P) is the Ans. (d) : We have weak entities for several reasons :
proportion that cannot be parallelized, then the • We want to avoid the data duplication and
maximum speed-up that can be achieved by consequent entity. Possible inconsistencies caused
using N processors is : by duplicating the key of strong.
1 1 • Weak entities be stored physically with their strong
(a) (b)
(1 − P ) + N.P ( N − 1) P + P entities
1 1 • Weak entities can be detected automatically when
(c) (d)
(1 − P ) +
P
P+
(1 − P ) their strong entity is detected.
So (d) is incorrect statement, Hence (d) is the answer.
N N
50. Which of the following is not valid with
Ans. (c) : Amdahl's law states that if P is the reference to message passing interface (MPI)?
propagation of a program that can be made parallel &
(a) MPI can run on any hardware platform
(1 – P) is the propagation that cannot be parallelized,
then the maximum speed up that can be achieved by (b) The programming model is a distributed
using N processors is. memory model
(c) All parallelism is implicit
1
(d) MPI - Comm. - size returns the total number
P
(1 − P ) + of MPI processes in specified communication
N
Ans. (c) : Message passing interface (MPI) is a
47. Which of the following statement is incorrect standardized and portal message passing system.
for parallel virtual machine (PVM)?
• It can run on any hardware platform. It is portable,
(a) The PVM communication model
efficient, flexible.
asynchronous blocking send, asynchronous
blocking receive, and non-blocking receive • It has become a de facto standard for
function. communication among memory system.
(b) Message buffers are allocated dynamically • MPI – Comm. – Size returns the total number of
(c) The PVM communication model assumes MPI processes in specified communication.
that any task can send a message to any other So answer is (c)

UGC NET JRF Computer Science June 2015 Paper-II 150 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2015

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. For the 8-bit word 00111001, the check bits RST3 0015 H
stored with it would be 0111. Suppose when the RST4 0020 H
word is read from memory, the check bits are RST5 0025 H
calculated to be 1101. What is the data word
RST6 0030 H
that was read from memory?
(a) 10011001 (b) 00011001 RST7 0035 H
(c) 00111000 (d) 11000110 4. The equivalent hexadecimal notation for octal
Ans : (b) Given 8 bit word 00111001. encoded in d8 = number 2550276 is :
0, d7 = 0, d6 = 1 d5 = 1, d4 = 1 d3 = 0, d2 = 0, d1 = 1 (a) FADED (b) AEOBE
parity is calculated as 0111 which are written as (c) ADOBE (d) ACABE
p8p4p2p1 Ans : (c) Given octal No. is
p1 = 1 p4 = 1 p2 = 1 p8 = 0 (2550276)8 = (010 101 101 000 010 111 110)2
encoded the string as ⇒ (01 010 1101 0000 1011 1110)2
d8d7d6d5p8d4d3d2p4d1p2p1 ⇒ (0AD0BE)16
001101001111 (AD0BE)16
check bit at other end is 1101 5. The CPU a system having 1 MIPS execution
C1 = 1 C4 = 1 needs 4 machine cycles on an average for
C2 = 0 C8 = 1 executing an instruction. The fifty percent of
XOR(1101, 0111) = 1010. Its decimal conversion is 10, the cycles use memory bus. A memory
so 10th is changed. 10th digit is d6. so we flip & 4x get read/write employs one machine cycle. For
00011001 execution of the programs, the system utilizes
2. Consider a 32-bit microprocessor, with a 16 - 90 percent of the CPU time. For block data
transfer, an IO device in attached to the system
bit external data bus, driven by an 8 MHz while CPU executes the background programs
input clock. Assume that this microprocessor continuously. What is the maximum I/O data
has a bus cycle whose minimum duration transfer rate if programmed I/O data transfer
equals four input clock cycles. What is the technique is used?
maximum data transfer rate for this (a) 500 Kbytes/sec (b) 2.2 Mbytes/sec
microprocessor?
(c) 125Kbytes/sec (d) 250 Kbytes/sec
(a) 8 × 106 bytes/sec (b) 4 × 106 bytes/sec
Ans : (d) CPU speed 1 MPS = 1096 instruction per sec
(c) 16 × 10 bytes/sec (d) 4 × 109 bytes/sec
6
1 CPU instruction = 4 machine cycle (AVG)
Ans : (b) Since minimum bus cycle duration = 4 clock
1 memory read/access = 1 machine cycle
cycle bus clock = 8 MHZ
CPU utilization = 90%
then, maximum bus cycle rate = 8 m/4 = 2m/sec
Programmed I/0
Data transferred per bus cycle = 16 bit = 2 B
each byte transfer requires 4 cycle (instruction) in status
Data transfer rate per second = bus cycle rate × data per
check status
bus cycle = 2 M × 2 = 4 × 106 B/sec
Branch
So option (b) is correct.
Read/write data
3. The RST 7 instruction in 8085 microprocessor 6

is equivalent to : max data transfer rate CPUspeed = 10 = 250 kbytes/sec

4 4
(a) CALL 0010 H (b) CALL 0034 H
6. The number of flip-flops required to design a
(c) CALL 0035 H (d) CALL 003C H
modulo – 272 counter is :
Ans : (c)
(a) 8 (b) 9
Interrupt Vector Address (c) 27 (d) 11
RST0 0000 H Ans : (b) Remember with 'n' number of flip-flop you
RST1 0005 H can get upto maximum modulo - (2n) counter.
RST2 0010 H Since 29 = 512 > 272 it can satisfy the condition.
UGC NET JRF Computer Science June 2015 Paper-III 151 YCT
 Search on TG: @apna_pdf
7. Let E1 and E2 be two entities in E-R diagram (b) Non_key attribute V_name is dependent on
with simple single valued attributes. R1 and R2 Qty_sup
are two relationships between E1 and E2 where (c) Key attribute Qty_sup is dependent on
R1 is one - many and R2 is many - many. R1 primary_key unit price
and R2 do not have any attribute of their own. (d) Key attribute V_ord_no is dependent on
How minimum number of tables are required primary_key unit price
to represent this situation in the Relational Ans : (a) Option (a) is which it is clearly mentioned
model? that partial dependency exists is against 2NF principle.
(a) 4 (b) 3 Question seems incomplete, because there is nothing
(c) 2 (d) 1 said about functional dependency.
Ans : (b) One table for each entity : 2 11 . The relation schemas R1 and R2 form a
R1 is one to many (No separate table): 0 Lossless join decomposition of R if and only if :
R2 is many to many and requires one separate table: 1 (1) R1 ∩R2 → → (R1 – R2)
Total number of tables: 3 (2) R1 →R2
8. The STUDENT information in a university (3) R1 ∩ R2 → → (R2 – R1)
stored in the relation STUDENT (Name, SEX, (4) R 2 → R 1 ∩ R2
Marks, DEPT _Name) Codes :
Consider the following SQL query SELECT (a) (1) and (2) happens
DEPT_Name for STUDENT where SEX = 'M' (b) (1) and (4) happens
group by DEPT_Name having avg (Marks) > (c) (1) and (3) happens
SELECT avg (Marks) STUDENT. It Returns (d) (b) and (3) happens
the Name of the Department for which : Ans : (c) Let F be a set of functional dependencies on
(a) The average marks of male students is more R, and R1 and R2 form a decomposition of R. The
than the average marks of students in the decomposition is a lossless join decomposition of R if at
same Department least one of the following functional dependencies are
+
(b) The average marks of male students is more in F
than the average marks of students in the 1– R1 ∩ R2 → R 1
University 2– R1 ∩ R2 → R 2
(c) The average marks of male students is more
than the average marks of male students in 12. In the indexed scheme of blocks to a file, the
the University maximum possible size of the file depends on :
(d) The average marks of students is more than (a) The number of blocks used for index and the
the average marks of male students in the size of index
University (b) Size of Block and size of Address
(c) Size of index
Ans : (b) The average marks of male students is more
than the average marks of student in the university. (d) Size of Block
Ans:(a) When indexes are created, the maximum
9. Select the 'False' statement from the following
number of blocks given to a file depends upon the size
statements about Normal forms : of the index which indicates the number of blocks
(a) Lossless preserving decomposition into 3NF required and size of each block.
is always possible 13. Give the number of principal vanishing point
(b) Lossless preserving decomposition into (s) along their direction for the standard
BCNF is always possible perspective transformation :
(c) Any Relation with two attributes is in BCNF (a) Only one in the direction K
(d) BCNF is stronger than 3NF (b) Two in the directions I and J
Ans : (c) A BCNF decomposition which is both (c) Three in the directions I, J and K
lossless as well as dependency preserving at the same (d) only two in the directions J and K
time is not always possible. Ans : (a) In this case the view plane normal n is vector.
Example: Relation R(a, b, c) with FDs ( ab → c, c → b ) Since N.I = 0 & N.J =0, so there are no vanishing points
cannot be preserved when decomposition is done. in the direction I & J. On the other hand N.K. = K.K =
10. The Relation 1. Thus there is only one principal vanishing point & it
is in k direction.
Vendor Order (V_no, V_ord_no, V_name,
Qty_sup, unit_price) 14 . Consider a triangle A (0,0), B(1,1) and C(5,2).
is in 2NF because : The triangle has to be rotated by an angle of
(a) Non_key attribute V_name is dependent on 45o about the point P(–1, –1). What shall be the
V_no which is part of composite key coordinates of the new triangle?
UGC NET JRF Computer Science June 2015 Paper-III 152 YCT
 Search on TG: @apna_pdf

( )
(a) A ' = 1, 2 − 1 , B' = −1,2 2 − 1( ) 16. Which of the following is not a basic primitive
of the Graphics kernel system (GKS) ?
 9 
and C ' =  3 2 − 1, 2 − 1 (a) POLYLINE (b) POLYDRAW
 2  (c) FILL AREA (d) POLYMARKER
( ) (
(b) A ' = 1, 2 − 1 , B' = 2 2 − 1, −1 ) Ans : (b) The main five primitives in graphics kernel
system (GKS)
 9 
and C ' =  3 2 − 1, 2 − 1 (1) Polyline : which draw a sequence of connected
 2  line segments
( )
(c) A ' = −1, 2 − 1 ,B' = −1, 2 2 − 1 ( ) (2) Polymarker : Which marks a sequence of points
with same symbol.
 9 
and C ' =  3 2 − 1, 2 − 1 (3) Fill area : which displays a specified area.
 2  (4) Text : which dreams a string of characters
(d) A ' = ( ) (
2 − 1, −1 ,B' = −1, 2 2 − 1 ) (5) Cell array : which displays an image composed of
a variety of colors or grey scales.
 9 
and C ' =  3 2 − 1, 2 − 1 17. Which of the following statement(s) is/are
 2  incorrect?
Ans : (c) (1) Mapping the co-ordinates of the points and
1 0 0  2 /2 2 / 2 0 lines that form the picture into the
    appropriate co-ordinates on the device or
R45 p = 0 1 0 − 2 /2 2 / 2 0 workstation is known as viewing
1 1 1  
   0 0 1 transformation
  (2) The right-handed Cartesian co-ordinates
 2 /2 0 system in whose co-ordinates we describe the
 1 0 0 
2 /2
 picture is known as world co-ordinate system
  − 2 /2
 0 1 0  = 2 /2 0 (3) The co-ordinate that corresponds to the
 −1 −1 1   
   −1
 ( 2 −1 ) 1

device or workstation where the image is to
be displayed is known as physical device co-
Now, ordinate system
 0
(4) Left - handed co-ordinate system in which
 A '  A  0 0 1  − 2 / 2 2 /2
 the display area of the virtual display device
 B'  =  B  Rus.P = 1 1 1  − 2 / 2 0
       2 /2
 corresponds to the unit ( x ) square whose
 C'   C  5 2 1  −1
 ( 2 −1 ) 1

lower left-hand corner is at the origin of the
co-ordinate system, is known as normalized
 
( )
device co-ordinate system
 −1 2 −1 1
  (a) (1) only (b) (1) and (2)
=  −1 (
2 2 − 1 1 ) (c) (3) only (d) (4) only
Ans : (d) Normalized device co-ordinate system make
 
  3 2 − 1  9 2 − 1  1 up a coordinate system that describes positions on a
 2 
  2   virtual plotting device. The left corresponds to (0,0) &

( ) ( )
the upper right corner corresponds to (1,1)
So A' = −1, 2, −1 ,B' = −1, 2 2 − 1 & NDCs can be used when you want to position text,
3 9  lines, markers or polygons anywhere on the plotting
C'=  2 − 1, 2 − 1 device.
 2 2 
18. Match the following :
15. The process of dividing an analog signal into a
List - I List - II
string of discrete outputs, each of constant
amplitude, is called : (A) Flood Gun (i) An electron gun
designed to flood
(a) Strobing (b) Amplification
the entire screen
(c) Conditioning (d) Quantization
with electrons
Ans : (d) Quantization is the process of transforming (B) Collector (ii) Partly energized
sampled amplitude values of a message signal into a by flooding gun,
discrete amplitude value. stores the charge
generated by the
UGC NET JRF Computer Science June 2015 Paper-III 153 YCT
 Search on TG: @apna_pdf
writing gun Ans : (c) Because option (c) will generates all the
(C) Ground (iii) Used to discharge string ending with 1 & also it will not generate substring
the collector as 00.
(D) Phosphorus (iv) Used in memory - 21. The transition function for the language L =
grains tube display and {wna(w) and nb(w) are both odd} is given by :
similar to those
δ (q0, a) = q1 ; δ(q0,b) = q2
used in standard
CRT δ (q1, a) = q0 ; δ(q1,b) = q3
(E) Writing (v) Used in memory - δ (q2, a) = q3 ; δ(q2,b) = q0
Gun tube display and δ (q3, a) = q2 ; δ(q3,b) = q1
System basically the same The initial and final states of the automata are:
as the electron (a) q0 and q0 respectively
gun used in a (b) q0 and q1 respectively
conventional CRT
(c) q0 and q2 respectively
Code : (d) q0 and q3 respectively
A B C D E
Ans : (d)
(a) (i) (ii) (iii) (iv) (v)
(b) (ii) (iii) (i) (iv) (v)
(c) (iii) (i) (ii) (v) (iv)
(d) (iv) (v) (i) (ii) (iii)
Ans : (a)
(a) Flood gun is an electron gun designed to flood the
entire screen with electrons, so it satisfies (i)
(b) Collector are the party energized by flooding gun, Where q0 as initial state and q3 accepting state (final
stores the charge generated by the writing gun, so it state).
satisfies (ii) 22. The clausal form of the disjunctive normal
(c) Ground is used to discharge the collector, so it form ¬ A ∨ ¬ B ∨ ¬ C ∨ D is :
satisfies (iii)
(a) A ∧ B ∧ C ⇒ D
(d) Phosphorus grains is used in memory, so it satisfies
(iv) (b) A ∨ B ∨ C ∨ D ⇒ true
(e) Writing gun system is also used in memory is used (c) A ∧ B ∧ C ∧ D ⇒ true
in conventional CRT. (d) A ∧ B ∧ C ∧ D ⇒ false
19. Minimal deterministic finite automaton for the Ans : (a) We know A → B is equivalent to ∼AVB now
language L = {0n n ≥0, n ≠ 4} will have : checking option A
(a) 1 final state among 5 states A ∧ B ∧ C ⇒ D applying about equivalence
(b) 4 final states among 5 states ¬ (A ∧ B ∧ C) ∨ D applying de-morgans law
(c) 1 final state among 6 states ⇒ (A ∧ B ∧ C) → D
(d) 5 final states among 6 states Hence answer is option (a)
Ans : (d) 23.
Which of the following is false for the
programming language PROLOG?
(a) A PROLOG variable can only be assigned to
So final states are → 5 a value once
non-final state → 1 (b) PROLOG is a strongly typed language
20. The regular expression corresponding to the (c) The scope of a variable in PROLOG is a
language L where L = {x ∈ {0, 1}*  x ends single clause or rule
with 1 and does not contain substring 00} is : (d) The scope of a variable in PROLOG is a
(a) (1 + 01) * (10 + 01) single query
(b) (1 + 01)* 01 Ans : (b) Since prolog is a dynamically typed
(c) (1 + 01) * (1 + 01) language. Which is to say that programs are not checked
(d) (10 + 01)* 01 for type errors until run time.
24. Which one of the following is true :

UGC NET JRF Computer Science June 2015 Paper-III 154 YCT
 Search on TG: @apna_pdf
(a) The resolvent of two Horn clauses is not a (d) UEKPNRMROOEWCTT
Horn clause Ans : (c) 3 1 5 2 4
(b) The resolvent of two Horn clauses is a Horn C O M P U
clause
(c) If we resolve a negated goal G against a fact T E R N E
or rule A to get clause C then C has positive T W O R K
literal or non-null goal Now, read column by column; first 1st, 2nd, 3rd, 4th then
(d) If we resolve a negated goal G against a fact 5th. Therefore, encrypted message is:-
or rule A to get clause C then C has positive OEW PNR CTT UEK MRO
literal or null goal
29. Suppose a digitized voice channel is made by
Ans : (b) If you resolve horn clauses A & B to get
digitizing 8 kHz bandwidth analog voice signal.
clause C, then the positive literal of A will resolve
It is required to sample the signal at twice the
against a negative in B. So the only positive literal left
in C is the one, from B (if any), Thus, the resolvent of highest frequency (two samples per hertz).
two horn. Clauses is a horn clause. What is the bit rate required, if it is assumed
that each sample requires 8 bits?
25. Which transmission technique guarantees that
(a) 32 kbps (b) 64 kb
data packets will be received by the receiver in (c) 128 kbps (d) 256 kbps
the same order in which they were sent by the
sender? Ans : (c) Bandwidth of analog channel is 8 k/sec
(a) Broadcasting (b) Unicasting Required sample 2 samples/nz = 2s
(c) Packet switching (d) Circuit switching One sample is 8 bit
So bit rate = (8 k) × 2 × (8 bit) = 128 kbps
Ans : (d) Circuit switching transmission technique
guarantees the data packets will be received by the 30. The maximum payload of a TCP segment is :
receiver in the same order in which they were sent by (a) 65, 535 (b) 65, 515
the sender because path is fixed and all packet goes (c) 65, 495 (d) 65, 475
through that path in same order.
Ans : (d) The maximum payload of TCP segment is
26. Which of the following control fields in TCP 65, 495 bytes. Because maximum IP packet is 65, 535
header is used to specify whether the sender bytes out of which 20 is used for header. TCP header is
has no more data to transmit? 20 bytes.
(a) FIN (b) RST So, 216 – 20 – 20 = 65535 – 40 = 65495 bytes left for
(c) SYN (d) PSH TCP.
Ans : (a) FIN control fields in TCP header is used to 31. An all-pairs shortest-paths problem is
specify whether the sender has no more data to transmit efficiently solved using :
i.e. close the connection from sender side. (a) Dijkstra' algorithm
27. Which are the two modes of IP security? (b) Bellman-Ford algorithm
(a) Transport and certificate (c) Kruskal algorithm
(b) Transport and tunnel (d) Floyd-Warshall algorithm
(c) Certificate and tunnel Ans : (d) Floyd-Warshall algorithm is used for all-
(d) Preshared and transport pairs shortest paths problem efficiently with time
Ans : (b) Transport mode:- IP header, IPSec, headers complexity O(n3) using programming.
IP payload. 32. The travelling salesman problem can be solved
Tunnel Mode:- New IP header, IPSec, headers, old IP in :
header, IP payload. (a) Polynomial time using dynamic
IP Sec can be implemented in a host-to-host transport programming algorithm
mode, as well as in network tunning mode. (b) Polynomial time using branch-and-bound
28. A message "COMPUTER NETWORK" algorithm
encrypted (ignore quotes) using columnar (c) Exponential time using dynamic
transposition cipher with a key "LAYER". The programming algorithm or branch-and-bound
encrypted message is : algorithm
(a) CTTOEWMROPNRUEK (d) Polynomial time using backtracking
(b) MROUEKCTTPNROEW algorithm
(c) OEWPNRCTTUEKMRO
UGC NET JRF Computer Science June 2015 Paper-III 155 YCT
 Search on TG: @apna_pdf
Ans : (c) It will be solved by using branch and bound 1
technique. The travelling salesman problem is NP- 0≤ (f (n) + g(n))
2
complete problem. It can also be solved by- one of the ≤ min (f(n), g(n))
earliest application of dynamic programming is the
≤ f(n) + g(n)
Held-Karp algorithm to solve TSP in time O(n2.2n).
For n > n0
33. Which of the following is asymptotically
Which is the definition of Θ (f(n) + g(n)) with C1 = 1/2
smaller? and C2 = 1
(a) Ig(Ig *n) (b) Ig*(Ign)
36. The number of nodes of height h in any n -
(c) Ig(n!) (d) Ig*(n!)
element heap is ..............
Ans : (c) Option are in following order:
(a) h (b) zh
lg(lg*n) < lg*(lgn) < lg(n!) < lg*(n!)
 n   n 
34. Consider a hash table of size m = 100 and the (c) ceil  h  (d) ceil  h 
 
z  z +1 
hash function h(k) = floor (m(kA mod 1)) for
( ) = 0.618033 . Compute the location
Ans : (d) Theorem: Show that there at most
5 -1
A=  n 
 2h +1  nodes of height h in any n-element heap.
2  
to which the key k = 123456 is placed in hash Proof:
table.
(i) Base: h = 0. The number of leaves is
(a) 77 (b) 82
n   n 
(c) 88 (d) 89  2  =  20 +1 
Ans : (c) n(k) floor = (m(kA mod1))    
(ii) Step: Let’s assume it holds for nodes of height (h –
5 −1
A= = 0.618023 m = 100 1). Let’s a tree and remove all its leaves.
2
 n  n 
if k = 123456 We get a new tree with  n −    =   elements. Note
then  2 2
n(k) = floor (100(123456 × 0.618023 mod 1)) that the nodes with height h in the old tree have height
(h – 1) in the new one. We will calculate the number of
⇒ floor (100(76189.88245 mod 1))
such nodes in the new tree. By the inductive assumption
= floor (100(0.882045)) we have that T, the number of nodes with height (h – 1)
= floor (88.2045) in the new tree is:
= 88
  n  h −1+1   n / 2   n 
35. Let f(n) and g(n) be asymptotically non-    / 2  <  h  =  h +1 
 2    2  2 
negative functions. Which of the following is
correct? As mentioned, this is also the number of nodes with
height h in the old tree.
(a) θ (f(n) * g(n)) = min (f(n), g(n))
This question has typing of options error, so UGC gives
(b) θ (f(n) * g(n)) = max (f(n), g(n))
marks to all.
(c) θ (f(n) + g(n)) = min (f(n), g(n))
37. In Java, when we implement an interface
(d) θ (f(n) + g(n)) = max (f(n), g(n))
method, it must be declared as :
Ans : (d) Θ(f(n) + g(n)) = max (f(n), g(n)) (a) Private (b) Protected
From “asymptotically non-negative”, we can assume (c) Public (d) Friend
that
Ans : (c) Interface:- It is used to provide total
∃n1, n2: f(n) ≥ 0 for n > n1 abstraction. That means all the methods in interface are
g(n) ≥ 0 for n > n2 declared with empty body and are public and all fields
Let n0 = max (n1, n2) are public, static and final default.
Some obvious thing for n > n0: 38. The Servlet Response interface enables as
f(n) ≤ max (f(n), g(n))
servlet to formulate a response for a client
g(n) ≤ max (f(n), g(n)) using the method ............
(f (n) + g(n)) (a) void log (Exception e, String s)
≤ max(f (n), g(n))
2 (b) void destroy
max (f(n), g(n)) ≤ f(n) + g(n) (c) int get Server port ()
From the last two inequalities, we get: (d) void set Context type (string type)
UGC NET JRF Computer Science June 2015 Paper-III 156 YCT
 Search on TG: @apna_pdf
Ans : (*) The Servlet Response object enables the 44. Which design metric is used to measure the
servlet to formulate a response for the client using the compactness of the program in terms of lines of
method get server name ( ) get write ( ), and Set Content codes ?
Type ( ). (a) Consistency (b) Conciseness
39. Which one of the following is correct? (c) Efficiency (d) Accuracy
(a) Java applets can be written in any Ans : (a) Consistency:- The use of uniform design and
programming language documentation techniques through the software
(b) An applet is not a small program development project.
(c) An applet can be run on its own 45. Requirements prioritization and negotiation
(d) Applets are embedded in another applications belongs to :
Ans : (d) An applet is a small program that is intended (a) Requirements validation
not to be run on its own, but rather to be embedded (b) Requirements elicitation
inside-another application. (c) Feasibility study
40. In XML we can specify the frequency of an (d) Requirements reviews
element by using the symbols : Ans : (b) Requirements elicitation.
(a) + * ! (b) # * ! 46. Adaptive maintenance is a maintenance which
(c) + * ? (d) – * ? ...........
Ans : (c) + symbol for one or more time (a) correct errors that were not discovered till
* for 0 or more time? zero or one time. testing phase
41. In XML, DOCTYPE declaration specifies to (b) is carried out to port the existing software to
a new environment
include a reference to ................ file.
(a) Document type Definition (c) improves the system performance
(d) both (b) and (c)
(b) Document type declaration
(c) Document transfer definition Ans : (b) Maintenance is a modification of a software
(d) Document type language product performed after delivery to keep a software
product usable in a changed or changing environment.
Ans : (a) In XML, DOCTYPE declaration can be used
to define special characters & character string used in 47. A Design concept refinement is a :
the document & it include a reference of document type (a) Top-down approach
definition file (b) Complementary of abstraction concept
42. Module design is used to maximize cohesion (c) Process of elaboration
and minimize coupling. Which of the following (d) All of the above
is the key to implement this rule? Ans : (d) Refinement is surly a top down approach as
(a) Inheritance (b) Polymorphism we are extracting a particular type like person entity to
(c) Encapsulation (d) Abstraction s/w engineer.
Refinement, process of elaboration, start with the
Ans : (c) We know that the golden rule in module
statement of function defined at the abstract level,
design is used to maximize cohesion and minimize
decompose the statement function in a step wise fashion
coupling.
until programming language statements are reached.
• Encapsulation is the key to implement this rule
48. A software design is highly modular if :
43. Verification :
(a) cohesion is functional and coupling is data
(a) refers to the set of activities that ensure that type
software correctly implements a specific (b) cohesion is coincidental and coupling is data
function type
(b) gives answer to the question - Are we (c) cohesion is sequential and coupling is content
building the product right? type
(c) requires execution of software (d) cohesion is functional and coupling is stamp
(d) both (a) and (b) type
Ans : (d) Verification means asking "are we building Ans : (a) We know our aim is to maximize cohesion &
the product right" verification refers to the set of minimum coupling
activities that ensure software correctly implements the Strong form of cohesion is functional cohesion weakest
specific function. form of coupling is data coupling.
UGC NET JRF Computer Science June 2015 Paper-III 157 YCT
 Search on TG: @apna_pdf
49. Match the following for operating system 51. What is the most appropriate function of
techniques with the most appropriate Memory management Unit (MMU)?
advantage : (a) It is an associative memory to store TLB
List - I List - II (b) It is a technique of supporting
(A) Spooling (i) Allows several multiprogramming by creating dynamic
jobs in memory partitions
to improve CPU (c) It is a chip to map virtual address to physical
utilization address
(B) Multiprogr (ii) Access to shared (d) It is an algorithm to allocate and deallocate
amming resources among main memory to a process
geographically Ans : (c) A memory management unit (MMU),
dispersed sometimes called paged memory management unit
computers in a (PMMU), is a computer hardware unit having all
transparent way memory references passing through itself, primarily
(C) Time (iii) Overlapping I/O performing the translation of virtual memory addresses
sharing and to physical addresses. It is usually implemented as part
computations of the central processing unit (CPU), but it also can be
(D) Distributed (iv) Allows many in the form of a separate integrated circuit.
computing users to share a So we can say it is a chip to map virtual address to
computer physical address
simultaneously 52. Dining philosopher's problem is a :
by switching
(a) Producer - consumer problem
processor
frequently (b) Classical IPC problem
(c) Starvation problem
Codes :
(d) Synchronization primitive
A B C D
(a) (iii) (i) (ii) (iv) Ans : (b) The dining philosophers problem is an
(b) (iii) (i) (iv) (ii) example problem often used in concurrent algorithm
design to illustrate synchronization issues and
(c) (iv) (iii) (ii) (i)
techniques for resolving them. It’s a classical IPC
(d) (ii) (iii) (iv) (i)
problem.
Ans : (b) (a) Spooling is overlapping I/O &
computation (iii) 53. In ............ allocation method for disk block
(b) Multiprogramming refers to allows several job in allocation in a file system, insertion and
memory for improving the CPU utilization (i) deletion of blocks in a file is easy.
(c) Time sharing is allow to many user to share a (a) Index
computer simultaneously by switching processor (b) Linked
frequently (iv) (c) Contiguous
(d) Distributed computing .... Access to shared resource (d) Bit Map
among geographically dispersed computers in a Ans : (b) Just like linked list where insertion, deletion
transparent way (ii) of blocks is easy. In linked allocation only pointer needs
50. Which of the following statements is not true to be changed.
for multi level feedback queue processor In linked allocation each file is a linked list of disk
scheduling algorithm? blocks. The directory contains a pointer to the first
(a) Queues have different priorities block of the file, for example, a file of 5 blocks which
(b) Each queue may have different scheduling starts at block 4, might continuous at block 7, then
algorithm block 16, block 10, 8 finally block 27. Each block
(c) Processes are permanently assigned to a constrains a pointer to the next block & the last block
queue contains a NIL-pointer. The value-1 may be used for
(d) This algorithm can be configured to match a NIL to differential it from block 0.
specific system under design 54. A Unix file may be of the type :
Ans : (c) Processes are not permanently assigned to a (a) Regular file
queue they can vary between queues as their priorities (b) Directory file
change (c) Device file
So rest (3) option are true and the answer is option (c) (d) Any one of the above
UGC NET JRF Computer Science June 2015 Paper-III 158 YCT
 Search on TG: @apna_pdf
Ans : (d) A Unix file may be of any of the type like (c) (iv) (iii) (i) (ii)
regular file, directory file, or device file. (d) (iv) (iii) (ii) (i)
55. Match the following : Ans : (a)
List - I List – II (a) Frames are record like structures for grouping
(A) Intelligence (i) Contextual, tacit, closely related knowledge (iii)
transfer needs (b) Conceptual dependencies are structure to represent
learning sentence (iv)
(B) Knowledge (ii) Scattered facts, (c) Associative networks are pictorial representation of
easily objects (i)
transferable (d) Scripts are description of real word stereo type
(C) Informatio (iii) Judgmental events (ii)
n 57. In propositional logic P ↔ Q is equivalent to
(D) Data (iv) Codifiable, (where ∼ denotes NOT) :
endorsed with
(a) ∼ (P ∨ Q) ∧ ∼ (Q ∨ P)
relevance and
purpose (b) (∼ P ∨ Q) ∧ (∼ Q ∨ P)
Codes : (c) (P ∨ Q) ∧ (Q ∨ P)
A B C D (d) ∼ (P ∨ Q) → ∼ (Q ∨ P)
(a) (iii) (ii) (iv) (i) Ans : (b) P ↔ Q
(b) (iii) (i) (iv) (ii) (P → ) (Q → P)
(c) (i) (ii) (iii) (iv) (∼P ∨ Q) ∧ (∼ Q ∨ P)
(d) (i) (iii) (iv) (ii)
58. Which of the following statements is true for
Ans : (b) (i) Intelligence: judgmental
branch - and - bound search?
(ii)- Knowledge: contractual tacit, transfer needs
learning. (a) Underestimates of remaining distance may
(iii) Information:- Condifiable, endorsed with relevance cause deviation from optimal path
and purpose. (b) Overestimates can't cause right path to be
(iv) Data- Scattered facts, easily transferrable. overlooked.
56. Match the following knowledge representation (c) Dynamic programming principle can be used
to discard redundant partial paths.
techniques with their applications :
(d) All of the above
List - I List – II
Ans : (c) Branch & bound is an algorithm design
(A) Frames (i) Pictorial
paradigm for discrete & combinational optimization
representation of
problems branch & bound algorithm consist of a
objects, their
attributes and systematic enumeration of candidate solution by means
relationships of state space search. A branch & bound is a dynamic
programming principle can be used to discard radiant
(B) Conceptual (ii) To describe real
world stereotype partial paths.
dependencies
events 59. Match the following with respect to heuristic
(C) Associative (iii) Record like search techniques :
networks structures for List – I List – II
grouping closely
(A) Steepest - (i) Keeps track of all
related
accent Hill partial paths
knowledge
climbing which can be
(D) Scripts (iv) Structures and
candidate for
primitives to
further
represent
exploration
sentences
Codes : (B) Branch - (ii) Discover problem
A B C D and – state (s) that
bound satisfy a set of
(a) (iii) (iv) (i) (ii)
constraints
(b) (iii) (iv) (ii) (i)
UGC NET JRF Computer Science June 2015 Paper-III 159 YCT
 Search on TG: @apna_pdf
(C) Constraint (iii) Detects (D) Component (iv) A group based
satisfaction difference based tool for collecting
between current technology user
state and goal requirements and
state creating system
design. Mostly
(D) Means - (iv) Considers all used in analysis
end – moves from and design stages
analysis current state and of SDLC
selects best move Codes :
Codes : A B C D
A B C D (a) (i) (iii) (ii) (iv)
(a) (i) (iv) (iii) (ii) (b) (iv) (iii) (i) (ii)
(b) (iv) (i) (ii) (iii) (c) (iii) (iv) (i) (ii)
(c) (i) (iv) (ii) (iii) (d) (iii) (i) (iv) (ii)
(d) (iv) (ii) (i) (iii) Ans : (b) JAD → is a methodology that involves the
Ans : (b) (a) Steepest accent hill climbing looks for client or end user in the design and development of an
best more which may or may not be optimal, so it application.
satisfies (iv) case tools→tools to automate many tasks of SDLC
(b) Branch & bound is an algorithm design for discrete Agile development→Agile SDLC model is a
problems & keep tracks of all partial path which can be combination of iterative and incremental process
candidate for further exploration (i) models with focus on process adaptability and customer
satisfaction by rapid delivery of working software
(c) Constraint satisfaction (discover problem state is)
product.
that satisfy a set of constraints (ii)
component based technology–Reusable applications
(d) Means end analysis detects difference between generally with one specific function. It is closely linked
current state & goal state. with idea of web services.
60. Match the following for methods of MIS 61. A context free grammar for L = {w n0 (w) >
development : (w)} is given by :
List - I List – II (a) S → 0 0S1SS
(A) Joint (i) Delivers (b) S → 0S 1S0SS1SS01
Application functionality in (c) S → 00S1SS1SSS1SSS1
Design rapid iteration (d) S → 0S1S01
(JAD) measured in Ans : (c) (1) S→00S1SS (It is false since 10001
weeks and needs cant generate)
frequent (2) S→0S1S0SS1SS01 (It is also false since
communication, generates 1)
development, (3) S→00S1SSS1SSS1 (True)
testing and (4) S→0S1S01 (False since 1 ∧ + generated)
delivery
62. Given the following two statements :
(B) Computer (ii) Reusable
S1 : If L1 and L2 are recursively enumerable
aided applications
languages over ∑, then L1 ∪ L2 and L1 ∩
software generally with L2 are also recursively enumerable.
Engg one specific S2 : The set of recursively enumerable
function. It is languages is countable.
closely linked Which of the following is correct?
with idea of web (a) S1 is correct and S2 is not correct
services and (b) S1 is correct and S2 is correct
service oriented (c) Both S1 and S2 are not correct
architecture (d) Both S1 and S2 are correct
(C) Agile (iii) Tools to Ans : (d) S1: True: because recursively enumerable
development automate many language are closed under union and intersection
tasks of SDLC operation.
UGC NET JRF Computer Science June 2015 Paper-III 160 YCT
 Search on TG: @apna_pdf
S2: True: the set of all language on ∑ is not countable, ⇒5×1+5×1+4×1+4×2+4×3+3×5+3×5
but the set of all turing machines can be enumerated.  1 
So, the set of all recursively enumerable language is + 12  
 30 
countable.
 1 
63. Given the following grammars : ⇒ 5 +5 + 4 + 8 + 12 + 15 + 15 + 12  
 30 
G1 : S → AB aaB = 76
A → aA ∈
 76 
B → bB∈ So answer is  
 30 
G2 : S → A B
A → aAb ab 65. The redundancy in images stems from :
B → a b B ∈ (a) pixel decor relation
Which of the following is correct ? (b) pixel correlation
(a) G1 is ambiguous and G2 is unambiguous (c) pixel quantization
grammars (d) image size
(b) G1 is unambiguous and G2 is ambiguous Ans : (b) The redundancy in image stems from pixel
grammars correlation. If we transform the image a representation
(c) both G1 and G2 are ambiguous grammars where the pixels are corrected, we have eliminated the
(d) both G1 and G2 are unambiguous grammars redundancy & the image has been fully compressed.
Ans : (c) Both are ambiguous since 1st for aa & second 66. In a binary hamming code the number of check
for ab has two derivation tree.
digits is r then number of message digits is
64. Given the symbols A, B, C, D, E, F, G and H equal to :
with the probabilities
1 1 1 2 3 5
, , , , , , (a) 2r – 1 (b) 2r – r – 1
30 30 30 30 30 30 (c) 2r – r + 1 (d) 2r + r – 1
5 12
respectively. The average Huffman Ans : (b) Should be answer ⇒ 2 – r – 1
r
and
30 30
67. In the Hungarian method for solving
code size in bits per symbol is :
67 70 assignment problem, and optimal assignment
(a) (b) requires that the maximum number of lines
30 34
that can be down through squares with zero
76 78
(c) (d) opportunity cost be equal to the number of :
30 30
(a) rows of columns
Ans : (c) (b) row + columns
(c) rows + columns – 1
(d) rows+columns +1
Ans : (a) Maximum number of lines that can be drawn
through squares with zero opportunity cost be equal to
the number of rows or columns.
68. Consider the following transportation
problem :
→ Warehouse

W1 W2 W3 Supply

↓ F1 16 20 12 200
Factory F2 14 8 18 160
F3 26 24 16 90
Demand 180 120 150
The initial basic feasible solution of the above
transportation problem using Vogel's
Approximation method (VAM) is given below :
UGC NET JRF Computer Science June 2015 Paper-III 161 YCT
 Search on TG: @apna_pdf
→ Warehouse 69. Given the following statements with respect to
W1 W2 W3 Supply linear programming problem :
F1 16(140) 20 12(60) 200
S1 : The dual of the dual linear programming
↓ F2 14(40) 8(120) 18 160
Factor
problem is again the primal problem
F3 26 24 16(90) 90
y S2 : If either the primal or the dual problem
Demand 180 120 150
has an unbounded objective function
The solution of the above problem :
value, the other problem has no feasible
(a) is degenerate solution
solution
(b) is optimum solution
S3 : If either the primal or dual problem has
(c) needs to improve
a finite optimal solution, the other one
(d) is infeasible solution
also possesses the same, and the optimal
Ans : (b) value of the objective functions of the two
w1 w2 w3 problems are equal.
16(140) 20 12(60) u1 = 0 Which of the following is true ?
14(40) 8(120) 18 u2 (a) S1 and S2
26 24 16(90) u3 (b) S1 and S3
v1 v2 v3 (c) S2 and S3
c11 = v1 + v1 v1 = 16 u1 = 0 (d) S1, S2 and S3
16 = 0 + v1 v2 = 10 u2 = –2
Ans : (d) All 3 statement are correct as they all
v2 = 12 u3 = 4
properties of dual & primal.
C13 = u1 + u3
70. Consider the two class classification task that
12 = 0 + v3
consists of the following points :
C21 = u2 + v1
Class C1 : [1 1.5] [1 –1.5]
u1 = u2 + 16
u2 = –2 Class C2 : [–2 2.5] [–2 –2.5]
C22 = u2 + v2 The decision boundary between the two classes
using single perceptron is given by :
8 = –2 + v2
(a) x1 + x2 + 1.5 = 0
v2 = 10
(b) x1 + x2 – 1.5 = 0
C33 = u3 + v3
16 = u3 + 12 (c) x1 + 1.5 = 0
v3 = 4 (d) x1 – 1.5 = 0
Un allocated Ans : (c) Simply plot the all points of C1 & C2 in 2-D
d12 = C12 – (u1 + v2) coordinates then see which option's line separates the
= 20 – (0 + 10) points of C1 & C2
= 10 all points of C1 should be one side & all points of C2
d23 = (23 – (u3 + v3) should be on other side of line.
= 18 – (–2 + 12 only line given in option C X1 + 1.5 = 0 does that.
= .8 71. Let A and B be two fuzzy integers defined as :
d31 = C31 – (u3 + v1) A = {(1, 0.3), (2, 0.6), (3, 1), (4,0.7), (5,0.2)}
= 26 – (4 + 16) B = {(10, 0.5), (11,1), (12,0.5)}
=6 Using fuzzy arithmetic operation given by
d32 = C32 – (u3 + v2)
= 24 – (4 + 10)
µA + B( ) =
Z
⊕
x + =z
(µA ( x ) µB ( y ))
y
= 10
 ⊕ = max 
all d's are p + vc so it is optimum solution. f(A + B) is ............  Note : 
 ⊕ = min 
UGC NET JRF Computer Science June 2015 Paper-III 162 YCT
 Search on TG: @apna_pdf
(a) {(11,0.8), (13, 1), (15, 1)} (C) wait (iii) To increase or decrease
(b) {(11, 0.3), (12, 0.5), (13, 1), (14, 1), (15, 1), the size of data region
(16, 0.5), (17, 0.2)} (D) fork (iv) A process synchronizes
(c) {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 1), with termination of child
(16, 0.5), (17, 0.2)} process
(d) {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, Codes :
0.7), (16, 0.5), (17, 0.2)} A B C D
Ans : (d) A = {(1, 0.3), (2, 0.6), (3, 1), (4, 0.7), (5, (a) (ii) (iii) (iv) (i)
0.2)} (b) (iii) (ii) (iv) (i)
B = {(10, 0.5), (11, 1), (12, 0.5) (c) (iv) (iii) (ii) (i)
A + B (z) = ⊕ × + y = z (uA (x) ⊗ uB (y) is also given (d) (iv) (iii) (i) (ii)
as below (add elements of A & B while keeping the
Ans : (a) exec : replaces the current program in the
min. membership value e.g. 1 + 10 = 11 & min (0.3,
current process, without forking a new process.
0.5) = 0.3 & so on for rest
⇒ brk() & sbrk() change the location of the program
⊕ x + y = z {(11, 0.3), (12, 0.3), (13, 0.3), (12, 0.5), (13, break, which defines the end of the process's data
0.6), (14, 0.5), (13, 0.5), (14, 1), (15, 0.5), (14, 0.5), (15, segment.
0.7), (16, 0.5), (15, 0.2), (16, 0.2), (17, 0.2)} bin
⇒ The parent process may then issue a wait system
considering min membership value
call, which suspends the execution of the parent
Now considering min membership value process while the child executes.
{(11, 0.3), (15, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16,
⇒ Fork–creates new process.
0.5), (17, 0.2)}
74. WOW32 is a :
72. Suppose the function y and a fuzzy integer
(a) Win 32 API library for creating processes
number around – 4 for x are given as y = (x –
and threads
3)2 + 2
(b) Special kind of file system to the NT name
Around – 4 = {(2, 0.3), (3, 0.6), (4, 1), (5, 0.6),
space
(6, 0.3)} respectively. Then f (Around –4) is
(c) Kernel - mode objects accessible through
given by :
Win 32 API
(a) {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)}
(d) Special execution environment used to run 16
(b) {(2, 0.6), (3, 1), (6, 1), (11, 0.3)}
bit Window applications on 32-bit machines
(c) {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)}
Ans : (d) Wow 32 is a running environment used in
(d) {(2, 0.6), (3, 0.3), (6, 0.6), (11, 03)}
windows to run 16 bit windows application on a 32 bit
Ans : (c) y = (x – 3)2 +2
machine
around– 4 = {(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)}
75. The Unix command :
putting x = 2, 3, 4, 5, 6 in 4 = (x – 3)2 + 2 will give
$ vi file1 file2
3 2 3 6 11 with their original x membership values
(.3, .6, 1, .6, .3) here is present with 2 membership (a) Edits file1 and stores the contents of file1 in
values .3 & 1 so 1 is considered & final result will be file2
{(3,1), (2, .6), (6, .6), (11, .3)} (b) Both files i.e. file1 and file2 can be edited
using 'ex' command to travel between the
73. Match the following for Unix system calls :
files
List - I List - II (c) Both files can be edited using 'mv' command
(A) exec (i) Creates a new process to move between the files
(B) brk (ii) Invokes another program (d) Edits file1 first, saves it and then edits file2
overlaying memory space Ans : (b) You can edit more than one file at a time
with a copy of an with vi.
executable file vi file1 file2 vi two (or more) files at the same time.
UGC NET JRF Computer Science June 2015 Paper-III 163 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2015

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. How many committees of five people can be 4. Consider the graph given below :
chosen from 20 men and 12 women such that
each committee contains at least three women?
(a) 75240 (b) 52492
(c) 41800 (d) 9900
Ans : (b) For that, we have 20 men & 12 women
Case 1 : Take 2 men from 20 men & 3 women from 12 The two distinct sets of vertices, which make
women 20C2 × 12C3 the graph bipartite are :
Case 2 : Take 1 men from 20 men & 4 women from 12 (a) (v1, v4, v6); (v2, v3, v5, v7, v8)
women 20C1 × 12C4 (b) (v1, v7, v8); (v2, v3, v5, v6)
Case 3 : Take 0 men from 20 men & 5 women from 12 (c) (v1, v4, v6, v7); (v2, v3, v5, v8)
women 20C0 × 12C5 (d) (v1, v4, v6, v7, v8); (v2, v3, v5)
All these 3 cases are mutually exclusive Ans : (c) A Bipartite Graph is a graph whose vertices
Ans = 20C2 × 12C3 + 20C1 × 12C4 + 20C0 × 12C5 can be divided into two independent sets, u and v such
= 52492 that every edge (u, v) either connects a vertex from u to
v or a vertex from v to u. In other words, for every edge
2. Which of the following statement(s) is/are (u, v), either u belongs to U and v to V, or u belongs to
false? V and v to U.
(1) A connected multigraph has an Euler circuit We can say that there is no edge that connects vertices
if and only if each of its vertices has even of same set (v1, v4, v6, v7); (v2, v3, v5, v8) is bipartite
degree graph vertices set.
(2) A connected multigraph has an Euler Path 5. A tree with n vertices is called graceful, if its
but not an Euler circuit if and only if it has
vertices can be labeled with integers 1, 2 ......n
exactly two vertices of odd degree such that the absolute value of the difference of
(3) A complete graph (Kn) has a Hamilton circuit the labels of adjacent vertices are all different.
whenever n ≥ 3 Which of the following trees are graceful?
(4) A cycle over six vertices (C6) is not a (1)
bipartite graph but a complete graph over
(a) (1) only (b) (2) and (3)
(2)
(c) (3) only (d) (4) only
Ans : (d) Cycle graphs with an even number of
vertices are bipartite thus C8 also can bipartite, hence
(d) is false and answer is (d) (3)
3. Which of the following is/are not true?
(1) The set of negative integers is countable
(2) The set of integers that are multiples of 7 is Codes :
(a) (1) and (2) (b) (2) and (3)
countable
(c) (1) and (3) (d) (1), (2) and (3)
(3) The set of even integers is countable
(4) The set of real numbers between 0 and 1/2 is Ans : (d) Caterpillar tree : In graph theory, a caterpillar
countable is a tree in which all the vertices are within distance 1 of
central path. Theorem : All caterpillar are graceful.
Codes :
So, (1), (2) and (3) are graceful.
(a) (1) and (3) (b) (2) and (4)
(c) (2) only (d) (4) only 6. Which of the following arguments are not
Ans : (d) A set is countable if it each element can be valid?
(1) "If Gora gets the job and work hard, then he
associated with a natural number.
will be promoted. If Gora gets promotion,
How such mapping is not possible to set of all real
then he will be happy. He will be happy,
numbers between 0 to 1/2 hence it is not countable for
therefore, either he will not get the job or he
rest options such mapping is possible.
will not work hard"
UGC NET JRF Computer Science Dec. 2015 Paper-II 164 YCT
 Search on TG: @apna_pdf
(2) "Either Puneet is guilty or Pankaj is telling (B) Trivial (ii) A proof that the
the truth. Pankaj is not telling the truth, proof implication p →
therefore, Puneet is not guility" q is true based on
(3) If n is a real number such that n > 1, then n2 > the fact that q is
1. Suppose that n2 >1, then n > 1.
true
Codes :
(a) (1) and (3) (b) (2) and (3) (C) Direct (iii) A proof that the
(c) (1), (2) and (3) (d) (1) and (2) proof implication p →
Ans : (b) q is true that
S1: P: Gora gets the job proceeds by
Q : Gora works hard showing that q
R : Gora gets promotion must be true
S: Gora will be happy when p is true
The argument can be written as: (D) Indirect (iv) A proof that the
proof implication p →
( P ^ Q) → R
q is true that
R →S proceeds by
¬S showing that p
∴ ¬ P ∨ ¬ Q (using modus tollens) must be false
S2: P: Puneet is not guilty when q is false
Q : Pankaj is telling the truth Codes :
The argument can be written as: (A) (B) (C) (D)
P∨Q
(a) (i) (ii) (iii) (iv)
¬Q (b) (ii) (iii) (i) (iv)
∴ P(using disjunctive syllogism) Puneet is guilty. (c) (iii) (ii) (iv) (i)
S3: It is not valid, as it assets the converse of the first (d) (iv) (iii) (ii) (i)
statement Q → P, which is not equivalent to the
first statement of the form P → Q Ans : (a)
Only statement (S2) and (S3) are not valid. List - I List - II
7. Let P(m, n) be the statement "m divides n" (A) Vacuous proof (i) A proof that the
where the universe of discourse for both the implication p → q is
variables is the set of positive integers. based on the fact that
Determine the truth values of the following p is false
propositions. (B) Trivial proof (ii) A proof that the
(1) ∃m ∀n P(m, n) implication p → q is
(2) ∀n P(1, n) true based on the
(3) ∀m ∀n P(m, n) fact that q is true
Codes : (C) Direct proof (iii) A proof that the
(a) (1) True; (2) True; (3) False implication p → q is
(b) (1) True; (2) False; (3) False true that proceeds by
(c) (1) False; (2) False; (3) False showing that q must
(d) (1) True; (2) True; (3) True be true when p is
Ans : (a) ∀m ∀n P(m, n) says that every number true
divides every other number & result should be a (D) Indirect proof (iv) A proof that the
positive integer clearly (1) is false implication p → q is
∀n P(1, n) says that any positive integer is divisible by true that proceeds by
1 & result will be a positive integer showing that p must
2 is true be false when q is
∃m ∀n P(m, n) says that there are some positive false
integers which divides any other positive integer
9. Consider the compound propositions given
c is true
8. Match the following terms : below as :
(1) p ^ ~ (p ^ q)
List - I List - II
(2) (p ^ ~ q) ∨ ~ (p ^ q)
(A) Vacuous (i) A proof that the
proof (3) p ^ (q ∨ r)
implication p →
q is based on the Which of the above proposition are
fact that p is false tautologies?

UGC NET JRF Computer Science Dec. 2015 Paper-II 165 YCT
 Search on TG: @apna_pdf
(a) (1) and (3) (b) (2) and (3) 12. Consider the following two statements :
(c) (1) and (2) (d) (1), (2) and (3) (1) A publicly derived is a subtype of base class
Ans : (b) (i) p ∨ (p ∧ q) = p + (pq) ' (2) Inheritance provides for code ruse
≡ p + p '+ q ' Which one of the following statements is
correct?
≡1+ q ' =1
(a) Both the statements (1) and (2) are correct
(ii) (p ∧ q) ∨ (p ∧ q) (b) Neither of the statement (1) and (2) are
≡ pq ' + (pq) ' correct
≡ pq ' + p ' + q ' (c) Statement (1) is correct and (2) is incorrect
(d) Statement (1) is incorrect and (2) in correct
≡ (p + p ') (p ' + q ') a + q '
Ans : (a) Inheritance provide for code ruse
≡ (p ' + q ') + q ' for public inheritance creates sub type
≡ p ' + q ' ≠1 Inheritance only applies to user defined classes
(iii) p ∧ ( q ∨ r) ≡ p(q + r) A publicly derived class is a subtype of its base class
≡ pq + pr ≠ 1 13. Consider a "CUSTOMERS" database table
having a column "CITY" filled with all the
Hence (ii) and (iii) are not tautologies.
names of Indian cities (in capital letters). The
10. Which of the following property/ies a Group G SQL statement that finds all cities that have
must hold, in order to be an Abelian group? "GAR" somewhere in its name, is :
(1) The distributive property (a) Select * from customers where city =
(2) The commutative property '%GAR%';
(3) The symmetric property (b) Select * from customers where city =
Codes : '$GAR$'
(a) (1) and (2) (b) (2) and (3) (c) Select * from customers where city like
(c) (1) only (d) (2) only '%GAR%';
Ans : (d) The commutative property must hold, in (d) Select * from customers where city as
order to be an abelian group. '%GAR'
Since group is given so all property is inclusive option Ans : (c) Select * from customers where city like
(d) is the answer '%GAR%';
11. Consider the following program : 14. Match the following database terms to their
#include < stdio.h> functions :
main ( ) List - I List – II
{ (A) Normalization (i) Enforces
int i, inp; match of
float x, term = 1, sum = 0 primary key to
scanff ("% f", & inp, &x); foreign key
for(i = 1, < = inp; i ++) (B) Data (ii) Reduce data
{ Dictionary redundancy in
term = term * x/t; a database
sum = sum + term; (C) Referential (iii) Defines view
} Integrity (s) of the
printf("Result = %f\n", sum); database for
particular user
}
(s)
The program computes the sum of which of the
following series? (D) External (iv) Contains
(a) x + x2/2 + x3/3 + x4/4 +…. Schema metadata
describing
(b) x + x2/2! + x3/3! + x4/4! +….
database
(c) 1 + x2/2 + x3/3 + x4/4 +…. structure
(d) 1 + x2/2! + x3/3! + x4/4! +….
Codes :
Ans : (b) i = 1, term = 1, term = 1*x/1, sum = 0 + x/1 (A) (B) (C) (D)
i = 2, term = x, term = x*x/2, sum = x+x∨2/2 (a) (iv) (iii) (i) (ii)
i = 3, term = x∨/2, term = x∨3/6, sum = x + (b) (ii) (iv) (i) (iii)
x∨2/2+x∨3/6 & do on (c) (ii) (iv) (iii) (i)
which is better shown x/1 ! + x ∨ 2/2! + x ∨/3! + ..... (d) (iv) (iii) (ii) (i)
UGC NET JRF Computer Science Dec. 2015 Paper-II 166 YCT
 Search on TG: @apna_pdf
Ans : (b) (c) A thing that we wish to collect data about
(a) Normalization used to reduces data redundancy in a zero or more, possibly real world examples
database (ii) of it may exist
(d) A template for a group of things with the
(b) Data dictionary contains the metadata for describing
same set of characteristics that may exist in
data structure (iv) the real world
(c) Referential integrity is enforces to match the primary Ans : (d) It is collection of entity having common
key to foreign key (i) attribute.
(d) External schema defines the view of the database for So student is an entity type which contains entities
particular user (iii) having attribute id, name & age.
15. In general, in a recursive and non-recursive Also each entity type in a database is described by a
implementation of problem (program) : name & a list of attribute. So we may say a table is an
(a) Both time and space complexities are better entity type.
in recursive than in non-recursive program 19. Data which improves the performance and
(b) Both time and space complexities are better accessibility of the database are called :
in non-recursive than in recursive program (a) Indexes
(c) Time complexity is better in recursive (b) User data
version but space complexity is better in non- (c) Application metadata
recursive version of the program (d) Data dictionary
(d) Space complexity is better in recursive Ans : (a) Indexes are special lookup tables that the
version but time complexity is better in non- database search engine can use to speed up data
recursive version of the program retrieval. Simply put, an index is a pointer to data in a
table. An indexed in a database is very similar to an
Ans : (b) Recursion may not offer any better space or index in the back of the book.
time complexity it only offers compact & simple to
20. A relation R = {A, B, C, D, E, F, G} is given
write & understand then non recursion implementation.
with following set of functional dependencies :
16. A three dimensional array in 'C' is declared as F = {AD → E, BE → F, B → C, AF → G}
int A[x][y][z]. Here, the address of an item at Which of the following is a candidate key?
the location A[p][q][r] can be computed as (a) A (b) AB
follows (where w is the word length of an (c) ABC (d) ABD
integer) : Ans : (d)
(a) & A[0][0][0] + w( z × q + z × p + r) Closer of given keys:
(b) & A[0][0][0] + w( y × z + z × q + r) +
(a) ( A ) = A
(c) & A[0][0][0] + w( x × y × p + z × q + r)
+
(d) & A[0][0][0] + w( x × y × q + z × p + r) (b) ( AB ) = ABC
Ans : (b) To calculate address of A [ p ][ q ][ r ] , we have +
(c) ( ABC ) = ABC
to add base address of array. Then we have to pass row +
elements. (d) ( ABD ) = ABCDEFG
& A [ p ][ q ][ r ] = &A [ 0 ][ 0 ][ 0] + w ( y*z*p + z*q + r ) Since, ABD maps all attributes of relation R so, ABD is
candidate key.
17. In C++, which system – provided function is 21. Which of the following services is not provided
called when no handler is provided to deal with by wireless access point in 802.11 WLAN?
an exception? (a) Association (b) Disassociation
(a) terminate ( ) (b) unexpected ( ) (c) Error correction (d) Integration
(c) abort ( ) (d) kill ( ) Ans : (c) Service provided by wireless access point in
Ans : (a) The function is automatically called when 802.11 WLAN"
catch handler can be found for a thrown exception, or (i) Integration
for same other exceptional circumstances that makes (ii) Disassociation
impossible to continue the exception handling process (iii) Association
i.e. terminate ( ) (iv) Authentication
18. Which of the following provides the best (v) Privacy
description of an entity type? (vi) distribution
(a) A specific concrete object with a defined set (vii) MSDU delivery
of processes (e.g. Jatin with diabetes) For error correction we have different policies, and
(b) A value given to a particular attribute (e.g. correction does not provided by wireless access point in
height – 230 cm) 802.11 WLAN.

UGC NET JRF Computer Science Dec. 2015 Paper-II 167 YCT
 Search on TG: @apna_pdf
22. Which of the following fields in IPv4 datagram (a) 1024, 3072, 4096, 6144
is not related to fragmentation? (b) 1234, 4012, 5000, 6200
(a) Type of service (b) Fragment offset (c) 1020, 3012, 6120, 8100
(c) Flags (d) Identification (d) 2021, 4050, 5112, 7100
Ans : (a) Service types are not in the field of IPv4 Ans : (c) Page size is 1k = 1024 words
datagram. While flags, identification and fragmentation address rang (page number)
offset are related to IPv4 datagram. 0 – 1023 (0)
23. Four channels are multiplexed using TDM. If 1024 – 2047 (1)
each channel sends 100 bytes second and we 2045 – 3071 (2)
multiplex 1 byte per channel, then the bit rate 3072 – 4095 (3)
for the link is .............. (4096 – 5119) (4)
(a) 400 bps (b) 800 bps 5120 – 6143 (5)
(c) 1600 bps (d) 3200 bps 6144 – 7167 (6)
Ans : (d) Each frame carries 1 byte from each channel 7168 – 8191 (7)
we have 4 channels. By using above we can make string from given virtual
The size of each frame, therefore, is 1 × 4 = 4 bytes or address.
32 bits Page already in memory are 0, 2, 5, 7 now for no page
Each channel is sending 100 bytes/s & a frame carries 1 fault to occur string must be 0, 2, 5, 7
byte from each channel, the frame rate must be 100 Choice 1 will produce string 1, 3, 4, 6 so page fault will
frame per second. The bit rate is 100 & times, 32 = occur
3200 bps. Choice 2 will produce string 1, 3, 4, 6 so page fault will
24. In a typical mobile phone system with occur
hexagonal cells, it is forbidden to reuse a Choice 4 will produce string 1, 3, 4, 6 so page fault will
frequency band in adjacent cells. If 840 occur
frequencies are available, how many can be Choice 3 will produce string 0, 2, 5, 7 hence no page
used in a given cell? faults, so ans is (c)
(a) 280 (b) 210 27. Suppose that the number of instructions
(c) 140 (d) 120 executed between page faults is directly
Ans : (a) Hexagonal calls means each call has 3 proportional to the number of page frames
neighbors. allocated to a program. If the available
In order words, only 3 unique cells are needed memory is doubled, the mean interval between
consequently, each cell can have 840/3 = 280 page faults is also doubled. Further, consider
frequencies. that a normal instruction takes one
25. Using p = 3, q = 13, d = 7 and e = 3 in the RSA microsecond, but if a page fault occurs, it takes
algorithm, what is the value of cipher text for a 2001 microseconds. If a program takes 60 sec
plain text 5? to run, during which time it gets 15,000 page
(a) 13 (b) 21 faults, how long would it take to run if twice as
(c) 26 (d) 33 much memory were available?
(a) 60 sec (b) 30 sec
Ans : (*) Given, p = 3, q = 13, d = 7, e = 3, m = 5
(c) 45 sec (d) 10 sec
As, c = me mod n
where n = p.q = 3 × 13 = 39 Ans : (c) Normal instruction takes 1 micro second
10^–6 sec instruction will page fault takes 2001 micro
⇒ c = (5)3 mod 39
seconds so p.f. take 2000 micro seconds
⇒ c = 125 mod 39 Now given program takes 60 sec & there were 15000
⇒ c=8 p.f. so time taken by page faults = 15000 × 2000 = 30
26. A virtual memory has a page size of 1K words. sec, rest 30 second are consumed by program execution.
There are eight pages and four blocks. The If memory is doubled then the mean interval between
associative memory page table contains the the page faults is also doubled. So when earlier 30 sec
following entries : were needed by program instruction & 30 sec of p.f.
Page Block Now program execution takes 30 sec & p.f. will take 15
0 3 sec
so total time = 30 +15 = 45 sec
2 1
5 2 28. Consider a disk with 16384 bytes per track
7 0 having a rotation time of 16 msec and average
seek time of 40 msec. What is the time in msec
Which of the following list of virtual addresses to read a block of 1024 bytes from this disk?
(in decimal) will not cause any page fault if (a) 57 msec (b) 49 msec
referenced by the CPU?
(c) 48 msec (d) 17 msec
UGC NET JRF Computer Science Dec. 2015 Paper-II 168 YCT
 Search on TG: @apna_pdf
Ans: (b) Transfer time = ((1024 bytes * 16 ms)/(16384 32. Suppose that from given statistics, it is known
bytes)) = 1 msec that meningitis causes stiff neck 50% of the
Rotational latency = 16 msec/2 = 8 msec time, that the proportion of persons having
Total time = seek + rotational latency + transfer time 1
meningitis is , and that the proportion
= 40 + 18 + 1 = 49 msec 50000
29. A system has four processes and five 1
of people having stiff neck is . Then the
allocatable resources. The current allocation 20
and maximum needs are as follows : percentage of people who had meningitis and
Allocated Maximum Availa complain about stiff neck is :
ble (a) 0.01% (b) 0.02%
Process A 10211 11213 00x11 (c) 0.04% (d) 0.05%
Process B 20110 22210 Ans : (b) P(B/A) = P(A/B).P(B)/P(A)
Assume A refer to stiff neck & B refer to probability of
Process C 11010 21310 meningitis,
Process D 11110 11221 P(A/B) = meningitis causes stiff neck = 50% = 0.5
The smallest value of x for which the above P(B) = 1/50000
system in safe state is ................. P(B/A) = 0.5 × 1/50000/(1/20) = 0.02%
(a) 1 (b) 3 33. ............ system is market oriented and is used
(c) 2 (d) 0
for data analysis by knowledge workers
Ans : (c) Remaining need = Maximum - Allocated including managers, Executives and analysts.
Maximum Allocated Available Remaining (a) OLTP (b) OLAP
needs (c) Data system (d) Market system
A 11213 10211 00x11 01002 Ans : (b) OLAP (Online Analytical Processing)
B 22210 20110 02100 • Characterized by relatively low volume of
C 21310 11010 10300 transactions.
D 11221 11110 00111 • Queries are after very complex & involve
aggregations.
If x = 0, then no process satisfied remaining needs. • for OLAP systems a response time is an
If x = 1, then only process 'D can be executed other effectiveness measure
processes will not satisfy remaining needs. If x = 2, then all
• OLAP applications are widely used by a data
processes will be execute as safe sequence is D, C, B, A.
mining technique
30. In Unix, the login prompt can be changed by
34. ............. allows selection of the relevant
changing the contents of the file .............
information necessary for the data warehouse.
(a) contrab (b) init
(a) The Top – Down view
(c) gettydefs (d) inittab (b) Data warehouse view
Ans : (c) The gettydefs file supplies the gety command (c) Data source view
with information about various terminal attributes, such (d) Business query view
as the default initialization & the login message. The
gettydefs file contains single line entries that are Ans : (a) Four views regarding the design of a data
separated by blank lines. warehouse:
(i) There is nothing like contrab in unix. • Top-down view: Allows selection of the relevant
information necessary for the data warehouse.
(ii) The inittab file controls what happens whenever a
Unix system is rebooted or forced to change run levels. • Data source view: Exposes the information being
(iii) init (short for initialization) is the first process captured, stored and managed by operational
started during booting of the computer system. systems.
• Data warehouse view: Consists of fact tables and
31. A data cube C, has n dimensions, and each dimension tables.
dimension has exactly p distinct values in the • Business query view : Sees the perspectives of data
base cuboid. Assume that there are no concept in the warehouse from the view of end-user.
hierarchies associated with the dimensions.
Top-down view allows selection of the relevant
What is the maximum number of cells possible
information necessary for the data warehouse.
in the data cube, C?
(a) pn (b) p 35. The hash function used in double hashing is of
(c) (2n – 1) p + 1 (d) (p + 1)n the form :
Ans: (d) Maximum number of cells possible (including (a) h (k, i) = (h1 (k) + h2 (k) + i) mod m
both base cells & aggregate cells) in the data cube, C : (b) h (k, i) = (h1 (k) + h2 (k) – i) mod m
(p + 1)n (c) h (k, i) = (h1 (k) + i h2 (k) mod m
So answer is option (d) (d) h (k, i) = (h1 (k) – i h2 (k)) mod m
UGC NET JRF Computer Science Dec. 2015 Paper-II 169 YCT
 Search on TG: @apna_pdf
Ans: (c) The hash function used in double hashing is of Ans : (d) In inorder traversal first we traverse left node
the form. then root node and then right node: In the following tree
( h ( k ) + i ⋅ h ( k ) ) mod T
1 2

Generally, h1 & h2 are selected from a set of universal

hash functions.
36. In the following graph, discovery time stamps
and finishing time stamps of depth first search
(DFS) are shown as as x/y, is discovery time
stamp and y is finishing time stamp.
we first go to the left most node then its root after that
right i.e. 2 4 1 3 7 6 15 17 20 1 8 18. In the rest of the
option inorder property is violating.
39. An ideal sort is an in-place-sort whose
additional space requirement is.............
(a) O (log2 n) (b) O (nlog2 n)
(c) O (1) (d) O (n)
It shows which of the following depth first Ans : (c) In place sort are those sorts which doesn't
forest? need extra space it uses own space and in case if space
(a) {a, b, e} {c, d, f, g, h} is required then it is O(1).
(b) {a, b, e,} {c, d, h} {f, g} 40. Which of the following is not a congestion
(c) {a, b, e} {f, g} {c, d} {h} policy at network layer?
(d) {a, b, c, d} {e, f, g} {h} (a) Flow control policy
Ans : (a) (b) Packet discard policy
(c) Packet lifetime management policy
(d) Routing algorithm
Ans : (a) Flow control is function of data link layer and
transport layer but not by network layer. Flow control is
the process of managing the rate of data transmission
between two nodes to prevent a fast sender from over
whelming a slow receiver. Routing Algorithm, Packet
DFS visited nodes as: Lifetime Management Policy and Packet - Discard.
Policy are congestion policies used in network layer.
c→g→f→h→g→d→c Network layer congestion policy are–
then b → e → a (1) Virtual circuits vs datagram inside the sub net
then forest is {a, b, e}, {c, d, f, g, h} (2) Packet sequencing & service policy
37. The number of disk pages access in B – tree (3) Packet discard policy
search, where h is height, n is the number of (4) Routing algorithm
keys, and t is the minimum degree is : (5) Packet lifetime management.
(a) θ (logn h × t) (b) θ (logt n × h) 41. Loop unrolling is a code optimization
(c) θ (logh n) (d) θ (logt n) technique:
Ans : (d) The number of disk page accessed by B– (a) that avoids tests at every iteration of the loop
TREE–SEARCH is θ(h) = θ(log + h), where h is height (b) that improves performance by decreasing the
of the B–tree & h is the number of the keys in the B tree number of instructions in a basic block
Hence option (d) is correct (c) that exchanges inner loops with outer loops
(d) that reorders operations to allow multiple
38. The inorder traversal of the following tree is : computations to happen in parallel
Ans : (a) Loop unrolling is used to reduce the number
of jump & branch instructions which could potentially
make the loop faster but will increase the size of the
binary. Depending on the implementation & platform,
either could be faster.
42. What will be the hexadecimal value in the
register ax (32-bit) after executing the
(a) 2 3 4 6 7 13 15 17 18 18 20 following instructions?
(b) 20 18 18 17 15 13 7 6 4 3 2 mov al, 15 mov ah, 15
(c) 15 13 20 4 7 17 18 2 3 6 18 mov cl, 3 mov cl, 3
(d) 2 4 3 13 7 6 15 17 20 18 18
shr ax, cl
UGC NET JRF Computer Science Dec. 2015 Paper-II 170 YCT
 Search on TG: @apna_pdf
Codes : 46. In software testing, how the error, fault and
(a) 0F00 h (b) 0F0F h failure are related to each other?
(c) 01E0 h (d) FFFF h (a) Error leads to failure but fault is not related to
Ans : (c) In assembly AX = AH + BL error and failure
AL is the lower 8 bits (b) Fault leads to failure but error is not related
AH is the higher 8 bits to fault and failure.
here AL and AH both contains 15 or F as FX contains (c) Error leads to fault and fault leads to failure
of or 0000 1111 0000 1111 (d) Fault leads to error and error leads to failure
XOR AL AL will return D in AL so AX becomes 0000 Ans : (c) Error is deviation from actual & expected
1111 0000 0000 value it represents mistake made by people. Fault is
MOV CL, 3 will store 3 in CL incorrect step, process or data information in a
Shr ax, CL will shift right ax by 3 so 0000 1111 0000 computer program which causes the program to behave
0000 will become 0000 0001 1110 0000 or 01E0 in in an unintended or unanticipated manner. It is the result
hexadecimal i.e. C01E0H of the error. Failure is the inability of a system or a
43. Which of the following statements is false? component to a program its required functions within
specified performance requirements.
(a) Top-down parsers are LL parsers where first
L stands for left - to - right scan and second L
stands for a leftmost derivation
(b) (000)* is regular expression that matches 47. Which of the following is not a software
only strings containing an odd number of process model?
zeroes, including the empty string (a) Prototyping (b) Iterative
(c) Bottom-up parsers are in the LR family, (c) Timeboxing (d) Glassbosing
where L stands for left - to - right scan and R Ans : (d) Prototyping, iterative are well known
stands for rightmost derivation software process model
(d) The class of context - free languages is In time boxing model, development is done iteratively
closed under reversal. That is, if L is any as in iterative enhancement model each iteration is done
context – free language, then the language LR in a timebox of fixed duration.
= {wR : w∈L} is context – free ⇒ Glass boxing model is software testing pattern.
Ans : (b) (000)* is a regular expression that matches 48. How many solutions are there for the equation
only string containing an odd number of zeroes, x + y + z + u = 29 subject to the constraints that
including the empty string also contains 6, 12, 18, 24
x ≥ 1, y ≥ 2, z ≥ 3 and u ≥ 0?
which even.
(a) 4960 (b) 2600
So option (b) is the answer
(c) 23751 (d) 8855
44. System calls are usually invoked by using :
Ans : (b) x + y + y + u = 29 this is combination with
(a) A privileged instruction repetition
(b) An indirect jump x > = 1, y > = 2, z > 3, u > = 0, so allocate this to
(c) A software interrupt directly 29 – (1 + 2 + 3 – 0) = 29
(d) Polling (23 + 4 – 1) C23 = 26C23 = 2600
Ans : (c) Privileged instruction cannot be the answer as 49. A unix file system has 1-KB blocks and 4-disk
system call is done from user mode & privileged addresses. What is the maximum file size if i-
instruction cannot be done from user mode. nodes contain 10 direct entries and one single,
45. The .............. transfers the executable image of double and triple indirect entry each?
a C++ program from hard disk to main (a) 32 GB (b) 64 GB
memory. (c) 16 GB (d) 1 GB
(a) Compiler (b) Linker Ans : (c) Disk block size = 1 KB
(c) Debugger (d) Loader Disk block address = 4B
Ans : (d) It is the responsibility of loader to transfer Maximum file size possible = (DB size / DBA)3 × DB
executable files from hard disk to main memory. size = (1 KB/4B)3 × 1 KB
Debugger is a computer program that is used to test and = 16 GB
debug other-programs (target program). 50. ............... uses electronic means to transfer
⇒ Compiler: Compiler is a software which converts a funds directly from one account to another
program written in high level language (Source rather than by cheque or cash
Language) to low level language. (a) M-Banking (b) E-Banking
⇒ Linker takes object files, links them with each other (c) O-Banking (d) C-Banking
and with any library files that you specify and produces Ans : (b) Answer is E–banking. It is also known as net
an executable output file. banking.

UGC NET JRF Computer Science Dec. 2015 Paper-II 171 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2015

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. The three outputs x1x2x3 from the 8 × 3 priority (a) 0.64 (b) 0.96
encoder are used to provide a vector address of (c) 2.00 (d) 0.32
the form 101x1x2x300. What is the second Ans : (d) Given that in 1 msec (106 nsec) no. of refresh
highest priority vector address in hexadecimal cycle = 32 cycle then we can find cycle in 250 nsec
if the vector addresses are starting form the (which is 1 memory cycle no. of refresh cycle = (32 *
one with the highest priority? 250) 106 cycle.
(a) BC (b) A4 Now we can find total time taken by refresh operation
(c) BD (d) AC in 1 memory cycle.
Ans : (b) Priority encoder 8 × 3 gives equivalent bits 1 cycle of refresh operation required 100 nsec
for digits from 0–7 (32 * 250)/106 cycle of refresh operation required = ((32
Given vector address 101x1x2x300, first highest priority * 250)(106)) * 100 = 0.8 nsec
101 0 00 00 i.e. A0 (Since vector address are starting Now find percentage of memory total operating time is
from one with the highest priority x1 = x2 = x3 = 0) required for refreshes (100/250)* 0.8 = 0.32%
Second highest priority 10100100 i.e. (A4 )16 5. A DMA controller transfers 32-bit words to
(x1 = x2 = 0, x3 = 1) memory using cycle stealing. The words are
So answer will be option (b) assembled from a device that transmits
characters at a rate of 4800 characters per
2. What will be the output at PORT1 if the second. The CPU is fetching and executing
following program is executed? instructions at an average rate of one million
MVI B, 82H instructions per second. By how much will the
MOV A, B CPU be slowed down because of the DMA
MOV C, A Transfer?
MVI D, 27 H (a) 0.06% (b) 0.12%
OUT PORT1 (c) 1.2% (d) 2.5%
HLT Ans : (b) 1 Character = 1 byte
(a) 37H (b) 82H 32 bit word = 4 byte
(c) B9H (d) 00H 4800 bytes in 1 sec
Ans : (b) MVI B, 82H  move immediate 82 in to so for 1 byte it takes 1/4800 sec
register B. so for 4 byte it takes 1/1200 sec
MOV A, B  move value of B to accumulator A so 1200 words are transferred in 1 sec through cycle
stealing & gives 1 million instructions are fetching &
MOV C, A  move value A to register C
executing in 1 sec out of which 1200 words are
MVI D, 27 H copy value 27H to register D executing through cycle stealing so
OUT PORT1  copy value of A(82H) to port 1 % of slow down or cycle wasted in dma transfer =
So output will be 82H (1200/1000000) * 100 = 0.12%
3. Which of the following 8085 microprocessor 6. A CPU handles interrupt by executing
hardware interrupt has the lowest priority? interrupt service subroutine ................
(a) RST 6.5 (b) RST 7.5 (a) by checking interrupt register after execution
(c) TRAP (d) INTR of each instruction
Ans : (d) Hardware interrupts in 8085. (b) by checking interrupt register at the end of
TRAP RST 4.5> RST 7.5> RST 6.5> RST 5.5> INTR. the fetch cycle
INTR is level triggered and markable interrupt. It has (c) whenever an interrupt is registered
lowest priority. (d) by checking interrupt register at regular time
4. A dynamic RAM is refresh cycle of 32 times interval
per msec. Each refresh operation requires 100 Ans : (a) A CPU handles interrupt by executing
nsec and a memory cycle requires 250 nsec. interrupt service subroutine by checking the interrupt
What percentage of memory's total operating register after finishing the executing of the current
time is required for refreshes? instruction.
UGC NET JRF Computer Science Dec. 2015 Paper-III 172 YCT
 Search on TG: @apna_pdf
7. Given the following set of prolog clauses : Ans : (b) A socket address is the combination of an IP
father (X, Y) : address & a port number, much like one end of a
parent (X, Y), telephone connection is the combination of a phone
male (X), number and a particular extension.
parent (Sally, Bob), 11. A network with bandwidth of 10 Mbps can
parent (Jim, Bob), pass only an average of 15,000 frames per
parent (Alice, Jane), minute with each frame carrying an average of
parent (Thomas, Jane), 8,000 bits. What is the throughput of this
male (Bob), network?
male (Jim), (a) 2 Mbps (b) 60 Mbps
female (Salley), (c) 120 Mbps (d) 10 Mbps
female (Alice). Ans : (a) In data transmission, through put is the
How many atoms are matched to the variable amount of data moved successfully from one place to
'X' before the query another in a given period of time & typically measured
father (X, Jane) reports a Result? in bits per second (bps), or in Mega bytes per second
(a) 1 (b) 2 (Mbps) or giga bits per second (Gbps)
(c) 3 (d) 4 Here, through put = 15000 × 8000/60 = 2 Mbps
Ans : (*) Father (X, Jane) is true for those values of X
12. Consider a subnet with 720 routers. If a three-
which make sub-goals male(X) and parents (Jane, Y, X)
true. Recursively apply this reasoning until reach rules level hierarchy is choosen with eight clusters,
that are facts; called backward chaining only “Alice” is each containing 9 regions of 10 routers, then
matched. total number of entries in the routing table
8. Forward chaining systems are ............. where is........
as backward chaining systems are ............... (a) 25 (b) 27
(a) Data driven, Data driven (c) 53 (d) 72
(b) Goal driven, Data driven Ans : (a) Eight clusters, each containing 9 regions of
(c) Data driven, Goal driven 10 routers is a 3 level hierarchy. Each router needs 10
(d) Goal driven, Goal driven entries for local, 8 entries for routing the other regions
Ans : (c) Since data drives forward chaining it is data and for distant cluster it need 7 entries i.e. total 10 + 8 +
driven & goal drives backward chaining it is goal 7 = 25.
driven. 13. In a classful addressing, the IP addresses with
9. Match the following w.r.t. programming 0 (zero) as network number:
language : (a) refers to the current network
List - I List - II (b) refers to broadcast on the local network
(A) JAVA (i) Dynamically object (c) refers to broadcast on a distant network
oriented (d) refers to loopback testing
(B) Python (ii) Statically Non-object Ans : (a) If address belongs to any network with a host
oriented number of 0 (zero) is called the network address of the
(C) Prolog (iii) Statically object network. It does not denote any host.
oriented Addresses with a network number of 0 are used refer to
(D) ADA (iv) Dynamically non- the current network, allowing a host to send to a
object oriented neighbor without needing to know the network number
Codes : of its local network (IP packets with destination
(A) (B) (C) (D) network address of 0 are not routed).
(a) (iii) (i) (ii) (iv) 14. In electronic mail, which of the following
(b) (i) (iii) (ii) (iv) protocols allows the transfer of multimedia
(c) (i) (iii) (iv) (ii) messages?
(d) (ii) (iv) (i) (iii) (a) IMAP (b) SMTP
Ans : (*) (c) POP 3 (d) MIME
10. The combination of an IP address and a port Ans : (d) Multipurpose internet mail extensions
number is known as ............. (MIME) is an internet standard that extends the format
(a) network number of email to support. Text in character sets other than
(b) socket address ASCII. No-text attachements: Audio, Video, Image,
(c) subnet mask number Application programs etc. message bodies with multiple
(d) MAC address parts.
UGC NET JRF Computer Science Dec. 2015 Paper-III 173 YCT
 Search on TG: @apna_pdf
15. A device is sending out data at the rate of 2000 (a) O(lg n) (b) O(n)
bps. How long does it take to send a file of (c) O(n lg n) (d) None of the above
1,00,000 characters? Ans : (d) Given, recurrence relation is:
(a) 50 (b) 200  Θ(1)
 if n ≤ 80
(c) 400 (d) 800 T ( n) =   7n 
Ans : (c) File of 1,00,000 characters = 8*100 000 T (n / s ) + T  10 + 6  + O (n) else
  
= 8000000
 7n 
rate = 2000 bps T ( n) = T (n / s ) + T  + 6  + O ( n )
 10 
1 sec = 2000 b
 7n 
for 800000 ≤ c ( n / s ) + c  + 6  + O ( n)
then 400 sec needed  10 
16. In activity – Selection problem, each activity i 7 cn
≤ c (n / s ) + + 6c + O ( n )
10
has a start time s, and a finish time fi where si ≤
f . Activities i and j are compatible if: ≤ c.n = Θ(n)
i
(a) si ≥ fj (b) sj ≥ fi We assume that S is constant as 5 else we can’t solve
(c) si ≥ fj or sj ≥ fi (d) si ≥ fj and sj ≥ fi recurrence relation.
Both option (b) and (c) should be true, if we assumed S
Ans : (c) Two activities are compatible if they can be is 5.
completed in same order & don't overlap in time. To
20. Floyd–Warshall algorithm utilizes ............. to
complete two activates, start time of one activity must
solve the all-pairs shortest paths problem on a
be greater than or equal to finish time of other activity.
directed graph in .............. time.
si > = fj or sj = fi
(a) Greedy algorithm, Θ(V3)
17. Given two sequences X and Y : (b) Greedy algorithm, Θ log n(V2lgn)
X = 〈a, b, c, b, d, a, b〉〉 (c) Dynamic programming, Θ(V3)
Y = 〈 b, d, c, a, b, a〉〉 (d) Dynamic programming, Θ log n(V2 lgn)
The longest common subsequence of X and Y Ans : (c) The Floyd -Warshall algorithm compares all
is: possible paths through the graph between each pair of
(a) 〈b, c, a〉 (b) 〈c, a, b〉 vertices. It is able to do this with Θ(|V|3) comparisons in
a graph.
(c) 〈b, c, a, a〉 (d) 〈b, c, b, a〉
21. Let n = 4 and (a1, a2, a3, a4) = do, if, int,
Ans : (d) X= 〈a, b, c, b, d, a, b〉
3 3 1 1
Y = 〈b, d, c, a, b, a〉 while). Let p(1 : 4) =  , , ,  and q (1 : 4)
8 8 8 8
〈b, c, b, a〉
2 3 1 1 1
18. If there are n integers to sort, each integer has =  , , , ,  where p(i) and q(i) denotes
8 8 8 8 8
d digits and each digit is in the set {1, 2, ......, k},
the probability with which search ai and the
radix sort can sort the numbers in : identifier x being searched satisfy ai < x < ai +1
(a) O (d n k) (b) O (d nk) respectively. The optimal search tree is given
(c) O((d + n)k) (d) O(d(n + k)) by :
Ans : (d) Lets consider there are 'k' buckets (as given)
Now, for each digit you repeat the following
(1) Place the digit of each number in the appropriate bin
– O(n) (a) (b)
(2) Append all the 'k' bins sequentially thus, d digit, its
O (d(n+k))
19. The solution of the recurrence relation
θ ( 1) if n ≤ 80 (c) (d)
 Ans : (b) Search success nodes are:
T (n ) ≤   n   7n 
T   + T  + 6  + O ( n ) if n > 80 〈do, if, int, while〉 in ascending order.
 s  10  Therefore, option (c) and (d) cannot be true. Now
is : minimum cost of given tree in option (a) and (b).

UGC NET JRF Computer Science Dec. 2015 Paper-III 174 YCT
 Search on TG: @apna_pdf
(c) (iv) (iii) (ii) (i)
(d) (iv) (iii) (i) (ii)
Ans : (*) (i) {an bn | n > 0} is DCFL but not regular.
(ii) {an bn an | n > 1} is context sensitive language but its
complement is {am bn an | m ≠ n or m ≠ p or n ≠ p} is
context free language.
(iii) If a language is recursive, then it cannot be
accepted by a deterministic push-down automata or
1 3 1 3 1 1 1  2 3
Cost = × 1 +  +  × 2 +  + + +  × 3 +  +  × 4 = 5.875 non-deterministic push-down automata.
8 8 8 8 8 8 8 8 8
24. The language of all non-null strings of a's can
be defined by a context free grammar as
follow:
S → a SS a  a
The word a3 can be generated by .............
different trees.
(a) Two (b) Three
(c) Four (d) Five
3 3 1 2 3 1 1 1 1
Cost = × 1 +  +  × 2 +  + + +  × 3 +  +  × 4 = 5 Ans : (c)
8  8 8   8 8 8 8  8 8
22. The family of context sensitive language is
......... under union and ..............under reversal.
(a) closed, not closed
(b) not closed, not closed
(c) closed, closed 25. Which one of the following non-functional
(d) not closed, closed quality attributes is not highly affected by the
architecture of the software?
Ans : (c) Context sensitive language are closed under
(a) Performance (b) Reliability
union, intersection, Kleen closer, cancatenation and
reversal. (c) Usability (d) Portability
Ans : (c) Usability should not be highly affected by the
23. Match the following :
architecture of the software as it is basic things rest
List – I List - II options are extra features offered by s/w & may be
(A) {anbnn > 0} (i) but not recursive highly affected by the architecture of the s/w.
is language 26. The context free grammar given by
deterministic
S → XYZ
context free
language X → aXbXA
(B) The (ii) but not context Y → bbb
complement free language generates the language which is defined by
of {a b a n
n n n regular expression :
> 0} is a (a) (a + b) * bbb
context free (b) abbb (a + b)*
language (c) (a + b)*(bbb)(a + b)*
n n n
(C) {a b a } is (iii) but can not be (d) (a + b)(bbb) (a + b)*
context accepted by a Ans : (c) looking at X → aXbXeps
sensitive deterministic we see that X is generating (a + b) *
language Now simply replacing X by (a + b) *
(D) L is a (iv) but not regular & y by bbb is S → X y X
recursive we get (a + b) * (bbb) (a + b)*
language So answer is option (c)
Codes : 27. There are exactly ................... different finite
(A) (B) (C) (D) automata with three states x, y and z over the
(a) (i) (ii) (iii) (iv) alphabet {a, b} where x is always the start
(b) (i) (ii) (iv) (iii) state.
UGC NET JRF Computer Science Dec. 2015 Paper-III 175 YCT
 Search on TG: @apna_pdf
(a) 64 (b) 256 (C) Encapsulation (iii) Using similar
(c) 1024 (d) 5832 operations to
Ans : (d) For n states and m input alphabets we can do similar
have number of states giving nmn × 2n possible DFAs things
when only one start state. (D) Abstraction (iv) Create new
Given, number of states (n) = 3 classes from
Number of input alphabets (m) = 2 existing class
Then, number of DFA’s = 32×3 × 23 = 36 × 8 = 5832 Codes :
28. Given the following two languages : (A) (B) (C) (D)
(a) (iv) (iii) (i) (ii)
L1 = {an b an n > 0}
(b) (iii) (iv) (i) (ii)
L2 = {an b an bn + 1 n > 0}
(c) (iii) (i) (ii) (iv)
Which of the following is correct?
(d) (iv) (iii) (ii) (i)
(a) L1 is context free language and L2 is not
Ans : (b) (a) Polymorphism is using similar operation
context free language
to do similar thing (iii)
(b) L1 is not context free language and L2 is
(b) Inheritance is create new class by inheriting existing
context free language
one (iv)
(c) Both L1 and L2 are context free languages
(c) Encapsulation is showing essential feature without
(d) Both L1 and L2 are not context free language
including background detail (i)
Ans : (a) A. L1 is context free language (deterministic) (d) Abstraction is (ii)
& L2 is not context free language
31. In CRC based design, a CRC team consists of :
for L1, we need to count the number of a's before &
after b's & this length is not finite. Hence it is DCFL & (1) one or two users representatives
not regular (2) several programmers
for L2, in addition to above comparison, we also need to (3) project co-ordinators
ensure number of b's following the a's just one more. (4) one or two system analysts
This is a second non-finite comparison & cannot be Codes :
done with just one stack. So, this makes L2 a CSL. (a) (1) and (3)
29. Which of the following is used to make an (b) (1), (2), (3) and (4)
(c) (1), (3) and (4)
Abstract class?
(d) (1), (2) and (4)
(a) Making atleast one member function as pure
virtual function Ans : (c) Answer should be C in critical review
(b) Making atleast one member function as committee the CRC team must consist
virtual function (1) one or two user representative
(c) Declaring as abstract class virtual keyword (2) project co-ordinates
(d) Declaring as Abstract class static keyword (3) system analyst
Need of programmers is not there as they can be co-
Ans : (a) For making the class as abstract class we
ordinated later by project co-ordinaters
should make atleast one member function as pure
virtual function. 32. The end points of a given line are (0, 0) and (6,
30. Match the following with reference to object 18). Compute each value of y as x steps from 0
to 3, by using equation of straight line :
oriented modeling :
(a) For x = 0, y = 0; x = 1, y = 3; x = 2, y = 6; x
List – I List – II = 3, y = 9
(A) Polymorphism (i) Picking both (b) For x = 0, y = 1; x = 1, y = 3; x = 2, y = 4; x
operator and = 3, y = 9
attributes with (c) For x = 0, y = 2; x = 1, y = 3; x = 2, y = 6; x
operations = 3, y = 9
appropriate (d) For x = 0, y = 0; x = 1, y = 3; x = 2, y = 4; x
model an object = 3, y = 6
(B) Inheritance (ii) Hiding Ans : (a) Equation of line passing through two given
implementation points (x1, y1) and (x2, y2) is–
details of (y - y ).(x - x1 )
methods from ⇒ y - y1 = 2 1
(x 2 - x1 )
users of objects

UGC NET JRF Computer Science Dec. 2015 Paper-III 176 YCT
 Search on TG: @apna_pdf
Given points are (0, 0) and (6, 18) then: Codes :
(18 - 0).(x - 0) (a) (1) only (b) (2) only (3)
⇒ y-0 = ⇒ y = 3x (c) (1) and (2) (d) (1) and (3)
6-0
Ans : (d) The correct statements are (1) and (3).
therefore– x = 0 1 2 3
Hence the answer is option (d)
y=0369
36. Which of the following is/are correct with
33. Which of the following graphic primitives are
reference to abstract class and interface?
considered as the basic building blocks of
(1) A class can inherit only one Abstract class
computer graphics?
but may inherit several interfaces
(1) Points (2) An Abstract class can provide complete
(2) Lines and default code but an interface has no
(3) Polylines code
(4) Polygons Codes :
Codes : (a) (1) is true
(a) (1) only (b) (2) is true
(b) (1) and (2) (c) Both (1) and (2) are true
(c) (1), (2) and (3) (d) Neither (1) nor (2) is true
(d) (1), (2), (3) and (4) Ans : (c) An interface is an empty shall, there are only
Ans : (b) A pixel is a point of light. It is just one tiny the signatures of the methods, which implies that the
dot on the raster displays. Though it has no structure, it methods do not have a body. The interface can't do
is definitely a building block and hence it can be anything. It's just a pattern so b is true.
considered as the graphics primitive. The resolution of A child can only extend a single class, where as an
CRT is related to the dot size, the diameter of single interface can extend or a class can implement multiple
dot. other interfaces so a is true.
∗ Line, especially straight lines, constitute the basic 37 . Match the following with respect to various
building block of line graphs, bar and pie charts, two memory management algorithms :
and three dimensional graphs of mathematical List - I List - II
functions, engineering drawings and architectural plans. (A) Demand (i) degree of
– Points and lines are the building blocks of computer paging multiprogramming
graphics. (B) Segmentation (ii) working set
34. Javascript and Java similar name because (C) Dynamic (iii) supports user view
partitions of memory
............ is/are true.
(D) Fixed (iv) compaction
(1) Javascripts syntax is loosely based on partitions
Java's syntax
Codes :
(2) Javascript is stripped down version of
(A) (B) (C) (D)
Java
(a) (iii) (iv) (ii) (i)
(3) Java and Javascript are originated from
(b) (ii) (iii) (i) (iv)
Island of Java
(c) (iv) (iii) (ii) (i)
Codes :
(d) (ii) (iii) (iv) (i)
(a) (1) only
Ans : (d)
(b) (1), (2) and (3)
(c) (1) and (2) 38. Function of memory management unit is :
(d) (1) and (3) (a) Address translation
Ans : (a) Clearly statement C is not true which implies (b) Memory allocation
choice B, D are out also statement B is not true as they (c) Cache management
are different language. (d) All of the above
Although they are different languages, Java Script's Ans : (a) A memory management unit (MMU),
syntax is loosely based on Java. sometimes called paged memory management unit
(PMMU), is a computer hardware unit having all
35. Which of the following statements are true
memory references passed through itself, primarily
with reference to the way of describing XML performing the translation of virtual memory address to
data? physical address.
(1) XML uses DTD to describe the data 39. Consider a system with twelve magnetic tape
(2) XML uses XSL to describe the data
drives and three processes P1, P2 and P3.
(3) XML uses a description node to describe Process P1 requires maximum ten tape drives,
the data process P2 may need as many as four tape
UGC NET JRF Computer Science Dec. 2015 Paper-III 177 YCT
 Search on TG: @apna_pdf
drives and P3 may need upto nine tape drives. (c) (iii) (i) (ii) (iv)
Suppose that at time t1, process P1 is holding (d) (iv) (ii) (i) (iii)
five tape drives, process P2 is holding two tape Ans : (a)
drives and process and process P3 is holding (a) Boot block located in the first few sectors of a file
three tape drives. At time t1, system is in : system. The boot block contains the initial bootstrap
(a) safe state (b) unsafe state program used to load the OS (iv)
(c) deadlocked state (d) starvation state (b) A super block describes the state of the file system :
Ans : (b) System is in UNSAFE state the total size of the partition, the block size, pointer to a
• P1 holds 5 tapes list of free blocks etc.
• P2 holds 2 tapes (c) A linear array of inodes. There is a one to one
mapping of files to inode & vice versa (ii)
• P3 holds 3 tapes
(d) Data blocks block containing the actual content of
Total 10 tapes are allocated & 12 – 10 = 2 tapes are free
files (iii)
• P1 requires maximum 10 tape drives, it needs 10 – 5
= 5 more tapes 42. In an operating system, indivisibility of
• P2 may need as many as 4 tape drives, it needs 4 – 2 operation means :
= 2 more tapes (a) Operation is interruptible
• P3 may need as many as 9 tape drives, it needs 9 – (b) Race – condition may occur
3 = 6 more tapes (c) Processor cannot be pre-empted
We can allocate 2 free tapes to P2 (d) All of the above
P2 will complete execution & release all its resource Ans : (c) In an OS, an divisible or irreducible operation
including 4 tapes is an atomic operation that is performed entirely or not
Even if we allocate 4 tapes to P1 or P3 they cannot performed at all. Means processor can not be pre-
complete execution because P1 needs 5 more tape empted. It will be performed entirely or not at all.
So system is in unsafe state 43. A horn clause is ....................
40. In Unix operating system, special files are used (a) A clause in which no variables occur in the
expression
to :
(b) A clause that has at least one negative literal
(a) buffer data received in its input from where a
process reads (c) A disjunction of a number of literals
(b) provide a mechanism to map physical device (d) A clause that has at most one positive literal
to file names Ans : (d) In logic programming horn clause is a clause
(c) store list of file names plus pointers that has at most one positive literal. When there is
associated with i-nodes exactly one positive literal then it is known as definite
(d) store information entered by a user clause.
application program or utility program 44. In propositional logic, given P and P → Q, we
Ans : (b) In the Unix file system, six types of file are can infer ................
distinguished. (a) ~ Q (b) Q
– special, Named pipes, Links, Symbolic links, Regular (c) P ^ Q (d) ~ P ^ Q
or ordinary, Directory. Ans : (b) P → Q answer P infer to Q
∗ Special- Contains no data, but provides a mechanism using modus P one ns
to map physical devices to file names. The file names option (b) is the answer
are used to access peripheral devices, such as terminals
and printers. 45. Reasoning strategies used in expert system
41. Match the following in Unix file system : include .............
(a) Forward chaining, backward chaining and
List - I List – II problem reduction
(A) Boot block (i) Information (b) Forward chaining, backward chaining and
about file system boundary mutation
(B) Super block (ii) Information (c) Forward chaining, backward chaining and
about file back propagation
(C) Inode table (iii) Storage space (d) Backward chaining, problem reduction and
(D) Data block (iv) Code for making boundary mutation
OS ready Ans : (a) Forward chaining : Expert system is driven
Codes : by the antecedent (left hand side)
(A) (B) (C) (D) Backward chaining : Expert system is driven by the
(a) (iv) (i) (ii) (iii) consequent (right hand side)
(b) (i) (iii) (ii) (iv) So answer is option (a)
UGC NET JRF Computer Science Dec. 2015 Paper-III 178 YCT
 Search on TG: @apna_pdf
46. Language model used in LISP is ............. H(x/y) = ∑P(x, y) log P(x/y)
(a) Functional programming The joint probability distribution P(x/y) is:
(b) Logic programming 0.5(1- p) 0.5p 
(c) Object oriented programming  0.5p 0.5(1 − p) 

(d) All of the above
and the conditional probability distribution P(x/y) is:
Ans : (a) LISP is a functional language useful
properties of a functional language are :  (1- p) p 
 
• Evaluates an expression and use the result  p (1 − p) 
• Call functions Combining these matrix elements accordingly gives us the
• Related to mathematics & theory of functions conditional entropy:
• Side effect free H(x/y) = –[0.5(1 – p) log (1 – p) + 0.5p log (p) + 0.5p log (p)
47. In constraint satisfaction problem, constraints + 0.5 (1 – p) log (1 – p)]
can be stated as .............. H(x/y) = –(1 – p) log (1 – p) – p log(p)
(a) Arithmetic equations and inequalities that H(x/y) = –p log (p) – (1 – p) log (1 – p)
bind the values of variables 50. Which of the following is not a lossy
(b) Arithmetic equations and inequalities that compression technique?
doesn't bind any restriction over variables
(a) JPEG (b) MPEG
(c) Arithmetic equations that impose restrictions
over variables (c) FFT (d) Arithmetic coding
(d) Arithmetic equations that discard constraints Ans : (d) Arithmetic coding is a from of entropy
over the given variables encoding used in lossless data compression. Normally, a
Ans : (a) Remember map coloring problem, it is a string of characters such as the words "Hello" is
constraint satisfaction problem we need mathematical represented using a fixed number of bits per character,
equation and inequalities. So 3 & 4 are not the answer. as in the ASCII code.
Inequalities are must to check whether constraints are Lossless and lossy compression are terms that describe
fullified. Equation specify the constraint. In a nutshell 1 whether or not, in the compression of a file, all original
should be the proper choice. data can be recovered when the file is uncompressed.
48. As compared to rental and leasing methods to Hence option (a), (b), (c) are lossy compression
acquire computer systems for a management technique and the answer is option (d)
information system (MIS), purchase method 51. Blind image deconvolution is ...............
has following advantage :
(a) Combination of blur identification and image
(a) It has high level of flexibility
restoration
(b) It doesn't require cash up-front
(b) Combination of segmentation and
(c) It is a business investment
classification
(d) Little risk of obsolescence
(c) Combination of blur and non-blur image
Ans : (c) It is just an investment. Purchasing a line will
(d) None of the above
not yield better reliability or flexibility than leased one.
Ans : (a) In image processing, a blind deconvolution is
49. Consider the conditional entropy and mutual
a disconsolation technique that permits recovery of the
information for the binary symmetric channel. target scene from the single or set of "blurred" images
The input source has alphabet X = {0, 1} and
in the presence of a poorly determined or unknown
1 1  point spread function (PSF)
associated probabilities  ,  . The channel
2 2 52. A basic feasible solution of a linear
1 - p p  programming problem is said to be ............. if
matrix is   where p is transition
 p 1- p at least one of the basic variable is zero.
probability. Then the conditional entropy is (a) degenerate (b) non-degenerate
given by : (c) infeasible (d) unbounded
(a) 1 Ans : (a) Basic feasible solution : A feasible solution
(b) –plog(p) – (1 – p)log(1 – p) to LP problem which is also the basic solution is called
(c) 1 + plog(p) + (1 – p)log(1 – p) the "basic feasible solution". Basic feasible solution are
(d) 0 of two types.
Ans : (b) The uncertainty about the input x given the Degenerate : A basic feasible solution is called
observed output y from the channel is the conditional degenerate if value of at least one basic variable is zero.
entropy H(x/y), which is defined as: So answer is option (a)

UGC NET JRF Computer Science Dec. 2015 Paper-III 179 YCT
 Search on TG: @apna_pdf
53. Consider the following conditions : Ans : (d) All three commands are used to enable
(1) The solution must be feasible, i.e. it must execution permission CH mode X for execution ugo
satisfy all the supply and demand (user group other) and + for add
constraints a (all) and + for add
(2) The number of positive allocations must be only + for all
equal to m + n – 1, where m is the number So answer is option (d)
of rows and n is the number of columns 57. What will be the output of the following Unix
(3) All the positive allocations must be in command?
independent positions
$rm chap0\[1 – 3\]
The initial solution of a transportation problem (a) Remove file chap0[1 – 3]
is said to be non-degenerate basic feasible
(b) Remove file chap01, chap02, chap03
solution if it satisfies :
(c) Remove file chap\[1 – 3\]
Codes :
(d) None of the above
(a) (1) and (2) only (b) (1) and (3) only
(c) (2) and (3) only (d) (1), (2) and (3) Ans : (a) If you use rm chap*, you will remove all files
beginning with chap. The way to remove the file chap*
Ans : (d) All condition must be true (all these are basic
is to use the backslash (\) as follows:
constraints). Hence answer is option (d)
$ chap \ *
54. Consider the following transportation The use of the \ in removing any special character is
problem: called escaping or despecializing. For Ex-
Stores to remove a file chap 0[1 – 3], use, use: $rm chap*\[1 –
I II III IV Supply 3\].
A 4 6 8 13 50 58. Which of the following statement regarding the
B 13 11 10 8 70 features of the object-oriented approach to
Factories

C 14 4 10 13 30 databases are true?

(1) The ability to develop more realistic
D 9 11 13 8 50
models of the real world
Demand 25 35 105 20 (2) The ability to represent the world in a
The transportation cost in the initial basic non-geometric way
feasible solution of the above transportation (3) The ability to develop databases using
problem using Vogel's Approximation method natural language approaches
is : (4) The need to split objects into their
(a) 1450 (b) 1465 component parts
(c) 1480 (d) 1520 (5) The ability to develop database models
Ans : (b) Add fifth column with zero cost to balance based on location rather than state and
the demand supply. behavior
15 × 0 + 30 × 4 + 25 × 4 + 5 × 6 + 20 × 8 + 20 × 8 + 70 Codes :
× 10 + 15 × 13 + 0 + 120 + 100 + 30 + 160 + 700 + 195 (a) (1), (2) and (3)
= 1465 (b) (2), (3) and (4)
55. The character set used in windows 2000 (c) (1), (4) and (5)
operating system is ........... (d) (3), (4) and (5)
(a) 8 bit ASCII Ans : (a) The following statements are true. The ability
(b) Extended ASCII to develop more realistic models of the real world (a)
(c) 16 bit UNICODE • The ability to represent the world in a non
(d) 12 bit UNICODE geometric way (b)
Ans : (c) 16 bit UNICODE character set used in • The ability to develop databases using natural
Windows 2000 operating system. Extended ASCII language approach (c)
character encoding are 8 bit or larger encoding that Hence answer is (a)
include 7 bit ASCII character. ASCII coding is 8 bit 59. Consider the following database table :
character encoding.
Create table test (
56. In Unix, the command to enable execution one integer,
permission for file "mylife" by all is .......... two integer,
(a) Chmod ugo + X myfile primary key (one),
(b) Chmod a + X myfile unique (two),
(c) Chmod + X myfile check(one > = 1 and < = 10),
(d) All of the above check(two > = 1 and < = 5)
UGC NET JRF Computer Science Dec. 2015 Paper-III 180 YCT
 Search on TG: @apna_pdf
How many data records/tuples atmost can this distributed system by .......(Q)....... where (P)
table contain? and (Q) are :
(a) 5 (b) 10 (a) Loosely coupled hardware on tightly coupled
(c) 15 (d) 50 software and disk sharing, respectively.
Ans : (a) Attribute ‘one’ can have 10 values from 1 to (b) Tightly coupled hardware on loosely coupled
10 and attribute ‘two’ can have 5 values from 1 to 5. software and shared memory, respectively
But attribute ‘one’ is primary key it cannot have (c) Tightly coupled software on loosely coupled
duplicate values, so attribute ‘one’ is allowed only 5 hardware and message passing, respectively
values from 1 to 10. Any 5 value from 1 to 5 of attribute hardware and file sharing, respectively
‘two so, relation can have atmost 5 values. (d) Loosely coupled software on tightly coupled
hardware and file sharing, respectively
60. Suppose ORACLE relation R(A, B) currently
Ans : (c) Hardware is loosely coupled & software is
has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B,
tightly coupled.
C) currently has {(2, 5), (4, 6), (7, 8)}. Consider
the following two SQL queries SQ1 and SQ2 : Distributed computing is a field of computer science
that studies distributed systems. A distributed system is
SQ1 : Select *
model in which components located on network
From R Full Join S computers communicate & co-ordinate their actions by
On R.B = S.B; passing message.
SQ2 : Select * 63. Consider the following three tables R, S and T.
From R Inner Join S In this question, all the join operations are
On R.B = S.B;
natural joins (⊳⊲) . (π π) is the projection
The numbers of tuples in the result of the SQL
query SQ1 query SQ1 and the SQL query SQ2 operation of a relation :
are given by :
(a) 2 and 6 respectively
(b) 6 and 2 respectively
(c) 2 and 4 respectively
(d) 4 and 2 respectively
Ans : (d) Here R.B. = S. B holds for 2 records when B
= 2 & B = 4 hence its result w hence 2
for SQ2 full join or full outer join gives the result of left Possible answer tables for this are also given as
outer join (all rows of left table whether there is match below :
or not with the left) now both table has 3 records but
there are 2 match and 2 mismatch.
Hence SQ1 will give 4 records
So answer is option (d)
61. Consider the following three SQL queries
(Assume the data in the people table) :
(1) Select Name from people where Age > 21; What is the resulting table of πA,B
(2) Select Name from people where Height > ( R ⊳⊲ T ) πA,B ( R ⊳⊲ T ) >< πB,C ( S ⊳⊲ T ) ?
180; (a) (1) (b) (2)
(3) Select Name from people where (age > 21) (c) (3) (d) (4)
or (Height > 180); Ans : (b) Option (a) is option return all possible results
If the SQL queries (1) and (2) above, return 10 after natural join but it does not involve the table t
row and 7 rows in the result set respectively, during natural join. So option (b) is correct.
then what is one possible umber of rows 64. Consider the two class classification task that
returned by the SQL query (3)?
consists of the following points :
(a) 3 (b) 7
Class C1 : [–1, –1], [–1, 1], [1, –1]
(c) 10 (d) 21
Class C2 : [1, 1]
Ans : (c) When set a and set b all rows are distains The decision boundary between the two classes
answer would be = 10 + 7 = 17 C1 and C2 using single perceptron is given by :
When set b is subset of set a than 10 + 7 – 7 = 10 (a) x1 – x2 – 0.5 = 0
So answer is option (c) (b) –x1 + x2 – 0.5 = 0
62. The distributed system is a collection of (c) 0.5 (x1 + x2) – 1.5 = 0
.........(P)........ and communication is achieved in (d) x1 + x2 – 0.5 = 0
UGC NET JRF Computer Science Dec. 2015 Paper-III 181 YCT
 Search on TG: @apna_pdf
Ans : (d) Since x1 + x2 – 0.5 = 0 Codes
Separately the points of class C2 from all the points of (a) (1) and (2)
class C1. Hence ans is option (d) (b) (3) only
(c) (4) only
(d) All the above
Ans : (d) Flooding gun, collector, phosphorus grains,
ground are the main components of a memory tube
display. So answer is option (d)
68. Which of the following step is/are not required
for analog to digital conversion?
65. Consider a standard additive model consisting (1) Sensing
(2) Conversion
of rules of the from of
(3) Amplification
If x is Ai and y is Bi THEN z is Ci
Give crisp inputs x = x0, y = y0 the output of the (4) Conditioning
model is : (5) Quantization
(a) z = ∑ µA i ( x 0 ) µBi ( y0 ) µCi ( z ) Codes
i (a) (1) and (2)
(b) z = ∑ µA i ( x 0 ) µBi ( y0 ) (b) (3) and (4)
i (c) (1), (2) and (5)
  (d) None of the above
(c) z = centroid  ∑ µAi ( x 0 ) µBi ( y0 ) µCi ( z )  Ans : (d) The steps which are required are
 i 
(1) Sampling, quantization, amplification, Conversation
  every option contains at least one of these 3.
(d) z = centroid  ∑ µA i ( x 0 ) µBi ( y0 ) 
 i  Hence option (d) is answer.
Ans : (c) Standard Additive model (SAM) includes the 69. Which raster locations would be chosen by
cetroid defuzzication technique. Here if X is and y is Bresenham's algorithm when scan converting a
then z is given crisp inputs x = xo, y = 40 line form (1, 1) to (8, 5)?
z = centroid (ΣiµAi (xo) µBi (yo) µ(i(z))
66. A bell-shaped membership function is specified
by three parameters (a, b, c) as follows :
1 1
(a) b
(b) 2b
 x −c  x −c
1+   1 +  a 
 a   
b 2b
 x −c   x −c  (a) (b)
(c) 1 +   (d) 1 −  
 a   a 
Ans : (b) A generalized bell-swaped membership
function is specified by three parameters (a, b, c) as
1
follows: bell (x; a, b, c) = 2b
x −c
1+
a
Where c and a represent the center and width,
respectively of the membership function and the (c) (d)
parameter b is usually positive. Ans : (c) Short cut method since line has to be drawn
67. Which of the following is/are the principle from (1, 1) to (8, 5) so choice 1, 2 are out as they are
components of a memory-tube display? ending up with 8, 6 & 8, 7
(1) Flooding gun Now in choice 4 after point 4, 3 it is 5, 5 i.e. increment
(2) Collector of 2 in y which is not as per rule of line of drawing.
(3) Phosphorus grains So we can say answer is option (c) (because such
(4) Ground unusual pattern is not seen is this)

UGC NET JRF Computer Science Dec. 2015 Paper-III 182 YCT
 Search on TG: @apna_pdf
70. Consider a unit square centred at origin. The (a) Pareto analysis is a statistical method used
coordinates of the square are translated by a for analyzing causes, and is one of the
1  primary tools for quality management
factor  ,1  and rotated by an angle of 90o. (b) Reliability of a software specifies the
2  probability of failure-free operation of that
What shall be the coordinates of the new software for a given time duration
square? - 2
1

- 2
1

- 2
3

- 2
3
, (c) The reliability of a system can also be
0
,

,
1
,

,
1
,

,
0
     specified as the mean time to failure (MTTF)
(a)     
     (d) In white-box testing, the test cases are
- 2
1

1 2

3 2

3 2
,
0
,
,
1
,
,
1
,
,
0
decided from the specifications or the
    
(b)      requirements
    
- 2
1

1 2

- 2
3

- 2
3
Ans : (d) White box testing are connected with codes
,
0
,
,
1
,

,
1
,

,
0
     in block box testing the test case are decided from the
(c)     
     specification of the requirement.
- 2
1

1 2

- 2
3

- 2
3
,
0
,
,
1
,

,
1
,

,
0
So answer is option (d)
    
(d)      73. Consider a language A defined over the
    
Ans : (a) A translation applied by a factor (1/2, 1) to all alphabet ∑ { } { n/2
}
= 0,1 as A = 0[ ]1n : n > = 0 .
four points. The expression [n/2] means the floor of n/2, or
⇒ x ' = x + tx , y ' = y + ty what you get by rounding n/2 down to the
where, tx = ½ and ty = 1, therefore, A = (1, 3/2), B = (0, nearest integer.
3/2), C = (0, ½), D = (1, 1/2) Which of the following is not an example of a
Now, rotation by angle 900 according to given formula: string in A?
x' = x cos 900 – y sin 900 (a) 011 (b) 0111
y' = x sin 900 + y cos 900 (c) 0011 (d) 001111
For point A: Ans : (c) If n = 2
x' = 1 cos 900 – 3/2 sin 900 = -3/2 [n/2] = [1] = 1 i.e. language is : 011
y' = 1 sin 900 + 3/2 cos 900 = 1 If n = 3
For point B: [n/2] = [1.5] = 1 i.e. language is : 0111
If n = 4
x' = -3/2, y' = 0
[n/2] = [2] = 2 i.e. language is : 00111
For point C:
Hence option (a) is possible, (b) is possible, (d) is
x' = -1/2, y' = 0
possible but (c) is not possible
For point D:
74. Which one of the following statements, related
x' = -1/2, y' = 1
to the requirements phase in software
71. Which of the following is/are the components Engineering, is incorrect?
of a CRT? (a) "Requirement validation" is one of the
(a) Electron Gun activities in the requirements phase
(b) Control Electrode (b) "Prototyping" is one of the methods for
(c) Focusing Electrode requirement analysis
(d) Phosphor Coated Screen (c) "Modeling-oriented approach" is one of the
Codes methods for specifying the functional
(a) (1) and (4) specifications
(b) (1), (2) and (4) (d) "Function points" is one of the most
(c) (1), (2), (3) and (4) commonly used size metric for requirements
(d) (1), (3) and (4) Ans : (c)
Ans : (c) A CRT is an electronic tube designed to 75. ............. tag is an extension to HTML that can
display electrical data. enclose any number of Javascript statements.
The basic CRT consist of four major components. (a) <SCRIPT>
(1) Electron gun (b) <BODY>
(2) Focusing & Accelerating A nodes (c) <HEAD>
(3) Horizontal & vertical deflection plates (d) <TITLE>
(4) Evacuated glass enclose Ans : (a) One approach for specifying functional
72. Which one of the following statements is requirement is through such methods as a system
incorrect? content diagram or a use-case model.
UGC NET JRF Computer Science Dec. 2015 Paper-III 183 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2016

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. How many different equivalence relations with What is the probability that the opposite side is
exactly three different equivalence classes are the same colour as the one side we observed?
there on a set with five elements? (a) 3/4 (b) 2/3
(a) 10 (b) 15 (c) 1/2 (d) 1/3
(c) 25 (d) 30 Ans : (b) There are three cards, such that the sides of
Ans : (c) The set of equivalence relations on a set are in cards are:
direct bijection with the set of partitions on a set. We {{Black, Black}, {Red, Red}, {Black, Red}}
know that the only partition types for a 5 element set are There are total 3 sample space as given above.
of the form (1 + 1 + 3) or (1 + 2 + 2) of the first type, Now favorable cases are:
pick the three in the triple, 5C3 = 10 in case of the {{Black, Black}, {Red, Red}} only 2 cases.
second type, first pick which is the singleton and then Therefore, required probability is 2/3.
pick which is paired with smallest remaining, i.e., 5 ×
3 5. A clique in a simple undirected graph is a
C1 = 15 of this for a total of 10 + 15 = 25.
complete subgraph that is not contained in any
2. The number of different spanning trees in larger complete subgraph. How many cliques
complete graph, K4 and bipartite graph, K2,2 are there in the graph shown below?
have _________ and _________ respectively.
(a) 14, 14 (b) 16, 14
(c) 16, 4 (d) 14, 4
Ans : (c) The number of spanning trees in complete
graph with n vertices.
= nn-2 = 44 - 2 = 16
A complete bipartite graph km.n has mn – 1 nm – 1 spanning
trees = 21 . 21 = 4. (a) 2 (b) 4
(c) 5 (d) 6
3. Suppose that R1 and R2 are reflexive relations
Ans : (c) Given graph is
on a set A.
Which of the following statements is correct?
(a) R1 ∩ R2 is reflexive and R1 ∪ R2 is
irreflexive.
(b) R1 ∩ R2 is irreflexive and R1 ∪ R2 is
reflexive.
(c) Both R1 ∩ R2 and R1 ∪ R2 are reflexive.
(d) Both R1 ∩ R2 and R1 ∪ R2 are irreflexive. Complete subgraph means “each vertex should be
Ans : (c) If R1 and R2 are reflexive relations on a set A. connected with all other vertices in the subgraph”. Such
R1 ∪ R2 is reflexive because. subgraph are:
∆ ⊆ R1 ⊆ R1 ∪ R2 (or ∆ ⊆ R2 ⊆ R1 ∪ R2 ) (i) {b, c, e, f} (ii) {a, d, g}
(iii) {a, b, g} (iv) {b, e, g}
R1 ∩ R2 is also reflexive, because
(v) {d, e, g}
∆ ⊆ R1 ∧ ∆ ⊆ R2 ⇒ ∆ ⊆ R1 ∩ R2
There are only 5 subgraphs.
4. There are three cards in a box. Both sides of 6. Which of the following logic expressions is
one card are black, both sides of one card are
incorrect
red, and the third card has one black side and
one red side. We pick a card at random and (a) 1 ⊕ 0 = 1 (b) 1 ⊕ 1 ⊕ 1 = 1
observe only one side. (c) 1 ⊕ 1 ⊕ 0 = 1 (d) 1 ⊕ 1 = 0
UGC NET JRF Computer Science June 2016 Paper-II 184 YCT
 Search on TG: @apna_pdf
Ans : (c) With EX-OR operation, odd number of 1’s 10. In a positive-edge-triggered JK flip-flop, if J
returns 1 and even number of 1’s return 0. and K both are high then the output will be
7. The IEEE-754 double-precision format to __________ on the rising edge of the clock.
represent floating point number, has a length (a) No change (b) Set
of ________ bits. (c) Reset (d) Toggle
(a) 16 (b) 32 Ans : (d) Racing is problem of toggling more than once
(c) 48 (d) 64 when the inputs are J = 1 and K = 1. The proper
combination of propagation delay and edge triggering
Ans : (d) Double precision floating point format is a
prevents the racing problem.
computer number format that occupies 8 bytes (64 bits)
in computer memory and represents a wide, dynamic 11. Given i = 0, j = 1, k = -1
range of values by using a floating point. x = 0.5, y = 0.0
• Sign bit (1 bit) What is the output of the following expression
in C language?
• Exponent (11 bit) x * y < i + j || k
• Significant precision (53 bits)/52 explicitly stored. (a) -1 (b) 0
8. Simplified Boolean equation for the following (c) 1 (d) 2
truth table is: Ans : (c) Given expressions are:
x y z F i = 0, j = 1, k = -1, x = 0.5, y = 0.0 and
= x * y < i + j || k
0 0 0 0
= (((x * y) < (i + j)) || k)
0 0 1 1
= (((0.5 * 00) < (0 + 1)) || -1)
0 1 0 0
= ((0 < 1) || -1)
0 1 1 1
=1
1 0 0 1
12. The following statement in ‘C’
1 0 1 0
1 1 0 1 int (*f( ))[ ]:
1 1 1 0 declares
(a) a function returning a pointer to an array of
(a) F = yz + yz (b) F = xy + xy
integers.
(c) F = xz + xz (d) F = xz + xz + xyz (b) a function returning an array of pointers to
Ans : (c) Function f will be: integers.
f = x ' y ' z + x ' yz + xy ' z ' + xyz ' (c) array of functions returning pointers to
integers.
= x ' z ( y ' + y ) + xz '( y ' + y ) (d) an illegal statement.
= x ' z + xz ' Ans : (a) int (* f ( )) [ ]
9. The simplified form of a Boolean A function f returning a pointer to an array of integers.
equation (AB + ABC + AC)(AC + B) is: 13. Which one of the following is correct, when a
class grants friend status to another class?
(a) AB (b) ABC
(a) The member functions of the class generating
(c) AB (d) ABC friendship can access the members of the
Ans : (a) Given Boolean expression is: friend class.
= ( AB ' + AB ' C + AC )( A ' C ' + B ') (b) All member functions of the class granted
friendship have unrestricted access to the
= ( AB '(1 + C ) + AC )( A ' C ' + B ')
members of the class granting the friendship.
= ( AB ' + AC )( A ' C ' + B ') (c) Class friendship is reciprocal to each other.
= AA ' B ' C ' + AB ' + AA ' CC ' + AB ' C (d) There is no such concept.
= AB ' + AB ' C Ans : (b) The function of a class which is given friend
status by another class can access all its private,
= AB '(1 + C ') protected and public members. Class friendship is not
= AB ' commutative nor transitive unless explicitly specified.

UGC NET JRF Computer Science June 2016 Paper-II 185 YCT
 Search on TG: @apna_pdf
14. When a method in a subclass has the same III. An update anomaly is when it is not
name and type signatures as a method in the possible to store information unless some other,
superclass, then the method in the subclass unrelated information is stored as well.
________ the method in the superclass. IV. SQL is a procedural language.
(a) Overloads (b) Friendships (a) I and IV only (b) III and IV only
(c) Inherits (d) Overrides (c) I, II and III only (d) II, III and IV only
Ans : (d) In a class hierarchy, when a method in a Ans : (b) (i) Views in a database system are important
because:
subclass has the name and type signature as a method in
its superclass, then the method in the subclass is said to • They help provide data independence.
override the method in the superclass. • They allow the schema to change without forcing
existing applications to be recompiled.
15. What is the value returned by the function f
• They help with access control by allowing users to see
given below when n = 100?
only a particular subset of the data in the database.
int f(int n) (ii) A conceptual ER model may be used as the
{ if (n = = 0) then return n; foundation for one or more logical data models.
else (iii) That’s not update anomaly but it is insertion
return n + f(n – 2); anomalies.
} (iv) SQL is not procedural language.
(a) 2550 (b) 2556 Only statements (iii) and (iv) are false.
(c) 5220 (d) 5520 18. In a relational database model, NULL values
Ans : (a) The given function is a recursive function can be used for all but which one of the
which takes starting value as 100. It keeps on adding the following?
present value and the value obtained by calling the (a) To allow duplicate tuples in the table by
function f(n – 2) where n is current value. It stops at n = filling the primary key column(s) with
0 where it returns 0. As a result, it forms a arithmetic NULL.
series, where a = 100 and d = 2 and l = 2. So sum of (b) To avoid confusion with actual legitimate
series is data values like 0 (zero) for integer columns
n(a1 + an ) 50(2 + 100) and” (the empty string) for string columns.
S100 = = = 2550 (c) To leave columns in a tuple marked as
2 2
“unknown” when the actual value in
16. In RDBMS, the constraint that no key attribute
unknown.
(column) may be NULL is referred to as: (d) To fill a column in a tuple when that column
(a) Referential integrity does not really “exist” for that particular
(b) Multi-valued dependency tuple.
(c) Entity Integrity Ans : (a) The SQL null is the term used to represent a
(d) Functional dependency missing value. A null value in a table is a value in a
Ans : (c) The entity integrity constraint states that field that appears to be blank. A field with a null value
primary keys cannot be null. There must be a proper is a field with no value.
value in the primary key field. 19. Consider the following two commands C1 and
The basis of referential integrity is foreign keys. A C2 on the relation R from an SQL database:
foreign key in one table references a primary key in C1: drop table R;
another table. C2: delete from R;
17. Which of the following statement(s) is/are Which of the following statements is TRUE?
FALSE in the context of Relational DBMS? I. Both C1 and C2 delete the schema for R.
I. Views in a database system are important II. C2 retains relation R, but deletes all tuples
because they help with access control by in R.
allowing users to see only a particular subset of III. C1 deletes not only all tuples of R, but also
the data in the database. the schema for R.
II. E-R diagrams are useful to logically model (a) I only (b) I and II only
concepts. (c) II and III only (d) I, II and III
UGC NET JRF Computer Science June 2016 Paper-II 186 YCT
 Search on TG: @apna_pdf
Ans : (c) Drop command remove all tuples of the 22. Consider the following operations performed
relation as well as schema also. on a stack of size 5:
Delete command in SQL removes tuples from the Push (a); Pop ( ); Push (b); Push (c); Pop ( );
relation but retain the schema of table in database. Push (d); Pop ( ); Pop ( ); Push (e)
20. Consider the following database table having Which of the following statements is correct?
A, B, C and D as its four attributes and four (a) Underflow occurs
possible candidate keys (I, II, III, IV) for this (b) Stack operations are performed smoothly
table: (c) Overflow occurs
(d) None of the above
A B C D Ans : (b)
a1 b1 c1 d1
a2 b2 c3 d2
a3 b3 c1 d3
I: {B} II: {B, C}
III: {A, D} IV: {C, D}
If different symbols stand for different values
in the table (e.g., d1 is definitely not equal to
d2), then which of the above could not be the Since, given stack size is 5, so, there is no overflow or
candidate key for the database table? underflow.
(a) I and III only (b) III and IV only 23. Suppose you are given a binary tree with n
(c) II only (d) I only
nodes, such that each node has exactly either
Ans : (c) Attribute B has distinct tuples. So, B is zero or two children. The maximum height of
candidate key and {BC} is superkey because a the tree will be
candidate key is minimal superkey. n n
Key {A, D} and {C, D} has distinct tuples, so, both are (a) −1 (b) +1
2 2
candidate key.
(n −1) (n + 1)
21. Consider the following binary search tree: (c) (d)
2 2
Ans : (c) In full binary tree, if T has a total of n nodes,
the number of internal nodes is I = (N – 1)/2 and height
will also be same, when it is skewed full binary tree.

If we remove the root node, which of the node

from the left subtree will be the new root?
(a) 11 (b) 12 s
(c) 13 (d) 16
24. Which of the following is not an inherent
Ans : (d) If we delete root node of a binary search tree,
application of stack?
then it can be replace by inorder successor or inorder
(a) Implementation of recursion
predecreasor of the node.
(b) Evaluation of a postfix expression
So, either 16 or 26 can be root of the tree.
(c) Job scheduling
(d) Reverse a string
Ans : (c) Application of stack(s) are:
(i) Implementation of recursion.
(ii) Evaluation of a postfix expression.
(iii) Reverse a string.
Job scheduling is commonly done via queue data
structure.

UGC NET JRF Computer Science June 2016 Paper-II 187 YCT
 Search on TG: @apna_pdf
25. In how many ways can the string Ans : (c) Each pair of users must have a secrete key. If
A∩B–A∩B–A N people in world want to use this method, there needs
Be fully parenthesized to yield an infix n(n − 1)
to be n C2 = secrete keys.
expression? 2
(a) 15 (b) 14 30. Optical fiber uses reflection to guide light
(c) 13 (d) 12
through a channel, in which angle of incidence
Ans : (b) Number of ways we can paranthesis n is ________ the critical angle.
operands is catalun number. (a) equal to (b) less than
2n
Cn (c) greater than (d) less than or equal to
=
n +1 Ans : (c) If the angle of incidence is equal to the
Given number of total operators (n = 4). critical angle, the light beam bends along the interface.
8
C4 When a beam of light travels through media of two
So, = = 14
5 different densities, if the angle of incidence is greater
Note: All operator works as nodes of binary search tree. than the critical angle, reflection occurs.
26. A multiplexer combines four 100-Kbps 31. The number of strings of length 4 that are
channels using a time slot of 2 bits. What is the generated by the regular expression (0 | ∈) 1
+
bit rate? 2* (3|∈
∈), where | is an alternation character,
(a) 100 Kbps (b) 200 Kbps {+, *} are quantification characters, and ∈ is
(c) 400 Kbps (d) 1000 Kbps the null string, is:
Ans : (c) bit rate = no. of channels × Input bit rate (a) 08 (b) 10
= 4 × 100 kbps = 400 kbps (c) 11 (d) 12
27. In a fully-connected mesh network with 10 Ans : (d) Given, regular expression is:
computers, total _______ number of cables are R = (0 | ∈) 1+ 2*(3 |∈)
required and _______ number of ports are Number of strings of length 4 are:
required for each device.
{1111, 1113, 1222, 1122, 1112, 1223, 1123, 0111,
(a) 40, 9 (b) 45, 10
0113, 0122, 0112, 0123}
(c) 45, 9 (d) 50, 10
Total number of string 12.
Ans : (c) Since, each in mesh network total number of
cables are required 32. The content of the accumulator after the
n 10
C2 = C2 = 45 execution of the following 8085 assembly
Each device needs to be connected to 9 other devices. language program, is:
So, each device needs to have 9 ports. MVI A, 42H
28. In TCP/IP Reference model, the job of _______ MVI B, 05H
layer is to permit hosts to inject packets into UGC: ADD B
any network and travel them independently to DCR B
the destination.
JNZ UGC
(a) Physical (b) Transport
ADI 25H
(c) Application (d) Host-to-network
HLT
Ans : (*) The job of Internet layer is to permit hosts to
inject packets into any network and have them travel (a) 82 H (b) 78 H
independently to the destination (potentially on a (c) 76 H (d) 47 H
different network). Ans : (c) A is taking accumulator
All option is true, as given by official keys. A = 4 × 16 + 2 = 66 in decimal
29. If there are N people in the world and are using B = 5 in decimal
secret key encryption/decryption for privacy
Loops runs from B = 5 to 1 therefore,
purpose, then number of secret keys required
will be: = 66 + 5 + 4 + 3 + 2 + 1 = 81
(a) N (b) (N – 1) Then, 81 + 25 H
N ( N −1) N ( N + 1) = 81 + 37 (35 H in decimal) = 118
(c) (d) ⇒ (118)10 = 76 H
2 2
UGC NET JRF Computer Science June 2016 Paper-II 188 YCT
 Search on TG: @apna_pdf
33. In _______, the bodies of the two loops are 36. Consider the reference string:
merged together to form a single loop provided 012301401234
that they do not make any references to each If FIFO page replacement algorithm is used,
other. then the number of page faults with three page
(a) Loop unrolling frames and four page frames are _______ and
(b) Strength reduction _______ respectively.
(c) Loop concatenation (a) 10, 9
(d) Loop jamming (b) 9, 9
(c) 10, 10
Ans : (d) (i) Loop fusion (Jamming) is a compiler
(d) 9, 10
optimization and loop transformation which replaces
multiple loops with a single one. It is possible when two Ans : (d) Given reference string is 0, 1, 2, 3, 0, 1, 4, 0,
loops iterate over the same range and do not reference 1, 2, 3, 4.
each other’s data. (i) FIFO (first in first out) algorithm with 3 page frames.
(ii) Loop unrolling (loop unwiding) is a loop 0 1 2 3 0 1 4 0 1 2 3 4
transformation technique that attempts to optimize a 0 0 0 3 3 3 4 4 4
program is execution speed at the expense of its binary 1 1 1 0 0 0 2 2
size, which is an approach known as the space time 2 2 2 1 1 1 3
tradeoff.
M M M M M M M M M M
34. Which of the following is not typically a benefit
of dynamic linking? Total number of page faults = 9
I. Reduction in overall program execution time. (ii) FIFO with 4 page frames.
II. Reduction in overall space consumption in 0 1 2 3 0 1 4 0 1 2 3 4
memory. 0 0 0 0 4 4 4 4 3 3
III. Reduction in overall space consumption on 1 1 1 1 0 0 0 0 4
disk.
2 2 2 2 1 1 1 1
IV. Reduction in the cost of software updates.
3 3 3 3 2 2 2
(a) I and II (b) I only
(c) II and III (d) IV only M M M M M M M M M M
Total number of page faults = 10.
Ans : (b) (i) A dynamic linker is the part of an
operating system that loads and links the shared 37. Suppose there are four processes in execution
libraries needed by an executable when it is executed (at with 12 instances of a Resource R in a system.
“run time”), by copying the context of libraries from The maximum need of each process and
present storage to RAM, and filling jump tables and current allocation are given below:
relocating pointers.
(ii) Static linker has reduction in overall program Process Max. Need Current
execution time than dynamic linker. Allocation
35. Which of the following is FALSE? P1 8 3
(a) The grammar S → aSb | bSa | SS | ∈, where S P2 9 4
is the only non-terminal symbol and ∈ is the P3 5 2
null string, is ambiguous. P4 3 1
(b) SLR is powerful than LALR.
With reference to current allocation, is system
(c) An LL(1) parser is a top-down parser.
safe? If so, what is the safe sequence?
(d) YACC tool is an LALR(1) parser generator.
(a) No
Ans : (b)
(b) Yes, P1 P2 P3 P4
(a) True, since string ∈ has infinite many parse tree.
(c) Yes, P4 P3 P1 P2
(b) False, since LALR(1) grammars are more powerful
(d)Yes, P2 P1 P3 P4
than also true.
(c) LL(1) parser is a top-down parser. Ans : (c) Remaining need = Max need – Current
(d) YACC tool is an LALR(1) parser generator. allocation.

UGC NET JRF Computer Science June 2016 Paper-II 189 YCT
 Search on TG: @apna_pdf
Process Max need Current Remaining zero, then the scheduler implements _______
allocation need criteria.
P1 8 3 5 (a) Priority scheduling
P2 9 4 5 (b) Round Robin Scheduling
P3 5 2 3 (c) Shortest Job First
(d) FCFS
P4 3 1 2
Ans : (b) The scheduling algorithm works as round
10
robin algorithm with quantum time equals to T.
Available resources = 12 – 10 = 2
After a process’s turn comes and it has executed for T
Then, we can satisfy needs of P4, then release total 4, units, its waiting time becomes least and its turn comes
then satisfy P3, then release total 7, then satisfy P1, and
again after every other process has got the chance for T
P2 similarly.
units.
Hence, it the safe sequence: P4, P3, P1, P2.
41. If S1 is total number of modules defined in the
38. If the Disk head is located initially at track 32,
program architecture, S3 is the number of
find the number of disk moves required with
modules whose correct function depends on
FCFS scheduling criteria if the disk queue of
I/O blocks requests are: prior processing then the number of modules
98, 37, 14, 124, 65, 67 not dependent on prior processing is:
(a) 320 (b) 322 S3 S3
(a) 1 + (b) 1−
(c) 321 (d) 319 S1 S1
Ans : (c) Given I/O requests are: S1 S1
(c) 1 + (d) 1−
98, 37, 14, 124, 65, 67 S3 S3
Using FCFS (first come first serve) scheduling:
Ans : (b) Modules not dependent on prior processing
D3 = 1 – (S3/S1)
42. The ________ model is preferred for software
development when the requirements are not
Then total disk moves: clear.
= (98 – 32)+(98 – 37)+(37 + 14)+(124 – 14)+(124 - (a) Rapid Application Development
65)+(67 – 65) = 321 (b) Rational Unified Process
39. In UNIX, ______ creates three subdirectories: (c) Evolutionary Model
‘PIS’ and two subdirectories ‘progs’ and ‘data’ (d) Waterfall Model
from just created subdirectory ‘PIS’. Ans : (c) Evolutionary development is an iterative and
(a) mkdir PIS/progs PIS/data PIS incremental approach to software development. It is
(b) mkdir PIS progs data preferred for software development when requirements
(c) mkdir PIS PIS/progs PIS/data are not clear.
(d) mkdir PIS/progs data 43. Which of the following is not included in
Ans : (c) mkdir PIS/progs PIS/data. waterfall model?
This creates three subdirectories PIS and two (a) Requirement analysis
subdirectories under PIS. The order of specifying the (b) Risk analysis
arguments is important; you obviously cannot create a
(c) Design
subdirectory before creation of its parent directory.
(d) Coding
40. A scheduling Algorithm assigns priority
Ans : (b) The waterfall model is a sequential (non-
proportional to the waiting time of a process.
iterative) process, it includes requirements, design,
Every process starts with priority zero (lowest
implementation, verification and maintenance.
priority). The scheduler reevaluates the process
priority for every ‘T’ time units and decides Risk analysis used in spiral model.
next process to be scheduled. If the process 44. The cyclomatic complexity of a flow graph
have no I/O operations and all arrive at time V(G), in terms of predicate node is:
UGC NET JRF Computer Science June 2016 Paper-II 190 YCT
 Search on TG: @apna_pdf
(a) P + 1 (b) P – 1 Ans: (b) (i) Business intelligence and Data warehousing
(c) P – 2 (d) P + 2 is used for forecasting and Data mining.
Where P is number of predicate nodes in flow (ii) Business intelligence and Data warehousing is used
graph V(G). for analysis of large volumes of sales data.
Ans : (a) The cyclomatic complexity of a flow graph Both statements are true.
V(G) = P + 1, where P is number of predicate nodes.
48. Pipelining improves performance by:
45. The extent to which a software tolerates the
(a) decreasing instruction latency
unexpected problems, is termed as: (b) eliminating data hazards
(a) Accuracy (b) Reliability (c) exploiting instruction level parallelism
(c) Correctness (d) Robustness (d) decreasing the cache miss rate
Ans : (d) Robustness is the ability of a computer Ans : (c) Instruction pipelining is a technique that
system to cope with errors during execution and cope implements a form of parallelism called instruction
with errorneous input. level parallelism with a single processor. It therefore
Correctness of an algorithm is asserted when it is said allows faster CPU throughput that would otherwise be
that the algorithm is correct with respect to a possible at a given clock rate.
specification. 49. Consider the following two statements:
46. An attacker sits between customer and Banker, S1: Data scrubling is a process to upgrade the
and captures the information from the quality of data, before it is moved into Data
customer and retransmits to the banker by warehouse.
altering the information. This attack is called S2: Data scrubling is a process of rejecting data
from data warehouse to create indexes.
as _______.
Which one of the following options is correct?
(a) Masquerade Attack
(a) S1 is true, S2 is false.
(b) Replay Attack
(b) S1 is false, S2 is true.
(c) Passive Attack
(c) Both S1 and S2 are false.
(d) Denial of Service Attack
(d) Both S1 and S2 are true.
Ans : (b) (i) A replay attack (play back attack) is a Ans : (a) Data scrubling, also called data cleaning, is
form of network attack in which a valid data the process of or removing data in a database that is
transmission is maliciously or fraudulently repeated or incorrect, incomplete, improperly formatted, or
delayed. duplicated.
(ii) A masquerade attack is an attack that uses a fake So, statement (i) is true and (ii) is false.
identity. 50. Given the following statements:
(iii) A passive attack is network attack in which a
S1: Strategic value of data mining is time
system is monitored and sometimes scanned for open stamping.
ports and vulnerabilities. S2: Information collection is an expensive
(iv) Denial of service attack, a type of attack on a process in building an expert system.
network that is designed to bring the network to its Which of the following options is correct?
knees by floading it with useless traffic. (a) Both S1 and S2 are false.
47. Consider the following two statements: (b) Both S1 and S2 are true.
(i) Business intelligence and Data warehousing (c) S1 is true, S2 is false.
is used for forecasting and Data mining. (d) S1 is false, S2 is true.
(ii) Business intelligence and Data warehousing Ans : (b)
is used for analysis of large volumes of sales • Strategic value of data mining is time stamping →
data. correct
Which one of the following options is correct? • Information collection is an expensive process in
(a) (i) is true, (ii) is false. building an expert system → correct
(b) Both (i) and (ii) are true. • An expert system is a computer system that
(c) (i) is false, (ii) is true. emulates the decision making ability of a human
(d) Both (i) and (ii) are false. expert.

UGC NET JRF Computer Science June 2016 Paper-II 191 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2016

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. Which of the following is a sequential circuit? an offset is added to the contents of the
(a) Multiplexer (b) Decoder register. The offset and register are specified in
(c) Counter (d) Full adder the instruction.
Ans : (c) First 3 are combinational circuit (where output (a) Base indexed
depends on present time) (b) Base indexed plus displacement
Choice C is (counter) sequential circuit (sequential logic (c) Indexed
is a type of logic circuit whose output depends not only (d) Displacement
on the present value of its input but on the sequence of Ans : (d) The displacement addressing mode is similar
post inputs) and hence the answer is option (c). to register indirect addressing mode, except that an
2. 8085 microprocessor has ............ hardware offset is added to the contents of the register. The offset
interrupts and register are specified in the instruction.
(a) 2 (b) 3 Based Indexed Addressing: The operand’s offset is sum
(c) 4 (d) 5 of the content of a base register BX or BP and an index
Ans : (d) For interrupt purpose these are register SI or DI.
Based Indexed plus displacement addressing mode: In
this mode of addressing the operand’s offset is given by
offset=[BX or BP]+[SI or DI]+8 bit or 16 bit
displacement. Indexed addressing mode: The operand’s
offset is the sum of the content of an index register SI or
DI and an 8 bit or 16 bit displacement.
TRAP So, option (D) is correct.
RST 7.5 6. In ........... method, the word is written to the
RST 6.5 block in both the cache and main memory, in
RST 5.5 parallel.
InTR (a) Write through (b) Write back
INTA (It is not can interrupt pin but it is used to send (c) Write protected (d) Direct mapping
acknowledgement of the interrupt request getting from
other interrupt pin). Ans : (a) In write through method, data is written into
So answer is option (d). the cache and the corresponding main memory location
at the same time.
3. Which of the following in 8085 microprocessor
7. Which of the following statements concerning
performs
HL = HL + DE ? Object-Oriented databases is FALSE?
(a) DAD D (b) DAD H (a) Objects in an object-oriented database
(c) DAD B (d) DAD SP contain not only data but also methods for
Ans : (a) DAD instruction (double add) allows 16 bit processing the data.
addition between the HL register pair any, any one of (b) Object-oriented databases store
the BC, DE, HL, SP register pairs computational instructions in the same place
DAD D performs HL = HL + DE as the data.
4. The register that stores all interrupts requests (c) Object-oriented databases are more adapt at
handling structured (analytical) data than
is :
relational databases.
(a) Interrupt mask register
(d) Object-oriented databases store more types of
(b) Interrupt service register
data than relational databases and access that
(c) Interrupt request register
(d) Status register data faster.
Ans : (c) Interrupt request register (IRR) Indicates Ans : (c) Objects in an object-oriented database contain
which interrupt request lines are active. not only data but also methods for processing the data.
Correct.
5. The .......... addressing mode is similar to
Object-oriented databases store computational
register indirect addressing mode, except that instructions in the same place as the data. Correct.
UGC NET JRF Computer Science June 2016 Paper-III 192 YCT
 Search on TG: @apna_pdf
Object-oriented databases are more adapt at handling 11. Consider the following ORACLE relations :
structured (analytical) data than relational databases. R (A, B, C) = {<1, 2, 3>, <1, 2, 0>, <1, 3, 1>, <6,
Incorrect 2, 3>, <1, 4, 2>, <3, 1, 4>}
Object-oriented databases store more types of data than S (B, C, D) + {<2, 3, 7>, <1, 4, 5>, <1, 2, 3>,<2,
relational databases and access that data faster. Correct 3,4>, <3, 1, 4>}
So, option (C) is correct. Consider the following two SQL queries SQ1
8. In distributed database, location transparency and SQ2 :
allows for database users, programmers and SQ1 : SELECT R. B, AVG (S. B)
administrators to treat the data as if it is at one FROM R, S
location. A SQL query with location WHERE R.A = S.C AND S.D < 7
transparency needs to specify : GROUP BY R.B;
(a) Inheritances (b) Fragments SQ2 : SELECT DISTINCT S.B, MIN (S.C)
(c) Locations (d) Local formats FROM S
GROUP BY S.B
Ans : (b) Fragmentation transparency is the highest
HAVING COUNT (DISTINCT
level of transparency. The end user or programmer does
not need to know that a database is partitioned. S.D)>1;
Therefore, neither prior to data access. If M is the number of tuples returned by SQ1
and N is the number of tuples returned by SQ2
9. Consider the relations R(A, B) and S(B, C) and then
the following four relational algebra queries (a) M = 4, N = 2 (b) M = 5, N = 3
over R and S : (c) M = 2, N = 2 (d) M = 3, N = 3
I. ⊓A. B (R ⋈ S) Ans : (a)
II. ⋈⊓ B(S)
R⋈⊓ Distinct S.B Count(distinct S.d)
1 2
III. R ⋂(A(R) ×⊓ ⊓B(S)) 2 2
IV. ⊓A.R.B (R × S) where R.B refers to the 3 1
column B in table R. but the third tuple is not taken because count (distinct
One can determine that : SD) >1
(a) I, III and IV are the same query 12. Semi-join strategies are techniques for query
(b) II, III and IV are the same query
processing in distributed database system.
(c) I, II and IV are the same query
Which of the following is a semi-join
(d) I, II and III are the same query
technique?
Ans : (d) Let us take an example as R = {(10, 2) (20, (a) Only the joining attributes are sent from one
2)} site to another and then all of the rows are
S = {(2, 30); (3, 40)} returned
(I) R ⋈ S = {(20, 2, 30)} so πA, B R ⋈ S = {(20, 2)} (b) All of the attributes are sent from one site to
(II) πB(S) = {(2), (3)}, so R ⋈ π B (S) = {(20)2)} another and then only the required rows are
(III) πA (R) × πB(S) = {10, 20} × {2, 3} ={(10, 2), (10, returned
(c) Only the joining attributes are sent from site
3), (20, 2), (20, 3)} R⋂πA(R) × πB(S) = {(20, 2)} to another and then only the required rows
(IV) R × S = {(10, 1, 2, 30), (10, 1, 3, 40), (20, 2, 2, 30), are returned
(20, 2, 3, 40)} πA, R, B R × S = {(10, 2), (10, 3), (20, (d) All of the attributes are sent from one site to
2), (20, 3)} another and then only the required rows are
10. Which of the following statements is TRUE? returned.
D1 : The decomposition of the schema R(A, B, Ans : (c) Semi-join strategies are techniques for query
C) into R1(A, B) and R2 (A, C) is always processing in distributed database system. In which only
lossless. the joining attributes are sent from one site to another
D2 : The decomposition of the schema R(A, B, and then only the required rows are returned. So, option
C, D, E) having AD →B, C →DE, B → (C) is correct.
AE and AE →C, into R1 (A, B, D) and R2 13. Consider the Breshenham's circle generation
(A, C, D, E) is lossless. algorithm for plotting a circle with centre (0, 0)
(a) Both D1 and D2 (b) Neither D1 nor D2 and radius 'r' units in first quadrant. If the
(c) Only D1 (d) Only D2 current point is (xi, yi) and decision parameter
Ans : (d) Only D2 Since AD is key and it present in is pi then what will be the next point (xi + 1, yi +1)
both the tables not D1 and updated decision parameter pi + 1 for pi ≥ 0?
Since fd's not given (a) xi +1 = xi + 1
If we take B →A & C → A then it is lossy since no yi + 1 = yi
common attribute contain key from one of the table. pi + 1 = pi + 4xi + 6
UGC NET JRF Computer Science June 2016 Paper-III 193 YCT
 Search on TG: @apna_pdf
(b) xi + 1 = xi + 1 (a) AB (b) CD
yi + 1 = yi + 1 (c) EF (d) AB and CD
pi + 1 = pi + 4 (xi – yi) + 10 Ans : (d)
(c) xi + 1 = xi
yi + 1 = yi –1
pi + 1 = pi + 4 (xi – yi) + 6
(d) xi + 1 = xi – 1
yi + 1 = yi
pi + 1 = pi + 4xi + 10
Ans : (a) Bresenham’s Algorithm– We cannot
display a continuous arc on the raster display. Instead,
we have to choose the nearest pixel position to complete
the arc.
From the following illustration, you can see that we Clearly only AB & CD are candidate for line clipping.
have put the pixel at (X, Y) location and now need to 16. In perspective projection, if a line segment
decide where to put the next pixel − at N (X+1, Y) or at joining a point which line in front of the viewer
S (X+1, Y-1). to a point in back of the viewer is projected to a
This can be decided by the decision parameter d. broken line of infinite extent. This is known as
• If d <= 0, then N(X+1, Y) is to be chosen as next .............
pixel. (a) View confusion
• If d > 0, then S(X+1, Y-1) is to be chosen as the (b) Vanishing point
next pixel. (c) Topological distortion
14. A point P(5, 1) is rotated by 90o about a pivot (d) Perspective foreshortening
point (2, 2). What is the coordinate of new Ans : (c) Topological distortion : Consider the plane
transformed point P'? that passes through the center of projection & parallel to
(a) (3, 5) (b) (5, 3) view plane. The point of this plane are projected to
(c) (2, 4) (d) (1, 5) infinity the perspective transformation.
Ans : (a) Transformation matrix for rotation to about a 17. Let us consider that the original point is (x, y)
pivot point (2, 2) is given by and new transformed point is (x', y') Further,
Ro, P = T –v Ro Tv where v = hitkJ Shx and Shy are shearing factors in x and y
 1 0 0  cos 0 sin 0 0  1 0 0  directions. If we perform the y-direction shear
    relative to x = xref then the transformed point
=  0 1 0  − sin 0 cos 0 0  0 1 0 
 −h −k 1  0  h k 1  is given by ........... .
  0 1   (a) x' = x + Shx . (y – yref)
 0 1 0  1 0 0   0 1 0 y' = y
1 0 0       (b) x' = x
=   −1 0 0  0 1 0  =  −1 0 0 
 0 1 1   0 0 1  2 2 1   N 0 1  y' = y . Shx
     (c) x' = x
Now P (S, 1) is rotated to P' y' = Shy (x – xref) + y
 0 1 0 (d) x' = Shy . y
 
P' = [511]  −1 0 0  = [3,5,1] y' = y . (x – xref)
 4 0 1 Ans : (c) Ans is (C) if we perform x direction shear
  with reference to y axis, then x′= x + Shx.(y−yref); y′=y
So P' (x', y') = 3, 5 hence answer is DP (1) if we perform y direction shear with reference to x axis,
15. Let R be the rectangular window which the then
lines are to be clipped using 2D Sutherland- x′ = x; y′ = Shy(x−xref) + y
Cohen line clipping algorithm. The rectangular 18. Which of the following statement (s) is/are
window has lower left-hand corner at (–5, 1) correct with reference to curve generation?
and upper right-hand corner at (3, 7). Consider I. Hermite curves are generated using the
the following three lines for clipping with the concepts of interpolation.
given end point co-ordinates : II. Bezier curves are generated using the
Line AB : A (–6, 2) and B (–1, 8) concepts of approximation.
Line CD : C (–1, 5) and D (4, 8) III. The Bazier curve lies entirely within the
Line EF : E (–2, 3) and F (1, 2) convex hull of its control points.
Which of the following lines (s) is/are candidate IV. The degree of Bezier curve does not
for clipping? depend on the number of control points.
UGC NET JRF Computer Science June 2016 Paper-III 194 YCT
 Search on TG: @apna_pdf
(a) I, II and IV only (b) II and III only 21. Which of the following if false regarding the
(c) I and II only (d) I, II and III only evaluation of computer programming
Ans : (d) Hermits curves are very easy to calculate but language?
also very powerful. They are used to smoothly (a) Application oriented features
interpolate between key points. (b) Efficiency and Readability
Bezier curve section can be fitted to any number of (c) Software development
control points. The number of control points. The (d) Hardware maintenance cost
number of control points to be approximated & their
relative position determine the degree of the Bezier Ans : (d) Programming language evaluation is no way
polynomial. related with cost of H/w, so answer is option (d).
So answer is option (d). 22. The symmetric difference of two sets S1 and S2
19. Given the following statements : is defined as
(1) To implement Abstract data type, a S1 Θ S2 = {xx ∈ S1 or x ∈ S2, but x is not both
programming language require a syntactic S1 and S2}
unit to encapsulate type definition. The nor of two language is defined as
(2) To implement ADT, a programming nor (L1, L2) = {ww∈∈L1 and w ∉L2}
language requires some primitive operations Which of the following is correct?
that are built in the language processor. (a) The family of regular language is closed
(3) C++, Ada, Java 5.0, C#2005 provide support under symmetric difference but not closed
for parameterized ADT under nor.
Which one of the following options is correct? (b) The family of regular languages is closed
(a) (1), (2) and (3) are false under nor but not closed under symmetric
(b) (1) and (2) are true; (3) is false difference.
(c) (1) is true; (2) and (3) are false
(c) The family of regular languages are closed
(d) (1), (2) and (3) are true
under both symmetric difference and nor.
Ans : (d) Language requirements for ADT'S
(d) The family of regular language are not under
A syntactic unit in which to encapsulate the type
both symmetric difference and nor.
definition
Ada provides package that simulate ADTs Ans : (c) S1 ⊕ S2 = 'S2 + S1S2'
C++ data abstraction is provided by classes Regular language are closed union, intersection and
Java's data abstraction is similar to C++ hence they are closed under set difference.
so A, B, C are true nor (L1 + L2) = L1 . L2 (from demorgan law)
Hence answer is (d) here represent intersection.
20. Match the following types of variables with the Regular language are closed under complementation &
corresponding programming language : intersection and hence they are closed under nor.
A. Static variables i. Local variables 23. The regular expression for the complement of
in Pascal the language L = {anbmn ≥ 4, m ≤ 3} is :
B. Stack dynamic ii. All variables in (a) (λ + a + aa + aaa) b* + a* bbbb* + (a + b)*
APL ba (a + b)*
C. Explicit heap iii. Fortran 77 (b) (λ + a + aa + aaa) b* + a* bbbbb* + (a + b)*
dynamic ab (a + b)*
D. implicit heap iv. All objects in
(c) (λ + a + aa + aaa) + a* bbbbb* + (a + b)*
dynamic JAVA
ab(a + b)*
Code :
A B C D (d) (λ + a + aa + aaa)b* + a* bbbbb* + (a + b)*
(a) (i) (iii) (iv) (ii) ba(a + b)*
(b) (iv) (i) (iii) (ii) Ans : (d)
(c) (iii) (i) (iv) (ii) (1) Using the term a*bbbb* it can accept a4b3 hence it
(d) (ii) (i) (iii) (iv) is not complement
Ans : (c) FORTRAN I, II & IV contain only static (2) Using (a + b) * ab (a + b)* it can accept + a4b3
variables. All objects in Java are explicit heap dynamic hence it is not complement
variable & are destroyed by "Garbage Collector" (3) Using (a + b)* ab (a + b)* it can accept a4b3 hence
Languages Such as APL, ALGOL 68, & LISP Use it is not complement
implicit heap dynamic variables. (4) (a+b)*ba (a + b)* cannot produce strings anbm
So, a – 111, C – iv, d –11 format & other two terms cannot produce any
Hence correct option is (c) strings anbm such that n > = 4 & m < = 3

UGC NET JRF Computer Science June 2016 Paper-III 195 YCT
 Search on TG: @apna_pdf
24. Consider the following two languages : Ans : (b) Throughput for pure ALOHA is s = G × e–2,
L1 = {0i1jgcd (i, j) = 1} where G is the load factor and take e = 2.71
L2 is any subset os 0* The throughput is maximum, when G = 1/2 which is
Which of the following is correct? Smax = 0.184 Transmission time of rate = 200 bits/200
kbps = 1 ms
(a) L1 is regular and L2* is not regular
Now, system as taken all together produce 500 frames
(b) L1 is not regular and L2* is regular
per seci ; e
(c) Both L1 and L2* are regular languages Now, as load factor G = 1/2, then throughput is
(d) Both L1 and L2* are not regular languages maximum for pure aloha
Ans : (b) If L is regular then of course L* is also So answer is (b)
regular. If L is infinite, then it is regular and again L* is 28. Match the following :
regular for L = { 0p p is prime}, L is not regular, L ≤ A. Line coding i. A technique to
{0} * & L * is regular change analog
25. If link transmits 4000 frames per second and signal to digital
each slot has 8 bits, the transmission rate of data
circuit of this TDM is ........... B. Block coding ii. Provides
(a) 64 Kbps (b) 32 MbpS synchronization
(c) 32 Kbps (d) 64 MbpS without increasing
number of bits
Ans : (c) Transmission rate = frame rate * no of bits in
C. Scrambling iii. Process of
a slot. Frame rate = 4000 frames per second # of bits in
converting digital
a slot = 8 bit TDM = 4000 * 8 bps = 32 Kbps. So, data to digital
option (C) is correct. signal
26. Given the following statements : D. Pulse code iv. Provides
(1) Frequency division multiplexing is a modulation redundancy to
technique that can be applied when the ensure
bandwidth of a link is greater than combined synchronization
bandwidth of signals to be transmitted. and inherits error
(2) Wavelength division multiplexing (WDM) is detection
an analog multiplexing technique to combine Code :
optical signals. A B C D
(a) (iv) (iii) (ii) (i)
(3) WDM is a digital multiplexing technique.
(b) (iii) (iv) (ii) (i)
(4) TDM is digital multiplexing technique.
(c) (i) (iii) (ii) (iv)
Which of the following is correct? (d) (ii) (i) (iv) (iii)
(a) (1), (2), (3) and (4) are true
Ans : (b)
(b) (1), (2), (3) and (4) are false (a) Line coding is a process for converting digital data
(c) (1), (2) and (4) are false (3) is true into digital signal (III)
(d) (1), (2) and (4) are true (3) is false (b) Block coding is the way the original number of bits
Ans : (d) Multiplexing can be of three types is increased
(1) Frequency division multiplexing (FDM) : analog (c) Scrambling is a technique that substitutes long zero
signal level poises with a combination of other levels
(2) wave division multiplexing (WDM) : analog signal without increasing the number of bits (II)
(used in optical fiber) (d) Pulse code modulation (PCM) is a technique to
(3) Time division multiplexing (TDM) : digital signals : change analog signal to digital data (I)
: In TDM, a single frame is made with interleaved 29. Assume that we need to download text
digital signals from n devices. In TDM, the documents at the rate of 100 pages per minute.
transmission rate of the multiplexed path is greater A page is an average of 24 lines with 80
than the sum of transmission rates of all sources. characters in each line and each character
27. A pure ALOHA network transmits 200 bit requires 8 bits. Then the required bit rate of
the channel is ...........
frames using a shared channel with 200 Kbps
(a) 192 mbps (b) 512 mbps
bandwidth. If the system (all stations put
(c) 1.248 mbps (d) 1.536 mbps
together) produces 500 frames per second, then
the throughput of the system is ........... Ans : (d) downloading rate = 100 page
(a) 0.384 (b) 0.184 ⇒ 100 × 24 × 80 × 8 = 1536000 bit rate per second
(c) 0.286 (d) 0.586 ⇒ 1.536 mbps
UGC NET JRF Computer Science June 2016 Paper-III 196 YCT
 Search on TG: @apna_pdf
30. Encrypt the plain text message "EXTRANET" Code :
using transposition cipher technique with the A B C D
following key : (a) (i) (ii) (iv) (iii)
3 5 2 1 4 (Cipher text) (b) (i) (iv) (ii) (iii)
1 2 3 4 5 (Plan text) (c) (iii) (ii) (iv) (i)
Using 'Z' as bogus character. (d) (iii) (iv) (ii) (i)
(a) TEXERTZENZ (b) EXTRANETZZ Ans : (c)
(c) EZXZTRZANZET (d) EXTZRANZETZ 35. Suppose that we have numbers between 1 and
Ans : (a )Plain text 1,000 in a binary search tree and want to
1 2 3 4 5 1 2 3 4 5 search for the number 364. Which of the
E X T R A N E T Z Z following sequences could not be the sequence
Cipher text of nodes examined?
3 5 2 1 4 3 5 2 1 4 (a) 925, 221, 912, 245, 899, 259, 363, 364
T E X E R T Z E N Z (b) 3, 400, 388, 220, 267, 383, 382, 279, 364
31. The number of different binary trees with 6 (c) 926, 203, 912, 241, 913, 246, 364
(d) 3, 253, 402, 399, 331, 345, 398, 364
nodes is ..........
(a) 6 (b) 42 Ans : (c) g13 can not be searched after 912, after 912
(c) 132 (d) 256 any number must be less than 912 since 912 > 364 So
we will move towards 912 to 1, so ans. is (c)
Ans : (c) (2n)!/(n + 1)!n! different binary trees are
possible with n given n = 6 36. A triangulation of a polygon is a set of T chords
number of trees = 12!/(7 : × 6 :) = 132 that divide the polygon into disjoint triangles.
32. Let A[1 ......n] be an array of n distinct number. Every triangulation of n-vertex convex polygon
has ............. chords and divides the polygon
if i < j and A[i] > A[j], then the pair (i, j) is
into ...... triangles.
called an inversion of A. What is the expected (a) n – 2, n – 1 (b) n – 3, n – 2
number of inversions in any permutation on n (c) n – 1, n (d) n – 2, n – 2
elements?
Ans : (b) A triangulation of a polygon is a set of T
(a) θ(n) (b) θ(lgn)
chords that divide the polygon into disjoint triangles.
(c) θ(nlgn) (d) θ(n2) Every triangulation of n-vertex convex polygon has n –
Ans : (d) Answer is option (d) Expected number of 3chords and divides the polygon into n – 2triangles.
inversion = n(n –s)/2 for randomly ⇒ n (n – 1)/4 37. Implicit return type of a class constructor is :
33. Which one of the following array represents s (a) not of class type itself
binary max-heap? (b) class type itself
(a) [26, 13, 17, 14, 11, 9, 15] (c) a destructor of class type
(b) [26, 15, 14, 17, 11, 9, 13] (d) a destructor not of class type
(c) [26, 15, 17, 14, 11, 9, 13] Ans : (b) The implicit return type of a class constructor
(d) [26, 15, 13, 14, 11, 9, 17] is the class type i-self. It is the constructors job to
Ans : (c) Rest option did not satisfy max heap property, initials the internal state of an object so that the code
so ans. is (c) creating an instance will have a fully initialized, usable
object immediately.
38. It is possible to define a class within a class
termed as nested class. There are ........... types
of nested classes.
(a) 2 (b) 3
(c) 4 (d) 5
34. Match the following :
Ans : (c) There are four kinds of nested class in Java.
A. Huffman i. O(n2) Static class : declared as a static member of another
codes class
B. Optimal ii. θ(n3) Inner class : declared as a instance member of
polygon another class
triangulation Local interclass : declared inside an instance
C. Activity iii. O(nlgn) method of another class.
selection anonymous inner class : Like a local inner class, but
problem written as an expression which returns a one off
D. Quicksort iv. θ(n) object.

UGC NET JRF Computer Science June 2016 Paper-III 197 YCT
 Search on TG: @apna_pdf
39. Which of the following statements is correct?
(a) Aggregation is a strong type of association
between two classes with full ownership.
(b) Aggregation is a strong type of association
between two classes with partial ownership.
(c) Aggregation is a weak type of association
between two classes with partial. 43. A server crashes on the average once in 30
(d) Aggregation is a weak type of association days, that is the Mean Time Between Failures
between two classes with full ownership. (MTBF) is 30 days. When this happens, it takes
Ans : (c) Aggregation is a weak type of association with 12 hours to reboot it, that is, the Mean Time to
partial ownership. Repair (MTTR) is 12 hours. The availability of
40. Which of the following statements is correct? server with these reliability data values is
(a) Every class containing abstract method must approximately :
not be declared abstract. (a) 96.3% (b) 97.3%
(b) Abstract class cannot be directly initiated (c) 98.3% (d) 99.3%
with 'new' operator. Ans : (c) If we let A represent availability, then the
(c) Abstract class cannot be initiated. simplest formula for availability
(d) Abstract class contains definition of A = uptime/(uptime + downtime)
implementation. MTBF is mean time between failures
Ans : (c) Abstract classes are classes that contain one or A = MTTR is mean time to repair
more abstract method. A = MTBF/(MTBF + MTTR)
Abstract method is method that is declared, but So MTBF = 30 days = 30 × 24 = 720 hr
contains no implementation A = 720/(720 + 12)
Abstract classes may not be instantiated & require = 98.3%
subclass to provide implementation for the 44. Match the software maintenance activities in
so answer is op. (c) List-I to its meaning in List-II
41. Which of the following statements is not List-I List-II
correct? i. Corrective A. Concerned with
(a) HTML is not screen precise formatting performing activities
language to reduce the
(b) HTML does not specify a logic software complexity
(c) DHTML is used for developing highly thereby improving
interactive web pages program
(d) HTML is a programming language understandability
Ans : (d) HTML is not programming language and increasing
programming language means where writing logic is software
possible which is not supported by HTML. maintainability
42. When one object reference variable is assigned ii. Adaptive B. Concerned with
fixing errors that are
to another object reference variable then
observed when the
(a) a copy of the object is created
software is in use.
(b) a copy of the reference is created
(c) a copy of the reference is not created iii. Perfective C. Concerned with the
(d) it is illegal to assign one object reference change in the
variable to another object reference variable software that takes
place to make the
Ans : (b)
software adaptable
(1) We can assign value of reference variable to
to new environment
another reference variable.
(both hardware and
(2) Reference variable is used to store the address of
software)
the variable
iv. Preventive D. Concerned with the
(3) Assigning Reference will not create distinct
change in the
copies of object
software that takes
(4) All reference variables are referring to some
place to make the
object
software adaptable
(5) Assigning object reference variable does not
to changing user
create distinct object
requirements.
rectangle r1 = now rectangle ( ) :
UGC NET JRF Computer Science June 2016 Paper-III 198 YCT
 Search on TG: @apna_pdf
Code : 47. Which of the following sets represent five
(i) (ii) (iii) (iv) stages defined by Capability Maturity Model
(a) (B) (D) (C) (A) (CMM) in increasing order of maturity?
(b) (B) (C) (D) (A) (a) Initial, Defined, Repeatable, Managed,
(c) (C) (B) (D) (A) Optimized.
(d) (A) (D) (B) (C) (b) Initial, Repeatable, Defined, Managed,
Ans : (b) Optimized.
(I) Corrective maintenance is concerned with fixing (c) Initial, Defined, Managed, Repeatable,
errors that are observed when the software is in Optimized.
use (b) (d) Initial, Repeatable, Managed, Defined,
(II) Adaptive maintains is concerned with the change Optimized.
in the S/w that take place to the S/w adaptable to Ans : (b) There are five levels defined along the
new environment (c) continuum of the model and according to the SEI.
(III) Perfective maintenance is concerned with (1) Initial : The starting point for use of a new repeat
implementing new or changed user requirements process
(c) (2) Repeatable : The process is at least documented
(IV) Preventive maintenance involves performing sufficiently such that repeating the same steps may
activities to prevent the occurrence of error (a) be attempted.
45. Match each application/software design (3) Defined : The process is defined as a standard
concept in List-I to its definition in List-II. business process.
List-I List-II (4) Managed : This process is quantitatively managed
i. Coupling A. Easy to visually in accordance with agreed upon metrics
inspect the design of (5) Optimizing : Process management includes
the software and deliberate process improvement.
understand its 48. The number of function points of a proposed
purpose system is calculated as 500. Suppose that the
ii. Cohesion B. Easy to add system is planned to be developed in Java and
functionality to a the LOC/FP ratio of Java is 50. Estimate the
software without effort (E) required to complete the project
having to redesign it using the effort formula of basic COCOMO
iii. Scalable C. Focus of a code upon given below :
a single goal. E = a(KLOC)b
iv. Readable D. Reliance of a code Assume that the values of a and b are 2.5 and
module upon other 1.0 respectively.
code modules. (a) 25 person months
Code : (b) 75 person months
(i) (ii) (iii) (iv) (c) 62.5 person months
(a) (B) (A) (D) (C) (d) 72.5 person months
(b) (C) (D) (A) (B) Ans : (c) E = a (KLOC)b
(c) (D) (C) (B) (A) a = 2.5, b = 1.0
(d) (D) (A) (C) (B) LOCFp = 50 ⇒10 c = 25000 i.e. 25 KLOC
Ans : (c) E = 2.5 (25)1 = 62.5
46. Software safety is quality assurance activity 49. In UNIX, processes that have finished
that focuses on hazards that execution but have not yet had their status
(a) affect the reliability of a software component collected are known as ................
(b) may cause an entire system to fail (a) Sleeping processes (b) Stopped processes
(c) may result from user input errors (c) Zombie processes (d) Orphan processes
(d) prevent profitable marketing of the final Ans : (c) Zombie Process : The UNIX system assumes
product that if child process terminate, the parent collects some
Ans : (b) Software safety is a software quality data about the child, As soon as this collection is made,
assurance activity that focuses on the identification and the system releases information bits about the child
assessment to potential hazards that may affect software process and removes its pid from the process table. The
negatively and cause an entire system to fail. If hazards UNIX is forced to keep the child's pid and termination
can be identified early in the software process, software data in the process table indefinitely. Such a terminated
design factures can be specified that will either process whose status is not collected called a zombie
eliminate or control potential hazards. process.
UGC NET JRF Computer Science June 2016 Paper-III 199 YCT
 Search on TG: @apna_pdf
50. In Unix operating system, when a process Ans : (d)
creates a new process using the fork () system
call, which of the following state is shared
between the parent process and child process?
(a) Heap In the 16 × 16 CPU case, the worst case delay happens
(b) Stack when message passes through longest of the upper right
(c) Shared memory segments corner to lower left corner or upper left corner to lower
(d) Both Heap and Stack right corner.
Ans : (c) Parent and child share only the share memory Longest path is indicated in red color
segments everything else (like stack, heap etc) is It passes through 2(N –1) = 2(16 – 1) = 30 hops
duplicated. 54. Suppose that the time to do a null remote
51. Which of the following information about the procedure call (RPC) (i.e. 0 data bytes) is 1.0
msec, with an additional 1.5 msec fro every 1K
UNIX file system is not correct?
of data. How long does it take to read 32 K
(a) Super block contains the number of i-nodes,
from the file server as 32 1K RPCs?
the number of disk blocks, and the start of the
(a) 49 msec (b) 80 msec
list of free disk blocks. (c) 48 msec (d) 100 msec
(b) An i-node contains accounting information as
Ans : (b) A signal 32 K RPC takes 1.5 * 32 + 1.0 = 49.0
well as enough information to locate all the
msec 321 K RPC take 1.5 * 32 + 1.0 * 32 = 80.0 msec
disk block that holds the file's data.
55. Let L be the language generated by regular
(c) Each i-node is 256-bytes long.
(d) All the files and directories are stored in data expression 0*10* and accepted by the
blocks. deterministic finite automata M. Consider the
relation RM defined by M. As all states are
Ans : (c) UNIX file system: reachable from the start state, RM has .........
Super block contains the number of i-nodes, the number equivalence classes.
of disk blocks, and the start of the list of free disk (a) 2 (b) 4
blocks.Correct (c) 5 (d) 6
An i-node contains accounting information as well as Ans : (d) 0* 10*
enough information to locate all the disk blocks that
holds the file’s data.Correct
All the files and directories are stored in data
= equivalence class
blocks.Correct
= no. of states in DFA
Each i-node is 256-bytes long.Incorrect.It is 128 byte
=3
long.
Myhill nerorde equivalence relation = no. of states in
So, option (C) is correct. minimal DFA
52. Which of the following option with reference to 56. Let L = {0n1nn≥ ≥0} be a context free language.
UNIX operating system is not correct? Which of the following is correct?
(a) INT signal is sent by the terminal driver (a) L is context free and Lk is not context free
when one types <Control> and it is a request for any k ≥ 1.
to terminate the current operation.
(b) L is not context free and Lk is context free
(b) TERM is a request to terminate execution
for any k ≥ 1.
completely. The receiving process will clean
(c) Both L and Lk is for any k ≥ 1 are context
up its state and exit.
free.
(c) QUIT is similar to TERM, except that it
defaults to producing a core dump if not (d) Both L and Lk is for any k ≥ 1 are not context
caught. free.
(d) KILL is a block able signal. Ans : (c) S → TaUvb
Ans : (d) UNIX operating system does not kills a block T →aTTbTTbba
able signal. U → aUw
53. A multi computer with 256 CUPs is organized V → Vbw
as 16 × 16 grid. What is the worst case delay (in W → aWb
hops) that a message might have to take? and L {0n 1nn ≥ 03 is also context free (push 0 & pop
(a) 16 (b) 15 1 into stackand at last we have empty string) so both L1
(c) 32 (d) 30 & L2 are context free.
UGC NET JRF Computer Science June 2016 Paper-III 200 YCT
 Search on TG: @apna_pdf
57. Given a Turing Machine Ans : (b)
M = ({q0, q1, q2, q3}, {a, b}, {a, b, B} δ, B, {q3})
Where δ is a transition function defined as
δ(q0, a) = (q1, a, R)
δ(q1, b) = (q2, b, R)
δ(q2, a) = (q2, a, R)
δ(q2, b) = (q3, b, R)
The language L(M) accepted by the Turing
Machine is given as :
(a) aa*b (b) abab Length of bits 11
(c) aba*b (d) aba* 3 ×1 3 × 1 2 × 1 1× 1 14
Ans : (c) Turing machine head movement only right + + × = = 1.75 bits per symbol
8 8 4 2 8
direction we can build dfa for it.
60. Which of the following is used for the
Total 4 states are given
boundary representation of an image object?
(Q0, a) gives Q1 no transition for b
(a) Quad tree (b) Projections
(Q1, b) gives Q2 no transition for a (c) Run length coding (d) Chain codes
that means string with ab Ans : (d) A chain is a lossless compression algorithm
now (Q2, a) gives Q2 that means it is loop on Q2 from for monochrome image. The principle of chain nodes is
(Q2, b) go to Q3 and after that no transition that means separately encode each connected component in the
string end with 'b' image for each such regional a point on the boundary is
So option (c) is answer. selected and its coordinate are transmitted.
58. Consider a discrete memory less channel and 61. The region of feasible solution of a linear
assume that H(x) is the amount of information programming problem has a ........... property
per symbol at the input of the channel; H(y) is in geometry, provided the feasible solution of
the amount of information per symbol at the the problem exists.
output of the channel; H(x y) is the amount of (a) concavity (b) convexity
uncertainty remaining on x knowing y; and (c) quadratic (d) polyhedron
I(x; y) is the information transmission. Ans : (b) Geometric interpretation : The set of point
Which of the following does not define the in IRN at which any single constraint holds with
equality is a hyper plane in IRN. Thus each constraint is
channel capacity of a discrete memoryless
satisfied by the points of a closed half space of IRN, &
channel?
the set of feasible solution is the intersection of all these
(a) max I (x ; y) half spaces. Convex polyhedron p.
p(x) So answer is (b)
(b) max [H(y) – H(yx)] 62. Consider the following statements :
p(x)
(1) Revised simplex method requires lesser
(c) max [H(x) – H(xy)] computations than the simplex method.
p(x) (2) Revised simplex method automatically
(d) max H(xy) generates the inverse of the current basis
p(x) matrix.
Ans : (d) The channel capacity of a discrete memory (3) Less number of entries are needed in each
less channels is defined by : table of revised simplex method than usual
C = max I (x; y) p (x) simplex method.
= max [H(y) – H(yx)] p(x) Which of these statements are correct?
in ax [H(x) – H(x)] p (x) (a) (1) and (2) only (b) (1) and (3) only
(c) (2) and (3) only (d) (1), (2) and (c)
59. Consider a source with symbols A, B, C, D with
Ans : (d) Revised simplex method is an improvement
probabilities 1/2, 1/4, 1/8, 1/8 respectively. over simplex method. Revised simplex method is
What is the average number of bits per symbol computational more efficiently and accurate. Benefit of
for the Huffman code generated from above revised simplex method is comprehended in case of
information? large Lp problems. In simplex method tableau is
(a) 2 bits per symbol updated while a small part of it is used. The revised
(b) 1.75 bits per symbol simplex method use exactly the same steps as those in
(c) 1.50 bits per symbol simplex method.
(d) 1.25 bits per symbol So answer is option (d)
UGC NET JRF Computer Science June 2016 Paper-III 201 YCT
 Search on TG: @apna_pdf
63. The following transportation problem : 64. Let R and S be two fuzzy relations defined as :

y10

y20
xxxx1111xxxx2222
 

R
=

7 .
.

.
5 4
A B C Supply
 

0
8
0 z1.
.
I 50 30 220 1  
II 90 45 170 3  

z2. 0

z30
yyyy1111yyyy2222
III 250 200 50 4  

S
=

0 0
9 .
0
6 .

.
2 .
Demand 4 2 2 and  

7
0
5
 
has a solution  
A B C Then, the resulting relation, T, which relates
I 1 elements of universe x to elements of universe z
II 3 0 using max-min composition is given by
III 2 2  z1 z 2 z3 
x1 
The above solution of a given transportation (a) T =  .5 .7 .5 
x2
problem is :  .8 .8 .8 
(a) infeasible solution  z1 z2 z3 
x1 
(b) optimum solution (b) T =  .5 .7 .5 
(c) non-optimum solution x2
 .9 .6 .5 
(d) unbounded solution
 z1 z 2 z3 
Ans : (b) x
(c) T = 1 0.7 0.6 0.5
x2
 0.80.6 0.4
 z1 z 2 z3 
x1 
(d) T = 0.7 0.6 0.5
x2
 0.8 0.8 0.8
 y1 y 2   z1 z 2 z3 
x1   S = y1  .9 −6 −5
Ans : (c) R = 0.7 0.5
x2   y2  
 0.5 0.4   .8 .6 .4 
Then ROS by max min composition gives,
MROS (x1, x2) = max (min (.7, .9), min (.5, .1) = max
(0.7, .1 = 0.7
as xl can be converted to z1 through y1 & y2
MRos (x1, z2) = max (min (.7, .6), min (.5, .7) = max
(.6, .5) = .6
similarly for all (x1, z3), (x2, z1) (x2, z2) (x2, z3)
So answer is (c)
65. Compute the value of adding the following two
fuzzy integers :
A = {(0.3, 1), (0.6, 2), (1, 3), (0.7, 4), (0.2, 5)}
B = {(0.5, 11), (1, 12), ( 0.5, 13)}
Where fuzzy addition is defined as
µ A + B ( z ) = max (min(µ A (x), µ B (x)))
x+y=z
Then, f (A + B) is equal to
(a) {(0.5, 12), (0.6, 13), (1, 14), (0.7, 15), (0.7,
16), (1, 17), (1, 18)}
(b) {(0.5, 12), (0.6, 13), (1, 14), (1, 15), (1, 17),
(1, 18)}
(c) {(0.3, 12), (0.5, 13), (0.5, 14), (1, 15), (0.7,
16), (0.5, 17), (0.2, 18)}
(d) {0.3, 12), (0.5, 13), (0.6, 14), 1, 15), (0.7,
16), (0.5, 17), 0.2, 18)}
UGC NET JRF Computer Science June 2016 Paper-III 202 YCT
 Search on TG: @apna_pdf
Ans : (d) u A+ b (z) = max x + y = z (min u B (x))) Ans : (d) Cron daemon is the standard tool for running
A = {0.3, 1), (0.6, 2), (1, 3), (0.7, 4), (0.2, 5)} command an a receteminced schedule. It starts when
B = {(0.5, 11), )1, 12), (0.5, 13)} the system boots and run as long as the system is up.
First add the numbers (x + y = z) and write the main Crontabs for individual u>a are stored under
membership value since function is min ((uA (x), u B
varspoolcron. There is one crontab file per user.
(x))
you will get following 15 terms 69. In Unix, files can be protected by assigning
{0.3, 12), (0.3) 13), (0.3, 14), (0.5, 13), (0.6, 14), (0.5, each one a 9-bit mode called right bits. Now,
15), (0.5, 14), (1, 15), (0.5, 16), (0.5, 15), (0.7, 16), (0.5, consider the following two statements :
17), (0.2, 16), (0.2, 17), (0.2, 18)} I. A mode of 641 (octal) means that the
now write all distinct elements with max membership owner can read and write the file, other
value members of the owner's group can read
Since max is there in the question
it, and users can execute only.
So answer is (d)
II. A mode of 100 (octal) allows the owner to
66. A perceptron has input weights W1 = – 3.9 and
execute the file, but prohibits all other
W2 = 1.1 with threshold value T = 0.3. access.
What output does it give for the input x1 = 1.3
Which of the following options is correct with
and x2 = 2.2 ?
(a) – 2.65 (b) – 2.30 reference to above statements?
(c) 0 (d) 1 (a) Only I is correct
Ans : (c) According to given question w1 = – 3.9 and (b) Only II is correct
w2 = 1.1 and x1 = 1.3 and x2 = 2.2 weighted sum = w1 * (c) Both I and II are correct
x1 + w2 * x2 + . . . wn * xn i.e. -3.9 * 1.3 + 1.1 * 2.2 = - (d) Both I and II are incorrect
5.07 + 2.42 = -2.65 Now we will compare the weighted Ans : (c) In UNIX the access control of file is done
sum -2.65 to the threshold 0.3. -2.65 < 0.3 through chmod command. The common is octal, the
Then output will be zero. there right most are for
So, option (C) is correct. First is for owner, second is for group, third is for other
67. What is the function of the following UNIX here rwx is read, write execute. This can take the value
command? from 0 through 7 where
WC – /<a > b& # permission rwx
(a) It runs the word count program to count the 7 read, write & execute rwx
number of lines in its input, a, writing the 6 read, write rw–
result to b, as a foreground process. 5 read & execute r–x
(b) It runs the word count program to count the 4 read only r– –
number of lines in its input, a, writing the 3 write & execute –wx
result to b, but does it in the background. 2 write only –w–
(c) It counts the errors during the execution of a 1 execute only – –x
process, a, and puts the result in process b. 0 none ––
(d) It copies the 'l' numbers of lines of program
from file, a, and stores in file b. 641 represent → The owner can read and write the file,
other member of the owner group can read it & user can
Ans : (b) WC – 1<a > b& execute only
wc for word cound-1 for line < a input a> b output b &
100 → The owner to execute the file, but prohibits all
for background
other access
It runs the word count program to count the number of
lines its input, a write result of b, but does it in the 70. Consider the statement
background. "Either – 2 ≤ x ≤ – 1 or 1 ≤ x ≤ 2"
68. Which of the following statement is not correct The negation of this statement is
(a) x < – 2 or 2 < x or –1 < x < 1
with reference to cron daemon in UNIX O.S.?
(b) x < – 2 or 2 < x
(a) The cron daemon is the standard tool for
(c) – 1 < x < 1
running commands on a pre-determined
schedule. (d) x ≤ – 2 or 2 ≤ x or – 1 < x < 1
(b) It starts when the system boots and runs as Ans : (a) “Either – 2 ≤ x ≤ – 1 or 1 ≤ x ≤2”. i.e. Either x
long as the system is up. ≥ -2 or x ≤ -1 or 1 ≤ x or x ≤ 2” We have to find
(c) Cron reads configuration files that contain negation of above statement: Negation of x ≥ -2 is x <
list of command lines and the times at which 2. Negation of x ≤ -1 is x > -1. Negation of 1 ≤ x is x <
they invoked. 1 Negation of x ≤ 2 is x > 2. i.e. x < – 2 or 2 < x or – 1 <
(d) Cronatab for individual users are not stored. x < 1. So, option (A) is correct.
UGC NET JRF Computer Science June 2016 Paper-III 203 YCT
 Search on TG: @apna_pdf
71. Which of the following is characteristic of an We have to maximize A and minimize B and C.
MIS? Minimum of B is 3 and C is 2 But max from B is 12 and
(a) Provides guidance in identifying problems, max from C is 15. So, there is no need of further
finding and evaluating alternative solutions,
expanding H and I. Because whatever value their
and selecting or comparing alternatives.
(b) Draws on diverse yet predictable data successor will produce will be immaterial. Hence H I
resources to aggregate and summarize data. are pruned. For more information on Game theory Refer
(c) High volume, data capture focus. : Minimax Algorithm in Game Theory | Set 4 (Alpha-
(d) Has as its goal the efficiency of data Beta Pruning) Option (B) is correct.
movement and processing and interfacing
different TPS. 74. Consider a 3-puzzle where, like in the usual 8-
Ans : (b) Choice - (1) refers to characteristics of DSS puzzle game, a tile can only move to an
(Decision support system) adjacent empty space. Given the initial state
Choice (3, 4) refers to characteristic for a transaction
processing system, so answer is (b)
72. How does randomized hill-climbing choose the , which of the following state cannot
next move each time? be reached?
(a) It generates a random move from the move
set, and accepts this move.
(b) It generates a random move from the whole (a) (b)
state space, and accepts this move.
(c) It generates a random move from the
moveset, and accepts this move only if this (c) (d)
move improves the evaluation function. Ans : (c)
(d) It generates a random move from the whole
state space, and accepts this move only if this
move improves the evaluation function.
Ans : (c) Randomized Hill climbing : Sample D points
in the neighborhood of the con currently best solution; Not able to get (c)
determine the best solution of the sampled points, It is
So answer is option (c)
better than the current solution, make it new current
solution & continue the search. 75. A software program that infers and
73. Consider the following game tree in which root manipulates existing knowledge in order to
is a maximizing node and children are visited generate new knowledge is known as :
left to right. What nodes will be pruned by the (a) Data dictionary
alpha-beta pruning?
(b) Reference mechanism
(c) Inference engine
(d) Control strategy
Ans : (c) A software program that infers and
manipulates existing knowledge in order to generate
new knowledge is known as Inference engine.
A data dictionary is a collection of descriptions of the
(a) I (b) HI data objects or items in a data model for the benefit of
(c) CHI (d) GHI programmers and others who need to refer to them.
Ans : (b)
Control strategies are specific action plans for bringing
a process back into control.
Reference is what relates words to the world of objects
on whose condition the truth of sentences hinges and it
is natural to wonder what sorts of relations underlie the
reference relation-to wonder, that is, what constitutes
the mechanism of reference.
So, option (C) is correct.

UGC NET JRF Computer Science June 2016 Paper-III 204 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. August, 2016

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. The ∧q)∧
Boolean function [~(~p∧ ∧~(~p∧
∧~q)] Ans : (d) Using Venn's diagram:
∨(p∧
∧r) is equal to Boolean function :
(a) q (b) p ∧ r
(c) p ∨ r (d) p
Ans : (d) Given boolean function is equivalent
⇒ [(p ⋅ q) ⋅ (p ⋅ q)] + p.r
⇒ [(p ⋅ q) ⋅ (p + q)] + p.r
⇒ [(p + qq)] + p.r
⇒ p(1 + r)
=p
2. Let us assume that you construct ordered tree
Therefore, |A - B| ≤ |A ⊕ B| ≤ |A ∪ B| ≤ |A| + |B|
to represent the compound proposition (~(p ∧
4. What is the probability that a randomly
q)) ↔ (~p ∧ ~ q).
selected bit string of length 10 is a palindrome?
Then, the prefix expression and post-fix 1 1
expression determined using this ordered tree (a) (b)
64 32
are given as ............ and ............. respectively. 1 1
(c) (d)
(a) ↔~∧pq∨~~pq, pq∧~p~q~ ∨↔ 8 4
(b) ↔~∧pq∧~p~q, pq∧~p~q~∧↔ Ans : (b) For palindrome in even length palindrome
half length is timed and rest is repeated. So, in 10 bit
(c) ↔∧pq∨~~ pq, pq∧~p~~q∧↔ palindrome, we have 5 position to be filled with 2
(d) ↔~∧pq∧~p~q, pq∧~p~~q∧↔ choices each i.e. 25 choices for first half and 25 choices
Ans : (b) for second half.
0 0 0 0 0 Fix Fix Fix Fix Fix
/ / / / / ed ed ed ed ed
1 1 1 1 1
Probability = favorable
25 1 1
= 10 ⇒ 5 ⇒
2 2 32
Prefix : ↔ ~ ∧PQV∧~P~Q 5. Given the following graphs :
Postfix : PQ∧~P~Q~~∨↔
option (b) is answer
3. Let A and B be sets in a finite universal set U.
Given the following :
A–B, A ⊕B, A+Band A ∪B
Which of the following is in order of increasing Which of the following is correct?
size? (a) G1 contains Euler circuit and G2 does not
(a) A–B≤ A ⊕B≤ A+B≤ A ∪B contain Euler circuit
(b) G1 does not contain Euler circuit and G2
(b) A⊕B≤ A –B≤ A ∪B≤ A+B contains Euler circuit
(c) A⊕B≤ A+B≤ A –B≤ A ∪B (c) Both G1 and G2 do not contain Euler circuit
(d) A–B≤ A ⊕B≤A ∪B≤ A+B (d) Both G1 and G2 contain Euler circuit

UGC NET JRF Computer Science August 2016 Paper-II 205 YCT
 Search on TG: @apna_pdf
Ans : (c) For a graph to be euler graph every vertex in
the graph should have even degree in graph g1 all the
vertices have odd degree, so no euler circuit possible
therefore g1 is not euler graph.
Graph g1 have vertex a, b, c all these vertex have add
degree as 3, 5, 3 so here no euler circuit possible.
So answer is option (c) (a) EXCLUSIVE-OR
6. The octal number 326.4 is equivalent to : (b) EXCLUSIVE-NOR
(c) NAND
(a) (214.2)10 and (D6.8)16
(d) NOR
(b) (212.5)10 and (D6.8)16
(c) (214.5)10 and (D6.8)16 Ans : (a)
(d) (214.5)10 and (D6.4)16
Ans : (c) (326.4)8 = ( 3 × 82 + 2 × 8 + 6 × 80 + 4 × 8-
1
)10 = (214.5)10
(326.4)8 = (011010110.100)2
= (011010110.1000)2
= (OD6.8)16
= (D6.8)16 f = (( x + y ) + y ) + (( x + y ) + x)
7. Which of the following is the most efficient to f = (( x + y ) ⋅ y )) + (( x + y ) ⋅ x )
perform arithmetic operations on the
f = (( x + y ) ⋅ y ) + (( x + y ) ⋅ x )
numbers?
(a) Sign–magnitude (b) 1's complement f = ( xy ) + ( xy )
(c) 2's complement (d) 9's complement f = x ⊕ y = x(EXOR) y
Ans : (c) In 1's complement there are two values of
zero. A – 0 (11111111) and a + (00000000). On the 10. Match the following :
other hand in 2's complement, there is only one value List - I List - II
for 0 (00000000). 2's complement is efficient to perform A. Controlled i. a circuit that can
arithmetic operation on the numbers. Inverter add 3 bits
8. The Karnaugh map for a Boolean function is B. Full adder ii. a circuit that can
given as add two binary
CD CD CD CD numbers
0 0 0 0 C. Half adder iii. a circuit that
AB
transmits a binary
AB 0 0 1 0
word or its 1's
AB 1 1 1 1 complement
AB 0 1 1 1 D. Binary iv. a logic circuit that
The simplified Boolean equation for the above adder adds 2 bits
Karnaugh Map is Codes :
(a) AB + CD + AB + AD A B C D
(b) AB + AC + AD + BCD (a) iii ii iv i
(c) AB + AD + BC + ACD (b) ii iv i iii
(d) AB + AC + BC + BCD (c) iii iv i ii
Ans : (b) Given K map is (d) iii i iv ii
Ans : (d)
• Half adder used to add 2 bits
• Full adder used to add 3 bits
• Controlled inverter is a circuit that transmits a
binary word or its d's complement
• Binary adder used to add 2 binary number
Hence answer is (d)
11. Given i = 0, j = 1 k = –1
Therefore, boolean function is- x = 0.5, y = 0.0
f = AB + AD + AC + BCD What is the output of given 'C' expression?
9. Which of the following logic operations is x * 3 & & 3  j I k
performed by the following given (a) –1 (b) 0
combinational circuit? (c) 1 (d) 2

UGC NET JRF Computer Science August 2016 Paper-II 206 YCT
 Search on TG: @apna_pdf
Ans : (c) Given C expression with their values- Ans : (b) Accessing the data from the database in
= x * y < i + j || k DBMS done through DML (Data manipulation
= 0.5 * 0.0 < 0 + || 1 language). The DML command can access the data
= 0 < 0 + 1 || - 1 from a database.
= 0 < 1 || - 1 17. Relational database schema normalization is
= 1 || - 1 NOT for :
= 1 (returns boolean) (a) reducing the number of joins required to
12. The following 'C' Statement : satisfy a query
(b) eliminating uncontrolled redundancy of data
int * f[] ( ) : stored in the database
declares : (c) eliminating number of anomalies that could
(a) A function returning a pointer to an array of otherwise occur with inserts and deletes
integers. (d) ensuring that functional dependencies are
(b) Array of functions returning pointers to enforced
integers Ans : (a) Relational database schema normalization is
(c) A function returning an array of pointers to not for reducing the number of joins required to satisfy
integers a query.
(d) An illegal statement. Relational database schema normalization goal is
Ans : (b) A function returning a pointer to an array of (1) eliminating reduclary
integers (2) function dependencies
(* f[]) = f is a function returning a pointer then array So option (a) should be answer
comes. 18. Consider the following statement regarding
Hence the answer is option (b) relational database model :
13. If a function is friend of a class, which one of (1) NULL values can be used to opt a tuple out
the following is wrong? enforcement of a foreign key
(a) A function can only be declared a friend by a (2) Suppose that table T has only one candidate
class itself key. If Q is in 3NF, then it is also in BCNF
(b) Friend functions are not members of a class, (3) The difference between the project operator
they are associated with it (II) in relational algebra and the SELECT
(c) Friend functions are members of a class keyword in SQL is that if the resulting
(d) It can have access to all members of the table/set has more than one occurrences of
class, even private ones the same tuple, then II will return only one of
Ans : (c) A friend function of a class is defined outside them, while SQL SELECT will return all
that class's scope and it has the right to access all private One can determine that :
and protected members of the class. Even through the (a) (1) and (2) are true
prototypes for friends functions appears in the class (b) (1) and (3) are true
definition, friends are not members functions. (c) (2) and (3) are true
14. In C++, polymorphism requires : (d) (1), (2) and (3) are true
(a) Inheritance only Ans : (d) (i) In Relational Database Model:
(b) Virtual functions only (a) NULL values can be used to opt a tuple out of
enforcement of a foreign key correct.
(c) References only
(b) Suppose that table T has only one candidate key. If
(d) Inheritance, Virtual functions and references
Q is in 3NF, then it is also in BCNF correct.
Ans : (d) Basically polymorphism means having many (c) The difference between the project operator (∏) in
forms. In C++, polymorphism requires Inheritance,
Virtual functions and references, because polymorphism relational algebra and the SELECT keyword in SQL is
occurs when there is a hierarchy of classes and they are that if the resulting table/set has more than one
related by inheritance which include virtual functions occurances of the same tuple, then ∏ will return only
and references. one of them, while SQL SELECT will return al correct.
15. A function template in C++ provides .......... 19. Consider the following Entity-Relationship (E-
level of generalization. R) diagram and three possible relationship sets
(a) 4 (b) 3 (I, II and III) for this E-R diagram :
(c) 2 (d) 1
Ans : (c) C++ provides two kinds of templates: class
templates and function templates. A function template
in C++ provides two level of generalization.
16. DBMS provides the facility of accessing data
from a database through
(a) DDL (b) DML
(c) DBA (d) Schema
UGC NET JRF Computer Science August 2016 Paper-II 207 YCT
 Search on TG: @apna_pdf
I: Ans : (c) Total number of vertices = 12 * 12 = 144
P Q S T The graph formed by the decription contains 4 (corner)
p1 q1 s1 t1 vertices of degree 3 and 4 o(external) vertices of degree
p1 q1 s1 t2 5 and 100 (remaining/internal) vertices of degree 8.
II: According to (Handshake theoram)
P Q S T 2 |E| = Sum of degrees
p1 q1 s1 t1 2 |E| = 4 × 3 + 40 × 5 + 100 × 8
p1 q1 s2 t2 2 |E| = 1012
III: 1012
|E| = = 506 edges
P Q S T 2
p1 q1 s1 t1 23. The runtime for traversing all the nodes of a
p1 q2 s1 t1 binary search tree with n nodes and printing
If different symbols stand for different values them in an order is :
(e.g., t1 is definitely not equal to t2), then which (a) O (lg n) (b) O(n lg n)
of the above could not be the relationship set (c) O(n) (d) (On2)
for the E-R diagram?
Ans : (c) Printing the elements in an order means the
(a) I only (b) I and II only
element should be printed in sorted order & we know
(c) II only (d) I, II and III
inorder traversal of BST takes gives the sorted order &
Ans : (a) II & II satisfy the 1 : 1 cardinality of S & T takes O(n) time. The recurrence involved is :
but I does not satisfy it T(n) = 2T (n/2) + c for balanced BST which on solving
So answer is option (a) gives O(n) and also for skewed tree T(n) = T(n – 1) + c
20. Consider a database table R with attributes A which also on solving gives O(n) time.
and B. Which of the following SQL queries is 24. Consider the following statements :
illegal? S1 : A queue can be implemented using two
(a) SELECT A FROM R; stacks.
(b) SELECT A, COUNT (*) FROM R; S2 : A stack can be implemented using two
(c) SELECT A, COUNT(*) FROM GROUP BY queues.
A; Which of the following is correct?
(d) SELECT A, B, COUNT (*) FROM R (a) S1 is correct and S2 is not correct
GROUP BY A, B; (b) S1 is not correct and S2 is correct
Ans : (b) SELECT A, COUNT (*) FROM R GROUP (c) Both S1 and S2 are correct
By A, B, legal query. (d) Both S1 and S2 are not correct
When aggregation function (sum, avg, count, max and Ans : (c) Explanation of statement 1: Let us how 2
min) are used in select clause then we need to use group stack S1 & S2 for our purpose. For enqueue operation,
by clause for grouping the attributes. we have 2 cases.
21. Consider an implementation of unsorted single (a) S2 is not empty : In that case, we simply pop from
linked list. Suppose it has its representation this stack
with a head and a tail pointer (i.e. pointers to (b) S2 is empty : in that case first we pop all elements
the first and last nodes of the linked list). Given from S1 and push into S2. After pushing all the
the representation, which of the following elements so S1 is correct and as same, simply do for S2.
operation can not be implemented in O(1) So S2 is also correct.
time? Hence the answer is option (c).
(a) Insertion at the front of the linked list 25. Given the following prefix expression :
(b) Insertion at the end of the linked list *+3+↑3+333
(c) Deletion of the front node of the linked list What is the value of the prefix expression?
(d) Deletion of the last node of the linked list (a) 2178 (b) 2199
Ans : (d) Here although we have tail pointer but if will (c) 2205 (d) 2232
be of no use because these is no previous pointer. We
Ans : (c) Prefix expression = *+3+3↑3 + 333
need to here seemed last pointer so that we make it the
last pointer & can free the last pointer i.e. deleting the ⇒*+3+3∧3(3+3)3
last node. So we need to traverse the whole linked list ⇒*+3+3∧363
making it O(n). ⇒*+3+3(3∧6)3
22. Consider an undirected graph G where self- ⇒*+3+37293
⇒*+3(3+729)3
loops are not allowed. The vertex set of G is {i,
⇒*+3732 3
j)   ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge
⇒*(3+732)3
between (a, b) and (c, d) if la – cl ≤ 1 or b – d
⇒*7333
≤ 1. The number of edges in this graph is :
⇒(735)*3
(a) 726 (b) 796
(c) 506 (d) 616 ⇒2205 (ans 3)
UGC NET JRF Computer Science August 2016 Paper-II 208 YCT
 Search on TG: @apna_pdf
26. Which of the following statements is not true 30. Which of the following protocols is used by
with respect to microwaves? email server to maintain a central repository
(a) Electromagnetic waves frequencies from 300 that can be accessed from any machine?
GHz to 400 THz (a) POP3 (b) IMAP
(b) Propagation is line-of-sight (c) SMTP (d) DMSP
(c) Very high-frequency waves cannot penetrate Ans : (b) IMAP : The basic idea behind IMAP is for
walls all email server to maintain a central repository that can
(d) Use of certain portions of the band requires be accessed from any machine
permission from authorities
31. The number of strings of length 4 that
Ans : (a) The frequencies are between 300 MHz * 400
GHz and the rest are true generated by the regular expression (0+ 1+ 2+
27. In a fast Ethernet cabling, 100 base-TX uses 3+)*, where is an alternation character and {+,
*} are quantification characters is :
........ cable and maximum segment size is ........
(a) 08 (b) 09
(a) twisted pair, 100 meters
(c) 10 (d) 12
(b) twisted pair, 200 meters
(c) fibre optics, 1000 meters Ans : (c) Given Reg Exp = (0+ 1+ 2+ 3+)*
(d) fibre optics, 2000 meters We can assume this expression as (A+B+)* we can
Ans : (a) Fast Ethernet:- Cabling, 100 Base- Tx uses form the string with A(01) or B(23) or both (01, 23) so
twisted pair cable and maximum segment size is 100 below are the lo possible 4 char strings
metres. with 01 ⇒ 01111, 0011, 0001, 0101
28. A network with bandwidth of 10 Mbps can with 23 ⇒ 2333, 2233, 2223, 2323
pass an average of 12,000 frames per minute using both 01 & 23 ⇒ 0123, 2301
with each frame carrying an average of 10,000 32. The content of the accumulator after the
bits. What is the throughput of this network? execution of the following 8085 assembly
(a) 1 Mbps (b) 2 Mbps language program, is :
(c) 10 Mbps (d) 12 Mbps MVI A, 35H
Ans : (b) 12000 * 10000/60 = 2 Mbps MOV B, A
So answer is option (b) STC
29. Match the following : CMC
List - I List – II RAR
A. Session layer i. Virtual terminal XRA B
software (a) 00H (b) 35H
B. Application ii. Semantics of the (c) EFH (d) 2FH
layer information Ans : (d)
transmitted MUI A, 35 H Content of accumulator = 35 H
C. Presentation iii. Flow control MOV B, A  Content of register B = 35 H
layer STC  set carry flag = 1
D. Transport iv. Manage dialogue CMC  Complement carry flag = hot (1) =0
layer control RAR
Codes : XRA B
A B C D (00110101) XOR (0001 1010)
(a) iv i ii iii = 0010 1111
(b) i iv ii iii = 2F H
(c) iv i iii ii
33. In compiler optimization, operator strength
(d) iv ii i iii
Ans : (a) reduction uses mathematical identities to
(a) Application layer is the topmost layer in TCP/IP replace slow math operations faster operations.
protocol stack. Hence it is related to software related Which of the following code replacements is an
things. illustration of operator strength reduction?
(b) Presentation layer present the data in proper format (a) Replace P + P by 2 * P or Replace 3 + 4 by 7
for transmission so it is connected with semantics of (b) Replace P * 32 by P < < 5
data. (c) Replace P * 0 by 0
(c) Session layer maintains multiple connection and (d) Replace (P < < 4) – P by P * 15
synchrony sation Ans : (b) Multiplication (*) operation is slower than
(d) Lastly transport layer deals with flow control and addition (+) operation and left shift (<<) only replace P*
congession control mainly. 32 by P<<5 is correct and P*0 by 0 is not envolved any
Hence answer is option (a) operator reduction.
UGC NET JRF Computer Science August 2016 Paper-II 209 YCT
 Search on TG: @apna_pdf
34. Which of the following are the principles tasks (a) 11 (b) 12
of the linker? (c) 10 (d) 9
I. Resolve external references among Ans : (*)
separately compiled program units. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1
II. Translate assembly language to machine 0 0 0 0 5 5 5 7 7 7 7 7 1
code. 2 2 2 2 4 4 4 4 1 1 4 4
III. Relocate code and data relative to the 1 1 1 1 6 6 5 5 2 2 2
beginning of the program. 3 3 3 3 3 3 3 3 3 3
IV. Enforce access-control restrictions on
system libraries. Total number of page fault = 13
(a) I and II (b) I and III So, no option is matching
(c) II and III (d) I and IV 38. Consider a system having 'm' resources of the
Ans : (b) Statement (i) and (iii) are task of linker, and same type. These resources are shared by three
(ii) is task of assembler (iv) using access control. processes P1, P2 and P3 which have peak
35. Which of the following is FALSE? demands of 2, 5 and 7 resources respectively.
(a) The grammar S→aSaSbS∈?. where S is the For what value of 'm' deadlock will not occur?
only non-terminal symbol, and ∈ is the null (a) 70 (b) 14
string, is ambiguous (c) 13 (d) 7
(b) An unambiguous grammar has same left Ans : (b) Peak demands of P1, P2 & P3 are 2, 5 & 7
most right most derivation allocate 1 less than peak dam and i.e. P1 →1, P2→4
(c) An ambiguous grammar can never be LR (k)P3→6
for any k. The number of resources for which deadlock occurs is 1
+ 4 + 6 = 11
(d) Recursive descent parser is a top-down parser
Add one to the number of resources we get 12, the value
Ans : (b) Recursive descent is a top-down parser is
for which deadlock will not occur.
true An unambiguous grammar has some left most &
right most derivation True. 39. Five jobs A, B, C, D and E are waiting in
The grammar S→aSaSbS∈, where S is the only non Ready Queue. Their expected runtimes are 9,
terminal symbol, & EE is the null string, is ambiguous 6, 3, 5 are x respectively. All jobs entered in
try to generate aab Ready queue at time zero. They must run in
Answer is option (b) ......... order to minimize average response time
if 3 < x < 5.
36. Consider a system with seven processes A (a) B, A, D, E, C (b) C, E, D, B, A
through G and six resources R through W. (c) E, D, C, B, A (d) C, B, A, E, D
Resource ownership is as follows : Ans : (b) To minimize response time these must run in
process A holds R and wants T shortest job first order.
process B holds nothing but wants T Therefore, C(3), E(3 < x < 5), D(5), B(6), A(9)
process C holds nothing but wants S 40. Consider three CPU intensive processes P1, P2,
process D holds U and wants S & T
P3 which require 20, 10 and 30 units of time,
process E holds T and wants S
arrive at times 1, 3 and 7 respectively. Suppose
process F holds W and wants S operating system is implementing shortest
process G holds V and wants U Remaining time first (preemptive scheduling)
Is the system deadlocked? If yes, ............... algorithm, then .............. context switches are
processes are deadlocked. required (suppose context switch at the
(a) No (b) Yes, A, B, C beginning of ready queue and at the end of
(c) Yes, D, E, G (d) Yes, A, B, F Ready queue are not counted).
Ans : (c) (a) 3 (b) 2
(c) 4 (d) 5
Ans : (a) P1, P2, P3 are three processes
Arrival time of P1 is 1 so we made to run P1 at time 1
now P1 is run for 2 units, process arrived with less B.T,
so switch happens to P2-(1) P2 run till completion since
there are no shorter Jobs available, then switch happens
System is deadlock due to process D, E, G to P1 .......(2)
So answer is option (c) Again P1 is run since it has burst time (is) < burst time
37. Suppose that the virtual address space has of P3 (30) completion of P1, switch happens to P3 run
eight pages and physical memory with four till completion..........(3)
page frames. If LRU page replacement
algorithm is used, ............ number of page
faults occur with the reference string.
021354637473355311172341
UGC NET JRF Computer Science August 2016 Paper-II 210 YCT
 Search on TG: @apna_pdf
41. Which of the following is used to determine the retransmits to the receiver after some time
specificity of requirements? without altering the information. This attack is
n1 n2 called is ..........
(a) (b) (a) Denial of service attack
n2 n1
(b) Masquerade attack
(c) n1 + n2 (d) n1 – n2 (c) Simple attack
Where n1 is the number of requirements of (d) Complex attack
which all reviewers have identical Ans : (a) Simple and complex attack : Heard first time
interpretations, n2 is number of requirements of this type of attack, classification is actually active
in a specification. and passive attack.
Ans : (a) Choice 1 & 2 must be different assuming Denial of service attack : Not giving user to access his
choice 2 as (nan1). So the answer is option (a) resource which he is supposed to use
42. The major shortcoming of waterfall model is : Masquerade attack : Using fake identity to gain
(a) the difficulty in accommodating changes authorized access
after requirement analysis So answer is option (a)
(b) the difficult in accommodating changes after 47. ............ is subject oriented, integrated, time
feasibility analysis variant, nonvolatile collection of data in
(c) the system testing support of management decisions
(d) the maintenance of system (a) Data mining
Ans : (a) The main drawback of the waterfall model is (b) Web mining
the difficulty of accommodating change after the (c) Data warehouse
process is under way. (d) Database management system
(1) Difficult to address change: Inflexible partitioning Ans : (c) Data warehouse is a subject oriented
of the project into distinct stage makes it difficult to integrated, time variant and non volatile collection of
respond to changing customer requirements. Therefore, data in support of management decision making
this model is only appropriate when the requirement are process. A data warehouse is a copy of transaction data
well understood and changes will be fairly limited specifically structured for query & analysis.
during the design process 48. In data mining, classification rules are
So answer is option (a)
extracted from ............
43. The quick design of a software that is visible to (a) Data (b) Information
end users leads to ........... (c) Decision tree (d) Database
(a) iterative model (b) prototype model Ans : (c) A decision tree can be used to visually and
(c) spiral model (d) waterfall model explicitly represent decision & division making. In data
Ans : (b) Prototype typically simulates only a few mining, a decision tree describes data but not decisions;
aspects of, and may be completely different from, the rather the resulting classification tree can be an input for
final product. decision making.
Prototyping has several benefits. The software designer 49. Discovery of cross sales opportunities is called
and implementer can get valuable feedback from the
as ...............
user early in the project.
(a) Association (b) Visualization
44. For a program of k variables, boundary value (c) Correlation (d) Segmentation
analysis yields ................ test cases. Ans : (a) Association rule learning is a method for
(a) 4k – 1 (b) 4k discovering intersecting relations between variables in
k
(c) 4k + 1 (d) 2 – 1 large data base. It is intended to identify strong rules
Ans : (c) A program of k variables boundary value disconnected in database using some measures of
analysis yields 4*k + 1 test Robustness testing yields interestingness.
6*k + 1 worst case testing yields 5*k. 50. In Data mining, ................ is a method of
45. The extent to which a software performs its incremental conceptual clustering.
intended functions without failures, is termed (a) STRING (b) COBWEB
as : (c) CORBA (d) OLAD
(a) Robustness (b) Correctness Ans : (b) COBWEB is an in rental system for
(c) Reliability (d) Accuracy hierarchal conceptual clustering. COBWEB
Ans : (c) Reliability is the probability of failure free incrementally organizes observation into a classification
operation of a system over a specified time within a tree. Each nod in classification tree represents a class
specified environment for a specified purpose. (concept) and is labeled by a probalistic concept that
46. An attacker sits between the sender and summarizes the attribute value distribution of objects
receiver and captures the information and classified undo the node.
UGC NET JRF Computer Science August 2016 Paper-II 211 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. August, 2016

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. A ripple counter is a (n): 6. The output of the following circuit
(a) Synchronous Counter
(b) Asynchronous counter
(c) Parallel counter
(d) None of the above
Ans : (b) A ripple counter is an asynchronous: (a) X ⋅Y (b) X + Y
counter where only the first flip-flop is clocked by an (c) X ⊕ Y (d) X ⊕Y
external clock. All subsequent flip-flops are clocked by
Ans : (d) Given circuit is:
the output of the preceding flip-flop. Asynchronous
counters are also called ripple-counters because of the
way the clock pulse ripples its way through the flip-
flops.
2. 8085 microprocessor has _______ bit ALU.
(a) 32 (b) 16
(c) 8 (d) 4 function f = ( x . y ).( x. y )
Ans : (c) 8085 microprocessor has 8 bit ALU. f = ( x . y ) + ( x. y )
3. The register that stores the bits required to f = ( x . y ) + ( x. y )
mask the interrupts is f =x+ y=x⊕ y
(a) Status register
7. Which of the following statements is/are True
(b) Interrupt service register
regarding some advantages that an object-
(c) Interrupt mask register oriented DBMS (OODBMS) offers over a
(d) Interrupt request register relational database?
Ans : (c) Interrupt Mask Register (IMR): This I. An OODBMS avoids the "impedance
register stores the bits required to mask the interrupt mismatch" problem.
inputs. II. An OODBMS avoids the "phantom"
problem.
4. Which of the following in 8085 microprocessor
III. An OODBMS provides higher
performs performance concurrency control than
HL = HL + HL ? most relational database.
(a) DAD D (b) DAD H IV. An OODBMS provides faster access to
(c) DAD B (d) DAD SP individual data objects once they have been
read from disk.
Ans : (b) DAD H: double add HL to HL ⇒ HL = HL +
(a) II and III only (b) I and IV only
HL
(c) I, II, and III only (d) I, III and IV only
5. In ________ addressing mode, the operands Ans : (b) I. An OODBMS avoids the “impedance
are stored in the memory. The address of the mismatch” problem. This is true.
corresponding memory location is given in a II. An OODBMS doesn’t avoids the “Phantom”
register which is specified in the instruction. problem.
(a) Register direct (b) Register indirect III. An OODBMS doesn’t provides higher performance
(c) Base indexed (d) Displacement concurrency control than most relational database since
it is distributed.
Ans : (b) Register indirect addressing means that the
IV. An OODBMS provides faster access to individual
location of an operand is held in a register. It is also data objects once they have been read from disk. This is
called indexed addressing or base addressing. true.

UGC NET JRF Computer Science August 2016 Paper-III 212 YCT
 Search on TG: @apna_pdf
8. The Global conceptual Schema in a distributed are: A → B. C → AB. Which of the following
database contains information about global statements is/are True?
relations. The condition that all the data of the I. The decomposition of R into R1(C, A) and
global relation must be mapped into the R2(A, B) is lossless.
fragments, that is, it must not happen that a II. The decomposition of R into R1(A, B) and
data item which belongs to a global relation R2(B, C) is lossy.
does not belong to any fragment, is called: (a) Only I (b) Only II
(a) Disjointness condition (c) Both I and II (d) Neither I nor II
(b) Completeness condition Ans : (c) Statement - 1
(c) Reconstruction condition R1(C, A) R1 (A, B)
(d) Aggregation condition R1∩R2 = A which is superkey for A
Ans : (b) Completeness Condition: All the data of the So its lossless Join
global relation must be mapped into the fragments; it Statement -2
must not happen that a data item which belongs to a R1(A, B) R1 (B, C)
global relation does not belong to any fragment. R1∩R2 = B which is not superkey for any
9. Suppose database table T1 (P, R) currently has relations so its lossy Join
Both are correct option.
tuples {(10, 5), (15, 8), (25, 6)} and table T2 (A,
C) currently has {(10, 6), (25, 3), (10, 5)}. 11 . Consider the following ORACLE relations:
Consider the following three relational algebra One (x, y) = {<2, 5>, <1, 6>, <1, 6>, <1, 6>, <4,
queries RA1, RA2 and RA3. 8>, <4, 8>}
RA1: T1 T1.P=T2.A T2 where is natural join Two (x, y) = {<2, 55>, <1, 1>, <4, 4>, <1, 6>, <4,
symbol. 8>, <4, 8>}
RA2:T1 T1.P=T2.A T2 where is left outer Consider the following two SQL queries SQ1
join symbol. and SQ2:
RA3: T1 T1.P=T2.A and T1.R= T2.c T2 SQ1: SELECT * FROM One)
The number of tuples in the resulting table of EXCEPT
RA1, RA2 and RA3 are given by: (SELECT * FROM Two);
(a) 2, 4, 2 respectively SQ2: SELECT * FROM One)
(b) 2, 3, 2 respectively EXCEPT ALL
(c) 3, 3, 1 respectively (SELECT * FROM Two);
For each of the SQL queries, what is the
(d) 3, 4, 1 respectively
cardinality (number of rows) of the result
Ans : (d) RA1: T1 T1.P=T2.A T2 where is natural obtained when applied to the instances above?
join symbol. It will result 3 tuples: (a) 2 and 1 respectively
P=A R C (b) 1 and 2 respectively
10 5 6 (c) 2 and 2 respectively
10 5 5 (d) 1 and 1 respectively
25 6 3 Ans : (b) Except clause returns all records present in
RA2:T1 T1.P=T2.A T2 where is left outer join the first relation and absent in the second relation. But
symbol. It will result in 4 tuples. this clause eliminates duplicates tuples.
SQ1: SELECT * FROM One)
P=A R C EXCEPT
10 5 6 (SELECT * FROM Two);
10 5 5 It will result into single tuple (2, 5) because all duplicate
15 8 null tuples will be removed.
25 6 3 Except all returns all records from the first table which
RA3: T1 T1.P=T2.A and T1.R= T2.c T2. It will result in 1 are not present in the second table, leaving the
tuple. duplicates tuples as it is.
SQ2: SELECT * FROM One)
P=A R=C
EXCEPT ALL
10 5 (SELECT * FROM Two);
10. Consider the table R with attributes A, B and It will result into 2 tuples < (2, 5), (1, 6) > because it
C. The functional dependencies that hold on R will not remove duplicate.
UGC NET JRF Computer Science August 2016 Paper-III 213 YCT
 Search on TG: @apna_pdf
12. Which one of the following pairs is correctly Ans : (d) (i) Specialization: is uses top to down
matched in the context of database design? approach and it is opposite to Generalization.
List-I List-II (ii) Generalization: is a bottom-up approach in which
(Database (Definition) two or more entities can be generalized to a higher level
entity if they have some attributes in common.
term)
(iii) Aggregation: It is treated as higher level entity sets
A. Specialization 1. Result of and can participate in relationships.
taking the (iv) Mapping cardinalities: Number of entities to
union of two which another entity can be associated via a relationship
or more set.
disjoint
13. Consider a raster grid having XY-axes in
(lower-level)
positive X-direction and positive upward Y-
entity sets to
direction with Xmax = 10, Xmin = -5, Ymax = 11,
produce a
and Ymin = 6. What is the address of memory
higher-level pixel with location (5, 4) in raster grid
entity set. assuming base address 1 (one)?
B. Generalization 2. Express the (a) 150 (b) 151
number of (c) 160 (d) 161
entities to Ans : (d)
which addr(X, Y) = addr(0, 0) + Y rows × (Xm + 1) + Y(All in
another bytes)
entity can be A(5, 4) = 1 + (5(-5)) × 6 + (4 + 6)
associated
14. Consider a N-bit plane frame buffer with W-bit
via a
relationship wide lookup table with W > N. How many
set. intensity levels are available at a time?
(a) 2N (b) 2W
C. Aggregation 3. Result of N+W
(c) 2 (d) 2N - 1
taking a
subset of a Ans : (a) N-bit colour frame buffer:–
higher-level Colour or gray scales are incorporated into a frame
entity set to buffer rater graphics device by using additional bit
planes. The intensity of each pixel on the CRT is
form a
controlled by a corresponding pixel location in each of
lower-level
the N-bit planes. The binary value from each of the N-
entity set. bit planes is located into corresponding positions in a
D. Mapping 4. An register. The resulting binary number is interpreted as
cardinalities abstraction an intensity level between 0 (dark) and 2n - 1 (full
in which intensity). This is converted into an analog voltage
relationship between 0 and the maximum voltage of the electron gun
sets (along by the DAC, A total of 2n intensity levels are possible.
with their 15. Consider the Breshenham's line generation
associated algorithm for a line with gradient greater than
entity sets) one, current point (xi, yi) and decision
are treated as parameter, di. The next point to be plotted (xi +
higher-level 1, yi + 1) and updated decision parameter, di + 1,
entity sets, for di < 0 are given as _________ .
and can (a) xi +1 = xi + 1
participate in yi + 1 = yi
relationships. di + 1 = di + 2dy
Codes: (b) xi + 1 = xi
A B C D yi + 1 = yi + 1
(a) 4 1 2 3 di + 1 = di + 2dx
(b) 4 3 2 1 (c) xi + 1 = xi
(c) 3 4 1 2 yi + 1 = yi + 1
(d) 2 1 4 2 di + 1 = di + 2(dx - dy)
UGC NET JRF Computer Science August 2016 Paper-III 214 YCT
 Search on TG: @apna_pdf
(d) xi + 1 = xi + 1  2 1 5
yi + 1 = yi + 1 (a)  0,  (b)  , 
 3 6 6
di + 1 = di + 2(dy - dx)
 1
Ans : (b) According to Breshenham's line generation (c)  0,  (d) (0, 1)
 3
algorithm:
xi + 1 = xi Ans : (b) first we will calculate ∆x and ∆y:
yi + 1 = yi + 1 ie ∆x = x2 – x1 = 11 – (-1) = 11 + 1 = 12.
di + 1 = di + 2dx ∆y = y2 – y1 = 1 – 7 = -6
16. A point P(2, 5) is rotated about a pivot point (1, Now P1 = -∆x = -12
P2 = ∆x = 12
2) by 600. What is the new transformed point
P'? P3 = -∆y = 6
(a) (1, 4) (b) (-1, 4) P4 = ∆y = -6
(c) (1, -4) (d) (-4, 1) Q1 = x1 – xmin = -1 – 1 = -2
Q2 = xmax – x1 = 9 – (-1) = 9 + 1 = 10
cos θ − sin θ −t x cos θ + t y sin θ + t x   x  Q3 = y1 – ymin = 7 – 2 = 5
Ans:(b) =  sin θ cos θ −t x sin θ − t y cos θ + t y  ⋅  y  Q4 = ymax – y1 = 8 – 7 = 1
 0 0 1   1  P1, P4 < 0 and P2, P3 > 0
Given, θ = 60 and x = 2, y = 5 then Initially: t1 = 0, t2 = 1
t1 = max(0, Q1/P1, Q4/P4)
 0.5 −0.866 −1× 0.5 + 2 × 0.866 + 1   2 
= max(0, 2/12, 1/-6)
= 0.866 0.5 −1× 0.866 − 2 × 0.5 + 2  ⋅  5  = 1/6
 0 0 1   1  t2 = min(1, Q1/P1, Q4/P4)
 0.5 −0.866 2.232   2   −1.098  = min(1, 10/12, 5/6)

= 0.866 0.5    
0.134  ⋅  5  =  4.366  = 5/6
i.e. ∪ ranges between (1/6, 5/6)
 0 0 1  1   1 
19. Match the following with reference to
Therefore, P' = (-1, 4) Functional programming history:
17. In perspective projection (from 3D to 2D),
objects behind the centre of projection are List-I List-II
projected upside down and backward onto the
A. Lambda 1. Church,
view-plane. This is known as ________ .
calculus 1932
(a) Topological distortion
B. Lambda 2. Wordsworth,
(b) Vanishing point
calculus as 1970
(c) View confusion programming
(d) Perspective foreshortening language
Ans : (c) View confusion: Projects behind the center of C. Lazy 3. Haskel,
the projection are projected upside down and backward evaluation 1990
on to the view plane. Type classes Mecarthy,
D. 4.
18. The Liang-Barsky line clipping algorithm uses 1960
the parametric equation of a line from (x1, y1) Codes:
to (x2, y2) along with its infinite extension which A B C D
is given as: (a) 4 1 3 2
x = x1 + ∆x.u (b) 1 4 2 3
y = y1 + ∆y.u (c) 3 2 4 1
Where ∆x = x2 - x1, ∆y = y2 - y1 and u is the (d) 2 1 4 3
parameter with 0 ≤ u ≤ 1. A line AB with end Ans : (b) (i) Lambda calculus: is a formal system in
points A(-1, 7) and B(11, 1) is to be clipped mathematical logic for expressing computation based
against a rectangular window with xmin = 1, on function abstraction and application using variable
xmax = 9, ymin = 2, and ymax = 8. The lower and binding and substitution. The lambda calculus was
upper bound values of the parameter u for the introduced by mathematician Alonzo church in the
clipped line using Liang-Barsky algorithm is 1930's as part of an investigation into the "foundation of
given as: mathematics (1932)".
UGC NET JRF Computer Science August 2016 Paper-III 215 YCT
 Search on TG: @apna_pdf
Until the 1960's when its relation to programming (b) S → S1 | S2
languages was clarified, the λ-calculus was only a S1 → aS1 | aA1
formalism. To LISP by MeCarthy. S2 → aaS2 | A2
(ii) Lazy evaluation: Was introduced in 1970 by A1 → bA1 | λ
wordsworth.
A2 → bA2 | λ
(iii) Type classes: Was introduced in 1990 by Haskel.
(c) S → S1 | S2
20. Aliasing in the context of programming
S1 → aaaS1 | aA1
languages refers to:
(a) Multiple variables having the same location S2 → aaS2 | A2
(b) Multiple variables having the same identifier A1 → bA1 | λ
(c) Multiple variables having the same value A2 → bA2 | λ
(d) Multiple use of same variable (d) S → S1 | S2
Ans : (a) Aliasing: Describes a situation in which a S1 → aaS1 | A1
data location in memory can be accessed through S2 → aaS2 | aA2
different symbolic names in the program. Thus, A1 → bbA1 | λ
modifying the data through one name implicitly
modifies the value associated with all aliased names, A2 → bbA2 | λ
which may not be expected by the programmer. Ans : (d) Given, L = {anbm | (n + m) is even}
21. Assume that the program 'P' is implementing For (n + m) to be even either n and m both are even or n
parameter passing with 'call by reference'. and m both are odd.
What will be printed by following print So, for n and m to be even, grammar is:
statements in P? S1 → aaS1 | A1
Program P( ) A1 → bbA1 | ∈
{ For n and m odd, grammar is:
x = 10; S2 → aaS2 | aA2
y = 3;
A2 → bbA2 | b
funb (y, x, x); print x; print y;
Now, combine both; then resultant grammar is:
}
funb (x, y, z) S → S1 | S2
{ S1 → aaS1 | A1
y = y + 4; A1 → bbA1 | ∈
z = x + y + z; S2 → aaS2 | aA2
} A2 → bbA2 | b
(a) 10, 7 (b) 31, 3 23. Let Ʃ = {a, b} and language L = {aa, bb}. Then,
(c) 10, 3 (d) 31, 7
the complement of L is
Ans : (b) Inside funb ( ), x will actually refer to y of
(a) {λ, a, b, ab, ba} ∪ {w ∈{a, b}*| w | > 3}
main ( ); and y and z will refer to x of main ( ).
The statement y = y + 4; (b) {a, b, ab, ba} ∪{w ∈{a, b}*| w | ≥ 3}
will result in 14 and statement. (c) {w ∈{a, b}*| w | > 3} ∪{a, b, ab, ba}
z = x + y + z will make
z = 3 + 14 + 14 (d) {λ, a, b, ab, ba} ∪ {w ∈{a, b}*| w | ≥ 3}
= 31 Ans : (d) String generated by language L
(because y and z point to same variable x of main). = {aa, bb} will be even length.
Since z refers to x of main ( ), main will print 31. z will So, complement will be universal set of strings–
be stored back in x = 31 and y will remain as it is, {aa, bb}. i.e. {λ, a, b, ab, ba} and
because there was no change for it. Then y = 3.
strings {w ∈ {a, b}* | |w| ≥ 3},
Printed output is 31, 3.
i.e. string of length greater than or equal to 3.
22. The regular grammar for the language L =
24. Consider the following identities for regular
{anbm | n + m is even} is given by
(a) S → S1 | S2 expressions:
(i) (r + s)* = (s + r)*
S1 → aS1 | A1
(ii) (r*) = r*
A1 → bA1 | λ
(iii) (r* s*) = (r + s)*
S2 → aaS2 | A2
Which of the above identities are true?
A2 → bA2 | λ
UGC NET JRF Computer Science August 2016 Paper-III 216 YCT
 Search on TG: @apna_pdf
(a) (i) and (ii) only After implementing CRC encoder, the encoded
(b) (ii) and (iii) only word sent from sender side is ____ .
(c) (iii) and (i) only (a) 11010110111110
(d) (i), (ii) and (iii) (b) 11101101011011
(c) 110101111100111
Ans : (d) ⇒ (r + s)* will generate any string containing
(d) 110101111001111
r or s or both. We can draw DFA for (r + s)* and it is
same as (s + r)*. It is a regular expression. Ans : (a) Given, message is: 1101011011 and generator
polynomial is G(x) = x4 + x + 1, which is equivalent to
⇒ (r*)* will generate any string containing r and its 10011. Now we add (n - 1) 0's to the LSB of message, if
DFA can be draw easily and it is same as r*. It is also a CRC generator is of n-bits.
regular expression. Therefore, message will be 11010110110000. Now we
⇒ (r* s*)* will generate any string containing r or s divide it by 10011, we will get 1110 as remainder,
or both. We can draw DFA for (r* s*)* and it is same as therefore transmitted message will be:
(r + s)*. It is a regular expression. All option are true. 11010110111110.
25. Suppose transmission rate of a channel is 32 28. A slotted ALOHA network transmits 200 bits
kbps. If there are '8' routes from source to frames using a shared channel with 200 kbps
destination and each packet p contains 8000 bandwidth. If the system (all stations put
bits. Total end to end delay in sending packet P together) produces 1000 frames per second,
is _________ . then the throughput of the system is _______ .
(a) 0.268 (b) 0.468
(a) 2 sec (b) 3 sec
(c) 0.368 (d) 0.568
(c) 4 sec (d) 1 sec
Ans : (c) For pure aloha throughput (S) = Ge-2G
Ans : (a) Each router takes For slotted aloha throughput (S) = Ge-G
8000 (it is maximum at G = 1).
= second
32000 i.e. S = 1* e-1
All 8 routes takes S = 1/e
 8000  S = 1/2.71
= 8×   = 2 second S = 0.368
 32000 
29. An analog signal has a bit rate of 8000 bps and
26. Consider the following statements:
a baud rate of 1000. Then analog signal has
I. High speed Ethernet works on optic fiber. ______ signal elements and carry _____ data
II. A point to point protocol over Ethernet is a elements in each signal.
network protocol for encapsulating PPP (a) 256, 8 bits (b) 128, 4 bits
frames inside Ethernet frames. (c) 256, 4 bits (d) 128, 8 bits
III. High speed Ethernet does not work on Ans : (a)
optic fiber. 1
S=N×
IV. A point to point protocol over Ethernet is a r
network protocol for encapsulating Ethernet N 8000
frames inside PPP frames. ⇒ r= = = 8 bits/bond
S 1000
Which of the following is correct?
Now,
(a) I and II are true; III and IV are false.
⇒ r = log2 L
(b) I and II are false; III and IV are true.
⇒ L = 2r = 28 = 256
(c) I, II, III and IV are true. Therefore, each signal carry 8 bits which has 256
(d) I, II, III and IV are false. signals-elements
Ans : (a) (A). High speed Ethernet works on optic fiber. 30. The plain text message BAHI encrypted with
(B). A point to point protocol over Ethernet is a network RSA algorithm using e = 3, d = 7 and n = 33
protocol for encapsulating frames inside Ethernet and the characters of the message are encoded
frames not for encapsulating Ethernet frames inside PPP using the values 00 to 25 for letters A to Z.
frames. Suppose character by character encryption
27. In CRC checksum method, assume that given was implemented. Then, the Cipher Text
frame for transmission is 11010111011 and the message is
generator polynomial is (a) ABHI (b) HAQC
G(x) = x4 + x + 1. (c) IHBA (d) BHQC
UGC NET JRF Computer Science August 2016 Paper-III 217 YCT
 Search on TG: @apna_pdf
Ans: (b) Using RSA algorithm: Ans : (c) The minimum spanning tree of such a graph
If we want to get the ciphertext of BAHI using RSA is:
algorithm, we will get:
(i) Pe mod n
(ii) Cd mod w weight of the minimum spanning trees
B → 23 = 8 mod 33 = 8 = H = 4 |2 - 1| + 4 |3 - 2| + 4 |4 - 3| + .... + 4 |n - (n - 1)|
A → 13 = 1 mod 33 = 1 = A = 4 + 4 + 4 + .... 4
= 4n - 4 = 4(n - 1)
H → 83 = 17 mod 33 = 17 = Q
I → 93 = 3 mod 33 = 3 = C 34. A priority queue is implemented as a max-
So, the; ciphertent will be HAQC. heap. Initially, it has five elements. The level-
31. Consider the problem of a claim <A1, A2, A3, order traversal of the heap is as follows:
A4> of four matrices. Suppose that the 20, 18, 15, 13, 12
dimensions of the matrices A1, A2, A3, and A4 Two new elements '10' and '17' are inserted in
are 30 × 35, 35 × 15, 15 × 5 and 5 × 10 the heap in that order. The level-order
respectively. The minimum number of scalar traversal of the heap after the insertion of the
multiplications needed to compute the product elements is:
A1 A2 A3 A4 is ________ . (a) 20, 18, 17, 15, 13, 12, 10
(a) 14875 (b) 21000 (b) 20, 18, 17, 12, 13, 10, 15
(c) 9375 (d) 11875 (c) 20, 18, 17, 10, 12, 13, 15
Ans : (c) Given, dimensions of the matrices A1, A2, A3 (d) 20, 18, 17, 13, 12, 10, 15
and A4 are 30 × 35, 35 × 15, 15 × 5 and 5 × 10 Ans : (d) Given level order of max-heap tree;
respectively.
20, 18, 15, 13, 12
We have five possible orders to perform this matrix
multiplication. Now we have to find the one which will
have minimum number of matrix multiplication.

Now, 10 and 15 are inserted, tree will be:

Therefore, minimum number of multiplications possible

in order (A1(A2A3)) A4 = 9375
32. Consider a hash table of size m = 10000, and
Now there is a need to apply max-heapify. Hence,
the hash function h(K) = floor (m(KA mod 1))
for A = ( 5 -1)/ 2. The key 123456 is mapped
to location _________ .
(a) 46 (b) 41
(c) 43 (d) 48
Ans : (b) Given,
level-order traversal is:
h(k) =  m( KA mod1)  20, 18, 17, 13, 12, 10, 15
h(123456) = 10000(123456 × 0.61803mod1)  35. If there are n integers to sort, each integer has
= 10000(0.0041151)  d digits, and each digit is in the set {1, 2, .... k},
radix sort can sort the numbers in:
= (41.151)  = 41 (a) O(k(n + d)) (b) O(d(n + k))
33. Consider a weighted complete graph G on the (c) O((n + k)|gd) (d) O((n + d)|gk)
vertex set {v1, v2, .... vn} such that the weight of Ans : (b) Radix sort complexity is O(wn) for n keys
the edge (vi, vj) is 4|i - j|. The weight of which are integers of words size w. If there are n
minimum cost spanning tree of G is: integers to sort, each integer has d digits, and each digit
(a) 4n2 (b) n is in the set {1, 2,….,k} radix sort can sort the numbers
(c) 4n - 4 (d) 2n - 2 in O(d(n + k)).
UGC NET JRF Computer Science August 2016 Paper-III 218 YCT
 Search on TG: @apna_pdf
36. Match the following: (b) Composition is a strong type of association
between two classes with partial ownership.
List-I List-II
(c) Composition is a weak type of association
A. Prim's 1. O(V2E) between two classes with partial ownership.
algorithm (d) Composition is a weak type of association
B. Bellman- 2. O(VElgV) between two classes with strong ownership.
Ford Ans : (a) Composition is a strong type of association
algorithm between two classes with full ownership. In this
C. Floyd- 3. O(ElgV) relationship child objects does not have their lifecycle
Warshall without parent object. If a parent object is deleted, all its
algorithm child objects will also be deleted.
D. Johnson's 4. 3
O(V ) 40 . Which of the following is not a correct
algorithm statement?
(a) Every class containing abstract method must
Where V is the set of nodes and E is the set of
be declared abstract.
edges in the graph.
(b) Abstract class can directly be initiated with
Codes: 'new' operator.
A B C D (c) Abstract class can be initiated.
(a) 1 3 4 2 (d) Abstract class does not contain any definition
(b) 1 3 2 4 of implementation.
(c) 3 1 4 2 Ans : (b) Abstract class cannot be directly initiated with
(d) 3 1 2 4 new operator, since abstract class does not contain any
Ans : (c) Prim’s algorithm to final minimum spanning definition of implementation it is not possible to create
tree in a weighted graph has time complexity O(E | log | an abstract object.
V). 41. Which of the following tag in HTML is used to
Bellman for algorithm to find single source shortest surround information, such as signature of the
path in a weighted graph has time complexity O(|V| |E|) person who created the page?
3 (a) <body> </body>
= O(|V| ).
Floyd-warshall algorithm to find all pair’ shortest path (b) <address> </address>
in a graph has time complexity O(|V|3). (c) <strong> </strong>
Johnson’s algorithm to find all pair shortest path in a (d) <em> </em>
2 Ans : (b) The <address> tag is used to surround
graph has time complexity O(|V| log |V| + |V| |E|).
information, such as the signature of the person who
37. Constructors have _______ return type.
created the page or the address of the address of the
(a) void (b) char organization the page is about.
(c) int (d) no The <body> tag defines the document is body.
Ans : (d) A constructor resembles an instance method, The <em> tag defines emphasized text.
but it differs form a method since it has no explicit The <strong> tag defines important text.
return type, it is not implicity inherited and it usually 42. Java uses threads to enable the entire
has different rules for scope modifiers.
environment to be _________ .
38. Method over-riding can be prevented by using (a) Symmetric (b) Asymmetric
final as a modifier at (c) Synchronous (d) Asynchronous
(a) the start of the class. Ans : (d) Java uses threads to enable the entire
(b) the start of method declaration. environment to be asynchronous. This helps in
(c) the start of derived class. reducing inefficiency by preventing the waste of CPU
(d) the start of the method declaration in the cycles.
derived class. 43. An Operating System (OS) crashes on the
Ans : (b) To disallow a method from being overridden, average once in 30 days, that is, the Mean Time
specify final as a modifier at the start of its declaration. Between Failures (MTBF) = 30 days. When this
Methods declared as final cannot be overridden. happens, it takes 10 minutes to recover the OS,
39. Which of the following is a correct statement? that is, the Mean Tie To Repair (MTTR) = 10
(a) Composition is a strong type of association minutes. The availability of the OS with these
between two classes with full ownership. reliability figures is approximately:
UGC NET JRF Computer Science August 2016 Paper-III 219 YCT
 Search on TG: @apna_pdf
(a) 96.97% (b) 97.97% (iv) Staged delivery: is an evolutionary software
(c) 99.009% (d) 99.97% release.
Ans : (d) System crashes once in 30 days and need 10 (v) Water fall model: sequential (non-iterative design
minutes to get repaired. Either convert 30 days into process.
minute fraction of time system is not available = (10/(30 45. Match each software term in List-I to its
× 24 × 60) × 100 = ⋅023% description in List-II:
Availability = 100 – 0.023 = 99.97%
44. Match each software lifecycle model in List-I to
List-I List-II
its description in List-II:
A. Wizards 1. Forms that
provide
List-I List-II structure for
A. Code-and- 1. Assess risks a document
Fix at each step; B. Templates 2. A series of
do most commands
critical action grouped
first. into a single
B. Evolutionary 2. Build an command
prototyping initial small C. Macro 3. A single
requirement program
specifications, that
code it, then incorporates
"evolve" the most
specifications commonly
and code as used tools
needed.
D. Integrated 4. Step-by-
C. Spiral 3. Build initial Software step guides
requirement in
specification application
for several
software
releases, then
design-and- E. Software 5. Bundled
code in Suite group of
sequence. software
programs
D. Staged 4. Standard
Delivery phases Codes:
(requirements, A B C D E
design, code, (a) 4 1 2 3 5
test) in order (b) 2 1 4 3 5
E. Waterfall 5. Write some (c) 4 5 2 1 3
code, debug (d) 5 3 2 1 4
it, repeat (i.e. Ans : (a) Correct matching is:
adhoc) (a)-(iv), (b)-(i), (c)-(ii), (d)-(iii), (e)-(v)
Codes:
46. The ISO quality assurance standard that
A B C D E
applies to software Engineering is
(a) 5 2 1 3 4
(a) ISO 9000: 2004
(b) 5 3 1 2 4
(b) ISO 9001: 2000
(c) 4 1 2 3 5
(c) ISO 9002: 2001
(d) 3 5 1 2 4
(d) ISO 9003: 2004
Ans : (a) (i) Code and fix: write some code, debug it
repeat. Ans : (b) The 9001 : 2000 is the quality assurance
(ii) Evaluation prototype: system develop standard that applies to software engineering. The
incrementally. standard contains 20 requirement that must be present
for an effective quality assurance system.
(iii) Spiral model: access risk at each step.
UGC NET JRF Computer Science August 2016 Paper-III 220 YCT
 Search on TG: @apna_pdf
47. Which of the following are external qualities of Which of the following options is correct with
a software product? reference to above statements?
(a) Maintainability, reusability, portability, (a) Only I is correct
efficiency, correctness. (b) Only II is correct
(b) Correctness, reliability, robustness, (c) Both I and II are correct
efficiency, usability. (d) Both I and II are wrong
(c) Portability, interoperability, maintainability, Ans : (c) Both statements are correct.
reusability.
50. Consider a system which have 'n' number of
(d) Robustness, efficiency, reliability,
maintainability, reusability. processes and 'm' number of resources types.
The time complexity of the safety algorithm,
Ans : (b) External qualities of a software product:
which checks whether a system is in safe state
- Correctness or not, is of the order of:
- Reliability (a) O(mn) (b) O(m2n2)
- Robustness
(c) O(m2n) (d) O(mn2)
- Efficiency
Ans : (d) Time complexity of banker’s algorithm to
- Usability
deadlock avoidance is O(mn2).
Internal qualities of a software product
- Maintainability 51. An operating system supports a paged virtual
- Reusability memory, using a central processor with a cycle
- Portability time of one microsecond. It costs an additional
- Interoperability one microsecond to access a page other than
the current one. Pages have 1000 words, and
48. Which of the following is/are CORRECT
the paging device is a drum that rotates at 3000
statement(s) about version and release? revolutions per minute and transfers one
I. A version is an instance of a system, which is million words per second. Further, one percent
functionally identical but non-functionally of all instructions executed accessed a page
distinct from other instances of a system. other than the current page. The instruction
II. A version is an instance of a system, which is that accessed another page, 80% accessed a
functionally distinct in some way from other page already in memory and when a new page
system instances. was required, the replaced page was modified
III. A release is an instance of a system, which 50% of the time. What is the effective access
is distributed to users outside of the time on this system, assuming that the system is
development team. running only one process and the processor is
IV. A release is an instance of a system, which idle during drum transfers?
is functionally identical but non-functionally (a) 30 microseconds (b) 34 microseconds
distinct from other instances of a system. (c) 60 microseconds (d) 68 microseconds
(a) I and II (b) II and IV
Ans : (b) Effective access time
(c) I and IV (d) II and III
= 0.99 (1 µsec + 0.008 × 2 µsec) + 0.002 ×
Ans : (d) Version- An instance of a system which is (10000 µsec + 1000 µsec) + 0.001 × (1000 µsec + 1000
functionally distinct in same way from other system µsec)
instances.
= (0.99 + 0.016 + 22.0 + 11.0) µsec
Release- An instance of a system which is distributed
= 34.0 µsec
to users outside of the development team.
49. The Unix Operating System Kernel maintains 52. Consider the following page reference string:
two key data structures related to processes, 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
the process table and the user structure. Now, Which of the following options, gives the
consider the following two statements: correct number of page faults related of LRU,
I. The process table is resident all the time and FIFO, and optimal page replacement
contain information needed for all processes, algorithms respectively, assuming 05 page
even those that are not currently in memory. frames and all frames are initially empty?
II. The user structure is swapped or paged out (a) 10, 14, 8
when its associated process is not in memory, (b) 8, 10, 7
in order not to waste memory on information (c) 7, 10, 8
that is not needed. (d) 7, 10, 7
UGC NET JRF Computer Science August 2016 Paper-III 221 YCT
 Search on TG: @apna_pdf
Ans : (b) (1) LRU algorithm: Which of the following is correct?
(a) L1 is regular language and L2 is not regular
language.
(b) L1 is not regular language and L2 is regular
language.
(c) Both L1 and L2 are regular languages.
Total number of page fault = 8 (d) Both L1 and L2 are not regular languages.
(2) FIFO algorithm: Ans : (a) L1 = {uwwRv|u, w, v∈ {a, b}+} is regular
because it can be described the regular expression
L1 = (a + b)+ (aa + bb) (a + b)+
L2 = {uwwRv|u, w, v ∈{a, b}+, |u| ≥ |v|} is not regular,
because we need a stack to compare length of |u| ≥ |v|.
56. Given a Turing Machine
Total number of page fault = 10 M = ({q0, q1}, {0, 1}, {0, 1, B}, δ, B, {q1})
(3) Optimal algorithm: Where δ is a transition function defined as
δ(q0, 0) = (q0, 0, R)
δ(q0, B) = (q1, B, R)
The language L(M) accepted by turing
machine is given as:
(a) 0* 1* (b) 00*
Total number of page fault = 7
(c) 10* (d) 1*0*
53. Consider a file currently consisting of 50 Ans : (b) This Turing Machine accept 0*.
blocks. Assume that the file control block and 00* is subset of 0*. So, Turing Machine accepts all
the index block is already in memory. If a strings of 00*. The only string except 00* is ∈ accepted
block is added at the end (and the block by this Turing Machine.
information to be added is stored in memory), 57. Let G = (V, T, S, P) be a context-free grammar
then how many disk I/O operations are
such that every one of its productions is of the
required for indexed (single-level) allocation
form A → v, with |v| = k > 1. The derivation
strategy?
tree for any string W ∈ L(G) has a height such
(a) 1 (b) 101
that
(c) 27 (d) 0
(| W | −1)
Ans : (a) According to question file control block and (a) h <
the index block is already in memory. So, 1, 3 and 1, K −1
I/O disk operations are required for contiguous, linked (b) log k | W | ≤ h
and indexed allocation respectively. (| W | − 1)
(c) log k | W | < h <
54. An experimental file server is up 75% of the K −1
time and down for 25% of the time due to
(| W | − 1)
bugs. How many does this file server have to be (d) log k | W | ≤ h ≤
K −1
replicated to give an availability of at least
99%? Ans : (d) The derivation tree for any string w ∈ L(G)
(a) 2 (b) 4 has a height such that
(c) 8 (d) 16 (| w | −1)
log k | w |≤ h ≤
Ans : (b) With K being the number of servers, we have k −1
(1/4)K < 0.01, expressing the worst situation, when all 58. Which of the following is not used in standard
servers are down, should happen at most (1/100) of the JPEG image compression?
time. (a) Huffman coding
This gives us K = 4. (b) Runlength encoding
55. Given the following two languages: (c) Zig-zag scan
L1 = {u w w v | u , v, w ∈ {a, b} }
R + (d) K-L Transform
Ans : (d) K-L theorem is not used in image
L2 = {u w w R v | u , v, w ∈ {a, b}+ ,| u | ≥ | v |}
compression.
UGC NET JRF Computer Science August 2016 Paper-III 222 YCT
 Search on TG: @apna_pdf
59. Which of the following is a source coding (ii) Assignment problem is a special case of
technique? transportation problem.
(a) Huffman coding (b) Arithmetic coding (iii) Assignment problem requires that only one
(c) Run-length coding (d) DPCM activity be assigned to each resource.
Which of the following options is correct?
Ans : (d) DPCM is differential pulse code modulation
(a) (i) and (ii) only (b) (i) and (iii) only
which convert source analog into digital signal (i.e.
(c) (ii) and (iii) only (d) (i), (ii) and (iii)
source coding).
Ans : (d) Assignment problem is special case of
60. If the histogram of an image is clustered
transportation problem. It requires that only one activity
towards origin on X-axis of a histogram plot be assigned to each resource and it can be used to
then it indicates that the image is minimize the cost. All statements are correct.
(a) Dark (b) Good contrast 64. What are the following sequence of steps taken
(c) Bright (d) Very low contrast in designing a fuzzy logic machine?
Ans : (a) If the histogram of an image is clustered (a) Fuzzification → Rule evaluation →
toward origin on x-axis of a histogram plot then it Defuzzification
indicates that the image is dark. (b) Fuzzification → Defuzzification → Rule
If the histogram of an image is clustered towards origin evaluation
on y-axis of a histogram plot then it indicates that the (c) Rule evaluation → Fuzzification →
image is bight. Defuzzification
61. Consider the following linear programming (d) Rule evaluation → Defuzzification →
problem: Fuzzification
Max, z = 0.50x2 - 0.10x1 Ans : (a) Fuzzification → Rule evaluation →
Subject to the constraints Defuzzification
2x1 + 5x2 ≤ 80 The process of fuzzy reasoning is incorporated into
x1 + x2 ≤ 20 what is called a Fuzzy Inferening system.
and x 1, x 2 It involves three steps –
1. Fuzzification
The total maximum profit (z) for the above
2. Rule evaluation
problem is:
3. Defuzzification
(a) 6 (b) 8
(c) 10 (d) 12 65 . Which of the following 2 input Boolean logic
Ans : (b) when, functions is linearly inseparable?
x2 = 16 and x2 = 0 (i) AND (ii) OR
(iii) NOR (iv)XOR
then Max z = 8
(v) NOTXOR
62. Consider the following statements: (a) (i) and (ii) (b) (ii) and (iii)
(i) If primal (dual) problem has a finite optimal (c) (iii), (iv) and (v) (d) (iv) and (v)
solution, then its dual (primal) problem has a Ans : (d) XOR is linearly inseparable, if XOR is, then
finite optimal solution. swapping the labels on the points will not alter the
(ii) If primal (dual) problem has an unbounded structure of the space, and NOT XOR is just XOR with
optimum solution, then its dual (primal) has no the 1’s swapped with 0’s and vice-versa.
feasible solution at all. 66. Let R and S be two fuzzy relations defined as
(iii) Both primal and dual problems may be y1 y2 z1 z2 z3
infeasible. x1  0.7 0.5  y1 0.9 0.6 0.2 
R=  and S = 
Which of the following is correct? x 2  0.8 0.4  y2  0.10.7 0.5 
(a) (i) and (ii) only (b) (i) and (iii) only
Then, the resulting relation, T, which relates
(c) (ii) and (iii) only (d) (i), (ii) and (iii)
elements of universe of X to elements of
Ans : (d) These are fundamental duality theorem. All universe of Z using max-product composition is
options are correct. given by
63. Consider the following statements: z1 z2 z3
x1  0.68 0.89 0.39 
(a) T = 
x2 0.76 0.72 0.32 
(i) Assignment problem can be used to
minimize the cost.
UGC NET JRF Computer Science August 2016 Paper-III 223 YCT
 Search on TG: @apna_pdf
z1 z3
z2 Ans : (d) It displays the MDI client window. An MDI
x  0.68 0.89 0.39 
(b) T = 1  application does not display output in the client areas of
x2 0.72 0.76 0.32  the frame window.
z1 z2 z3
69. Which of the following statement(s) is/are True
x  0.63 0.42 0.35 
(c) T = 1 
x2 0.72 0.48 0.20 
regarding 'nice' command of UNIX?
I. It is used to set or change the priority of a
z1 z2 z3
x  0.05 0.35 0.14  process.
(d) T = 1 
x2  0.04 0.28 0.16 
II. A process's nice value can be set at the time
of creation.
Ans : (c) By max-min composition: III. 'nice' takes a command line as an
µT(x1, z1) = max (min(0.7, 0.9), min(0.5, 0.1)) argument.
= 0.7 (a) I, II only (b) II, III only
and the rest (c) I, II, III (d) I, III only
z1 z2 z3
Ans : (c) A process’s nice value can be set at the time
x  0.7 0.6 0.5 
T= 1 of creation with nice command and adjusted later with
x2  0.8 0.6 0.4 
renice command.
and by max-product composition: (i) To set or change the priority of a process.
µT(x2, z2) = max ((0.8, 0.6), (0.4, 0.7)) = 0.48 (ii) It takes a command line as an argument.
z1 z2 z3
(iii) It’s value can be set at the time of creation.
x  0.63 0.42 0.35 
T= 1 70.
x2 0.72 0.48 0.20 
Let v(x) mean x is a vegetarian, m(y) for y is
meat, and e(x, y) for x eats y. Based on these,
67. Consider the following operations to be consider the following sentences:
performed in Unix: I. ∀xv(x) ⇔ (∀ye(x, y) ⇒ ¬m(y))
"The pipe sorts all files in the current directory
II. ∀xv(x) ⇔ (¬(∃y m(y) ∧ e(x, y)))
modified in the month of "June" by order of
size and prints them to the terminal screen. III. ∀xv(∃y m(y) ∧ e(x, y)) ⇔ ¬v(x)
The sort option skips ten fields then sorts the One can determine that
lines in numeric order." (a) Only I and II are equivalent sentences
Which of the following Unix command will (b) Only II and III are equivalent sentences.
perform above set of operation? (c) Only I and III are equivalent sentence.
(a) Is - l |grep "June" | sort + 10n
(d) I, II, and III are equivalent sentences.
(b) Is - l |grep "June" | sort + 10r
Ans : (d) = ∀xu(x) ⇔ (∀ye(x, y) ⇒ ¬m(y))
(c) Is - l |grep -v "June" | sort + 10n
(d) Is - l |grep -n "June" | sort + 10x = ∀xu(x) ⇔ (¬(∃y m(y) ∧ e(x, y)))
Ans : (a) Correct unix command is - Is - l |grep "June" | = ∀x(∃y m(y) ∧ e(x, y)) ⇔ ¬u(x)
sort + 10n. = ∀x(¬(∀y m(y) ⇒ e(x, y)) ⇔ ¬u(x)
68. Which of the following statements is incorrect
So, all statements are equivalent.
for a Windows Multiple Document Interface
71. Match each Artificial Intelligence term in List-
(MDI)?
(a) Each document in an MDI application is I that best describes a given situation in List-II:
displayed in a separate child window within List-I List-II
the client area of the application's main A. Semantic 1. Knowledge
window. Network about what to
(b) An MDI application has three kinds of do as
windows namely a frame window, an MDI opposed to
how to do it.
client window and number of child windows.
B. Frame 2. A premise of
(c) An MDI application can support more than
a rule that is
one kind of document.
not concluded
(d) An MDI application displays output in the
by any rule.
client area of the frame window.
UGC NET JRF Computer Science August 2016 Paper-III 224 YCT
 Search on TG: @apna_pdf
C. Declarative 3. A method of 73. Criticism free idea generation is a factor of
knowledge knowledge _________.
representation (a) Decision Support System
that uses a (b) Group Decision Support System
graph. (c) Enterprise Resource Support System
D. Primitive 4. A data (d) Artificial Intelligence
structure Ans : (b) Criticism free idea generation is a factor of
representing group decision support system.
stereotypical 74. Consider the following logical inferences:
knowledge. I1: If it is Sunday then school will not open.
Codes: The school was open.
A B C D Inference: It was not Sunday.
(a) 4 1 2 3 I2: If it is Sunday then school will not open.
(b) 4 3 1 2 It was not Sunday.
(c) 4 3 2 1 Inference: The school was open.
(d) 3 4 1 2 Which of the following is correct?
Ans : (d) A semantic network represents semantic (a) Both I1 and I2 are correct inferences.
relations between concepts. This is often used as a form (b) I1 is correct but I2 is not a correct inference.
of knowledge representation. (c) I1 is not correct but I2 is a correct inference.
(d) Both I1 and I2 are not correct inferences.
A frame is a data-structure for representing a
stereotyped situation, like being in a certain kind of Ans : (b) Let p : It is Sunday
living room. q : School will not open
Declarative knowledge refers to factual knowledge and Then
information that a person knows. I1 : p→q
A procedural knowledge, on the other hand, is ¬q
knowing how to perform certain activities. ∴ ¬p
Primitive is premise of a rule that is not concluded by It is true, since contrapositive is also true.
any rule.
= ((p → q) ∧ ¬p) → ¬p
72. In Artificial Intelligence, a semantic network
= (¬(¬p ∨ q) ∨ q) ∨ ¬p
(a) is a graph-based method of knowledge
= p ∧ ¬q ∨ q ∨ ¬p
representation where nodes represent
concepts and arcs represent relations between = p ∨ q¬p = True (tautology)
concepts. I 2: p→q
(b) is a graph-based method of knowledge ¬p
representation where nodes represent
∴ ¬q
relations between concepts and arcs represent
concepts. = ((p → q) ∧ ¬p) → q
(c) represents an entity as a set of slots and = (¬(¬p ∨ q) ∨ p) ∨ ¬q
associated rules. = (p ∧ ¬q) ∨ p ∨ ¬q
(d) is a subset of first-order logic.
= p ∧ ¬q = Not tautology but contingency.
Ans : (a) In Artificial Intelligence is a graph-based
method of knowledge representation where nodes 75. Which formal system provides the semantic
represent concepts and arcs represent relations between foundation for Prolog?
concepts. In other words Semantic Network (a) Predicate calculus (b) Lambda calculus
representation nodes represents concepts, instances or (c) Hoare logic (d) Propositional logic
events and link represents relationship between nodes, Ans : (a) Pure prolog is based on a subset of first-order
such as is-a, part-of, kind-of, interactive relations. predicate logic, horn clauses which is Turing Complete.

UGC NET JRF Computer Science August 2016 Paper-III 225 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2017

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. Consider a sequence F00 defined as : (iii) Axiom is a noun, which means a self evident
F00(0) = 1, F00(1) = 1 truth that requires no proof or universally
accepted principle or rule.
10 * F00 ( n - 1) + 100
F00 ( n ) for n³2 (iv) Conjecture is a noun, which means the formation
F00 ( n - 2 ) or expression of an opinion or theory without
Then what shall be the set of values of the sufficient evidence for proof i.e., an opinion base
sequence F00 ? on some past experience.
(a) (1, 110, 1200) 3. The functions mapping R into R are defined
(b) (1, 110, 600, 1200) as :
(c) (1, 2, 55, 110, 600, 1200) 1
(d) (1, 55, 110, 600, 1200) f ( x ) = x 3 - 4x,g ( x ) = 2 andh ( x ) = x4
x +1
Ans : (a) F00(0) = 1, F00(1) = 1 Then find the value of the following composite
F00(n) = 10*F00(n – 1) + 100 functions :
F00(2) = (10*F00(1) + 100)/F00(0) h0g(x) and h0g0f(x)
= (10*1 + 100)/1 = 110 (a) (x2 + 1)4 and [(x3 – 4x)2 +1]4
F00(3) = 10*F00(2) + 100)/F00(1) (b) (x2 + 1)4 and [(x3 – 4x)2 + 1]–4
= (10*110 + 100)/1 = 1200. (c) (x2 + 1)–4 and [(x2 – 4x)2 + 1]4
2. Match the following : (d) (x2 + 1)–4 and [x3 – 4x)2 + 1]–4
List-I List-II 1
Ans : (d) F (x) = x3 – 4x, g(x) = 2 , h (x) = x4
A. Absurd i. Clearly impossible x + 1
being contrary to  1 
some evident truth Then h0g (x) = h(g(x)) = h  2 
 x +1
B. Ambiguous ii. Capable of more 4
 1 
= ( x 2 + 1)
than one 1 −4
=  2  =
interpretation or  ( x ) + 1  ( x 2 + 1) 4
meaning  
C. Axiom iii. An assertion that is Then h g
0 0 f (x) = h (g0f(x)=h(gf(x))) = h (g(x3–
accepted and used 4x))
4
without a proof    
1 1
D. Conjecture iv. An opinion h(g(x –4x)) = h 
3 = 
preferably based on  ( x 3 − 4x ) 2 + 1   ( x 3 − 4x ) 2 + 1 
   
some experience or
= ((x3–4x)2 + 1)–4
wisdom
4. How many multiples of 6 are there between the
Codes :
A B C D following pairs of numbers?
(a) i ii iii iv 0 and 100 and–6 and 34
(b) i iii iv ii (a) 16 and 6 (b) 17 and 6
(c) ii iii iv i (c) 17 and 7 (d) 16 and 7
(d) ii i iii iv Ans : (c)
Ans : (d) (i) Number of multiples of 6 between 1 to
(i) Absurd is an adjective, which means utterly or 100 = 100  = 16. Since range start from 0 and 0 is
 6 
obviously senseless, illogical or untrue i.e.,  
contrary to all reason or common sense or evident multiple of 6.
truth. (ii) Number of multiples of 6 between 0 to
(ii) Ambiguous is an adjective, which means open to  34 
or having several possible meaning or inter- =   + 1(for 0) = 5 + 1 = 6.
pretations or structure. 6

UGC NET JRF Computer Science June 2017 Paper-II 226 YCT
 Search on TG: @apna_pdf
Since range start from -6 and -6 is also multiple of 6. 7. ECL is the fastest of all families. High speed in
So, total multiple of 6 = 6 + 1 = 7. So, 17 and 7 are ECL is possible because transistors and used in
multiples of 6 for both pairs respectively. difference amplifier configuration, in which
they are never driven into ........
5. Consider a Hamiltonian Graph G with loops or
(a) Race condition (b) Saturation
parallel edges and with V ( G ) = n ≥ 3 . Then (c) Delay (d) High impedance
which of the following is true? Ans : (b) ECL is fastest among the three because the
n transistors are used in difference amplifier
(a) deg ( v ) ≥ for each vertex v. configuration, in which they are never driven in
2 saturation and there by the storage time is eliminated.
1 8.
(b) E ( G ) ≥ ( n − 1)( n − 2 ) + 2 A binary -bit down counter uses J-K flip-flops,
2 FFi with inputs Ji, Ki and outputs Qi, i = 0, 1, 2
(c) deg ( v ) + deg ( w ) ≥ n whenever v and w are respectively. The minimized expression fro the
not connected by an edge. input from following, is
(d) All of the above I. J0 = K0 = 0
Ans : (d) For hamiltonian graph 'G' with are loops or II. J 0 = K0 = 1
parallel edges with |v (G)| = n ≥ 3 then: III. J1 = K1 = Q0
• According to ore's theorem sum of degree of every IV. J1 = K1 = Q0
non-adjacent pair of vertices i.e., deg (v) +d (w) must be V. J2 = K2 = Q1 Q0
greater than equal to n(total number of vertices). VI. J2 = K2 = Q1 Q0
• According to Dirac's theorem degree of every vertex
must be greater than n/2. (a) I, III, V (b) I, IV, VI
(c) II, III, V (d) II, IV, VI
• Since according to Dirac's theorem
deg(v)+ deg (w)≥ n ......................(i) Ans : (d) 3 bit down counter using J-K flip-flop:
Hence |E|≤|E(G–{u,v})| + deg G (v) + deg G (w)
 n − 2
≤   + n using equation (i)
 2 

≤
( n − 2 )( n − 3) + n
2
n − 3n − 2n + 6 + 2n
2
≤ So, J0 = K0 = 1, J1= K1 = Q0 and J2 = K2 = Q1 .Q 0
2
9. Convert the octal number 0.4051 into its
n − 3n − 6
2
≤ equivalent decimal number.
2 (a) 0.5100098 (b) 0.2096
6. In propositional logic if (P → Q) ∧ (R → S) and (c) 0.52 (d) 0.4192
(P ∧ R) are two premises such that Ans : (a) Enter the number = (0.4051)8
(P → Q) ∧ (R → S) decimal equivalent of (0.4051)8 = 0.80 + 4.8–1 + 0.8–2 +
P ∨ R 5.8–3 + 1.8–4 = 0 + 0.5 + 0 + 0.000244140625
Y = 0.51000976562510 = 0.5100098
Y is the premise : 10. The hexadecimal equivalent of the octal
(a) P ∨ R (b) R ∨ S number 2357 is :
(c) Q ∨ R (d) Q ∨ S (a) 2EE (b) 2FF
Ans : (d) Given that premises are (c) 4EF (d) 4FE
(P → Q) ∧ (R → S) Ans : (c) (2357)8 = (010 011 101 111)2
(P ∨ R) now grouping them of 4 from right to left
(P → Q) = ~ P ∨ Q 0100 1110 1111 – so it will be 4EF
(R → Q) = ~ R ∨ S 11. Which of the following cannot be passed to a
(P ∨ R) function in C++?
Q ∨ S :- There will be resolution (rule of inference) b/w (a) Constant (b) Structure
there premises to give conclusion. (c) Array (d) Header file
∼ P & P, R & R' will resolve out and then we contract Ans : (d) Header file cannot passes as to a function in
are disjunction of remaining clauses to given S ∨ Q is C++. While array, content and structure can be passed
correct option. into a function.
UGC NET JRF Computer Science June 2017 Paper-II 227 YCT
 Search on TG: @apna_pdf
12. Which one of the following is correct for The CHAR and VARCHAR types are declared with a
overloaded functions in C++? length that indicates the maximum number of characters
(a) Compiler sets up a separate function for you want to store.
every definition of function The length of a CHAR column is fixed to the length that
(b) Compiler does not set up a separate function you declare when you create the table. VARCHAR (20)
for every definition of function can also hold up to 20 characters but if character is less
(c) Overloaded functions cannot handle different it will take less space so a needs 3 space (for ram)
types of objects b need 20 (for sita).
(d) Overloaded functions cannot have same
17. Integrity constraints ensure that change made
number of arguments
Ans : (a) When you call an overloaded function, the to the database by authorized users do not
compiler determines the most appropriate definition to result into loss of data consistency. Which of
use by comparing the arguments types you used to call the following statement (s) is (are) true w.r.t.
the function with the parameter types specified in the the examples of integrity constraints?
definitions. The process of selecting the most (A) An instructor Id. No. cannot be null,
appropriate overloaded function is called overload provided Instructor Id No. being
resolution. primary key.
13. Which of the following storage classes have (B) No two citizens have same Adhar-Id
global visibility in C/C++? (a) (A), (B) and (C) are true
(a) Auto (b) Extern (b) (A) false, (B) and (C) are true
(c) Static (d) Register (c) (A) and (B) are true; (C) false
Ans : (b) Extern is used for declaring extern variables (d) (A), (B) and (C) are false
in C. This modifier is used will all data types like int, Ans : (c) Integrity means something like "be right" &
float, double etc. It is default storage class of all global consistent. The data in a database must be right and in
variable as well all function. good condition.
14. Which of the following operators cannot be Domain integrity means the definition of a valid set of
overloaded in C/C++? values for and tribute you define data type, length etc.
(a) Bitwise right shift assignment An instructor Id. no. cannot be null, provided instructor
(b) Address of Id. no. being the primary key is valid.
(c) Indirection No. two citizens how same adhar-id. is valid but, the
(d) Structure reference budget of company must be zero is not a valid
Ans : (d) Operators which cannot be overloaded. constraint.
conditional, . (member selection), :: (scope resolution), 18. Let M and N be two entities in an E-R diagram
size of (object size information), *(member selection
with simple single value attributes. R1 and R2
with, pointer to number)
are two relationship between M and N, where
15. If X is a binary number which is power of 2, as :
then the value of X & (X – 1) is : R1 is one-to-many and R2 is many-to-many.
(a) 11.......11 (b) 00.......00 The minimum number of tables required to
(c) 100......0 (d) 000.......1 represent M, N, R1 and R2 in the relational
Ans : (b) Let x = 2 ∧ 3 = 8 = 1000 model are .........
then x – 1 = 7 = 0111 (a) 4 (b) 6
now x & (x – 1) = 0000 (c) 7 (d) 3
(here & is bitwise and) = if both in the compared Ans : (d) Two tables are created or entities M & N and
position of the bits patterns are 1, the bit in the resulting third table is created for relationships R2 (many to
bit pattern is 1, otherwise 0)
many) for R1 no need of separate table (one to many) 1
16. An attribute A of data type varchar (20) has – m relationships.
value 'Ram' and the attribute B of data type The primary key from the one side is placed as a foreign
char (20) has value 'Sita' in oracle. The key in the 'many side'
attribute A has .............. memory spaces and B m – n relationships
has .......... memory spaces.
A new relation is created with primary key
(a) 20, 20 (b) 3, 20
(c) 3, 4 (d) 20, 4 1 – 1 relationship
Ans : (b) The CHAR & VARCHAR type are similar, 19. Consider a schema R(MNPQ) and functional
but differ in the way they are stored and retrieved. They dependencies M → N, P → Q. Then the
also differ in maximum length & in whether railing decomposition of R into R1 (MN) and R2(PQ)
space are retained. is ...........
UGC NET JRF Computer Science June 2017 Paper-II 228 YCT
 Search on TG: @apna_pdf
(a) Dependency preserving but not lossless join
(b) Dependency preserving and lossless join
(c) Lossless join but not dependency preserving
(d) Neither dependency preserving nor lossless (C)
join
Ans : (a) R(MNPQ) and functional dependencies M
→N, P → Q.
Then the decomposition of R into R1 (MN) & R2 (PQ)
here clearly the dependencies are preserved but they are
not lossless as both R1 & R2 cannot be formed back
(D)
again as they do not have a common attribute.
20. The order of a leaf in a B+ tree is the maximum
number of children it can have. Suppose that
block size is 1 kilobyte, the child pointer takes 7 (a) A (b) B
bytes long and search field value takes 14 bytes (c) C (d) D
long. The order of the leaf node is .......... Ans : (b)
(a) 16 (b) 63
(c) 64 (d) 65
Ans : (a) Data pointer = child pointer + search field
value = 14 + 7 = 21B (A)
So max number of children it can have = 1 KB/21B =
1024/21 = 48.76 = 45 (approx)
All other option are greater than 48.
Max heap property failed because parent ≥ child
21. Which of the following is true for computation
time in insertion, deletion and finding
maximum and minimum element in a sorted
array?
(a) Insertion – 0(1), Deletion – 0(1), Maximum – (B)
0(1), Minimum – 0(1)
(b) Insertion – 0(1), Deletion – 0(1), Maximum –
0(n), Minimum – 0(n)
valid max heap because every parent ≥ child
(c) Insertion – 0(n), Deletion – 0(n), Maximum –
0(1), Minimum – 0(1)
(d) Insertion – 0(n), Deletion – 0(n), Maximum –
0(n), Minimum – 0(n)
Ans : (c) Array is sorted, so in worst case(last item (C)
insert) Insertion = O(n), in worst case, last item delete
deletion O(n) maximum and minimum is always at end.
maximum →O(1), minimum → O(1) Here is also failed, max heap property.
22. Which of the following is a valid heap?

(A) (D)

Here is also failed, max heap property.

23. If h is chosen from a universal collection of
hash functions and is used to hash n keys into a
table of size m, where n ≤ m, the expected
(B)
number of collisions involving a particular key
x is less than .........
(a) 1 (b) 1/n
(c) 1/m (d) n/m
UGC NET JRF Computer Science June 2017 Paper-II 229 YCT
 Search on TG: @apna_pdf
Ans : (b) A, D, C are invalid as there are child > parent (a) 216 bytes
case A. 8 > 4, C : 7 > 1, D : 10 > 3 only B is valid heap (b) 216 bytes + TCP header length
parent > children (c) 216 bytes – TCP header length
24. Which of the following statements is false? (d) 215 bytes
(A) Optimal binary search tree construction Ans : (*) There is no maximum limit of data that
can be performed efficiently using application layer can send to TCP, so all options are
dynamic programming. wrong. The default TCP maximum segment size is 536
(B) Breadth-first search cannot be used to answer should be any size.
find connected components of a graph. 28. A packet whose destination is outside the local
(C) Given the prefix and postfix walks of a
TCP/IP network segment is sent to.........
binary tree, the tree cannot be re-
constructed uniquely. (a) File server (b) DNS server
(D) Depth-first-search can be used to find (c) DHCP server (d) Default gateway
the connected components of a graph. Ans : (d) Default gateway serves an access point or IP
(a) A (b) B router that a networked uses to send information to a
(c) C (d) D computer in another network or the internet. Default
Ans : (a) Thought it is not mentioned in the option that simply means that this gateway is used by default,
a given. It is a scenario of universal hashing. unless an application specifies another gateway.
25. Which of the following statements is false? 29. Distance vector routing algorithm is a dynamic
(A) Optimal binary search tree construction can algorithm. The routing tables in distance
be performed efficiently using dynamic vector routing algorithm are updated ..........
programming (a) automatically
(B) Breadth-first search cannot be used to find (b) by server
connected components of a graph (c) by exchanging information with neighbor
(C) Given the prefix and postfix walks of a nodes
binary tree, the tree cannot be re-constructed (d) with back up database
uniquely Ans : (c) A distance vector routing protocol requires
(D) Depth-first-search can be used to find the that a router inform its neighbors about its topology
connected components of a graph changes periodically.
(a) A (b) B
30. In link state routing algorithm after
(c) C (d) D
construction of link state packets, new routes
Ans : (b) BFS and DFS both algorithm are used to find
connected component. In BFS, a search that begins at are computed using :
some particular 'N' will find the entire connected (a) DES algorithm
component V before returning. (b) Dijkstra's algorithm
26. Match the following layers and Protocols for a (c) RSA algorithm
user browsing with SSL : (d) Packets
A. Application of layer i. TCP Ans : (b) Link state protocols, sometimes called
shortest path first are built around a well known
B. Transport layer ii. IP
algorithm from graph theory Dijkstra's shortest path
C. Network layer iii. PPP algorithm, which is a graph search algorithm that solves
D. Datalink layer iv. HTTP the single-source shortest path problem for a graph with
Codes : non-negative edges path costs, producing a shortest path
A B C D tree.
(a) iv i ii iii 31. Which of the following strings would match the
(b) iii ii i iv regular expression : p+[3 – 5]*[xyz]?
(c) ii iii iv i I. p443y II. p6y
(d) iii i iv ii III. 3xyz IV. p35z
Ans : (a) V. p353535x VI. ppp5
(a) application of layer uses HTTP (Hyper text transfer (a) I, III and VI only (b) IV, V and VI only
protocol) (iv) (c) II, IV and V only (d) I, IV and V only
(b) Transport layer uses TCP (Transfer control protocol)
(i) Ans : (d) P + [3 – 5]* [xyz] = p + (3 + 4 + 5)*(x+y+z)
(c) Network layer uses IP (internet protocol) Since P has to be present as the first character of each
(d) Datalink layer (iii) ppp string
27. The maximum size of the data the application (I) p4434 → matched
layer can pass on to the TCP layer below is ...... (II) p64 → not matched since 6 cannot used

UGC NET JRF Computer Science June 2017 Paper-II 230 YCT
 Search on TG: @apna_pdf
(III) 3xyz → not matched string must start with p Ans : (d)
(IV) p35z → matched (A) ⇒ 3AH ⇒ 00111010
(V) p353535X → matched (B) ⇒ 49H ⇒ 01001001
(VI) ppp5 → not matched strings must end with x, or y, 11110001
or z (A) ⇒ F1H, (CY) ⇒ 1, (S) ⇒ 1
32. Consider the following assembly language The carry flag is set since the first operand is less than
instructions : the second operand. Since the result produce the
mov al, 15 negative result sign flag is set.
mov ah, 15 35. Which of the following statements (s) regarding
xor al, al a linker software is/are true?
mov cl, 3 I. A function of a linker is to combine several
shr ax, cl object modules into a single load module.
add al, 90H II. A function of a linker is to replace absolute
adc ah, 0 references in an object module by symbolic
What is the value in ax register after execution references to locations in other modules
of above instructions? (a) Only I (b) Only II
(a) 0270H (b) 01070H (c) Both I and II (d) Neither I nor II
(c) 01E0H (d) 0370H Ans : (a) It is saying that linker replace absolute
Ans : (a) We know that Ax is a register containing al, references in an object which is wrong linker always
ah. generate replaceable address.
MOV al, 15 → AX = al ah 0F H;] 36. There are three processes P1, P2 and P3
sharing a semaphore for synchronizing a
MOV ah, 15 → AX = 0F0FH; variable. Initial value of semaphore is one.
XOR al, al → AX = 0F00H; Assume that negative value of semaphore tells
MOV cl, 3 → AX = 0F00H; cl = 03 us how many processes are waiting in queue.
SHR ax, c1 → AX = 01E0H; shift right 3 times Processes access the semaphore in following
Add al, q o h → AX = 0170H; order :
ADC ah, 0 → AX = 0270H; cy = 1 (carry) (A) P2 needs to access
ADC = add carry (B) P1 needs to access
So output will be AX = 0270H (C) P3 needs to access
(D) P2 exits critical section
33. Consider the following statements related to
(E) P1 exits critical section
compiler construction :
The final value of semaphore will be :
I. Lexical Analysis is specified by context-free
(a) 0 (b) 1
grammars and implemented by pushdown
automata. (c) –1 (d) –2
II. Syntax analysis is specified by regular Ans : (a) Initial value of semaphores S = 1
expressions and implemented by finite- (1) P2 needs to access decrease it to 0 (no one is
state machine. waiting)
Which of the above statement (s) is/are (2) P1 needs to access decreases it to –1 (one process in
correct? waiting)
(a) Only I (b) Only II (3) P3 needs to access decreases it to – 2 (2 process are
(c) Both I and II (d) Neither I nor II waiting
Ans : (d) Both statements are wrong because lexical (4) P2 exits critical section increases it to –1 (one
analyzer uses finite automata so it uses regular process is waiting)
grammar, whose expression will be for example latter (5) P1 exits critical section increases it to –0 (no
(letter + digit)*, where as syntax tree uses context free process is waiting)
grammar which uses pda. 37. In a paging system, it takes 30 ns to search
34. The contents of register (BL) and register (AL) translation Look-a-side buffer (TLB) and 90 ns
of 8085 microprocessor are 49H and 3AH to access the main memory. If the TLB hit ratio
is 70%, the effective memory access time is :
respectively. The contents of Al, the status of
(a) 48ns (b) 147ns
carry flag (CF) and sign flag (SF) after
executing 'SUB AL, BL' assembly language (c) 120ns (d) 84ns
instruction, are Ans : (b) 70% TLB hit ratio 30 ns to search TLB
(a) AL = 0FH; CF = 1; SF = 1 (0.7 * 30) in hit case : to find the page
(b) AL = F0H; CF = 0; SF = 0 0.3*(90 +30) in miss case : to find the page
90 ns to access the data from main memory
(c) AL = F1H; CF = 1; SF = 1
So total time : (0.7 * 30) + (0.3 * (90 + 30) ) + 90 = 147
(d) AL = 1FH; CF = 1; SF = 1
UGC NET JRF Computer Science June 2017 Paper-II 231 YCT
 Search on TG: @apna_pdf
38. Match the following w.r.t. Input/Output 41. Software Engineering is an engineering
management : discipline that is concerned with :
List-I List-II (a) how computer systems work
A. Device i. Extracts (b) theories and methods that underlie computers
controller information from and software systems
the controller (c) all aspects of software production
register and store (d) all aspects of computer-based system
it in data buffer development, including hardware, software
B. Device driver ii. I/O scheduling and process engineering
C. Interrupt iii. Performs data Ans : (c) Software engineering is an engineering
handler transfer discipline that is concerned with all aspects of software
D. Kernel I/O iv. Processing of I/O production.
subsystem request
42. Which of the following is not one of three
Codes :
software product aspects addressed by Mccall's
A B C D
software quality factors?
(a) iii iv i ii
(a) Ability to undergo change
(b) ii i iv iii
(c) iv i ii iii (b) Adaptability to new environments
(d) i iii iv ii (c) Operational characteristics
Ans : (d) (d) Production costs and scheduling
(i) Interrupt handler extracts information from the Ans : (d) Mccalls's software quality factors.
controller register and store it in data buffer. (1) ability to undergo change
(ii) Device driver process the I/O request. (2) Adaptability to new environments
(iii) Device controller performs data transfer. (3) Operational characteristics
(iv) Kernal I/O subsystem perform I/O scheduling. but production costs & scheduling is not the aspect of
39. Which of the following scheduling algorithms quality factor.
may cause starvation? 43. Which of the following statement(s) is/are true
A. First-come-first-served with respect to software architecture?
B. Round Robin S1 : Coupling is a measure of how well the
C. Priority grouped together in a module belong
D. Shortest process next together logically.
E. Shortest remaining time first S2 : Cohesion is a measure of the degree of
(a) A, C and E (b) C, D and E interaction between software modules
(c) B, D, and E (d) B, C and D S3 : If coupling is low and cohesion is high
Ans : (b) then it is easier to change one module
(1) First come – first served – No starvation without affecting others.
(2) Round robin – No starvation (a) Only S1 and S2
(3) Priority – starvation if higher priority process called (b) Only S3
again & again lower priority starves (c) All of S1, S2 and S3
(4) Shortest process next = saturation possible
(d) Only S1
(6) Shortest remaining time first = starvation possible
Ans : (b) S3 is true because, If coupling is low and
40. Distributed operating system consist of : cohesion is high then it is easier to change one module
(a) Loosely coupled O.S. software on a loosely without affecting others.
coupled hardware
44. The prototyping model of software
(b) Loosely coupled O.S. Software on a tightly
coupled hardware development is :
(c) Tightly coupled O.S. Software on a loosely (a) a reasonable approach when requirements are
coupled hardware well-defined
(d) Tightly coupled O.S. software on a tightly (b) a useful approach when a customer cannot
coupled hardware define requirements clearly
(c) the best approach to use for projects with
Ans : (c) A distributed operating system is usually
defined as running on more loosely coupled hardware. large development teams
There is no shared memory, but provides a single (d) a risky model that rarely produces a
memory by tightly coupled software. meaningful product
UGC NET JRF Computer Science June 2017 Paper-II 232 YCT
 Search on TG: @apna_pdf
Ans : (b) Prototype model is a useful approach when a Group Purchasing: Aggregating the demands of small
customer cannot define requirements clearly. buyers to get a large volume. Then negotiate a price.
45. A software design pattern used to enhance the Bartering Online: Exchanging surplus products and
services with the process administered completely
functionality of an object at run-time is :
online by an intermediary. Company receives “points”
(a) Adapter (b) Decorator for its contribution.
(c) Delegatio (d) Proxy
47. .......... refers loosely to the process of set
Ans : (b) In object oriented programming, the decorate
or pattern (also known as wrapper, an alternative automatically analyzing large databases find
naming shared with adapter pattern) is a design pattern useful patterns
that allows behavior to be added to an in dividable (a) Datamining (b) Data warehousing
object, either statically or dynamically, without (c) DBMS (d) Data mirroring
effecting the behavior of other object from the same Ans : (a) The practice of examining large pre-existing
class. databases in order to generate new information is data
46. Match the following : mining. It refers loosely to the process of semi-
automatically analyzing large database to find useful
List-I List-II patterns.
A. Affiliate i. Vendors ask 48. Which of the following is/are true w.r.t.
Marketing partners to place
application of mobile computing?
logos on partner's
site. If customers (A) Traveling of salesman
click, come to (B) Location awareness services
vendors and buy (a) (A) true; (B) false
B. Viral ii. Spread your brand (b) Both (A) and (B) are true
Marketing on the net by word- (c) Both (A) and (B) are false
of-mouth. Receivers (d) (A) false; (B) true
will send your Ans : (b) With respect to application of mobile
information to their computing
friends (1) Traveling of salesman – true
C. Group iii. Aggregating the (2) Location awareness service – true
Purchasing demands of small 49. In 3G network, W-CDMA is also known as
buyers to get a large
UMTS. The minimum spectrum allocation
volume. Then
required for W-CDMA is .............
negotiate a price.
(a) 2 MHz (b) 20 KHz
D. Bartering iv. Exchanging surplus (c) 5 KHz (d) 5 MHz
Online products and
services with the Ans : (d) In 3G network, W-CDMA is also known as
process UMTS. The minimum spectrum allocation required for
administered W-CDMA is 5MHz
completely online by 50. Which of the following statements is/are true
an intermediary. w.r.t. Enterprise Resource planning (ERP)?
Company receives (A) ERP automates and integrates majority of
"points" for its business processes
contribution. (B) ERP provides access to information in a
Codes : Real Time Environment.
A B C D (C) ERP is inexpensive to implement.
(a) i ii iii iv (a) (A), (B) and (C) are false
(b) i iii ii iv (b) (A) and (B) false; (C) true
(c) iii ii iv i (c) (A) and (B) true; (C) false
(d) ii iii i iv (d) (A) true; (B) and (C) are false
Ans : (a) Affiliate Marketing: Vendors ask partners to Ans : (c)
place logos on partner’s site. If customers click, come to (1) ERP automates and integrates majority of business –
vendors and buy. true
Viral Marketing: Spread your brand on the net by (2) ERP provides access to information in a real time
word-of-mouth. Receivers will send your information to environment – true
their friends. (3) ERP is inexpensive to implement – false

UGC NET JRF Computer Science June 2017 Paper-II 233 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2017

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. Which of the following is an interrupt according 4. Match the following :
to temporal relationship with system clock?
Addressing mode Location of operand
(a) Maskable interrupt
(b) Periodic interrupt A. Implied i. Registers which
(c) Division by zero are in CPU
(d) Synchronous interrupt B. Immediate ii. Register specifies
Ans : (d) Synchronous Interrupt : The source of the address of the
interrupt is in phase to the system clock in called operand
synchronous interrupt. In other words interrupts which C. Register iii. Specified in the
are dependent on the system clock.
register
Example : Time service that uses the system clock.
D. Register iv. Specified
2. Which of the following is incorrect for virtual
Indirect implicitly in the
memory?
definition of
(a) Large programs can be written
(b) More I/O is required instruction
(c) More addressable memory available Codes :
(d) Faster and easy swapping of process A B C D
Ans : (b) Virtual Memory : Virtual memory is a (a) iv iii i ii
memory management technique implemented using (b) iv i iii ii
both software and hardware. It maps memory address (c) iv ii i iii
used by program called virtual addresses into physical
addresses in computer memory. (d) iv iii ii i
It provides more addressable memory, program of Ans : (b)
larger size than physical memory can be run on same (i) Implied addressing mode: Specified implicitly in
computer but I/O cost is not increases. the definition of instruction.
3. The general configuration of the micro (ii) Immediate addressing mode: Specified in the
programmed control unit is given below : register.
(iii) Register addressing mode: Registers which are in
CPU.
(iv) Register indirect addressing mode: Register
specifies the address of the operand.
5. In 8085 microprocessor, the digit 5 indicates
What are blocks B and C in the diagram that the microprocessor needs
respectively? (a) –5 volts, +5 volts supply
(a) Block address register and cache memory (b) +5 volts supply only
(b) Control address register and control memory (c) –5 volts supply only
(c) Branch register and cache memory (d) 5 MHz clock
(d) Control address register and random access
Ans : (b) The "5" in the part number highlighted the
memory
fact that the 8085 uses a single +5 volt (V). Power
Ans : (b)
supply by using depletion mode transistors, rather than
requiring the +5v, –5v and +12v supplies needed by the
8085.
It uses a single +5 volt d.c. (direct current) supply for its
operation. It clock speeds is 3 MHz.
6. In 8085, which of the following performs : load
register pair immediate operation?
So Block B is control address register and block C is (a) LDAS rp (b) LHLD addr
control memory.
(c) LXI rp, data (d) INS rp
UGC NET JRF Computer Science June 2017 Paper-III 234 YCT
 Search on TG: @apna_pdf
Ans : (c) LXI is load register pair immediate which take The relation R is in ..........
one register as input and 2 bytes immediate data. There (a) First normal form but not in second normal
are seven integral 8-bit register. form
This is generally used to load SP, memory pointer. (b) Both in first normal form as well in second
Generally H–L, D–E, B–C register pairs are used. B, D,
normal form
H hold the MSB and L, E, C hold the LSB
(c) Second normal form but not in third normal
7. Consider following schedules involving two
form
transactions :
(d) Both in second normal form as well in third
S1 : r1 (X); r1 (Y); r2(X);r2(Y); w2(Y); w1(X)
normal form
S2 : r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)
Which of the following statement is true? Ans : (a) Here A → C & B → D no. Singleton attribute
(a) Both S1 and S2 are conflict serializable. derives all other attribute. But if we take AC → BD so
(b) S1 is conflict serializable and S2 is not closure of AC = {AC}+ = {A, B, C, D}
conflict serilizable So AB is the only candidate key of the relation.
(c) S1 is not conflict serializable and S2 is Now as 2NF says, attributes should be fully dependent
conflict serializable on the key. But here C & D are partially dependent.
(d) Both S1 and S2 are not conflict serializable
So it is in 1NF
Ans : (c) S1 : here we can see that two conflicting
operations r1(Y) → w2(Y) & r2(X) →w1(X), so there 11. Consider the following relation :
will be edge from T1 to T2 & T2 to T1 ........ so there will Works (emp_name, company_name, salary)
be loop in the graph, so it is not conflict serializable. Here, emp_name is primary key.
S2 : But here we are not getting such loop in graph for Consider the following SQL query
any edge...... so it is conflict serializable.
Select emp_name
8. Which one is correct w.r.t. RDMBS?
From works T
(a) primary key ⊆ super key ⊆ candidate key
where salary > (select avg (salary)
(b) primary key ⊆ candidate key ⊆ super key
from works S
(c) super key ⊆ candidate key ⊆ primary key
where T.company_name =
(d) super key ⊆ primary key ⊆ candidate key
S.company_name)
Ans: (b) Super Key : An attribute that uniquely defines
a tuple within a relation. The above query if for following :
Candidate key : Super key such that no proper subset (a) Find the highest paid employee who earns
is a super key within in a relation so basically has two more than the average salary of all employees
properties : Each candidate key uniquely identifies tuple of his company
in the relation & no proper subset of the composite key (b) Find the highest paid employee who earns
has the uniqueness property more than the average salary of all the
Primary Key : Candidate key chosen to identify tuples employees of all companies
uniquely within the relation.
(c) Find all employees who earn more than the
9. Let pk(R) denote primary key of relation. R. A average salary of all employees of all the
many-to-one relationship that exists between companies
two relation R1 and R2 can be expressed as
(d) Find all employees who earn more than the
follows :
average salary of all employees of their
(a) pk(R2) →pk(R1)
company
(b) pk(R1) → pk(R2)
(c) pk(R2) → R1 ∩ R2 Ans : (d) It doesn't select the highest paid employees,
(d) pk(R1) → R1 ∩ R2 as max is not used, It just select employees name who
earns more than the average salary of all employee of
Ans : (b) Many to one relationship set exists between
entity sets student & course (a relation & with primary the all companies will not be considered.
key roll-no) let it is decomposed in 2 relation r1 & r2 12. If following sequence of keys are inserted in a
So the functional dependency pk(student) →pk(course) B+tree with K(=3) pointers :
indicates a many to one relationship b/w r1 & r2 8, 5, 1, 7, 3, 12, 9, 6
10. For a database relation R(A, B, C, D) where Which of the following shall be correct B+tree?
the domains of A, B and D include only atomic (a)
values, only the following functional
dependencies and those that can be inferred
from them are :
A→C
B→D
UGC NET JRF Computer Science June 2017 Paper-III 235 YCT
 Search on TG: @apna_pdf
(b) (c) The electron gun creates a source of electrons
which are focused into a narrow beam
directed at the face of CRT
(d) All of the above
Ans : (d) Persistence is the time to which the
phosphorus in the cathode ray tubes emit light until the
next electrons is fired.
(c)
Control electrode – an electrode to which a varying
signal is applied to vary the output of a transistor. An
electron gun is an electrical component is some vacuum
tubes that produces a narrow, collimated electron beam
that has precise kinetic energy.
14. A segment is any object described by GKS
(d) commands and data that start with CREATE
SEGMENT and Terminates with CLOSE
SEGMENT command. What function can be
performed on these segments?
(a) Translation and Rotation
Ans : (a) B+ tree with maximum 3 pointers: (b) Panning and Zooming
(c) Scaling and Shearing
(d) Translation, Rotation, Panning and Zooming
Ans : (d) A segment is any object described by GKS
command and data that start with CREATE SEGMENT
and terminates with close segment command.
Segments allows object to be manipulated by simply
referring to the segment numbers as a result segments
can be translated, rotated, panned & zoomed.
15. Match the following :
A. Glass i. Contains liquid
crystal and
serves as a
bonding surface
for a conductive
coating.
B. Conductive ii. Acts as a
coating conductor so
that a voltage
can be applied
across the liquid
crystal
C. Liquid crystal iii. A substance
which will
polarize light
when a voltage
is applied to it.
D. Polarized film iv. A transparent
sheet that
polarizes light
13. Which of the following statement(s) is/are Codes :
correct? A B C D
(a) Persistence is the tern used to describe the (a) i ii iii iv
duration of phosphorescence (b) i iii ii iv
(b) The control electrode is used to turn the (c) iv iii ii i
electron beam on and off (d) iv ii i iii
UGC NET JRF Computer Science June 2017 Paper-III 236 YCT
 Search on TG: @apna_pdf
Ans : (a) Glass or plastic plate which contains liquid Ans : (a) According to DDA algorithm:
crystal end serves as a bonding surface for conducting |dx| = 8, |dy| = 4
coating. Since |dx| > |dy|; so step = |dx| = 8
Conductive coating acts as a conductor so that a | dx | 8
voltage can be applied across the liquid crystal. Xinc = = =1
Liquid crystal is a substance which will polarize light steps 8
when a voltage is applied to it. | dy | 4
Polarized film is a transparent sheet that polarizes light. Yinc = = = 0.5
steps 8
The axis of polarization is at 90° out of phase with the
For K = 1 to steps:
axis of polarization of liquid crystal.
XK+1 = YK + Xinc;
16. Below are the few steps given for scan- YK+1 = YK + Yinc;
converting a circle using Bresenham's Since DDA algorithm works only for integer values
Algorithm. only, we need to round these values of co-ordinates to
Which of the given steps is not correct? nearest integer.
(a) Compute d = 3 – 2r (where r is radius) So our first four points are (0, 0), (1, 1), (2, 1) and (3, 2).
(b) Stop if x > y 19. Which of the following are not regular?
(c) If d < 0, then d = 4x + 6 and x = x + 1
(A) Strings of even number of a's
(d) If d ≥ 0, then d = 4 * (x –y) + 10, x = x + 1
(B) Strings of a's, whose length is a prime
and y = y + 1 number
Ans : (d) Step 1 : Get the coordinates of center of the (C) Set of all palindromes made up of a's and
circle & radius, & store them in X, Y & R respectively, b's
so P = O & Q = R (D) Strings of a's whose length is a perfect
Step 2 : Set decision parameter D = 3 – 2R square
Step 3 : Repeat through set–8 while x<y (a) (A) and (B) only
Step 4 : Call draw circle (x, y, P, Q) (b) (A), (B) and (C) only
Step 5 : Increment the value of P (c) (B), (C) and (D) only
Step 6 : If D < O the D = D + 4x + 6 (d) (B) and (D) only
Step 7 : Else set y = y + 1, D = d + y (x – y) + 10 Ans : (c)(1) Strings of even number of a's is
Step 8 : Call draw circle (x, y, P, Q) Regular because we can draw finite acceptor (fA) for
17. Which of the following is/are side effects of this.
scan conversion? (2) Strings of a's whose length is a prime number- There
A. Aliasing are infinite No.
which are prime and we cannot design FA for Infinte
B. Unequal intensity of diagonal lines
language. This is not Regular
C. Over striking in photographic applications
(3) Set of all palindromes made up of a's and b's. This is
D. Local Global aliasing not Regular because we cannot design FA for infinite
(a) A and B (b) A, B and C language.
(c) A, C and D (d) A, B, C and D (4) Strings of a's whose length is a perfect square. This
Ans : (d) is not Regular because we cannot design FA for infinite
(i) During scan conversion same pixel may be language.
unnecessarily plotted multiple times which cause 20. Consider the language L1 = φ and L2 = {1}.
overstriking. Which one of the following represents
(ii) Aliasing effect occur due to bad sampling of scan L1* ∪ L2* L1*?
lines over the object, which is occur due to discontinuity
of objects and scanning is referred at integer value. (a) {∈} (b) {∈, 1}
(iii) Unequal intensity occurs due to uneven brightness (c) φ (d) 1*
of object during scan conversion. Ans : (d) L1 * = φ* = ∈
(iv) Local and Global aliasing also the side effect of L2* L1* = {1}. ∈ = 1*
scan conversion. L1* ∪ L2* L1 * = ∈ ∪ 1 * = 1*
18. Consider a line AB with A = (0, 0) and B = (8, 21. Given the following statements :
4). Apply a simple DDA algorithm and (A) A class of language that is closed under
compute the first four plots on this line. union and complementation has to be
(a) [(0, 0), (1, 1), (2, 1), (3, 2)] closed under intersection
(b) [(0, 0), (1, 1.5), , 2), (3, 2)] (B) A class of language that is closed under
(c) [(0, 0), (1, 1), (2, 2.5), (3, 3)] union and intersection has to be closed
(d) [(0, 0), (1, 2), (2, 2), (3, 2)] under complementation
UGC NET JRF Computer Science June 2017 Paper-III 237 YCT
 Search on TG: @apna_pdf
Which of the following options is correct? (d) L1 is not context free language, L2 is context
(a) Both (A) and (B) are false free language
(b) Both (A) and (B) are true Ans : (c) L1 we can decompose as anbn (n < 100 and
(c) (A) is true, (B) is false anbn n > 100)
(d) (A) is false, (B) is true First part regular, second part DCFL, So it is obviously
Ans : (c) Here we can derive this statement with the CFL L2 needs two comparison n(a) = n (b) again n(n) =
n(c) so we can not make a PDA for this
help of closure properties
So it is CSL but not context free
S1 : True as it is the case for regular grammar
S2 : False as in RE language it is closed under union, 24. A recursive function h, is defined as follows :
Intersection but not in complementation. h(m) = k, if m = 0
= 1, if m = 1
22. Let G = (V, T, S, P) be a context-free grammar
= 2 h(m – 1) + 4h (m –2), if m ≥ 2
such that every one of its productions if of the
If the value of h(4) is 88 then the value of k is :
form A → v, with v = K > 1. The derivation (a) 0 (b) 1
tree for any W ∈ L(G) has a height h such that (c) 2 (d) –1
 W −1  Ans : (c) Given, h(m) = k, if m = 0 = 1, if m = 1
(a) log k W ≤ h ≤ log k  
 K −1 
= 2h (m –1) + 4h(m–2), if m > 2, the value of h(4) is 88
the value of k is h (4) = 2h(3) + 4h (2) = 2 (2h(2) +
(b) log k W ≤ h ≤ log k ( K W ) 4h(1) + 4h (2)
= 8h(2) + 8h(1) = 8 (2h(1) + 4h(0)) + 8h = 24h (1) + 32
(c) log k W ≤ h ≤ K log k W h (0) = 24 + 32k = 88 = k = 2
 W −1  25. Suppose there are n stations in a slotted LAN.
(d) log k W ≤ h ≤   Each station attempts to transmit with a
 K −1  probability P in each time slot. The probability
Ans : (d) S → AB that only one station transmits in a given slot
is ............
A → aAaa
(a) nP(1 – P)n–1 (b) nP
B →bBbb, Let W = aabb (c) P(1 – P)n–1 (d) nP(1 – P)n–1
w = aaabb
Ans : (a) It can be derived using binomial theorem of
probability
NCi (p)i (1 – p) n–i
now 1 stations is sending with probability p, & n–1
⇒ height = 2 stations are not sending with probability 1 – p
= log 2 = log 2 = 2
w y now the probability is = nc1(p)1 (1–p)n–1
= np(1 –p)n–1
26. Station A uses 32 bytes packets to transmit
messages to station B using sliding window
protocol. The round trip delay between A and
B is 40 milliseconds and the bottleneck
⇒ height = 3 bandwidth on the path between A and B is 64
 w −1  kbps. The optimal window size of A is ..........
3 ≤   (a) 20 (b) 10
 k −1  (c) 30 (d) 40
5 −1 Ans : (b) Bottleneck bandwidth = 64 Kbps = 64 × 103
3≤
2 −1 bps
3≤ 4 size of frame = 32×8
Round trip delay = 40 ms = 40 × 10–3 sec
23. Given the following two languages :
Total data 40 × 64 × 103 × 10–3 = 40 × 64/8 bytes = 320
L1 = {an bn  n ≥ 0, n ≠ 100} bytes
L2 = {w ∈ {a, b, c} *  na(w) = nb(w) = nc (w)} 1 packet size = 32 byte
Which of the following options is correct? no. of packets 320/32 = 10
(a) Both L1 and L2 are not context free language 27. Let G(x) be generator polynomial used for
(b) Both L1 and L2 are context free language CRC checking. The condition that should be
(c) L1 is context free language, L2 is not context satisfied by G(x) to correct odd numbered
free language error bits, will be :
UGC NET JRF Computer Science June 2017 Paper-III 238 YCT
 Search on TG: @apna_pdf
(a) (1 + x) is factor of G(x) 31. The asymptotic upper bound solution of the
(b) (1 – x) is factor of G(x) recurrence relation given by
(c) (1 + x2) is factor of G(x) n n
(d) x is factor of G(x) T ( n ) = 2T   + is :
 2  lgn
Ans : (a) In this case polynomial generator should
(a) O(n2) (b) O(n lg n)
satisfy
(c) O(n lg lg n) (d) O(lg lg n)
(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 Ans:(c) By master's theorum. A = 2, B = 2, k= 1, P= –1
polynomial AS a = bk & p = –1
answer is o(n log2 log logn) = o (n lg log n)
28. In a packet switching network, if the message
size is 48 bytes and each packets contains a 32. Any decision tree that sorts n elements has
header of 3 bytes. If 24 packets are required to height ..............
transmit the message, the packet size is......... (a) Ω(lg n) (b) Ω(n)
(a) 2 bytes (b) 1 bytes (c) Ω(n lg n) (d) Ω (n2)
(c) 4 bytes (d) 5 bytes Ans : (c) Any decision tree that sorts n elements has
Ans : (d) 24 Packets requires to carry 48 byte of data, height omega (n lg n) proof :
so each packet carries 48/24 = 2 byte, now each packet A binary tree of height h has <=2 ∧ h leaves
has to + 3 byte of header, so packet size = 2 + 3 = 5 At least n : leaves are required for sorting
byte Thus n! < = 2 ∧h
29. In RSA public key cryptosystem suppose n = p h > = lg (n!) = sum – {i = 2} ∧n lg (i) > sum – {i =
* q where p and q are primes. (e, n) and (d, n) n2} ∧n lg (n2)
are public and private keys respectively. Let M >(n2) lg (n2) = omega (n lg n)
be integer such that o < M < n and φ(n) = (p –
33. Red–black trees are one of may search tree
1) (q – 1).
Which of the following equations represent schemes that are "balanced" in order to
RSA public key cryptosystem? guarantee that that basic dynamic-set
operations take .............. time in the worst case.
I. C ≡ Me (mod n)
(a) O(1) (b) O(lg n)
M ≡ (C)d (mod n)
(c) O(n) (d) O(n lg n)
II. ed ≡ 1(mod n)
Ans : (b) Red black trees are one of many search tree
III. ed ≡ 1(mod φ(n)) schemes that are "balance". in order to guarantee that
IV. C ≡ Me (mod φ(n)) basic dynamic set operations o(lg n) time in worst case.
M ≡ Cd (mod φ(n)) 34. The minimum number of scalar multiplication
Codes :
required, for parenthesization of a matrix-
(a) I and II (b) I and III chain product whose sequence of dimension for
(c) II and III (d) I and IV four matrices is <5, 10, 3, 12, 5> is
Ans : (b) I is true because (a) 630 (b) 580
Encrypted -Text = (Plain - Text)e mod n (c) 480 (d) 405
Plain - Text = (Encrypted - Text)d mod n Ans : (d) ((5 × 10, 10 × 3). (3 × 12. 12 × 5))
III is True because 5 × 10 × 3 + 3 × 12 × 5 + 5 × 3 × 5 = 405
d-1 = e mod φ (n) 35. Dijkstra's algorithm is based on
or ed = 1 mod φ (n)
(a) Divide and conquer paradigm
II and IV is wrong.
(b) Dynamic programming
30. A node X on a 10 Mbps network is regulated (c) Greedy Approach
by a token bucket. The token bucket is filled at (d) Backtracking paradigm
a rate of 2 Mbps. Token bucket is initially filled
Ans : (c) Dijkstra always choose the closest vertex in
with 16 megabits. The maximum duration
V–S to add to set S where V = vertex set & S = set of
taken by X to transmit at full rate of 10 Mbps
vertices whose final path shortest path weights from the
is ................ secs.
source have been obtained.
(a) 1 (b) 2
So Dijakstra algorithm is a greedy algorithm.
(c) 3 (d) 4
36. Match the following with respect to algorithm
Ans : (b) Using T = C ans comes out to be 2 sec
paradigms :
(where C Rout – Rin
maximum duration taken by x for Transmission List-I List-II
= b/(m - r) A. Merge sort i. Dynamic
= 16/ 10 - 2 = 2sec programming

UGC NET JRF Computer Science June 2017 Paper-III 239 YCT
 Search on TG: @apna_pdf
B. Huffman coding ii. Greedy q = p;
approach p[4] = 20;
C. Optimal polygon iii. Divide and System out. println (array [4]+ "." + q[4]);
triangulation conquer (a) 20 : 20 (b) 18 : 18
C. Subset sum iv. Back tracking (c) 18 : 20 (d) 20 : 18
problem
Ans : (c) For (int k = 0; k < 10; k ++)
Codes :
p[k] = array [k]; in this loop we are copying all the
A B C D
values from the array to the array P.
(a) iii i ii iv Now, Q = P, Q is pointing P, nom, P[4] = 20 but Q
(b) ii i iv iii contains the old P array where in 4th index i.e. Q[4] is
(c) ii i iii iv also Q0.
(d) iii ii i iv Note : here pointer is involved, so the location is being
Ans : (d) Merge sort based on divide and conquer update, so Q is getting 20 here but the question is about
array [4] which was initial array, so value 18
paradigm.
so answer is 18 : 20
Huffman coding based on greedy approach.
39. Consider the following JAVA program :
Subset sum problem based on back-tracking.
Optimal polygon triangulation base on dynamic public class First {
programming. public static int CBSE (int x) {
if (x < 100) x = CBSE (x + 10)
37. Abstraction and encapsulation are
return (x – 1)
fundamental principles that underlie the object }
oriented approach to software development. public static void main (String [ ] args) {
What can you say about the following two system. out. print (First. CBSE (60));
statements? }
I. Abstraction allows us to focus on what What does this program print ?
something does without considering the (a) 59 (b) 95
complexities of how it works. (c) 69 (d) 99
II. Encapsulation allows us to consider Ans : (b)
complex ideas while ignoring irrelevant
detail that would confuse us.
(a) Neither I nor II is correct
(b) Both I and II are correct
(c) Only II is correct
(d) Only I is correct
Ans : (a) Abstraction & Encapsulation are fundamental
principles that underlie the object oriented approach to
Answer is option (b)
s/w development. Encapsulation allows us to focus on
what something does without considering the 40 . Which of the following statements(s) with
complexities of how it works. regard to an abstract class in JAVA is/are
TRUE?
Abstraction allows us to consider complex ideas while
ignoring irrelevant details would confuse us. I. An abstract class is one that is not used to
create objects.
Here none is correct.
II. An abstract class is designed only to act as
38. Given the array of integers 'array' shown a base class to be inherited by other classes.
below : (a) Only I (b) Only II
13 7 27 2 18 33 9 11 22 8 (c) Neither I nor II (d) Both I and II
What is the output of the following JAVA Ans : (d) A class that is declared as abstract is known
statements? as abstract class. It needs to be extended and its method
int [ ] p = new int [10]; implemented. It cannot be instantiated.
An abstract class is designed only to act as a base class
int [ ] q = new int [10];
to be inherited by other class. It is a design concept in
for (ink k = 0; k < 10; k++) program development & provides a base upon which
p[k] = array [k]; other classes can be built.
UGC NET JRF Computer Science June 2017 Paper-III 240 YCT
 Search on TG: @apna_pdf
41. Which of the following HTML code will affect II. Top-down testing typically requires the
the vertical alignment of the table content? tester to build test drivers.
(a) <td style = "vertical-align : middle" > Text (a) Only I (b) Only II
Here </td> (c) Both I and II (d) Neither I nor II
(b) <td valign = "centre"> Text Here </td> Ans : (a) Top Down Testing : In this approach testing
(c) <td style = "text-align : center"> Text Here is conducted from main module to sub module. If the
</td> sub module is not developed a temporary program
(d) <td align = "middle" > Text Here </td> called STUB, used fro simulate the sub module.
Ans : (b) Vertical alignment of the table contents: Bottom up testing : In this approach testing is
<td valign = ‘top |middle | bottom | baseline’> conducted from sub module to main module, if the main
module is not developed a temporary program called
Text here </td>
DRIVERS is used to simulate main module.
So, no option matching if middle = Centre, then option
(b) is matching. 45. Match the terms related to software
42. What can you say about the following Configuration Management (SCM) in List-I
with the descriptions in List-II
statements?
List-I List-II
I. XML tags are case-insensitive
I. Version A. An instance of a system
II. In Java Script, identifier names are case-
that is distributed to
sensitive.
customers
III. Cascading Style Sheets (CSS) cannot be
used with XML. II. Release B. An instance of a system
which is functionally
IV. All well-formed XML documents must identical to other
contain a document type definition. instances, but designed
(a) Only I and II are false for different hardware/
(b) Only III and IV are false software configurations
(c) Only I and III are false III. Variant C. An instance of a system
(d) Only II and IV are false that differs, in some
Ans : (d) 1 is false : XML tags are case sensitive way, from other
2 : is true : All Java scripts identifiers are case sensitive instances.
3 : is false : Cascading style sheets (CSS) is a style sheet Codes
language & can be applied to any XML document I II III
4 : is false : well formed XML document does not need (a) B C A
a DTD. (b) C A B
43. Which of the following statements(s) is/are (c) C B A
(d) B A C
TRUE with regard to software testing?
Ans : (b) Version is an instance of a system that differs,
I. Regression testing technique ensures that in some way from other instances.
the software product runs correctly after
Release is an instance of a system that is distributed to
the changes during maintenance. customers.
II. Equivalence partitioning is a white-box Variant is an instance of system which is functionally
testing technique that divides the input identical to other instances, but designed for different
domain of a program into classes of data hardware/ software configurations.
from which test cases can be derived.
46. A software project was estimated at 352
(a) Only I (b) Only II
function points (FP). A four person team will
(c) Both I and II (d) Neither I nor II
be assigned to this project consisting of an
Ans : (a) Regression testing is a type of s/w testing that architect, two programmers, and a tester. The
verifies that s/w previously developed & tested still salary of the architect is ` 80,000 per month,
performs correctly even after it was changed with other the programmer ` 60,000 per month and the
software. tester ` 50,000 per month. The average
Equivalence portioning : is Black box testing method to productivity for the team is 8 FP per person
divide input domain into categories for better test month. Which of the following represents the
coverage. projected cost of the project?
44. Which of the following are facts about a top- (a) ` 28,16,000 (b) ` 20,90,000
down software testing approach? (c) ` 26,95,000 (d) ` 27,50,000
I. Top-down testing typically requires the Ans : (d) Total 352 FP
tester to build method stubs. average 8 FP per person per month
UGC NET JRF Computer Science June 2017 Paper-III 241 YCT
 Search on TG: @apna_pdf
Total 4 person (a) 11.2 months (b) 12.2 months
So 352/(8 × 4) = 11 (c) 13.2 months (d) 10.2 months
now, (1 architect + 2 programmer + 1 tester)* 11 Ans : (b) For basic COCOMO model
= (80000 + 2 × 60000 + 50000)* 11 = 2750000 E effort = a (KLOC)b in person months
47. Complete each of the following sentences in here a = 1.4, b = 1.0 total LOC = 1000 × 50 = 50, 000
List-I on the left hand side by filling in the = 50 KLOC
word or phrase from the List-II on the right So E = 1.4 × 50 = 70
hand side that best completes the sentence : D(Development) time = C(E)d in months
here C = 3, d = 0.33, so development time = 3 × (70)0.33
List-I List-II
3 × (approx cube root root of 70) = 3 × 4.1 = 12.3
I. Determining A. Software (approx)
whether you have testing
49. A memory management system has 64 pages
built the right
with 512 bytes page size. Physical memory
system is called
consists of 32 page frames. Number of bits
II. B. Software required in logical and physical address are
Determining verification respectively :
whether you have (a) 14 and 15 (b) 14 and 29
built the system (c) 15 and 14 (d) 16 and 32
right is called Ans : (c) We know, number of page = virtual address
III. is the C. Software space/page size
process of debugging So virtual address space = number of page × page size
demonstrating the = 26 × 29 = 215
existence of defects So we need is bit fo VA & physical address = page size
or providing × frame = 29 × 25 = 215
confidence that they So 14 bit required for PA
do not appear to be
present. 50. Consider disk queue with I/O requests on the
IV. is the D. Software following cylinders in their arriving order ;
process of validation 6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45
discovering the The disk head is assumed to be at cylinder 23
cause of a defect and moving in the direction of decreasing
and fixing it. number of cylinders. Total number of cylinders
in the disk is 150. The disk head movement
Codes : using SCAN-scheduling algorithm is :
I II III IV (a) 172 (b) 173
(a) B D A C (c) 227 (d) 228
(b) B D C A
Ans : (b) SCAN scheduling Algorithm is also known as
(c) D B C A Elevator algorithm it scans from the one end to other
(d) D B A C end.
Ans : (d) 1. Validation : ensures that the whole s/w In this case head starts from 23 onwards and then moves
meets the customer requirements. As we building the to the another end i.e. 150
right product? Here total head movement = 23 + 1 + .1 to 150
2. Verification : Ensures that part of s/w correctly = 23 + 150
implements a specific function. As we are building the = 173
product right?
51. Match the following for Unix file system :
3. Testing : Demonstrating the existence of reject or
providing confidence that they do not appear to be List-I List-II
present. A. Book block i. Information about
48. A software company needs to develop a project file system, free
that is estimated as 1000 function points and block list, free
planning to use JAVA as the programming inode list etc.
language whose approximate lines of b = 1.0 as B. Super block ii. Contains operating
exponention factor for the basic COCOMO system files as well
effort equation and c = 3.0 as equation, as program and
approximately how long does the project take data file created
to complete? users

UGC NET JRF Computer Science June 2017 Paper-III 242 YCT
 Search on TG: @apna_pdf
C. Inode block iii. Contain boot Ans : (a) User level threads
program and Advantage
partition table. Thread switching does not require kernel mode
privileges
D. Data block iv. Contain a table fro
User level thread can run on any OS.
every file in the file
User level threads are fast to create & manage.
system Attributes
Disadvantage
of files are stored
In a typical OS, most system calls are blocking
here. Multithreaded application cannot take advantage of
Codes: multiprocessing.
A B C D 54. Which statements is not correct about "init"
(a) iii i ii iv process in Unix?
(b) iii i iv ii (a) It is generally the parent of the login shell
(c) iv iii ii i (b) It has PID 1.
(d) iv iii i ii (c) It is the first process in the system.
(d) Init forks and execs a 'getty' process at every
Ans: (b) Boot block contains boot program and port connected to a terminal.
partition table.
Ans : (c) Init is the second process first processed is
Super block contain information about file system, free schedule
block list, free inode list etc. 55. Consider following two rules R1 and R2 in
Inode block contains a table for every file in the file logical reasoning in Artificial Intelligence (AI):
system and attribute of files are stored in it. R1 : from α ⊃ β
Data block contains operating system files as well as andα
program and data files created by users. is known as Modus Tollens (MT)
interβ
52. Some of the criteria for calculation of priority R2 : Form α ⊃ β
of a process are : and¬α
is known as Modus Ponens
A. Processor utilization by an individual inter¬β
process (MP)
B. Weight assigned to a user or group of users (a) Only R1 is correct
C. Processor utilization by a user or group of (b) Only R2 is correct
processes (c) Both R1 and R2 are correct
In fair share scheduler, priority is calculated (d) Neither R1 nor R2 is correct
based on : Ans: (d) R1 holds the correct definition for modus
Ponens & R2 hold the correct definition of modus
(a) Only (A) and (B) (b) Only (A) and (C)
tollens.
(c) (A), (B), and (C) (d) Only (B) and (C)
56. Consider the following AO graph :
Ans: (c) Fair-share scheduling is a scheduling algorithm
for computer operating system is which the CPU usage
is equality distributed among system users or groups, as
apposed to equal distribution among processes.
53. One of the disadvantages of user level threads
compared to Kernel level threads is
(a) If a user level thread of a process executes a
system call, all threads in that process are Which is the best node to expand next by AO*
algorithm ?
blocked
(a) A (b) B
(b) Scheduling is application dependent
(c) C (d) B and C
(c) Thread switching doesn't require kernel mode
Ans: (a) f(n) = c(n) + h(n)
privileges where,
(d) The library procedures invoked fro thread f(n) = Best path to reach the destination node
management is user level threads are local c(n) = cost of path
procedures h(n) = heuristic value of a node
UGC NET JRF Computer Science June 2017 Paper-III 243 YCT
 Search on TG: @apna_pdf
cost of choosing B or C is (a) ((R ∨¬Q) ∧(P ∨¬Q) ∧ (R ∨P))
= (22 + 3) + (24 + 2) (b) ((R ∨ Q) ∧(P ∨¬Q) ∧ (R ∨ P))
= 51 (c) ((R ∨ Q) ∧(P ∨¬Q) ∧ (R ∨¬P))
Note:- We add cost of B and C because they belongs to (d) ((R ∨ Q) ∧(P ∨¬Q) ∧ (¬R ∨P))
AND graph Ans : (b) P is equivalent to Q means P is true, Q is true
cost of choosing A = 42+ 4 = 46 & P is false, Q is false
Since cost of choosing node choosing B or C that why If (p ∨ Q) is true and (P ∨~Q) is true we can concluded
we will expand 'A'.
(P ∨ R) is also true (R ∨ Q) ⇔ (~R →Q) similarly
57. In Artificial Intelligence (AI), what is present (P ∨~Q) ⇔ (Q →P)
in the planning graph? (1) (~R → Q), (2) (Q →P)
(a) Sequence of levels (b) Literals ∴ (~R →P) from 1 & 2 by applying hypothetical
(c) Variables (d) Heuristic estimates syllogism.
Ans : (a) A planning graph consists of sequence of (~R →P) ⇔(R ∨ P)
levels correspond to time steps
So ((R ∨ Q) ∨ (P ∨ ¬ Q) ∨ (R ∨ P)((R ∨ Q) ∧ (P ∨¬Q)
Used to achieve heuristic estimates
∧ (R ∨ P) is true whenever ((R ∨ Q) ∧ (P ∨ ¬ Q) is true
A solution can also directly be extracted using
also ((R ∨ Q) ∧ (P N ¬ Q)) ((R ∨ Q) ∧ (P ∧ ¬ Q) ∧ (R
GRAPHPLAN
∨ P) is false whenever ((R ∨ Q) ∧ (P ∧ ¬ Q) is false.
Consist of a sequence of levels that correspond to
steps in plan 61. Given the following two statements :
Level 0 is the initial stage A. L = {wna(w) = nb(w) is deterministic
Each level consist of a set of literals and a set of context free language, but not linear.
function B. L = {an bn} is ∪ {an b2n} is linear, but not
Literals : All those that could be true at that deterministic context free language.
time step, depending upon the actions executed Which of the following options is correct?
at preceding time step. (a) Both (A) and (B) are false
Action : All those action that could have their (b) Both (A) and (B) are true
preconditions satisfied at that time step, (c) (A) is true, (B) is false
depending on which of the literals actually (d) (A) is false, (B) is true
hold.
Ans : (b) L = {wna (w) = nb (w)} L = {wnaw} = nb
58. What is the best method to go for the game (w)} is deterministic context free language, but not
playing problem? linear
(a) Optimal search (b) Random search L = { anbn} u} anp 2m} L = {an bn} u {anb2n}
(c) Heuristic search (d) Stratified search is linear, but not deterministic context free language
Ans : (c) We use a heuristic approach, as it will find out 62. Which of the following pairs have different
brute force computation, looking at hundreds of expressive power?
thousand of positions.
(a) Single-tape-turning machine and multi-
59. Which of the following statements is true? dimensional turning machine
(a) The sentence S is a logical consequence of (b) Multi-tape turning machine and multi-
S1, .......Sn if and only if S1 ∧ S2 ∧ ........... ∧ dimensional turning machine
Sn → S is satisfiable. (c) Deterministic push down automata and non-
(b) The sentence S is a logical consequence of deterministic pushdown automata.
S1,...........Sn if and only if S1 ∧ S2 ∧......... ∧ (d) Deterministic finite automata and Non-
Sn → S is valid. deterministic finite automata
(c) The sentence S is a logical consequence of Ans: (c) Deterministic push down automata & non
S1,..........Sn if and only if S1 ∧ S2 ∧..........∧ Sn deterministic push down automata.
∧ ¬S is consistent. 63. Which of the following statements is false?
(d) The sentence S is a logical consequence of (a) Every context-sensitive language is recursive
S1,.........Sn if and only S1 ∧ S2 ∧........∧ Sn ∧ S (b) The set of all languages that are not
is inconsistent. recursively enumerable is countable
Ans : (b) The sentence S is logical consequence of S1, (c) The family or recursively enumerable
S2, S3 ….Sn if and only if S1 ∧ S2 ∧ S3 …. ∧ Sn → S is language is closed under union.
valid. (d) The families of recursively enumerable and
Since satisfiable always not implied to valid. recursive language are closed under reversal
60. The first logic (FOL) statement (R ∨ Q) ∧ (P ∨ Ans: (b) 1– CSL is a subset of recursive language 3 & 4
¬Q) is equivalent to which of the following? are their respective closure properties.
UGC NET JRF Computer Science June 2017 Paper-III 244 YCT
 Search on TG: @apna_pdf
64. Let C be a binary linear code with minimum (d) Every loop has an even no. of cells and
distance 2t + 1 then it can correct upto............ atleast four.
bits of error. Ans : (a) In transportation table:
(a) t + 1 (b) t (i) An even number of atleast 4 cells must participate
(c) t – 2 (d) t/2 in closed loop and an occupied cell can be considered
Ans : (b) In a set of code words with hamming only once and not more.
distance 2++1. t errors can be corrected. (ii) Closed loop may or may not be square or rectangle
65. A t-error correcting q-nary linear code must in shape.
satisfy : (iii) All cells in the loop that have a plus or minus sign,
t n
  except the starting cell, must be occupied.
M ∑   ( q - 1) ≤ X
i

i=0  
i 69. At which of the following stage(s), the
Where M is the number of code words and X degeneracy do no occur in transpiration
is: problem?
(a) qn (b) qt (m, n represents number of sources and
–n
(c) q (d) q–t destinations respectively)
Ans : (b) A linear code of length n & rank k is a linear (A) While the values of dual variables ui and vj
subspace with dimension k of the vector space {\display cannot be computed.
style\math bb{f} – {Q} ^ {n}} fnq where {\display style (B) While obtaining an initial solution, we may
\math bb {f}–{3} FQ is the finite filed with Q element have less than m + n –1 allocations.
such a code is called a Q–any code. If Q = 2 or Q = 3, the (C) At any stage while moving towards optimal
code is described as a binary code, or a ternary code solution, when two or more occupied cells
respectively. The vectors in c are called code words. The with the same minimum allocation become
size of a code is the number of code words & evals Qk
unoccupied simultaneously.
66. Names of some of the Operating systems are (D) At a stage when the no. of +ve allocation is
given below : exactly m + n –1.
(A) MS–DOS (a) (a), (B) and (C) (b) (A), (C) and (D)
(B) XENIX (c) (A) and (D) (d) (A), (B), (C) and (D)
(C) OS/2
Ans: (c) Degeneracy do no occur in transportation
In the above list, following operating systems
problem while the value of dual variables ui and vj
didn't provide multi-user facility.
cannot computed and number of positive allocation is
(a) (A) only (b) (A) and (B) only
exact m + n – 1 (it must be less than m + n – 1).
(c) (B) and (C) only (d) (A), (B) and (C)
70. Consider the following LPP :
Ans : (d)
(i) MS-DOS originally single user, multi-user support Min. Z = x1 + x2 + x3
provided that did not have present when manufactured. Subject to 3x1 + 4x3 ≤ 5
(ii) XENIX always been multi-user. 5x1 + x2 + 6x3 = 7
(iii) OSI2 does not provide facility of multi-user. 8x1 + 9x3 ≥ 2,
So, none of the O.S. provide facility of multi-user. x1, x2, x3 ≥ 0
67. From the given data below : The standard form of this LPP shall be :
abbaabbaab (a) Min. Z = x1+x2+x3+0x4+0x5
Which one of the following is not a word in the Subject to 3x1+4x3+x4 = 5;
dictionary created by LZ-coding (the initial 5x1+x2+6x3 = 7;
words are a, b)? 8x1+9x3–x5 = 2;
(a) a b (b) b b
x1, x2, x3, x4, x5 ≥ 0
(c) b a (d) b a a b
(b) Min. Z = x1+x2+x3+0x4+0x5–1(x6) – 1x7)
Ans : (c) Input is : abb aa bb aab Subject to 3x1+4x3+x4 = 5;
So the dictionary contains : a/b/ba/ab/baa/b
5x1+x2+6x3 = 7;
68. With respect to a loop in the transportation 8x1+9x3–x5 = 2;
table, which one of the following is not correct? x1, to x7 ≥ 0
(a) Every loop has an odd no. of cells and atleast 5.
(c) Min. Z = x1+x2+x3+0x4+0x5+0x6
(b) Closed loops may or may not be square in
shape Subject to 3x1+4x3+x4 = 5;
(c) All the cells in the loop that have a plus or 5x1+x2+6x3 = 7;
minus sign, except the starting cell, must be 8x1+9x3–x5+x6 = 2;
occupied cells x1 to x6 ≥ 0
UGC NET JRF Computer Science June 2017 Paper-III 245 YCT
 Search on TG: @apna_pdf
(d) Min. Z = x1+x2+x3+0x4+0x5+0x6+0x7  z1 z3 z 4 
T =  0.6 0.5 0.4
Subject to 3x1+4x3+x4 = 5; x1 
5x1+x2+6x3+x6 = 7; x2
8x1+9x3–x5+x7 = 2; 0.7 0.5 0.3
x1 to x7 ≥ 0 72. A neuron with 3 inputs has the weight vector
Ans : (a) To convert into standard for we need to [0.2 – 0.1 0.1]T and a bias θ = 0. If the input
convert <= and >= equations into = from this either vector is X = [0.2 0.4 0.2]T then the total input
some extra. Variable are added or subtracted from given to the neuron is :
equation & that variable with O coefficient is included (a) 0.20 (b) 1.0
in objective function. (c) 0.02 (d) –1.0
So 3 × 1 4 × 3 × 4 = 5 (Stack variable × 4 is added) Ans : (c) Neural networks is a huge topic which cannot
5 × 1 + × 2 + 6 × 3 = 7 (already in = from) be explained in short. It is off topic anyway.
8 × 1 + 9 × 3 – × 3 = 2 (surplus ×5 is subtracted) now f(x) – wT * × + 0
objective function becomes. f(x) = 0.2 * 0.2 – 0.1 * 0.4 + 0.1 * 0.2 = 0.02
minimize × 1 + × 2 + × 3 + 0 × 4 + 0 × 5 73. Which of the following neural networks uses
71. Let R and S be two fuzzy relations defined as: supervised learning?
 y1 y 2   z1 z 2 z 3  (A) Multilayer perception
x1   y1   (B) Self organizing feature map
R =  0.6 0.4  and S =  0.8 0.5 0.1  (C) Hopfield network
x2 y2
0.7 0.3   0.0 0.6 0.4  (a) (A) only (b) (B) only
Then, the resulting relation, T, which relates (c) (A) and (B) only (d) (A) and (C) only
elements of universe x to the elements of universe Ans: (a) Multilayer perceptron network and support
z using max-min composition is given by : vector machines are examples of supervised learning,
while self organizing feature maps and Hopfield
 z1 z 2 z3 
x1   networks are examples of unsupervised learning.
(a) T =  0.4 0.6 0.4  74. Unix command to change the case of first three
x2
0.7 0.7 0.7  lines of file "shortlist" from lower to upper
 1 (a) $ tr '[a – z]' '[A – Z]' shortlist head-3
z z 2 z 3 
x1   (b) $ head-3 shortlist tr '[a – z]' '[A – Z]'
(b) T = 0.4 0.6 0.4 (c) $ tr head-3 shortlist '[A – Z]' '[a – z]'
x2
 0.8 0.5 0.4 (d) $ tr shortlist head-3 '[a–z]' '[A – Z]'
 z1 z 2 z3  Ans : (b) Unix command to change the case of first
(c) T =  0.6 0.5 0.4
x1  three lines of file “shortlist” from lower to upper are
x2 $ head – 3 shortlist ¦ tr ‘[a – z]’ ‘[A – Z]’.
0.7 0.5 0.3
75. Match the following vi commands in Unix :
 z1 z 2 z3  List-I List-II
(d) T = 1  0.6 0.5 0.4 
x
A. : w i. saves the file and quits
x2
0.7 0.7 0.7  editing mode
B. : x ii. escapes Unix shell
Ans : (c)
C. : q iii. saves file and remains in
y1 y 2 z1 z 2 z3 editing mode
x y
R = 1 0.6 0.4 & S = 1 0.8 0.5 0.1 D. : sh iv. quits editing mode and
x2 y2 no changes are saved to
0.7 0.3 0.0 0.6 0.4 the file
To find a relation between X & Z is need to use y. Codes :
Since x1 is related to y1 & y2 & y1, y2 are related with z1, A B C D
z2, z3 so relation between ×1 & z1, z2, z3 can be (a) ii iii i iv
established and so between x2 & z1, z2, z3 so for max (b) iv iii ii i
min composition (c) iii iv i ii
(x1, z1) = max (min(0.6, 0.8) min (0.4, 0.0)) = max (0.6, (d) iii i iv ii
0.0) = 0.6 Ans : (d)
(x1, z2) = max (min (0.6, 0.5), min (0.4, 0.6)) = 0.5 (a) w to save your file but not quit vi (iii)
(x1, z3) = max (min(0.6, 0.1), min (0.4, 0.4)) = 0.4 (b) x <return> quit vi, writing out modified file to file
x2z1 = max (min(0.7, 0.8), min (0.3, 0.0)) = 0.7 named in original invocation (i)
x2z2 = max (in(0.7, 0.5), min (0.3, 0.6)) = 0.5 (c) Q to quit if you haven't made any edits (iv)
x3z3 = max (min (0.7, 0.1), min (0.3, 0.4)) = 0.3 (d) Sh escape the Unix shell (ii)

UGC NET JRF Computer Science June 2017 Paper-III 246 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. November, 2017

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. If the time is now 4 O'clock, what will be the Now,
time after 101 hours from now? 1 ∨ 0 ∨ 0 0 ∨ 1∨ 0 0 ∨ 1 ∨ 0 0 ∨ 0 ∨ 0
(a) 9 O'clock (b) 8 O'clock 0 ∨ 0 ∨ 0 0 ∨ 1∨ 0 0 ∨ 1 ∨ 0 0 ∨ 0 ∨ 0 
(c) 5 O'clock (d) 4 O'clock A B= 
1 ∨ 0 ∨ 0 0 ∨ 1 ∨ 0 0 ∨ 1 ∨ 0 0 ∨ 0 ∨ 0
Ans : (a) Current time = 4 O'clock  
Time to come back at same position = 12 hour 0 ∨ 0 ∨ 1 0 ∨ 0 ∨ 0 0 ∨ 0 ∨1 0 ∨ 0 ∨1 
So clock will be completed cycles in 101 hour and 1 1 1 0 
remaining hour is → 101 mod 12 0 1 1 0 
= 
= 5 hour 1 1 1 0 
So, time after 101 hours = 4+5 = 9 O'clock  
1 0 1 1 
2. Let m = (313)4 and n = (322)4. Find three base 4
So, option (a) is correct.
expansion of m + n.
(a) (635)4 (b) (32312)4 4. How many distinguishable permutations of the
(c) (21323)4 (d) (1301)4 letters in the word BANANA are there?
Ans : (d) This question can also be solved by first (a) 720 (b) 120
converting both the number in decimal system then per (c) 60 (d) 360
forming addition and then finally converting addition Ans : (c) Number of permutation of n objects with n1
result into base 4. identical object of type 1, n2 identical object of type 2
(313) = 3*16+4*1+3 = 55; n!
(322) = 3* 16 + 4* 2 + 2 = 58; & nk identical objects of type ki ....nk!
n1!n2!
addition is 55 + 58 = 113
6!
now 113 in base 4 can be represented as 1301 to the Permutation of latter BANANA are = 60
base 4. 3!2!1!
5. Consider the graph given below :
1 1 0
0 1 0 0 0 
1 0
3. Let A =  and B = 0 1 1 0  Find the
1 1 0
  1 0 1 1 
0 0 1
Boolean product A ⊙ B of the two matrices.
Use Kruskal's algorithm to find a minimal
1 1 1 0  1 1 0 1  spanning tree for the graph. The list of edges of
0 1 1 0 0 1 0 1 
(a)   (b)   the tree in the order in which they are choosen is?
1 1 1 0  1 1 1 0  (a) AD, AE, AG, GC, GB, BF
    (b) GC, GB, BF, GA, AD, AE
1 0 1 1  1 0 1 1 
(c) GC, AD, GB, GA, BF, AE
1 1 1 1  1 1 1 0 
0 1 1 0 0 1 1 0 (d) AD, AG, GC, AE, GB, BF
(c)   (d)   Ans : (c) Minimum spanning tree for given graph:
1 1 1 0  1 0 1 1 
   
1 0 1 1  1 0 1 1 
1 1 0 
0 1 0  1 0 0 0 
Ans : (a) A =   , B = 0 1 1 1 
1 1 0   
  1 0 1 1 
0 0 1 
we have to perform logical AND logical or in place of
multiplication and addition for ex. consider following Kruskal’s algorithm start with picking edge with
matrix Boolean product. smallest edge weight i.e. “AD = 2” or “GC = 2”.

UGC NET JRF Computer Science Nove. 2017 Paper-II 247 YCT
 Search on TG: @apna_pdf
After that “AD = 2”. Ans : (b) Proposition ⇒ ∃x H ( x )
Since for 1st choice we choose “AD = 2”.
So, order will GC, AD, GB, GA, BF, EA. Negation ⇒ ¬  ∃x H ( x ) 
Note: There are more than 1 order possible since edge ⇒ ∀x ¬H ( x )
weights are repeated.
6. The Boolean function with the Karnaugh map 10. The output of the following combinational
circuit is F.

(a) (A + C) . D + B (b) (A + B). C + D

(c) (A + D). C + B (d) (A + C). B + D
Ans : (a)

The value of F is :
(a) P1 + P2P3 (b) P1 +P2P3
(c) P1 + P2P3 (d) P1 + P2P3
Ans : (b) We know that (A + B) (A + C) = A + BC
on the basis of given question or gates will produce
output (P1 + P'2 + P'3), (P1 + P'2 + P3), (P1 + P2 + P3) and
So, SoP from = AD + CD + B gate will take all three input produced by or gate
= (A + C). D + B generate (P1 + P'2 P'3) as output.
7. The Octal equivalent of the binary number 11. 'ptrdata' is a pointer to a data type. The
1011101011 is : expression *ptrdata++ is evaluated as (in C++)
(a) 7353 (b) 1353 :
(c) 5651 (d) 5657 (a) *(ptrdata++)
Ans : (b) To solve this (1011101011) question first we (b) (*ptrdata)++
make pair of three digit from right side (c) *(ptrdata)++
i.e. 011 011 101 011 (d) Depends on compiler
011 = 3, 101 = 5, 011= 3, 011 = 1 Ans : (a) Post increment (++) has higher precedence
So, (001 011 101 011) = (1353) in octal than dereference (*). Hence it increments the address
8. Let P and Q be two propositions, ¬ (P ↔ Q) is that the pointer holds, than dereferences it.
equivalent to : 12. The associativity of which of the following
(a) P ↔ ¬Q (b) ¬ P ↔Q operators operators is left to right, in C++?
(c) ¬ P ↔ ¬ Q (d) Q → P (a) Unary Operator
Ans : (a, b) (b) Logical not
P Q ~ ~ Q→ ~(P↔ ~P↔ ~P↔ ~P↔~ (c) Array element access
P Q P ~Q Q Q Q (d) Address of
0 0 1 1 1 0 0 0 1 Ans: (a) Unary operators: Logical not, one’s
0 1 1 0 0 1 1 1 0 complement, unary minus, increment, decrement,
1 0 0 1 1 1 1 1 0 address of indirection, cast and size of operator are light
1 1 0 0 1 0 0 0 1 to left associative while operator function call, array
subscript, dot and arrow are left to right associative.
Given statement: ¬ ( P ↔ Q )
13. A member function can always access the data
We know A ↔ B = A 'B'+ AB in ........... , (in C++)
So, ¬ ( P 'Q '+ PQ ) (a) the class of which it is member
( P 'Q + PQ ') ≅ P ↔ ¬Q ≅ ¬P ↔ Q (b) the object of which it is a member
(c) the public part of its class
9. Negation of the proposition ∃ x H(x) is : (d) the private part of its class
(a) ∃x ¬H(x) (b) ∀x ¬H(x) Ans : (a) Member function can always access the data
(c) ∀x ¬H(x) (d) ¬x H(x) in the class of which is member in C++.
UGC NET JRF Computer Science Nove. 2017 Paper-II 248 YCT
 Search on TG: @apna_pdf
Code:- (A) A 'view' is a special stored procedure
class x { executed when certain event occurs
Private String name; (B) A 'view' is a virtual table, which occurs
Private int age; after executing a pre-complied query.
x (string name, int age) Code :
{ (a) Only (A) is true
this . name = name; (b) Only (B) is true
this . age = age; (c) Both (A) and (B) are true
} (d) Neither (A) nor (B) are true
int get Age () Ans : (b) View is a virtual table, through which a
{ selective portion of the data from one or more table can
return age; be seen. A view does not contain data of its own.
} 17. In SQL ................ is an Aggregate function.
} (a) SELECT (b) CREATE
14. Which of the following is not correct for virtual (c) AVG (d) MODIFY
function in C++? Ans : (c) AVG function returns the average of the
(a) Must be declared in public section of class values in a group. It ignores null values. It is an
(b) Virtual function can be static Aggregate function.
(c) Virtual function should be accessed using Syntax : ([All Distinct] expression)
pointers 18. Match the following with respect to RDBMS :
(d) Virtual function is defined in base class A. Entity i. Enforces some
Ans : (b) Virtual function cannot be global or static integrity specific business rule
because, a virtual function is a member function of a that to not fall into
base class an relies on a specific object to determine entity or domain
which implementation of function is called. You can B. Domain ii. Rows can't be
declare a virtual function to be a friend of another class. integrity deleted which are
15. Which of the following is not correct (in C++)? used by other
(a) Class templates and function templates are records
instantiated in the same way C. Referential iii. Enforces valid
(b) Class templates differ from function integrity entries for a column
templates in the way they are initiated D. User iv. No duplicate rows in
(c) Class template is initiated by defining an defined a table
object using the template argument integrity
(d) Class templates are generally used for storage Code :
classes A B C D
Ans : (a) Template are a feature of the C++ (a) iii iv i ii
programming language that allow functions and classes (b) iv iii ii i
to operate with generic types, which allow a function or (c) iv ii iii i
class to work on many different data type without being (d) ii iii iv i
rewritten for every one separately.
Ans : (b) : Entity integrity s used to provide primary
1. Function template: Behave like function except that
key mechanism hence there is no duplicate rows in table
the template can have argument of many different types.
: Domain Integrity specifies that all columns in a
(i) Function template does not occupy space in
relational database must be declared upon a defined
memory.
domain
(ii) The function template does not save memory.
: Referential integrity means we cannot delete records in
(iii) The function template can be instantiated with master table before deleting the records from child
any copy constructible type for which the
table.
expression is valid.
2. Class template: Provides a specification for 19. In RDBMS, different classes or relations are
generating classes based on parameters. created using ................ technique to prevent
(i) There are used commonly to implement containers. modification anomalies.
(ii) A class template is instantiated by passing a given (a) Functional dependencies
set of types to it as template arguments. (b) Data integrity
16. Which of the following is/are true with (c) Referential integrity
reference to 'view' in DBMS? (d) Normal forms
UGC NET JRF Computer Science Nove. 2017 Paper-II 249 YCT
 Search on TG: @apna_pdf
Ans: (d) Normal forms are defined as functional It cannot always be the case that the edge with emax
dependency, data integrity, referential integrity, should not be present in MST
normalization.
20. .................SQL command changes one or more
fields in a record.
(a) LOOK-UP (b) INSERT
(c) MODIFY (d) CHANGE
Ans : (c) In DBMS, modify, a SQL command that
changes one or more fields in a record.
21. Consider an array representation an n element
binary heap where the elements are stored
from index 1 to index n of the array. For the
element stored at index i of the array (i < = n),
the index of the parent is :
(a) floor ((i + 1)/2) (b) ceiling ((i + 1)/2)
Emax is present in MST.
(c) floor (i/2) (d) ceiling (i/2)
Ans : (c) Consider a binary heap of n elements in 24. A list of n strings, each of length n, is sorted
which elements are stored in array from index 1 to n. into lexicographic order using merge - sort
algorithm. The worst case running time of this
computation is :
(a) O(n log n) (b) O(n2 log n)
2
(c) O(n + log n) (d) O(n3)
Ans : (b) Since list contain ‘n’ string, each of length
‘n’. Take 1st character of each string and sort it and
place sorted strings into output list, doing this for n
1 times will sort the all the strings into one list, so time
Parent of any element at index i is calculated as  
2 complexity = n⋅(n log n) = O (n2 log n)
22. The following numbers are inserted into an Note: First sort each string individually in list will take
empty binary search tree in the given order : O(n log n) time more.
10, 1, 3, 5, 15, 12, 16. What is the height of the 25. Post order traversal of a given binary search
binary search tree? tree T produces following sequence of keys :
(a) 3 (b) 4 Which one of the following sequences of keys
(c) 5 (d) 6 can be the result of an in-order traversal of the
Ans : (a) tree T?
(a) 3, 4, 5, 7, 9, 14, 20, 18, 17, 16, 15
(b) 20, 18, 17, 16, 15, 14, 3, 4, 5, 7, 9
(c) 20, 18, 17, 16, 15, 14, 9, 7, 5, 4, 3
(d) 3, 4, 5, 7, 9, 14, 15, 16, 17, 18, 20
Ans : (d) In order traversal always gives sorted list in
BST. 3, 4, 5, 7, 14, 15, 16, 17, 18, 20 .
• The in-order traversal of the Binary Search Tree
23. Let G be an undirected connected graph with (BST) always given elements in ascending or increasing
distinct edge weight. Let Emax be the edge with order.
maximum weight and Emin the edge with So, In order traversal of the sequence of keys given in
minimum weight. Which of the following post- order traversal in sorted ascending order of that
statements is false? keys.
(a) Every minimum spanning tree of G must 26. Which of the following devices takes data sent
contain Emin from one network device and forwards it to the
(b) If Emax is in minimum spanning tree, then its destination node based on MAC address?
removal must disconnect G. (a) Hub (b) Modem
(c) No minimum spanning tree contains Emax
(c) Switch (d) Gateway
(d) G has a unique minimum spanning tree
Ans : (c) Switch takes data sent from one network
Ans : (c) There may exist some spanning tree which
device & forwards it to the destination node based on
consist of Emax in it & its removal must disconnect of
MAC address.
the graph G.
UGC NET JRF Computer Science Nove. 2017 Paper-II 250 YCT
 Search on TG: @apna_pdf
A switch is a multi port bridge with a buffer and a 31. Consider the following program fragment in
design that can boost its efficiency and performance. assembly language :
Switch is data link layer device. It can perform error mov ax, 0h
checking before forwarding data. mov cx, 0A, h
27. .............. do not take their decisions on doloop :
measurements or estimates of the current dec ax
traffic and topology. loop doloop
(a) Static algorithm What is the value of ax and cx registers after
(b) Adaptive algorithm the completion of the doloop?
(c) Non-adaptive algorithm (a) ax = FFF5 h and cx = 0 h
(d) Recursive algorithm (b) ax = FFF6 h and cx = 0 h
Ans : (c) Non adaptive algorithm Implements static (c) ax = FFF7 h and cx = 0A h
routing non adaptive algorithm do not base their routing (d) ax = FFF5 and cx = 0A h
decision on measurements and estimates of the current
Ans : (b)
traffic & topology. Instead the route to be taken in
going from one node to the other in computed in dec ax =
advance.
28. The number of bits used for addressing in
Gigabit Ethernet is ..........
(a) 32 bits (b) 48 bits
(c) 64 bits (d) 128 bits now, loop do loop
Ans : (b)

(1)

(2)
now, do as same for 10 time & in the last step is.

cx = oh so the loop stops here

The Ethernet frame is the packet that delivers data ax = 11110110
between stations. Each frame is made up of bits. Which i.e. F6n
are organized into different fields. The four main fields
Which could be written as FFF6 h
are the destination Ethernet address field, source.
Ethernet address field, data field & frame check 32. Consider the following assembly program
sequence filed. The address fields are us bit long. fragment :
29. Which of the following layer of OSI Reference stc
model is also called end-to-end layer? mov al, 110101110b
(a) Network layer (b) Datalink layer mov cl, 2
(c) Session layer (d) Transport layer rcl al, 3
Ans : (d) Transport layer is the layer in the OSI model rol al, 4
responsible for end to end communication over a shr al, cl
network. It provides logical communication between mul cl
application a layered architecture of protocols and other The contents of the destination register ax (in
network component. hexadecimal) and the status of Carry Flag (CF)
30. The IP address ................ is used by hosts when after the execution of above instructions, are :
they are being booted. (a) ax = 003CH; CF = 0
(a) 0.0.0.0 (b) 1.0.0.0 (b) ax = 001EH; CF = 0
(c) 1.1.1.1 (d) 255.255.255.255 (c) ax = 007BH; CF = 1
Ans : (a) 0.0.0.0 is also called DHCP address used (d) ax = 00B7H; CF = 1
when host was booted first time. Ans : (a) If you multiply any binary number by 2,
In IPV4 0.0.0.0 is used for the default route. Simply add a 0 bit to its L.S.B. (Right End).

UGC NET JRF Computer Science Nove. 2017 Paper-II 251 YCT
 Search on TG: @apna_pdf
Here, d = 2, so we are multiplying the binary number is 35. Match the description of several parts of a
al by 2. classic optimizing compiler in List-I, with the
Hence, al = 000111100 names of those parts in List - II :
Now, it becomes 0000000000111100 = 003CH List-I List-II
CF = 0 A. A part of a compiler i. Optimizer
CF = 0, if high byte/word/double word = 0 that is responsible
CF = 1, if high byte/word/double word < > 0. for recognizing
Hence, the correct answer is ax = 003 CH; CF = 0. syntax
33. Which of the following regular expressions, B. A part of a complier ii. Semantic
each describing a language of binary numbers that takes as input a Analysis
(MsB to LSB) that represents non-negative stream of characters
decimal values, does not include even values? and produces as
(a) 0*1+0*1* (b) 0*10+1* output a stream of
(c) 0*1*0*1+ (d) 0*1*0*1* words along with
Where {+, *} are quantification characters. their associated
syntactic categories
Ans : (c) When a number is represented in binary
form, for add numbers, we have a 1 in the LSB while a C. A part of a compiler iii. Parser
o in LSB for even numbers that understand the
So, only the language generated by option (c) 0*1*0*1+ meanings of variable
will, for sure, here 1 in the LSB, So this language won't names and other
contain even number. symbols and checks
that they are used in
34. Which of the following statements is/are
ways consistent with
TRUE? their definitions.
(A) The grammar S → SS is  a is ambiguous. D. An IR-to-IR iv. Scanner
(where S is the start symbol)/j transformer that
(B) The grammar S → 0S1  01S  ∈ is tries to improve the
ambiguous. (The special symbol ∈ IR program in some
represents the empty string) (Where S is way (Intermediate
the start symbol)/j Representation)
(C) The grammar (Where S is the start Code :
symbol) A B C D
S → T/U (a) iii iv ii i
T → x S y xy  ∈ (b) iv iii ii i
U → yT/j (c) ii iv i iii
generates a language consisting of the string (d) ii iv iii i
yxxyy. Ans : (a)
(a) Only (A) and (B) are TRUE (i) Parser which is also called syntax analyzer who
(b) Only (A) and (C) are TRUE is responsible for recognizing syntax.
(c) Only (B) and (C) are TRUE (ii) Scanner which is also called lexical analyzer who
(d) All of (A), (B) and (C) are TRUE is responsible for tokenizing input stream of
characters and produce tokens.
Ans : (d) (a) S → SSa
(iii) Semantic analyzer is part of compiler that
This grammar is ambiguous. Take the string aaa for
understand the meaning of variable and check that
example to generate this string we can either have :
they are used in same way consistent with their
S → SS → Sa → SSa →Saa → aaa definitions.
(b) S → 0S101S∈ (iv) Optimizer is responsible for IR-IR
This grammar is also ambiguous. The string 01 have transformation that tries to improve the IR program in
two different derivation trees. same way.
S → 0S1 →01 & S →01S →01 36. In distributed system, the capacity of a system
(c) This statement is TRUE. Here's how we can to adapt the increased service load is
generate the string yxxyy from the given grammar. S called.........
→U→y T→yxSy → yxTy →yxxyy (a) Tolerance (b) Scalability
So all the three statements are TRUE (c) Capability (d) Loading
UGC NET JRF Computer Science Nove. 2017 Paper-II 252 YCT
 Search on TG: @apna_pdf
Ans : (b) Scalability is an attribute that describes the 40. Two atomic operations permissible on
ability of a process, network, software or organization Semaphores are .............. and ...........
to grow and manage increased demand a system, (a) wait, stop (b) wait, hold
business that is described as scalable has an advantage (c) hold, signal (d) wait, signal
because it is more adaptable to the changing needs &
even presence of its users. Ans : (d) Wait & signal operations are the two atomic
operations performed on a semaphore.
37. In .......... disk scheduling algorithm, the disk
head moves from one end to other end of the 41. Software not wear-out in the traditional sense
disk, serving the request along the way. When of the term, but software does tend to
the head reaches the other end, it immediately deteriorate as it evolves, because :
returns to the beginning of the disk without (a) Software suffers from exposure to hostile
serving any requests on the return trip. environments
(a) LOOK (b) SCAN (b) Defects are more likely to arise after software
(c) C – LOOK (d) c – SCAN has been used often
Ans : (b) In scan disk scheduling algorithm, the disk (c) Multiple change requests introduce errors in
head moves from one end to another end of disk, component interactions
serving the requests along the way. When the head (d) Software spare parts become harder to order
reaches the other end, it immediately returns to the Ans : (c) As time passes software is likely to get
beginning of the disk, without serving any request on
multiple change request while using software by users
the return trip.
& one does not identify all aspects of software when it
is developed.
42. Software re-engineering is concerned with :
(a) Re-constructing the original source code
from the existing machine (low - level) code
program and modifying it to make it more
user - friendly
(b) Scrapping the source code of a software and
38. Suppose there are six files F1, F2, F3, F4, F5,
re-writing it entirely from scratch
F6 with corresponding sizes 150 KB, 225 KB, (c) Re-organizing and modifying existing
75 KB, 60 KB, 275 KB and 65 KB respectively. software systems to make then more
The files are to be stored on a sequential device
maintainable
in such a way that optimizes access time. In
what order should the files be stored? (d) Translating source code of an existing
(a) F5, F2, F1, F3, F6, F4 software to a new machine (low - level)
language
(b) F4, F6, F3, F1, F2, F5
(c) F1, F2, F3, F4, F5, F6 Ans : (c) Software re-engineering is a process of
(d) F6, F5, F4, F3, F2, F1 software development which is done to improve the
maintainability of a software system.
Ans : (b) Files with sizes:
F1 = 150 KB, F2 = 225 KB, F3 = 75 KB, 43. Which of the following is not a key issue
F4 = 60 KB, F5 = 275 KB, F6 = 65 KB stressed by an agile philosophy of software
So, to optimize access time merge two smallest engineering?
files and put back in same bage. Repeatedly i.e. (a) The importance of self-organizing teams as
(F4, F6) = 125 KB well as communication and collaboration
Then ((F4, F6), F3) = 200 KB between team members and customers
Then, (((F4, F6), F3), F1) = 350 KB (b) Recognition that change represents
Then, (F2, F5) = 500 KB opportunity
Then finally ((F4, F6, F3, F1), (F2, F5)) = 700 (c) Emphasis on rapid delivery of software that
KB satisfies the customer
So, order will be F4, F6, F3, F1, F2, F5. (d) Having a separate testing phase after a build
39. Which module gives control of the CPU to the phase
process selected by the sort - term scheduler? Ans : (d) Principles of agile software development:
(a) Dispatcher (b) Interrupt 1. Customer satisfaction by early and continuous
(c) Scheduler (d) Threading delivery of valuable software.
Ans : (a) Dispatcher is the module that gives control of 2. Welcome changing requirements, even in late
the CPU to the process selected by the sort term development.
scheduler. 3. Working software is delivered frequently.
UGC NET JRF Computer Science Nove. 2017 Paper-II 253 YCT
 Search on TG: @apna_pdf
4. Close, daily cooperation between business people 47. Which of the following statements about ERP
and developers. system is true?
5. Face to face conversation is the best form of (a) Most ERP software implementations fully
communication. achieve seamless integration.
6. Projects are build around motivated individuals who (b) ERP software package are themselves
should we trusted. combinations of separate applications for
7. Working software is primary measure of progress. manufacturing, materials, resource planning,
8. Sustainable development, able to maintain a general ledger, human resources,
constant pace. procurement and order entry
9. Continuous attention to technical excellence and (c) Integration of ERP systems can be achieved
good design. in only one way
10. Simplicity the art of maximizing the amount of
(d) An ERP package implemented uniformly
work not done is essential.
throughout an enterprise is likely to contain
So, (d) is best possible answer.
very flexible connections to allow charges
44. What is the normal order of activities in which and software variations.
traditional software testing is organized ? Ans : (b) Some ERP software packages are themselves
(A) Integration Testing combinations for manufacturing, material resource
(B) System testing planning, general ledger, human resources procurement
(C) Unit Testing & order entry.
(D) Validation Testing
48. Which of the following is not a clustering
Code :
(a) (C), (A), (B), (D) method?
(b) (C), (A), (D), (B) (a) K–Mean method
(c) (D), (C), (B), (A) (b) Self Organizing feature map method
(d) (B), (D), (A), (C) (c) K – nearest neighbor method
Ans : (a) (d) Agglomerative method
Bussiness need ←→
validation
Solution assesment Ans : (c) In pattern recognition, the k-nearest
neighbors algorithm (K-NN) is a non-parametric
Production vision ←→
validation
Product owner acceptance method used for classification and regression.
Bussines analysis document ←→
validation
User testing 49. Which of the given wireless technologies used
Technical specification ←→
validation
System testing in lot, consumes the least amount of power?
(a) Zigbee (b) Bluetooth
Technical Design ←→
validation
Integration testing (c) Wi-Fi (d) GSM/CDMA
Unit specification ←→
validation
Unit testing Ans : (b) Bluetooth is a telecommunications industry
specification that describes how mobile devices,
45. Which of the following testing techniques
computers and other device can easily communicate
ensures that the software product runs
with each other using a short range wireless connection.
correctly after the changes during
maintenance? 50. Which speed up could be achieved according to
(a) Path Testing (b) Integration Testing Amdahl's law of infinite number of processes if
(c) Unit Testing (d) Regression Testing 5% of a program is sequential and the
Ans : (d) Regression testing is a type of software remaining part is ideally parallel?
testing which verifies that software which was (a) Infinite (b) 5
previously developed and tested still performs the same (c) 20 (d) 50
way it was changed with other software. Changes may Ans : (c) Sequential part – 5%
include software enhancements, patches etc. Parallel part (P) = 1 – Sequential part
46. Which of the following Super Computers in the = 1 – (5 ÷ 100)
fastest Super Computer? = 1 – 0.05
(a) Sun-way Taihu Light (b) Titan = 0.95 or 95%
(c) Piz Daint (d) Sequoria According to
Ans : (a) Sunway Taihu Light has been named as the Amdahl's Law,
world's fastest supercomputer title, as per recently
1
released semiannual top 500 list of super computers. It S= = 20
is developed by chain's National research centre of 1 – 0.95
parallel computer engineering & technology (NRCPL). Hence, the value of speed up is 20.
UGC NET JRF Computer Science Nove. 2017 Paper-II 254 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. November, 2017

COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. In 8085 microprocessor which of the following Ans : (a) Indexed addressing mode is best suited for
flag(s) is (are) affected by an arithmetic operation? accessing an array in contiguous memory location.
(a) AC flag only (b) CY flag only 5. Which of the following is correct statement?
(c) Z flag only (d) AC, CY, Z flags (a) In memory-mapped I/O, the CPU can
Ans : (d) AC is auxiliary – carry flag, cy is carry flag manipulate I/O data residing in interface
& z is zero flag. All these flags will be affected during registers that are not used to manipulate
arithmetic operation. memory words
2. In 8085 microprocessor the address bus is of (b) The isolated I/O method isolates memory and
.......... bits I/O addresses so that memory address range
(a) 4 (b) 8 (c) 16 (d) 32 is not affected by interface address
Ans : (c) In 8085 microprocessor 16 bits are used for assignment
address bus & 65,536 (216 = 65,536) different memory (c) In asynchronous serial transmission of data
location are possible. the two units share a common clock
3. In the architecture of 8085 microprocessor (d) In synchronous serial transmission of data
two units have different clocks
match the following :
Ans : (b) The Isolated I/O method isolates memory &
A. Processing i. Interrupt
I/O addresses so that memory address range is not
unit
affected by interface address assignment.
B. Instruction ii. General purpose Memory based I/O uses same address space for
unit Register memory & I/O devices
C. Storage iii. ALU In asynchronous serial transfer of data the two units
and do not share a common clock.
Interface In synchronous serial transfer of data the two units
unit share a common clock.
D. iv. Timing and
6. A micro-instruction format has micro-ops field
control
which is divided into three subfields F1, F2, F3
Code :
A B C
each having seven distinct micro-operations,
(a) iv i ii condition field CD for four status bits, branch
field BR having four options used in
(b) iii iv ii
conjunction with address field ADF. The
(c) ii iii i address space is of 128 memory locations. The
(d) i ii iv size of micro-instruction is :
Ans : (b) (a) 17 bits (b) 20 bits
ALU is the arithmetic logic unit and it involves (c) 24 bits (d) 32 bits
processing of input desired output.
Ans : (b) Microprocessor instruction format, which is
Timing and control instruction are covered in
divided into three subfields F1, F2, F3 each having seven
instruction unit of microprocessor.
distinct micro-operation condition field CD for four
There are some general purpose register in storage status bits, branch fields BR having four options used in
& interface unit conjunction with address field ADF. The address space
While an interrupt is signal to the processor which is of 128 memory locations i.e.
required attention from processor, an interrupt is
serviced on the basis of priority & need
4. Which of the following addressing mode is best
suited to access elements of an array of
contiguous memory locations?
(a) Indexed addressing mode
(b) Base Register addressing mode
(c) Relative address mode
(d) Displacement mode = total bits are 20

UGC NET JRF Computer Science Nove. 2017 Paper-III 255 YCT
 Search on TG: @apna_pdf
7. Consider the following four schedules due to Ans : (b) 2NF is a relation R is in second normal from
three transactions (indicated by the subscript) (2NF) if and only if it is in 1NF and every non key
using read and write on a data item X, denoted attribute is fully dependent on primary key ex : relation
by r(X) and w(X) respectively. Which one of R(xyz) with functional dependencies (x →y, y →z, x
them is conflict serializable? →z). The relation is in 2NF but not in 3NF because of
S1 : r1(X); r2(X); w1(X); r3(X); w2(X) every non key attribute is transitively dependent on the
S2 : r2(X); r1(X); w2(X); r3(X); w1(X) primary key. Here {X} will be candidate key.
S3 : r3(X); r2(X); r1(X); w2(X); w1(X) 10. Consider a relation R (A, B, C, D, E, F, G, H),
S4 : r2(X); w2(X); r3(X); r1(X); w1(X) where each attribute is atomic, and following
(a) S1 (b) S2 functional dependencies exist
(c) S3 (d) S4 CH → G
A → BC
Ans : (d)
B → CFH
⇒ A Schedule is called conflict serializable if it can be
transformed into a serial schedule by swapping non- E→A
conflicting operations. F → EG
For a schedule to be conflict serializable, there should The relation R is ...............
be no cycle present in its precedence graph. (a) in 1NF but not in 2NF
Option- (d) Conflict serializable (b) in 2NF but not in 3NF
(c) in 3NF but not in BCNF
(d) in BCNF
Ans : (a) A+ → All attribute except (d)
similarly for other keys we can find closure, but (d)
can't be derived from any key & it must be added to all
keys to be derived from. That's why relation is in 1NF,
Since there is no partial dependency, So this relation is
not in 2NF.
11. Given two relations R1(A, B) and R2(C, D), the
result of following query
Select distinct A, B
From R1, R2
Option (d) is a conflict serializable schedule. is guaranteed to be same as R1 provided one of
the following condition is satisfied.
8. Suppose a database schedule S involves
(a) R1 has no duplicates and R2 is empty
transactions T1, T2, ..................Tn. Consider the (b) R1 has no duplicates and R2 is non - empty
precedence graph of S with vertices (c) Both R1 and R2 have no duplicates
representing the transactions and edges (d) R2 has no duplicates and R1 is non - empty
representing the conflicts. If S is serializable,
which one of the following orderings of the Ans : (b) In this query first we will take Cartesian
product R1, R2 for this 0–R2 then select distinct A, B
vertices of the precedence graph is guaranteed
from Cartesian product of R1, R2 and select A, B for R2
to yield a serial schedule?
for this query A, B → No duplicate A, B by
(a) Topological order combination condition for both we will get the right
(b) Depth - first order condition.
(c) Breadth - first order 12. Consider a schema R(A, B, C, D) and following
(d) Ascending order of transaction indices
functional dependencies.
Ans : (a) For a schedule, we check its serializability by A→B
drawing a precedence graph & find its topological
B→C
order, precedence graph of schedule must not contain
C→D
any cycle to be conflict free.
D→B
9. If every non-key attribute is functionally
Then decomposition of R into R1(A, B), R2(B,
dependent on the primary key, then the C) and R3 (B, D) is .............
relation is in ................... (a) Dependency preserving and lossless join
(a) First normal form (b) Lossless join but not dependency preserving
(b) Second normal form (c) Dependency preserving but not lossless join
(c) Third normal form (d) Not dependency preserving and not lossless
(d) Fourth normal form join
UGC NET JRF Computer Science Nove. 2017 Paper-III 256 YCT
 Search on TG: @apna_pdf
Ans : (a) Schema R(A, B, C, D) is decomposed into (a) 3(x')2 + 4(y')2 = 1
tree relation → R1(A, B), R2 (B, C) & R3 (B, D) 2
 x'   y' 
2

Now dependencies derived from R1 (A, B) are A →B, (b)   +   = 1

B→C but c is not attribute here is this relation, similarly 3 4
do for R2 & R3 & in the last all the dependencies are (c) (3x')2 + (4y')2 = 1
1 1
preserved & it is a lossless decomposition. (d) ( x ')2 + ( y ' )2 = 1
13. Which of the following is not a component of 3 4
memory tube display? Ans : (b) Let f[x, y] = = 0 be the equation for a curve
(a) Flooding gun (b) Collector in rectangular coordinates.
To scale the curve by s, the new equation would be
(c) Ground (d) Liquid Crystal
f[x/s, y/s] = = 0
Ans : (d) Components of memory tube display are Let f[θ, r] = = 0 be the equation for a curve in polar
(1) Floor gun, (2) primary gun (3) writing beam (4) coordinate. To scale it by s, the new formula is f[r/s, θ]
collector (5) storage grid (6) screen (7) flood electron ==0
(8) ground or base (9) Focusing & deflection system. Replace x to x′/3 and y to y′/4, and substitute the value
⇒ Only liquid crystal is not enlisted here and it is not in the x2 + y2 = 1.
the display component in memory tube. 17. Find the normalization transformation that
14. Which of the following is not true in case maps a window whose lower left corner is at (1
Oblique Projections? 1) and upper right corner is at (3, 5) onto a
(a) Parallel projection rays are not perpendicular view port that is the entire normalized device
to the viewing plane screen
(b) Parallel lines in space appear parallel on the 1 −1  1 1
final projected image 2 0 2  2 0 2
(c) Used exclusively for pictorial purposes rather    
 1 −1   −1 1 
than formal working drawings (a) 0 (b) 0
 4 4   4 4
(d) Projectors are always perpendicular to the    
plane of projection 0 0 1  1 1 1
   
Ans : (d) Oblique projection is a simple type of    
technical drawing of graphical projection used for 1 −1  1 1 
producing two-dimensional images of three dimensional 2 0 2  2 0 2 
objects.    
1 −1 
(c)  0
1 1 
Some of the properties of oblique projections: (d)  0
1. Parallel projections rays are not perpendicular to  4 4   4 4 
   
viewing plane, but strike the projection plane at an 1 0 0  1 0 0 
angle other then 90°.    
   
2. Parallel lines in space appear parallel on the projected Ans : (a) The widow parameters are wx min = 1, wy min
image (Same for orthographic projection). = 1, wx max = 3, wy max = 5
3. Because of its simplicity, oblique projection is used view port parameters are vx min = 0, vy min = 0, vx max = 1,
exclusively for pictorial purpose rather than for formal vy max = 1
working drawing. hence sx = 1/2, sy = 1/4
15. With respect to CRT, the horizontal retrace is So N using =
defined as :  1 0 v v x min   s y 0 0   1 0 − w x min 
(a) The path an electron beam takes when    
returning to the left side of the CRT  0 1 v v y max   0 s y 0   0 1 − w y min 
0 0 1   1 
(b) The path an electron beam takes when   0 0 1  0 0
returning to the right side of the CRT  1/ 2 0 −1/ 2 
(c) The technique to turning the electron beam  
off while retracing N =  0 1/ 4 −1/ 4 
 0 1 
(d) The technique of turning the electron beam  0
on/off while retracing 18. The three aspects of quantization,
Ans : (a) In computer graphics horizontal retrace is programmers generally concerned with are :
defined as the path an electron beam takes when (a) Coding error, sampling rate and
returning to the left side of CRT. Amplification
16. Find the equation of the circle x2 + y2 = 1 in (b) Sampling rate, Coding error and
terms of x'y' coordinates, assuming that the xy Conditioning
coordinate system results from a scaling of 3 (c) Sampling rate, Aperture time and Coding
units in the x' direction and 4 units in the y' error
direction. (d) Aperture time, Coding error and Strobing
UGC NET JRF Computer Science Nove. 2017 Paper-III 257 YCT
 Search on TG: @apna_pdf
Ans:(c) The three aspects of quantization, programmers (a) Only context free grammar
generally concerned with are- (b) Only context sensitive grammar
(1) Sampling rate = The number of samples per second. (c) Only regular grammar
(2) Aperture time = Aperture time is the sampling rate (d) any unambiguous grammar
defined as the number of the second per sample. Ans : (c) Finite state machine can recognize language
(3) Coding error = The difference b/w the conditional generated by regular grammar only.......would
signal and the quantized signal. wrong.....as some CFG (type -2), CSG (type-1), type -0
So option (c) is correct. grammars also generate regular language. Hence the
19. The logic of pumping lemma is an example "only" in option (c) makes. So answer option (c)
of............ 24. The language L = {bi b ci  i ≥ 0} over the
(a) iteration alphabet {a, b, c} is :
(b) recursion (a) a regular language
(c) the divide and conquer principle (b) not a deterministic context free language but
(d) the pigeon - hole principle a context free language
Ans : (d) Pigeon - hole principles states that if there n (c) recursive and is a deterministic context free
pigeons fly into m hole and n>m then at least one hole language
must contain more than one pigeons. And logic of (d) not recursive
pumping lemma states that finite state automation can Ans : (c) For a language to be recursive it can be
assume only a finite number of states & because there deciding by turing machine which means it will enter
are infinitely many input sequence, by the pigeon hole into final state and reject the rest and for DCFL it must
principle there must be at least one state to which the decidable that for a particular, next character is going to
automata returns over and over again. accepted or not.
20. Heap allocation is required for languages that : 25. Suppose we want to download text documents
(a) use dynamic scope rules at the rate of 100 pages per second. Assume
(b) support dynamic data structures that a page consists of an average of 24 line
(c) support recursion with 80 characters in each line. What is the
(d) support recursion and dynamic data required bit rate of the channel?
structures (a) 192 kbps (b) 512 kbps
Ans : (b) Heap allocation is required for language (c) 1.248 Mbps (d) 1.536 Mbps
which support dynamic data structure. Ans : (d) Dynamic data structures are data structure
21. Pumping lemma for regular language is that grow and shrink as you need them to by allocating
generally used for proving : and deal locating memory form a place called the heap.
(a) whether two given regular expressions are We have 100 pages, each page is having 24 line and in
equivalent each line there are 80 character and each character is of
(b) a given grammar is ambiguous 8 bits.
(c) a given grammar is regular Now we have to calculate no. of bits can be downloaded
(d) a given grammar is not regular i.e. downloading rate = 100 pages = 100 page * 24 line
Ans : (d) Pumping lemma is used to prove a language * 80 character * 8 bits = 1536000 bits/second = 1.536
is regular or not means pumping lemma is used as proof M bps
for irregularity of a language. Thus, if a language is 26. Quadrature Amplitude Modulation means
regular it always satisfies pumping lemma. It there changing both :
exists at least one string made from pumping which is (a) Frequency and phase of the carrier
not in L, then L is surely not regular. (b) Frequency and amplitude of the carrier
22. Which of the following problem is undividable? (c) Amplitude and phase of the carrier
(a) To determine if two finite automata are (d) Amplitude and wavelength of the carrier
equivalent Ans : (c) Quadrature amplitude modulation means
(b) Membership problem for context free changing both amplitude and phase of the Carrier.
equivalent
27. If a file consisting of 50,000 characters takes 40
(c) Finiteness problem for finite automata
(d) Ambiguity problem for context free grammar seconds to send, then the data rate is ...........
(a) 1 kbps (b) 1.25 kbps
Ans : (d) Ambiguity problem for context free grammar
is undecidable. The problem is undecidable if there is (c) 2 kbps (d) 10 kbps
no turing machine will always half in finite amount of Ans : (d) 50,000 character takes 40 seconds i.e.
time. 50,000*8 = 4 second (each character is of 8 bits)
23. Finite state machine can recognize language In one second → (50,000*8)/40 bits/sec
10,000 bits/sec i.e. 10 kbps
generated by ...............
UGC NET JRF Computer Science Nove. 2017 Paper-III 258 YCT
 Search on TG: @apna_pdf
28. Match the following : 0 8 16 29 31
List-I List-II Next Reserved Fragmentation Res (2 M
header (0) (8 offset (13 bits)
A. Data link layer i. Encryption (8 bits) bits) bits)
B. Network layer ii. Connection Identification (32 bits)
control
So all the given statements are correct.
C. Transport layer iii. Routing 31. Consider a full binary tree with n internal
D. Presentation layer iv. Framing nodes, internal path length i, and external path
Code : length e. The internal path length of a full
A B C D binary tree is the sum, taken over all nodes of
(a) iv iii i ii the tree, of the depth of each node. Similarly,
(b) iii iv ii i the external path length is the sum, taken over
(c) iv ii iii i all leaves of the tree, of the depth of each leaf.
(d) iv iii ii i Which of the following is correct for the full
binary tree?
Ans : (d) (a) e = i + n (b) e = i + 2n
(1) Framing of data in data link layer. (c) e = 2i + n (d) e = 2n + i
(2) Network layer is responsible for end to end
Ans : (b) Consider full binary tree:
communication so routing takes place here.
(3) Connection control is regulated by transport layer.
(4) Encryption of data takes place at presentation layer.
29. The address of a class B host is to be split into
subnets with a 6-bit subnet number. What is
the maximum number of subnets and
maximum number of hosts in each subnet?
(a) 62 subnets and 1022 hosts
(b) 64 subnets and 1024 hosts
(c) 62 subnets and 254 hosts Internal path length = 4 × 2 + 2 × 1 = 10
(d) 64 subnets and 256 hosts External path length =3 + 3 + 3 + 3 + 3 + 3 + 3 + 3= 24
So, e = i + 2n
Ans : (a) Network Mask of class B = 255:255:0:0
24 = 10 + 2 × 7
Subnet bits carried from host portion:
24 = 10 + 14
255.255.111111
123 00 :4
1400000000
244 3
Subnet Host
24 = 24
Number of subnet = 26 – 2 = 64 – 2 = 62 32. You are given a sequence of n elements to sort.
Number of host = 210 – 2 = 1024 – 2 = 1022 The input sequence consists of n k sub-
30. Which of the following statements are true? sequences, each containing k elements. The
elements in a given subsequence are all smaller
(a) The fragmentation field in the base header
than the elements in the succeeding
section of IPv4 have moved to the
subsequence and larger than the elements in
fragmentation extension header in IPv6
the preceding subsequence. Thus, all that is
(b) The authentication extension header is needed to sort the whole sequence of length n is
new in IPv6 to sort the k elements in each of the
(c) The record route option is not n k subsequences.
implemented in IPv6
Code : The lower bound on the number of
(a) (A) and (B) only comparisons needed to solve this variant of the
(b) (B) and (C) only sorting problem is :
n
(c) (A) and (C) only (a) Ω ( n ) (b) Ω 
(d) (A), (B) and (C) k
n n
(c) Ω ( n lg k )
Ans : (d) Fragmentation fields in the base header
(d) Ω  lg 
section of IPv4 have moved to the fragmentation k k
extension header in IPv6 Ans : (d)
UGC NET JRF Computer Science Nove. 2017 Paper-III 259 YCT
 Search on TG: @apna_pdf
Now Huffman coding for character
a = 1111, b = 0, c = 110, d = 1111, e = 10;
length for each character = no. of bits * frequency of
occurrence a = 4* 0.11 = 0.44; b = 1*0.4 = 0.4. c =
3*0.16 = 0.48 d = 4*0.09 = 0.36, e = 2*0.24 = 0.48
Now add these length for average length;
0.44 + 0.4 + 0.48 + 0.36 + 0.48 = 2.16
36. An undirected graph G(V, E) contain n (n > 2)
nodes named v1, v2 .........vn. Two nodes vi and vj
n n
So lower bound = Ω  log  are connected if and only if 0 < i – j  ≤ 2. each
k k edge (vi, vj) is assigned a weight i + j
33. Consider the recurrence relation : The cost of the minimum spanning tree of such
a graph with 10 nodes is :
n
T ( n ) = δT   + Cn,if n > 1 (a) 88 (b) 91
2
(c) 49 (d) 21
= b, if n = 1
Ans : (b) Vertices are numbered V1, V2, V3,
Where b and c are constants.
V4…….V10
The order of the algorithm corresponding to
above recurrence relation is :
(a) n (b) n2
(c) n log n (d) n3
Ans : (d) We can use master theorem to solve this
relation T(n) = a T(n/2) + θ( nk log pn), In given
question
T(n) = 8T (n/2) + cn
here a = 8 & b = 2 and k = 1; clearly a > bk
so T(n) = θ(n logb a)
T(n) = θ(n log28)
i.e. < T(n) = o(n3)
34. Consider the following two sequences :
X = <B, C, D, C, A, B, C>
and Y = <C, A, D, B, C, B>
The length of longest common subsequence of
X and Y is :
(a) 5 (b) 3
(c) 4 (d) 2
Ans : (c)
X = <B, C, D, C, A, B, C>
Y = <C, A, D, B, C, B>
Length of longest common subsequence
= <C, A, B, C>, <C, D, B, C> etc.
=4
35. A text is made up of the characters a, b, c, d, e
each occurring with the probability 0.11, 0.40,
0.16, 0.09 and 0.24 respectively. The optimal
Huffman coding technique will have the
average length of :
(a) 2.40 (b) 2.16
(c) 2.26 (d) 2.15
Ans : (b) a = 0.11, b = 0.40, c = 0.16, d = 0.09, e =
0.24 Sum = 3 + 4 + 5 + 8 + 10 + 12 + 14 + 16 + 18 = 91
we will draw a Huffman tree Note: It is also be calculate by n2 – n + 1.

UGC NET JRF Computer Science Nove. 2017 Paper-III 260 YCT
 Search on TG: @apna_pdf
37. An XML document that adheres to syntax Ans : (c)
rules specified by XML 1.0 specification in that Text A
it must satisfy both physical and logical Text B Text C
structured, is called :
Text E
(a) Well - formed (b) Reasonable
Text D Text F
(c) Valid (d) Sophisticated
Ans : (a) An XML document that adheres to syntax 40. Which of the following statements is/are
rules specified by XML 1.0 specification in that it must TRUE?
satisfy both physical & logical structured, is well (A) In HTML, character entities are used to
formed. incorporate external content into a web
38. Which of the following statements (s) is/are page, such as images.
(B) Once a web server returns a cookie to a
TRUE regarding Java serve lets? browser, the cookie will be included in all
(A) A Java servelet is server-side component future requests from the browser to the
that runs on the web server and extends same server.
the capabilities of a server Code :
(B) A servelet can use the user interface (a) Only (A) is TRUE
classes like AWT or swing. (b) Only (B) is TRUE
Code : (c) Both (A) and (B) are TRUE
(a) Only (A) is TRUE (d) Neither (A) nor (B) is TRUE
(b) Only (B) is TRUE Ans : (d) In HTML, character entities are used to
(c) Both (A) and (B) are TRUE incorporate content into a web page such as images. So
(d) Neither (A) nor (B) is TRUE this statement is wrong.
Ans : (a) A Java servlet is a server side component that Once a web server return a cookie to a browser, the
runs on the web browser and extends the capabilities of cookie will be included in all future requests from the
browser to the same server. So this is also a wrong one.
a server. It is correct statement a Java servlet can't be
use interfaces classes like AWT or swing. 41. Which of the following statements is/are TRUE
39. Consider the following HTML table definition : regarding JAVA?
(A) Constants that cannot be changed are
<table border = 1> declared using the 'static' keyword
<tr> (B) A class can only inherit one class but can
<td colspan = 2>Text A </td> implement multiple interfaces
</tr> Code :
<tr> (a) Only (A) is TRUE
<td> Text B </td> (b) Only (B) is TRUE
<td> Text C </td> (c) Both (A) and (B) are TRUE
</tr> (d) Neither (A) nor (B) is TRUE
<tr> Ans : (b) In java, content are not declared using 'static'
<td rowspan = 2> Text D </td> keyword and a class can implement multiple interfaces
but class can inherit one class only.
<td> Text E </td>
</tr> 42. What is the output of the following JAVA
<tr> program?
<td> Text F </td> Class Test
{
</tr>
public static void main (String [ ] args)
</table>
{
The above HTML code would render on
Test obj = new Test ( );
screen as : obj. start ( ) ;
}
void start ( )
{
(a) (b) String stra = "do";
String strb = method (stra);
System.out.print(":" + stra + strb);
}
(c) (d) String method (string stra)

UGC NET JRF Computer Science Nove. 2017 Paper-III 261 YCT
 Search on TG: @apna_pdf
{ Ans : (d)
stra = stra + "good"; MTBF
System.out.print(stra); Availability =
(MTBF + MTRR)
return "good";
}  91.25 × 24 × 60 
=  
}  91.25 × 24 × 60 + 5 
(a) dogood : dogoodgood Availability = 99.9962%
(b) dogood : gooddogood 46. Consider the method mcq ( ) :
(c) dogood : dodogood
int mcq (boolean a, boolean b, boolean c,
(d) dogood : dogood
boolean d)
Ans : (d) The output of the given Java program is {
dogood : dogood .
int ans = 1;
43. Statistical software quality assurance in if (a) {ans = 2;}
software engineering involves............... else if (b) {ans = 3;}
(a) using sampling in place of exhaustive testing else if (c) {
of software
if (d) {ans = 4;}
(b) surveying customers to find out their
}
opinions about product quality
return ans;
(c) tracing each defect to its underlying cause,
isolating the vital few causes, and moving to }
correct them M1 = Number of tests to exhaustively test mcq
(d) tracing each defect to its underlying causes, ( );
and using the pare to principle to correct each M2 = Minimum number of tests to achieve full
problem found statement coverage for mcq ( ); and
M3 = Minimum number of tests to achieve full
Ans : (c) Statistical software quality assurance in
branch coverage for mcq ( );
software engineering involves tracing each defect to its
underlying cause, isolating the vital few causes, and then (M1, M2, M3) = ...................
moving to correct them. (a) (16, 3, 5) (b) (8, 5, 3)
(c) (8, 3, 5) (d) (16, 4, 4)
44. Which of the following statements is/are
FALSE with respect to software testing? Ans : (d)
S1 : White-box tests are based on
specifications; better at telling whether
program meets specification, better at
finding errors of omission
S2 : Black-box tests are based on code; better
for finding crashes, out of bounds errors,
file not closed errors.
S3 : Alpha testing is conducted at the
developer's site by a team of highly skilled
testers for software that is developed as a
product to be used by many customers
(a) Only S1 and S2 are FALSE
(b) Only S1 and S3 are FALSE
(c) Only S2 and S3 are FALSE So, number of test to exhaustively test = 16
(d) All of S1, S2 and S3 are FALSE Full statement coverage = 4
Ans : (a) Alpha testing is conducted at the developer's Full branch coverage for = 4
site by a team of highly skilled testers for software that 47. A simple stand – alone software utility is to be
is developed as a product to be used by many customers
statement about white box testing and black box testing developed in 'C' programming by a team of
software experts for a computer running Linux
are not correct. Only the last statement is correct.
and the overall size of this software is estimated
45. A signal processor software is expected to operate to be 20, 000 lines of code. Considering (a, b) =
for 91.25 days after repair, and the mean (2.4, 1.05) as multiplicative and exponention
software repair time is expected to be 5 minutes. factor for the basic COCOMO effort
Then, the availability of the software is : estimation equation and (c, d) = (2.5, 0.38) as
(a) 96.9862% (b) 97.9862% multiplicative and exponention factor for the
(c) 98.9962% (d) 99.9962% basic COCOMO development time estimation
UGC NET JRF Computer Science Nove. 2017 Paper-III 262 YCT
 Search on TG: @apna_pdf
equation, approximately how long does the Now we have calculate average waiting time for
software project take to complete? schedule avg waiting time = WT(P1 + P2 + P3 + P4)/4
(a) 10.52 months (b) 11.52 months = 26/4 = 6.5
(c) 12.52 months (d) 14.52 months 50. Consider a virtual page reference string 7, 0, 1,
Ans : (b) Total lines codes is 20,000 and (a, b) = (2.4k, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
1.05) and (c, d) = (2.5, 0.38) are the multiplicative & Suppose a demand paged virtual memory
exoneration factor for basis COCOMO development
system running on a computer system such
time equation. After that the total software take to
that the main memory has 3 page frames.
complete is 11.52 months.
Then.............. page replacement algorithm has
48. In software configuration Management (SCM), minimum number of page faults.
which of the following is a use-case supported (a) FIFO (b) LIFO
by standard version control system? (c) LRU (d) Optimal
(a) Managing several versions or release of a
Ans : (d) In optimal algorithm 9 page fault will occur
software
(b) Filing bug reports and tracking their
progress
(c) allowing team members to work in parallel
(d) Identifying when and where a regression and if FIFO algorithm is fault will occur & in LIFO 11
occurred page fault will occur & in LRU 12 page fault will occur.
Code : So the minimum page fault will occur in optimal
algorithm.
(a) Only (A), (C), and (D)
(b) Only (A), (B) and (C) 51. User level threads are threads that are visible
(c) Only (A), (B) and (D) to the programmer and are unknown to the
(d) Only (B), (C) and (D) kernel. The operating system kernel supports
and manages kernel level threads. Three
Ans : (a) Managing several version of software is different types of models relate user and kernel
managed by SCM filling bug reports & tracking their level threads.
progresses not managed by SCM. Allowing team
Which of the following statements is/are true?
members to work in parallel is managed by SCM.
(A) (i) The many to one model maps many
Identifying when and where a regression occurred is
user threads to one kernel thread
managed by SCM.
(ii) The one - to - one model maps one
49. Consider the following four processes with the user threads to one kernel thread
arrival time and length of CPU burst given in (iii) The many model maps many user
milliseconds : threads to smaller or equal kernel
Process Arrival Time Burst threads
Time (B) (i) Many - to- one model maps many
P1 0 8 kernel threads to one user thread
P2 1 4 (ii) One - to - one model maps one
kernel thread to one user thread
P3 2 9
(iii) Many - to - many model maps many
P4 3 5
kernel threads to smaller or equal
The average waiting time for preemptive SJF user threads
scheduling algorithm is ............. Code :
(a) 6.5 ms (b) 7.5 ms (a) (A) is true; (B) is false
(c) 6.75 ms (d) 7.75 ms (b) (A) is false; (B) is true
Ans : (a) First we will make Gantt chart of given (c) Both (A) and (B) are true
process then we will calculate turn around time and (d) Both (A) and (B) are false
waiting time of individual process.
Ans : (a)
(a) (i) The may to one model maps many user thread to
one kernel thread.
(ii) The one to one model maps one user thread to one
kernel thread.
(iii) The many to many model maps many user thread to
smaller or equal kernel threads.
(b) (i) Many to one model maps many kernel thread to
one user thread.
UGC NET JRF Computer Science Nove. 2017 Paper-III 263 YCT
 Search on TG: @apna_pdf
(ii) One to one model maps one kernel thread to one 54. The Bounded buffer problem is also known
user thread. as............
(iii) Many to many model maps many kernel thread to
(a) Producer - consumer problem
smaller or equal user thread
(b) Reader - writher problem
So all statements are correct hence option (a) is answer.
(c) Dining philosophers problem
52. Consider a system with five processes P0
(d) Both (2) and (3)
through P4 and three resource types A, B and
C Resource type seven instances, resource type Ans : (a) The producer consumer problem (or bounded
B has two instances and resource type C has six buffer problem) describes two processes, the producer
instances suppose at time T0 we have the and the consumers which share a common, fixed size
following allocation. buffer used as a queue. Producer produces an item &
Process Allocation Request Available put into buffer. If buffer is already full then producer
A B C A B C A B C will wait for an empty block in buffer consumer
P0 0 1 0 0 0 0 0 0 0 consumes an item from buffer.
P1 2 0 0 2 0 2 55. In Artificial Intelligence (Al), which agent deals
P2 3 0 3 0 0 0 with happy and unhappy state?
P3 2 1 1 1 0 0 (a) Simple reflex agent (b) Model based agent
P4 0 2 2 0 0 2 (c) Learning agent (d) Utility based agent
If we implement Deadlock detection algorithm Ans : (b) Model based agent deals with happy &
we claim that system is .............
unhappy state in artificial intelligence (AI). So option
(a) Semaphore (b) Deadlock state
(b) is correct
(c) Circular wait (d) Not in deadlock state
Ans : (d) 56. If b is the branding factor and m is the
Process Allocation Request Available maximum depth of the search tree, what is the
A B C A B C A B C space complexity of greedy search?
0 0 0 (a) O(b + m) (b) O(bm)
P0 0 1 0 0 0 0 3 1 3 (c) O(bm) (d) O(mb)
P1 2 0 0 2 0 2 5 1 3 Ans : (c) (1) In binary tree branching factor is 2 and
P2 3 0 3 3 0 3 3 0 3 space complexity of height n is 0(2n)
P3 2 1 1 2 1 1 7 2 4 (2) In ternary tree branching factors is 3 & space
P4 0 2 2 0 0 2 7 4 6 complexity for height n is o(3n) similarly
So, not in deadlock state. (3) If branching factor is b and height is m for search
n
53. Consider a disk queue with requests for I/O to tree then space complexity for greedy search is o(b ) .
blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 57. Let P, Q, R and S be propositions. Assume that
67. Suppose SSTF disk scheduling algorithm the equivalences P ⇔ (Q ∨ ¬Q) and Q ⇔ R
implemented to meet the requests then the total
number of head movements are ............. if the hold. Then the truth value of the formula (P ∧
disk head is initially at 53. Q) ⇒ (P ∧ R) ∨ S) is always :
(a) 224 (b) 248 (a) True
(c) 236 (d) 240 (b) False
Ans : (c) (c) Same as truth table of Q
(d) Same as truth of S
Ans : (a)
1. P ⇔ (Q ∨¬ Q) ≡ P ⇔ 1 = P′
2. Q ⇔ R ≡ Q′R′ + QR
Given (P∧Q) ⇒ ((P∧R) ∨ S)
(P∧R) ⇒ ((P∧R) ∨ S)
(PR)′ + PR + S
= P '+ R ' + P R + S
Now add all seek time = P' + R + R' + S = 1
12 + 2 + 30 + 23 + 84 + 24 + 2 + 59 = 236 So, always true.
UGC NET JRF Computer Science Nove. 2017 Paper-III 264 YCT
 Search on TG: @apna_pdf
58. "If X, then Y unless Z" is represented by which Ans : (b) Context free grammar are not closed under
of the following formulae in propositional intersection context free language are accepted by
logic? pushdown automata but not by finite automata - context
(a) (X ∧ Y) → ¬ Z free grammar.
(b) (X ∧ ¬ Z) → Y 63. Consider the following language :
(c) X → (Y ∧ ¬ Z)
L1 = {ambn  m ≠ n}
(d) Y → (X ∧ ¬ Z)
L2 = {am bn  m = 2n + 1}
Ans: (b) If X then Y is represented by X → Y one more
condition is unless Z, it will be included in X, so X then L3 = {ambn m ≠ 2n}
Y unless Z is represented by (X ^ ¬ Z) → Y Which one the following statement is correct?
59. Consider the following two well-formed (a) Only L1 and L2 are context free languages
formulas in prepositional logic. (b) Only L1 and L3 are context free languages
F1 : P ⇒ ¬ P (c) Only L2 and L3 are context free languages
F2 : (P ⇒ ¬ P) ∨ (¬P ⇒P) (d) L1, L2 and L3 are context free languages
Which of the following statements is correct? Ans : (d) (1) In L1 we have to check for m is not equal
(a) F1 is satisfiable, F2 is valid to n there are infinite number which falls under this
(b) F1 is unsatisfiable, F2 is satisfiable category but we have only one comparison with m and
(c) F1 is unsatisfiable, F2 is valid n. So it is context free language
(d) F1 and F2 both are satisfiable (2) In L2 one comparison with infinite possibilities of m
Ans : (b) F1 : P → ¬ P and n it also a CFL
= ¬P(¬P) + P¬ (¬P) (3) It is also a CFL
= ¬P + P is satisfiable 64. A 4 × 4 DFT matrix is given by :
F2 : (P ⇒ ¬P) ∨ (¬⇒ P) 1 1 1 1
⇒ ( ¬ P (¬P) + P ¬ ( ¬P)) ∨ (P ¬ (¬P) + ¬P (¬P))) 
1 1 x -1 y 
= satisfiable ∨ satisfiable = satisfiable
So option (a) is correct 2 1 -1 1 -1
 
60. Standard planning algorithms assume 1 -j -1 j 
environment to be............... (j2 = –1)
(a) Both deterministic and fully observable Where values of x and y are ........., ............
(b) Neither deterministic nor fully observable respectively.
(c) Deterministic but not fully observable (a) 1, –1 (b) –1, 1
(d) Not deterministic but fully observable (c) –j, j (d) j, –j
Ans : (a) Standard planning algorithms assume Ans : (d) A 4 × 4 discrete fourier transformation will
environment to be both deterministic and fully be look like:
observable.
1 1 1 1 
61. Which of the following statements is not  
1 1 x −1 y 
correct? [where j2 = -1]
(a) Every recursive language is recursively n 1 −1 1 −1 
 
enumerable 1 − j −1 j 
(b) L = {0n 1n 0n n = 1, 2, 3, .......} is w = x and w3 = y
recursively enumerable
Here, w2 = -1 given on comparing
(c) Recursive language are closed under
intersection i.e. w2 = j2
(d) Recursive language are not closed under So w = j i.e. x = j
intersection. And w3 = w. w2
Ans : (d) Recursive language are closed under = x – 1 = j, -j
intersection so option (d) is correct. 65. Entropy of a discrete random variable with
62. Context free grammar is not closed under : possible values {x1, x2, ......, xn} and probability
(a) Concatenation density function P(X) is :
(b) Complementation n
(c) Kleene Star H ( X ) = -∑ P ( xi ) log b P ( xi )
(d) Union i=1

UGC NET JRF Computer Science Nove. 2017 Paper-III 265 YCT
 Search on TG: @apna_pdf
The value of be gives the units of entropy. The
unit for b = 10 is :
(a) bits
(b) bann
(c) nats
(d) deca
Ans : (c) Information entropy or Shannon's entropy
quantities the amount of uncertainty involved in the
value of a random variable or the outcome of a random
process.
4x1 + 6x2 = 360
66. For any binary (n, h) linear code with
3x1 = 180
minimum distance (21 + 1) or greater n – h ≥ 5x2 = 200
 α  n  Z is maximum at a vertex of a feasible region, which is
log2  ∑    where α is :
polygon, given in table at 0, A, B, C and D.
 i=0  i  
(a) 2t + 1 Extreme Point Co-ordinates Z
(b) t + 1 0 (0, 0) 0
(c) t – 1 A (60, 0) 900
(d) t B (60, 20) 1110
Ans : (b) Answer is t + 1 means . C (30, 40) 850
67. Which of the following is a valid reason for D (0, 40) 400
causing degeneracy in a transportation Maximum Z = 1110 at the point (60, 20).
problem? Here is no. of rows and n is no. of 69. Consider the following LPP :
columns in transportation table Min Z = 2x1 + x2 + 3x3
(a) When the number of allocation is m + n –1 Subject to :
(b) When two or more occupied cells become x1 – 2x2 + x3 ≥ 4
unoccupied simultaneously 2x1 + x2 + x3 ≤ 8
(c) When the number of allocations is less than x1 – x3 ≥ 0
m+n–1 x1 – x2, x3 ≥ 0
(d) When a loop cannot be drawn without using The solution of this LPP using Dual Simplex
unoccupied cells, except the starting cell of method is :
the loop (a) x1 = 0, x2 =0, x3 = 3 and Z = 9
Ans : (c) When the number of allocations is less than (b) x1 = 0, x2 = 6, x3 = 0 and Z = 6
m + n – 1, It causes degeneracy in transpiration (c) x1 = 4, x2 = 0, x3 = 0 and Z = 8
problem. (d) x1 = 2, x2 = 0, x3 = 2 and Z = 10
68. Consider the following LPP : Ans : (c) Ist step in dual simplex method is to convert
the given problem into canonical from.
Max Z = 15x1 + 10x2
In canonical form given function should be of max type
Subject to the constraints Thus, to make it max, multiply both sides by–1, This
4x1 + 6x2 ≤ 360 objective becomes max (–2) = – 2x, –x2 – 3x3
3x1 + 0x2 ≤ 180 subject to
0x1 + 5x2 ≤ 200 –x + 2x2 – x3 = ≤ – 4
x1, x2 ≥ 0 2x1 + x2 + x3 ≤ 3
The solution of the LPP using Graphical –x1 + x3 ≤ 0
solution technique is : & the second step is to write standard form & then
(a) x1 = 60, x2 = 0 and Z = 900 iterate it and in the last the value is z = 8, x1 = 4, x2 = 0,
(b) x1 = 60, x2 = 20 and Z = 1100 x3 = 0.
(c) x1 = 60, x2 = 30 and Z = 1200 70. Consider a Takagi – Sugeno – Kang (TSK)
(d) x1 = 50, x2 = 40 and Z = 1150 Model consisting of rules of the form :
Ans : (b) If x1 is Ai1 and....... and xr is Air

UGC NET JRF Computer Science Nove. 2017 Paper-III 266 YCT
 Search on TG: @apna_pdf
THEN y = fi(x1, x2, ........., xr) = bi0 + bi1 x1 + 73. Consider the following statements :
.....birxr (A) UNIX provides three types of permissions
assume, αi is the matching degree of rule i, then * Read
the total output of the model is given by : * Write
L * Execute
(a) y = ∑ α i fi ( x1 , x 2 ,....., x r ) (B) UNIX provides three sets of permissions
i =1
* permission for owner
L
∑ αi fi ( x1, x 2 ,....., x r )
* permission for group
i =1
* permission for others
(b) y= L Which of the above statement/s is/are true?
∑ αi (a) Only (A)
i =1 (b) Only (B)
L (c) Both (A) and (B)
∑ fi ( x1 , x 2 ,....., x r ) (d) Neither (A) nor (B)
i =1
(c) y= L Ans : (c) UNIX provides read, write and execute
∑ αi permission on files UNIX provides there set of
i =1 permission
Permission for owner
y = max  αi fi ( x1 , x 2 ....., x r ) 
(d) i Permission for group
Permission for others
Ans : (b) So statement (a) & (b) are correct.
L 74. Which of the following routing technique/
∑ αi fi ( x1, x 2 ,....., x r ) techniques is/are used in distributed systems?
i =1
y= L
(A) Fixed Routing
∑ αi (B) Virtual Routing
(C) Dynamic Routing
i =1
Code :
71. Consider a single perceptron with sign
(a) (A) only (b) (A) and (B) only
activation function. The perceptron is (c) (C) only (d) All (A), (B), (C)
represented by weight vector [0.4 – 0.3 0.1]t
Ans : (a) Distributed system uses fixed routing
and a bias θ = 0. If the input vector to the technique dynamic & virtual routing are not used is
pepceptron is X = [0.2 0.6 0.5] then the output distributed system.
of the perceptron is :
75. Match the following WINDOWS system calls
(a) 1 (b) 0
and UNIX system calls with reference to
(c) –0.05 (d) –1 process control and file manipulation.
Ans : (c) Here it is given input vector = [0.2 0.6 0.5] & Windows UNIX
weight vector w = [0.4 – 0.3 2.1]T A. Create - process ( ) i. Open ( )
The output of the perception will be the summation of x
B. Wait for single ii. Close ( )
& w represented as, object ( )
Σ : Xi Wi ( i = 1, 2, 3 because there are 3 values of X & C. Create file ( ) iii. Fork ( )
W) [ 0.2 0.6 0.5] * [0.4 – 0.3 0.1] = [0.2 * 0.4 0.6 *(–
D. Close Handle ( ) iv. Wait ( )
0.3) 0.5 * 0.1] =
Code :
[0.08 – 0.18 + 0.05] = 0.05
A B C D
72. The Sigmoid activation function f(t) is defined (a) iii iv i ii
as : (b) iv iii i ii
1 (c) iv iii ii i
(a) (b) t exp (–t)
exp ( t ) + exp ( − t ) (d) iii iv ii i
Ans : (b) 1. In UNIX wait ( ) is used to create process
1 1
(c) (d) ()
1 + exp ( t ) 1 + exp ( − t ) 2. In UNIX fork ( ) is used for wait for single object ( )
Ans : (c) The sigmoid activation function (t) is defined 3. In UNIX create ( ) is used for create file ( )
as 1/1 + exp (t). 4. In UNIX close ( ) is used for close handle ( )
UGC NET JRF Computer Science Nove. 2017 Paper-III 267 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2018

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. The definitions in an XML document are said {
to be __________ when the tagging system and long [ ] P= {3, 4, 5};
definitions in the DTD are all in compliance. long [ ] Q= method (P);
(a) well-formed (b) reasonable System.out.print (P[0]+P[1]+P[2]+":");
(c) valid (d) logical System.out.print (Q[0] + Q[1] + Q[2]);
Ans. (c) : A DTD is document type definition A DTD }
defines the structure and the legal elements and long [ ] method (long [ ] R)
attributes of an XML document. Why use a DTD– {
with a DTD, independent groups of people can agree R [1]=7;
on standard DTD for interchanging data. An return R;
application can use a DTD to verify that XML data is }
valid. } //end of class
2. Consider the JavaScript Code : (a) 12 : 15 (b) 15 : 12
var y= "12"; (c) 12 : 12 (d) 15 : 15
function f( ) { Ans. (d) : Output is 15:15
var y= "6"; 1. p = 3, 4, 5
alert (this.y); 2. q = 3, 7, 5
function g( ) {alert (y); } When we have the statement long [ ] Q = method (p).
g( ); It will call method function and p is passed as
} parameter and in method function we are changing r
f( ); [1] = 7.
If M is the number of alert dialog boxes Actually arrays are passed as parameter and in method
generated by this JavaScript code and D1, D2, function we are changing r[1] = 7.
...., DM represents the content displayed in Actually arrays are passed as reference. So whatever
each of the M dialog boxes, then : changes you make in r, it actually gets reflected in p.
(a) M=3; D1 displays "12"; D2 displays "6"; D3 Hence both the arrays will display sum = 3+7+5 = 15.
displays "12". 4. What is the output of the following ‘C’
(b) M=3; D1 displays "6"; D2 displays "12"; D3 program ? (Assuming little - endian
displays "6". representation of multi-byte data in which
Least Significant Byte (LSB) is stored at the
(c) M=2; D1 displays "6"; D2 displays "12".
lowest memory address.)
(d) M=2; D1 displays "12"; D2 displays "6".
#include <stdio.h>
Ans. (d) : Alert box will be called 2 times so M = 2 #include <stdlib.h>
first dialog box alert (this y) is used to access the value /* Assume short int occupies two bytes of storage
of variable which is outside from */
f ( ) ⋅ So D1 = 12 int main ( )
Second dialog box alert (y) inside nested function g ( ) {
is used to access the local variable y. So D2 will be 6. union saving
3. What is the output of the following JAVA {
program ? short int one;
class simple char two[2];
{ };
public static void main(String[ ] args) union saving m;
{ m.two [0] = 5;
simple obj = new simple( ); m.two [1] = 2;
obj.start( ); printf(’’%d, %d, %d\n”, m.two [0], m.two
} [1], m.one);
void start( ) }/* end of main */
UGC NET JRF Computer Science June 2018 Paper-II 268 YCT
 Search on TG: @apna_pdf
(a) 5, 2, 1282 (b) 5, 2, 52 Which of these would actually swap the
(c) 5, 2, 25 (d) 5, 2, 517 contents of the two integer variables p and q ?
Ans. (d) : Big-endian and little-endian are terms that (a) (a) only (b) (b) only
describe the order in which a sequence of bytes are (c) (c) only (d) (b) and (c) only
stored in computer memory. Ans. (b) : Void swap 2(int & a, int & b)
Big-endian is an order in which the "big and" (most You are expecting the variable to pass by reference
significant value in the sequence) is stored first (at the (which is the address of an integer variable).
lowest storage address). Little-endian is an order in So,
which the "little end" (least ⋅ significant value in the void swap (int &a, int &b)
sequence) is stored first. {
Short in tone;  int temp;
 − 2 bytes
Char two [2];  temp = a;
in union saving m; m is variable a = b;
here m⋅two [0] = 5; the 5 is not in single inverted b = temp;
comma ‛ ’ so it is numeric value or number }
So, 5 binary equivalent = 0000 0101 int main( )
and 2 binary equivalent = 0000 0010 {
Now we are using %d for printing the character. int p = 0, q = 1; swap (p, q);
m⋅two [0] = 5; }
m⋅two [1] = 2; 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.
incase of array "1" address will 1000 and 2nd will 1001. S2 : A class can only inherit one class but can
% d will print decimal value of ⋅m⋅ two [0] = 5; = 5 implement multiple interfaces.
Now m⋅ two [1] = 2; = 2 S3 : Java permits a class to replace the
implementation of a method that it has inherited.
Now m⋅ one
It is called method overloading.
Code :
So, according to ⋅little⋅ endian definition (a) S1 and S2 only
0000 0101 will – Lowest memory address (b) S1 and S3 only
0000 0010 – most significant byte. (c) S2 and S3 only
Now evaluate this have value– (d) All of S1, S2 and S3
0000 ⋅ 00 1 0 0 000 ⋅ 0 1 0 1 Ans. (a) : In Java, items with the final modifier cannot
| |
29 28
|
27
| | |
22 21 20
be changed!
This includes final classes, final variables, and final
Total will be = 517
methods.
5. Given below are three implementations of the
A final class cannot be extended by any other class
swap( ) function in C++ :
A final variable cannot be reassigned another value
(a) (b) (c) A final method cannot be overridden
void swap (int a, void swap (int &a, void swap (int *a, A final class is simply a class that can't be extended.
int b) int &b) int *b)
(This does not mean that all reference to objects of the
{ { { class would act if they were declared as final).
int temp; int temp; int *temp;
⇒ A Java class only extend one parent class. Multiple
temp = a; temp = a; temp = a; inheritance (extends) is not allowed. Interfaces are not
a = b; a = b; a = b; classes, however, and a class can implement more than
b = temp; b = temp; b = temp; one interface.
} } } The parent interfaces are declared in a comma-
int main( ) int main( ) int main( ) separated list, after the implements key words. In
{ { { conclusion, yes, it is possible to do.
int p=0, q=1; int p = 0, q = 1; int p = 0, q = 1; 7. Which of the following statements is/are True ?
swap (p, q); swap (p, q); swap (&p, &q); P : C programming language has a weak type
} } } system with static types.
UGC NET JRF Computer Science June 2018 Paper-II 269 YCT
 Search on TG: @apna_pdf
Q : Java programming language has a strong type 2 0 2
system with static types. 10. Consider the matrix M = 0 1 1  representing
Code :  
0 0 1 
(a) P only (b) Q only
a set of planar (2D) geometric transformations
(c) Both P and Q (d) Neither P nor Q
in homogeneous coordinates. Which of the
Ans. (c) : C programming language has a weak type following statements about the matrix M is
system with static types. True
True ?
Java programming language has a strong type system
(a) M represents first, a scaling of vector (2, 1)
with static types. True
followed by translation of vector (1, 1)
Both Statements are True.
(b) M represents first, a translation of vector (1,
8. A graphic display system has a frame buffer
1) followed by scaling of vector (2, 1)
that is 640 pixels wide, 480 pixels high and 1 bit
of color depth. If the access time for each pixel (c) M represents first, a scaling of vector (3, 1)
on the average is 200 nanoseconds, then the followed by shearing of parameters (−1, 1)
refresh rate of this frame buffer is (d) M represents first, a shearing of parameters
approximately : (−1, 1) followed by scaling of vector (3, 1)
(a) 16 frames per second
Ans. (a) : M represents first, a scaling of vector (2, 1)
(b) 19 frames per second
followed by translation of vector (1, 1)
(c) 21 frames per second
Matrix for scalling vector (2, 1) =
(d) 23 frames per second
Ans. (a) : Here 640 pixel wide of screen means 2 0 0
vertical line on screen and 480 pixels high is means 0 1 0
vertical line on screen. 0 0 1
Now width (w) = 640 px, weight (w) = 480 px Matrix for translation vector (1, 1) =
Total = 640 × 480 = 307200 1 0 1
Color depth = 1-bit/px 0 1 1
Memory required for total pixel = w × h × color depth 0 0 1
= 640×480×1-bit=307200
Multiplying both we get the resultant vector
1 pixel takes 200 nano second to refresh
To refresh the whole screen = 640 × 480 × 200ns 2 0 2
= 61440000 nano second 0 1 1
1 0 0 1
For 1 nano second = screen
61440000 M represents first, a scaling of vector (2, 1) followed
Now convert nano second to second = 10 9 by translation of vector (1, 1)
1 So, option (a) is correct.
For 1 nano second = × 109
61440000 11. Assume the following regarding the
= 16.2760 = 16 (Approximately) development of a software system P :
9. Which of the following statements is/are True - Estimated lines of code of P : 33, 480 LOC
regarding the solution to the visibility problem - Average productivity for P : 620 LOC per
in 3D graphics ? person-month
S1 : The Painter’s algorithm sorts polygons by - Number of software developers : 6
depth and then paints (scan - converts) each
- Average salary of a software developer : `
Polygon on to the screen starting with the most
nearest polygon. 50,000 per month
S2 : Backface Culling refers to eliminating If E, D and C are the estimated development
geometry with backfacing normals. effort (in person-months), estimated
Code : development time (in months), and estimated
(a) S1 only (b) S2 only development cost (in ` Lac) respectively, then
(c) Both S1 and S2 (d) Neither S1 nor S2 (E, D, C) =_________.
Ans. (b) : Backface Culling refers to eliminating (a) (48, 8, 24) (b) (54, 9, 27)
geometry with backfacing normals. True (c) (60, 10, 30) (d) (42, 7, 21)
UGC NET JRF Computer Science June 2018 Paper-II 270 YCT
 Search on TG: @apna_pdf
Ans. (b) : Each person developed 620 LOC in a month 15. Match the 5 CMM Maturity levels/CMMI
So, 6 person will develop LOC = 620 × 6 = 3720 LOC staged representations in List-I with their
in a month characterizations in List-II :
⋅33480 List - I List - II
So, time = = = 9 month
3720 a. Initial i. Processes are
Cast (in lacks) = ⋅ 6 ∗ ⋅9 ∗ 50,000 = 27 Lac improved
So, two parameter will match so, option is (b). quantitatively and
12. Match the following in Software Engineering : continually.
List - I List - II b. Repeatable ii. The plan for a project
comes from a template
a. Product i. Software for plans.
Complexity Requirements
c. Defined iii. The plan uses
Definition
processes that can be
b. Structured ii.Software Design measured
System Analysis quantitatively.
c. Coupling and iii. Validation d. Managed iv. There may not exist a
Cohesion Technique plan or it may be
d. Symbolic iv. Software Cost abandoned.
Execution Estimation
e. Optimizing v. There’s a plan and
Code : people stick to it.
(a) (b) (c) (d) Code :
(a) (ii) (iii) (iv) (i)
(a) (b) (c) (d) (e)
(b) (iii) (i) (iv) (ii)
(a) (iv) (v) (i) (iii) (ii)
(c) (iv) (i) (ii) (iii)
(b) (i) (ii) (iv) (v) (iii)
(d) (iii) (iv) (i) (ii)
(c) (v) (iv) (ii) (iii) (i)
Ans. (c) : (d) (iv) (v) (ii) (iii) (i)
13. Which one of the following is not typically Ans. (d) :
provided by Source Code Management
Software ? 16. Coupling is a measure of the strength of the
(a) Synchronisation interconnections between software modules.
Which of the following are correct statements
(b) Versioning and Revision history
with respect to module coupling ?
(c) Syntax highlighting
P : Common coupling occurs when one module
(d) Project forking
controls the flow of another module by
Ans. (c) : Source code management software passing it information on what to do.
provides– Q : In data coupling, the complete data structure
Synchronization, project forking, versioning, revision is passed from one module to another through
hystory⋅ parameters.
But Syntax highlighting is not part of source code R : Stamp coupling occurs when modules share a
management software. composite data structure and use only parts of
14. A software system crashed 20 times in the year it.
2017 and for each crash, it took 2 minutes to Code :
restart. Approximately, what was the software (a) P and Q only (b) P and R only
availability in that year ?
(c) Q and R only (d) All of P, Q and R
(a) 96.9924% (b) 97.9924%
Ans. (c) : According to Myer's classification, which
(c) 98.9924% (d) 99.9924%
defines seven levels of coupling, from tightest to
Ans. (d) : 365 days have 525600 minutes. It takes 2 loosest.
minutes to restart the computer.in 2017. Computer
Content Coupling– Modules rely on each
crash for 20 times.
other's internal data or internal organization.
i.e system was restar – 20 × 2 = 40 minutes Common Coupling– Modules shares the same
So, 525600 – 40 = 525560 available. global data.
System was available for = 525560 minutes software External Coupling– Modules share an externally
⋅525560 imposed data format, communication protocol or
Availability = = ⋅999924 or = 99.9924%
525600 device interface.

UGC NET JRF Computer Science June 2018 Paper-II 271 YCT
 Search on TG: @apna_pdf
Control Coupling– One module controls the 20. Which of the following statements is/are True ?
flow of another, such as by passing it a flag or P : Refactoring is the process of changing a
other information. software system in such a way that it does not
Stamp Coupling–Modules share a composite ⋅ data alter the external behavior of the code yet
structure but use different parts of it. improves the internal architecture.
Data Coupling– Modules share data through Q : An example of refactoring is adding new
parameters such as in a subroutine cell. features to satisfy a customer requirement
Message Coupling– Modules communicate by discovered after a project is shipped.
passing messages. Code :
17. A software design pattern often used to restrict (a) P only (b) Q only
access to an object is : (c) Both P and Q (d) Neither P nor Q
(a) adapter (b) decorator Ans. (a) : Refactoring is the process of changing a
(c) delegation (d) proxy software system in such a way that it does not alter the
Ans. (d) : A proxy is a wrapper or agent ⋅object⋅ that is external behavior of the code yet improves the
being called by the client to access the real serving internal architecture. True
object behind the scenes. Use of the proxy can simply An example of refactoring is adding new features to
be forwarding to the real object or can provide satisfy a customer requirement discovered after a
additional logic. project is shipped. False
Adapter– Match interface of different classes.
Decorator– Add responsibilities objects dynamically. 21. The solution of the recurrence relation
Effectively in the instantiation process, object-creation T(m) = T( 3m 4) + 1 is :
patterns use delegation effectively to get the job done. (a) θ (lg m) (b) θ (m)
18. Reasons to re-engineer a software include : (c) θ (mlg m) (d) θ (lglg m)
P : Allow legacy software to quickly adapt to the Ans. (a) : T(m) = aT(m/b) + f(m)
changing requirements Compare both equation a = 1; b = 4/3
Q : Upgrade to newer technologies / platforms / m ^ (logb a) = m ^ 0 = 1
paradigm (for example, object-oriented)
Whenever m ^ (logb a) and f(m) is equal then answer
R : Improve software maintainability
is f(m)* log m
S : Allow change in the functionality and
architecture of the software Hence 1* log(m) = log(m)
Code : 22. Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14,
(a) P, R and S only (b) P and R only 8, 7>. After building heap from the array A,
(c) P, Q and S only (d) P, Q and R only the depth of the heap and the right child of
Ans. (c) : Allow legacy software to quickly adapt to max-heap are _________ and _________
the changing requirements. True respectively. (Root is at level 0).
Upgrade to newer technologies / platforms / paradigm (a) 3, 14 (b) 3, 10
(for example, object-oriented). True (c) 4, 14 (d) 4, 10
Improve software maintainability. False Ans. (b) :
Allow change in the functionality and architecture of
the software. True
19. Which of the following is not a key strategy
followed by the clean room approach to
software development ?
(a) Formal specification
(b) Dynamic verification
(c) Incremental development
(d) Statistical testing of the system
This is max heap and right of root is 10.
Ans. (b) : The clean room approach to software
development is based on five key strategies : The depth is no. of edge from root to given node so
1. Formal specification. depth is 3.
2. Incremental development. 23. A hash function h defined h(key)=key mod 7,
3. Structured programming only. with linear probing, is used to insert the keys
4. Static verification. 44, 45, 79, 55, 91, 18, 63 into a table indexed
5. Static testing of the system. from 0 to 6. What will be the location of key
But dynamic verification is not the clean room 18?
approach for software development, so option (b) is (a) 3 (b) 4
correct. (c) 5 (d) 6
UGC NET JRF Computer Science June 2018 Paper-II 272 YCT
 Search on TG: @apna_pdf

0 1 2 3 4 5 6 26. A binary search tree in which every non-leaf

Ans. (c) : node has non-empty left and right subtrees is
called a strictly binary tree. Such a tree with 19
Keys = 44, 45, 79, 55, 91, 18, 63, insert one by one, leaves :
0 1 2 3 4 5 6 (a) cannot have more than 37 nodes
start with 44, 44% 7 = 2 (b) has exactly 37 nodes
44
(c) has exactly 35 nodes
0 1 2 3 4 5 6 (d) cannot have more than 35 nodes
Insert 41, 45% 7 = 3
44 45 Ans. (b) : 2(n) –1, where n is the for the leaves nodes.
0 1 2 3 4 5 6 so by that way we have exactly 37 nodes.
Insert 79, 79% 7 = 27 collision 2(19) – 1
44 45 79
= 38 – 1 = 37
→ check 27. Match the following with respect to algorithm
Next cell; collision ⇒ check next cell ⇒ fit at 4 paradigms :
0 1 2 3 4 5 6 List - I List - II
Insert – 55, 55%7 = 6
44 45 79 55 a. The 8-Queen’s i. Dynamic
problem programming
Insert 18, 18%7 = 4 .....collision ⇒ check next cell ⇒
b. Single-Source ii. Divide and
fit at 5 shortest paths conquer
0 1 2 3 4 5 6 c. STRASSEN’s iii. Greedy approach
Therefore 18 fits at location 5.
91 44 45 79 18 55 Matrix
multiplication
24. Which of the following algorithms solves the d. Optimal binary iv. Backtracking
single-source shortest paths ? search trees
(a) Prim’s algorithm Code :
(b) Floyd - Warshall algorithm (a) (b) (c) (d)
(c) Johnson’s algorithm (a) (iv) (i) (iii) (ii)
(d) Dijkstra’s algorithm (b) (iv) (iii) (i) (ii)
Ans. (d) : Dijkstra's algorithm to find the shortest path (c) (iii) (iv) (ii) (i)
from a single source vertex to all other vertices. (d) (iv) (iii) (ii) (i)
1. Create a set spt set (shortest path tree set. Ans. (d) :
2. Assign Q distance value to all vertices in the input 28. The maximum number of comparisons needed
to sort 9 items using radix sort is (assume each
graph.
item is 5 digit octal number) :
3. While spt set don't include all vertices. (a) 45 (b) 72
25. A text is made up of the characters A, B, C, D, (c) 360 (d) 450
E each occurring with the probability 0.08, Ans. (c) : Number of items = 9
0.40, 0.25, 0.15 and 0.12 respectively. The Each item is assumed to be octal number of 5 digit.
optimal coding technique will have the average Base of octal number system = 8
length of : Maximum number of comparisons required to sort
(a) 2.4 (b) 1.87 these 9 items.
(c) 3.0 (d) 2.15 = number of items × number of digits × base of
number system
Ans. (d) : A = 0.08, B = 0.40, C = .25, D=.15, E=0.12
= 9× 5 × 8 = 360
A = 0.08
29. A 5-ary tree is tree in which every internal
B = 0.40 node has exactly 5 children. The number of left
C = 0.25 nodes in such a tree with 8 internal nodes will
D = 0.15 be :
E = 0.12 (a) 30 (b) 33 (c) 45 (d) 125
Code 1 : = (0.08) × 3 + 0⋅40 × 3 + 0⋅15 × 3; 8 × 3 Ans. (b) : In complete n-ary tree,
L = (n – 1) ∗ I +1
= 0⋅25 × 3 = 3
Where L = No. of leaves, I = no. of internal nodes
Code 2 : = 0⋅12×3+0⋅4×2+ 0⋅15×2+0⋅08×3+0⋅25× (2) Here n = 5, I = 8
= 2.22 Therefore, L = (5 – 1)*8 + 1 = 4 * 8 + 1 = 33
UGC NET JRF Computer Science June 2018 Paper-II 273 YCT
 Search on TG: @apna_pdf
30. Consider a Boolean function of ‘n’ variables. Moreover expressive power of T(n + 2) = T(n + 3) = T
The order of an algorithm that determines (n + 4) etc.
whether the Boolean function produces a Therefore we need one more extra auxiliary stack
output 1 is : memory for PDA or we need at least 2 auxiliary
(a) Logarithmic (b) Linear memory to implement TM
(c) Quadratic (d) Exponential Option (d) is correct.
Ans. (d) : N boolean variable ⇒ 2n rows in truth table. 34. Pushdown automata can recognize language
For saying o/p 1-for the given function in worst case it generated by_________.
needs to check every possible row ⇒ O(2n) ⇒ (a) Only context free grammar
Exponential. (b) Only regular grammar
31. Two finite state machines are said to be (c) Context free grammar or regular grammar
equivalent if they : (d) Only context sensitive grammar
(a) Have the same number of edges Ans. (c) : Pushdown automata recognize regular as
(b) Have the same number of states well as context free grammar.
(c) Recognize the same set of tokens 35. To obtain a string of n Terminals from a given
(d) Have the same number of states and edges Chomsky normal form grammar, the number
of productions to be used is :
Ans. (c) : Two finite state machines are said to be
equivalent if they, Recognize the same set of tokens. (a) 2n − 1 (b) 2n
(c) n + 1 (d) n2
32. The finite state machine given in figure below
recognizes : Ans. (a) : In CNF, the height of the syntax tree is 2n–
1, i.e.–
2n–1 productions are used to obtain a string on n
terminals.
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 ?
(a) Only G1 is ambiguous
(b) Only G2 is ambiguous
(a) any string of odd number of a’s (c) Both G1 and G2 are ambiguous
(b) any string of odd number of b’s (d) Both G1 and G2 are not ambiguous
(c) any string of even number of a’s and odd
Ans. (c) : For grammar G1
number of b’s
try to make string aba then we will get two parse tree,
(d) any string of odd number of a’s and odd
So, G1 is ambiguous
number of b’s
for grammar G2
Ans. (d) :
try to make string ab then we will get two
(a) Any string of odd number of a's – a, aaa these are
parse tree
not accepted.
So, G2 is ambiguous.
(b) Any string of odd number of b's– b, bbb these are
not accepted. 37. Context sensitive language can be recognized
(c) Any string of even number of a's and odd number by a :
of b's– aab, aabbb, aaaabbb, aabb, These are not (a) Finite state machine
accepted. (b) Deterministic finite automata
(d) Any string of odd number of a's and odd number of (c) Non-deterministic finite automata
b's– ab, ba, aaab, bbba, abbb, aaabbb ....... These (d) Linear bounded automata
are accepted. Ans. (d) : Context sensitive language can be
33. A pushdown automata behaves like a Turing recognized by a linear bounded automata for context
machine when the number of auxiliary sensitive grammar we need linear bounded automata.
memory is : 38. The set A={ 0n 1n 2n | n=1, 2, 3, ......... } is an
(a) 0 (b) 1 example of a grammar that is :
(c) 1 or more (d) 2 or more (a) Context sensitive (b) Context free
Ans. (d) : Pushdown automata have only one stack (c) Regular (d) None of the above
n n n
with 2 stacks we can implement queue = ⇒ T(n + 2) is Ans. (a) : a b c is context sensitive grammar. We
sufficient form Turning Machine. need two stack.

UGC NET JRF Computer Science June 2018 Paper-II 274 YCT
 Search on TG: @apna_pdf
39. A bottom-up parser generates : 44. Which of the following statements are true ?
(a) Left-most derivation in reverse (a) Advanced Mobile Phone System (AMPS) is a
(b) Right-most derivation in reverse second generation cellular phone system.
(c) Left-most derivation (b) IS - 95 is a second generation cellular phone
(d) Right-most derivation system based on CDMA and DSSS.
Ans. (b) : A bottom-up parser generates is right-most (c) The Third generation cellular phone system
derivation in reverse. will provide universal personnel
40. Consider the following statements( ) : communication.
S1 : There exists no algorithm for deciding if any Code :
two Turing machines M1 and M2 accept the (a) (a) and (b) only (b) (b) and (c) only
same language. (c) (a), (b) and (c) (d) (a) and (c) only
S2 : The problem of determining whether a Turing Ans. (b) :
machine halts on any input is undecidable. (a) Its false, advance mobile phone system (AMPS) is
Which of the following options is correct ? first generation cellular phone system. It uses
(a) Both S1 and S2 are correct separate frequencies or channels for conversation
(b) Both S1 and S2 are not correct that's why it requires considerable bandwidth for
(c) Only S1 is correct large number of users.
(d) Only S2 is correct (b) Its true, IS-95 is a second generation cellular phone
Ans. (a) : system based on CDMA and DSSS.
S1 : Equivalence test of two TM is undecidable. (c) Its true, the third generation cellular phone system
S2 : Halting problem of TM is undecidable. will provide universal personnel communication.
41. A slotted ALOHA network transmits 200-bit 45. Match the following symmetric block ciphers
frames using a shared channel with a 200 Kbps with corresponding block and key sizes :
bandwidth. Find the throughput of the system, List - I List - II
if the system (all stations put together)
a. DES i. block size 64 and key
produces 250 frames per second :
size ranges between
(a) 49 (b) 368
32 and 448
(c) 149 (d) 151
b. IDEA ii. block size 64 and key
Ans. (a) : The frame transmission time = 200/200Kbps
size 64
= 1ms
c. BLOW iii. block size 128 and
G = 1/4
FISH key sizes 128, 192,
So, S = Ge–G = 0.195 = 19.5%
256
This means that the throughput is 250*0.195 = 49
frames only 49 out of 250 frames will survive. d. AES iv. block size 64 and key
size 128
42. The period of a signal is 100 ms. Its frequency
is _________. Code :
3
(a) 100 Hertz −2
(b) 10 KHz (a) (b) (c) (d)
−3
(c) 10 KHz 5
(d) 10 Hertz (a) (iv) (ii) (i) (iii)
Ans. (b) : Frequency is the inverse of time period. (b) (ii) (iv) (i) (iii)
(c) (ii) (iv) (iii) (i)
1
f = 1/t = 1/100 ms = −1 s (d) (iv) (ii) (iii) (i)
10
= 10Hz = 10–2 KHz Ans. (b) :
43. The dotted-decimal notation of the following 46. Which of the following statements are true ?
IPV4 address in binary notation is _________. (a) Three broad categories of Networks are
10000001 00001011 00001011 11101111 (i) Circuit Switched Networks
(a) 111.56.45.239 (b) 129.11.10.238 (ii) Packet Switched Networks
(c) 129.11.11.239 (d) 111.56.11.239 (iii) Message Switched Networks
(b) Circuit Switched Network resources need not
Ans. (c) : 10000001 = 27 + 20 = 129
be reserved during the set up phase.
00001011 = 20 + 23 + 21 = 11
(c) In packet switching there is no resource
11101111 = 20 + 21 + 22 + 23 + 25 + 26 + 27
allocation for packets.
= 239
Code :
Hence in dotted decimal notation, it would be
(a) (a) and (b) only (b) (b) and (c) only
129.11.11.239.
(c) (a) and (c) only (d) (a), (b) and (c)
UGC NET JRF Computer Science June 2018 Paper-II 275 YCT
 Search on TG: @apna_pdf
Ans. (c): In circuit switching a dedicated. Resources Now applying the key and writing out the
are allocated. e.g. PSTN telephone uses circuit corresponding letters from plain text according to key
switching. In packet switching, No. resources are 2413 we get ELHL MDOY AZER.
allocated. 51. At a particular time of computation, the value
47. In Challenge-Response authentication the claimant ....... of a counting semaphore is 10. Then 12 P
(a) Proves that she knows the secret without operations and “x” V operations were
revealing it performed on this semaphore. If the final value
(b) Proves that she doesn’t know the secret of semaphore is 7, x will be :
(c) Reveals the secret (a) 8 (b) 9
(d) Gives a challenge (c) 10 (d) 11
Ans. (a) : Challenge– Response authentication is a Ans. (b) : Current value of CS = 10
computer security protocol in which one party ask a CS – 12 + X = 7
question and another party must provide a valid X = 7 + 12 – 10 = 9
answer. i.e. she knows the secret without revealing it 52. In a paged memory, the page hit ratio is 0.40.
or will provide the secret when it is asked. The time required to access a page in
48. Decrypt the message “WTAAD” using the secondary memory is equal to 120 ns. The time
Caesar Cipher with key=15. required to access a page in primary memory is
(a) LIPPS (b) HELLO 15 ns. The average time required to access a
(c) OLLEH (d) DAATW page is ________.
Ans. (b) : In Caesar Cipher algorithm encryption and (a) 105 (b) 68
decryption takes place. During encryption right shift (c) 75 (d) 78
takes place depending upon the key and in decryption
left shift takes place depending on key. Ans. (d) : µT = 0.40
In the given question key value is 15 and decryption T5 = 120 ns
asked– T m = 15 ns

Given message is WTAAD T arg = 0.40 × 15 + 0.60 (15 + 120)ns

Left shift 15 on W is H = 6.00 + .60 × 135
Left shift 15 on T is E = 6 + 8.10
Left shift 15 on A is L = 6.8
Left shift 15 on L is L 53. In a multi-user operating system, 30 requests
Left shift 15 on D is O are made to use a particular resource per hour,
The decrypted message will HELLO. on an average. The probability that no requests
49. To guarantee correction of upto t errors, the are made in 40 minutes, when arrival pattern is
minimum Hamming distance dmin in a block a poisson distribution, is _________.
code must be ________. (a) e−15 (b) 1 − e−15
−20
(a) t + 1 (b) t − 2 (c) 1 − e (d) e−20
(c) 2t − 1 (d) 2t + 1 Ans. (d) : In hour – 30 Requests sent
Ans. (d) : To guarantee correction of up to t error in all i.e. in 60 minutes – 30 ,, ,,
cases, the minimum flaming distance in a block code 30 × 40
must be dmin = 2t + 1. in 40 minutes = = 20 Request sent
60
50. Encrypt the Message “HELLO MY DEARZ” λ = 20 [λ is number of requests that could is
using Transposition Cipher with sent in 40 minutes]
 Plain Text 2413 Actual no. of request sent in 40 minutes = 0 ie = x = 0
Key 
Cipher Text 1234 As arrival pattern is a poison distribution
(a) HLLEO YM AEDRZ e−λ λ x e−20 + 200
Probability (x = 0) = ⇒ = e–20
(b) EHOLL ZYM RAED x! 0!
(c) ELHL MDOY AZER D = e–20
(d) ELHL DOMY ZAER 54. Normally user programs are prevented from
Ans. (c):Arranging the message in tabular format, we get, handling I/O directly by I/O instructions in
1 H O E them. For CPUs having explicit I/O
2 E M A instructions, such I/O protection is ensured by
3 L Y R having the I/O instructions privileged. In a
CPU with memory mapped I/O, there is no
4 L D Z
explicit I/O instruction. Which one of the
UGC NET JRF Computer Science June 2018 Paper-II 276 YCT
 Search on TG: @apna_pdf
following is true for a CPU with memory Ans. (c) : Page information in memory is also called as
mapped I/O ? Page Table. The essential contents in each entry of a
(a) I/O protection is ensured by operating system page table is Page Frame number.
routines. 58. Consider a virtual page reference string 1, 2, 3,
(b) I/O protection is ensured by a hardware trap. 2, 4, 2, 5, 2, 3, 4. Suppose LRU page
(c) I/O protection is ensured during system replacement algorithm is implemented with 3
configuration. page frames in main memory. Then the
(d) I/O protection is not possible. number of page faults are_________.
Ans. (a) : User application are not allowed to perform (a) 5 (b) 7
I/O in user mode – All I/O requests are handled (c) 9 (d) 10
through system calls that must be performed in kernel st
Ans. (b) : For the 1 3 pages, there would be page
mode. faults.
I/O protection is ensured by operating system Next 2 is already in frame Next least recently used 1 is
routines. replaced by 4.
55. Which UNIX/Linux command is used to make Next 2 is already in frame. Then LRU 3 is replaced by
all files and sub-directories in the directory 5.
“progs” executable by all users ? Then 2 is already in frame. Then 4 is replaced by 3 and
(a) chmod − R a + x progs 5 is replaced by 4. Hence a total of 7 page faults.
(b) chmod − R 222 progs 3 3 5 5 4
(c) chmod − X a + x progs 2 2 2 2 2
(d) chmod − X 222 progs 1 4 4 3 3
3 1 1 1 1
Ans. (a) : "chmod − R a + x progs" command is used 3+1+1+1+1=7
to make all files and sub-directories in the directory
59. Consider the following three processes with the
“progs” executable by all users in the Linux.
arrival time and CPU burst time given in
56. Which of the following statements are true ? milliseconds :
(a) External Fragmentation exists when there is Process Arrival Time Burst Time
enough total memory space to satisfy a P1 0 7
request but the available space is contiguous.
P2 1 4
(b) Memory Fragmentation can be internal as
P3 2 8
well as external.
The Gantt Chart for preemptive SJF
(c) One solution to external Fragmentation is
scheduling algorithm is _________.
compaction.
Code : (a)
(a) (a) and (b) only (b) (a) and (c) only
(c) (b) and (c) only (d) (a), (b) and (c) (b)
Ans. (c) : External fragmentation exists when there is
enough total memory space to satisfy a request but the (c)
available space is contiguous is fail.
External fragmentation exists when there is enough (d)
total memory space to satisfy a request but travel spell
available space is continuous in so this is false the Ans. (b) : Pre Emptive shortest remaining time first
definition of external fragmentation is that whenever scheduling, i.e. that process will be scheduled on the
you have canting venom or any process want some CPU which will be having least remaining burst time.
data for some space from the main memory space is (required time at the CPU).
available in the main memory but it is not contiguous The processes are scheduled and executed as given in
ok for example let us. the below Gantt chart.
57. Page information in memory is also called as
Page Table. The essential contents in each
entry of a page table is/are _________. 60. In which of the following scheduling criteria,
(a) Page Access information context switching will never take place ?
(b) Virtual Page number (a) ROUND ROBIN
(c) Page Frame number (b) Preemptive SJF
(d) Both virtual page number and Page Frame (c) Non-preemptive SJF
Number (d) Preemptive priority
UGC NET JRF Computer Science June 2018 Paper-II 277 YCT
 Search on TG: @apna_pdf
Ans. (c) : Shortest job first or shortest job next, is a 65. Consider the following schedules involving two
scheduling policy that selects the waiting process with transactions.
the smallest execution time to execute next SJF is non- S1 : r1(X) ; r1(Y) ; r2(X) ; r2(Y) ; w2(Y) ; w1(X)
preemptive algorithm. S2 : r1(X) ; r2(X) ; r2(Y) ; w2(Y) ; r1(Y) ; w1(X)
Except Non-Preemptive SJF, all are preemptive. CPU Which one of the following statements is
will have leave the shortest process only after its full
correct with respect to above ?
execution, once process is started to execute.
(a) Both S1 and S2 are conflict serializable.
61. In RDBMS, which type of Join returns all rows
that satisfy the join condition ? (b) Both S1 and S2 are not conflict serializable.
(a) Inner Join (b) Outer Join (c) S1 is conflict serializable and S2 is not conflict
(c) Semi Join (d) Anti Join serializable.
Ans. (a) : An Inner jain (Sometimes called a simple (d) S1 is not conflict serializable and S2 is conflict
join) is a join of two or more tables that return only serializable.
those rows that satisfy the join condition. Ans. (d) :
Outer Joins– An outer join extends the result of a
simple join. An outer join returns all rows that satisfy
the join condition and also return some or all of those
rows from one table for which no rows from the other
satisfy the join condition.
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
(a) Titles of the six most expensive books. Conflict operations are : RW, WR, WW
(b) Title of the sixth most expensive books. Non-conflict operation : RR if there is cycle found
(c) Titles of the seven most expensive books. then it can't be conflict serializable.
(d) Title of the seventh most expensive books. In S1 we found a cycle so its not conflict serializable
Ans. (c) : Select title but in S2 there's no cycle found so its conflict
from book as B serializable.
where (select count (*) 66. For a database relation R(a, b, c, d) where the
from book as T domains of a, b, c and d include only atomic
where T.price > B.price) < 7 values, and only the following functional
Titles of the seven most expensive books. dependencies and those that can be inferred
63. In a Hierachical database, a hashing function is from them hold :
used to locate the ________. a→c
(a) Collision (b) Root b→d
(c) Foreign Key (d) Records The relation is in _________.
Ans. (b) : In a Hierachical database, a hashing (a) First normal form but not in second normal
function is used to locate the Root. form
64. Relations produced from E - R Model will (b) Second normal form but not in third normal
always be in ________. form
(a) 1 NF (b) 2 NF
(c) Third normal form
(c) 3 NF (d) 4 NF
(d) BCNF
Ans. (a) : Simple atomic values non multivalued
attributes. Generally ER diagram is design level task Ans. (a) : We can not inferred extra dependencies and
and relational model is implementation. Whenever transitive dependencies so key for a → c & b → d
relational model is implemented from ER diagram. We relation will be- ab
get rid of multi valued attribute. ab+ = {a, b, c, d}, So, ab will be the key for this
Multi valued attributes are removed as M : N binary relation.
relation by repeating becomes 1NF. We cannot So, BCNF is says left hand side should be super key.
guarantee any higher normalization. So, option (d) is wrong.
UGC NET JRF Computer Science June 2018 Paper-II 278 YCT
 Search on TG: @apna_pdf
Second NF says that their should be not any partial Which of the following is correct about the
dependencies i.e. PA → Non-key. referential integrity constraint with respect to
Drive attributes → Non-key. above ?
So, option (b) is also wrong. (a) Operations (a) and (b) will cause violation.
So, option (a) is correct. (b) Operations (b) and (c) will cause violation.
67. A many-to-one relationship exists between (c) Operations (c) and (d) will cause violation.
entity sets r1 and r2. How will it be represented (d) Operations (d) and (a) will cause violation.
using functional depedencies if Pk(r) denotes
the primary key attribute of relation r ? Ans. (d) :
(a) Pk(r1) → Pk(r2)
(b) Pk(r2) → Pk(r1)
(c) Pk(r2) → Pk(r1) and Pk(r1) → Pk(r2)
(d) Pk(r2) → Pk(r1) or Pk(r1) → Pk(r2)
Ans. (a) : Insert into R cannot cause any violation.
Insert into S can cause violation if any value is inserted
into d of S, which value is not in a of R. Delete from S
would cause no. violation.
Delete from R would cause violation if it any tuple is
deleted, and as a result a value in a gets deleted which
is referred to by d in S.
70. Consider a hash table of size seven, with
starting index zero, and a hash function (7x+3)
From the Sid we can find out the CID so, option (1) is mod 4. Assuming the hash table is initially
correct. empty, which of the following is the contents of
68. Database systems that store each relation in a the table when the sequence 1, 3, 8, 10 is
separate operating system file may use the inserted into the table using closed hashing ?
operating system’s authorization scheme, Here “__” denotes an empty location in the
instead of defining a special scheme themselves. table.
In this case, which of the following is false ?
(a) 3, 10, 1, 8, __ , __ , __
(a) The administrator enjoys more control on the
grant option. (b) 1, 3, 8, 10, __ , __ , __
(b) It is difficult to differentiate among the (c) 1, __ , 3, __ , 8, __ , 10
update, delete and insert authorizations. (d) 3, 10, __ , __ , 8, __ , __
(c) Cannot store more than one relation in a file.
3 10 1 8
(d) Operations on the database are speeded up as Ans. (a) : 0 1 2 3 4 5 6
the authorization procedure is carried out at
the operating system level. h(x) = (7x + 3) mod 4
Ans. (d) : Database systems that store each relation in h(1) = (7x1 + 3) mod 4 ⇒ 2
a separate operating system file may use the operating h(2) = (7 × 3 + 3) mod 4 ⇒ 0
system’s authorization scheme, instead of defining a h(8) = (7 × 8 + 3) mod 4 ⇒ 3
special scheme themselves.
h(10) = (7 × 10 + 3) mod ⇒ 1
(a) The administrator enjoys more control on the grant
option. So, here 3 empty options. So, option (a) is correct.
(b) It is difficult to differentiate among the update, 71. In Artificial Intelligence (AI), an environment
delete and insert authorizations. is uncertain if it is ________.
(c) Cannot store more than one relation in a file. (a) Not fully observable and not deterministic
69. Let R1(a, b, c) and R2(x, y, z) be two relations in (b) Not fully observable or not deterministic
which a is the foreign key of R1 that refers to (c) Fully observable but not deterministic
the primary key of R2. Consider following four
(d) Not fully observable but deterministic
options.
(a) Insert into R1 (b) Insert into R2 Ans. (b) : We say an environment is uncertain if it is
(c) Delete from R1 (d) Delete from R2 not fully observable or not deterministic option (b).

UGC NET JRF Computer Science June 2018 Paper-II 279 YCT
 Search on TG: @apna_pdf
72. In Artificial Intelligence (AI), a simple reflex Ans. (b) :
agent selects actions on the basis of_________.
A B C D B∨C
(a) current percept, completely ignoring rest of
F F F F F
the percept history.
F F F T F
(b) rest of the percept history, completely
F F T F T
ignoring current percept.
F F T T T
(c) both current percept and complete percept
F T F F T
history.
F T F T T
(d) both current percept and just previous
F T T F T
percept.
F T T T T
Ans. (a) : In Artificial Intelligence (AI), a simple T F F F F
reflex agent selects actions on the basis of current
T F F T F
percept, completely ignoring rest of the percept
T F T F T
history.
T F T T T
73. In heuristic search algorithms in Artificial T T F F T
Intelligence (AI), if a collection of admissible T T F T T
heuristics h1.......hm is available for a problem T T T F T
and none of them dominates any of the others,
T T T T T
which should we choose? So, from the given sentence false (F) occurs only if B
(a) h(n) = max{h1(n),....,hm(n)} and C are false (F) which occurs 4 times.
(b) h(n) = min{h1(n),....,hm(n)} So, 16 – 4 = 12
(c) h(n) = avg{h1(n),....,hm(n)} So, option (b) is write.
(d) h(n) = sum{h1(n),....,hm(n)} 76. Consider the following statements :
Ans. (a) : In heuristic search algorithms in Artificial (a) False |=True
Intelligence (AI), if a collection of admissible (b) If |=( ∧ ) then |= and |= .
heuristics h1.......hm is available for a problem and none Which of the following is correct with respect
to the above statements ?
of them dominates any of the others then h(n) = max
(a) Both statement (a) and statement (b) are false.
{h1(n), ....... hm(n)}.
(b) Statement (a) is true but statement (b) is false.
74. Consider following sentences regarding A*, an (c) Statement (a) is false but statement (b) is true.
informed search strategy in Artificial (d) Both statement (a) and statement (b) are true.
Intelligence (AI). Ans. (d) : (a) False |= True
(a) A* expands all nodes with f(n) < C*. Suppose variable is P
(b) A* expands no nodes with f(n) /C*. ∼P→P [p + q = ∼ p ∨ q]
(c) Pruning is integral to A*. ∼p∨p
Here, C* is the cost of the optimal solution path. =p [Q 0 + 1 = 1]
Which of the following is correct with respect (b) If α |= (β ∧ γ) then α |= β and α |= γ
to the above statements ? α |= (β ∧ γ)
(a) Both statement (a) and statement (b) are true. ∼ α → (β ∧ γ) [p → q = ∼ p ∨ q]
(b) Both statement (a) and statement (c) are true. ∼ α ∨ (β ∧ γ)
(c) Both statement (b) and statement (c) are true. ∼α∨β∧∼α∨γ
(d) All the statements (a), (b) and (c) are true. [Which are equivalent to ∼ pvq so we can write it as p
→ q]
Ans. (a) : A* expands all nodes with f(n) < C*. True
α→β∧α→γ
A* expands no nodes with f(n) /C*. True
α |= β and α |= γ
Pruning is integral to A*. False So, both statement are true.
75. Consider a vocabulary with only four 77. Consider the following English sentence :
propositions A, B, C and D. How many models “Agra and Gwalior are both in India”.
are there for the following sentence ? A student has written a logical sentence for the
B∨C above English sentence in First-Order Logic
(a) 10 (b) 12 using predicate In(x, y), which means x is in y,
as follows :
(c) 15 (d) 16
UGC NET JRF Computer Science June 2018 Paper-II 280 YCT
 Search on TG: @apna_pdf
In (Agra, India) ∨ In(Gwalior, India) (b) Both sentence (a) and sentence (b) are
Which one of the following is correct with unsound conclusions.
respect to the above logical sentence ? (c) Sentence (a) is sound but sentence (b) is
(a) It is syntactically valid but does not express unsound.
the meaning of the English sentence. (d) Sentence (a) is unsound but sentence (b) is
(b) It is syntactically valid and expresses the sound.
meaning of the English sentence also. Ans. (c) : Existential instantiation is valid if we replace
(c) It is syntactically invalid but expresses the the variable with an arbitrary new constant. We can
meaning of the English sentence. give the name of an existing object.
(d) It is syntactically invalid and does not express So, AsHighAs (Everest, Everest)
the meaning of the English sentence.
Sentence (a) is sound but sentence (b) is unsound.
Ans. (a) : Given that "Agra and Gwalior are both in
India" 80. Consider the set of all possible five-card poker
hands dealt fairly from a standard deck of
Representation– In (x, y) means × is in India
fifty-two cards. How many atomic events are
In (Agra, India) .....(1)
there in the joint probability distribution ?
In (Gwalior, India) .....(2)
(a) 2, 598, 960 (b) 3, 468, 960
According to the English statement, in (Agra, India) is
should be true, In (Gwalior, India) is should be true (c) 3, 958, 590 (d) 2, 645, 590
there use conjunction as connector ==⇒ In (Agra, Ans. (a) : Joint probability distribution that gives the
India) ∧ In (Gwalior, India). probability that each of x, y, ........
But given that In (Agra, India) ∨ In (Gwalior, India) falls in any particular range or discrete set of values
==⇒ syntactically correct but not represent the given. specified for that variable.
English sentence. Pb = 52C5 ⇒ 2598960
78. Consider the following two sentences : 81. E is the number of edges in the graph and f is
(a) The planning graph data structure can be used maximum flow in the graph. When the
to give a better heuristic for a planning capacities are integers, the runtime of Ford-
problem. Fulberson algorithm is bounded by :
(b) Dropping negative effects from every action (a) O (E∗f) (b) O (E2∗f)
schema in a planning problem results in a (c) O (E∗f )2
(d) O (E2∗f2)
relaxed problem.
Ans. (a) : The Basic Idea of the Ford– Fulkerson
Which of the following is correct with respect
to the above sentences ? algorithm is to find any augmenting path in the graph
and to add a constant amount of flow to each edge in
(a) Both sentence (a) and sentence (b) are false.
that path. It repeats this process until it cannot find any
(b) Both sentence (a) and sentence (b) are true.
more augmenting paths. At the end, flow is
(c) Sentence (a) is true but sentence (b) is false.
maximized. You may be tempted to think that the
(d) Sentence (a) is false but sentence (b) is true.
runtime is O(vf) because each augmenting path has
Ans. (b) : (a) The planning graph data structure can be O(V) edges and each of those edge can be O(f)
used to give a better heuristic for a planning problem. increases in its capacity in the worst case.
True
However, finding an augmenting path requires a
(b) Dropping negative effects from every action
depth–first search of the graph which takes O(E) time.
schema in a planning problem results in a relaxed
Since, we can do at most f iterations, and each iteration
problem. True
takes O(E+V) time, the worst-case run time is
So, both sentence (a) and sentence (b) are true.
O((E+V)f) which is O(Ef).
79. A knowledge base contains just one sentence,
82. Which of the following statements is false
∃x AsHighAs (x, Everest). Consider the
about convex minimization problem ?
following two sentences obtained after applying
(a) If a local minimum exists, then it is a global
existential instantiation.
minimum
(a) AsHighAs (Everest, Everest)
(b) The set of all global minima is convex set
(b) AsHighAs (Kilimanjaro, Everest)
Which of the following is correct with respect (c) The set of all global minima is concave set
to the above sentences ? (d) For each strictly convex function, if the
(a) Both sentence (a) and sentence (b) are sound function has a minimum, then the minimum is
conclusions. unique
UGC NET JRF Computer Science June 2018 Paper-II 281 YCT
 Search on TG: @apna_pdf
Ans. (c) : The following statements are true about the Ans. (b) : To negate ∃ x : Q (x), we must claim that
convex minimization problem: Q(x) fails to hold for any possible x. So again we flip
If a local minimum exists, then it is a global the quantifier and then negate the predicate :
minimum. ∀ x ￢ Q (x) i.e. option (b).
The set of all (global) minima is convex.
86. −i, ... −2,−
If Ai = {− −1, 0, 1, 2, . . . . . i}
For each strictly convex function, if the function ∞
has a minimum, then the minimum is unique.
83. The following LPP
then UA
i=1
i is :

Maximize z = 100x1 + 2x2 + 5x3 (a) Z (b) Q

Subject to (c) R (d) C
14x1 + x2 − 6x3 + 3x4 = 7 Ans. (a) : Here (a) is the right ans Q, R, C are set of
32x1 + x2 − 12x3 ≤ 10 rational, real and complex numbers respectively.
3x1 − x2 − x3 ≤ 0 Z is the set of integers, i.e. positive, negative or zero is
the set of rational number, i.e. represented by a fraction
x1, x2, x3, x4 ≥ 0 a/b with a belonging to Z and b belonging to Z* R is
has the set of real number, i.e. all numbers that can
(a) Solution : x1 = 100, x2 = 0, x3 = 0 actually exist, it contains in addition to rational
(b) Unbounded solution number, non-rational numbers or irrational.
(c) No solution C is the set of complex numbers, i.e. the set of real
(d) Solution : x1 = 50, x2 = 70, x3 = 60 numbers R and all imaginary numbers I.
Ans. (b) : 14x1 + x2 − 6x3 + 3x4 = 7 87. Match the following in List - I and List - II, for
32x1 + x2 − 12x3 ≤ 10 a function f :
List - I List - II
3x1 − x2 − x3 ≤ 0
According to this the unbounded feasible solution a. ∀ x ∀ y (f (x) = f i. Constant
cannot be determined, instead there are infinite many (y) → x = y)
solutions. It is not possible to solve the problem in b. ∀ y ∃ x (f (x) = ii. Injective
which this situation occurs. y)
84. Digital data received from a sensor can fill up 0 c. ∀ x f (x) = k iii. Surjective
to 32 buffers. Let the sample space be S = {0, 1, Code :
2, .........., 32} where the sample j denote that j (a) (b) (c)
1 (a) (i) (ii) (iii)
of the buffers are full and p(i) = (33 − i).
561 (b) (iii) (ii) (i)
Let A denote the event that the even number of (c) (ii) (i) (iii)
buffers are full. Then p(A) is : (d) (ii) (iii) (i)
(a) 0.515 (b) 0.785 Ans. (d) :
(c) 0.758 (d) 0.485
88. Which of the relations on {0, 1, 2, 3} is an
Ans. (a) : Given, equivalence relation ?
1 (a) { (0, 0) (0, 2) (2, 0) (2, 2) (2, 3) (3, 2) (3, 3) }
th
Probability of i buffer getting full p(i) = (33 − i)
562 (b) { (0, 0) (1, 1) (2, 2) (3, 3) }
Probability of all even number of buffers are full is (c) { (0, 0) (0, 1) (0, 2) (1, 0) (1, 1) (1, 2) (2, 0) }
P(A) (d) { (0, 0) (0, 2) (2, 3) (1, 1) (2, 2) }

∑
16
P(A) = ∑i = 0, 2, 4, 6, 8, ....... 32. p(i) = p(2i) Ans. (b) : For a relation to be equivalent, it must be
i =0 reflexive (xRx), Symmetric (if xRy then yRx) and
1 Transitive (If rRy and yRz then xRz).
P(A) = ( 33 + 31 + 29 + 27 + ....... + 1)
562 Option (b) is equivalence as it is reflexive, symmetric
1 and transitive.
P(A) = × 289 = 0.51423 89. Which of the following is an equivalence
562
relation on the set of all functions from Z to Z ?
85. The equivalence of
(a) { (f, g) | f (x) − g (x) = 1 ∀ x ∈ Z }
￢ ∃ x Q (x) is :
(b) { (f, g) | f (0) = g (0) or f (1) = g (1) }
(a) ∃ x ￢ Q (x) (b) ∀ x ￢ Q (x) (c) { (f, g) | f (0) = g (1) and f (1) = g (0) }
(c) ￢ ∃ x ￢ Q (x) (d) ∀ x Q (x) (d) { (f, g) | f (x) − g (x) = k for some k ∈ Z }

UGC NET JRF Computer Science June 2018 Paper-II 282 YCT
 Search on TG: @apna_pdf
Ans. (b): Let A be set of all function from Z to Z. Ans. (a) : CMOS stands for "Complementary Metal-
Option A– R1 = {(f, g) | f(x) = g(x) = 1, ∀x ...... it ∈ Oxide-Semiconductor". It's the name of a
Z} is not reflexive because A is set of all the functions manufacturing process used to create, processors,
from Z to Z. And the given condition. RAM, and digital logic circuits, and is also the name
for chips created using that process.
f(x) = g(x) = 1, ∀x ∈ Z will only be satisfied by an
92. In RS flip-flop, the output of the flip-flop at
unique pair (f, f).
time (t + 1) is same as the output at time t, after
So, R1 is sy symmetric, Transitive but not reflexive. the occurance of a clock pulse if :
R1 = Not reflexive, symmetric, transitive, not (a) S = R = 1 (b) S = 0, R = 1
irreflexive, Antisymmet, Not Asymmetric, Not an (c) S = 1, R = 0 (d) S = R = 0
equivalence. Relation, Not a partial order relation.
Ans. (d) : S = R = 0 is the normal resting condition of
Option B– R2 {(f, g) | f(0) = g(0) or f(1) = g(1)} the flip-flop. It has no. effect on the output state of the
It is reflexive, symmetric but not transitive. flip-flop. Both QQ and Q–Q– output remain in the logic
for e.g.– Let (f, g), (g, h) ∈ R2 such that state they were in prior to this input condition.
f(0) = g(0) = 1 and g(1) = h(1) = 2 and S=R=0
h(0) = 4, f(1) = 5 R S Qt + 1
So, we can see that (f, h) ∉ R2 0 0 No change
Hence, not transitive. 0 1 0
1 0 1
R2 = Reflexive, symmetric, not transitive, not
1 1 * race
irreflexive, not antisymmetric, not asymmetric, not an
equivalence relation, not a partial order relation. 93. Match the terms in List - I with the options
given in List - II :
Option D– R4 = {f, g) | f(x)– g(x)=R, for some K ∈ Z}
List - I List - II
R4 is reflexive, symmetric, transitive.
Hence, an equivalence relation. a. Decoder i. 1 line to 2n lines
Note– that R4 is reflexive, symmetric, transitive b. Multiplexer ii. n lines to 2n lines
because range of all the function is Z and we know that c. De multiplexer iii. 2n lines to 1 line
Z–Z=Z iv. 2n lines to 2n−−1
R4 = Reflexive, symmetric, transitive, not irreflexive, lines
not antisymmetric, not asymmetric, an equivalence Code :
relation not a partial order relation. (a) (b) (c)
90. Which of the following statements is true ? (a) (ii) (i) (iii)
(b) (ii) (iii) (i)
(a) (Z, ≤ ) is not totally ordered
(c) (ii) (i) (iv)
(b) The set inclusion relation ⊆ is a partial
(d) (iv) (ii) (i)
ordering on the power set of a set S
Ans. (b) :
(c) (Z, ≠ ) is a poset
94. What does the following logic diagram
(d) The directed graph is not a represent ?
partial order
Ans. (b) :
(a) (Z, ≤) is not totally ordered (false)
(b) The set inclusion relation ⊆ is a partial ordering
on the power set of a set S (True) (a) Synchronous Counter
Let S = {a, b} (b) Ripple Counter
P(S) = {{a}, {b}, {a, b}, \\Phi (c) Combinational Circuit
(c) (Z, ≠) is a poset [False] because Reflexive (d) Mod 2 Counter
Relation doesn't satisfy. Ans. (b) : Ripple Counter– A ripple counter is an
(d) The directed graph is not a partial order [False]. asynchronous counter where only the first flip-flop is
clocked by an external clock. All subsequent flip-flops
91. CMOS is a Computer Chip on the
are clocked by the output of the preceding flip-flop.
motherboard, which is : Asynchronous counters are also called ripple counters
(a) RAM (b) ROM because of the way the clock pulse ripples it way
(c) EPROM (d) Auxillary storage through the flip-flops.
UGC NET JRF Computer Science June 2018 Paper-II 283 YCT
 Search on TG: @apna_pdf
95. The hexadecimal equivalent of the binary 98. Which of the following mapping is not used for
integer number 110101101 is : mapping process in cache memory ?
(a) D24 (b) 1 B D (a) Associative mapping
(c) 1 A E (d) 1 A D (b) Direct mapping
(c) Set-Associative mapping
Ans. (d) : Group the given number in subgroup of 4
(d) Segmented - page mapping
from right and assign alphabet when it exceeds 1001:
1010 – A 1110 – E Ans. (d) : The three different types of mapping used
for the purpose of cache memory are :
1011 – B 1111 – F
Direct mapping
1100 – C
Associative mapping
1101 – D Set–Associative mapping, segment–page mapping.
Given number is 110101101 Is not used.
1101 – D 99. Simplify the following using K-map :
1010 – A F (A, B, C, D) = Σ (0, 1, 2, 8, 9, 12, 13)
1–1
d (A, B, C, D) = Σ (10, 11, 14, 15)
Hexadecimal equivalent is – 1AD. d stands for don’t care condition.
96. Perform the following operation for the binary
(a) A + BD + BC (b) A + BD + BC
equivalent of the decimal numbers (− −14)10 +
(c) A + BD (d) A + BC + BD
−15)10
(−
The solution in 8 bit representation is : Ans. (b) :
(a) 11100011 (b) 00011101
(c) 10011101 (d) 11110011
Ans. (a) : (–14)10 + (–15)10
Now 29 in binary (8 bit) is 00011101. But the number
is negative. Take is complement 11100010 and 1 to it
i.e. – 11100011.
97. Match the items in List - I and List - II :
List - I List - II
a. Interrupts which can i. Normal 100. In 8085 microprocessor, what is the output of
be delayed when a following program ?
much highest LDA 8000H
priority interrupt has MVI B, 30H
occurred ADD B
STA 8001H
b. Unplanned ii. Synchronous
(a) Read a number from input port and store it in
interrupts which
memory
occur while
(b) Read a number from input device with
executing a program
address 8000H and store it in memory at
c. Source of interrupt iii. Maskable location 8001H
is in phase with the (c) Read a number from memory at location
system clock 8000H and store it in memory location 8001H
iv. Exception (d) Load A with data from input device with
address 8000H and display it on the output
Code :
device with address 8001H
(a) (b) (c)
Ans. (c) : LDA 8000H (Memory location)
(a) (ii) (i) (iv)
MVI B, 30H
(b) (ii) (iv) (iii)
ADD B
(c) (iii) (i) (ii)
STA 8001H (Stored in memory location)
(d) (iii) (iv) (ii) Read a number from memory at location 8000H and
Ans. (d) : store it in memory location 8001H.
UGC NET JRF Computer Science June 2018 Paper-II 284 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December, 2018

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. ________ command is used to remove a (ii) If auto increment addressing mode is included
relation from an SQL database. in an instruction set architecture, then an
(a) Remove table (b) Delete table additional ALU is required for effective
(c) Update table (d) Drop table address calculation.
Ans. (d) : Drop table deletes the whole structure of the (iii) In auto increment addressing mode, the
relation. purge removes the table which cannot be amount of increment depends on the size of
obtained again. The SQL UPDATE Query is used to the data item accessed.
modify the existing records in a table. Which of the above statements is/are true?
Choose the correct answer from the code given
2. Consider the following pseudo-code fragment,
below :
where m is a non-negative integer that has been
initialized : Code :
(a) (ii) and (iii) only (b) (iii) only
p = 0;
(c) (ii) only (d) (i) and (ii) only
k = 0;
while (k < m) Ans. (b) : In auto-increment addressing mode the
p=p+2 ; k address where next data block to be stored is generated
automatically depending upon the size of single data
k = k + 1;
item required to store.
end while
Self relocating code takes always some address in
Which of the following is a loop invariant for memory and statement says that this mode is used for
the while statement? self relocating code so option 1 is incorrect and no
(Note : a loop invariant for a while statement is additional ALU is required.
an assertion that is true each time the guard is
5. Suppose that everyone in a group of N people
evaluated during the execution of the while
wants to communicate secretly with (N – 1)
statement).
other people using symmetric key
(a) p = 2k+1 – 1 and 0 ≤ k ≤ m cryptographic system. The communication
(b) p = 2k – 1 and 0 ≤ k ≤ m between any two persons should not be decodable
(c) p = 2k+1 – 1 and 0 ≤ k < m by the others in the group. The number of keys
(d) p = 2 – 1 and 0 ≤ k < m
k required in the system as a whole to satisfy the
Ans. (b) : p is surely 2k+1−12k+1−1 .. Because terms confidentiality requirement is
are added in this order - 1,2,4,8,16.. at any time there (a) (N – 1)2 (b) N(N – 1)
sum is next power of 2 minus 1. (c) 2N (d) N(N – 1)/2
k should be less than m. If k=m, then corresponding p Ans. (d) : In Symmetric Key Cryptography, access of
value will not hold. key is with both the parties. It implies every person
3. Dirty bit is used to show the needs to communicate N-1 other users using different
(a) page with low frequency occurrence keys i.e 1+2+3…N-2+N-1
(b) wrong page This is like number of edges needed in a complete
graph with N vertices is N(N-1)/2.
(c) page that is modified after being loaded into
cache memory 6. A survey has been conducted on methods of
(d) page with corrupted data commuter travel. Each respondent was asked
to check Bus, Train or Automobile as a major
Ans. (c) : A dirty bit or modified bit is a bit that is method of travelling to work. More than one
associated with a block of computer memory and answer was permitted. The results reported
indicates whether or not the corresponding block of were as follows :
memory has been modified. The dirty bit is set when Bus 30 people; Train 35 people; Automobile
the processor writes to (modifies) this memory. Dirty 100 people; Bus and Train 15 people; Bus and
bits are used by the CPU cache and in the page Automobile 15 people, Train and Automobile
replacement algorithms of an operating system. 20 people; and all the tree methods 5 people.
4. Consider the following statements : How many people completed the survey form?
(i) Auto increment addressing mode is useful in (a) 115 (b) 120
creating self-relocating code. (c) 165 (d) 160
UGC NET JRF Computer Science Dec. 2018 Paper-II 285 YCT
 Search on TG: @apna_pdf
Ans. (b) : 8. A process residing in Main Memory and Ready
and Waiting for execution, is kept on
(a) Execution Queue (b) Job Queue
(c) Wait Queue (d) Ready Queue
Ans. (d) : The processes that are residing in main
memory and are ready and waiting to execute are kept
on a list called the ready queue.
Bus = 30 people; 9. Software coupling involves dependencies
Train = 35 people; among pieces of software called modules.
Automobile = 100 people; Which of the following are correct statements
Bus & Automobile = 15 people with respect to module coupling?
Train & Automobile = 20 people P : Common coupling occurs when two modules
Bus & Automobile & Train = 5 people 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
So, Total in train = 35 – 20 = 5 people below :
Total in bus = 30 – 10 – 5 – 10 = 5 people Code :
Total in Automobile = 100 – 30 = 70 people
(a) Q and R only (b) P and R only
Total in survey will –
(c) All of P, Q and R (d) P and Q only
= 70 + 5 + 5 + 10 + 5 + 10 + 15
= 120 people Ans. (b) : Common coupling– Common coupling is
said to occur when several modules have access to the
7. Which homogeneous 2D matrix transforms the
same global data. But it can lead to uncontrolled error
figure (a) on the left side to the figure (b) on the
propagation and unforeseen side-effects when changes
right?
are made.
Content coupling (high)– Content coupling is said to
occur when one module uses the code of other module,
for instance a branch. This violates information hiding
- a basic design concept.
Control coupling– Control coupling is one module
controlling the flow of another, by passing it
information on what to do (e.g., passing a what-to-do
0 2 6  0 2 −6 
flag)
(a)  1 0 1  (b)  2 0 1 
    So, option b is right (P and R only)
0 0 1 0 0 1  10. Consider the C/C++ function f() given below :
 1 −2 6   0 −2 6  void f(char w[])
(c)  1 0 2  (d)  1 0 1  {
   
0 0 1 0 0 1 int x = strlen (w); //length of a string
Ans. (d) : Homogeneous transformation matrices for char c;
2D chains. for (int i = 0; i < x; i++)
We are now prepared to determine the location of each {
link. The location in w of a point in (x, y) ∈ A1 is c = w[i];
determined by applying the 2D homogeneous w[i] = w[x–i–1];
transformation matrix. w[x–i–1] = c;
 cos θ1 − sin θ1 x t  }
T1 =  sin θ1 cos θ1 y t  }
 
 0 0 1 Which of the following is the purpose of f( )?
 0 2 −6  (a) It outputs the contents of the array with the
2 0 1  characters rearranged so they are no longer
  recognized as the words in the original
0 0 1  phrase.
UGC NET JRF Computer Science Dec. 2018 Paper-II 286 YCT
 Search on TG: @apna_pdf
(b) It outputs the contents of the array in reverse 14. Consider a system with 2 level cache. Access
order. times of Level 1 cache, Level 2 cache and main
(c) It outputs the contents of the array in the memory are 0.5 ns, 5 ns and 100 ns
original order. respectively. The hit rates of Level 1 and Level
(d) It outputs the contents of the array with the 2 caches are 0.7 and 0.8, respectively. What is
characters shifted ever by one position. the average access time of the system ignoring
Ans. (c) : Given an array arr[] and an integer c, we the search time within the cache?
need to print k maximum elements of given array. The (a) 7.55 ns (b) 35.20 ns
elements should printed in the order of the input. (c) 20.75 ns (d) 24.35 ns
Note : c is always less than or equal to w. Ans. (a) : First, the system will look in cache 1. If it is
It outputs the contents of the array in the original not found in cache 1, then cache 2 and then further in
order. main memory (if not in cache 2 also).
11. In PERT/CPM, the merge event represents The average access time would take into consideration
________ of two or more events. success in cache 1, failure in cache 1 but success in
(a) joining (b) completion cache 2, failure in both the caches and success in main
(c) splitting (d) beginning memory.
Ans. (b) : In PERT/CPM, the merge event represents Average access time = [H1*T1]+[(1-H1)*H2*T2]+[(1-
completion of two or more events. H1)(1-H2)*Hm*Tm]
H1 = Hit rate of level 1 cache = 0.7
12. In mathematical logic, which of the following
are statements? T1 = Access time for level 1 cache = 1 ns
(i) There will be snow in January. H2 = Hit rate of level 2 cache = 0.8
(ii) What is the time now? T2 = Access time for level 2 cache = 5 ns
(iii) Today is Sunday. Hm = Hit rate of Main Memory = 1
(iv) You must study Discrete Mathematics. Tm = Access time for Main Memory = 100 ns
Choose the correct answer from the code given Average access time = 7.55ns
below : 15. Let r = a(a + b)*, s = aa*b and t = a*b be three
Code : regular expressions.
(a) (iii) and (iv) (b) (i) and (iii) Consider the following :
(c) (ii) and (iv) (d) (i) and (ii) (i) L(s) ⊆ L(r) and L(s) ⊆ L(t)
Ans. (b) : Mathematical Logic– There will be snow (ii) L(r) ⊆ L(s) and L(s) ⊆ L(t)
in January. Choose the correct answer from the code given
Today is Sunday– Statements are those for which we below :
can answer strictly in either yes or no, option b and d Code :
cannot be answered in yes or no while in a and c we (a) Only (ii) is correct.
can answer in yes or no so option (a) is correct. (b) Only (i) is correct.
A proposition is something that would have one of the (c) Both (i) and (ii) are correct.
two values : True or False but not both. And so, (iii) (d) Neither (i) nor (ii) is correct.
can be true on Sunday and false on any other day.
Ans. (b) : Two regular expressions are equivalent if
13. The grammar S → (S) | SS | is not suitable for languages generated by them are same. For example, r
predictive parsing because the grammar is = a(a + b)* and s = aa*b generate same language.
(a) Ambiguous language L of all words of the form some positive
(b) Right recursive number of a’s followed by exactly one b. s = aa*b and
(c) Left recursive t = a*b.
(d) An operator grammar L(s) ⊆ L(r) and L(s) ⊆ L(t)
Ans. (a) : Since given grammar can have infinite parse 16. The boolean expression A.B + A.B + A.B is
trees for string ‘ε’, so grammar is ambiguous, and also equivalent to
S → (S) | SS | has left recursion.
(a) A.B (b) A + B
For predictive-parsing, grammar should be:
• Free from ambiguity (c) A + B (d) A.B
• Free from left recursion Ans. (c) : A′ . B + A . B′ + A . B
• Free from left factoring = A′ . B + A(B′ + B)
Given grammar contains both ambiguity and left = A′ . B + A
factoring, so it cannot have predictive parser. =A+B

UGC NET JRF Computer Science Dec. 2018 Paper-II 287 YCT
 Search on TG: @apna_pdf
17. The second smallest of n elements can be found 20. Suppose a cloud contains software stack such
with _______ comparisons in the worst case. as Operating systems, Application softwares,
3n etc. This model is referred as _______ model.
(a) n – 1 (b)
2 (a) MaaS (b) SaaS
(c) n + ceil(lg n) – 2 (d) lg n (c) LaaS (d) PaaS
Ans. (c) : The second smallest of n elements can be Ans. (b) :
found with n + ceil(lg n) – 2 comparisons in the worst
case
18. Consider the following statements related to
AND-OR Search algorithm.
S1 A solution is a subtree that has a goal node at
every leaf.
S2 OR nodes are analogous to the branching in a
deterministic environment.
S3 AND nodes are analogous to the branching in
a non-deterministic environment.
Which one of the following is true referencing
the above statements?
Choose the correct answer from the code given
below :
Code :
(a) S1 – False, S2 – True, S3 – True
(b) S1 – True, S2 – True, S3 – False 21. What does the following Java function
(c) S1 – True, S2 – True, S3 – True perform? (Assume int occupies four bytes of
(d) S1 – False, S2 – True, S3 – False storage)
Ans. (c) : A solution for an AND-OR search problem public static int f(int a)
is a subtree that { //Pre-conditions : a > 0 and no overflow /
(1) has a goal node at every leaf underflow occurs
(2) specifies one action at each of its OR nodes
int b = 0;
(3) includes every outcome branch at each of its
AND nodes for (int i = 0; i < 32; i++)
(4) OR nodes are analogous to the branching in a {
deterministic environment. b = b << 1;
(5) AND nodes are analogous to the branching in a b = b | (a & 1);
non-deterministic environment. a = a >>>1; // This is a logical shift
19. A binary search tree is constructed by inserting }
the following numbers in order : return b;
60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34 }
The number of nodes is the left subtree is (a) Returns the int that has the binary
(a) 5 (b) 6 representation of integer a.
(c) 3 (d) 7 (b) Return the int that represents the number of
Ans. (d) : Binary Search Tree–The left subtree of a 0's in the binary representation of integer a.
contains only < ROOT (c) Return the int that represents the number of
The right subtree of a node contains only nodes > 1's in the binary representation of integer a.
ROOT (d) Return the int that has the reversed binary
The left and right subtree each must also be a binary representation of integer a.
search tree.
Ans. (d) : Return the into that has the reversed binary
representation of integer a.
Output:
a = 5, b = 9
a&b=1
a | b = 13
a ^ b = 12
~a = 250
b<<1 = 18
So, option is 7 on left subtree. b>>1 = 4
UGC NET JRF Computer Science Dec. 2018 Paper-II 288 YCT
 Search on TG: @apna_pdf
22. A host is connected to a department network Ans. (b) : SMI = Mt – ( Fa + Fc + Fd)/Mt, Where
which is part of a university network. The SMI – is the Software Maturity Index value
university network, in turn, is part of the Mt – is the number of software functions/modules in
Internet. The largest network, in which the the current release
Ethernet address of the host is unique, is Fc – is the number of functions/modules that contain
(a) the department network changes from the previous release
(b) the Internet Fa – is the number of functions/modules that contain
(c) the subnet to which the host belongs additions to the previous release
(d) the university network Fd – is the number of functions/modules that are
Ans. (b) : Ethernet address is basically the MAC deleted from the previous release.
address, which is supposed to be unique to a NIC. SMI =(940 - (40 + 90 + 12 )) /940
Thus it is unique over the Internet. =0.8489
23. Find the boolean expression for the logic circuit =0.849
shown below : 26. If the frame buffer has 10-bits per pixel and 8-
(1-NAND gate, 2-NOR gate, 3-NOR gate) bits are allocated for each of the R, G, and B
components, then what would be the size of the
colour lookup table (LUT)?
(a) (210 + 211) bytes (b) (210 + 224) bytes
8 9
(c) (2 + 2 ) bytes (d) (210 + 28) bytes
Ans. (a) : Number of indexes the frame buffer = 210 =
1024
Size of each entry = 8 bits for R component + 8 bits for
(a) AB (b) AB G component + 8 bits for B component = 24 bits = 3
(c) AB (d) AB Bytes
Size of frame buffer = 1024 * 3 = (210 + 211) bytes
Ans. (c) :
27. An attribute A of datatype varchar (20) has the
value 'xyz', and the attribute B of datatype
char(20) has the value "Imnop", then the
attribute A has _______ spaces and attribute B
has ______ spaces.
(a) 3, 5 (b) 20, 5
(c) 20, 20 (d) 3, 20
So, option (c) is correct. Ans. (d) : char is a fixed-length data type, the storage
size of the char value is equal to the maximum size for
24. Suppose P, Q and R are co-operating processes this column.
satisfying Mutual Exclusion condition. Then, if
→ varchar is a variable-length data type, the storage
the process Q is executing in its critical section
size of the varchar value is the actual length of the data
then entered, not the maximum size for this column.
(a) Neither 'P' nor 'R' executes in their critical → So, A varchar(20) has only 3 spaces because its
section. initialized to 'xyz' and B char(20) has 20 spaces as char
(b) Both 'P' and 'R' execute in critical section. data type occupies the storage space equivalent to the
(c) 'P' executes in critical section. maximum size.
(d) 'R' executes in critical section. 28. Consider the following grammar G :
Ans. (A) : Suppose P, Q and R are co-operating S→A|B
processes satisfying Mutual Exclusion condition. A→a|c
Then, if the process Q is executing in its critical B→b|c
section then Neither 'P' nor 'R' executes in their critical
where {S, A, B} is the set of non-terminals, {a,
section.
b, c} is the set of terminals.
25. A legacy software system has 940 modules. The Which of the following statement(s) is/are
latest release required that 90 of these modules correct?
be changed. In addition, 40 new modules were S1 : LR(1) can parse all strings that are
added and 12 old modules were removed. generated using grammar G.
Compute the software maturity index for the S2 : LL(1) can parse all strings that are
system. generated using grammar G.
(a) 0.524 (b) 0.849 Choose the correct answer from the code given
(c) 0.923 (d) 0.725 below :
UGC NET JRF Computer Science Dec. 2018 Paper-II 289 YCT
 Search on TG: @apna_pdf
Code : 1
(iii) E(G) ≥ (n – 1) (n – 2) + 2
(a) Neither S1 nor S2 (b) Both S1 and S2 3
(c) Only S2 (d) Only S1 Choose the correct answer from the code given
Ans. (a) : First Leftmost Derivation below :
S→F Code :
F→c (a) (iii) only (b) (ii) and (iii) only
Second Leftmost Derivation (c) (ii) only (d) (i) and (iii) only
S→H Ans. (c) : In an Hamiltonian Graph (G) with no loops
H→c and parallel edges: According to Dirac’s theorem in a
An Ambiguous grammar can neither be n vertex graph, deg (v) ≥ n / 2 for each vertex of G.
LR(1) nor LL(1) According to Ore’s theorem deg (v) + deg (w) ≥ n for
Or Neither S1 nor S2. every n and v not connected by an edge is sufficient
29. Consider the following method : condition for a graph to be hamiltonian.
int f(int m, int n, boolean x, boolean y) If |E(G)| ≥ 1 / 2 * [(n – 1) (n – 2)] then graph is
{ connected but it doesn’t guaranteed to be Hamiltonian
int res = 0; Graph.
if(m < 0) {res = n – m;} 32. The Software Requirement Specification (SRS)
else if (x || y) { is said to be ______ if and only if no subset of
res = –1; individual requirements described in it conflict
if(n = = m) {res = 1;} with each other.
} (a) Verifiable (b) Correct
else {res = n;} (c) Consistent (d) Unambiguous
return res; Ans. (c) : The Software Requirement Specification
} /* end of f*/ (SRS) is said to be Consistent if and only if no subset
If P is the minimum number of tests to achieve of individual requirements described in it conflict with
full statement coverage for f(), and Q is the each other.
minimum number of tests to achieve full 33. Consider a singly linked list. What is the worst
branch coverage for f(), then (P, Q) = case time complexity of the best-known
(a) (3, 2) (b) (3, 4) algorithm to delete the node a, pointer to this
(c) (2, 3) (d) (4, 3) node is q, from the list?
Ans. (b) : Lets consider first for full branch coverage. (a) O(1) (b) O(n)
Here there are 4 possible cases of branching which are (c) O(lg n) (d) O(n lg n)
:- Case 1. The first "if" condition is true, which happen Ans. (b) : A simple solution is to traverse the linked
when m<0 Case 2:- The else if condition is true which list until you find the node you want to delete. But this
happen when m>0. Case 3. The second "if" condition solution requires pointer to the head node which
is true, which happen when P=3; Case 4:- The else if contradicts the problem statement.
condition is true which happen when Q=4. Fast solution is to copy the data from the next node to
30. Which of the following problems is decidable the node to be deleted and delete the next node.
for recursive languages (L)? Something like following.
(a) Is L = R, where R is a given regular set? // Find next node using next pointer
(b) Is L = ∑* ? struct node *temp = node_ptr->next;
(c) Is L = φ ? // Copy data of next node to this node
(d) Is w ∈ L, where w is a string? node_ptr->data = temp->data;
Ans. (d) : A recursive language can be decided by // Unlink next node
Turing machine which means it will enter into final node_ptr->next = temp->next;
state for the strings of language w ∈ L, where w is a // Delete next node
string. free(temp);
31. If a graph (G) has no loops or parallel edges, Time complexity of this approach is O(n).
and if the number of vertices (n) in the graph is 34. A clustering index is defined on the fields
n ≥ 3, then graph G is Hamiltonian if which are of type
n (a) non-key and non-ordering
(i) deg(v) ≥ for each vertex v
3 (b) non-key and ordering
(ii) deg(v) + deg(w) ≥ n whenever v and w are (c) key and non-ordering
not connected by an edge. (d) key and ordering
UGC NET JRF Computer Science Dec. 2018 Paper-II 290 YCT
 Search on TG: @apna_pdf
Ans. (b) : A clustering index as the name suggests is and x1, x2 ≥ 0;
created when the data can be grouped in the form of The problem is converted to canonical form by adding
clusters. slack, surplus and artificial variables as appropriate
Hence to create such kind of index files, fields could 1. As the constraint-1 is of type '≤' we should add slack
be non-key attributes and which are in ordered form so variable S1
as to form clusters easily. Hence option (A) – non key 2. As the constraint-2 is of type '≤' we should add slack
and ordering. variable S2
Additional points for Clustered Indexing: 3. As the constraint-3 is of type '≤' we should add slack
1. The number of entries in the index file are the variable S3
unique values of the attribute on which indexing is After introducing slack variables
done. Max z = –2x1 – 3x2 + 0s1 + 0s2 + 0s3
2. The pointer in the index file will give the base Subject to
address of the block in which the value appear for –x1 – x2 + s1 = –2
the first time. 2x1 + x2 + s2 = 10
35. Which of the following statement/s is/are true? x1 + x2 + s3 = 8
(i) Firewalls can screen traffic going into or out After introducing slack variables
Max z = –2x1 – 3x2 + 0s1 + 0s2 + 0s3
of an organization.
subject to
(ii) Virtual private networks can simulate an old –x1 – x2 + s1 = –2
leased network to provide certain desirable 2x1 + x2 + s2 = 10
properties. x1 + x2 + s3 = 8
Choose the correct answer from the code given and x1, x2, s1, s2, s3 ≥ 0
below :
(a) (ii) only (b) Neither (i) nor (ii) Iteration -1 Cj −2 −3 0 0 0
(c) (i) only (d) Both (i) and (ii) B CB XB x1 x 2 s1 s 2 s3
Ans. (d) : s network traffic passes through the firewall, s1 0 −2 (−1) −1 1 0 0
the firewall decides which traffic to forward and which s2 0 10 2 1 0 1 0
traffic not to forward, based on rules that you have s3 0 8 1 1 0 0 1
defined. All firewalls screen traffic that comes into
your network, but a good firewall should also screen z=0 zj 0 0 0 0 0
outgoing traffic. zj − cj 2 3 0 0 0
a network is often considered private even though an zj − cj
organisation leases rather than owns all the channels Ratio =
that connect its sites. This is because the technical s1 , j −2 ↑ − - - - - - - - - -
and s1 , j < 0
effects of traffic transmission are the same whether
physical channels are owned or leased, as these Minimum negative XB is –2 and its row index is 1. So,
channels always have a known and fixed bandwidth. the leaving basis variable is s1.
By contrast, when an organisation uses a public data Maximum negative ratio is –2 and its column index is
network to connect its sites, traffic goes through shared 1. So, the entering variable is x1.
public channels and receives an unknown share of the ∴ The pivot element is –1.
channels’ bandwidth. Entering = x1, Departing = s1, key element = –1
+ R1(new) = R1(old) ÷ (–1)
36. Use Dual Simplex Method to solve the
+ R2(new) = R2(old) – 2R1(new)
following problem :
Maximize z = –2x1 – 3x2 Iteration - 2 C j −2 −3 0 0 0
subject to : B C B X B x1 x 2 s1 s 2 s3
x1 + x2 ≥ 2 x1 −2 2 1 1 −1 0 0
2x1 + x2 ≤ 10 s2 0 6 0 −1 2 1 0
x1 + x2 ≤ 8 s3 0 6 0 0 1 0 1
x1, x2 ≥ 0 z = −4 z j −2 −2 2 0 0
(a) x1 = 0, x2 = 2 and z = –6 zj − cj 0 1 2 0 0
(b) x1 = 2, x2 = 0, and z = –4
(c) x1 = 6, x2 = 2 and z = –18 Ratio - - - - - - - - - - - - - - -
(d) x1 = 2, x2 = 6 and z = –22 Since all zj – cj ≥ 0 and all xBi ≥ 0 thus the current
solution is the optimal solution.
Ans. (b) : Problem is Max z = –2x1 – 3x2
Hence, optimal solution is arrived with value of
Subject to
variables as :
–x1 – x2 ≤ –2 x1 = 2, x2 = 0
2x1 + x2 ≤ 10 Max z = –4
x1 + x2 ≤ 8 So, option (b) is correct.

UGC NET JRF Computer Science Dec. 2018 Paper-II 291 YCT
 Search on TG: @apna_pdf
37. Which of the following statement/s is/are true? (iv) Non-zero elements of finite Boolean algebras
(i) Windows XP supports both peer-peer and are not uniquely expressible as joins of atoms.
client-server networks. Choose the correct answer from the code given
(ii) Windows XP implements Transport protocols below:
as drivers that can be loaded and unloaded Code :
from the system dynamically. (a) (ii), (iii) and (iv) only
Choose the correct answer from the code given (b) (i), (ii) and (iii) only
below : (c) (i) and (iv) only
Code : (d) (i) and (ii) only
(a) (ii) only (b) Neither (i) nor (ii)
Ans. (d) : NOR gates can be combined to generate any
(c) Both (i) and (ii) (d) (i) only
other logical function. It shares this property with
Ans. (c) : Windows XP supports both peer-peer and the NAND gate that’s why Every logic network is
client-server networks. In a Client-Server network, equivalent to one using just NAND gates or just NOR
high-end servers, installed with the Network Operating gates. Boolean expressions and logic networks
System (Server Operating System) and the related
correspond to labelled acyclic digraphs is correct.
software, serve the clients continuously on a network,
by providing them with specific services upon request. So, statement (i) & (ii) are true.
Windows XP implements Transport protocols as 40. Consider the following two C++ programs P1
drivers that can be loaded and unloaded from the and P2 and two statements S1 and S2 about
system dynamically. these programs :
So, Both statements are true. P1 P2
38. Consider the following boolean equations : void f(int a, int *b, int &c) double a = 1, b = 2;
(i) wx + w(x + y) + x(x + y) = x + wy { a = 1; double & f(double & d)
*b = 2; { d = 4;
(ii) ( wx ( y + xz ) + wx ) y = xy c = 3; return b;
What can you say about the above equations? } }
(a) (i) is false and (ii) is true int man( ) int main ()
(b) Both (i) and (ii) are false { int i = 0; {
(c) Both (i) and (ii) are true f(i, & i, i); f(a) = 5;
(d) (i) is true and (ii) is false cout << i; cout << a << ":" << b;
} }
Ans. (c) : LHS Part (i)
= wx + w(w + y) + x(x + y) S1 : P1 prints out 3
= wx + wx + wy + xx + xy S2 : P2 prints out 4 : 2
= wx + wy + x + xy What can you say about the statements S1 and
= wx + wy + x(1 + y) S2?
= wx + wy + x (a) Only S2 is true.
= wx + x + wy (b) Both S1 and S2 are true.
= (w + 1)x + wy (c) Only S1 is true.
= x + wy (d) Neither S1 and S2 is true.
LHS Part (ii) Ans. (c) : in P1: output is 3. But in P2 Print() function
= (wx′ (y + xz′) + w′x′)y is both overrided and overloaded in derived class, so
= (wx′y + wx′xz′ + w′x′)y option p2 is wrong.
= (wx′y + 0 + w′x′)y P1 P2
void f(int a, int *b, int &c) double a = 1, b = 2;
= wx′yy + w′x′y
{ a = 1; double & f(double & d)
= wx′y + w′x′y
*b = 2; { d = 4;
= (w + w′)x′y c = 3; return b;
= x′y = RHS } }
So, both statement (i) & (ii) are true. int man( ) int main ()
39. Which of the following statements are true? { int i = 0; {
(i) Every logic network is equivalent to one f(i, & i, i); f(a) = 5;
using just NAND gates or just NOR gates. 41. Consider the language L given by
(ii) Boolean expressions and logic networks L = {2nk | k > 0, and n is non-negative integer
correspond to labelled acyclic digraphs. number}
(iii) No two Boolean algebras with n atoms are The minimum number of states of finite
isomorphic. automaton which accepts the language L is
UGC NET JRF Computer Science Dec. 2018 Paper-II 292 YCT
 Search on TG: @apna_pdf
n ( n + 1) 44. Match List I with List II and choose the correct
(a) (b) 2n answer from the code given below :
2
(c) n (d) n + 1 List I List II
nk
Ans. (d) : L = {2 | k > 0, and n is non-negative a. Equivalence i. p⇒q
integer number} b. Contrapositive ii. p⇒q:q⇒p
The minimum number of states of finite automaton c. Converse iii. p⇒q:∼q⇒∼p
which accepts the language L is n + 1. d. Implication iv. p⇔q
42. Match List with List I and choose the correct Code :
answer from the code given below. (a) a–ii, b–i, c–iii, d–iv
List I List II (b) a–iv, b–iii, c–ii, d–i
(Graph (Time Complexity) (c) a–i, b–ii, c–iii, d–iv
Algorithm (d) a–iii, b–iv, c–ii, d–i
a. Dijkstra's i. O(E lg E) Ans. (b) :
algorithm 45. Software products need perfective maintenance
b. Kruskal's ii. θ(V3) for which of the following reasons?
algorithm (a) To overcome wear and tear caused by the
c. Floyd- iii. O(V2) repeated use of the software.
Warshall (b) When the customers need the product to run
algorithm on new platforms.
d. Topological iv. θ(V + E) (c) To support the new features that users want it
sorting to support.
where V and E are the number of vertices and (d) To rectify bugs observed while the system is
edges in graph respectively. in use.
(a) a–i, b–iii, c–ii, d–iv Ans. (c) : Software maintenance is the act of fine-
tuning a software product. It’s about repair, upkeep
(b) a–iii, b–i, c–ii, d–iv
and ongoing optimisation. you can group software
(c) a–iii, b–i, c–iv, d–ii
maintenance into four overarching categories:
(d) a–i, b–iii, c–iv, d–ii 1. Preventive maintenance
Ans. (b) : 2. Corrective maintenance
43. To overcome difficulties in Readers–Writers 3. Adaptive maintenance
problem, which of the following statement/s 4. Perfective maintenance
is/are true? Perfective software maintenance addresses the
(i) Writers are given exclusive access to shared functionality and usability of the software. Perfective
objects. maintenance involves changing existing product
(ii) Readers are given exclusive access to shared functionality by refining, deleting, or adding new
objects features.
(iii) Both Readers and Writers are given exclusive 46. The four byte IP Address consists of
access to shared objects. (a) Network Address
Choose the correct answer from the code given (b) Host Address
below : (c) Neither Network nor Host Address
Code : (d) Both Network and Host Addresses
(a) (i) only (b) Both (ii) and (iii) Ans. (d) : An IP address which is 32 bits long, that
(c) (ii) only (d) (iii) only means it is of 4 bytes and is composed of a network
and host portion and it depends on address class.
Ans. (a) : The readers-writers problem relates to an
object such as a file that is shared between multiple 47. Consider the following postfix expression with
single digit operands :
processes. Some of these processes are readers i.e. they
623 * / 42 * + 68 * –
only want to read the data from the object and some of
The top two elements of the stack after the
the processes are writers i.e. they want to write into the
second * is evaluated, are :
object.
(a) 8, 1 (b) 6, 3
So, option (i) is right. (c) 8, 2 (d) 6,2
UGC NET JRF Computer Science Dec. 2018 Paper-II 293 YCT
 Search on TG: @apna_pdf
Ans. (a) : 50. Consider a relation schema R = (A, B, C, D, E,
F) on which the following functional
dependencies hold :
A→B
B, C → D
* *
E→C
3 / 2
D→A
2 6 4 8
What are the candidate keys of R?
6 6 1 1 1
(a) AEF, BEF and BCF (b) AE and BE
So, option (a) is correct. (c) AEF, BEF and DEF (d) AE, BE and DE
48. Consider the following tables (relations) :
Ans. (c) : (AE)+ = {ABECD} which is not set of all
Students attributes. So AE is not a candidate key. Hence option
R oll − No Name A and B are wrong.
18CS101 Ramesh (AEF)+ = {ABCDEF}
18CS102 Mukesh (BEF)+ = {BEFCDA}
18CS103 Ramesh (BCF)+ = {BCFDA}
Performance which is not set of all attributes. So BCH is not a
candidate key. Hence option C is wrong.
Roll − No Course Marks
R(A, B, C, D, E, F)
18CS101 DBMS 60
FD = {A → B, BC → D, E → C, D → A}
18CS101 Compiler Design 65
The candidate keys of R is AEF, BEF, DEF because
18CS102 DBMS 60 both of these generates the {A, B, C, D, E, F}
18CS103 DBMS 85 So correct answer is (c).
18CS102 Compiler Design 75 51. A computer uses a memory unit with 256 K
18CS103 Operating System 70 words of 32 bits each. A binary instruction
Primary keys in the tables are shown using code is stored in one word of memory. The
underline. Now, consider the following query : instruction has four parts : an indirect bit, an
SELECTS Name, Sum (P.Marks) operation code and a register code part to
FROM Students S. Performance P specify one of 64 registers and an address part.
WHERE S.Roll-No = P.Roll-No How many bits are there in the operation code,
GROUP BY S.Name the register code part and the address part?
The number of rows returned by above query (a) 7, 7, 18 (b) 7, 6, 18
is (c) 18, 7, 7 (d) 6, 7, 18
(a) 3 (b) 1 Ans. (b) : Indirect 1 bit
(c) 0 (d) 2 Address 28 (256 Rb)* 210 (1024 bytes/KB) = 218 ⇒ 18
Ans. (d) : It means all name that are same should be bits
kept in one row. There are 3 names. But in that there is Reg 64 registers = 26 ⇒ 6 bits
a duplicate with Ramesh being repeated ⇒ Ramesh OP–Code 32 – 1 – 18 – 6 bits = 7 bits
produces one row and Ramesh produces one row ⇒
Total 2 rows. 52. Consider ISO-OSI network architecture
reference model. Session layer of this model
Roll − No Name Course Marks offers dialog control, token management and
18CS101 Ramesh DBMS 60 ________ as services.
18CS103 Ramesh DBMS 85 (a) Flow Control (b) Asynchronization
SELECTS Name, Sum (P.Marks) (c) Errors (d) Synchronization
FROM Students S. Performance P Ans. (d) : Consider ISO-OSI network architecture
WHERE S.Roll-No = P.Roll-No reference model. Session layer of this model offers
GROUP BY S.Name dialog control, token management and Synchronization
So, option (d) is correct. as services.
49. Data warehouse contains _______ data that is 53. A box contains six red balls and four green
never found in operational environment. balls. Four balls are selected at random from
(a) Summary (b) Encrypted the box. What is the probability that two of the
(c) Encoded (d) Scripted selected balls will be red and two will be green?
Ans. (a) : Data warehouse contains Summary data that 1 3
(a) (b)
is never found in operational environment. 9 7
UGC NET JRF Computer Science Dec. 2018 Paper-II 294 YCT
 Search on TG: @apna_pdf
1 1 56. Consider the midpoint (or Bresenham)
(c) (d)
14 35 algorithm for rasterizing lines given below :
6×5 4×3 (1) Input (x1, y1) and (x2, y2)
×
C2 × 4 C 2 2 ×1 2 × 1 = 3 × 5 × 2 × 3 = 3 (2) y = y1
6
Ans. (b) : =
10
C4 10 × 9 × 8 × 7 10 × 3 × 7 7 (3) d = f(x1 + 1, y1 + 1/2) //f is the implicit
4 × 3 × 2 ×1 form of a line
So, option (b) is correct. (4) for x = x1 to x2
54. An Internet Service Provider (ISP) has (5) do
following chunk of CIDR-based IP addresses (6) plot (x, y)
available with it : 245.248.128.0/20. The ISP (7) if(d < 0)
wants to give half of this chunk of addresses to (8) then
organization A and a quarter to organization B (9) y=y+1
while retaining the remaining with itself.
(10) d = d + (y1 – y2) + (x2 –x1)
Which of the following is a valid allocation of
addresses to A and B? (11) else
(a) 245.248.128.0/21 and 245.248.128.0/22 (12) d = d + (y1 – y2)
(b) 245.248.136.0/24 and 245.248.132.0/21 (13) end
(c) 245.248.136.0/21 and 245.248.128.0/22 (14) end
(d) 245.248.132.0/22 and 245.248.132.0/21 Which statements are true?
Ans. (c) : Since routing prefix is 20, the ISP has 2^(32- P : For a line with slope m > 1, we should change
20) or 2^12 addresses. Out of these 2^12 addresses, the outer loop in line (4) to be over y.
half (or 2^11) addresses have to be given to Q : Lines (10) and (12) update the decision
organization A and quarter (2^10) addresses have to be variable d through an incremental evaluation
given to organization B. So routing prefix for of the line equation f.
organization A will be 21. For B, it will be 22. If we R : The algorithm fails if d is ever 0.
see all options given in question, only options (A) and
(B) are left as only these options have same number of Choose the correct answer from the code given
routing prefixes. Now we need to choose from option below :
(A) and (B). To assign addresses to organization A, Code :
ISP needs to take first 20 bits from 245.248.128.0 and (a) P, Q and R (b) P only
fix the 21st bit as 0 or 1. Similarly, ISP needs to fix (c) P and Q only (d) Q and R only
21st and 22nd bits for organization B. If we take a Ans. (c) : For a line with slope m > 1, we should
closer look at the options (A) and (B), we can see the
change the outer loop in line (4) to be over y
21st and 22nd bits for organization B are considered as
0 in both options. So 21st bit of organization A must for x = x1 to x2
be 1. Now take the first 20 bits from 245.248.128.0 Lines (10) and (12) update the decision variable d
and 21st bit as 1, we get addresses for organization A through an incremental evaluation of the line equation
as 245.248.136.0/21 f. Lines (10) and (12) update the decision variable d
55. Consider the graph shown below : through an incremental evaluation of the line equation
f.
d = d + (y1 – y2) + (x2 –x1)
d = d + (y1 – y2)
so, statement P and Q are true.
57. A full joint distribution for the Toothache,
Cavity and Catch is given in the table below.
Use Kruskal's algorithm to find the minimum Toothache ¬ Toothache
spanning tree of the graph. The weight of this Catch ¬ Catch Catch ¬ Catch
minimum spanning tree is
(a) 13 (b) 17 Cavity 0.108 0.012 0.072 0.008
(c) 16 (d) 14 ¬ Cavity 0.016 0.064 0.144 0.576
Ans. (c) : The graph contains 10 vertices and 16 edges. What is the probability of Cavity, given
So, the minimum spanning tree formed will be having evidence of Toothache?
(10 – 1) = 9 edges. (a) <0.6, 0.8> (b) <0.4, 0.8>
The weight of this minimum spanning tree is = 16 (c) <0.2, 0.8> (d) <0.6, 0.4>
UGC NET JRF Computer Science Dec. 2018 Paper-II 295 YCT
 Search on TG: @apna_pdf
Ans. (d) : Joint probability distribution for a set of 60. Consider the following sequence of two
random variables gives the probability of every atomic transactions on a bank account (A) with initial
event on those random variables balance 20,000 that transfers 5,000 to another
Toothache ¬ Toothache account (B) and then apply 10% interest.
Catch ¬ Catch Catch ¬ Catch (i) T1 start
Cavity 0.108 0.012 0.072 0.008 (ii) T1 A old = 20,000 new 15,000
¬ Cavity 0.016 0.064 0.144 0.576 (iii) T1 B old = 12,000 new = 17,000
Can also compute conditional probabilities: (iv) T1 commit
P(¬cavity ∧ toothache) (v) T2 start
P( cavity | toothache) =
P(toothache) (vi) T2 A old = 15,000 new = 16,500
0.016 + 0.064 (vii) T2 commit
= Suppose the database system crashes just
0.108 + 0.012 + 0.016 + 0.64
= 0.4 before log record (vii) is written. When the
Normalization–Denominator can be viewed as a system is restarted, which one statement is true
normalization constant α P(Cavity | toothache) = α, of the recovery process?
P(Cavity, toothache) (a) We must redo log record (vi) to set A to
= α, [P(Cavity, toothache, catch) + P(Cavity, 16,500 and then redo log records (ii) and (iii).
toothache, catch)] (b) We can apply redo and undo operations in
= α, [<0.108,0.016 > + <0.012, 0.064>] arbitrary order because they are idempotent.
= α, < 0.112, 0.08 > = <0.6,0.4> (c) We need not redo log records (ii) and (iii)
58. Which of the following is not one of the because transaction T1 has committed.
principles of agile software development
(d) We must redo log record (vi) to set A to
method?
(a) Embrace change 16,500.
(b) Incremental delivery Ans. (a) : We must redo log record (vi) to set A to
(c) Customer involvement 16,500 and then redo log records (ii) and (iii)
(d) Following the plan Note: Here we are not using checkpoints.
Ans. (d) : Embrace Change is the principle says, Recovery: When a system with concurrent
“Welcome changing requirements, even late in transactions crashes and recovers, it behaves in the
development. Agile processes harness change for the following manner–
customer’s competitive advantage.”
Incremental Model is a process of software The recovery system reads the logs backwards from
development where requirements are broken down into the end to the last checkpoint.
multiple standalone modules of software development It maintains two lists, an undo-list and a redo-list.
cycle. If the recovery system sees a log with <tn, start=””>
customer involvement in the production of goods and and <tn, commit=””> or just <tn, commit=””>, it puts
services is fundamental to making significant
the transaction in the redo-list.
improvements in the product output.
If the recovery system sees a log with <tn, start=””>
59. Suppose a system has 12 instances of some
resource with n processes competing for that but no commit or abort log found, it puts the
resource. Each process may require 4 instances transaction in undo-list.
of the resource. The maximum value of n for All the transactions in the undo-list are then undone
which the system never enters into deadlock is and their logs are removed. All the transactions in the
(a) 5 (b) 3 redo-list and their previous logs are removed and then
(c) 6 (d) 4 redone before saving their logs.
Ans. (b) : Number of processes (P) = 12
61. Identify the correct sequence in which the
Number of resources (R) = 4
Since deadlock-free condition is: following packets are transmitted on the
R ≥ P(N − 1) + 1 network by a host when a browser requests a
Where R is total number of resources, webpage from a remote server, assuming that
P is the number of processes, and the host has just been restarted.
N is the max need for each resource. (a) HTTP GET request, DNS query, TCP SYN
12 > = 4(3 – 1) + 1 So, no. of process = 3 (b) DNS query, TCP SYN, HTTP GET request
Therefore, the largest value of K that will always avoid (c) DNS query, HTTP GET request, TCP SYN
deadlock is 3.
(d) TCP SYN, DNS query, HTTP GET request
UGC NET JRF Computer Science Dec. 2018 Paper-II 296 YCT
 Search on TG: @apna_pdf
Ans. (b) : Step 1 : Whenever the client request for a Ans. (a) : Re-engineering is the examination, analysis
webpage, the query makes the DNS query to identify and alteration of an existing software system to
the Domain Name Space. DNS query is the process to reconstitute it in a new form, and the subsequent
identify the IP address of the DNS such as www.org. implementation of the new form.
The client’s computer will make a DNS query to one Software Reengineering is preferable for software
of its internet service provider’s DNS server. products having high failure rates, having poor design
Step 2 : As soon as DNS server is located a TCP and/or having poor code structure is correct.
connection is to be established for the further Reverse engineering is the process of analyzing a
communication. The TCP protocol requests the server subject system to identify the system's components and
to establishing a connection by sending a TCP their interrelationships and create representations of
SYN message. Which is further responded by the the system in another form or at a higher level of
server using SYN_ ACK from server to client and then abstraction.
ACK back to server from client (3- way hand shaking Software Reverse Engineering is the process of
protocol). analyzing software with the objective of recovering its
Step 3 : Once the connection has been established the design and requirements specification.
HTTP protocol comes into picture. It requests for the 64. Consider the following languages :
webpage using its GET method and thus, sending
L1 = {an+m bn am | n, m ≥ 0}
an HTTP GET request.
Hence, the correct sequence for the transmission of L2 = {an+m bn+m an+m | n, m ≥ 0}
packets is DNS query, TCP SYN, HTTP GET request. Which one of the following is correct?
(a) Both L1 and L2 are context free languages
62. Match List I with List II and choose the correct
(b) Both L1 and L2 are not context free languages
answer from the code given below.
(c) Only L1 is context free language
List I List II
(d) Only L2 is context free language
a. Greedy Best- i. Selects a node for
Ans. (c) : L1 = {an+m bn am | n, m ≥ 0}
First Search expansion if optimal
for L1,just push a on to the stack,now,for 'b' pop 'a'
path to that node
from the stack till 'a' is finished.then for all the 'b'
has been found.
remaining,push 'b' onto the stack,then for every 'c',pop
b. A+ Search ii. Avoids substantial 'b' from the stack.
overhead associated
L2 = {an+m bn+m an+m | n, m ≥ 0}
with keeping the
sorted queue of for L2,just push a and b and for every 'c',pop every 'b'
nodes. till 'b' is finished and then pop evry 'a'.after completing
string,if there is still any letter on stack then,not
c. Recursive iii. Suffers from
accepeted.
Best-First excessive node
Search generation. 65. Consider the following terminology and match
List I with List II and choose the correct
d. Iterative- iv. Time complexity
+ answer from the code given below.
deepening A depends on the
Search quality of heuristic. b = branching factor
d = depth of the shallowest solution
(a) a–iv, b–i, c–ii, d–iii
m = Maximum depth of the search tree
(b) a–iv, b–iii, c–ii, d–i
l = depth limit
(c) a–i, b–iv, c–iii, d–ii
(d) a–i, b–ii, c–iii, d–iv List I List II
(Algorithms) (Space
Ans. (c) : Complexity)
63. Which of the following statements is/are true? a. BFS search i. O(bd)
P : Software Reengineering is preferable for
b. DFS search ii. O(bd)
software products having high failure rates,
having poor design and/or having poor code c. Depth-limited iii. O(bm)
structure. search
Q : Software Reverse Engineering is the process d. Iterative iv. O(bl)
of analyzing software with the objective of deepening
recovering its design and requirements search
specification. (a) a–iii, b–ii, c–iv, d–i
Choose the correct answer from the code given (b) a–i, b–ii, c–iv, d–iii
below : (c) a–i, b–iii, c–iv, d–ii
(a) Both P and Q (b) Neither P nor Q (d) a–ii, b–iii, c–iv, d–i
(c) P only (d) Q only Ans. (d) :
UGC NET JRF Computer Science Dec. 2018 Paper-II 297 YCT
 Search on TG: @apna_pdf
66. Which of the following statements is/are false? List I List II
P : The clean-room strategy to software a. Blowfish i. 128 − 256 bits
engineering is based on the incremental
software process model. b. DES ii. 128 bits
Q : The clean-room strategy to software c. IDEA iii. 1 − 448 bits
engineering is one of the ways to overcome d. RC5 iv. 56 bits
"unconscious" copying of copyrighted code. Code :
Choose the correct answer from the code given (a) (a)-(iii), (b)-(iv), (c)-(i), (d)-(ii)
below : (b) (a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)
(a) Q only (b) Neither P and Q (c) (a)-(iii), (b)-(iv), (c)-(ii), (d)-(i)
(c) P only (d) Both P and Q (d) (a)-(ii), (b)-(iii), (c)-(iv), (d)-(i)
Ans. (b) : Incremental development The software is Ans. (c) :
partitioned into increments which are developed and
validated separately using the Cleanroom process. 69. The elements 42, 25, 30, 40, 22, 35, 26 are
These increments are specified, with customer input, at inserted one by one in the given order into a
an early stage in the process. So, P is incorrect. max-heap. The resultant max-heap is stored in
There are three teams involved when the Cleanroom an array implementation as
process is used for large system development : The (a) <42, 35, 40, 22, 25, 30, 26>
specification team :This group is responsible for (b) <42, 40, 35, 25, 22, 26, 30>
developing and maintaining the system specification. (c) <42, 35, 40, 22, 25, 26, 30>
So, Q is incorrect. (d) <42, 40, 35, 25, 22, 30, 26>
So, Both statement P and Q are incorrect. Ans. (d) :
67. In 3D Graphics, which of the following
statements about perspective and parallel
projection is/are true?
P : In a perspective projection, the farthest an
object is from the centre of projection, the smaller
it appears.
Q : Parallel projection is equivalent to a Because it is not max-heap so, interchange the value.
perspective projection where the viewer is
standing infinitely far away.
R : Perspective projections do not preserve
straight lines.
Choose the correct answer from the code given
Now, 35 value is not following the rule of max-heap
below :
so, interchange the value of 35 & 30.
Code :
So, now max heap is
(a) P and Q only (b) P, Q and R
(c) Q and R only (d) P and R only
Ans. (a) : Vanishing point: Where all parallel points
appear to meet is called vanishing point. So, statement
Q is correct.
Perspective foreshortening: As we move from centre Now, the sequence is 42, 40, 35, 25, 22, 30, 26.
of projection size of object varies inversely with So, option (d) is correct.
distance, this is known as perspective foreshortening.
70. Which of the following statement/s is/are true?
So, statement P is correct.
(i) Facebook has the world's largest Hadoop
Topological Distortion: A line segment joining a point
Cluster.
lying in front of the viewer to a point in back of the
viewer is projected to a broken line of infinite (ii) Hadoop 2.0 allows live stream processing of
extent.This is known as topological distortion. So, Real time data.
statement R is incorrect. Choose the correct answer from the code given
68. Match the following Secret Key Algorithms below :
(List I) with the Corresponding Key Lengths Code :
(List II) and choose the correct answer from (a) (ii) only (b) Neither (i) nor (ii)
the code given below. (c) (i) only (d) Both (i) and (ii)

UGC NET JRF Computer Science Dec. 2018 Paper-II 298 YCT
 Search on TG: @apna_pdf
Ans. (d) : The Datawarehouse Hadoop cluster at nodes with degree 2 == 3(that means there are 3 nodes
Facebook has become the largest known Hadoop having 2 child, i.e degree = 2+1 = 3)
storage cluster in the world. Here are some of the nodes with degree 3 == 3(that means there are 2 nodes
details about this single HDFS cluster: having 3 children (so degree == 3 + 1 = 4) and 1 root
21 PB of storage in a single HDFS cluster 2000 node with degree 3(number of children and because
machines ternary and root has no parent--> degree == 3 + 0 =
12 TB per machine (a few machines have 24 TB each) 3) )
1200 machines with 8 cores each + 800 machines with Let,
16 cores each number of leafs nodes = L
32 GB of RAM per machine and degree of all leafs node is 1 because it is attached
15 map-reduce tasks per machine with its parent i.e one edge
That's a total of more than 21 PB of configured storage total nodes in tree = internal nodes + leafs node = 4 + 3
capacity! This is larger than the previously known + 3 + L = 10 + L
Yahoo!'s cluster of 14 PB. Here are the cluster so, total number of edges in tree = (total nodes - 1) =
statistics from the HDFS cluster at Facebook. So, (10 + L) -1 = 9 + L
option (i) is correct. SUM OF DEGREE OF ALL THE VERTICES = 2
Hadoop batch processes data distributed over a number X (TOTAL NUMBER OF EDGES)
of computers ranging in 100s and 1000s. So, option (ii) (1(root) X 3) + ( 2 X 4 ) + (3 X 3) + (4 X 2) + ( L X
is correct. 1) = 2 X [ 9 + L ]
So, Both Statements are correct. ⇒ 3 + 8 + 9 + 8 + L = 18 + 2L
71. In computers, subtraction is generally carried ⇒ 28 + L = 18 + 2L
out by ⇒ L = 10
(a) 1's complement (b) 10's complement So, option is (d).
(c) 2's complement (d) 9's complement
74. Suppose for a process P, reference to pages in
Ans. (c) : In computers, subtraction is generally order are 1, 2, 4, 5, 2, 1, 2, 4. Assume that main
carried out by 2's complement. memory can accomodate 3 pages and the main
72. In 3D Graphics, which of the following memory has already pages 1 and 2 in the order
statements is/are true? 1 − first, 2 − second. At this moment, assume
P : Back-face culling is an example of an FIFO Page Replacement Algorithm is used
image-precision visible-surface determination then the number of page faults that occur to
procedure. complete the execution of process P is
Q : Z-buffer is a 16-bit, 32-bit, or 64-bit field (a) 3 (b) 4
associated with each pixel in a frame buffer (c) 5 (d) 6
that can be used to determine the visible
Ans. (c) :
surfaces at each pixel.
Choose the correct answer from the code given 4 4 4 1 1
below : 2 ⇒ 2 ⇒ 2 ⇒ 2 ⇒ 2 ⇒ 2
(a) Neither P nor Q (b) P and Q 1 1 5 5 5 5
PF=1 PF= 2 PF=3
(c) P only (d) Q only
So, option (c) is correct.
Ans. (d) : Back-face culling (an object space
algorithm) works on 'solid' objects which you are 75. The number of substrings that can be formed
looking at from the outside. That is, the polygons of from string given by a d e f b g h n m p is
the surface of the object completely enclose the object. (a) 10 (b) 55
So, statement P is incorrect. (c) 56 (d) 45
73. In a ternary tree, the number of internal nodes Ans. (c) : Input : Str = "abc"
of degree 1, 2 and 3 is 4, 3, and 3 respectively. Output : 6
The number of leaf nodes in the ternary tree is Proper substrings are "a", "b", "c", "ab", "bc", "abc"
(a) 12 (b) 11 Input : Str = "abcd"
(c) 9 (d) 10 Output : 10
Ans. (d) : SUM OF DEGREE OF ALL Proper substring are "a", "b", "c", "d", "ab", "bc", "cd",
THE VERTICES = 2 X (TOTAL NUMBER OF "abc", "bcd", and "abcd".
EDGES) Total number of string of all lengths from 1 to n =
in the question, it is given that, N+(N–1)+(N–2)+(N–3)+.....2+1=N*(N+1)/2
nodes with degree 1 == 4 (that means there are 4 nodes
Count of non-empty substrings is n * (n + 1) / 2
having 1 child, i.e degree = 1+1 = 2)
UGC NET JRF Computer Science Dec. 2018 Paper-II 299 YCT
 Search on TG: @apna_pdf
If we include empty string also substring, the count algorithm and in some cases we have best case as O(n)
becomes n*(n+1)/2 + 1 as is the case of S - grammar.
Then put the value in farmula– (ii) Let us assume that a CFL is regular..For that we
= n*(n + 1) /2 have to establish the fact that there exists some regular
= 10*(10 + 1) / 2 language L2 for CFL L1. The equivalence can be
= 10*(11)/2 written mathematically as :
= 55 L1 ⊕ L2 = Φ = L3 (say)
⇒ (L1 - L2) U (L2 - L1) = Φ
76. Consider a disk pack with 32 surfaces, 64
tracks and 512 sectors per pack, 256 bytes of Thus if we are able to establish L3 to be empty is
data are stored in a bit serial manner in a decidable, then our claim will be true..
sector. The number of bits required to specify a Now we concentrate on the 2nd term we are
particular sector in the disk is performing
(a) 20 (b) 19 L2 – L1 which can be written as : L2 I L1'
(c) 22 (d) 18 Now L1 being a CFL we know is not closed under
Ans. (a) : Capacity of disk = 32 surface × 64 tracks × complementation. So we go up the Chomsky hierarchy
512 sectors × 256 bytes = 268, 435, 456 byte = 256 mb for the sake of generality and now hence we push L1
to CSL level.
Total number of sectors
Now L2 is regular and L1' is a CSL for sure..So the
= 32 surface × 64 tracks × 512 sectors2nd term will also be a CSL and the first term (L1 -
= 1,048,576 = 220 L2) will be a CFL.
So, the number of bits required to access a sector is 20.
But to do union , we push the 1st term up to CSL level,
So, option (a) is correct. hence L1 - L2 be CSL..Now union of 2 CSL is a CSL.
77. The solution of recurrence relation : Hence the resultant language L3 is a CSL.
T(n) = 2 T (sqrt(n)) + lg (n) But we know emptyness problem for CSL is
is undecidable.
(a) O(n lg (n)) Hence our assumption was false.
(b) O(lg (n) lg(lg (n))) Hence it is proved that the regularity of CFL is
(c) O(lg (n) lg (n)) undecidable.
(d) O(lg (n) lg (n)) Whether a Turing machine computes the product of
two numbers is undecidable.
Ans. (b) : T(n) = 2T ( n ) + log n
79. In K-coloring of an undirected graph G = (V,
Let n = 2k E) is a function
T(2k) = 2T(2k/2) + k c : V → {0, 1, ...., K − 1} such that c(u) ≠ c(v)
Let T(2k) = S(k) for every edge (u, v) ∈ E.
Using master theorem Which of the following is not correct ?
S(k) = O(k log k) (a) G has cycles of odd length
So, T(n) = O((logn(logn (logn))) (b) G is bipartite
So, option (b) is correct. (c) G has no cycles of odd length
78. Consider the following problems : (d) G is 2-colorable
(i) Whether a finite state automaton halts on all Ans. (a) : The idea is based on an important fact that a
inputs? graph does not contain a cycle of odd length if and
(ii) Whether a given context free language is only if it is Bipartite, i.e., it can be colored with two
regular? colors.
(iii) Whether a Turing machine computes the It is obvious that if a graph has an odd length cycle
product of two numbers? then it cannot be Bipartite. In Bipartite graph there are
Which one of the following is correct ? two sets of vertices such that no vertex in a set is
Code : connected with any other vertex of the same set). For a
(a) Only (i) and undecidable problems cycle of odd length, two vertices must of the same set
(b) Only (i) and (iii) are undecidable problems be connected which contradicts Bipartite definition.
(c) (i), (ii) and (iii) are undecidable problems 80. Consider two sequences X and Y :
(d) Only (ii) and (iii) are undecidable problems X = <0, 1, 2, 1, 3, 0, 1>
Ans. (d) : i) is decidable as we have various Y = <1, 3, 2, 0, 1, 0>
membership algos for CFL class of languages like The length of longest common subsequence
CYK algo , LL(k) and LR(k) parsing algos etc..In fact between X and Y is
the upper bound to determine if a string belongs to a (a) 4 (b) 5
3 (c) 3 (d) 2
CFL is given by O(n ) in worst case scenario by CYK
UGC NET JRF Computer Science Dec. 2018 Paper-II 300 YCT
 Search on TG: @apna_pdf
Ans. (a) : Simply observe the longest sequence in Ans. (c) : IEEE 754, 32 bit representation, 1 bit for
order common in both sign, 8 bits for Exponent and 23 bits for mantissa
X = <0, 1, 2, 1, 3, 0, 1> Note that Exponent represented in Excess-127 format.
Y = <1, 3, 2, 0, 1, 0> We have to represent -40.1,
⇒ (1, 2, 1, 0) So sign bit = 1
⇒ So, the length of longest common subsequence 40 = 32+8 = (101000)22
is 4 (1, 2, 1, 0). 0.1 = (00011 0011 0011 0011 0011 00)22 ..........
So, option (a) is correct. represented with 23 bits
81. Consider the following statements : 40.1 = 101000 . 00011 0011 0011 0011 0011 00 -----
S1 A heuristic is admissible if it never ------------ in binary form.
overestimates the cost to reach the goal. = 1 . 01000 00011 0011 0011 0011 0011 00 *
255 ----- NOW it is in 1.M format, Keep only 23 bits
S2 A heuristic is monotonous if it follows triangle
in
inequality property.
Mantissa
Which one of the following is true referencing
the above statements? = 1 . 01000 00011 0011 0011 0011 0 * 255 -----
Choose the correct answer from the code given NOW it is in 1.M format, and Mantissa have 23 bits
below : only.
Code : True exponent is 5 ( which is in power of 2) ==>
Excess
(a) Statement S1 is true but statement S2 is false.
Exponent value = 5+127 = 132 = 128 + 4 = 10000100
(b) Statement S1 is false but statement S2 is true.
total representation is like:
(c) Both the statements S1 and S2 are true.
(d) Neither of the statements S1 and S2 are true. sign Exponent Mantissa
Ans. (c) : S1 A heuristic is admissible if it never 1 10000100 01000000110011001100110
overestimates the cost to reach the goal. True Finally it is like
S2 A heuristic is monotonous if it follows triangle (11000010001000000110011001100110)22
inequality property. True 1100 0010 0010 0000 0110 0110 0110 0110
So, option (c) is correct. ⇒ 0xC220666
82. Consider the following two languages : 84. Consider the sentence below.
L1 = {x | for some y with |y| = 2|x|, xy ∈ L and L is "There is a country that borders both India
regular language} and Nepal."
L2 = {x | for some y such that |x| = |y|, xy ∈ L and Which of the following represents the above
L is regular language} sentence correctly?
Which one of the following is correct ? (a) ∃c Country(c) ⇒ [Border(c, India) ˄ Border
Code : (c, Nepal)]
(a) Only L2 is regular language (b) [∃c Country(c)] ⇒ [Border(c, India) ˄ Border
(b) Both L1 and L2 are not regular languages (c, Nepal)]
(c) Both L1 and L2 are regular languages (c) ∃c Border(Country(c), India ˄ Nepal)
(d) Only L1 is regular language (d) ∃c Country(c) ˄ Border(c, India) ˄ Border(c,
Ans. (c) : If L1 and If L2 are two regular languages, Nepal)
their union L1 U L2 will also be regular. {x | for some Ans. (d) : The existential quantifier ∃ (which means
y with |y| = 2|x|, xy ∈ L and L is regular language} L2 "there exists"), differs from the universal quantifier ∀
= {x | for some y such that |x| = |y|, xy ∈ L and L is (which means "for all").
regular language} If L1 and If L2 are two regular ∃c Country (c)
languages, their concatenation L1.L2 will also be
regular. Border (c, India) ∧ Border (c, Nepal)
If so, option c is correct Both L1 and L2 are regular 85. Consider R to be any regular language and L1,
language. L2 be any two context-free languages.
83. The decimal floating point number −40.1 Which one of the following is correct?
represented using IEEE− −754 32-bit (a) L1 I L2 is context free
representation and written in hexadecimal
form is (b) ( L1 U L 2 ) − R is context free
(a) 0xC2006000 (b) 0xC2006666 (c) L1 − R is context free
(c) 0xC2206666 (d) 0xC2206000 (d) L1 is context free
UGC NET JRF Computer Science Dec. 2018 Paper-II 301 YCT
 Search on TG: @apna_pdf
Ans. (c) : Context free language are closed under Ans. (b) : Semidynamic if the environment itself does
union and difference with regular language. not change with the passage of time but the agent's
It is not closed under complementation and performance score does.
intersection. Complement of CFL is recursive 89. Consider the following set of processes and the
language . length of CPU burst time given in milliseconds:
So, option (c) is right only. Process CPU
86. Data scrubbing is Burst time (ms)
(a) A process to upgrade the quality of data after P1 5
it is moved into a data warehouse. P2 7
(b) A process to load the data in the data P3 6
warehouse and to create the necessary P4 4
indexes.
Assume that processes being scheduled with
(c) A process to upgrade the quality of data Round-Robin Scheduling Algorithm with time
before it is moved into a data warehouse. quantum 4 ms. Then the waiting time for P4 is
(d) A process to reject data from the data _______ ms.
warehouse and to create the necessary (a) 12 (b) 6
indexes. (c) 0 (d) 4
Ans. (c) : Data scrubbing, also called data cleansing,
is the process of amending or removing data in Ans. (a) : P1 P2 P3 P4 P1 P2 P3 P4
0 4 8 12 16 17 20 22 22
a database that is incorrect, incomplete, improperly
formatted, or duplicated before it is moved into a data Process Bt TAT W.T
warehouse. P1 5 1
87. Consider the following two statements : P2 7 3
S1 : TCP handles both congestion and flow P3 6 2
control P4 4 0 16 − 4 = 12
S2 : UDP handles congestion but not flow P4 = 12
control 90. Which of the following HTML5 codes will
Which of the following options is correct with affect the horizontal as well as vertical
respect to the above statements (S1) and (S2)? alignment of the table content ?
Choose the correct answer from the code given (a) <td style ="horizontal-align : center; vertical-
below : align : middle;"> BASH </td>
Code : (b) <td halign ="middle" valign="center" >
(a) S1 is correct but S2 is not correct BASH </td>
(b) Both, S1 and S2 are correct (c) <td style="text-align : center; vertical-align :
(c) Neither S1 nor S2 is correct middle;" > BASH </td>
(d) <td align="middle" valign="center" > BASH
(d) S1 is not correct but S2 is correct
</td>
Ans. (a) : s1: with the help of TCP window=>flow
Ans. (c) : align = left|center|right|justify|char [CI]
control and with the help of congestion window=>
This attribute specifies the alignment of data and the
Congestion control justification of text in a cell. Possible values:
s2: No field are there in UDP header to control flow or
• left: Left-flush data/Left-justify text. This is the
congestion default value for table data.
So, option (a) is correct, statement S1 is correct but S2 • center: Center data/Center-justify text. This is the
is not correct. default value for table headers.
88. Which of the following is true for semi- • right: Right-flush data/Right-justify text.
dynamic environment? • justify: Double-justify text.
(a) Environment and performance score, both • char: Align text around a specific character. If a
change simultaneously. user agent doesn't support character alignment,
(b) The environment itself does not change with behavior in the presence of this value is
the passage of time but the agent's unspecified.
performance score does. 91. Consider a vocabulary with only four
(c) Even if the environment changes with the propositions A, B, C and D. How many models
passage of time while deliberating, the are there for the following sentence?
performance score does not change. ¬A∨¬B∨¬C∨¬D
(d) The environment may change while the agent (a) 8 (b) 7
is deliberating. (c) 16 (d) 15
UGC NET JRF Computer Science Dec. 2018 Paper-II 302 YCT
 Search on TG: @apna_pdf
Ans. (d) : 94. Match each UML diagram in List I to its
appropriate description in List II.
A B C D ¬A ¬B ¬C ¬D ¬A ∨ ¬B ∨ ¬C¬D
List I List II
F F F F T T T T T
F F F T T T T F T a. State Diagram i. Describes how the
external entities
F FT F T T F T T
(people, devices)
F FT T T T F F T can interact with the
F T F F T F T T T system.
F T F T T F T F T b. Use-Case ii. Used to describe the
F TT F T F F T T Diagram static or structural
F TT T T F F F T view of a system.
T F F F F T T T T c. Class Diagram iii. Used to show the
T F F T F T T F T flow of a business
T FT F F T F T T process, the steps of
T FT T F T F F T a use-case or the
logic of an object
T T F F F F T T T
behaviour.
T T F T F F T F T
d. Activity iv. Used to describe the
T TT F F F F T T Diagram dynamic behaviour
T TT T F F F F F of objects and could
Therefore, there are 15 models for which proposition is also be used to
true. describe the entire
92. ________ system call creates new process in system behaviour.
Unix. Code :
(a) fork (b) create (a) (a)-(i), (b)-(iv), (c)-(ii), (d)-(iii)
(c) create new (d) fork new (b) (a)-(iv), (b)-(i), (c)-(ii), (d)-(iii)
Ans. (a) : Fork system call use for creates a new (c) (a)-(i), (b)-(iv), (c)-(iii), (d)-(ii)
process, which is called child process, which runs (d) (a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)
concurrently with process (which process called Ans. (b) :
system call fork) and this process is called parent
process. After a new child process created, both 95. Consider the following x86 − assembly
processes will execute the next instruction following language instructions :
the fork() system call. A child process uses the same MOV AL, 153
pc(program counter), same CPU registers, same open NEG AL
files which use in the parent process. The contents of the destination register AL (in
93. Consider the following minimax game tree 8-bt binary notation), the status of Carry Flag
search (CF) and Sign Flag (SF) after the execution of
above instructions, are
(a) AL = 0110 0110; CF = 0; SF = 0
(b) AL = 0110 0111; CF = 0; SF = 1
(c) AL = 0110 0110; CF = 1; SF = 1
(d) AL = 0110 0111; CF = 1; SF = 0
Ans. (d) : It is 8086 question AX(16 bit) =AH( 8 bit)
What will be the value propagated at the root? +AL (8 bit)
(a) 4 (b) 3 mov al,153; Return exit code value; AL = 010011001;
(c) 6 (d) 5 • The NEG instruction negates a value by finding 2's
Ans. (d) : complement of its single operand.
• This simply means multiply operand by -1.
• When a positive value is negated the result is
negative.
• When a positive value is negated the result is
negative.
• A negative value will become positive.
Here maximum game tree search is 5. • Zero remains zero.
So, option (d) is correct. NEG AL= AL = 0110 0111;
UGC NET JRF Computer Science Dec. 2018 Paper-II 303 YCT
 Search on TG: @apna_pdf
The Carry Flag (CF) }
• CF = 1 if there is a carry out from the msb (most Which of the following integers best
significant bit) on addition, or there is a borrow into approximates the value of f(2, 3)?
the msb on subtraction (a) 0 (b) 1
• CF = 0 otherwise (c) 3 (d) 2
• CF is also affected by shift and rotate instructions Ans. (d) : Float class is a wrapper class for the
The Sign Flag (SF) primitive type float which contains several methods to
• SF = 1 if the msb of a result is 1; it means the result effectively deal with a float value like converting it to
is negative if you are giving a signed interpretation a string representation, and vice-versa. An object of
• SF = 0 if the msb is 0 Float class can hold a single float value. There are
mainly two constructors to initialise a Float object-
96. An agent can improve its performance by
Float(float b: Creates a Float object initialized with
(a) Perceiving (b) Learning
the value provided.
(c) Responding (d) Observing
float result = (float) m / (float) n;
Ans. (b) : An agent can improve by saving the
if (m < 0 | | n < 0)
previous states on which it was earlier, hence in future
return 0.0f;
it can learn to respond in the same situation better.
integers best approximates the value of f(2, 3)= f(2,3)
97. In Linux operating system environment _____
= 0.6666667
command is used to print a file.
so, correct option is (d).
(a) print (b) lpr
(c) pr (d) ptr 100. The relation ≤ and < on a boolean algebra are
defined as :
Ans. (b) : In Linux operating system environment Lpr
command is used to print a file. x ≤ y if and only if x ∨ y = y
Lpr- Off line print x < y means x ≤ y but x ≠ y
98. The Third Generation mobile phones are x ≥ y means y ≤ x and
digital and based on x > y means y < x
(a) AMPS (b) Broadband CDMA Considering the above definitions, which of the
(c) D-AMPS (d) CDMA following is not true in the boolean algebra?
Ans. (b) : Broadband code division multiple access (i) If x ≤ y and y ≤ z, then x ≤ z
(B-CDMA) is a CDMA-based cellphone technology (ii) If x ≤ y and y ≤ x, then x = y
that uses broadband transmission. It is an improvement (iii) If x < y and y < z, then x ≤ y
over the first-generation CDMA, which uses (iv) If x < y and y < z, then x < y
narrowband transmission. This kind of technology Choose the correct answer from the code given
allows for better deployment of transmitter signals. below :
The first generation (1G) began in the early 80's with Code :
commercial deployment of Advanced Mobile Phone
(a) (iv) only (b) (i) and (ii) only
Service (AMPS) cellular networks.
(c) (ii) and (iii) only (d) (iii) only
99. Consider the following recursive Java function
Ans. (d) :
f that takes two long arguments and returns of
(i) x≤y if and only if x∨y=y is true according to x≤y
float value :
if and only if x ∨ y = y
public static float f{long m, long n}
{ (ii) If x≤y and y≤x, then x=y is true according to x≥y
float result = (float) m / (float) n; means y ≤ x and
if (m < 0 | | n < 0) (iii) If x < y and y < z, then x ≤ y is not true because
return 0.0f; according to If x < y and y < z, then x < y.
else (iv) If x < y and y < z, then x < y is true because
result + = f(m*2, n*3); according to If x < y and y < z, then x < y.
return result; So, option is (c) is correct.
UGC NET JRF Computer Science Dec. 2018 Paper-II 304 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. 24 June, 2019

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. Which of the following is correct for the given 3. How many bit strings of length ten either start
poset? with a 1 bit or end with two bits 00?
(a) There exists a greatest element and a least (a) 320
element (b) 480
(b) There exists a greatest element but not a least (c) 640
element (d) 768
(c) There exists a least element but not a greatest Ans. (c) : The problem can be divided into two parts,
element Part 1:- No. of bit strings of length 10 that start with bit
(d) There does not exist a greatest element and a 1
least element So, the strings will be of the form
Ans. (d) : A relation R on set A is called partial 1_________
ordering or partial order if it is reflexive, anti-symmetric which means 9 empty places to fill with either 0 or 1,
and transitive. A set together with a partial ordering R is hence 29 ways.
called a partial ordered set or poset. The poset is Part 2:- No of bit strings of length 10 that end two bit
denoted as (S,R). zero.
Relations can be used to order some or all the elements Now we have already counted the strings the end with
of a set. For instance, the set of natural number is two bit zeros in the part 1, but all those strings. Were
ordered by the relation ≤ such that for every ordered starting with a bit 1, so we still haven't counted the bit
pair (x, y) in the relation, natural number x comes strings that start with a zero and end with two zeros. So
before the natural number y unless both are equal. So such string will be of the form.
option fourth is correct. 0 _ _ _ _ _ _ _ 00
2. How many ways are there to place 8 which means 7 empty places to fill with either 0 or 1
indistinguishable balls into four distinguishable hence 27 ways.
bins? Hence total no of ways = part 1 + part 2
(a) 70 = 29 + 27
(b) 165 = 27 * (22 + 1)
(c) 8C4 = 128 × 5
(d) 8P4 = 640
Ans. (b) :If the question ask about number of ways in 4. Suppose that a connected planar graph has six
Which m indistinguishable balls is placed into n vertices, each of degree four. Into how many
regions is the plane divided by a planar
distinguishable boxes then it is a question of selection
representation of this graph?
of m boxes out of n boxes.
(a) 6
Two cases may arise :-
(b) 8
(a) No of balls m > No. of boxes, n.
(c) 12
Then we have to use selection of boxes where
(d) 20
repetition is allowed.
Ans. (b) : We apply Euler's formula where r = e – v + 2
No. of ways = n + m –1Cm
since each vertex has degree 4, the sum of the degree is
(b) No. of balls, m ≤ no. of boxes, n
24.
Then we have to use selection of m boxes out of n
By handshaking theorem, 2e = 24
boxes where no repetition is allowed.
So e = 12
No. of ways = nCm
r = 12 – 6 + 2
In this question, m = 8, and n = 4
r=8
Since m > n we have to use selection of n boxes within So we have 8 regions in this graph.
repetition
5. For which values of m and n does the complete
∴ Required number of ways = n + m –1Cm
bipartite graph km.n have a Hamilton circuit?
= 4 + 8 –1C8 = 11C8 = 165
(a) m ≠ n, m, n ≥ 2
UGC NET JRF Computer Science June 2019 Paper-II 305 YCT
 Search on TG: @apna_pdf
(b) m ≠ n, m, n ≥ 3 8. Match List-I with List-II :
(c) m = n, m, n ≥ 2 List-I List-II
(d) m = n, m, n ≥ 3 (A) p→q (i) (q →  p)
Ans. (c) : Complete bipartite graph : In this graph (B) p∨q (ii) p ^ q
vertices one partitioned into two sets such that no (C) p^q (iii) p → q
vertices are connected in the same set and all vertices of (D)
(p → q) (iv)  p ∨ q
one set are connected to all other vertices of different
set. All possible pairs of edges are considered except Choose the correct option from those given
below :
edges in the same set.
(a) (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)
Hamiltonian Circuit → In this circuit, every vertex is
(b) (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)
visited only once. It must start and end at the same
vertex. (c) (a)-(ii), (b)-(iii), (c)-(i), (d)-(iv)
(d) (a)-(iv), (b)-(iii), (c)-(i), (d)-(ii)
In complete bipartite graph km,n when m = n, then in that
case, it has a Hamiltonian circuit consider m = n = 3
So option c. is the correct answer. (option d is also Ans. (d) :
correct but option c is more appropriate since it covers List-I List-I
the case m, n = 2 (A) p→q (iv)  p ∨ q
For a bipartite graph (km,n) to be a Hamiltonian graph m (B) p∨q (iii) p → q
= n and m, n ≥ 2 (C) p^q (i) (q →  p)
6. Which of the following is principal conjunctive (D) (p → q) (ii) p ^ q
normal form for [(p ∨ q) ^ ¬ p → ¬ q]?
(A) p → q = p ∨ q
(a) p ∨ ¬ q
(B) p ∨ q
(b) p ∨ q (C) p ^ q
(c) ¬ p ∨ q (D) (p → q) = (p ∨ q) = p ^ q
(d) ¬ p ∨ ¬ q (i) (q → p) = (q ∨p) = q ^ p
Ans. (a) : Given (p ∨ q) ^ ¬ p → ¬ q (ii) p ^ q
The precedence of the used operators are :- (iii) p → q = p ∨ q
^ > ∨ → (iv) p ∨ q
Therefore, [(p ∨ q) ^ ¬ p → ¬ q] 9. Find the zero-one matrix of the transitive
⇔ [((p ∨ q) ^ ¬ p) → ¬ q] closure of the relation given by the matrix A :
⇔ [((p ^ ¬ q) ∨ (q ^ ¬ p)) → ¬ q] – using distributive 1 0 1 
A = 0 1 0
law
⇔ [(F ∨ (q ^ ¬ p)) → ¬ q]
1 1 0
⇔ [(q ^ ¬ p) → ¬ q]
⇔ [ ¬ (q^ ¬ p) ∨ ¬ q] – using demorgan's law 1 1 1 
⇔ [ ¬ q ∨ p ∨ ¬ q] ⇔ [p ∨ ¬ q] (a) 0 1 0 
7. How many cards must be selected from a 1 1 1 
standard deck of 52 cards to guarantee that at
1 0 1 
least three hearts are present among them?
(a) 9 (b) 13 (b) 0 1 0 
(c) 17 (d) 42 1 1 0 
Ans. (d) : In this the worst case will happen as follows 1 0 1 
:- (c) 0 1 0 
1st 13 * 3 = 39 cards that we pick up turns out to be any
one of diamonds or spades or clubs but not hearts. 1 0 1 
Now when we pick the next 3 cards they are guaranteed 1 1 1 
to be hearts (Q we have already picked cards from all (d) 0 1 0 
other suits)
1 0 1 
∴ We need to pick 13 + 13 + 13 + 3 = 42 cards in order
to guarantee that there are atleast 3 cards of hearts in the Ans. (a) : Let the elements be a, b, c on which the
selected cards. relation is defined.

UGC NET JRF Computer Science June 2019 Paper-II 306 YCT
 Search on TG: @apna_pdf
Then from the matrix we can say that the relation given Now, choose the lowest positive number including zero
is in theta and mark if key row.
{(a, a), (a, c), (b, b), (c, a), (c, b)} Intersection on key column and key row is key
Now, what are the minimum number of ordered pairs elements key column is Xu.
that we should add to the given relation that it becomes Key row is the minimum value in Theta i.e 1st row. key
transitive relation ? element is 2(S1 X1)
Using Warshall's Algorithm we can see that (c, c) and But key element should be 1 so, divide the complete row
(a, b) are missing. by 2
After adding them to the relation and making the matrix Cj 2 -1 2 0 0 0
again the matrix will become CB Base X1 X2 X3 S1 S2 S3 b
1 1 1  0 S1 2 1 0 1 0 0 10
0 1 0 
  0 S2 0 2 0 0 1 1 15
1 1 1  2 X3 1/2 0 1 0 0 1/2 5/2
10. Consider and LPP given as Zj = \ 0 0 0 0 0 0 5
Max Z = 2x1 – x2 + 2x3 (\ sum
Subject to the constraints {C-
2x1 + x2 ≤ 10 B}{X-
J}\)
x1 + 2x2 – 2x3 ≤ 20
x1 + 2x2 ≤ 5 Cj=Cj- 2 -1 2 0 0 0
Zj
x1, x2, x3 ≥ 0 st
What shall be the solution of the LPP after Hence 1 iteration table is prepared b indicates value of
applying first iteration of the Simplex Method? variable which is corresponding in column Cj (only
take the give Xi variable). therefore X1 = 0, X2 = 0,
5
(a) x1 = , x2 = 0, x3 = 0, Z = 5 X3 = 5/2
2
b indicated values of Zmax in Row Cj and therefore
5
(b) x1 = 0, x2 = 0, x 3 = , Z = 5 Zmax = 5
2
11. Which type of addressing mod, less number of
5 5
(c) x1 = 0, x 2 = , x3 = 0, Z = − memory references are required?
2 2 (a) Immediate
(d) x1 = 0, x2 = 0, x3 = 10, Z = 20 (b) Implied
Ans. (b) : (c) Register
Given max z = 2x1 – x2 + 2x3 + OS1 + OS2 + OS3 (d) Indexed
2x1 + x2 + s1 = 10 Ans. (c) : (Dropped Question by NTA)
x1 + 2x2 – 2x3 + S2 = 20
Immediate addressing mode- may or may not need
x1 + 2x3 + S3 = 5 memory reference
initial simplex table : Implied addressing mode- may or may not need
Cj= 2 -1 2 0 0 0 Theta
memory reference (Like push, pop or CMA instruction)
CB Base x1 x2 x3 S1 S2 S3 b
Register Addressing mode- It does not need memory
0 S1 2 1 0 1 0 0 10 ND
reference as operands one always in register.
0 S2 1 2 -2 0 1 0 20 -10
0 S3 1 0 2 0 0 1 5 5/2
Indexed addressing mode- need memory reference.
Zj = \ 0 0 0 0 0 0 12. Suppose that the register A and the register K
( \ sum have the bit configuration. Only the three
{C_B} leftmost bits of A are compared with memory
x _ j}\ ) words because K has I's in these positions.
Cj=Cj-Zj 2 -1 2 0 0 0 Because of its organization, this type of
Here in Cj, we have two numbers which are highest (ie. memory is uniquely suited to parallel searches
2 in column 1st and 2 in column 3rd) by data association. This type of memory is
So we can choose any column to begin with : known as
So lets start with column 3rd for convenience. (a) RAM
Hence column 3rd become key column. (b) ROM
Now, we find Theta = b/corresponding key column (c) content addressable memory
element. (d) secondary memory
UGC NET JRF Computer Science June 2019 Paper-II 307 YCT
 Search on TG: @apna_pdf
Ans. (c) : The time required to find an item stored in word. When a word is to be read from memory, the
memory can be reduced considerably if stored data is content of the word is specified, and memory locates all
identified for access by the content of the data itself words which matches the specified content and marks
rather than by an address. Memory unit associated by them for reading.
content is called an associative memory or content 13. How many different Boolean functions of
addressable memory (CAM). degree n are there?
n
CAM is accessed simultaneously and in parallel on the (a) 22
basis of data content rather than specific location. When (b) (22)n
a word is written in CAM, no address is given. Memory n
(c) 22 − 1
is capable of finding an unused empty slot to store the (d) 2n
2n
Ans. (a) : In general for n variable there are 2n rows and 2 possible functions.
Degree of Boolean function = number variables = n
Variable is of Boolean type
Sequence possible of two Boolean = 2n
Different Boolean function = \({{2}^{{{2}^{n}}}}\)
Example :
By taking n = 2
A B F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15
0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1
0 1 0 0 0 0 1 1 1 1 0 0 0 0 0 1 1 1
1 0 0 0 1 1 0 0 1 0 0 0 1 1 1 0 1 1
1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
Different Boolean function = \({{2}^{{{2}^{n}}} = {{2}^{2}}^{2} = 16\)
Therefore 16 Boolean function is possible.
14. The fault can be easily diagnosed in the micro- 15. What will be the number of states when a
program control unit using diagnostic tools by MOD-2 counter is followed by a MOD-5
maintaining the contents of counter?
(a) flags and counters (a) 5
(b) registers and counters (b) 10
(c) flags and registers (c) 15
(d) flags, registers and counters (d) 20
Ans. (d) : Flags, registers and counters- Ans. (b) : When mod- x counter is followed by mod-y
within the computer, a control unit manages the counter then the resultant counter is always mod-(x * y)
computer's resources and orchestrates the performance counter.
of its functional parts in response to the instructions. So simply multiply MOD value, answer will be 10.
Microprogrammed control unit operates by executing 16. For a magnetic disk with concentric circular
instructions that define the functionality of the control tracks, the seek latency is not linearly
unit. In this, set of micro instructions is stored in the proportional to the seek distance due to
control memory. The control address register contains (a) non-uniform distribution of requests
the address of the next micro instruction to be read. (b) arm starting or stopping inertia
When a micro instruction is read from the control
(c) higher capacity of tracks on the periphery of
memory, it is transferred to a control buffer register.
the platter
Next element is sequencing unit that loads the control
address register and issues a read command. (d) use of unfair arm scheduling policies
Ans. (b) : Whenever head moves from one track to
other then its speed and direction changes. Which is
nothing but change in motion or the case of inertia.
The positioning time, or random-access time, consists
of two parts : the time necessary to move the disk arm
to the desired cylinder, called the seek time, and the
time necessary for the desired sector to rotate to the disk
head, called the rotational latency.
UGC NET JRF Computer Science June 2019 Paper-II 308 YCT
 Search on TG: @apna_pdf
The seek letency is not linearly proportional to the seek 2-put b = 7
distance due to arm starting and stopping inertia. It (49 + 28 + 6)10 + (75 + 5 + 3)10 = (64 × 2 + 32 + 6)10
means seek time is not directly dependent on the seek (166)10 = (166)10 True
distance traveled, but also on the accelerational So 7 is right Answer.
deceleration (on inertia) of actuator arm. 19. How many address lines and data lines are
17. The parallel bus arbitration technique uses an required to provide a memory capacity of 16k
external priority encoder and a decoder. × 16?
Suppose, a parallel arbiter has 5 bus arbiters. (a) 10, 4 (b) 16, 16
What will be the size of priority encoder and (c) 14, 16 (d) 4, 16
decoder respectively? Ans. (c) : Memory capacity = 16k × 16 = 214 × 24
(a) 4 × 2, 2 × 4 Memory capacity is of the form = 2m × 2n
(b) 2 × 4, 4 × 2 Address lines required = r = 14
(c) 3 × 8, 8 × 3 Data lines required = 2n = 16
(d) 8 × 3, 3 × 8 20. Suppose that a computer program takes 100
Ans. (d) : Arbiters → Arbiters are electronic devices seconds of execution time on a computer with
that allocate access to shared resources. multiplication operation responsible for 80
Example → seconds of this time. How much do you have to
A bus arbiter is a device used a multi master bus system improve the speed of multiplication operation if
to decide which bus master will be allowed to control you are asked to execute this program four
the bus for each bus cycle. times faster?
Since, it is given that the parallel arbiter has 5 bus (a) 14 times faster
arbiters. Hence, number of bits required to provide 5 (b) 15 times faster
bus arbiters are 3 bits (Since 23 = 8). (c) 16 times faster
Now encoder is a type of combinational circuit which (d) 17 times faster
consist of 2n input lines and n output lines i.e 2n × n Ans. (c) : Total Execution time = time to execute
encoder. Now n = 3 bits. Therefore, size of encoder is 8 multiplication operation + time for other operations.
× 3. Similarly decoder is a combinational circuit which Calculation → Total execution time = 100 seconds
consist of n-input lines and 2n output lines, i.e, n × 2n Time to execute multiplication operation = 80 Seconds
decoder. So size of decoder is 3 × 8. Then time to execute other operation = 100 – 80
18. Consider the equation (146)b + (313)b–2 = (246)8 = 20 Seconds.
Which of the following is the value of b? To execute the program four time faster, we have to
(a) 8 improve the multiplication operation according to the
(b) 7 question.
(c) 10 To execute the program four times faster.
(d) 16 Total execution time will become = 100/4 = 25 Second
Ans. (b) : First convert each term is base 10 to find base New time to perform multiplication operation
and make equation = new total execution time – time for other operations
Method 1:- New time to perform multiplication operation
First convert all into base 10 = 25 – 20 = 5 Sec.
(146)b + (313)b-2 = (246)8 So speed of multiplication operation is improved by =
⇒ b2 + 4b + 6 + 3(b-2)2 + 1(b – 2) + 3 = 128 + 32 + 6 80/5 = 16 times
b2 + 5b + 7 + 3 (b2 + 4 – 4b) = 166 speed becomes 16 times fast.
b2 + 5b + 7 3b2 + 12 – 12b = 166 21. Consider the following pseudo-code fragment
4b2 – 7b + 19 – 166 = 0 in which an invariant for the loop is "m*xk = pn
4b2 – 7b – 147 = 0 and k ≥ 0" (here, p and n are integer variables
that have been initialized) :
+7 ± 49 − 4 × 4 × −147
b= /* Pre-conditions : p ≥ 1 ^ n ≥ 0 * /
2× 4
/* Assume that overflow never occurs */
7 ± 49 56
= = =7 int x = p; int K = n; int m = 1;
8 8 while (k < > 0) {
Method 2:- By elimination if (k is odd) then m = m*x;
1-put b = 8 convert each into base 1 x = x*x;
(64 + 32 + 6)10 + (3 × 36 + 6 × 3)10 = (64 ×2 + 32 + 6)10 k = k/2; /*floor (k/2)*/
(219)10 ≠ (166)10 false }

UGC NET JRF Computer Science June 2019 Paper-II 309 YCT
 Search on TG: @apna_pdf
Which of the following must be true at the end Object s1 = new Good (22);
of the while loop? Object s2 = new Good (22);
(a) x = pn System . out . println (m1 equals (m2));
(b) m = pn System . out . println (s1 equals (s2));
(c) p = xn System . out . println (m1 equals (s2));
(d) p = mn System . out . println (s1 equals (m2));
Ans. (b) : This pseudo code basically represents the }
exponentiation algorithm. With p as the base and n as }
the power and the final result is stored in m. (a) True, True, False, False
22. Consider the following C-code fragment (b) True, False, True, False
running on a 32-bit x86 machine : (c) True, True, False, True
typedef struct{ S B [10 ] ; (d) True, False, False, False
union{ S* p = &B [ 4 ] ; Ans. (d) : System out println (m1.equals (m2)),
unsigned char a; True
S* q = &B [5] ; System . out . println (s1 equals (s2)); False
unsigned short b;
p → U.b = 0x1234; System . out . println (m1 equals (s2)); False
}U;
/*structureStakes 32 − bits * / System . out . println (s1 equals (m2)); False
unsigned char c;
24. Consider the following C++ function f() :
}S : usigned int f (unsigned int n){
If M is the value of q – p and N is the value of Unsigned int b = 0
((int) & (p → c)) – ((int)P), then (M, N) is while (n) {
(a) (1, 1) b + = n & 1;
(b) (3, 2) n > > 1;
(c) (1, 2) }
(d) (4, 4) return b;
Ans. (c) : In this, size of short int = 4 bytes }
S * p = & B [4]; // p is having the address of B [4] The function f() returns the int that represents
S * q = & B [5]; // q is having the address of B [5] the __p__ in the binary representation of
suppose B[4] address is 116 [take base address as 100]. positive integer n, where P is
(a) number of 0' s
So B [5] will come as 120
(b) number of bits
q – p will be = (address of B[5] – address of B[4])
(c) number of consecutive 1's
q – p = (120 – 116)/4 = 4/4 = 1
(d) number of 1's
Also M is equal to q – p (given in the question)
Ans. (d) : b + = n & 1;
So M = 1
binary AND operation and then add result with b
Now, we have to find the value of N =
consider n as 5;
((int) & (p → c)) – ((int) p), So binary representation of n is 101
Here, c is a char and it is type casted to int ((int) & (P initially b = 0
→ C)) – ((int) p // address difference between p's B + = n & 1; // It means b = 0 + 101
starting address and c address will be of 2 bytes only. & 001; b = 0 + convert to decimal (001);
So N becomes 2 b = 1 n >> // n is right shifted to 1 so,
∴ (M, N) = (1, 2) n becomes 010
23. What is the output of the following JAVA b + = n & 1;
program? this gives b = 1 + 010 & 001; b = 1 + 0; b = 1
public class Good { Again, n is right shifted; n becomes 001
private int m; b + = n & 1; // b = 1 + 001 & 001;
public Good (int m) {this m = m;} b=1+1=2
public Boolean equals (Good n) {return n.m = Again, n is right shifted n becomes 000 while (n) //It
m;} becomes false
public static void main (string args []) { program will return the final value of b; which is 2.
Good m1 = new Good (22); Which is equal to the number of 1's in the binary
Good m2 = new Good (22); representation of n.

UGC NET JRF Computer Science June 2019 Paper-II 310 YCT
 Search on TG: @apna_pdf
25. Which of the following statements is/are true? XML declaration syntax is :
P : In a scripting language like JavaScript, types <?Xml version = "1.0"
are typically associated with values, not encoding = "UTF – 8"?
variables. 27. Consider a raster system with resolution 640 by
Q : It is not possible to show images on a web page 480. What size is frame buffer (in bytes) for
without the <img> tag of HTML. this system to store 12 bits per pixel?
Select the correct answer from the options (a) 450 kilobytes
given below :
(b) 500 kilobytes
(a) P only
(c) 350 kilobytes
(b) Q only
(d) 400 kilobytes
(c) Both P and Q
(d) Neither P nor Q Ans. (a) : Raster scan system : In this electron beam
move on the screen from top to bottom covering each
Ans. (a) : P → In a scripting language like Java script, row one by one.
types are typically associated with values, not variables.
Explanation :
Java script is a client side as well as server-side
scripting language. Java Script data types are : number, Given resolution of the system is : 640 × 480 we have
string, Boolean, object undefined. Basically, the type of to store 12 bits per pixel.
a value determines the operations and methods Frame buffer size = resolution (number of pixels)
performed or it. Variables are not directly associated x number of bits per pixel
with any particular type; any variable can be assigned Frame buffer size = (640 × 480) × 12
values of all type. = 3686400 bits
Images can be shown on a web page without the use of convert it into bytes.
image tag of HTML. We can use div by giving the URL frame buffer size = 3686400/8 = 460800 Byte
of the image in that. = 450 KB
26. Which of the following statements is/are true? 28. Consider the following statement regarding 2D
P : An XML document with correct syntax as transforms in computer graphics :
specified by W3c is called "Well Formed".
1 0 
Q : An XML documented validated against a DTD S1 :   is a 2 × 2 matrix that reflects (mirrors)
is both "Well formed" and "Valid". 0 −1
R : <xml version = "1 . 0" encoding = "UTF – 8"> only 2D point about the X-axis.
is syntactly correct declaration for the version S2 : A 2 × 2 matrix which mirror any 2D point
of an XML document. about the X-axis, is a rotation matrix.
Select the correct answer from the options What can you say about the statements S1 and
given below : S2?
(a) P and Q only (a) Both S1 and S2 are true
(b) P and R only (b) Only S1 is true
(c) Q and R only (c) Only S2 is true
(d) All of P, Q and R (d) Both S1 and S2 are false
Ans. (a) : XML - XML stands for extensible markup Ans. (b) : First matrix is reflection matrix about x-axis
language It is a meta markup language for text S1 is true always.
documents/data. It allows to define language to
represent text. It is designed to describe data not to 1 0 
display data. XML tags are not predefined. 0 −1 is trans formation matrix for reflection about x
 
Some points in XML are as follows : - axis.
* An XML document is well formed it. Satisfies rule S2 is false because reflection about x - axis will give
specified by the W 3C. rotation of θ = 90°
* A well - formed XML have a proper starting and
closing tag.
* An XML documented validated against a DTD is both
"Well formed" and "valid"
* Purpose of DTD is to define the structure and legal
elements and attributed of a XML document.
* XML does not require DTD.
* XML carries the data; it does not represent it.
* XML can be used for off loading and reloading of So if clockwise rotation occurs
database.
UGC NET JRF Computer Science June 2019 Paper-II 311 YCT
 Search on TG: @apna_pdf

cos θ − sin θ  cos 90o − sin 90o   0 −1 This component shows the reflected light in a specific
 sin θ cos θ  =  o =  direction. It reflects on the basis of reflection of incident
   sin 90 cos 90o  1 0  light. The special light depends on the position of
and if anticlockwise rotation occurs- observer with respect to the surface.
Specular component finds the strength which is the
 cos θ sin θ   cos 90o sin 90o   0 1 
 − sin θ cos θ  =  o
=  multiplication of specular surface constant with specular
  − sin 90 cos 90   −1 0 
o
 intensity and with dot product of reflection direction
Both of these matrix are not same as matrix given in S1. and the direction of surface towards the view. It means
So S2 is false. it is determined by the angle between reflected and view
vector.
29. In the context of 3D computer graphics, which
of the following statements is/are true? So ans. is d. the
P : Orthographic transformations keep parallel reflected vector & the
lines parallel. view vector.
Q : Orthographic transformations are affine
transformations.
Select the correct answer from the options
given below: 31. Which of the following has same expressive
(a) Both P and Q power with regard to relational query
(b) Neither P nor Q language?
(c) Only P (A) Relational algebra and domain relational
calculus
(d) Only Q
(B) Relational algebra and tuples relational
Ans. (a) : orthogonal projections are parallel projection calculus
Each line that is originally parallel will be parallel after (C) Relational algebra and domain relational
this transformation- calculus restricted to safe expression
orthographic projection (sometimes referred to as (D) Relational algebra and tuples relational
orthogonal projection, used to be called analemma is a calculus restricted to safe expression
means of representing three dimensional objects in two (a) (A) and (B) only
dimensions. It is a form of parallel projection, in which (b) (C) and (D) only
all the projection lines are orthogonal which to the (c) (A) and (C) only
projection plane. (d) (B) and (D) only
In Euclidean geometry, an affine transformation or an
Ans. (b) :
affinity (from the Latin, affini's, connected with is a
* Relational algebra is a procedural query language,
geometric transformation that preserve lines and
which takes instances of relations as input and
parallelism (but not necessarily distance and angles). yields instances of relations as output. It uses
The orthographic projection can be represent by a affine operation (selection, projection, union etc) to
transformation. perform queries
30. Using the phong reflectance model, the * Relational calculus consists of two calculi, the tuple
strength of the specular highlight is determined relational calculus and the domain relational
by the angle between calculus, that are part of the relational model for
(a) the view vector and the normal vector databases and provide a declarative way to specify
(b) the light vector and the normal vector database queries.
(c) the light vector and the reflected vector * Relational algebra, Domain relational calculus
restricted to safe expression and tuple relational
(d) the reflected vector and the view vector
calculus restricted to safe expression have the same
Ans. (d) : Phong reflectance model : expressive power.
* It is local illumination model. In real world, light is Relation algebra's expressive power is not equal to
shown with the help of its spectrum. In computer Domain relational calculus or Tuple relational
graphics, light color is made of a triplet that is of three calculus unless they are restricted to safe operation.
colours RGB(red, green and blue). 32. Which of the following features is supported in
* The reflectance spectrum is a triple of percent the the relational database model?
light seen on a surface can be divided into four (a) Complex data-types
components such as : emissive component, ambient (b) Multivalued attributes
component, diffusive component, specula component. (c) Associations with multiplicities
Specular component : (d) Generalization relationships
UGC NET JRF Computer Science June 2019 Paper-II 312 YCT
 Search on TG: @apna_pdf
Ans. (c) : RDBMS (Relational database management 34. In relational databases, if relation R is in
system) is structured in database tables. It stores the BCNF, then which of the following is true
data into collection of tables which are related by some about relation R?
fields. Goal of RDBMS is to generate a set of relation (a) R is in 4NF
scheme that allows as to store information without (b) R is not in 1 NF
unnecessary redundancy and to retrieve information (c) R is in 2NF and not in 3NF
easily. (d) R is in 2NF and 3NF
Composite data types : Those data types that are Ans. (d) : relation is in 'N' Normal form it means it
must be in 1NF, 2NF, ............... N-1 NF.
composed of other existing data types such as date,
images, time etc. They are used as objects. Complex standard Normal form hierarchy :→
data types are not allowed in RDBMS. These are stored 1NF → 2NF → 3NF → BCNF
in LOB, they cannot be accessed directly in RDBMS. So Relation is in BCNF then it must be in 1NF, 2NF, &
3NF Hence option 4 is correct.
Multivalued attributed : An attribute that contains more
35. Which of the following key constraints is
than one value for with it. It is not allowed in RDBMS.
required for functioning of foreign key in the
An attribute can contain only one value at one time.
context of relational data bases?
Association with multiplicities : → Multiplicity means (a) Unique key
the cardinality of a particular entity which can be (b) Primary key
associated with other entities. In terms of data base, it (c) Candidate key
means participation and cardinality of the relation. It is (d) Check key
allowed in RDBMS. Ans. (b) :
Generalization Relationship : Generalization means * Candidate Key →
combination of lower entities to form a higher entity • It can be null,
Entities are combined which have common attribute.
• It is null in that such case
33. With respect to relational algebra, which of the • Foreign key point to primary key.
following operations are included from * Alternate Key → unique and null
mathematical set theory? * If candidate key is null in such case foreign key
(A) Join points to primary key.
(B) Intersection though foreign keys can always point to primary
(C) Cartisian product key but not to candidate key.
(D)Project
(a) (A) and (D)
(b) (B) and (C)
(c) (C) and (D)
(d) (B) and (D)
Ans. (b) : Relational Algebra :→ It is a procedure
oriented language. In this, we use relation as values
instead of numbers. It works on relational model. Main
work is to retrieve data, perform operations such as
insert, delete, update etc.
* Basic operation in relational algebra are select,
Project, union, set difference, Cartesian product, 36. In relational database management, which of
rename. the following is/are property/properties of
candidate key?
* other operations are natural join, intersection
division. P : Uniqueness
* from the above options, operator that are included Q : Irreducibility
from mathematical set theory are intersection and (a) P only
Cartesian product. (b) Q only
* In mathematical set theory, intersection is used to (c) Both P and Q
find the common elements between two sets. It (d) Neither P nor Q
works same in relational algebra. Ans. (c) : candidate key : It uniquely identifies the
* Cartesian product is used to find the multiplication tuples in a relation. A candidate key is a super key with
of two sets by including common element only no redundant attribute. In a relation, there can be more
once. than one candidate key.

UGC NET JRF Computer Science June 2019 Paper-II 313 YCT
 Search on TG: @apna_pdf
As, candidate uniquely identifies the tuples in a relation. Map Reduce A distributed data processing model and
So, first property of the candidate key is its uniqueness. execution environment that runs on large clusters of
second, candidate key does not contain redundant commodity machines.
attribute. We cannot further reduce a candidate key. If a Hbase → It is a distributed, column-oriented database.
candidate key is reduced, then it can cause partial HBase uses HDFS for its underlying storage and
dependency. second property is its irreducibility. supports both batch style computations using map
Example : reduce and point queries.
A relation with four attributes : R(A,B,C,D). HIVE → It is a distributed data ware house. Hive
functional dependencies are : manages data stored in HDFS and provides a query
A→C language based on SQL.
B→D 39. Following table has two attributes Employee id
In this, AB is the candidate key. and Manager id, where Employee is is a
AB uniquely tuples in relation R also AB cannot be primary key and manager id is a foreign key
reduced further. referencing Employee id with on delete
37. Which of the following statements are DML cascade:
statements?
(A) Update [tablename] Employee_id Manager_id
Set [columnname] = VALUE
20 40
(B) Delete [tablename]
(C) Select * from [tablename] 25 40
(a) (A) and (B) 30 35
(b) (A) and (D) 35 20
(c) (A), (B), and (C) 40 45
(d) (B) and (C)
45 25
Ans. (c) : A data manipulation language (DML) is a
On deleting the table (20, 40), the set of other
language that enables users to access or manipulate data
as organized by the appropriate model. tuples that must be deleted to maintain the
referential integrity of table is
Example of DML commands : select, insert, delete,
update etc. (a) (30, 35) only
therefore a, b and c are DML statements. (b) (30, 35) and (35, 20) only
A database system provides a data-definition language (c) (35, 20) only
(DDL) to specify the database schema example of DDL (d) (40, 45) and (25, 40) only
commands : Create, drop, alter, rename, truncate etc. Ans. (b) : Manager-id is foriegn key referring to
A data control language (DCL) is used to control employee-id (primary key) of the same table
access (Authorization) to data stored in a database Employee_id Manager_id
example of DCL commands : grant and revoke.
20 (Deleted 1) 40 (Deleted 1)
38. Hadoop (a big data tool) works with number of
related tools, Choose from the following, the 25 40
common tools included into Hadoop : 30 (Deleted 3) 35 (Deleted 3)
(a) MySQL, Google API and Map reduce 35 (Deleted 3) 20 (Deleted 2)
(b) Map reduce, Scala and Hummer 40 45
(c) Map reduce, H Base and Hive 45 25
(d) Map reduce, Hummer and Heron
(20, 40) is deleted, that is employee-id = 20 is deleted
Ans. (c) : Hadoop is an open source platform providing therefore manager-id = 20 should be deleted to
highly reliable, scalable, distributed processing of large
maintain the referential integrity of table.
data sets using simple programming models.
If Manager-id = 20 row is deleted, then employee-id =
Hadoop provides a reliable shared storage and analysis
35 is also deleted
system. In this, storage, is provide by HDFS (Hadoop
distributed file system) and analysis by map reduce. therefore manager-id = 35 should also be deleted to
HDFS breaks a file into chunks and distributed them maintain the referential integrity of table.
across the nodes of the cluster. It stores large amount of If manager-id = 35 row is deleted then employee-id =
data on local disk across a distributed cluster of 30 is also deleted since If manager-id ≠ 35 we stop
computers. It is written in Java. Hadoop work with the here.
tools : Map Reduce, H base, hive. Table after deletion

UGC NET JRF Computer Science June 2019 Paper-II 314 YCT
 Search on TG: @apna_pdf
Employee_id Manager_id Ans. (d) :
25 40 = (50 – 34) + (34 – 20) + (20 – 19) + (19 – 15) + ( 15 –
10) + (10 – 7) + ( 7 – 6) + (6 – 4) + (4 – 2) + (73 – 2)
40 45
= 16 + 14 + 1 + 4 + 5 + 3 + 1 + 2 + 2 + 71
45 25 = 119 ms
Apart from (20, 40) (30, 20) also gets deleted to 42. Match List-I with List-II
maintain the referential integrity of table.
List-I List-II
40. K-mean clustering algorithm has clustered the
(A) Disk (i) Thread
given 8 observations into 3 clusters after Ist
iteration as follows: (B) CPU (ii) Signal
C1 : {(3, 3), (5, 5), (7, 7)} (C) Memory (iii) File system
C2 : {(0, 6), (6, 0), (3, 0)} (D) Interrupt (iv) Virtual address
C3 : {(8, 8), (4, 4)} space
What will be the Manhattan distance for Choose the correct option from those given
observation (4, 4) from cluster centroid C1 in below :
second iteration? (a) (A)-(i), (B)-(ii), (C)-(iii), (D)-(iv)
(a) 2 (b) (A)-(iii), (B)-(i), (C)-(iv), (D)-(ii)
(c) (A)-(ii), (B)-(i), (C)-(iv), (D)-(iii)
(b) 2 (d) (A)-(ii), (B)-(iv), (C)-(iii), (D)-(i)
(c) 0 Ans. (b) :
(d) 18 List-I List-II
Ans. (a) : Manhattan distance is the distance between (A) Disk (iii) File system
two points measured at right angle along both the X-
(B) CPU (i) Thread
axis and Y-axis.
formula- It is calculated as : if there is a point P(X1, Y1) (C) Memory (iv) Virtual address
space
and Q(X2, Y2). Then Manhattan distance is
(D) Interrupt (ii) Signal
X 2 − X1 + Y2 − Y1
43. Consider that a process has been allocated 3
calculation : frames and has a sequence of page referencing
C1 : {(3, 3), (5, 5), (7, 7)} as 1, 2, 1, 3, 7, 4, 5, 6, 3, 1.
C2 : {(0, 6), (6, 0), (3, 0)} What shall be the difference in page faults for
C3 : {(8, 8), (4, 4)} the above string using the algorithms of LRU
first point is (4, 4) and optimal page replacement for referencing
the string?
we have to find the Manhattan distance for cluster C1 in
(a) 2
2nd iteration :
(b) 0
for 2nd iteration : points will be
(c) 1
 (\left({\frac{1}{3}\left({3 + 5 + 7}\ right)}\right), (d) 3
\left ({\frac{1}{3}\left({3 + 5 + 7}\right )}\right) =
Ans. (a) : LRU ALGORITHM :- Replace the least
\left({5,\;5}\right)\)
recently used page if frames are not empty.
So Manhattan distance = 5 − 4 + 5 − 4 = 1 + 1 = 2
41. Consider a disk system with 100 cylinders. The
requests to access the cylinders occur in the
following sequence :
4, 34, 10, 7, 19, 73, 2, 15, 6, 20
Assuming that the head is currently at cylinder
50, what is the time taken to satisfy all requests
if it takes 1ms to move from the cylinder to
adjacent one and the shortest seek time first
policy is used? XL denotes the frames to be replaced
(a) 357 ms ∴ Total page faults = 9
(b) 238 ms Optimal page Replacement Algorithm :- Replace the
(c) 276 ms page which will not be used for longest duration of time
(d) 119 ms if the frames are not empty.
UGC NET JRF Computer Science June 2019 Paper-II 315 YCT
 Search on TG: @apna_pdf

So, here only 2 switching possible (when we did not

consider the starting and ending switching)
Now here might be confusion that at t = 2. P1 is
preempted and check that available process have
shortest job time or not, but he did not get anyone So it
should not be consider as context switching.
46. At a particular time of computation, the value
XR denotes the frames to be replaced of a counting semaphore is 7. Then 20 P (wait)
operations and 15V (signal) operations are
∴ Total page faults = 7
completed on this semaphore. What is the
∴ Difference in LRU and optimal page replacement resulting value of the semaphore?
page faults = (9 – 7) = 2
(a) 28
44. Which of the following are Not shared by the (b) 12
threads of the same process? (c) 2
(A) Stack (d) 42
(B) Registers
Ans. (c) : I → P represent wait and v represent signal. P
(C) Address space
operation will decrease the value by 1 every time and Y
(D) Message queue operation will increase the value by 1 every time.
(a) (A) and (D) Value of counting semaphore = 7
(b) (B) and (C) After 20 P operations value of semaphore = 7 – 20
(c) (A) and (B) = –13
(d) (A), (B) and (C)
After 15 v operations value of semaphore
Ans. (c) : "In general each thread has its own registers = –13 + 15 = 2
(including its own program counter), its own stack
47. The minimum number of page frames that
pointer, and its own stack. Everything else is shared
must be allocated to a running process in a
between the threads sharing a process,
virtual memory environment is determined by
why register cannot be shared?
(a) page size
Each thread needs its own program counter value
(b) physical size of memory
(which is a register)
(c) the instruction set architecture
why stack cannot be shared?
(d) number of processes in memory
Each thread may have its own calling sequence.
So stack and registers is correct. Ans. (c) : There are two important task in virtual
memory management : a page replacement strategy and
45. Consider three CPU intensive processes, which a frame-allocation strategy. Frame allocation strategy
require 10, 20 and 30 units of time and arrive say gives the idea of minimum number of frames that a
at times 0, 2 and 6 respectively. How many process must be allocated is dependent on system
context switches are needed if the operating architecture, and corresponds to the number of pages
system implements a shortest remaining time that could be touched by a single (machine) instruction.
first scheduling algorithim? Do not count the So the instruction set architecture is right answer.
context switches at time zero and the end.
48. A computer has six tape drives with n processes
(a) 4
competing for them. Each process may need
(b) 2 two drives. What is the maximum value of n for
(c) 3 the system to be deadlock free?
(d) 1 (a) 5
Ans. (b) : Let three process be P0, P1 and P2 with (b) 4
arrival times 0, 2 and 6 respectively and CPU burst (c) 3
times 10, 20 and 30 respectively. At time 0, P0 is the (d) 6
only available process so it runs. At time 2, P1 arrives, Ans. (a) : Given tape drive = 6 and each process may
but P0 has the shortest remaining time, So it continues need 2 drive.
At time 6, P2 arrives, but P0 has the shortest remaining When we give 1 drive to 1 process then total process
time process. At time 30, P2 is scheduled. Only two will be 6 but in this case there will definitely deadlock
context switches are needed. P0 to P1 and P1 to P2. occur because every process contain 1 drive and waiting
Processes executes as per the following Gantt chart for another drive which is hold by other process
UGC NET JRF Computer Science June 2019 Paper-II 316 YCT
 Search on TG: @apna_pdf
therefore when we reduce 1 process then system to be (c) P and Q
deadlock free. (d) Neither P nor Q
Hence maximum value of n = 6 – 1 = 5 Ans. (b) : statements P : In software engineering,
49. A processor can support a maximum memory defects that are discovered, defects that are discovered
of 4 GB where memory is word addressable earlier are more expensive to fix.
and a word is 2 bytes. What will be the size of This statement is not correct. In software engineering,
the address bus of the processor? defects which are early detected are easier to fix. It
(a) At least 28 bits reduces error fixing cost. It increases the productivity.
(b) At least 2 bytes Early defect detection improves the overall quality of
(c) At least 31 bits software.
(d) Minimum 4 bytes Statement Q : A software design is said to be a good
design, if the components are strongly cohesive and
Ans. (c) : Maximum Memory = 4GB = 232 bytes weakly coupled.
size of a word = 2 bytes Coupling : Coupling in software engineering mean
Therefore, Number of words = 232/2 = 231 interdependence between the modules. Cohesion means
So, we require 31 bits for the address bus of the how the elements of one module are related with each
processor. other. It means intra-dependency between the module.
50. Which of the following UNIX/Linux pipes will For a good software design, low coupling and high
count the number of lines in all the file having c cohesion is desired.
and h as their extension in the current working 52. The M components in MVC are responsible for
directory? (a) user interface
(a) cat*ch|wc–1 (b) security of the system
(b) cat*[c–h]|wc–1 (c) business logic and domain objects
(c) cat*[ch]|1s–1 (d) translating between user interface
(d) cat*[ch]|wc–1 actions/events and operations on the domain
objects
Ans. (d) : Pipes in Linux/Unix : Pipe is a command
which produces an output which serves as input for next Ans. (c) : MODEL-VIEW-CONTROLLER (MVC):
command. It works as a pipeline structure in computer. * MVC refers to three different realms of
Explanation : responsibility in the design of a graphical user
interface.
We have to find the number of lines in all the files
having .c and .h as their extension in the current * when the MVC pattern is applied to a component
the model consists of the data that represents the
working directory.
current state of the component.
WC- in Unix/Linux, "WC" is used for word count.
* The view is simply the visual presentation of the
Cat- it is used to display the content of the files. component on the screen.
Option 4- Cat * .[ch] //it represent the content of files * The controller is the aspect of the component that
having .c and .h extension carries out actions in response to events generated
Option 2 → by the user (or by other source such as timers).
Cat * [c -h]/ WC-L //it also includes the files with c and The idea is to assign responsibility for the model,
.h extension but it also considers the other extensions the view, and the controller to different objects.
that come between because it is a range which is not 53. In the context of software testing, which of the
required in this question. following statements is/are Not correct?
So cat * [ch]/WC-L P : A minimal test set that achieves 100% path
It will count the number of Lines in all the files having coverage will also achieve 100% statement
.c and .h as their extension in current working directory. coverage.
51. Which of the following statements is/are true? Q : A minimal test set that achieves 100% path
P : In software engineering, defects that are coverage will generally detect more faults than
discovered earlier are more expensive to fix. one that achieves 100% statement coverage.
Q : A software design is said to be a good design, if R : A minimal test that achieves 100% statement
the components are strongly cohesive and coverage will generally detect more faults than
weakly coupled. one that achieves 100% branch coverage.
Select the correct answer from the options (a) R only
given below : (b) Q only
(a) P only (c) P and Q only
(b) Q only (d) Q and R only

UGC NET JRF Computer Science June 2019 Paper-II 317 YCT
 Search on TG: @apna_pdf
Ans. (a) : A minimal test set that achieves 100% path developers on other systems. These systems have a
coverage will also achieve 100% statement coverage. single server that contains all versioned files and
This statement is correct statement coverage means number of clients that check out file from central
executing each statement at least once. Where as Path place. Main disadvantage is that a single point of
coverage is in which every distinct entry- exit path failure can cause the entire system.
through the code is executed at least once in some test. * Distributed version control system : In this, client
It is a white box technique. It tells about how well the do not just check out the latest snapshot of the files,
source code has been made. A minimal test set that they fully mirror the repository. Thus, if any server
achieves 100% path coverage will also achieve 100% dies and these systems were collaborating via it, any
statement coverage. of the client repositories can be copied back up to
Statement Q : A minimal test set that achieves 100% the server to restore it. Every clone is fully backup
path coverage will generally detect more faults than one of all the data.
that achieves 100% statement coverage Sometimes,
during minimal test it can be the possibility that test
suite produce 100% statement coverage will miss
certain defects related to control structure. So this
statement is correct.
Statements R : A minimal test set that achieves 100%
statement coverage, will generally detect more faults
than one that achieves 100% branch coverage.
Branch coverage means, for each branch is chosen at
least once in some test. It includes statement coverage.
As, in case of statement coverage, test suite sometimes
cannot detect all faults. So this statement is not correct
that minimal test set that achieves 100% statement
coverage will generally detect more faults than one that
achieve 100% branch coverage.
54. Software reuse is
(a) the process of analysing software with the
objective of recovering its design and
specification
(b) the process of using existing software
artifacts and knowledge to build new software 56. A Web application and its support
(c) concerned with reimplementing legacy environment has not been fully fortified against
system to make them more maintainable attack. Web engineers estimate that the
(d) the process of analysing software to create a likelihood of repelling an attack is only 30
representation of higher level of a abstraction percent. The application does not contain
and breaking software down into its parts to sensitive or controversial information, so the
see how it works threat probability is 25 percent. What is the
integrity of the web application?
Ans. (b) : "Software reuse is the process of creating
new software system from predefined software (a) 0.625
components." (b) 0.725
55. Which of the following terms best describes (c) 0.775
Git? (d) 0.825
(a) Issue Tracking System Ans. (d) : Integrity of web application :
(b) Integrated development Environment Integrity of web application can be found out using the
(c) Distributed Version Control System security and threat in that.
(d) Web-based Repository Hosting Service Formula :
Ans. (c) : Git is an open source distributed version Integrity = [1 – threat (1 – security)]
control system. Version control is a system that records Calculation -
changes to a file or set of files over time. So that you It is given that, probability or Likelihood of repelling an
can recall specific versions later. attack = 30%
* Local version control system : In this, files are i.e probability of security = 0.30
copied into another directory. This approach is very Threat probability is given as 25% or 0.25
common. In this it is easy to forget which directory So integrity = [1 – 0.25 (1 – 0.30)]
you are in and accidentally write to the wrong file.
integrity = [1 – 0.25 (0.70)]
* Centralized version control system : The next issue
people encounter that they need to collaborate with Integrity = 1 – 0.175 = 0.825

UGC NET JRF Computer Science June 2019 Paper-II 318 YCT
 Search on TG: @apna_pdf
57. Match List-I with List-II (c) To support the new features that users want it
List-I (Software List-II to support
Process Models) (Software (d) To overcome wear and tear caused by the
Systems) repeated use of the software
(A) Waterfall model (i) e-business Ans. (b) : Maintenance :- Maintenance can be referred
software that as a process of enhancement in the software product
starts with only according to the changing requirements of users.
the basic Four types of maintenance :
functionalities 1– Adaptive : Modifying the system to cope with
and then moves changes in the software environment (DBMS, OS),
to more 2– Perfective : implementing new or changed user
advanced requirements which concern functional enhancements to
features the software.
(B) Incremental (ii) An inventory 3– Corrective : diagnosing and fixing errors, possibly
development control system ones found by users.
for a super- 4– Preventive : Increasing software maintainability or
market to be reliability to prevent problems in the future.
developed 59. Which of the following are the primary
within three objectives of risk monitoring in software
months project tracking?
(C) Prototyping (iii) A virtual P : To assess whether predicted risks do, in fact,
reality system occur
for simulating Q : To ensure that risk aversion steps defined for
vehicle the risk are being properly applied
navigation in a R : To collect information that can be used for
highway future risk analysis
(a) Only P and Q
(D) RAD (iv) Automate the
manual system (b) Only P and R
for student (c) Only Q and R
record (d) All of P,Q,R
maintenance in Ans. (d) : Risk monitoring and control in software
a school engineering ensures the execution of risk plans and help
Choose the correct option from those given in reducing the risk in software projects.
below : It keeps track of identifies risks. It monitors the already
(a) (A)-(ii), (B)-(iv), (C)-(i), (D)-(iii) occurring risks and can identify new risks in project
(b) (A)-(i), (B)-(iii), (C)-(iv), (D)-(ii) execution.
Primary objectives of risk monitoring are :
(c) (A)-(iii), (B)-(ii), (C)-(iv), (D)-(i)
1) To assess whether predicted risk do occur.
(d) (A)-(iv), (B)-(i), (C)-(iii), (D)-(ii)
2) To ensure that risk aversion steps defined for the
Ans. (d) : (A) Waterfall model- (iv) Automate the risk are being properly applied.
manual system for student record maintenance in a
3) To collect information that can be used for future
school risk analysis.
(B) Incremental development - (i) e-business software 4) To verify that risk actions are as effective as
that starts with only the basic functionalities and then expected.
moves to more advanced features
5) Proper procedures are followed or not.
(C) Prototyping - (iii) A virtual reality system for
6) To identify the new risk that were not occured
simulating vehicle navigation in a highway previously.
(D) RAD - (ii) An inventory control system for a 7) To identify whether the risk has changed or
super-market to be developed within three months declined.
58. Software products need adaptive maintenance Risk monitoring helps in identifying the events that
for which of the following reasons? has a serious effect in controlling the risks It can
(a) To rectify bugs observed while the system is produce alternate path for execution of events. It
in use provides a good quality software after monitoring
(b) When the customers need the product to run and controlling all the risks that can occur during
on new platforms the execution of software project.

UGC NET JRF Computer Science June 2019 Paper-II 319 YCT
 Search on TG: @apna_pdf
60. Software validation mainly checks for there are E edges and V vertices in a graph, then it takes
inconsistencies between O (v2 log v) time to find the shortest path.
(a) use cases and user requirements Edmonds-Karp algorithm :- It is used to find the
(b) implementation and system design blueprints maximum flow in a network. It uses BFS in ford
(c) detailed specifications and user requirements fulkerson method. It time complexity is O(V.E2)
(d) functional specifications and use cases 62. There are many sorting algorithms based on
Ans. (c) : Software validation means "are we building comparison. The running time of heapsot
the right product". algorithm is O(Nlgn). Like P, but unlike Q,
Validation means that product meets the customers heapsort sorts in place where (P, Q) is equal to
expectations. It goes beyond checking it meats its (a) Merge sort, Quick sort
specification as system specifications don't always (b) Quick, sort, insertion sort
accurately reflect the real need of users. (c) Insertion sort, Quick sort
Validation refers to the process of evaluating software (d) Insertion sort, Merge sort
at the end of its development to ensure that it is free Ans. (d) : The question asks specifically for inplace
from failure and implies with its requirement A failure sorting algorithms, which means the algorithms in
is defined as incorrect product behaviors often the
which only O(1) space is used.
validation occurs through the utilization of various
testing approaches. Insertion sort :
There are two ways to perform software validation In insertion sort, the worst case takes O(n2) time, worst
internal and external. case of insertion sort is when elements are sorted in
reverse order. It is in place sorting algorithms.
1– Internal validation assumes that goals of stakehoding
were correctly understood. In that case the number of comparison and be like.
2– External validation is performed by asking the stake Merge Sort –
holders if the software meets their needs. In merge sort, the worst case takes O(n logn) time.
Merge sort is based on the divide and conquer
61. Match List-I with List-II
approach. It is out of place sorting algorithms.
List-I List-II Recurrence relation for merge sort will become
A. Prim's algorithm (i) O(V3logV) T(n) = 2T (n/2) + O(n)
B. Dijkstra's algorithm (ii) O(VE2) T(n) = n + O(n)
C. Faster all-paris (iii) O(ElgV) T(n) = n × Log n
shortest path Quicksort : In Quicksort, the worst case takes O(n2)
D. Edmonds-Karp (iv) O(V2) time the worst case of quicksort is when the first or the
algorithm last element is chosen as the pivot element.
Choose the correct option from those given
below :
(a) (A)-(ii), (B)-(iv), (C)-(i), (D)-(iii)
(b) (A)-(iii), (B)-(iv), (C)-(i), (D)-(ii)
(c) (A)-(ii), (B)-(i), (C)-(iv), (D)-(iii)
(d) (A)-(iii), (B)-(i), (C)-(iv), (D)-(ii)
Ans. (b) : Prim's Algorithm :-It is used to find the
minimum spanning tree for a weighted undirected
graph. It uses greedy approach to find the MST for a
graph. Unlike the Kruskal's algorithm, we add vertex to
growing spanning tree in this. It there are v vertices and Recurrence relation for quick sort T(n) = T(n-1) + (n)
E edges in the graph. Then time complexity to for MST This will give the worst case time Complexity as O(n2).
is O(E log V)
It is in place sorting algorithms.
Dijkstra's Algorithm :-
Conclusion : P needs to be an in-place sorting
It is used to find the shortest path from source vertex to algorithm, and Q needs to be out of place sort in
all other vertices in a graph. Initially, distance from algorithm, Hence option d is correct
source to source is considered as O and to all other
vertices is infinity. It uses the condition "current vertex 63. Consider the Euler's phi function given by
distance edge weight < next vertex distance" to find  1
φ(n) = n pΠ/ n 1 − 
shortest distance. Time complexity for this is O(v2)  p
Faster all pair shortest path : It finds shortest the where p runs over all the primes dividing n.
distance from a vertex to all other vertices in a graph. It What is the value of φ(45)?
UGC NET JRF Computer Science June 2019 Paper-II 320 YCT
 Search on TG: @apna_pdf
(a) 3 4) It helps in detecting cycles in a graph.
(b) 12 5) To find articulation points in a graph.
(c) 6
(d) 24
Ans. (d) : If P is prime, then φ(p) = ( p – 1)
If P is a prime and it's power is k then
\(\phi\Left({{\text{p}}^{\test{k}}}\right) =
{{\text{p}}^{\text{k}}}\Left(1 – \ frac {1}{1
text}{p}}\right)\) DFS traversal for this – 1, 2, 4, 5, 3, 6, 7
Calculation → 66. Consider double hashing of the form
φ(45) = φ(9 × 5) h(K, i) = (h1(k) + ih2(k) modm)
= φ(32) × φ(5) where h1 (k) = k modm
\( = {{3}^{2}}\left(1 – \frac {1}{3}\right)\times\left(5 – h2(k) = 1 + (K modn)
1\right\) where n = m – 1 and m = 701
= 6 × 4 = 24 For k = 123456, what is the difference between
the value of φ (45) is 24 first and second probes in terms of slots?
64. Which of the following is best running time to (a) 255
sort n integers in the range 0 to n2 – 1? (b) 256
(a) O(lgn) (c) 257
(b) O(n) (d) 258
(c) O(nlgn) Ans. (c) : Data :
(d) O(N2) h(k, i) = (h1 (k) + ih2(k)) mod m
Ans. (b) : Sort the integers in the range from O to n2 – 1 where h1(k) = k mod m, h2 (k) = 1 + (k mod n)
If we take any comparision - based sorting algorithms n = m – 1, m = 701 and k = 123456
for this, it will take O (nLogn) time.
Calculation :
Radix sort is used for sorting this range integers. Radix
h1 (k) = 123456 mod 701 = 80
sort takes O(n) time for this.
h2(k) = 1 + (123456 mod 700) = 1 + 256 = 257
Algorithm :
For any digit in the integer, varies from least significant 1st probe : when i = 1
digit to the most significant digit of the number. Sort the h (k, i) = h1 (k) + ih2(k)
input array using count sort algorithm according to the h(k, 1) = h1(k) + h2(k) = 80 + 257 = 337
digit. 2nd probe : when i = 2
Note : Radix sort depends on digits. It is more flexible h(k, 2) = h1(k) + 2*h2(k) = 80 + 2*257
than comparison based sorting algorithm It solve the h(k, 2) = 80 + 514 = 594
given problem in Linear time. So, difference between first two probes = 594 – 337 =
65. Which of the following is application of depth- 257
first search? 67. Consider the complexity class CO – NP as the
(a) Only topological sort
set of languages L such that L ∈ NP , and the
(b) Only strongly connected components
(c) Both topological sort and strongly connected following two statements :
components S1 : P ⊆ CO – NP
(d) Neither topological sort nor strongly S2 : If NP ≠ CO – NP, then P ≠ NP
connected components Which of the following is/are correct?
Ans. (c) : Depth first search: Depth first search (a) Only S1
algorithm is used to traverse the vertices of a graph. It (b) Only S2
uses the concept of back tracking. (c) Both S1 and S2
Depth first search uses a data structure for its (d) Neither S1 nor S2
implementation. Which is known as stack.
Ans. (c) : NP Complete problems :
Application of depth first search :
They are those for which no polynomial time algorithm
1) It is used to find the strongly connected
exists.
components.
2) It helps in topological sorting We can say a problem is NP complete if it is NP and
belongs to NP hard.
3) To check the bipartiteness of a graph.

UGC NET JRF Computer Science June 2019 Paper-II 321 YCT
 Search on TG: @apna_pdf
70. Consider the following statements :
S1 : For any integer n > 1, aφ(n) = 1 (mod n) for
all a ∈ Zn, where φ(n) is Euler's phi function.
S2 : If p is prime, then ap 1 (mod p) for all a ∈
Zp
Which one of the following is/are correct?
(a) Only S1
(b) Only S2
NP problems :
(c) Both S1 and S2
A problem is a member of NP class if there exists a
non-deterministic machine which can solve it in (d) Neither S1 nor S2
polynomial time. Ans. (a) : If m is a positive integer and a is an integer
NP Hard : such that (a, m) = 1 then
φ(m)
A problem is called as NP hard if all the NP class a ≡ 1(modm) where φ(m) Euler's
problems are polynomial time reducible to that and as totient function
hard as any problem of NP class. ϕ (n) = ϕ(P1k1) ϕ (P2k2) .... ϕ (Prkr)
68. Consider the following steps :  1  1  1 
= P1k1  1 −  P2k 2  1 −  ....Pr kr 1 − 
S1 : Characterize the structure of an optimal  P1   P   Pr 
solution k  1  1   1 
S2 : Compute the value of an optimal solution = P1 P2 ......Pr 1 − P1  1 − P2  .....  1 − Pr 
k1 k 2

in bottom-up fashion
Which of the step(s) is/are common to both = n 1 −  1 −
1 1   1 
 ......  1 − 
dynamic programming and greedy algorithms?  P1  P2   Pr 
(a) Only S1 Note for example
(b) Only S2 2φ(9) = 26 = 64 ≡ 1(mod 9)
(c) Both S1 and S2 So statement 1 is Euler's Theorem so S1 is correct.
(d) Neither S1 nor S2 Fermat's little theorem :→
Ans. (a) : Both Dynamic Programming and greedy states that if P pis a prime number, then for any intezer, a
algorithms find optimal substructure in the problem but the number a –a is an integer multiple of P. In the
only dynamic programming uses the bottom up notation of modular arithmetic, this is expressed as a ≡
P

approach. a (mod P).

ap-1 ≡ 1 (mod P)
69. Consider the following properties with respect
for example, if a = 2 and p = 7, then 27 = 128 and 128 –
to a flow network G = (V, E) in which a flow is
2 = 126 = 7 × 18 is an integer multiple of 7.
a real-falued function f : V × V → R :
So statement 2 is not fermat's little theorem S2 is false.
P1 : For all u, v ∈ V, f(u, v) = –f(v, r) Or
P2 : ∑ f (u, v) = 0 for all u ∈ V Statement 1 : Correct Euler's theorem (Fermat - Euler
v=V
theorem or Euler's totient theorem) states that if 'n' and
Which one of the following is/are correct? 'a' are Coprime positive integers, than aφ(n) = 1(mod n)
(a) Only P1 Statement II - Incorrect
(b) Only P2 According to Fermat's Little theorem, Let 'P' be a prime
(c) Both P1 and P2 and 'a' any integer, then ap = a (mod p).
(d) Neither P1 nor P2 71. Which data structure is used by the compiler
Ans. (a) : Flow for a real valued function f : v × v → R for managing variables and their attributes?
should satisfy following two properties : (a) Binary tree
1) skew symmetry property : i.e f (u, v) = -f(v u) (b) Link list
2) capacity constraint means how should be less than (c) Symbol table
the capacity of the It can not exceed the capacity i.e. (d) Parse table
f (u, v) < = c(u, v) Ans. (c) : Symbol table
3) Flow conservation : It means no vertex except the It can be implemented by using an array, hash table, tree
source and destination creates or store the flow. and even some time with the help of the linked list.
Net flow should be O. 72. On translating the expression given below into
i.e for all u ∈ v – {s, t}, ∑ v ∈ v f(u, v) = 0 quadruple representation, how many
operations are required?
UGC NET JRF Computer Science June 2019 Paper-II 322 YCT
 Search on TG: @apna_pdf
(i * j) + (e + f) * (a * b + c ) Example :
(a) 5 E→E–E
(b) 6 E→E×E
(c) 3 E → id
(d) 7 we have to parse the string id-id × id :
Ans. (b) : 6 operation required Stack Input Buffer Parsing action
1) * i J t1 $ id - id × id $ shift
2) + e f t2 $id -id × id $ Reduce E → id
3) * a b t3 $E -id × id $ shift
4) + t3 c t4 $ E- × id $ Reduce E → id
$E–E × id shift
5) + t1 t2 t5
$E–E× id $ shift
6) * t5 t4 t6 $ E – E × id $ Reduce E → id
73. Replacing the expression 4 * 2.14 by 8.56 is $E–E×E $ Reduce E → E × E
known as $E–E $ Reduce E → E – E
(a) constant folding $E $ Accept
(b) induction variable
75. How many states are there in a minimum state
(c) strength reduction
automata equivalent to regular expression
(d) code reduction given below?
Ans. (a) : Constant folding is compiler optimizations Regular expression is a * b(a + b)
technique used by many modern compilers. (a) 1 (b) 2
Constant folding is the process of recognizing and (c) 3 (d) 4
evaluation constant expressions at compile time rather Ans. (c) : Regular expression :
than computing them at runtime a * b (a + b)
Example : Language that is accepted by this expression is of type :
int var = 4 * 2.14; {ba, bb, bab, aba, abb, abab, aabab,.......}
Replace with Smallest string length is 2, that is, we need at least 3
int var = 8.56 states for this.
Since multiplication is costly operation, it has been NFA for this regular expression is :
replaced constant which is more optimized version of a
previous code. b a,b
q0 q1 q2
74. Shift-reduce parser consists of
(a) input buffer
(b) stack So number of states required in this NFA are 3.
(c) parse table 76. Match List-I with List-II
Choose the correct option from those give where L1 : Regular language
below : L2 : Context-free language
(a) (a) and (b) only L3 : Recursive language
(b) (a) and (c) only L4 : Recursively enumerable language
(c) (c) only List-Iq List-II
(d) (a), (b) and (c) (A) L3 ∪ L 4 (i) Context-free
Ans. (d) : Sift reduce parser is based on the idea of language
predictive parsing with Look ahead. It is a bottom up (B) L 2 ∪ L3 (ii) Recursively
parser. enumerable
Shift reduce parser generates a parse tree for an input language
string from bottom to top. At the end, reaches to the (C) *
L ∪L (iii) Recursive language
1 2
start symbol of the grammar. For a shift reduce parse,
two data structure are required : one is stack and Choose the correct option from those given
below :
another in input buffer. Stack is used to keep the
(a) (A)-(ii), (B)-(i), (C)-(iii)
grammar symbols and input buffer hold the string to
be parsed. Initially both the stack and input buffer (b) (A)-(ii), (B)-(iii), (C)-(i)
contain the $ symbol. (c) (A)-(iii), (B)-(i), (C)-(ii)
(d) (A)-(i), (B)-(ii), (C)-(iii)
UGC NET JRF Computer Science June 2019 Paper-II 323 YCT
 Search on TG: @apna_pdf
Ans. (b) : S → XY/X
List-I List-II X → YZ/Y
(a) L13 ∪ L 4 (2) Recursively enumerable Y → ZZ/Z
language This grammar is already reduced. Graph for this is
(b) L12 ∪ L3 (3) Recursive Language

(c) L*1 ∩ L 2 (1) Context-free language

Expression a : L13 ∪ L 4
L3 is recursive language and L4 is recursive
enumerable language. Complement of recursive This graph does not contain any cycle, so Language is
finite for this.
language is recursive. So, L13 is also recursive. Also
The decision algorithm be constructed for deciding
union of recursive and Recursively enumerable whether context free language L is finite by
language. L13 ∪ L 4 is recursively enumerable. constructing non redundant CFG G in CNF generating
Expression b : L12 ∪ L3 language L – {^} (^ stands for null)
L2 is context free language. Context free Languages 78. Consider the following grammar :
are not closed under complement. It is context S → XY
sensitive. Context sensitive is also considered as X → YaY a and Y →bbX
recursive languages is also recursive. Which of the following statements is/are true
Expression C : L*1 ∩ L 2 about the above grammar?
L1 is regular language. Regular languages are closed (A) Strings produced by the grammar can have
under kleen closure. So L1 is also regular. Intersection consecutive three a's.
of a regular and context free language is a context free (B) Every string produced by the grammar have
alternate a and b.
language. So, L*1 ∩ L 2 is a context free language.
(C) Every string produced by the grammar have at
77. How can the decision algorithm be constructed least two a's.
for deciding whether context-free language L is (D) Every string produced by the grammar have
finite? b's in multiple of 2.
(A) By constructing redundant CFG G in CNF (a) (A) only
generating language L (b) (B) and (C) only
(B) By constructing non-redundant CFG G in CNF (c) (D) only
generating language L (d) (C) and (D) only
(C) By constructing non-redundant CFG G in CNF
Ans. (d) : S → XY
generating language L – {^}(^ stands for null)
Which of the following is correct? X → YaYa and y → bbX
(a) (A) only strings that are produced by this grammar are :
(b) (B) only S → XY → abbX → abba
(c) (C) only S → XY → YaYY
(d) None of (A), (B) and (C) → bbXabbXbbX → bbaabbabba
Ans. (c) : We can check that whether a context free S → XY → YaYY
language L is finite or not by contracting non redundant → bbXabbXbbX → bb YaYabbXbbX
context free grammar in which there are no null → bbbbXabbXabbXbbX → bbbbaabbaabbabba
productions no unit productions and no useless So, strings that are accepted by this language are in the
productions. Steps that are used in deciding whether a form of :
context free language is finite or not? {abba, bbaabbabba, bbbbaabbaabbabba, ..........}
1) Construct the context free grammar corresponding smallest string contains two a and all other contains
to that language. more than two a's It means every string must contains at
2) Reduce the grammar by removing null, unit and least two a's. Also number of b's in the string is multiple
useless productions. of 2.
3) Contract the directed graph of that grammar 79. Which of the following problems is/are
4) If that graph contains a cycle, then that language is decidable problem(s) (recursively enumerable)
infinite. on turning machine M?
If graph does not contain cycle, it means language is (A) G is a CFG with L(G) = φ
finite.

UGC NET JRF Computer Science June 2019 Paper-II 324 YCT
 Search on TG: @apna_pdf
(B) There exist two TMs M1 and M2 such n
that L(M) ⊆ {L(M1)∪L(M2)} = language of (c)
2
all TMs
n(n − 1)
(C) M is a TM that accepts ω using at most (d)
2
2ωcells of tape
(a) (A) and (B) only Ans. (d) : It there are n
nodes then we can connect
(b) (A) only
node 1 to n-1 nodes using n-
(c) (A), (B) and (C)
1 direct links
(d) (C) only
Ans. (c) : a, b, c is correct option-
a) L(G) = φ is a emptiness problem and emptiness We can connect node 2 to n-1 nodes using n-2 direct
problem for context free languages is decidable. links (not n-1 since we have already connected it with
b) Recursive : The reason is we can assume L(m2) = node 1)
∑* and hence any TM(m1) will be definitely subset We can connect node 3 to n-1 nodes using n-3 direct
of L(m2). So we only need to see that M1 is a valid links (not n-1 since we have already connected it with
turing machine and no need to check whether it is node 1 and node 2)....
subset of L(m2) as it is abviously subset of L(m2) = We can connect node n to n-1 nodes using o direct
∑* checking validity of turing machine is always a links (since it is already connected to every other
halting process, hence it is recursive. node)
80. For a statement So total number of links required = (n-1) + (n-2) + (n-
A language L ⊆ ∑+ is recursive if there exists n ( n − 1)
some turing machine M. 3) + ..... + 1 + 0 =
2
Which of the following conditions is satisfied
82. What is the name of the protocol that allows a
for any string ω?
client to send a broadcast message with its
(a) If ω ∈ L, then M accepts ω and M will not MAC address and receive an IP address in
halt reply?
(b) If ω ∉ L, then M accepts ω and M will not (a) ARP
halt (b) DNS
(c) It ω ∉ L, the M halts without reaching to (c) RARP
acceptable state
(d) ICMP
(d) If ω ∈ L, then M halts without reaching to an
Ans. (c) : What is the name of the protocol that allows a
acceptable state
client to send a broadcast message with its MAC
Ans. (c) : A language is recursive if there exists a address and receive an IP address in reply?
Turing machine. For strings that are in the language,
Reverse Address Resolution Protocol - It is used to get
Turing machine accepts the language and always halts
IP address with the help of physical address (MAC
and for strings not in the language, string will halt in the
Address)
non final state.
Explanation :-
A language L ⊆ ∑* is recursive if there exists some
Turing machine M suppose w is the string.
So if w belongs to language, then Turing machine M
will halt by reaching at final state and if does not belong
to L, then M halts without reaching to final state
(acceptable state). ARP (Address resolution protocol) is a protocol used by
81. A fully connected network topology is a the Internet protocol (IP), specifically IPV4, to map IP
topology in which there is a direct link between network addresses to the hardware addresses used by a
all pairs of nodes. Given a fully connected data link protocol, that is MAC address.
network with n nodes, the number of direct DNS (Domain Name System) DNS is a host name to IP
links as a function of n can be expressed as address translation service. DNS is a distributed
n(n + 1) database implemented in a hierarchy of name servers. It
(a)
2 is an application layer protocol for message exchange
(n + 1) between clients and servers.
(b) RARP :- The Reverse Address Resolution Protocol
2
(RARP) is a computer networking protocol used by a

UGC NET JRF Computer Science June 2019 Paper-II 325 YCT
 Search on TG: @apna_pdf
client computer to request its Internet protocol (IP) {{200000 {\rm{\;km}}/{\rm{S}}}}\)
address from a computer network, when all it he \({{\rm{T}} – {\rm{P}}} = \ frac {{ 1000\times –
available is its link layer or hardware address, such as a {{10} ^ {–3}}}}
MAC address. RARP protocol broadcast message with {{250{\rm{\;}}}}S\)
its MAC address and receive an IP address in reply. Tp = 4 milliseconds.
The Internet Control Message Protocol (ICMP)- The Method 2 - propagation delay = distance / speed of the
internet control Message protocol (ICMP) is a medium ≠ d/s
supporting protocol in the Internet protocol suite. It is propagation delay = 800 km/200000 km/sec
used by network devices, including routers, to send
= (800/200000) sec
error messages and operational information indicating
= 4 milliseconds.
success or failure when communicating with another
Host IP address. 84. You need 500 subnets, each with about 100
usable host addresses per subnet. What
83. You are designing a link layer protocol for a
network mask will you assign using a class B
link with bandwidth of 1 Gbps (109 bits/second)
network address?
over a fiber link with length of 800km. Assume
the speed of light in this medium is 200000 (a) 255.255.255.252
km/second. What is the propagation delay in (b) 255.255.255.128
this link? (c) 255.255.255.0
(a) 1 millisecond (d) 255.255.254.0
(b) 2 milliseconds Ans. (b) :
(c) 3 milliseconds * In class B addressing : 16 - bit network ID and 16-
(d) 4 milliseconds bits for host ID.
Ans. (d) : Data * 500 subnets are required and 29 = 512, hence 9 bits
Bandwidth (BW) = 1Gbps = 1010 b/s are needed from host id part of class B addressing in
order to provide 500 subnets.
Length (d) = 800 km
5 * Remaining 7 bits numbers of host possible per
speed (v) = 200000 km/s = 2 × 10 km/s
subnet is 128 – 2 = 126
propagation delay = Tp
subnet - id (25 bits)/ Host - id (7-bits)
Method 1
Subnet mask contains is in subnet id part and the os in
Formula :
host ID part. Hence subnet mask is :
\({{\rm{T}} – {\rm{P}}} = \frac {{\rm{d}}}
11111111.11111111.11111111.10000000
{{\rm{v}}}\)
In decimal form it can be represented as :
Calculation :
255.255.255.128
\({{\rm{T}} – {\rm{P}}} = \frac {{800{\rm{\;km}}}}
85. Consider the following two statements with respect to IPv4 in computer networking :
P : The loopback (IP) address is a member of class B network.
Q : The loopback (IP) address is used to send a packet from host to itself.
What can you say about the statements P and Q?
(a) P-True; Q-False (b) P-False; Q-True
(c) P-True; Q-True (d) P-False; Q-False
Ans. (b) : IPV4 address : 32 bits
IP address = Network ID + Host ID
Network ID + Host ID = 32
class PREFIX Network Range of Ist No. of Ip Number of IP address Per lentage of
(bits reserved ID (bits) byte address networks per network IPV4 address
from Ist byte) consumed consumed
class A 0 8 0-127 231 27 224 50%
30 14
class B 10 16 128-191 2 2 216 25%
29 21 8
class C 110 24 192-223 2 2 2 12.5%
class D 1110 – 224-239 228 Multicast Reserved 6.25%
28
class E 1111 – 240-255 2 6.25%
The address between the range 127.0.0.0 to 127.255.255.255 (exclude 127.0.0.0 and 127.255.255.255) can be
used as a loopback address that falls in the range of class A network. Therefore, the loopback (IP) address is a
member of class A network. Therefore, statement P is false.

UGC NET JRF Computer Science June 2019 Paper-II 326 YCT
 Search on TG: @apna_pdf
A loopback address is primarily used to validate that the locally connected physical network card is working
properly and the TCP/IP stack installed. A data packet sent on a loopback address, never leaves the host system
and is sent back to the source application (to itself).
Therefore, statement Q is true.
86. In the TCP/IP model, encryption and
decryption are functions of _____ layer.
(a) data link
(b) network
(c) transport
(d) application
Ans. (d) : TCP/IP model
Layers Functions
Network Layer : It is responsible for the delivery of
Application Layer Authenticatim, individual packets from source host to the destination
Authorization, Encryption, host. When two systems are attached to different
Decryption etc. networks with connecting devices between them, there
Transport Layer End to end connectivity is a need for the network layer to accomplish source to
segmentation, destination delivery of packets. Smallest unit of data
Multiplexing, that is transmitted is known as packet in network layer.
demultiplexing, congestion
control etc
Internet Layer Host to host connectivity
fragmentation etc
Link layer (data link) flow control, framing etc
87. Which of the following statements is/are true
with regard to various layers in the Internet
stack? 88. What percentage (%) of the IPv4, IP address
space do all class C addresses consume?
P : At the link layer, a packet of transmitted
(a) 12.5% (b) 25%
information is called a frame.
(c) 37.5% (d) 50%
Q : At the network layer, a packet of transmitted
Ans. (a) :
information is called a segment.
(a) P only 21 Bit 8 bit
(b) Q only 1 1 0 Network Host
(c) P and Q --------------------------- Class C-----------------------------
(d) Neither P nor Q -
Total No of IPV4 addresses possible = 232
Ans. (a) : OSI model is a Layered framework for the Total No of IPV4 address belong to class C = 229
design of network systems that allows communication
[As class C IP address always start with 110]
between all types of computer systems. It consists of
So required percentage = (2^29/2^32) × 100
seven layer but related layer each of which defines a
= 100/8
part of the process of moving information across a
= 12.5%
network.
89. The ability to inject packets into the Internet
The seven layer from bottom to top are as follows :
with a false source address is known as
physical layer, data link layer, network layer, transport
(a) man-in-the-middle attack
layer, session layer, presentation layer, application
(b) IP phishing
layer.
(c) IP sniffing
But here we have to focus only on data link layer and
(d) IP spoofing
network layer.
Ans. (d) : IP spoofing :-
Data link layer : This layer is responsible for moving
IP address spoofing or IP spoofing is the creation of
frames from one hop to next. Data link layer divides the
Internet protocol packets with a false source IP address,
stream of bits received from the network layer into
for the purpose of impersonating another computing
manageable units called frames. It adds a header to the system.
frame to define the sender and receiver of the frame. It Main-in-the-Middle Attack : It is an attack where the
provides a flow and error control mechanism.
attacker secretly relays and possibly alters the
UGC NET JRF Computer Science June 2019 Paper-II 327 YCT
 Search on TG: @apna_pdf
communications between two parties who believe they 91. Consider the game tree given below :
are directly communicating with each other three
security issue that are particalarly applicable to the IP
protocol : packet sniffing, packet modification, and
IP spoofing.
Packet sniffing : In packet sniffing, an intruder tries to
intercept the IP packet and make a copy of it It is a
passive attack, in which the attacker does not change the
contents of the packet. Here and represent MIN and MAX
IP spoofing : In IP spoofing, an attacker can nodes respectively. The value of the root node
masquerade (Pretense) somebody else and creates an IP of the game tree is
packet that carries the source address of another (a) 4 (b) 7
computer. An attacker can send an IP packet to a bank (c) 11 (d) 12
pretending that is coming from one of the customers. Ans. (b) : Start from bottom to top :
90. The RSA encrypting algorithm also works in 1) First it finds the minimum value from the given
reverse, that is, you can encrypt a message with values.
the private key and decrypt it using the public
key. This property is used in
(a) intrustion detection systems
(b) digital signatures
(c) data compression
(d) certification
Ans. (b) : RSA encryption algorithm when works in
reverse, it uses digital signature technique. Step by step
method of this is as follows: 2) At next step, max value is considered.
1- Sender (A) uses the SHA-1 message digest method
to calculate the message digest over the original
message (m).

3) Then again min value is considered

4) The at the root, we have to consider the maximum

value

92. Match List-I with List-II

2- Sender now encrypts the message digest with
his/her private key and that output is called as List-I List-II
digital signature of sender. (A) Greedy best- (i) Minimal cost
first (p) + h(p)
(B) Lowest cost-first (ii) Minimal h(p)
(C) A+ algorithm (iii) Minimal cost
(p)
Choose the correct option from those given
below :
3- Now, sender sends the original message along with (a) (A)-(i), (B)-(ii), (C)-(iii)
digital signature to receiver B. (b) (A)-(iii), (B)-(ii), (C)-(i)
4- After that, when it reaches to the receiver, receiver (c) (A)-(i), (B)-(iii), (C)-(ii)
decrypts this using the sender's public key. (d) (A)-(ii), (B)-(iii), (C)-(i)

UGC NET JRF Computer Science June 2019 Paper-II 328 YCT
 Search on TG: @apna_pdf
Ans. (d) : If fuzzy conjunction operator is denoted as f(x, y) and
a) Greedy best first → ii) Minimal h(p) fuzzy disjunction operator is denoted as s(x,y). Then it
b) Lowest cost → iii) Minimal cost (p) forms as dual pair if : 1 – t (x, y) = S(1 – x, 1 – y)
or 1 – s (x, y) = t (1 – x, 1 – y)
c) A* search → i) Minimal cost (p) + h(p)
Here, it means choice of fuzzy disjunction operator
h(p) = heuristic cost from current node to goal node. determines the choice of fuzzy conjunction operator and
Cost (p) = Cost to reach that node. vice-versa.
93. The STRIPS representation is 95. Let Aα0 denotes the α – cut of a fuzzy set A at
(a) a feature-centric representation α0. It α1 < α2, then
(b) an action-centric representation (a) Aα1 ⊇ Aα2
(c) a combination of feature-centric and action- (b) Aα1 ⊃ Aα2
centric representations
(c) Aα1 ⊆ Aα2
(d) a hierarchical feature-centric representation
(d) Aα1 ⊂ Aα2
Ans. (b) : The STRIPS representation is-
Ans. (a) : Alpha cut in a fuzzy set :
STRIPS - It stands for stanford research institute
problem solver. It is an action centric representation in An α cut of a fuzzy set A is a crisp set that contains all
elements in U that have membership value in A greater
which for each action, it specifies the effect of the
action. than or equal to α.
In strips representation, there are states and goal and Explanation :
operators. Aα0 = α – cut of a fuzzy set A at α0
operator is of three parts: if we take α1 < α2
1- Operator name consider an example for this :
2- Precondition : it must occur so that operator can Fuzzy set A on interval x[1, 5]
execute. membership function (UA) is = (x)/(x + 2)
3- Effect : it means how the state will change after an Case 1 : first find α 0.2
action. x can be 1, 2, 3, 4 and 5
In STRIPS, there is state base view of time.Actions are when x = 1, uA = 1/1 + 2 = 1/3 = 0.33
external to the logic. Given a state and an action, when x = 2 uA 2/2 + 2 = 1/2 = 0.5
STRIPS representation is used to find: when x = 4 uA = 4/4 + 2 = 4/6 = 0.66
a) Whether the action can be carried out in the state. when x = 5 uA = 5/7 = 0.71
b) what is true in the resulting state.Predicates used in Alpha cut for α = 0.2 is {1, 2, 3, 4, 5}
STRIPS are primitives and derived.It is used to Case 2- Take α 0.5
determine the truth value of primitive predicates Alpha cut for this set is {2, 3, 4, 5}
based on the previous state and action. from here if is clear that set 2 is subset of set 1 i.e A α 1
94. A fuzzy conjunction operator denoted as t(x, y) ⊇ A α2
and a fuzzy disjunction operator denoted as 96. Consider the following methods :
s(x, y) form a dual pair if they satisfy the
M1 : Mean of maximum
condition :
M2 : Centre of area
(a) t(x, y) = 1 – s(x, y)
M3 : Height method
(b) t(x, y) = s(1 – x, 1 – y)
Which of the following is/are defuzzification
(c) t(x, y) = 1 – s(1 – x, 1 – y) method(s)?
(d) t(x, y) = s(1 + x, 1 + y) (a) Only M2 (b) Only M1 and M2
Ans. (c) : t(x, y) = 1 – s(1 – x, 1 – y) (c) Only M2 and M3 (d) M1, M2 and M3
FuzzySet :A fuzzy set is that which allows its members Ans. (d) : Defuzzification: It is the reverse of
to have different value in the set interval [0, 1] fuzzification in which a fuzzy set is transformed back to
Operations that can be performed on fuzzy set are crisp set.
union, intersection, complement. various defuzzification methods are
Union and intersection operation in fuzzy set are equal 1) centre of sum method: In this method, it covers the
to conjunction (AND) and disjunction operation (or) area two times, which is the required area.
respectively. 2) Centroid method: It provides crisp value by
We can consider min for conjunction and max for considering the centre of gravity on fuzzy set. It is
disjunction. Also, there are various other choices also. also known as centre of gravity method. Total area
Such as to calculate product for conjunction and is divided into sub areas in this. Centre of gravity is
algebraic sam for disjunction operation. calculated for each sub area.

UGC NET JRF Computer Science June 2019 Paper-II 329 YCT
 Search on TG: @apna_pdf
3) Centre of area method: It calculates the area under Ans. (d) : A Self-Organizing Feature Map:It is a type
curve. It partitions a region into two regions of same of artificial neural network (ANN) that is trained using
area. unsupervised learning to produce a low-dimensional
4) weight average method: In this membership (typically two-dimensional), discretized representation
of the input space of the training samples, called a map,
functions are used. Each membership function is
and is therefore a method to do dimensionality
weighted by the maximum membership value.
reduction.
5) Maxima methods : a) First of maxima: It finds the Self-organizing maps differ from other artificial neural
smallest value of domain with maximum network as opposed to error correction learning (such as
membership value. back propagation with gradient descent), and in the
b)Last of maxima: It finds the largest value with sense that they use a neighborhood function to preserve
maximum membership value. the topological properties of the input space.
c)Mean of maxima: In this, mean of the values is 99. The value of the derivative of Sigmoid function
taken with maximum membership value. 1
given by f(x) =
97. Consider the following : 1 + e −2x
(A) Evolution at x= 0 is
(B) Selection (a) 0
(C) Reproduction 1
(b)
(D) Mutation 2
Which of the following are found in genetic 1
(c)
algorithms? 4
(a) (A), (C) and (D) only (d) ∞
(b) (B) and (D) only Ans. (b) :
(c) (A), (B), (C) and (D) d  1 
 
(d) (A), (B) and (D) only dx  1 + e −2x 
Ans. (c) : Genetic algorithm are adaptive methods
which may be used to solve search and optimization =
(1 + e−2x ) dxd (1) − (1) dxd (1 + e−2x )
(1 + e−2x )
2
problems. They are based on the genetic process of
biological organisms.
0 − (1) (1 + e −2x ) − (1) ( e −2x ) ( −2 )
d
Explanation: Genetic algorithm use a direct analogy of
dx =
natural behavior. They work with a population of =
individuals, each representing a possible solution to a (1 + e −2x ) (1 + e−2x )
2

given problem. Each individual is assigned a fitness 2e −2x

score according to how good a solution to the problem it =
is. The highly fit individual are given opportunities to (1 + e )
−2x 2

reproduce, by cross breeding. This produces offspring. Now put x = 0

Before a GA can b run, a suitable coding and fitnes 2e −2( 0) 2 (1) 2 1
function is required. = = =
( ) (1 + 1)
2 2
−2 ( 0 ) 4 2
1+ e
Phases that are considered in genetic algorithm are:
1) Initialize population 100. Reinforcement learing can be formalized in
2) Selection terms of ____ in which the agent initially only
3) Crossover knows the set of possible _____ and the set of
possible actions.
4) Mutation
(a) Markov decision processes, objects
5) reproduction
(b) Hidden states, objects
98. Which of the following is an example of (c) Markov decision processes, states
unsupervised neural network? (d) objects, states
(a) Back-propagation network Ans. (c) : Reinforcement learning can be formalized in
(b) Hebb network terms of Markov decision processes, in which the agent
(c) Associative memory network initially only knows the set of possible states and the set
(d) Self-organizing feature map of possible actions.

UGC NET JRF Computer Science June 2019 Paper-II 330 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. 4 December, 2019

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. A basic feasible solution of an m × n 3. The Boolean expression AB + AB + AC + AC is
transpiration problem is said to be non- unaffected by the value of the Boolean
degenerate. if basic feasible solution contains variable_______.
exactly ______ number of individual allocation
(a) A (b) B
is ______ positions.
(a) m + n + 1, independent (c) C (d) A,B and C
(b) m + n – 1, independent Ans. (b) : Let F(A, B, C) = AB + AB + AC + AC
(c) m + n – 1, appropriate F(A, B, C) = A ( B + B ) + ( A + A ) .C
(d) m – n + 1, independent
Ans. (b) : Transportation problem is crucial part of F(A, B, C) = A + C ..... (Q A + A = 1 and 1.A = A )
linear programming problem which can be connected
Since the minimized Boolean expression does not
for required sources of supply to responding destination
of demand, with the end goal that the aggregate contain Boolean variable B. Therefore, F(A, B, C) is
transpiration cost to be limited unaffected by the value of the Boolean variable B.
The essential phase of any transportation problem as 4. What are the greatest lower bound (GLB) and
initial basic feasible solution. Initial basic feasible the least upper bound (LUB) of the sets A = {3,
solution must be feasible i.e. it must satisfy all the 9, 12} and B = {1, 2, 4, 5, 10} if they exist in
supply and demand constraints. The number of positive poset (z+,/) ?
allocations must be equal to m + n – 1 where m is (a) A(GLB – 3,LUB – 36); B(GLB – 1,LUB –
number of rows and n is number of columns. 20)
Non degenerate basic feasible solution : A basic (b) A(GLB – 3,LUB – 12); B(GLB – 1,LUB –
feasible solution is non-degenerate it has exactly m + n 10)
– 1 positive allocations in individual positions. It the (c) A(GLB – 1,LUB – 36);B(GLB – 2,LUB – 20)
allocations are less than required number, then it is (d) A(GLB) – 1,LUB – 12);B(GLB – 2,LUB –
known as degenerate basic feasible solution. This
10)
solution is not easy to modify, because it is impossible
to draw a closed loop for each occupied cell. Ans. (a) : In poset (z+,/),/ is the division relation. Hence
these diagram for the given POSET
2. Consider the following Linear programming
problem (LPP) : A = {3, 9, 12, 36 (added)}
Maximize z = x1 + x2 A with GLB = 3 and LUB = 36
Subject to the constraints : B = {1, 2, 4, 5, 10, 20(added)}
x1 + 2x2 ≤ 2000 Both GLB = 1 and LUB = 20
x1 + x2 ≤ 1500
x2 ≤ 600
and x1.x2 ≥ 0
The solution of the above LPP is :
(a) x1 = 750, x2 = 750,z = 1500
(b) x1 = 500, x2 = 1000,z = 1500
(c) x1 = 1000, x2 = 500,z = 1500
(d) x1 = 900, x2 = 600,z = 1500
5. Let P be the set of all people. Let R be a binary
Ans. (c) : Graphical method can be used. On solving all
the constraints, the peaks of the Common area are : A(0, relation on P such that (a, b) is in R if a is a
0) B(0, 600), C(1500, 0), D(1000, 500) z is maximum brother of b. Is R symmetric transitive, an
on all the points of the constraint x1 + x2 ≤ 1500 (as equivalence relation, a partial order relation?
slope of z is same as the constraint) (a) NO,NO,NO,NO
Now lets try to eliminate the options option 1 and 2 can (b) NO,NO,YES,NO
be eliminated as they are violating 3rd constraint option (c) NO,YES,NO,NO
4 can be eliminated as it is violating 1st constraint. (d) NO,YES,YES,NO

UGC NET JRF Computer Science Dec. 2019 Paper-II 331 YCT
 Search on TG: @apna_pdf
Ans. (c) : R is a relation on P such that (a, b) is in R if a Ans. (a) :
is a brother of b. Degree of 2n vertices = 1
Case 1 : check symmetric relation (a, b) – a is the Degree of 3n vertices = 2
brother of b, Degree of n vertices = 3
(b, a) – b may or may not be brother of a, so given Formula –
relation is not symmetric. Handshaking theorem : sum of the degree of vertices =
Case 2 : Check transivity If a is the brother of b, b is the 2 × number of edges (E) In a tree, number of edges (E)
brother of c, then a will also be brother of c. It means if = number of vertices – 1
(a, b) and (b, c) then (a, c). So given relation is Calculation – using 1st formula
transitive.
2n ×1 + 3n × 2 + n × 3 = 2E
Case 3 : Equivalence. As relation is not symmetric, So
11n = 2E
it cannot be equivalence relation.
E = 2n + 3n + n – 1
Case 4 : Partial order relation for this, we have to check
anti symmetric property. i.e. if (a, b) is in relation than E = 6n – 1
(b, a) should not be in relation unless a = b, Here it is Comparing above two equation for E.
not partial order relation. 11n = 12n – 2
6. The weight of minimum spanning tree in graph n=2
G, calculated using Kruskal's algorithm is : number of vertices = 6n = 12
number of edges = 12 – 1 = 11
8. How many reflexive relations are there on a set
with 4 elements?
(a) 24 (b) 212
2
(c) 4 (d) 2
Ans. (b) : The number of reflexive relation on an n-
Element set is = 2n2 – n
Given that set of element (n) = 4
= 2n2 – n
(a) 14 (b) 15 = 2(16 – 4) = 212
(c) 17 (d) 18 9. A non-pipelined system takes 30ns to process a
Ans. (b) : Minimum spanning Tree : → A minimum task. The same task can be processed in a four-
spanning tree (MST) or minimum weight spanning tree segment pipeline with a clock cycle of 10ns.
is a subset of the edges of a connected, edge-weighted Determine the speed up of the pipeline for 100
undirected graph that connects all the vertices together, tasks.
without any cycles and with the minimum possible total (a) 3 (b) 4
edge weight. So a minimum spanning tree or minimum (c) 3.91 (d) 2.91
weight spanning tree is a subset of the edges (V - 1) of a Ans. (d) : For a non-pipelines system.
connected, edge weighted undirected graph G (V, E) time to process a task, tn = 30ns
that connects all the vertices together, without any
For a pipelined system.
cycles and with the minimum possible total edge
weight. number of segments, k = 4
Edge set for the given graph = {2, 3, 4, 5, 6, 7, 8} for 5 clock cycle of each segment, tp = 10ns
vertices, we need 4 edges in MST. So edge set for MST For n = 100 tasks.
= {2, 3, 4, 6} Calculation : → Time taken by non pipelined processor
Minimum spanning tree to complete 100 tasks = 100 * time taken to complete
each task.
= 100 * 30
= 3000
Time taken by pipelined processor to compete 100 tasks
= (100 + number of stages – 1) * clock cycle time =
(100 + 4 – 1) * 10
= 103 * 10
Minimum cost ⇒ 2 + 3 + 4 + 6 = 15 = 1030
7. A tree has 2n vertices of degree 1, 3n vertices of Speed up = (Time taken by non pipelined processor to
degree 2, n vertices of degree 3. Determine the complete 100 tasks)/ (time taken by pipelined processor
number of vertices and edges in tree. to compete 100 tasks)
(a) 12,11 (b) 11,12 = 3000/1030
(c) 10,11 (d) 9,10 = 2.91
UGC NET JRF Computer Science Dec. 2019 Paper-II 332 YCT
 Search on TG: @apna_pdf
10. A computer a memory unit of 512 K works of size of micro-instruction = 8 + 2 + 9 = 19 bits
32 bits each. A binary instruction code is stored 12. Given following equation :
in one word of the memory. The instruction has (142)b + (112)b-2 = (75)8 , find base b.
four parts: an addressing mode field to specify (a) 3 (b) 6
one of the two-address sing mode (direct and
(c) 7 (d) 5
indirect), an operation code, a register code
part to specify one of the 256 registers and an Ans. (d) : (142)b + (112)b–2 = (75)8
address part. How many bits are there in b2 + 4 × b + 2 + 1 × (b – 2)2 + 1 × (b – 2) + 2 = 7 × 8 +
addressing mode part, opcode part, register 5
code part and the address part? 2b2 + b + 6 = 61
(a) 1, 3, 9, 19 2b2 + b – 55 = 0
(b) 1, 4, 9, 18 2b2 + 11b – 10b – 55 = 0
(c) 1, 4, 8, 19 b (2b + 11) – 5 (2b + 11) = 0
(d) 1, 3, 8, 20 (b – 5) (2b + 11) = 0
Ans. (c) : Memory unit = 512 k words ∴b=5
1 word = 32 bits = 4B Alternate :
Binary instruction code stored in 1 word of memory Option 1 : b = 3
Instruction divided as follows. It has base 3 which is not possible because (142) having
Addressing operation Register Address a digit 4 cannot exist in base 3
made code code Part option 2 : b = 6 option 3 : b = 7
Addressing mode = 1 bit for direct or indirect, (142)6 = (62)10 (142)7 = (79)10
Register code = ln(256) = 8 bits (112)4 = (22)10 (112)5 = (32)10
since, registers are already addressed, only memory 62 + 22 = (84)10 79 + 32 = (111)10
needs to be addressed. Address part = ln (512 k) = 19 (75)8 = (61)10 (75)8 = (61)10
bits operation mode = 32 – 1 – 8 – 19 = 4 bits There for 6 is not base Therefore 7 is not base
Therefore, bits for addressing mode part, opcode part, option 4 – b = 5
register code part and the address part = (1, 4, 8, 19) (142)5 = (47)10
11. A micro instruction format has micro (112)3 = (14)10
operation field which is divided into 2 subfields 47 + 14 = (61)10
F1 and F2. each having 15 distinct micro (75)8 = (61)10
operations, condition field CD for four status Therefore 5 is the base
bits, branch field BR having four options used Hence, (142)5 + (112)3 = (75)8
in conjunction with address field AD. The
13. The following program is stored in the memory
address space is of 128 memory words. The size
unit of the basic computer. Give the content of
of micro instruction is :
accumulator register in hexadecimal after the
(a) 19 (b) 18 execution of the program.
(c) 17 (d) 20
Location Instruction
Ans. (a) : MICRO INSTRUC TION FORMAT : →
Micro instruction format consists of two fields of micro 010 CLA
- operation. One field from conditions, one for branch 011 ADD 016
field and one is address field. 012 BUN 014
F1 F2 Condition Branch Address 013 HLT
Micro operation field into two subfields containing 15 014 AND 017
micro operation each. 015 BUN 013
condition field : 4 status bits 016 C1A5
Branch : 4 option in conjunction with address So bits
required for micro-operations 017 93C6
= log2 15 + log2 15 = 4 + 4 = 8 (a) A1B4 (b) 81B4
condition = log2 4 = 2 (c) A184 (d) 8184
Branch in conjunction with address field Ans. (d) :
= log2 (4 × 128) = log2 512 = 9 Location Instruction operation Content of order of
accumulator instruction
condition Branch with 1st
F1( 4 bits ) F2 ( 4 bits )
010 CLA Clear Accumulator 0000

( 2 bits ) address ( 9 bits ) 011 ADD 016 ADD (C1A5) to

Accumulator
C1A5 2nd

UGC NET JRF Computer Science Dec. 2019 Paper-II 333 YCT
 Search on TG: @apna_pdf
012 BUN 014 Goto address 014 C1A5 3rd (b) Member function of Class can access public
013 HLT Terminate C1A5 5th data of class A
program
014 AND 017 AND (93C6) 8184 4th (c) Member function of class B cannot access
Accumulator private data of class A
015 BUN 013 Goto address 013 8184 (d) Object of derived class B can access public
016 C1 A5
base class data
017 93C6
Ans. (d) : Object of Derived class cannot access any
C1A5 = 1100 0001 1010 0101
member of base class directly. So it cannot access
& 93C6 = 1001 0011 1100 0110 public, protected as well as private member directly.
-------------------------------------- Therefore, object of derived class B can access public
8184 = 1000 0001 1000 0100 base class data is false.
The content of accumulator register in hexadecimal
16. Which tag is used to enclose any number of
after the execution of the program is – 8184
JavaScript statements in HTML document ?
14. What is the output of following C program? (a) <code> (b) <script>
# include <stdio.h> (c) <title> (d) <body>
main( )
Ans. (b) : JavaScript is a programming language for use
{ in HTML pages. Its programs are run by interpreter
int i, j, x = 0; built into the user's web browser.
for (i = 0; i < 5; + + i) programs in JavaScript language are known as scripts.
for (j = 0; j < i; + + j) It can execute both on Browser and server or any device
{ that supports special program JavaScript virtual
x + = (i + j – 1); machine. It has fall integration with HTML/CSS.
break; JavaScript Program can be inserted into any part of
} HTML document with the help of
printf ("%d", x); <script> tag.
} Example : <html >
(a) 6 (b) 5 <body>
(c) 4 (d) 3 <script>
Ans. (a) : Key Point :- alert ("this is JavaScript program");
• break statement in the loop the control will come < / script>
out of that loop only and nothing is executed after < / body>
the break statement. < / html>
• in this question the J- loop will be executed only 17. A rectangle is bound by the lines x = 0; y = 0; x
once as there is break in it.
= 5 and y = 3. The line segment joining (–1, 0)
So totally i will be executed for J = 0 (only) and it will and (4, 5), if clipped against this window will
only be executed. connect the points _______.
⇒ Round 1 : (a) (0, 1) and (3, 3)
Initialization :- Value of i = 0, j = 0 and x = 0 (b) (0, 1) and (2, 3)
As j = 0, j = 0 and j </ i (c) (0, 1) and (4, 5)
So, no thing will be be printed there. (d) (0, 1) and (3, 5)
Round 2 :
Ans. (b) : Given
i = 1, j = 0 and x = 0
Rectangle is bound by the lines x = 0, y = 0, x = 5 and y
Round 3 : =3
i = 2, j = 0 and x = 1
Round 4 :
i = 3, j = 0 and x = 3
Round 5 :
i = 4, j = 0, and x = 6
Q x = 6 is the correct answer.
15. Let A be the base class in C++ and B be the
derived class from A with protected
inheritance. Which of the following statement
is false for class B ?
(a) Member function of class B access protected
data of class A we follow the pattern of
UGC NET JRF Computer Science Dec. 2019 Paper-II 334 YCT
 Search on TG: @apna_pdf
(a) 420 Pixels (b) 460 Pixels
Top Bottom Right Left
(c) 480 Pixels (d) 540 Pixels
Steps : Ans. (c) : Aspect ratio of an image = width/height Here
1. As p lies in the left of window. So region for this will we have given an image with size 1024 × 768 pixels.
be : 0001 width = 1024 pixels
2. Q point lies in the top of the window, So, region for Height = 768 pixels
this will be : 1000
1024 4
3. Logical AND of 0001 AND 1000 = 0000 i.e. line is Aspect ratio = =
partially inside the window. 768 3
4. Slope of the line PQ = (5 – 0)/ (4 – (1)) = 5/5 = 1 Also, width changes to 640 pixels which aspect ratio
5. Now, we have to find the coordinates of 'p', slope of remain same.
PQ. 4 640
=
6. So, we have to find the Y coordinate as X coordinate 3 h
is o. (5 – Y') (4 – 0) = 1, 5 – Y' = 4, y' = 1 coordinate of 640 *3
p' will be (0, 1). h= = 480
7. Next we have to find the coordinates of point Q. For 4
this, Y Coordinate we already know i.e. 3. So, Height of resized image will be 480 pixels.
8. So, (5 – 3)/(4 – x') = 1, 2 = 4 – x', x' = 2 coordinates 20. Which of the component module of DBMS does
of Point Q' will be (2, 3). So the line segment joining (– rearrangement and possible ordering of
1, 0) and (4, 5), if clipped against this window will operations eliminate redundancy in query and
connect the points (0, 1) and (2, 3). use efficient algorithms and indexes during the
18. Which of the following algorithms is not used execution of a query ?
for line clipping? (a) query compiler
(a) Cohen-Sutherland algorithm (b) query optimizer
(b) Southerland-Hodgeman algorithm (c) Stored data manager
(c) Liang-Barsky algorithm (d) Database processor
(d) Nicholl-Lee-Nicholl algorithm Ans. (b) : There are many plans that a database
Ans. (b) : Line clipping : It involves clipping of lines management system can follow to process a query, but
which one outside the window line. it is the amount of time that they need to run is given
From above given option line clipping algorithms are : importance. For this, query optimization is required.
COHEN-SU THERLAND ALGORITHM : It cuts Query optimization examines all algebraic expressions
line to portions which are within a rectangular area. It that are equivalent to the one that is estimated to be the
eliminates those lines which are outside the view port cheapest.
and clip those lines which are partially inside and * Query optimization procedure either attempt to
partially outside of view port. To clip a line, we must maximize of resources or to minimize the resource
have the endpoints. Region code in Cohen- Sutherland usage for a given output.
algorithm is : * It tries the minimize the response time for a given
TOP Bottom Left right query language.
* It does rearrangement and possible ordering of
Two cases are there : trivial acceptance and trivial operations, eliminate redundancy in query
rejection. If both end points are inside the window then * In order to allow fair comparison of efficiency, the
trivially accepted. If both end points lie entirely to one functional capabilities of the query evaluation system to
side, or outside of window. Then trivially rejected
be compared must be similar.
otherwise clip the line.
Liang Barsky Algorithm → It uses four computations 21. Given two tables R1 (x, y) and R2 (y, z) with 50
to find the appropriate end points of a line. It is based and 30 number of tuples respectively. Find
on floating point arithmetic. It uses parametric maximum number of tuples in the output of
equations for the line. natural join between tables R1 and R2 i.e. R1 *
Nichole - Lee - Nicholl algorithm : It divides the R2 ? (* - Natural Join)
clipping window into separate areas and matches the (a) 30 (b) 20
start point area code to one of those areas. Imaginary (c) 50 (d) 1500
lines are drawn to all the edges of the window and Ans. (d) : "A natural Join is based on common
based on these imaginary lines, line is dipped. attributes or common columns to join two tables or
19. If we want to resize a 1024 × 768 pixels image relations
to one that is 640 pixels wide with the same Consider an example, suppose there are two table
aspect ratio, what would be the height of the Employee (Eid, Ename) consists of 5 tuples and
resized image? department (Eid, Did) consists of 3 tuples only
UGC NET JRF Computer Science Dec. 2019 Paper-II 335 YCT
 Search on TG: @apna_pdf
(a) 2 (b) 4
Eid Ename
(c) 3 (d) 5
1 E1 Eid Did Ans. (c) : Rules for finding minimum number of tables
1 E2 1 D1 required for an ER diagram :
1 E3 1 D2 1. A strong entity with single or composite attributes
1 E4 1 D3 require one table.
2. A strong entity with multivalued attribute requires
1 E5 two tables.
Natural Join of employee and department (Employee 3. In case of many to many relations between two
Department) gives : 5 × 3 = 15 entities, 3 tables are required
So, maximum number of tuples in natural join are from There is one to many relationships between R1 and R2.
the relation having minimum tuples. So, in given So, two tables are required for two entities. But, entity
question, R2 contains 30 tuples, So, maximum number R2 contains multivalued attribute B, due to which one
of tuples in the output of natural Join between tables R1 table for this is also needed. So, minimum number of
and R2 i.e. R1 * R2 = 50 × 30 = 1500. tables required for the given ER diagram are 3.
22. Given two tables EMPLOYEE (EID, ENAME,
24. A counting semaphore is initialized to 8.3 wait
DEPTNO) DEPARTMENT (DEPTNO,
DEPTNAME) ( ) operations and 4 signal ( ) operations are
applied. Find the current value of semaphore
Find the most appropriate statement of the
given query : variable.
Select count (*) 'total' (a) 9 (b) 5
from EMPLOYEE (c) 1 (d) 4
where DEPTNO IN (D1, D2) Ans. (a) :
group by EPTNO V(S) : Signal operation will increment the semaphore
having count (*) > 5 variable, that is, S + +.
(a) Total number of employees in each P(S) : Wait operation will decrement the semaphore
department D1 and D2 variable that is, S – – .
(b) Total number of employees of department D1 Data : Initial counting semaphore = I = 8
and D2 if their total is > 5 wait operation = 3 P
(c) Display total number of employees in both signal operation = 4 V
departments D1 and D2
Final (current) counting semaphore = F ⇒
(d) The output of the query must have atleast two
rows Formula : F = I + 4V + 3P
Ans. (b) : Given query is : Calculation : F = 8 + 4(+1) +3 (–1)
select count (*) total ∴F=9
from EMLOYEE where the resulting value of the semaphore is 2.
DEPTNO IN (D1, D2) 25. Which of the following is noted by an
group by DEPTNO encryption algorithm used in cryptography?
having count (*) > 5 (a) KEY
STEP1 :- It will first find the all the entries with (b) Message
department no. as D1 and D2 with the help of natural (c) Ciphertext
join from both the relations. (d) User details
STEP2 :- Then in the resulting table, it groups the
tuples with the department no. (DEPTNO) Ans. (c and d) : To encrypt any message, any
STEP3 :- Then select all those tuples having count > 5 encryption algorithms necessarily require –
STEP4 :- Finally, it results in the total number of 1. Plain text (message)
employees of department D1 and D2 if their total is > 5 2. Key (private or public)
23. Find minimum number of tables required for Encryption algorithm doesn't require cipher text, it
converting the following entity relationship produces cipher text. To decrypt any message, any
diagram into relational database? decryption algorithms necessarily require
1. Cipher text
2. key (private or public)
No encryption or decryption algorithm requires user
details.
26. Which of the following CPU scheduling
algorithms is/are supported by LINUX
operating system?
UGC NET JRF Computer Science Dec. 2019 Paper-II 336 YCT
 Search on TG: @apna_pdf
(a) Non-preemptive priority scheduling 28. Suppose a system has 12 magnetic tape drives
(b) Preemptive priority scheduling and time and at time t0, three processes are allotted tape
sharing CPU scheduling drives out of their need as given below :
(c) Time sharing scheduling only Maximum Needs Current Needs
(d) Priority scheduling only p0 10 5
Ans. (b) : Linux operation system supports both p1 4 2
preemptive priority scheduling and time sharing CPU p2 9 2
scheduling. Linux scheduler is a priority preemptive At time t0 , the system is in safe state. Which of
scheduler with two priority ranges-Real time from o to the following is safe sequence so that deadlock
99 and a nice range from 100 to 140. is avoided ?
Preemptive priority scheduling : It maintains two array : (a) p0 , p1 , p 2 (b) p1 , p0 , p 2
active array and expired array. Schedule the processes
(c) p 2 , p1 , p0 (d) p0 , p 2 , p1
baseel on their static and dynamic priorities.
1. It finds the highest priority queue with a runnable Ans. (b) : Remaining Need = Maximum need -
process and find the first Process on that queue. current need
Calculate its time quantum, it put that process on expire Maximum Current Remaining
array list and repeat the process again. needs Needs Needs
2. When priority level of active queue is empty, it looks P0 10 5 5
for next highest queue, after running all active queues, it P1 4 2 2
swaps active and expire queues. P2 9 2 7
Diagram : Total Resources = 12
active expired Total resources allocated = 5 + 2 + 2 = 9
array array Available resources = 12 – 9 = 3
Priority task list Priority task lists Calculation : Available resource ≥ remaining need of
P1 using 3 resources, P1 gets executed first. It frees 2
[0] 0––0 [0] 0––0––0 resources.
[1] 0––0––0 [1] 0 Available resources = 3 + 2 = 5
• • • • Available resources ≥ remaining need of P0
• • • • Using 5 resources, P0 gets executed first. It frees 5
• • • • resources.
[140] 0 [140] 0––0 Available resources = 5 + 5 = 10
Available resources ≥ remaining need of P2
27. Consider a paging system where translation
Now, P2 can be executed easily
look aside buffer (TLB) a special type of
Hence, (P1, P0, P2) is a safe sequence.
associative memory is used with hit ratio of
80%. 29. Which of the following interprocess
communication model is used to exchange
Assume that memory reference takes 80 messages among co-operative processes ?
nanoseconds and reference time to TLB is 20 (a) Shared memory model
nanoseconds. What will be the effective (b) Message passing model
memory access time given 80% hit ratio? (c) Shared memory and message passing model
(a) 110 nanoseconds (d) Queues
(b) 116 nanoseconds Ans. (c) : Inter process communication (IPC) is a
(c) 200 nanoseconds mechanism which allows processes to communicate
(d) 100 nanoseconds with each other and synchronize their actions. By
Ans. (b) : TLB hit ratio = 0.8 maintaining this type of communication, processes are
said to so - operate with each other. Processes can
TLB miss ration = 0.2 communicate with each other using these two ways :
TLB reference time = 20ns – Shared memory
Main Memory reference time = 80ns – Message passing
Formula : Effective memory access time (EMAT) 30. Given CPU time slice of 2ms and following list
= TLB hit (TLB time + Main memory time) + TLB of processer.
miss (TLB time + 2 × Main memory time) Process Burst time Arrival time
Calculation : (ms)
EMAT = 0.8 (20 + 80) + 0.2 (20 + 80 + 80 ) p1 3 0
= 80 + 36 p2 4 2
∴ EMAT = 116ns. p3 5 5

UGC NET JRF Computer Science Dec. 2019 Paper-II 337 YCT
 Search on TG: @apna_pdf
Find average turnaround time and average Ans. (b): Java virtual machine is component of
waiting time using round robin CPU technology for its hardware and operating system
scheduling? independence, the small size of its compiled code and
(a) 4,0 (b) 5.66, 1.66 its ability to protect users from malicious programs.
(c) 5.66, 0 (d) 7,2 Java virtual machine is an abstract computing machine,
Ans. (b) : Gantt chart with time slice of 2ms like a real computing machine, it has an instructions set
P1 P2 P1 P2 P3 P3 P3 and manipulated various memory areas at run time.
* Java virtual machine knows nothing of java
0 2
Programming language, only of a particular binary
4 5 7 9 11 12 format the class file format.
Process table : (time in milliseconds) * A class file contains JVM instructions or byte codes
Pro Burst Arriv Compl Turn waitin and a symbol table as well as other information.
cess time al etion Arou g time * JVM imposes strong syntactical and structural
(BT) time time nd (WT) constraints on code in a class file
(AT) (CT) time =
(TAT) (TAT- * Class loader and interpreter is needed by JVM to
= BT) execute Java code
(CT- * Basic structure in JVM are : heap store, stack, method
AT) area, runtime constant pools, PC
P1 3 0 5 5 2 33. In a system for a restaurant, the main scenario
P2 4 2 7 5 1 for placing order is given below :
P3 5 5 12 7 2 (a) Customer reads menu
Sum Sum = (b) Customer places order
= 17 5 (c) Order is sent to kitchen for preparation
Average TAT = 17/3 = 5.66 (d) Ordered items are served
Average WT = 1.66 (e) Customer requests for a bill for the order
31. Which of the following methods are used to (f) Bill is prepared for this order
pass any number of parameters to the (g) Customer is given the bill
operating system through system calls?
(a) Registers (h) Customer pays the bill
(b) Block or table in main memory A sequence diagram for the scenario will
(c) Stack have atleast how many objects among
(d) Block in main memory and stack whom the messages will be exchanged .
Ans. (d) : Following are the methods used to pass (a) 3 (b) 4
parameters to the OS. (c) 5 (d) 6
1-Registers : Parameters are passed via registers but the Ans. (c) : There are five objects among whom the
limitation of this method is that the number of message will be exchanged. :
parameters cannot exceed the number of register. These are :
2-Blocks : when there are more parameters than 1. Customer
registers, these parameters are stored on a main memory
block and the pointer to this block (block address) is 2. Person who takes the order
passed as a parameter to a register. 3. Chef
3-Stack : Parameter can also be pushed on and popped 4. Serving person
off the stack by the OS. This method can be used when 5. Cashier
we don't certainly know the number of parameters be Process with the help of diagram is :
forehand. Therefore, methods used to pass ANY
NUMBER of parameters to the operating system
through system calls are via block and stack. Register
cannot pass. ANY NUMBER of parameters.
32. Java Virtual Machine (JVM) is used to execute
architectural neutral byte. Which of the
following is needed by the JVM for execution of
Java Code?
(a) Class loader only
(b) Class loader and Java Interpreter
(c) Class loader Java Interpreter and API
(d) Java Interpreter only

UGC NET JRF Computer Science Dec. 2019 Paper-II 338 YCT
 Search on TG: @apna_pdf
34. An ______ chart is a project schedule ≡ 7(103) mod 561
representation that presents project plan as a ≡ 721 mod 561
directed graph. The critical path is the _______ ≡ 160
sequence of _______ tasks and it defines
36. A clique in an undirected graph G = V , E is
project ________.
(a) Activity, Shortest, Independent, Cost a subset V' ⊆ V of vertices, such that
(b) Activity, Longest, Dependent, Duration (a) If (u, v) ∈ E then u ∈ V' and v ∈V'
(c) Activity, Longest, Independent, Duration (b) If (u, v) ∈ E then u ∈ V' or v ∈V'
(d) Activity, Shortest, Dependent, Duration (c) Each pair of vertices in V' is connected by an
Ans. (b) : CPM (critical path method) models the edge
activities and events of a project as a network. Activities (d) All pairs of vertices in V' are not connected
are identified as nodes and events that signify the start by an edge
and end of activities are denoted as edges between Ans. (c) : A clique is a subset of vertices of an
nodes. undirected graph G such that every two distinct vertices
CPM provides a graphical view of the project. It in the clique are adjacent
predicts the time required to complete the project. A clique in an undirected graph G = (V, E) is a subset
* Main aim of CPM is to determine the minimum of V i.e. V' such that each pair of vertices in V' is
completion time for a project. connected by an edge A clique of size k is called k-
* It uses forward and backward pas routines to analyze clique A o – clique contains set of o vertices. A
the project network. maximal clique is a clique that cannot be extended by
* If monitors the progress of project on basis of network including one more adjacent vertex. A maximum clique
schedule. of G is such that there is no clique with more vertices.
* In CPM, critical path is the longest sequence of 3 cliques :
dependent tasks and it defines project duration. 1–2–3
* During forward pass, it is assumed that each activity 2–3–4
will begin at its earlies stunting time. 2–3–6
* During backward pass, it is assumed that each activity 2–4–6
begins at its latest completion time. 3–4–6
Steps of CPM project planning :
1. Specification of individual activities and determining
the sequence of those activities.
2. Then draw network diagram as directed graph.
3. Estimation of completion time for each activity.
4. Then identity the critical path or longest path through
the network.
5. Finally update the CPM as the project progresses.
35. Let a2c mod n = (ac)2 mod n and a2c+1 mod n = a.
A Graph with 5 cliques of size 3
(ac)2 mod n . For a = 7, b = 17 and n = 561. what
is the value of ab (mod n) ? 37. What is the worst case running time of Insert
(a) 160 and Extract-min, in an implementation of a
priority queue using an unsorted array?
(b) 166
Assume that all insertions can be
(c) 157
accommodated.
(d) 67
(a) θ(1) , θ(n)
Ans. (a) : 717 mod 561 (b) θ(n) , θ(1)
(
≡ 7 ( 74 ) )  mod 561
2 2
(c) θ(1) , θ(1)
(d) θ(n) , θ(n)

(
≡ 7 ( 2401) ) mod 561
2 Ans. (a) : A priority queue is a queue in which each
element is assigned a priority and they are served
≡ 7 ( (157 ) )  mod 561 [2401 mod 561 ≡ 157]
2 2 according to the priority. If element having same
 priority, they are processes according to their order in
queue.
≡ (24649)2 mod 561
Insert, extract – min is performed on unsorted array.
≡ 7 (– 35)2 [Q24649 mod 561 ≡ 526 ≡ – 35] Insert : It means insertion of element in unsorted array.
≡ 7(1225) mod 561 In the worst case, element is inserted at the end of the
UGC NET JRF Computer Science Dec. 2019 Paper-II 339 YCT
 Search on TG: @apna_pdf
queue. Simply inserting the element at the end of queue Master's theorem, We get :
takes 0(1) complexity. Here, a = 4, b = 2, k = 2, P = 0
Extract-min : To do extract-min, use linear search ∴ a = bk ⇒ 4 = 22, and k = 2, P > 0
approach for worst case to find the minimum element. ∴ case 2 (i)
For this, we need to traverse all the elements of the T(n) = Θ (n logba logp+1n)
queue in worst case. So it will take 0(n) time
where a = bk, P > – 1
complexity to extract - min in priority queue.
38. In a B-Tree, each node represents a disk block. (
∴ T(n) = Θ mlog 2 4 log 0+1 m )
Suppose one block holds 8192 bytes. Each key
 2

uses 32 bytes. In a B-tree of order M there are = Θ  m log 2 2 log 0+1 m 
M - 1 keys. Since each branch is on another  
disk block, we assume a branch is of 4 bytes.
The total memory requirement for a non-leaf
(
= Θ m 2log 2 2 log 0+1 m )
node is = T(n) = Θ (m × log m)... (1)
2 1

(a) 32 M - 32 Now Q m = log2n

(b) 36 M - 32 Substituting this value of m in (1), we get :
(c) 36 M - 36 T(n) = Θ (log2n. log n)
(d) 32 M - 36 So. option 3 is the right answer.
Ans. (b) : 40. Consider a weighted directed graph. The
Data :- Block size = 8192 bytes = 213 bytes current shortest distance from source S to node
Key size = 32 bytes x is represented by d[x]. Let d[v] = 29, d[u] =
Block pointer = 4 byte 15, w[u , v] = 12. What is the updated value of
Order of the b-tree = M d[v] based on current information?
Number of keys = M – 1 (a) 29 (b) 27
FORMULA → In a B – Tree, the size of non - leaf (c) 25 (d) 17
node = M x (Block pointer) + (M – I) x (Key + Record Ans. (b) : If d represents the length of the path, then :
pointer) d(v)
CALCULATION :- Assuming Record pointer = 0 0, if v = s
=
 u:( u,v)∈E {
(since nothing is mentioned about it) min d(u) + w(u, v)} , otherwise
Total size = M(4) + (M – 1) (32) = 36 M – 32
39. Give asymptotic upper and lower bound for
T(n) given below. Assume T(n) is constant for n where w(u, v) os the weight of the edge (u, v)
≤ 2. T(n) = 4T ( n ) + lg 2
n ∴ Here
d(u) + w(u, v) = 15 + 12 = 27
(a) T(n) = θ(lg(lg2 n)lg n) ∴ 27 is the correct answer.
(b) T(n) = θ(lg2 n lg n) 41. When using Dijkstra's algorithm to find
(c) T(n) = θ(lg2 n lg lg n) shortest path in a graph, which of the following
(d) T(n) = θ(lg(lg n)lg n) statement is not true?
Ans. (c) : T(n) = 4 T ( n ) + log n 2 (a) It can find shortest path within the same
graph data structure
Let n = 2m ⇒ m = log2n (b) Every time a new node in visited. we choose
 m the node with smallest known distance/cost
⇒ T(2m) = 4T  2 2  + log2 (2m) (weight) to visit first
  (c) Shortest path always passes through least
 m number of vertices
⇒ T(2m) = 4T (  2 2  + log (2m) × log (2m) (d) The graph needs to have a non-negative
  weight on every edge
Now, Ans. (c) :
S(m) = T (2m)
m
⇒ S(m) = 4S   + m × m
2
m
⇒ S(m) = 4S   + m2
2
Now, on applying the
UGC NET JRF Computer Science Dec. 2019 Paper-II 340 YCT
 Search on TG: @apna_pdf
Dijkstra's algorithm is used to find single source G4 : S → aSb|bSa|SS|SSS|λ
shortest path i.e. path between any two vertices in a Gives a language G4 = {number of a = number of b)
graph. All edges must have non-negative weights and Hence, G2 and G4 are equivalent.
{a b }
graph must be connected. n n −3
44. Consider the language L = | n > 2 on
v a b c d e f g
a 0a 3a 5a 6a Inf Inf Inf ∑ = {a, b} . Which one of the following
b 0a 3a 5a 5b Inf Inf Inf grammars generates the language L?
c 0a 3a 5a 5b 11c 8c 12c (a) S→aA|a, A→aAb|b
d 0a 3a 5a 5b 11c 8c 12c (b) S→aaA|λ, A→aAb|λ
(c) S→aaaA|a, A→aAb|λ
0a 3a 5a 5b 11c 8c 9f
(d) S→aaaA, A→aAb|λ
So, we get the shortest distance from a to g. (a → b → cAns. (d) : for n = 3, string generated = aaa
→ d → f → g). for n = 4, string generated = aaaab
42. The time complexity to multiply two for n = 5 string generated = aaaaabb
polynomials of degree n using Fast Fourier only option 4 can generate the above grammar at
transform method is: following value of n.
(a) θ(nlgn ) (b) θ(n2) 45. Consider the following grammar :
(c) θ(n) (d) θ(lgn) S → 0A|0BB
Ans. (a) : Fast Fourier transform is a discrete Fourier A → 00A|λ
transform algorithm which reduces the number of
B → 1B|11C
computation needed for N points from 2N2 to 2N log
N. C→B
A discrete Fourier transform can be computed using fast Which language does this grammar generate ?
Fourier transform by means of Daniel-Sonlanczos (a) L((00)*0 + (11)*1)
lemma, if the number of point N is a Power of two. (b) L(0(11)*0 +1 (00)*)
If number of points N is not a power of two, a transform (c) L((00)*0)
can be performed n sets of points corresponding to (d) L(0(11)*1)
prime factor of N. Ans. (c) : Given grammar is generating string of type:
Fast Fourier transform allows computing in 0(n log n) {0,000,00000,0000000...........}
time. Basic idea is to apply divide and conquer. We (1) L((00) * 0 + (11) * 1 )
divide the co-efficient vector of polynomial into two This language generating string with combination of 0'S
vectors, recursively compute the Discrete Fourier and 1 and But given Grammar is not generating any
transform for each of them and combine the results string composed of 1's.
Recursive relation will become; (2) L (0(11)*+1(0 0)*)
Tf(N) = 2Tf(N/2)+ O(N). this language is not generating string which contains
43. Consider the following grammars: three o's together. Also, it is generating string which
G1:S → aSb|bSa|aa contains 1 in it. so, it is not correct option .
G2 :S → aSb|bSa|SS|λ (3) L((00) * 0)
G3 :S → aSb|bSa|SS|a It is generating string of type L:{0,03,05,07} these set of
G4 :S → aSb|bSa|SS| SSS|λ string is similar to the one generating from given
Which of the following is correct w.r.t the grammar so, this language is generating given grammar.
above grammars? (4) L (0()11*1)
(a) G1 and G3 are equivalent It is incorrect because it is generating string which
(b) G2 and G3 are equivalent contains 1 which is not the case with given grammar.
(c) G2 and G4 are equivalent
(d) G3 and G4 are equivalent
46. Consider ∑ = {w, x} and T = {x, y,z} . Define
homomorphism h by:
Ans. (c) : G1 : S → aSb|bSa|aa h(x) = xzy
Gives a language G1 = { number of a = number of b+2} h(w) = zxyy
G2 : S →aSb|bSa|SS|λ If L is the regular language denoted by r =
Gives a language G2 = { number of a = number of b} (w+x*)(ww)*, then the regular language h(L) is
G3: S→ aSb|bSa|SS|a given by
Gives a languages G3 = {number of a > = number of (a) (zxyy + xzy)(zxyy)
b+1 (b) (zxyy+(xzy)*)(zxyyzxyy)*
UGC NET JRF Computer Science Dec. 2019 Paper-II 341 YCT
 Search on TG: @apna_pdf
(c) (zxyy+xzy)(zxyy)* L2 is not inherently ambiguous and one unambiguous
(d) (zxyy+(xzy)*)(zxyyzxyy) grammar for this language is: S→ aSa bSb ∈
Ans. (b) : Homomorphism is a function from string to It is not hard to show that the above grammar is
string that is based on the concatenation for any x and y unambiguous (Hint: At every symbol, while reading the
∈∑* h(x,y) = h(x) h(y) string from the left, you only have one choice of
L is the regular language with the regular expression r = production rule in the parse tree.)
(w + x*) (ww)*
49. Let G = (V,T,S,P)be any context - free
Then h(L) = (h(w) + h(x)*) (h(w)h(w))*
grammar without any λ-productions or unit
Given : h(x) = xzy production Let K be the maximum number of
h(w) = zxyy symbols on the right of any production in P.
h(L) = (zxyy+(xzy)*) (zxyy zxyy)* The maximum number of production rules for
47. Consider the following statements with respect any equivalent grammar in Chomsky normal
{
to the language L = an b n | n ³ 0 } from is given by:
(a) (K–1)|P| – |T| –1
2
S1 :L is context free language (b) (K–1)|P| + |T|
S2 :Lk is context free language for any given (c) K|P| + |T| –1
k ≥1 (d) K|P| + |T|
S3 : L and L* are context free language Ans. (b) : Context free Grammar :- A grammar G =
Which one of the following is correct? (V,T,S,P) is said to be context- free if all productions in
(a) Only S1 and S2 P have the from A →X Where A∈V and X∈(V U T)*
(b) Only S1 and S3 If context the grammar G = (V,T,S,P) is without λ-
(c) Only S2 and S3 productions or unit productions.
(d) S1,S2 and S3 K = maximum number of symbols on right-side of
Ans. (d) : L = {anbn| ≥ 0 } production.
The given language is context free language and CFL The maximum number of production rules for
are closed under Union concatenation, and kleen equivalent grammar in CNF: (K–1)|P|+|T|
closure. A context free grammar is in CNF (Chomsky normal
S1 : L2 is a context free language, here L2 can be written form) if it satisfies these conditions:
as L2 = L.L and CSL is closed under concatenation so 1. Should not contains null or unit productions.
L2 is a CFL 2. A non- terminal symbol generating two non-terminals
S2: Lk context free language for any given k ≥1, Lk can for examples S →AB
be written as L.L.L........ k times and CFL are closed 3. A non-terminal generating a terminal example: S →a
under concatenation so Lk is CFL
S3: L– and L* are context free languages are not closed 50. Consider the following language families:
under complementation for complement of L may be L1 ≡ The context – free languages
CFL or CSL L2 ≡ The context – sensitive languages
Here complement of L is CFL, and CFL are closed L3 ≡ The recursively enumerable languages
under kleen Closure (*) so it is and CFL. L4 ≡ The Recursive languages
48. Consider the following languages: Which one of the following option is correct?
{ } { }
L1 = an b n cm ∪ an bm Cm , n,m ≥ 0 (a) L1 ⊆ L2 ⊆ L3 ⊆ L4
(b) L2 ⊆ L1 ⊆ L3 ⊆ L4
{ }
L2 = ww | w ∈ {a,b} * , where R represents
R
(c) L1 ⊆ L2 ⊆ L4 ⊆ L3
reversible operation. (d) L2 ⊆ L1 ⊆ L4 ⊆ L3
Which one of the following is (are) inherently Ans. (c) :Context free languages:- A language is said
laguage(s) ? to be context free if and only if there exists a context
(a) Only L1 free grammar for it. A grammar G = (V,T,S,P) is said to
(b) Only L2 be context free is all production is in the form of A→X
(c) Both L1and L2 where A∈V and X∈(V U T)*. There are accepted by
(d) Neither L1 nor L2 push down .........
Ans. (a) : L1 is inherently ambiguous language because Context sensitive languages:- If there exists a context
we cannot have any unambiguous grammar for this sensitive grammar for a language then it is known
language. context sensitive language context sensitive grammar is
Specifically (Hopcroft & Ullman(1979) gives a proof) one in which all production are of the from x→y where
that there is no way to unambiguously parse string in x,y ∈(V U T)* and x< = y these are accepted by linear
the (non-context- free) common subject {anbncn}. bounded automata

UGC NET JRF Computer Science Dec. 2019 Paper-II 342 YCT
 Search on TG: @apna_pdf
Recursive language:- A language is recursive if there finite sequence (ij……ip) with ij belongs to {1…….m}
exists a Turing machine accepts it and halts on every for J = 1…..P so that
input string . Ui1Ui2… Uip = Vi1 Vi2….Vip.
Recursive enumerable languages : A language is CASE : for pair (A, B)
recursive enumerable if there exists some Turing A: {001, 0011, 11, 101}
machine which accepts it. B: {01, 111, 111, 010}.
Consider it as: A1 = 001, A2 = 0011, A3 = 11 A4 = 101
B1 = 01, B2 = 111, B3 = 111 B4 = 010
Here A3 A4 = B2 B1 or A3 A4 = B3 B1 i.e 11101 = 11101
So pair (A, B) has a PCP solution.
Case 2: Consider pair (C, D)
C = {00, 001, 1000}
D = {0, 11, 011}
There does not exist any such combination of strings
which satisfy the property for PCP solution. So pain (C,
D) does not have PCP solution.
53. Which of the following class of IP address has
51. Consider the following statements: the last address as 223.255.255.255?
S1 :These exists no algorithm for deciding if (a) Class A (b) Class B
any two Turing machines M1 and M2 accept (c) Class C (d) Class D
the same language. Ans. (c) : Class A 0.0.0.0 to 127.255.255.255
S2 :Let M1 and M2 be arbitrary Turing Class B 128.0.0.0 to 191.255.255.255
machines. The problem to determine Class C 192.0.0.0 to 223.255.255.255
L(M1) ⊆ L(M2) is undecidable. Class D 224.0.0.0 to 239.255.255.255
Which of the statement is (are) correct? Class E 240.0.0.0 to 255.255.255.255
(a) Only S1 So Class of IP address 223.255.255.255 is belongs to
(b) Only S2 class C.
(c) Both S1 and S2 54. Consider a subnet with 720 routers. If a three-
(d) Neither S1 nor S2 level hierarchy is chosen. with eight clusters,
Ans. (c) : S1 There exists no algorithms for deciding if each containing 9 regions of 10 routers. Then
any Turing machine M1 and M2 accept the same total number of entries in hierarchical table of
language" each router is.
Statement S1 is correct because "Equivalence problem (a) 25 (b) 27
of recursively enumerable languages is undecidable. (c) 53 (d) 72
Hence, No algorithm possible Ans. (a) : In link state and distance vector routing.
S2: "The problem of determining whether a Turing Every router has to save some information about other
machine halts on any input is undecidable". routers. When network size grows, the number of
Statement S2 is correct because subset problem of routers in network increases. Due to this, routers can't
recursively enumerable languages is undecidable. It is handle network traffic efficiently. That's why there
standard "Halting problem of TM". Hence, no algorithm comes a need of hierarchical, routing.
possible. In hierarchical routing, routers are classified in groups
Known as regions in three level hierarchical routing,
52. Let A = {001, 0011,11,101} and network is classified into a number of clusters. Each
B = {01,111,111, 010} . Similarly, Let cluster is made up of number of regions and each region
contain number of routers.
C = {00, 001,1000} and D = {0,11, 011} . Given: number of routers = 720
Which of the following pairs have a post- clusters = 8
correspondence solution? Regions = 9 to 10 routers
(a) Only pair (A,B) Total number of entries in hierarchical table of each
(b) Only Pair(C,D) router = (number of cluster – 1) + (number of region –
(c) Both (A,B) and (C,D) 1) + routers in each region.
(d) Neither (A,B) nor (C,D) = (8 – 1) + (9 – 1) + (10) = 7 + 8 + 10 = 25
Ans. (a) : POST CORRESPONDENCE PROBLEM 55. Piconet is a basic unit of a bluetooth system
(PCP): It defines the un-decidability of strings for the consisting of –––– master node and up to ––––
solution of PCP, we have to check whether there is a active slave nodes.

UGC NET JRF Computer Science Dec. 2019 Paper-II 343 YCT
 Search on TG: @apna_pdf
(a) One, five (b) One, seven supports the proposition Rather than estimating
(c) two, eight (d) one, eight probabilities it uses belief intervals to estimate how
Ans. (b) : Bluetooth is a wireless LAN technology close the evidence is to determining the truth of a
designed to connect devices of different functions. A hypothesis. It allows representation of ignorance about
blue tooth LAN is an ad hoc network which means that support provided by evidence.
the network is formed spontaneously, devices * Belief or possibility is the probability that B is
sometimes called gadgets, find each other and make a provable by the evidence.
network called piconet. * Plausibility is the probability that B is compatible
Bluetooth defines two types of network: piconet with the available evidence.
scatternet * According to Dempster- Shafer theory (Bel A) = 1 –
Bel (¬A)
PICONET→ A Bluetooth network is called, piconet or
small net. A piconet can have up to eight stations one of for example: if there are three groups A, B and C who
which is called primary and rest one secondary's. All did the crime. We may have evidence the group.
the secondary stations synchronize their clocks and C is guilty. We would not want to say the probability of
hopping sequence with the primary. Communication other two groups being guilty is 1. Belie and Disbelief
between primary and secondary can be one to one or are functional opposites.
one to many. A piconet can have a maximum of 7 Dempster- Shafer theory allows to leave relative beliefs
secondaries. unspecified.
56. A network with bandwidth of 10 Mbps can 59. Consider the following statements:
pass only an average of 12,000 frames per S1 :∀xP(x)∨ ∀xQ(x) and ∀xP(x)∨ Q(x) are not
minute with each frame carrying an average of logically equivalent.
10,000 bits. What is the throughput of this S2 :∃xP(x)∧ ∃xQ(x) and ∃xP(x)∧Q(x) are not
network? logically equivalent.
(a) 1,000,000 bps (b) 2,000,000 bps Which of the following statements is/are
(c) 12,000,000 bps (d) 1,200,00,000 bps correct?
Ans. (b) : Throughput is amount of data moved (a) Only S1
successfully from one place to another place i.e 12,000 (b) Only S2
frames per minute. (c) Both S1 and S2
Each frame is carrying 10,000 bits (d) Neither S1 and S2
So 12,000 * 10,000/60 seconds. Ans. (c) : Here we are considering the example to prove
= 2*1000000 bits/seconds that given statements are true:
= 2000000 bps. Let p (x) be the statement that x is an even number and
Let Q (x) be the statement that x is an odd number,
57. The full from of ICANN is
where x denotes the domain of all positive integers.
(a) Internet Corporation for Assigned Name and
Numbers ∴ D = N = natural numbers and
(b) Internet Corporation for Assigned Number p (x) = " x is even"
and Name Q (x) = " x is odd"
(c) Institute of Corporation for Assigned Name First prove that statement, S1 is true
and Numbers ∀xP ( x ) v∀xQ ( x ) and ∀x(p ( x ) vQ ( x ))are not logically
(d) Internet Connection for Assigned Name and equivalent.
Numbers Because here, all positive numbers are not even.
Ans. (a) : ICANN → Internet corporation for assigned So, ( ∀xp ( x ) ) is false and all positive number are not
Names and Numbers.
58. According to Dempster-Shafer theory for odd. So, ( ∀xQ ( x ) ) is false
uncertainty management. So, ∀xp ( x ) v∀xQ ( x ) is false But ∀x ( p ( x ) vQ ( x ) )
(a) Bel (A) +Bel(¬A) ≤ 1
will always be true, because x will always be either
(b) Bel (A) + Bel(¬A) ≥ 1 even or odd.
(c) Bel (A) + Bel(¬A) = 1
Hence, ∀xp ( x ) v∀xQ ( x ) and ∀x ( p ( x ) vQ ( x ) ) are not
(d) Bel (A) + Bel(¬A) = 0
Where Bel(A) denotes Belief of event A. logically equivalent.
Ans. (a) : Dempster:– Shafer theory: It is designed to Now prove that statement, S2 is true → ∃xp(x) ∧ ∃x
deal with the distinction between uncertainty and Q(x) and ∃x (p(x) ∧Q(x)) are not logically equivalent.
ignorance Rather than computing the probability of a Because here, there exist some positive number that is
proposition it computes the probability that evidence even.

UGC NET JRF Computer Science Dec. 2019 Paper-II 344 YCT
 Search on TG: @apna_pdf
So, ∃ x p(x) is true and there exist some positive 61. Consider the following models;
number that is odd. So, ∃ x p (x) is true. M1 :Mamdani model
So, ∃ x p(x) ∧ ∃ x Q(x) is true. But M2 :Takagi-Sugeno-Kang model
∃x ( p ( x ) ∧ Q ( x ) ) and ∃x ( p ( x ) ∧ Q ( x ) ) are not M3 :Kosko's additive model (SAM)
Which of the following option contains
logically equivalent. examples of additive rule model ?
60. Consider the game given below (a) Only M1 and M2 (b) Only M2 and M3
(c) Only M1 and M3 (d) M1,M2 and M3
Ans. (b) : Mamdoni Model: In a Mamdani system,
output of each rule is fuzzy set. These are well suited to
expert system applications where the rules are created
from human expert knowledge. It is a method to create
a control system by synthesizing a set of linguistic
control rules obtained from experienced human
operators.
Takagi-Sugeno-kang Model: This model allows to
Here and represent MIN and MAX nodes construct the system of analysis from a set of example
respectively. The value of the root node of the data. These are used for the approximation of a large
game tree is: class of non linear systems. The degree of relevance of
(a) 14 (b) 17 a linear model is determined by the degree the input
(c) 111 (d) 112 data belong to fuzz subspace associated with the linear
model. This is an example of additive rule model.
Ans. (b) : start from bottom to top:
Kosko's additive model (SAM): It assumes the inputs
1. first it finds the minimum value from the given
are crisp and use the scaling method. It uses addition to
values: combine the conclusion of fuzzy rules and includes the
centroid defuzzification technique.
62. A fuzzy conjunction operators , t(x, z)and a
fuzzy disjunction operator , s(x, y), from a pair
if they satisfy:
t(x, y) = 1 –s(1–x, 1–y)
xy
If t(x, y) = then s(x, y) is given by
( x + y - xy )
x+y x + y − 2xy
(a) (b)
1 − xy 1 − xy
2. At next step, max value is considered.
x + y − xy x + y − xy
(c) (d)
1 − xy 1 + xy
x + y − 2xy
Ans. (b) : s(x, y)→
1 − xy
63. Let Wij represents weight between node i at
layer k and node j at layer (k–1) of a given
multilayer perceptron. The weight updating
using gradient method is given by
∂E
(a) Wij (t + 1) = Wij(t) + α , 0 ≤ α ≤1
and in then last ∂Wij
∂E
(b) Wij (t + 1) = Wij(t) – α , 0 ≤ α ≤1
∂Wij
∂E
(c) Wij (t – 1) = α , 0 ≤ α ≤1
∂Wij
∂E
(d) Wij (t + 1) = – α , 0 ≤ α ≤1
∂Wij
Where α E represents learning rate and Error in
the output respectively.

UGC NET JRF Computer Science Dec. 2019 Paper-II 345 YCT
 Search on TG: @apna_pdf

∂E 66. Consider the following statements:

Ans. (b) : Wij (t + 1) = Wij(t) – α , 0 ≤ α ≤1 S1: If a group (G, *) is of order n, and a∈ ∈ G is
∂Wij
such that am = e for some integer m ≤ n Then m
64. The order of Schema ?10?101? and ???0??1 must divide n.
are –––––and ––––respectively . S2: If a group (G, *) is of even order, then there
(a) 5,3 (b) 5,2 must be an element a∈ G such that a ≠ e and a
(c) 7,5 (d) 8,7 * a =e
Ans. (b) : A schema is a set of binary strings that match Which of the statements is (are ) correct?
the template which is made up of I's, 0's and * s where * (a) Only S1 (b) Only S2
matches with either 0 or 1. The order of schema is the (c) Both S1 and S2 (d) Neither S1 nor S2
number of its fixed bits i.e number of bits that are either Ans. (c) : If a group (G, *) is of order n, and a ∈ G is
0 or 1. such that am = e for some integer m ≤ n, then m must
Explanation: divide n.
Given schema is: ?10? 101? and ??? 0??1 Given statement is correct. As a ∈ G, is such that am = e
CASE 1: for some integer m < = n, then it means it is a subgroup
FOR ? 10? 101?, number of bits that are either 0 or 1 of G and m is the order of a, where order of given group
are 5. is n. By the property of subgroup or Lagrange's
theorem, a order of subgroup divides the order of a
So order of this schema is 5.
group. So, here m must divide n is true.
CASE 2: FOR ???0??1, number of bits that are fixed are S2 If a group (G1*) is of even order, then there must be
2. an element a ∈ G such that a ≠ e and a * a = e
So order of schema is 2. This statement is correct. Consider an example for this:
65. Let the population of chromosomes in genetic consider G is of order 2n. There exist a ∈ G such that
algorithm is represented in terms of binary ap = e and p divides 2n. Let n = p q. So, (an)2 = (apq)2 =
number. The strength of fitness of a ((ap)q)2 = (eq)2 = e.
chromosome in decimal from, x, is given by It means an is an element which satisfy the condition
f (x) and a = ! e. Here, a is nontrivial subgroup of G.
S f(x) = where f(x) = x2
∑ f (x) 67. Consider the following statements with respect
to duality in LPP:
The population given by P where: (A) The final simplex table giving optimal
P = {(01101), (11000), (01000), (10011)} solution of the primal also contains optimal
Te strength of fitness of chromosome (11000) is solution of its dual in itself.
–––––. (B) If either the primal or the dual problem
(a) 24 (b) 576 has a finite optimal solution, then the other
problem also has a finite optimal solution.
(c) 14.4 (d) 49.2
(C) If either problem has an unbounded
Ans. (d) : In this question given that The population of optimum solution, then the other problem
chromosome in genetic algorithm is represent in term of has no feasible solution at all.
binary number. The strength of fitness of chromosome Which of the statements is (are) correct?
in decimal form of x (a) only (A) and (B)
The population is given by p = {01101, (11000), (b) only (A) and (C)
(01000), (10011)} (c) only (B) and (C)
P X-value f(x) = X ∧ 2 (d) (A), (B) and (C)
01101 13 169 Ans. (d) : Duality in Linear programming problem
11000 24 576 (LPP):- It means a linear programming problem has
01000 8 64 another LPP which is derived from it original LPP
10011 19 361 which is derived from it.
SUM 1170 Original LPP is known as primal and derived LPP is
known as DUAL.
s f (x) = f (x)/ ∑ f ( x ) where f(x) = X ∧ 2
Some points about dual LPP.
strength of fitness of chromosome (11000) is = f (1) In final simplex table giving optimal solution of the
(11000)/f (01101) + f (11000) + f (01000) + f (10011) = primal also contains optimal solution of its dual in itself.
576/169+576+64+361 (2) If either the primal or the dual problem has a finite
= 576/1170 = 0.492 optimal solution, then the other problem also has a finite
= 0.492×100 = 49.2 optimal solution.

UGC NET JRF Computer Science Dec. 2019 Paper-II 346 YCT
 Search on TG: @apna_pdf
(3) If either problem has an unbounded optimum (1) 2421 code- It is positive weighted code values in
solution, then the other problem has no feasible solution binary terms for each digit from 0 to 9 are given as:
at all. Decimal Digit 2421code
Example- We have a set of equations as:
0 0000
Maximize z = 10X1 + 20×2
Subject to: 1 0001
3x1 + 4x2 < = 100 2 0010
5x1 + 6x2 < = 150 3 0011
x1, x2 > = 0 4 0100
Dual of this will be:
5 1011
Minimize z = 100y1 + 150y2
Subject to : 3y1 + 4y2 > = 10 6 1100
5y1 + 6y2 > = 20 7 1101
y1, y2 < = 0 8 1110
68. The Reduced Instruction Set Computer (RISC) 9 1111
characteristics are:
(2) Excess-3 code: It is a non-weighted code and self
(A) Single cycle instruction execution
complementary code. It is derived from 8421 code by
(B) Variable length instruction formats
adding 3 to each digit.
(C) Instruments that manipulates operands in
memory Decimal Digit Excess − 3code
(D) Efficient instruction pipeline 0 0011
Choose the correct characteristics from the 1 0100
options given below:
2 0101
(a) (A) and (B)
(b) (B) and (C) 3 0110
(c) (A) and (D) 4 0111
(d) (C) and (D) 5 1000
Ans. (c) : Statement a : (Correct) RISC has pipelined 6 1001
implementations with the goal of executing one
7 1010
instruction per machine cycle.
Statement b : (Incorrect) RISC has fixed length 8 1011
instruction formats. 9 1100
Statement c : (Incorrect) C-RISC can perform only 70. Consider the following statements with respect
register to register arithmetic operations. to approaches to fill area on raster systems:
Statement d : (Correct) D-RISC has efficient (A) To determine the overlap intervals for scan
instruction pipeline therefore, statement a and b are lines that cross the area.
correct.
(B) To start from a given interior position and
69. Which of the following binary codes for paint outward from this point until we
decimal digits are self complementing? encounter the specified boundary
(A) 8421 code conditions.
(B) 2421 code Select the correct answer from the options
(C) excess-3 code given below:
(D) excess-3 gray code (a) (A) only
Choose the correct option: (b) (B) only
(a) (A) and (B) (c) Both (A) and (B)
(b) (B) and (C) (d) Neither (A) nor (B)
(c) (C) and (D) Ans. (c) : In raster scan system, electron beam move
(d) (D) and (A) across the screen one row at a time from top to bottom.
Ans. (b) : A binary coded decimal code in which of the In this electron beam intensity is turned on and off to
combination for the complement of a digit is the produce illumination on the screen.
complement of the combination for that digit. There are two approaches used in area filling on raster
Self-complementing codes are : excess-3 code 2421 systems: one is scan line algorithm and another is seed
cod. fill algorithm.

UGC NET JRF Computer Science Dec. 2019 Paper-II 347 YCT
 Search on TG: @apna_pdf
(1) Scan line algorithm: Determine the overlap Statement (d) : Overloading is a type of polymorphism.
intervals for scan lines that cross the area or scan line. A This statement is correct. Operator is a type of
scan line is a line of pixels that are plotted on display polymorphism in which an operator is overloaded to
device when electron beam scans the display area give a different meaning or user defined meaning. It
horizontally. allows to change the way an operator can work.
(2) Seed fill algorithm: It starts from interior position 72. Which of the following are legal statements in
and point outward from this point until the boundary C programming language?
condition reached. In this a point is selected and then (A) int * P = &44;
four or eight connected approaches is used to fill it. (B) int * P = &r;
71. Which of the following statements are true (C) int P = &a;
regarding C++? (D) int P = a;
(A) Overloading gives the capability to an Choose the correct option:
existing operator to operate on other data (a) (A) and (B)
types. (b) (B) and (C)
(B) Inheritance in object oriented
(c) (B) and (D)
programming provides support to
reusability. (d) (A) and (D)
(C) When object of a derived class is defined Ans. (c) :
first the constructor of derived class is a - Pointer variable P cannot store address of a value
executed then constructor of a base class is which is not assigned to a variable.
executed. b - Pointer variable P can store address of variable r.
(D) Overloading is a type of polymorphism. c - Integer variable P cannot store address of variable a.
Choose the correct option from those given d - Integer variable P can store value of variable a.
below: Hence int*P = & r ; and int P = a; are legal statements in
(a) (A) and (B) only C programming language.
(b) (A), (B) and (C) only 73. Two concurrent executing transactions T1 and
(c) (A), (B) and (D) only T2 are allowed to update same stock item say
(d) (B), (C) and (D) only 'A' in an uncontrolled manner. In such
Ans. (c) : Statement (a) : Overloading gives the scenario, following problems may occur:
capability to an existing operator to operate on other (A) Dirty read problem
data types. (B) Lose update problem
This statement is incorrect. Operator overloading is a (C) Transaction failure
type of polymorphism in which an operator is (D) Inconsistent database state
overloaded to give a different meaning or user defined Which of the following option is correct if
meaning. It allows to change the way an operator can database system has no concurrency module
work. It gives the capability to an existing operator to and allows concurrent execution of above two
operate on other data types. transactions?
Statement (b): Inheritance in object oriented (a) (A), (B) and (C) only
programming provides support to reusability. (b) (C) and (D) only
This statement is correct. When a class acquires the (c) (A) and (B) only
properties of another class, this is known as inheritance. (d) (A), (B) and (D) only
The class which acquire the properties and method is
Ans. (d) : Problem & that can occur during concurrent
known as derived class and other one is parent or base execution of two transactions in an uncontrolled
class. Inheritance another name for reusability. manner.
Statement (c): When object of a derived class is (a) Lost update problem: Lost update problem occurs
defined, first the constructor of derived class is executed when two transactions that access the same database
then constructor of a base class is executed then items have their operations interleaved in a way that
constructor of a base class is executed. makes the value of some database item incorrect.
This statement is incorrect constructor is a special (b) Dirty read Problem: It occurs when a transaction is
member function of class that is automatically executed allowed to retrieve or update a record that has been
or called when objects of that class will be created. As updated by another transaction. Because it has not yet
when object or derived class is defined automatically been committed there is always a possibility that it will
derived class constructor and base class constructor will
never be committed but rather roll back.
execute inside them.
UGC NET JRF Computer Science Dec. 2019 Paper-II 348 YCT
 Search on TG: @apna_pdf
(c) Inconsistent database state: It occurs when a else partition X into four (N/2) × (N/2) sub
transaction reads several values but a second transaction matrices X11,Y12,Y21,Y22
updates some of these values during the execution of spawn p Trans (X11,Y11,N/2)
first. This causes an inconsistency. spawn p Trans (X12,Y12,N/2)
For example: If one transaction is calculating an spawn p Trans (X21,Y21,N/2)
aggregate summary function on a number of records spawn p Trans (X22,Y22,N/2)
while other transactions are updating some of records. What is the asymptotic parallelism of the
74. Identify the circumstances under which pre- algorithm?
emptive CPU scheduling is used: (a) T1/T∞ or θ(N2/lgN)
(A) A process switches from Running state to (b) T1/T∞ or θ(N/lgN)
Ready state (c) T2/T∞ or θ(lg N/N2)
(B) A process switches from Waiting state to
(d) T1/T∞ or θ(lg N/N)
Ready state
Ans. (a) : During transpose of the matrix, it is
(C) A process completes its execution
partitioned into 4 submatrix of size N/2.
(D) A process switches from Ready to Waiting
If n = 1, then T(1) = 1
state
Else T1(n) = 4T1(N/2) + O(1) ....(i)
Choose the correct option:
sowing equation 1 by master's theorem:
(a) (A) and (B)
\({n ∧ {log b ∧ a}} = \;{n ∧ {log 2 ∧ 4}} = {n ∧ 2}\),
(b) (A) and (D)
here a = 4 and b = 2
(c) (C) and (D)
so T1(n) = O(N2)
(d) (A), (B), (C) only
But algorithm is multithreaded and transpose is going in
Ans. (a) : To understand pre-emptive scheduling we parallel and we solved one sub problem already.
first need to understand the process state diagram. So, Tn(N) = Tn(N/2) + O(1)
Tn(N) becomes O(logN)
asymptotic parallelism of the algorithm
T1/T∞ or θ (N2/logN)
76. Consider the following statements:
(A) The running time of dynamic
programming algorithm is always θ(ρ)
where ρ is number of sub problems.
(B) When a recurrence relation has cyclic
dependency. It is impossible to use that
recurrence relation (unmodified) in a
correct dynamic program.
Scheduling is performed from when the process is taken (C) For a dynamic programming algorithm
from ready state on to the running state. computing all values in a bottom-up
Hence CPU scheduling decisions take place under one fashion is asymptotically faster than using
of four conditions. recursion and memorization.
(1) Process switch from running state to waiting state. (D) If a problem X can be reduced to a known
(2) Process switch from running state to Ready State. NP hard problem then X must be NP hard.
(3) Process switch from waiting state to ready state Which of the statement(s) is (are) true?
(statement b) (a) Only (B) and (A)
(4) Process termination. (b) Only (B)
Statement C- No need for preemptive scheduling as (c) Only (B) and (C)
execution is complete. (d) Only (B) and (D)
Statement D- Process cannot switch from Ready state Ans. (b) : (a) The running time of dynamic
to waiting state. programming algorithm is always θ
75. The following multithreaded algorithm (ρ) where P is number of sub problems.
computes transpose of a matrix in parallel: This statement is incorrect running time for dynamic
p Trans (X, Y, N) algorithms is the number of sub-problems multiplies
if N = 1 with time for each sub-problem. It means running time
then Y[1, 1] ← X [1, 1] of dynamic programming algorithms is O(1).

UGC NET JRF Computer Science Dec. 2019 Paper-II 349 YCT
 Search on TG: @apna_pdf
(b) When a recurrence relation has cyclic dependency it (B) Google App Engine is an integrated set of
is impossible to use that recurrence relation online services for consumers to
(unmodified) in a correct dynamic program. communicate and share with others.
Cyclic dependency is relation between two or more (C) Amazon Cloud Front is a web service for
modules which depends on each other indirectly or content delivery.
directly, these are mutually recursive. So, given Which of the statements is (are) correct?
statement is correct. (a) Only (A) and (B)
(c) For a dynamic programming algorithms, computing (b) Only (A) and (C)
all values in a bottom up fashion is asymptotically faster (c) Only (B) and (C)
than using recursion and memorization. (d) (A), (B) and (C)
This statement is incorrect for a dynamic programming Ans. (b) : (a) Window Azure is a cloud-based operating
algorithm, computing all values using recursion and system.
memorization takes less time than computing in bottom This statement is correct. Windows Azure is a cloud
up fashion. based operating system which enables running of
(d) If a problem X can be reduced to known NP-hard business applications, services and work load in the
problem, then X must be NP hard. cloud itself. It mainly deals with the foundation of
If a problem X can be reduced to a known NP hard running applications and keeping the data on the cloud.
problem, then X must be NP complete not NP hard. (b) Google App Engine- is an integrated set of online
So given statement is incorrect. services for consumers to communicate and share with
77. Consider the following statements: others. Google app engine is PaaS(platform as a
(A) Fiber optic cable is much lighter than service) product. It provides web developing services to
copper cable developers. Apps must be written in Java or python. So
this statement is incorrect.
(B) Fiber optic cable is not affected by power
(c) Amazon Cloud Front- is a web service content
surges or electromagnetic interference.
delivery. Amazon cloud front is a fast content delivery
(C) Optical transmission is inherently
network service that securely delivers data, video
bidirectional applications and APIs to customers.Cloud front is
Which of the statements is (are) correct? integrated with AWS global infrastructure and services.
(a) Only (A) and (B) So statement is correct.
(b) Only (A) and (C) 79. Consider the following statements with respect
(c) Only (B) and (C) to network security:
(d) (A), (B) and (C) (A) Message confidentiality means that the
sender and the receiver expect privacy.
Ans. (a) : only (A) and (B) is correct→ (B) Message integrity means that the data
(a) Fiber optic cable is much lighter than copper cable. must arrive at the receiver exactly as they
Given statement is correct. Fiber optic cable transmit were sent.
signal in the form of light pulses. they can transmit data (C) Message authentication means the receiver
at higher speed than copper cables and these are lighter is ensured that the message is coming from
than copper cables. Also fiber optic cable have higher the intended sender.
bandwidth. Which of the statements is (are) correct?
(b) Fiber optic cable is not affected by power surges or (a) Only (A) and (B)
electromagnetic interference. (b) Only (A) and (C)
This statement is correct fiber optic cables are non (c) Only (B) and (C)
metallic and they transmit signal in the form of light (d) (A), (B) and (C)
pulses. that's why they are immune to electromagnetic Ans. (d) : (a) message confidentiality means that the
interference. Integrity of signal is not affected by sender and the receiver expect privacy.
electrical noise. Message confidentiality means that only sender and
(c) Optical transmission is inherently bidirectional. This intended receiver should be able to access the contents
statement is incorrect. Two optical modules are of a message.
connected by single fiber cable which supports Confidentiality gets compromised if an unauthorized
unidirectional communication for bidirectional person is able to access a message. It means sender and
communication, two cables will be required. receiver expect privacy.
78. Consider the following statements: (b) Message integrity means that the data must arrive at
(A) Windows Azure is a cloud based operating the receiver exactly as they were sent.
system When the contents of a message are changed after the
sender sends it, but before it reaches the intended
UGC NET JRF Computer Science Dec. 2019 Paper-II 350 YCT
 Search on TG: @apna_pdf
recipient, we say that the integrity of the message is Ans.(*): LEARNING ALGORITHM:- These
lost. It means that the data must arrive at the receiver algorithms are used in machine learning to help
exactly as they were sent. technology in human learning process. It is used to
(c) Message authentication means the receiver is process data to extract patterns appropriate for
ensured that the message is coming from the intended application in a new system.
sender. From above given options, only (A) and (B) are
Authentication mechanisms help establish proof of learning algorithms.
identities. The authentication process ensures that the (a) Logistic regression: It is used for binary
origin of an electronic message or document is correctly classification problems. It is used to examine and
identified. It means that receiver is ensured that the describe the relationship between a binary variable and
message is coming from the intended sender. set of predicator variables. The primary objective of
80. Consider the following: logistic regression is to model the mean of the response
(A) Trapping at local maxima variables, given a set or predicator variables.
(B) Reaching a plateau (b) Back Propagation:- It is the essence of neural net
(C) Traversal along the ridge training. It is the method of fine tuning the weights of a
neural net based on the error rate obtained in the
Which of the following option represents
previous iteration. It is a standard method of training
shortcomings of the hill climbing algorithm? artificial neural network.
(a) (A) and (B) only
82. Match List-I and List-II
(b) (A) and (C) only
List-I List-II
(c) (B) and (C) only
A. Physical 1. Provide token
(d) (A), (B) and (C) layer management
Ans. (d) : HILL CLIMBING ALGORITHM:- In hill service
climbing algorithm at each point in the search path a B. Transport 2. Concerned with
successor node that appears to lead most quickly to the layer transmitting raw
top of the hill or goal is selected for exploration. bits over a
In this method of searching, the generate and test communication
method is augmented by a heuristic foundation which channel
measures the closeness of the current state to the goal C. Session layer 3. Concerned with
state. the syntax and
semantics of the
Explanation:- Problems in hill claiming are:
information
(1) Local maximum: It is a state which is better than of transmitted
its neighbors but is not better than some other states D. Presentation 4. True end-to-end
which are farther away. Solution of this problem is layer layer from source
backtracking. to destination
(2) Plateau: It is a that area of search space in which a Choose the correct option from those given
whole set of neighboring states have the same value. On below:
a plateau, it is not possible to determine the best (a) A-3, B-4, C-3, D-1
direction in which to move. (b) A-4, B-3, C-2, D-1
(3) Ridge:- It is an area of search space which is higher (c) A-2, B-4, C-1, D-3
them the surrounding areas and that itself has a slope. (d) A-4, B-2, C-1, D-3
81. Consider the following learning algorithms:
(A) Logistic repression Ans. (c) :
(B) Back propagation List-I List-II
(C) Linear repression A. Physical layer 2. Concerned with
transmitting raw
Which of the following option represents
bits over a
classification algorithms? communication
(a) (A) and (B) only channel
(b) (A) and (C) only B. Transport layer 4. True end-to-end
(c) (B) and (C) only layer from
(d) (A), (B) and (C) source to
destination

UGC NET JRF Computer Science Dec. 2019 Paper-II 351 YCT
 Search on TG: @apna_pdf
C. Session layer 1. Provide token 84. Match the Agile Process models with the task
management performed during the model:
service List-I List-II
D. Presentation layer 3. Concerned with A. Scrum 1. CRC cards
the syntax and
semantics of the B. Adaptive 2. Sprint backlog
information software
transmitted development
83. According to the ISO-9126 Standard Quality C. Extreme 3. <action> the
Model. Match the attributes given in List-I programming <result>
with their definition in List-II: <by/for/of/to>
List-I List-II a(n) <object>
A. Functionality 1. Relationship D. Feature- 4. Time box
between level of driven release plan
performance development
and amount of Choose the correct option from those given
resources below:
B. Reliability 2. Characteristics (a) A-2, B-4, C-1, D-3
related with (b) A-1, B-3, C-2, D-4
achievement of (c) A-2, B-1, C-4, D-3
purpose (d) A-1, B-4, C-2, D-3
C. Efficiency 3. Effort needed to Ans. (a) :
make for
List-I List-II
improvement
A. Scrum 2. Sprint backlog
D. Maintainability 4. Capability of
software to B. Adaptive software 4. Time box release
maintain development plan
performance of C. Extreme 1. CRC cards
software programming
Choose the correct option from the ones given D. Feature-driven 3. <action> the
below: development <result>
(a) A-1, B-2, C-3, D-4 <by/for/of/to> a(n)
(b) A-2, B-1, C-4, D-3 <object>
(c) A-2, B-4, C-1, D-3 85. Match List-I with List-II
(d) A-1, B-2, C-4, D-3 List-I List-II
Ans. (c) : A. Frame 1. to create link in
List-I List-II attribute HTML
A. Functionality 2. Characteristics B. <tr>tag 2. for vertical
related with alignment of
achievement of content in cell
purpose
C. Valign 3. to enclose each
B. Reliability 4. Capability of attribute row in table
software to maintain
performance of D. <a>tag 4. to specify the side
software of the table
frame that
C. Efficiency 1. Relationship
display border
between level of
performance and Choose the correct option from those given
amount of resources below:
D. Maintainability 3. Effort needed to (a) A-1, B-2, C-3, D-4
make for (b) A-2, B-1, C-3, D-4
improvement (c) A-4, B-3, C-2, D-1
(d) A-3, B-4, C-2, D-1

UGC NET JRF Computer Science Dec. 2019 Paper-II 352 YCT
 Search on TG: @apna_pdf
Ans. (c) : communication
List-I List-II units
A. Frame attribute 4. to specify the side of D. Asynchronous 4. resolve the
the table frame that data transfer differences in
display border central computer
B. <tr>tag 3. to enclose each row and peripherals
in table Choose the correct option from those given
C. Valign attribute 2. for vertical alignment below:
of content in cell (a) A-2, B-3, C-4, D-1
D. <a>tag 1. to create link in (b) A-1, B-2, C-3, D-4
HTML (c) A-2, B-1, C-4, D-3
86. An Instruction is stored at location 500 with its (d) A-1, B-2, C-4, D-3
address field at location 501. The address field Ans. (c) :
has the value 400. A processor register R1 List-I List-II
contains the number 200. Match the addressing A. Isolated I/O 2. separate
mode (List-I), given below with effective instructions for I/O
address (List-II) for the given instruction: and memory
List-I List-II communication
A. Direct 1. 200 B. Memory mapped 1. same set of control
B. Register indirect 2. 902 I/O signal for I/O and
C. Index with R1 as 3. 400 memory
the index register communication
D. Relative 4. 600 C. I/O interface 4. resolve the
differences in
Choose the correct option from those given
below: central computer
and peripherals
(a) A-3, B-1, C-4, D-2
(b) A-1, B-2, C-3, D-4 D. Asynchronous 3. requires control
data transfer signals to be
(c) A-4, B-2, C-3, D-1
transmitted between
(d) A-4, B-3, C-2, D-1
the communication
Ans. (a) : units
List-I List-II 88. Match List-I with List-II:
A. Direct 3. 400
B. Register indirect 1. 200 List-I List-II
C. Index with R1 as 4. 600 A. Micro 1. Specify micro
the index register operation operations
D. Relative 2. 902 B. Micro 2. Improve CPU
programmed utilization
87. Match List-I and List-II
control unit
List-I List-II
C. Interrupts 3. Control Memory
A. Isolated I/O 1. same set of
D. Micro 4. Elementary
control signal for
instruction operation
I/O and memory
performed on
communication
data stored in
B. Memory 2. separate registers
mapped I/O instructions for
I/O and memory Choose the correct option from those given
communication below:
(a) A-4, B-3, C-2, D-1
C. I/O interface 3. requires control
(b) A-4, B-3, C-1, D-2
signals to be
transmitted (c) A-3, B-4, C-1, D-2
between the (d) A-3, B-4, C-2, D-1

UGC NET JRF Computer Science Dec. 2019 Paper-II 353 YCT
 Search on TG: @apna_pdf
Ans. (a) : (4) At the end, weather information system get the
List-I List-II weather information.
A. Micro operation 4. Elementary So increasing order of lifeline of objects in the system
operation will be same as objects similar or larger distance from
performed on data weather data, in the way reply is gone through. So it
stored in registers will be.
B. Micro programmed 3. Control Memory Weather data → Comms link → Weather station → Sat
control unit Comms.
C. Interrupts 2. Improve CPU 90. The Data Encryption Standard (DES) has a
utilization function consists of four steps. Which of the
D. Micro instruction 1. Specify micro following is correct order of these four steps?
operations (a) an expansion permutation. S-boxes an XOR
89. operation a straight permutation
(b) an expansion permutation an XOR operation
S-boxes a straight permutation
(c) a straight permutation S-boxes an XOR
operation an expansion permutation
(d) a straight permutation an XOR operation, S-
boxes an expansion permutation
Ans. (b) : Data Encryption standard (DES)- Data
encryption standard (DES) is a block cipher that
The sequence diagram given in Figure for the encrypts data in blocks of size 64 bits each. That is 64
Weather Information System takes place. bits of plain text goes input to the DES which produces
When an external system requests the 64 bit of cipher text key length is 56bits.
summarized data from the weather station. Explanation:
The me easing order of lifeline for the objects Broad level steps of DES are:
in the system are:
• In first step 64 bit plain text block is handed over to
(a) Sats Comm → Weather station → initial permutation.
Commslink → Weather data
• Next initial permutation (IP) produces two halves of
(b) Sats comms → Comms link → Weather permuted block, say left plain text and right plain text.
station → Weather data
• Now each LPT and RPT go through 16 rounds of
(c) Weather data → Comms link → Weather encryption process each with its own key.
station → Sat Comms
• At the end, LPT and RPT are rejoined and a final
(d) Weather data → Weather station → Comms permutation is performed on combined block.
link → Sat Comms During expansion permutation, it goes to S-box
Ans. (c) : In this scenario, first connection request is substitution after doing XOR of 48 bit key with 48 bit
established, weather information system is requesting right plain text. S-Box produces the 32 bit output using
for the weather report. substitution technique. A a straight permutation is done.
Request takes place as: These 32 bits are permuted using P-box.
(1) Request will be sent from weather information
system to sat communication.
(2) Sat communication is forwarding that request to
weather station.
(3) Then weather station sends get (summary) request to
communication link.
(4) After that, it will fetch data from weather data.
Reply Process:
(1) As the communication link is nearest to weather
data, first it will get the data.
(2) Then it goes from communication link to weather
station.
(3) Then weather station to sat comm.
Question Numbers : (91 to 95)
UGC NET JRF Computer Science Dec. 2019 Paper-II 354 YCT
 Search on TG: @apna_pdf
Question Label: Comprehension Region 2- Bounded by edges (2.3)-6-8-9-10-(4.5)-(2.3)
A flow graph F with entry node (1) and exit Region 3- Bounded by edges 6-7-9-8-6
node (11) is shown below: The fourth region is infinite or open region Region 4-1-
11
94. How many nodes are there in the longest
independent path?
(a) 6 (b) 7
(c) 8 (d) 9
Ans. (c) : Path 1: 1-11
Path 2: 1-2-3-4-5-10-1-11
Path 3: 1-(2, 3)-6-8-9-10-1-11
91. How many nodes are there in flowgraph F? Path 4: 1-(2, 3)-6-7-9-10-1-11
(a) 9 (b) 10 Each of the above path introduces a new edge and Path
3 and Path 4 one longest independent paths with 8
(c) 11 (d) 12
Node.
Ans. (a): In given graph contains 9 nodes and 11 edges. Note that a path like 1-(2, 3)-4-5-10-1-2-3-6-8-9-10-1-
The nodes are nothing but vertices. Here, In given 11 is not an independent path because it includes
diagram the number of rounds one the nodes. The nodes already specified edges and doesn't exclusively add new
one 1, (2, 3), (4, 5), 6, 7, 8, 9, 10, 11 edges.
Count of total nodes in flow graph F are 9. 95. How many predicate nodes are there and what
92. What is the cyclomatic complexity of flowgraph are their names?
F? (a) Three : (1, (2, 3) , 6)
(a) 2 (b) 3 (b) Three : (1, 4, 6)
(c) 4 (d) 5 (c) Three : ((2, 3) , 6, 10, 11)
Ans. (c) : Cyclomatic complexity of a flow graph is the (d) Four: ((2, 3) , 6, 9, 10)
quantitative measure of the number of linearly Ans. (a) : Predicate node is a node that contains a
independent paths in it. condition. This node has 2 or more outgoing edges from
for calculation of cyclomatic complexity, it is necessary it.
to understand some parameters. In the given graph the nodes with a condition or with 2
1-Region- In out case, there are 4 regions. or more outgoing edges one - 1, 2.3, 6.
2-Edges- In out case, there are 9 nodes. Hence, there are 3 predicates nodes.
3-Nodes- In our case, there is 1 connected component. Question numbers: (146 to 150)
5-Predicates- These are nodes that contain condition in Question Label: Comprehension
our case, there are 3 predicates namely node 1, 2, 3, 6. An organization needs to maintain database
Formula- There are three ways of calculating the having five attributes A, B, C, D, E, These
cyclamate complexity m, attributes are functionally dependent on each
1- m = number of regions other for which functionally dependency set F
2- m = E - N + 2P is given as : F : {A → BC, D → E, BC → D, A
→ D}. Consider a universal relation R(A, B, C,
where
D, E) with functional dependency set F. Also all
E - Number of Edges attributes are simple and take atomic values
N - Number of Nodes only.
P - Number of connected component 96. Minimal cover F' of functional dependency set
m=P+1 F is:
3- where, P = number of predicate nodes (a) F' = {A → B, A → C, BC → D, D → E}
Calculation- (b) F' = {A → BC, B → D, D → E}
using formula 1, m = 4 (c) F' = {A → B, A → C, A → D, D → E}
using formula 2, m = 11–9+2(1) = 4 (d) F' = {A → B, A → C, B → D, C → D, D →
using formula 3, m = 3+1 = 4 E}
93. How many regions are there in flow graph F? Ans. (a) : A canonical cover is simplified and reduced
(a) 2 (b) 3 version of the given set of functional dependencies
(c) 4 (d) 5 minimal canonical cover is a cover for which removed
of any single functional dependency destroys the
Ans. (c) : REGION- region is an area that is bounded covering property.
by edges and cannot be further subdivided. Region can
be finite nature and can also be infinite nature planar Data-
graph can only have one infinite region. The functional dependencies over the universal relation
The graph in the data has 3 finite or closed regions. R(A, B, C, D, E) are
Region 1- Bounded by edge 1-10-1 A → BC = A → B, A → C

UGC NET JRF Computer Science Dec. 2019 Paper-II 355 YCT
 Search on TG: @apna_pdf
D→E Ans. (b) : Normal forms refer to type of functional
BC → D dependencies.
A→D INF- A relation is in 1 NF if it contains an atomic value.
Method- Following are the steps to find the minimal 2NF- A relation will be in 2NF if it is in 1NF and all
cover. non-key attributes are fully functional dependent on the
1- Write all FDs such that RHS of each FD has only one primary key.
attribute. 3NF- A relation will be in 3NF if it is in 2NF and no
transition dependency exists.
A→ B
BCNF- A relation is in BCNF if every functional
A→C
dependency X → Y, X is the super key of the table.
D→E Data
BC → D 1- A is the primary key.
A→D 2- There is no partial dependency in R. Partial
2- Remove transitive FDs and any other FDs where the dependency occurs when a non-prime attribute is
RHS can be driven of LHS of the other FDs. In this functionally dependent on part of a candidate key.
case, A → D is a redundant FD. Hence, R, is in 2NF
Hence the result becomes Explanation- R is in 2NF and not in 3NF because D →
A→B E, BC → D neither have a super key in their LHS nor
A →C do they have a primary key in their RHS.
D→E If it is not in 3NF, it cannot be in BCNF.
BC → D 99. Identify the redundant functional dependency
3- Finding the FDs with 2 attributes in LHS, we get the in F
dependency BC → D. Try to eliminate the attributes (a) BC → D (b) D → E
using closure of both the attribute B and C. (c) A → D (d) A → BC
In this case, it is not possible to remove either B or C Ans. (c) : Dependency A → D is derived from A →
because both have different closures. BC, BC → D. Hence it is transitive and redundant.
Hence, minimal cover is
100. Assume that given table R is decomposed in
A→B two tables
A→C R1(A, B, C) with functional dependency set f1 =
D→E {A → B, A → C} and R2(A, D, E) with FD set
BC → D F2 = {A → D, D → E}.
97. Identify primary key of table R with functional Which of the following option is true w.r.t
dependency set F given decomposition?
(a) BC (b) AD (a) Dependency preservation property is
(c) A (d) AB followed
Ans. (c) : A primary Rey is a special relational database (b) R1 and R2 are both in 2 NF
table column (or combination of columns) designated to (c) R2 is in 2 NF and R3 is in 3 NF
uniquely identify all table records. (d) R1 is in 3 NF and R2 is in 2 NF
Data- In the functional dependency set f of relation R, Ans. (d) : Relation R(A, B, C, D, E) with its functional
the key 'A' is not in the RHS of any FD. dependencies F:(A → BC, D → E, BC → D, A → D}
Explanation:- It A is not in RHS of any FD, it is has been decomposed in two relations.
mandatory to includes it in the set of candidate key. 1- R1(A, B, C) with functional dependency set f1 = {A
Now, to make sure if 'A' alone is the primary key, we → B, A → C}
write its closure. The set of all those attributes which 2- R2(A, D, E) with FD set F2 = {A → D, D → E}
can be functionally determined from an attribute set is Dependency Preservation- In both the relations the
called as a closure of that attribute set. dependency
A+ = {A, B, C, D, E} BC → D cannot be determined.
A derives all the attributes of relation R. Hence, it is the Hence both R1 and R2 are not following dependency
primary key of R. preservation property.
98. Identify the normal form m which relation R Normal Forms:- In R1, A is the candidate key. and the
belong to functional dependency set does not contain any
(a) 1 NF (b) 2 NF transitive partial dependency. Hence the set is in 3NF.
(c) 3 NF (d) BCNF In R1, A is the candidate key but the FD D → E breaks
the rules of 3NF. Hence, it is in 2NF.

UGC NET JRF Computer Science Dec. 2019 Paper-II 356 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June, 2020

COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. The number of position integers not exceeding Ans. (d) :
100 that are either odd or the square of an Options A:- (p → r)∧(q → r) and ((p∨q) → r)
integer is _____ .
Both are equal and it gives the same truth table.
(a) 63 (b) 59
Hence it is logically equivalent.
(c) 55 (d) 50
Ans. (c) : By using inclusion exclusion principal Options B:- p ↔ q and (⇁p ↔ ⇁ q)
|A ∪ B| = |A| + |B| – |A ∩ B| (p →q) (q → p) and (> p → q)
r
Number of odd number in the range of (1 – 100) (⇁q→ p) (p + q ) (q + p ) and (p + q ) (q + p )
= 100/2 = 50 (1, 3, 5, 7, ..... 97, 99) = |A|
Both the equal and it gives the same truth table.
Number of squares = 10
(1, 4, 9, 16, 25, 36, 49, 81, 100) = |B| Options C:- ((p ∧ q) ∨ ( ¬ p → q)) and p ↔ q
Number of odd number and square = 5 hence logically equivalent.
(1, 9, 25, 49, 81) = |A ∩ B| Options D:- ((p∧q → r)) and ((p → r) ∧ (q → r))
Number of positive integers not exceeding 100 that are P Q R ¬ P ¬ Q P⇒Q Q⇒R (P⇒R)∩(Q
either odd or the square = |A ∪B| = 50 + 10 – 5 = 55 ⇒R)
2. How many ways are there to pack six copies of T T T F F T T T
the same book into four identical boxes. Where
a box can contain as many as six books? T T F F F F F F
(a) 4 T F T F T T T T
(b) 6 T F F F T F T F
(c) 7 F T T T F T T T
(d) 9
F T F T F T F F
Ans. (d) : Here there are six copies of the same book
into four. F F T T T T T T
Identical boxes (Same box). We will enumerate all F F F T T T T T
ways to pack the books for each way to pack the books The above truth table is not equivalent.
we will list the number of books in the box with the Hence the above statement is true, logically not
largest numbers of books, followed by the numbers of equivalent.
books in each box containing at least one book, in order
Hence, the correct answer option d.
to decreasing the number of books in a box.
6, 0, 0, 0 4. Consider the following linear programming
5, 1, 0, 0 (LP):
4, 2, 0, 0 Max, z = 2x1 + 3x2
4, 1, 1, 0 Such that 2x1 + x2 ≤ 4
3, 3, 0, 0 x1 + 2x2 ≤ 5
3, 2, 1, 0 x1,x2 ≥ 0
3, 1, 1, 1
The optimum value of the LP is
2, 2, 2, 0
(a) 23
2, 2, 1, 1
(b) 9.5
So, the number of way is 9.
(c) 13
3. Which of the following pairs of propositions
are not logically equivalent? (d) 8
(a) (p → r)∧(q → r) and (p∨q) → r) Ans. (d) : Max z = 2x1 + 3x2
(b) p ↔ q and (– p ↔ – q) 2x1 + x2 ≤ 4
(c) ((p∧q) ∨ (– p ∧ –q)) and p ↔ q x1 + 2x2 ≤ 5 x1,x2 ≥ 0
(d) ((p∧q → r)) and ((p → r) ∧ (q → r)) Graphical method;

UGC NET JRF Computer Science June 2020 Paper-II 357 YCT
 Search on TG: @apna_pdf
n
210 CLA Clean accumulator (set to
0)
211 ADD 217 Add contents of location
217, 1234 H to accumulator
212 INC Increment accumulator by 1
so accumulator contain
Draw lines by removing in equality z at 1234 H
(1, 2) = 2 + 6 = 8 213 STA 217 Store this value 1235 H at
location 217
z at (2, 0) = 4 + 0 = 4
214 LDA 218 Load accumulator with the
z at (0, 5/2) = 0 + 15/2 = 7.5 = 8 Ans.
content of 218. So
5. Consider a machine with a byte addressable accumulator now has
main memory of 216 bytes and block size of 8 9CE2H
bytes. Assume that a direct mapped cache 215 CMA Complement (1's
consisting of 32 lines used with this machine. complement) accumulator,
How many bits will be there in Tag, line and so accumulator now have
word field of format of main memory 631 DH
addresses. 216 AND 217 perform bitwise AND
(a) 8, 5, 3 operation with the content
(b) 8, 6, 2 of 217
(c) 7, 5, 4 217 1234 H
(d) 7, 6, 3 218 9CE2H
Ans. (a) : Main memory size = 2 bytes no of blocks in ⇒ (9CE2)16 = (1001 1100 1110 0010)2
16

main memory(m) = 216 ÷ 23 1's complement of (9CE2)16

Block size(p) = 23 bytes = (0110 0011 0001 1101)2 = (631 D)16
5
No of block in cache memory (N) = 2 bytes (631 D)16 and(1235)16 = (0215)16
Tag = 28 = Tag bits = log2(M/N) Hence the correct answer is 0215 H
5 7. A non-pipeline system takes 50ns to process a
Line or cache block = 2 = cache block bits = log2N
3
word field or word off set 2 = word task. The same task can be processed in six
segment pipeline with a clockcycle of 10ns.
offset bits = log2P
Determine approximately the speedup ration of
Hence, the correct answer is (8, 5, 3). the pipeline for 0 tasks.
6. The following program is stored in memory (a) 6 (b) 4.95
unit of the basic computer. What is the content (c) 5.7 (d) 5.5
of the accumulator after the execution of Ans. (b) : Time for non - pipelined execution per task =
program? (All location numbers listed below tn = 50 ns
are in hexadecimal) time for pipelined execution per task = tp = 10 ns
Location Instruction number of stages in the pipeline = K = 6
210 CLA number of takes = 500
211 ADD 217 Calculation :- time for non pipelined = Tn = 50×500
212 INC Time for pipelined = Tp = 1×6×10 + (500 – 1) × 10
213 STA 217 T
Speed up factor = S = n = 4.95
214 LDA 218 Tp
215 CMA 8. What is the radix of the numbers if the solution
216 AND 217 to the quadratic equation x2 - 10x + 26 = 0 is x
217 1234 H = 4 and x = 7 ?
218 9CE2H (a) 8
(a) 1002H (b) 2011H (b) 9
(c) 2022H (d) 0215H
(c) 10
Ans. (d) : (d) 11
Location Instructio Execution of program
Ans. (d) : If one solve the quadratic equation,
UGC NET JRF Computer Science June 2020 Paper-II 358 YCT
 Search on TG: @apna_pdf
ax2 + bx + c, then the sum of root of quadrate • An image map is made up of an image with clickable
equation = – b areas, When you click on the image it will open to a
a new or previously selected destination.
Quadratic equation x2 – 10x + 26 = 0 11. Suppose you are compiling on machine with 1-
Since 4 and 7 are the root of the equation byte chars, 2-byt shorts, 4-byte ints and 8-byte
–b =
(10 ) r = (4)r + (7)r doubles and with alignment rules that require
a (1)r the address of every primitive date element to
be an integer multiple of the element's size.
r = 4 + 7 = 11
Suppose further that the compiler is not
9. Consider the following pseudo-code fragment, permitted to reorder fields padding is used to
where a and b are integer variables that have ensure alignment. How much space will be
been initialized.
consumed by the following array.
/*Pre-conditions : (a > 1 ∧ a < b) */ struct {
/*Assume that overflow never occurs */ short s;
int x = 0; int p = 1;
char c;
while (p < b) {
short t;
p = p * a;
char d;
x = x + 1;
double r;
}
int i;
When the while loop terminates, what will be
} A[10]; /*10-element array of structs*/.
the value of x is terms of a and b ?
(a) 150 bytes (b) 320 bytes
(a) ab
a (c) 240 bytes (d) 200 bytes
(b) b
Ans. (c) : Padding it save are CPU cycle.
(c)  log ab  */   means floor */
given data Assume: → CPU cycle 8 byte
 
(d)  log a  /*   means ceil */
b

Ans. (d) : Since a > 1 and a < b

int x = 0, int p = 1
Let us assume q = 2 and b = 15
Whenever the 100 p is entered the value of P is.
doubles and the value of x incremented by 1.
in iteration 1 : P = 2, x = 1
⇒ 8 ×3 = 24
in iteration 2 : P = 4, x = 2
Array of size = 10 ⇒ 24×10 = 240 Ans
in iteration 3 : P = 8, x = 13
in iteration 4 : P = 16, x = 4 Data type 32 - bit(4 bytes) 64 - bit(8 bytes)
final values are a = 2, b = 15, p = 16, x = 4. Char 1 1
Form the above value if can be seen that x =  log ab  Short 2 2
10. In HTML <map> tag is used for Int 4 4
(a) defining a path between two nodes in an Floot 4 4
image Double 8 8
(b) defining clickable region in an image Pointer 4 8
(c) highlighting an area in an image
(d) defining the site amp of a web-site 12. Consider the following recursive Java function
f that takes two long arguments and returns a
Ans. (b) :
float value :
• The <map> tag is used to define an image map. An
public static float f (long m, long n) {
Image map is an image with clickable areas.
float result = (float)m /(float)m;
• The required name attribute of the <map> element is
if (m < 0|||| n < 0) return 0,0f;
associated with the <img>'s use map attribute and
creates a relationship b/w the image and the map. else result – = f (m * 2, n * 3);
return result;
}
UGC NET JRF Computer Science June 2020 Paper-II 359 YCT
 Search on TG: @apna_pdf
Which of the following real values best Ans. (d) :
approximates the value of f (1, 3)? • Key point :- 3 pages of physical memory mean 3
(a) 0.2 (b) 0.4 frames (So at a time only max 3 pages in frames) 5
(c) 0.6 (d) 0.8 pages of virtual memory mean 5 page.
Ans. (a) : The function f(1, 3) pass the value to m, n • FIFO (First in, first out):- The operating system uses
then the value will type cast to float and result = 0.3333 this algorithm to keep track of all pages in memory in a
(1/3). queue with the oldest page at the top. When a page has
Then it enters into else statement the function result as to be replace the first page in the queue is chosen for
0.2 (2/9). replacement.
Hence, the correct answer is 0.2. Page faults - ABC DABF CDBA
13. The data node and name node in HADOOP are A D D D E E E B B
(a) Worker Node and Master Node respectively
B B A A A C C C A
(b) Master Node and Worker Node respectively
(c) Both Worker Nodes C C C B B B D D D
(d) Both Master Nodes Page Fault = 11
Ans. (a) : The main difference between Name Node and Least Recently used (LRU):- In this algorithm the page
data node in HADOOP is that the Name Node is master will be replace which is the least recently used. Page
node in HADDOP distributed file system (HDFS) that fault = ABCDABECDEBA
manages the file system meta data distributed file A D D D E C C C B B
system that stores the actual data as instructed by the
B B A A A A D D D A
Name Node.
C C C B B B B E E E
14. Consider a relational scheme S = (U, V, W, X,
Y, Z) on which the following functional Page fault = 12
dependencies hold. 16. Consider a disk system having 60 cylinders,
{U →V, VW→X, Y→W,X→U} Disk requests are received by a disk drive for
Which are the candidate keys among following cylinders, 10, 22, 20, 2, 40, 6 and 38 in the
options ? order. Assuming the disk head is currently at
(a) UY, VY cylinder 20, what is the time taken to satisfy all
(b) UY, VY, XY the requests if it takes milliseconds to move
(c) UYZ, VYZ, VWZ from one cylinder to adjacent one and Shortest
(d) UYZ, VYZ, XYZ Seek Time First (SSTF) algorithm is used ?
(a) 240 milliseconds
Ans. (d) : A candidate key is a column or set of
columns in a table that can uniquely identify any data (b) 96 milliseconds
base record without referring to any other data. (c) 120 milliseconds
The following functional dependencies, (d) 112 milliseconds
U → V, VW → X, Y → W, X →U Ans. (c) : Shortest Seek Time First (SSTF) :-
S = (U, V, W, X, Y, Z) SSTF = 22–20+22–10+10–6+6–2+38–2+40–38
Here YZ an independent key, so for every key, the YZ = 2 + 12 + 4 + 4 + 36 + 2
Should their. Hence only option 4 is containing YZ for = 60
all keys. Hence the correct answer is UYZ, VYZ, XYZ.
15. Consider a hypothetical machine with 3 pages
of physical memory, 5 pages of virtual memory,
and <A,B,C,D,A,B,E,A,B,C,D,E,B,A,B> as the
stream of page references by an application. If
P and Q are the number of page faults that the It takes 2 milliseconds to move from one cylinder to
application would incur with FIFO and page adjacent one = 60×2
replacement algorithms respectively, then (P, = 120 milliseconds
Q) = ____ . (Assuming enough space for
storing 3 page frames) 17. Suppose you have a Linux file system where the
(a) (11, 10) block size is 2K bytes, a disk address is 32 bits
and in i-node contains the disk addresses of
(b) (12, 11)
first 12 direct blocks of file, a single indirect
(c) (10, 11) block, and a double indirect block.
(d) (11, 12)

UGC NET JRF Computer Science June 2020 Paper-II 360 YCT
 Search on TG: @apna_pdf
Approximately, what is the largest file that can (d) Preventive maintenance
be represented by an i-node? Ans. (c) : Corrective, adaptive, perfective and
(a) 513 Kbytes preventive maintenance are the four forms of
(b) 513 MBytes maintenance.
(c) 537 Mbytes • Corrective maintenance focuses on resolving issues
(d) 537 KBytes that arises when the programme is in operation.
Ans. (b) : Size of the disk block = 2048 bytes • Adaptive maintenance is concerned with the changes
disk address = 32 bits = 4 bytes made to the software in order to make it adaptable to
2048 new. Environments such a running it on a new operating
Number of addresses per block = = 512 = 29 system.
4
Maximum file size = 12 direct blocks + 1 indirect • The term "perfective maintenance" refers to the
change in the software that occur as a result of adding
Block + 1 double indirect block
new features.
= 12 + 29 + 29 * 29
• Preventive maintenance entails making adjustments to
= 12 + 29 + 218
avoid mistakes from occurring
the size of each block = 211 bytes
21. A company has a choice of two languages L1 to
Maximum size of the file = (12 + 29 + 218)×211 bytes
develop a software for their client. Number of
∴ Maximum size of the file = 5130.236 ≅ 513 MBytes LOC required to develop an application in L2 is
18. Consider a single-level page table system, with thrice the LOC in language L1. are given below
the page table stored in the memory. If the hit to decide which language should be preferred
rate to TLB is 80%, and it takes 15 for development.
nanoseconds to search the TLB and 150 PERAMETER L1 L2
nanoseconds to access the main memory, then
what is the effective memory access time, in Man year needed for LOC/1000 LOC/1000
nanosecond? development
(a) 150 Development Rs. 70000 Rs. 90000
(b) 195 Cost of Maintenance Rs. 100000 Rs. 40000
(c) 205 per year
(d) 175 Total cost of project include cost of
Ans. (b) : TLB hit ratio = p = 0.8 development and maintenance. What is the
TLB access time = 15 nano seconds LOC for L1 for which cost of developing the
software with both language must be same.
memory access time = m = 150 milliseconds
(a) 2000 (b) 6000
Formula : EMAT = P×(t+m) + (1–p) ×(t+m+n)
(c) 3000 (d) 5000
EMAT = 0.8×(15 + 150) + (1 – 0.8) × (15 + 150 + 150)
EMAT = 195 milliseconds. Ans. (c) : The total cost of the project = Total
development + total maintenance cost
19. Which of the following UML diagrams has
Sol. Let P1 be the LOC using L1 and P2 be the LOC
static view ?
using L2.
(a) Collaboration diagram
Total cost of the project using L1 = (P1/1000)×70,000 +
(b) Use-Case diagram
(10×100000) = 70 P1 + 100000
(c) State chart diagram
Total cost of the project using L2 =
(d) Activity diagram
(P2/1000) × 90000 + (10×40000)
Ans. (b) : A use case diagram only depicts the system's = 90P2 + 400000
features while a dynamic model view depicts all Given that P2 = 3×P1
functions and behaviour.
⇒ 70P1 +1000000 = 90P2 + 400000
• A use case diagram in used to represent the dynamic
⇒ 70P1 +1000000 = 270P1 + 400000
behaviour of a system. It encapsulates the system's
functionality by incorporating used cases, actors and ⇒ 200P1 = 600000
their relationships. ⇒ P1 = 3000
20. Modifying the software by restructuring is 22. A Software project was estimated at 864
called Function Point. A six person team will be
(a) Adaptive maintenance assigned to project consisting of a requirement
(b) Corrective maintenance gathering person, one designer, two
programmers and two testers. The salary of the
(c) Perfective maintenance
UGC NET JRF Computer Science June 2020 Paper-II 361 YCT
 Search on TG: @apna_pdf
designer is ` 70000 per month, requirement (c) O(1)
gatherer is ` 50000 per month programmer is (d) O(log2log2n)
` 60000 per month and a tester is ` 60000 per Ans. (a) : The heap's smallest values will always be
month. Average productivity for the team is 12 present on the last level or second last of the heap in a
FP per person month. Which if the following max heap and the time complexity of reaching the last
represents the projected cost of the project? level of the Heap is O(n).
(a) ` 3320000 • It will take O(n) time to traverse all of the elements
(b) ` 4320000 using linear search.
(c) ` 3310000
25. If algorithm A and another algorithm B take
(d) ` 2210000
log2(n) and n microseconds, respectively, to
Ans. (b) : given data functional point = 864
solve a problem, then the largest size n of a
team = 6 persons problem these algorithm can solve,
Average each person (FP) productivity = 12 respectively, in one second are ____ and ____ .
designer month salary = 70000 6
(a) 210 and 106
Programmers month salary = 2×60000
6
tester month salary = 2×60000 (b) 210 and 1012
Requirement gatherer = 50000 6
(c) 210 and 6.106
Projected cost of project = ? 6
total number of months (d) 210 and 6.1012

=
functional point (FP) Ans. (b) : A microsecond is 10–6 seconds.
Team× average each person(FP)productivity Hence one seconds = 106 microsecond
864 One hour = 60×60×106 = 3.6×109 microseconds
= 12 months One month = 2.592×1012 microseconds
6×12
One century = 3.1104×1015 microseconds
Total cost of the project = (one designer salary +
2×programmer month salary + 2×tester month salary + f(n) = log n in this case the largest value n
one requirement gatherer) ×total number of months such that log n < = 106
= (70000 + 2×60000 + 2×60000 + 50000) ×12 We rewrite as 2log n < = 2(10)∧6
= 4320000 thus, 21000000 = 2(10)100000 = (103)100000 = 10300000
6

23. A complete 3-ary tree is a tree in which each Hence log2(n) and n in one seconds 210 and 1012.
node has n children or no children. Let I be the 26. Let G be a directed graph whose vertex set is
number of Internal nodes and L be the number the set of numbers from 1 to 100. There is an
of leaves in a complete n-ray tree. If L = 41 and edge from a vertex i to a vertex j if and only if
I = 10. What is the value of n ? either j = i + 1 or j = 3i. the minimum number
(a) 3 of edges in a path in G from vertex 1 to vertex
(b) 4 100 is ________ .
(c) 5 (a) 23 (b) 99
(d) 6 (c) 4 (d) 7
Ans. (c) : If the tree is 3-ary and 'l' is an internal node Ans. (d) : Edge set consists of edges from i to 0j, using
the number of leaves 2l +1. either two conditions are j = i + 1 or j = 3i
• If the tree is 4-ary and 'l ' an internal node, the nunber Second choice helps us to move from 1 to 100. The
of leaves is 4l + 1. trick to slot this is to think the other way around. Try to
of the tree is n-ary and 'l ' is an internal node the number find a 100 to 1 trail instead of having a 1 trail to 100.
of leaves is (n – 1)l + 1. So, the edge sequence with the minimum number of
given that leaves L = 41, internal nodes d = 10 edges is - 1 → 3 → 9 → 10 → 11 → 33 → 99 → 100
L = (n – 1)l + 1 Which consists of 7 edges.
41 = 10(n – 1) + 1 27. Consider L = L1 ∩ L2
10n = 50 Where L2 = {0m 0m 20n1n |m, n ≥ 0}
n=5 L1 = {0m 1n 2k |m, n, k ≥ 0}
24. In a binary max heap containing a number, the Then, the language L is
smallest element can be found in _____ time. (a) Recursively enumerable nut not context free
(a) O(n) (b) Regular
(b) O(log2n) (c) Context free but not regular
UGC NET JRF Computer Science June 2020 Paper-II 362 YCT
 Search on TG: @apna_pdf
(d) Not recursive • In a compiler three address code can be implemented
Ans. (c) : L1 will first contain 0's followed by an equal as records with field for operator and operands. There
number of 1's. After that there will be a single 2. Which are three such representations, quadruples, triples
will again be followed by 0's and an equal number of 1's indirect triples.
i.e. 31. Consider a code with only four valid code
L1 = {2, 012, 00112, 20011, 01201, 0011201, 012001} words 0000000000, 0000011111, 1111100000,
L2 = {Epsilon, 0,1,2,01,12,012,00112, 20011,01201, and 1111111111. This code has distance 5. If
0011201, 0120011, 001120011, ..............} the code word arrived is 0000000111 then the
L = L1 ∩ L2 = {2, 012, 00112, 0001112, ...........} original code word must be ____ .
L = L1 ∩ L2 = {0m 1m2/m > = 0}, Which is a context (a) 0000011111
free language but not regular language. (b) 0000000000
28. Let L1 and L2 be language over ∑ = {a, b} (c) 1111100000
represented by the regular expressions (a* + b)* (d) 1111111111
and (a + b)* respectively.
Ans. (a) : Arrange one below the other the XOR
Which of the following is true with respect to
operations.
the two languages?
for correcting the d-bit error hamming distance should
(a) L1 ⊂ L2 (b) L2 ⊂ L1
be 2d + 1.
(c) L1 = L2 (d) L1 ∩ L2 = φ
* So, 2d + 1 = 5
Ans. (c) : (a + b) is a universal set Grammar which can
d = 2. It means the hamming distance b/w the code
generate all strings over all possible alphabet "a" and
word 0000000111 and given options should be 2-bits
"b"
only options 1 match.
(a* + b)* = a* can generate epsilon and remaining part is
like 32. Using 'RSA' public key cryptosystem. if P = 3,
(a + b)* q = 11 and d = 7, find the value of a and energy
(a* + b)* = (a + b*)* = (a* b*)* = (a* + b*)* the number '19'.
= a* (ba*)* = b* (ab*)* = (a + b)* (a) 20, 19
all grammars are equal- (b) 33, 11
Hence the correct answer is L1 = L2 (c) 3, 25
29. Which of the following statements is true ? (d) 77, 28
(a) The union of two context free languages in Ans. (c) : P = 3, q = 11 and d = 1
context free. φ(n) = (p – 1)×(q – 1)
(b) The intersection of two context free language n = p×q
is context free. n = 3×11 = 33
(c) The complement of a context free language is
φ(n) = (3 – 1)×(11 – 1) = 20
context free.
(d) If a language is context free, it can always be e ×7 modφ(n) = 1
accepted by a deterministic pushdown Option -3
automaton. if e = 3, 7 × 3 mod 20 = 1
Ans. (a) : Context free language is closed under, union Encrypt key Me mod n = c
concatenation and Kleen closure. But not closed under c = 193 mod 33
complementation and intersection. c = 28
• If a language is context free it can be either ∴ Hence answer is (3, 28)
deterministic or non-deterministic language only
33. Protocals in which the sender sends one frame
deterministic language are accepted by the deterministic
and then waits for an acknowledgment before
pushdown automation.
proceeding for next frame are called as ___ .
30. Which of the following is not an intermediate
(a) Simplex protocols
code form?
(b) Unrestricted simplex protocols
(a) Syntax trees (b) Three address codes
(c) Quadrupules (d) Post fix Notation (c) Simplex stop and wait protocols
(d) Restricted simplex protocols
Ans. (c) : Intermediate code can be represented in three
forms, which are post fix notation syntax tree, three Ans. (c) :
address code.

UGC NET JRF Computer Science June 2020 Paper-II 363 YCT
 Search on TG: @apna_pdf
Ans. (d) : Every all program has to do the process of
searching for the solution steps that are not explicit in
nature.
• Knowledge plays a vital role in intelligence as well as
creating artificial intelligence.
• Hence the incorrect statements. it work on or
implements a repetition mechanism.
37. If f(x) = x is my friend and p(x) = x i as perfect,
then correct logical translation of the statement
"some of my friends are not perfect" is _____ .
(a) ∀x(f(x) ∧ ¬ p(x))
(b) ∃x(f(x) ∧ ¬ p(x))
Sender side - (c) ¬(f(x) ∧ ¬ p(x))
Rule-1 Sender sends one data packet at a time. (d) ∃x(¬f(x) ∧¬p(x))
Rule-2 Sender sends the next packet only when it Ans. (b) : f(x) = x is my friend
receives the acknowledgment of the pervious packet. p(x) = x i as perfect,
Receiver side - So, that are asking about some, finally outer most
Rules- 1 Receive and then consume the data packet. parentheses will get.
Rule-2 When the data packet is consumed receiver SOME ∃x.
sends the acknowledgment to the sender. They one given conditions like NOT perfect.
• The idea of stop and wait protocol in the receivers So, we get P(x) the final condition is ∃x(f(x) ∧ ¬ p(x)).
side is also very simple consumed the acknowledgment 38. What king of clauses are available in
is sent this know as a flow control mechanism. conjunctive normal form ?
34. The period of a signal is 100ms. Then the (a) Disjunction of literals
frequency of this signal in kilohertz is _____ . (b) Disjunction of variables
(a) 10 (b) 10–1 (c) Conjunction of literals
–2
(c) 10 (d) 10–3 (d) Conjunctions of variables
Ans. (c) : period = T = 100 ms Ans. (a) : In Boolean logic conjunctive normal or CNF
1 means the product of sums (POS) which clearly states
Frequency =
T that is a product of clauses which in turn are the sum of
1 1 literals.
f= = = 10–1s = 10 H Ex. y' = (A + B)(A' + B)
100 100×10 –3 s
y is in the form of conjunctive normal form it is a
f = 10×10–3 kHz = 10–2 kHz
product of (A + B) and (A' + B) which are sums of A
35. The process of removing details from a given and B, A' and B.
state representation is called _____ .
39. Consider the following properties:
(a) Extraction
A. Reflexive
(b) Mining
B. Antisymmetric
(c) Selection
C. Symmetric
(d) Abstraction
Let A = {a, b, c, d, e, f, g} and R = {(a, a), (b, b),
Ans. (d) : The "process of removing detail" from a (c, d), (c, g), (d, g), (e, e), (f, f), (g, g)} be a
given state representation is called an abstraction. relation of A. Which of the following property
• Abstraction is a type artificial Intelligence problem (properties) is (are) satisfied by the relation R?
formulation and problem solving process. (a) Only A (b) Only C
36. Which of the following is NOT true in problem (c) Both A and B (d) B and Not A
solving in artificial intelligence ? Ans. (d) : If a binary relation R over a set X relates
(a) Implements heuristic search technique every element of x to itself. It is said to be reflexive
(b) Solutions steps are not explicit since (c. e) and (a, d) is not given in the given question
(c) Knowledge is imprecise it is not reflexive.
(d) It works on or implement repetitions • A binary relation is anti symmetric is there is no pair
mechanism of distinct elements of X each of which is related by R
to the other. The given relation R is anti symmetric

UGC NET JRF Computer Science June 2020 Paper-II 364 YCT
 Search on TG: @apna_pdf
because for (c, d), (d, c) is not present in R. Similarly 42. Simplified expression's for following Boolean
for (c, g) and (d, g). function
A binary relation is a type of binary relation An F (A, B, C, D) = ∑(0, 1, 2, 3, 6, 12, 13, 14,
example is the relation is equal to because it a = b is 15)is/are
true then b = a is also true. (A) A'B' + AB A'C'D'
Here since (c, d) is pair in a given relations R for which (B) A'B' + AB + A' CD'
(d, c) is not present in it. So it violates the symmetric (C) A'B' + AB + BC'D'
property of the relation, Hence it is not symmetric. (D) A'B' + AB + BCD'
40. Consider the following argument with premise Choose the correct answer the from the
∀x(P(x) ∨ Q(x)) and conclusion (∀- option's given below.
P(x))∨(∀xQ(x)) (a) (A) only (b) (B) only
(A) ∀x(p(x) ∨ Q(x)) Premise (c) (A) and (B) only (d) (B) and (D) only
(B) P(c) ∨ Q(c) Universal Ans. (d) :
instantiation from F (A, B, C, D) = ∑(0, 1, 2, 3, 6, 12, 13, 14, 15)
(A) Two k-maps can be constructed from the given Boolean
(C) P(c) simplification from function.
(B)
(D) ∀xP(x) Universal
Generalization of
(C)
(E) Q(c) Simplification from
(B)
(F) ∀x Q(x) Universal
Generalization of
(E)
(G) (∀x P(x)) ∧ (∀x Q(x)) Conjunction of (D)
and (F)
(a) This is a valid argument
(b) Steps (C) and (E) are not correct inferences
(c) Steps (D) and (F) are not correct inferences
(d) Step (G) is not a correct inference
Ans. (b) : For C and E to be true should be P(c)∩Q(c).
Hence, this is not a correct inference.
• In predicate logic universal generalization states that
if ... p(x) has been derived then...∀xP(x) can be derived.
41. Which of the following are applications of
symbol table ?
(A) Storage allocation
(B) Checking type compatibility The expression for k-map is AB + A'B' + A' CD'.
(C) Suppressing duplicate error massages The expression for k-map is AB + A'B' + BCD'
Choose the correct answer from the option 43. Which of the following statements with respect
given below to K-segment pipelining are true ?
(a) (A) and (B) only (A) Maximum speedup that a pipeline can
(b) (A) and (C) only provide is k theoretically.
(c) (B) and (C) only (B) It is impossible to achieve maximum
(d) (A), (B) and (C) speedup k in k-segment pipeline.
Ans. (d) : Storage allocation - (C) All segments in pipeline take same time in
• Checking type compatibility. computation.
• Suppressing duplicate error massages. Choose the correct answer from the options
The symbol table is a data structure that contains a given below:
record for each identifier, along with its attribute such (a) (A) and (B) only (b) (B) and (C) only
as type, initial value scope a lifetime. (c) (A) and (C) only (d) (A), (B) and (C)
UGC NET JRF Computer Science June 2020 Paper-II 365 YCT
 Search on TG: @apna_pdf
Ans. (a) : Pipelining :- overlapping execution - 45. Which of the following statements regarding
Parallelism improve performance. The aim of using XML is/are True?
pipelining is to use a single clock per instruction (CPI) (A) XML is a set of tags designed to tell
which automatically improves performance. browsers how to display text and images in
Statement A is true- a web page.
(B) XML defines a syntax, for representing
t data, but the meaning of data varies from
S = n if we assume that the time it takes to process a
tp application, to application.
task is the same in the pipeline and pipelined circuits (C) < Letter>, < LETTER > and < letter > are
will have tn = ktp. three different tags is XML.
Including this assumption the speedup reduces to Choose the correct answer from the options
kt p given below:
S= =k (a) (A) and (B) only (b) (A) and (C) only
tp (c) (B) and (C) only (d) (A), (B) and (C)
Statements B true- k× efficiency = speedup Ans. (c) : • XML was created with the aim of
The speedup cannot be equal to k till efficiency become transporting data with an emphasis on what data is.
1 and in real time environment efficient cannot become • HTML was developed with the intention of presenting
1 of many reasons like the delay at intermediate buffer data with an emphasis on how it appears.
different time taken by different segments to perform Statement B: TRUE:-
their sub-operations which cause all other segments to While XML Specifies a syntax for
waste time while waiting for the next clock. representing the meaning of data varies by application.
Statement C False : Because different segment can take Statements C : TRUE
different times to complete their sub operations. Hence XML is case sensitive and Hence <Letter> , <LETTER>
the correct answer is (A) and (B) only. and < letter> are three different tags in XML
Statement :- A: FALSE:
44. Which of the following statements with respect
HTML is a collection of tags that tell web browsers
to multiprocessor system are true ? How to view text and Images on website.
(A) Multiprocessor system is controlled by one
46. In the context of 3D computer graphics which
operating system. of the following statements is/are correct?
(B) In Multiprocessor system multiple (A) Under perspective, projection, each set of
computers are connected by the means of parallel lines in the object do not stay parallel
communications lines. in the image (except those that are parallel to
(C) Multiprocessor system is classified as the viewplane to start with).
multiple instruction stream and multiple (B) Applying a perspective, transformation in
data stream system. the graphics pipeline to a vertex involves
Choose the correct answer from the options dividing by its 'z' coordinate.
(C) Perspective transformation is a linear
given below:
transformation.
(a) (A) only
Choose the correct answer form the options
(b) (A) and (B) only given below:
(c) (A) and (C) only (a) (A) and (B) only (b) (A) and (C) only
(d) (B) and (C) only (c) (B) and (C) only (d) (A), (B) and (C)
Ans. (c) : A multiprocessor is a computer System Ans. (a) : Under perspective projection, Each set of
having two or more processing units. multiple Parallel Lines in the object do not stay parallel in the
processors each Sharing main memory and Peripherals image. The Lines Converge to the middle of the
in order to Simultaneously Process programs. Projection at a single points. points of Intersection of
Converging line with the screen plane generate the
• multiprocessor System are Controlled by are or more projected Image on the Screen.
operating systems. Hence Statements I is correct. Hence statement I is correct.
• in a multiprocessor system, multiple Processors are • Appling a perspective transformation in the graphics
Connected Under single Computer System. Hence Pipeline to a vertex involves dividing by its' 'z'
Statement II is incorrect. Coordinate.
• Multiprocessor System is classified us multiple Hence statement II is correct.
Instruction streams and multiple data streams system. • perspective transformation is a non- Linear
Hence statement III is correct. transformation.
⇒ Correct option is c (A) and (C) only Hence statement III is incorrect.

UGC NET JRF Computer Science June 2020 Paper-II 366 YCT
 Search on TG: @apna_pdf
47. Concerning phong shading and Gouraud (b) Transaction T1 fails and must change the value of x
shading in a 3D scene, which of the following back to its value, meanwhile, T2 has read the temporary
statements are true? incorrect value of x.
(A) Gouraud shading requires more
T1 T2
computation than phong shading.
(B) Gouraud shading linearly interpolates the read _ item(X); read _ item(X);
color of an interior pixel from the color at the X = X − N; X = X + m;
vertices.
(C) Phong shading interpolates over the normal Write _ item(X);
vectors specified at the vertices.
Choose the correct answer from the options
given below: Write _ item(X);
read _ item (Y)
(a) (A) and (B) only (b) (A) and (C) only
(c) (B) and (C) only (d) (A), (B) and (C) T3 reads X after N is Subtracted and reads Y before N is
Ans. (c) : Statement 1: FALSE:- added a wrong summary is a result (off by N)
Gouraud Shading requires less calculation and this T1 T3
greatly decreases the cost of shading steeply. SUM = 0
Statement - 3 Q True :- Phong Shading Interpolates redd _ item(A)
over the normal vector specified at the vertices. read _ item(X); Sum = Sum + A;
Statement - 2 :- TRUE :- X = X − N;
Gouraud Shading Linearly interpolates the color of an
Write _ item(X);
interior pixel from the color at the vertices the original read _ item(X)
is a linear interpolation of Colour between vertices,
Sum = Sum + X
Specifically.
48. In the context of concurrency control, a given read = item(Y);
pair of operations in a schedule is called SUM = SUM + Y;
read _ item (Y)
conflict schedule if
(A) At least one of the operations is write Y = Y + N;
operation. write _ item(Y);
(B) Both the operations are performed on the
Two function are said to be incompatible if only of the
same data item.
following Conditions are met.
(C) Both the operations are performed by
different transactions. • They are associated with various Transactions.
(D) Both the operations are performed on • They both work with the same data object.
different data items. • One of them must be write operation.
Choose the correct answer from the options • If you note the issues mentioned below, it's because
given below: different transactions have performed at least one write
(a) (A) and (B) only (b)(A), (B) and (C) only operation on the same data object.
(c) (A), (C) and (D) only (d) (C) and (D) only 49. Software reliability is described with respect to
Ans. (b): (A) Execution Time
(a) item X has an incorrect value because its update by (B) Calendar Time
T1 is lost (over written) (C) Clock Time
T1 T2 Choose the correct answer from the options
given below:
read _ item(X); (a) (A) and (B) only (b) (B) and (C) only
X = X − N; (c) (A), (B) and (C) (d) (A) and (C) only
read _ item(X);
Ans. (c): The Execution time of a programme is the
X 2 X + m; time that a processor spends actually executing the
Write _ item(X); programs instructions.
• The second kind of time is calendar time it is the
read _ item (Y)
familiar time that we normally experience.
Write _ item(X);
• Clock time is the normal wall clock time.
Y = Y + N; • and software reliability is described with respect to all
write _ item(Y); these.

UGC NET JRF Computer Science June 2020 Paper-II 367 YCT
 Search on TG: @apna_pdf
50. To create an object-behavioral model, the (C) 0(g(n)) = Ω(g()n)(0 = big 0)
analyst performs the following steps: (D) 0(g(n)) ∩ ω(g(n)) is non-empty set. (o =
(A) Evaluates all use-cases. small o)
(B) Builds state transition diagram for the Choose the correct answer from the options
system. given below:
(C) Reviews the object behaviour model to (a) (A) only (b) (B) only
verify accuracy and consistency. (c) (C) only (d) (D) only
(D) Identifies events that do not derive the
Ans. (a) : (A) its worst - case running time is O(g(n))
interactions sequence.
and its best - case running time is
Choose the correct answer from the options
given below: Ω(g(n)). ( O= big O) → True.
(a) (A), (B) and (C) only Big - oh (O) denotes upper bound or worst case.
(b) (A), (B) and (D) only Big- omega (Ω) denotes lower bound or best case.
(c) (B), (C) and (D) only Big - Theta (θ) denotes Average bound or average case.
(d) (A), (C) and (D) only (B) its worst - case running time is Ω (g(n)) and its best-
Ans. (a): The behavioral model indicates how the case running time is O(g(n)). (O = big O)
Software will respond to external events. To create the false, worst case should be Big-oh and best case should
model. the analyst must perform the following steps be big - omega.
1. Evaluate all use - cases to fully understand the (C) O (g(n)) = Ω (g(n)) (O= big O) False, cannot cover
sequence of interaction within the system Big Omega.
2. Create a sequence for each use - case (D) O (g(n)) ∩ ω(g(n)) is non-empty set (0 = Small O)
3. Build a state diagram for the system. false, no such f(n) Exists, i.e. the inter section is indeed
4. Review the behavioral model to verify accuracy and the Empty set.
Consistency.
53. Consider the following statements:
51. Which of the following is/are behaviroral
(A) Any tree is 2-colorable
testing technique(s) ?
(B) A graph G has no cycles of even length it it
(A) Equivalence partitioning
is bipartite.
(B) Graph Based Testing Method
(C) A graph G is 2-colorable if is bipartite.
(C) Boundary Value Analysis
(D) A graph G can be colored with d+1 color if
(D) Data Flow Testing
d if the maximum degree of any vertex in the
(E) Loop Testing graph G.
Choose the correct answer from the options (E) A graph G can be colored with O(log |v|)
given below: colors if it has O(|v|) edges.
(a) (B) and (D) only
Choose the correct answer from the options
(b) (A), (B) and (C) only given below.
(c) (D) and (E) only (a) (C) and (E) incorrect
(d) (A), (C) and (E) only (b) (B) and (C) incorrect
Ans. (b) : Black- box testing, also known as behavioral (c) (B) and (E) incorrect
testing, focuses on the software's, functional (d) (A) and (D) incorrect
specifications. In other words, black - box testing allows
a software developer to create sets of input conditions Ans. (c): Any tree is 2- Colourable. True every tree is
that completely exercise all of a program's functional no loops and a bipartite graph with chromatic number 2.
requirements. The methods for behavioral testing are as odd levels coloured with one colour and even level
follows. coloured with another colour.
(1) graph -based testing methods • A graph G has no cycles of even length if it is
(2) Equivalence partitioning bipartite. false.
(3) boundary value analysis
(4) Comparison testing
(5) orthogonal array testing
52. The running time of an algorithm is 0(g(n)) if
and only if
(A) its worst-case running time is 0(g(x)) and its • A graph G is 2- Colourable it is bipartite True. A
best case running time is Ω(g(n)).(0 = big 0) graph K (2,3) set of V1 vertices coloured with one
(B) its worst-case running time is Ω(g(n)) and colour and set of V2 vertices Coloured with another
its best-case running time is 0 (g(n)).(0 = big 0) colour.

UGC NET JRF Computer Science June 2020 Paper-II 368 YCT
 Search on TG: @apna_pdf
• A graph G can be colour with d+1 colours if d is the . ⊆L2 D
maximum degree of any vertex in the graph G. True as Subset
the vertex of degree d means it is adjacent to vertices checki
Hence need a d + 1 different colours required. ng
• A graph G can be coloured with O(log|v|) Colours if 5 Empti D D D UD UD UD
it has O |v| degrees. false as kn has O (n ∧ 2) edges with . ness
Chromatic number n So it needs O ( v ) Colours. L1 =φ
6 Disjoi D UD U UD UD UD
54. Which among the following statement is (are) . nt D
true? operat
(A) A hash function takes a massage of or
arbitrary length and generates a fixed length L1 I
code. L2 = φ
(B) A hash function takes a massage if fixed
7 Is L = D UD U UD UD UD
length and generates a code of variable length.
. ∑* D
(C) A hash function may give same hash value
totalit
for distinct massages.
y
Choose the correct answer from the options
given below: 8 Is L D D U UD UD UD
(a) (A) only (b) (B) and (C) only . Regul D
(c) (A) and (C) only (d) (B) only ar
langua
Ans. (c): A Hash function H accepts a variable - length ge
block of data M as input and produces a fixed - size has
value h = H (M) In general terms, the principal object * D = dicidable
of a hash function is data integrity. A change to any bit *UD = undecidable
or bits in m results, with high Probability in a change to According to the above table, rows 3, 4 and 8 it's
the has code. undecidable.
55. Let G1 and G2 be arbitrary context free Hence, the correct answer is (a), (b) and (c).
language and R an arbitrary regular language. 56. Consider the following languages.
Consider the following problems: L1 = { a zzˆ | Ẑ is an integer}
(A) Is L(G1) = L(G1) ?
L2 = { a zzˆ | Ẑ ≥ 0}
(B) Is L(G2) ≤ L(G1) ?
L3 = {ωω ωω | ω∈
ω∈ {a, b}*}
(C) Is L(G1) = R ?
Which of the language is (are) regular?
Which of the problems are undecidable ?
Choose the correct answer from the options
Choose the correct answer from the options
given below : given below:
(a) L1 and L2 only (b) L1 and L3 only
(a) (A) only (b) (B) only
(c) L1 only (d) L2 only
(c) (A) and (B) only (d) (A), (B) and (C)
Ans. (d) : Only the language L2 is regular.
Ans. (d) :
S FA PDA P LBA Recu RE L1 = { a zzˆ | Ẑ is an integer}
r. Reg DCF D CSL rsive LT ∴ L1 = {a1, a4, a27, a256, ........}
n ular L A HT M L2 = { a zzˆ | Ẑ ≥ 0}
o C M
F ∴ L2 = {ε, a11, a22, a33, ..........}
. L L3 = { ωω|ω∈ {a, b}*}
1 Memb D D D D D UD L3 = set of all strings starting and ending with the same
. ership words.
W∈ L Explanation:-
2 Finite D D D UD UD UD L1 does not contain any pattern to form a loop. Hence
. ness- it's not possible to construct a DFA for L1.
L=fini • L2 is a regular language since a DFA can be
te constructed using a loop that after every 11 symbols the
3 Equiv D D U UD UD UD automata reaches the final state.
. alence D in L2, once the word 'ω' is scanned there is no way to
L1=L2 compare the next word with the staring symbol of the
first word.
4 Is L1 D UD U UD UD UD
UGC NET JRF Computer Science June 2020 Paper-II 369 YCT
 Search on TG: @apna_pdf
57. Which of the following grammars in (are) 59. Post Office Protocol (POP) is a massage access
ambiguous ? protocol which is used to extract message for
(A) s → ss |asb|bsa| λ client. In this regard, which of the following are
(B) s → asbs |bsas| λ true ?
(C) s → aAB (A) POP has two modes, Delete mode and keep
A → bBb (B) In Delete mode, mail is deleted from mail
B → A|λ Where λ denotes empty string box after each retrieval.
Choose the correct answer from the options (C) In Delete mode, mail is deleted from mail
given below : box before each retrieval.
(a) (A) and (C) only (b) (B) only (D) In keep mode, mail is deleted before
(c) (B) and (C) only (d) (A) and (B) only retrieval.
Ans. (d) : (E) In keep mode, mail remains in mail box
after retrieval.
• A is ambiguous because λ can be generate using
leftmost derivation having two different parse trees with Choose the correct answer form the option
an empty string. given below:
(a) (A) and (B) only
(b) (A), (D) and (E) only
(c) (A), (B), (C) and (D) only
(d) (A), (B) and (E) only
Ans. (d) : Statement A :- TRUE-
Post office protocol (POP) is a type of computer
• B is ambiguous grammar with string abab. networking and Internet standard protocol that has
modes, delete mode and keep mode.
Statement -B (TRUE)-
S S In delete mode the mail is deleted from the mail box
a b a b S after each retrieval.
S S Statement E:- (TRUE) In keep made, mail remains in a
λ mail box after retrieval.
λ λ Note:- Delete mode (delete after reading) keep mode
• C is an ambiguous grammar with string abbbb. (stores ever after reading).
60. Firewall is a device that filters access to the
protected network from the outside network.
Firewalls can filter the packets on the basis of
(A) Source IP Address
(B) Destination IP Address
(C) TCP Source port
(D) UDP Source port
(E) TCP Destination port
Choose the correct answer from the option
given below:
Hence the correct answer is (A) (B) and (C). (a) (A), (B) and (C) only
58. Which of the following cloud concepts is/are (b) (B) and (E) only
related to pooling and sharing of resources?
(c) (C) and (D) only
(A) Virtual Memory
(d) (A), (B), (C), (D) and (E) only
(B) Service
(C) Virtualization Ans. (d) : Network layer firewall can filter on source
Choose the correct answer from the options and destination IP address source and Destination port
given below: no for both TCP and UDP packet.
(a) (C) only (b) (A) and (B) only • Firewall :- A firewall is a from of cyber security
(c) (A) only (d) (B) only device that filters networks traffic. Network nodes can
Ans. (a) : Virtualization is a technique where multiple be separated from external traffic source, Internal
operating systems run simultanenously on a single traffic sources or even individual applications using
machine virtually. firewall.
These machine can be accessed remotely by different 61. Consider the statements below.
users at the same time. Here, the same hardware like A person who is radical (R) is electable (E) if
memory and CPU are utilized by all the operating he/she conservative (C), but otherwise is not
systems in a systematic manner. electable.
UGC NET JRF Computer Science June 2020 Paper-II 370 YCT
 Search on TG: @apna_pdf
Few probable logical assertions of the above (C) The alpha-beta search algorithm
sentence are given below. computers the same optimal moves as minimax
(A) (R ∧ E) ⇔ C algorithm.
(B) R ⇒ (E ⇔ C) (D) Optimal play in game on imperfect does not
(C) R ⇒ ((C ⇒ E) ∨ – E) reasoning about the current and future belief
states of each players.
(D) (– R ∨ – E) ∨ C) ∧ (– R ∨ – C ∨ E)
Choose the correct from the options given
Which of the above logical assertions are true ? below:
Choose the correct answer form the options (a) (A) and (C) only (b) (A) and (D) only
given below.
(c) (B) and (C) only (d) (C) and (D) only
(a) (B) only (b) (C) only
(c) (A) and (C) only (d) (B) and (D) only Ans. (c) : Statement (B)- The effectiveness of the alpha
beta pruning is highly dependent on the order in which
Ans. (d) : the states are examined.
1. (R ∧E) ⇔ C says that all (and only) conservatives are Yes, it depends on which children are visited first. It's
radical and electable. So this assertion is not true. likely that no pruning happens if a node's children are
2. R ⇒ (E ⇔ C) Say that same as the given assertion. visited in the worst possible order. We want to visit the
this is a correct assertion. best child first for max nodes so that time is not lost on
3. ) R ⇒ ((C ⇒ E) ∨ ⇁ E) = ⇁ R ∨ (⇁ C ∨ E∨ ⇁ E) the other children who are exploring worse scenarious
Which if true for all interpretations. This is not a correct we want to start with the worst child when it comes to
min nodes.
assertion.
Hence statement B is true.
4. (⇁ R ∨ ⇁ E ∨ C) ∧ (⇁ R ∨ ⇁ C ∨ E) = (⇁ R ∨ (E ⇒ Statement C:- The alpha-beta search algorithm
C)) ∧ (> R ∨(C ⇒ E)) = R ⇒ (E ⇔ C) Which is computers the same optimal moves as the minimax
equivalent to assertion b. algorithm.
This is also true. True, it prunes nodes that have no bearing on the final
62. Which of the following statements are true ? outcome.
(A) A sentence α entails another sentence β if 64. Match List with List II
β is true in few worlds where α is true. Let R1 = {(1, 1), (2, 2), (3, 3} and R2 = {(1, 1), (1,
(B) Forward chaining and backward chaining 2), (1, 3), (1, 4}
are very natural reasoning algorthm for List I List II
knowledge bases in Horn form. (A) R1 ∪ R2 (I) {(1, 1), (1, 2), (1, 3),
(C) Sound inference algorithm derive all (1, 4), (2, 2), (3, 3) }
sentences that are entailed. (B) R1 – R2 (II) {(1, 1)}
(D) Propositional logic does not scale to (C) R1 ∩ R2 (III) {(1, 2), (1, 3), (1, 4)}
environments of unbounded size. (D) R2 – R1 (IV) {(2, 2), (3, 3)}
Choose the correct answer from the options Choose the correct answer from the options given
given below: below:
(a) (A) and (B) only (b) (B) and (C) only (a) A-I, B-II, C-IV, D-III
(c) (C) and (D) only (d) (B) and (D) only (b) A-I, B-IV, C-III, D-II
Ans. (d) : (c) A-I, B-III, C-II, D-IV
• (B) For information bases in horn form true, forward (d) A-I, B-IV, C-II, D-III
and backward chaining is rather normal reasoning Ans. (d): R1 ∪ R2 (union) is the relation containing all
algorithms. these are very natural algorithm that run is tuples that appear in R1, R2 or both.
linear time. R1 ∪ R2 = R1 or R2 = R1 + R2 – R1 ∩ R2
• (D) Propositional logic does not scale to unbounded R1 ∪ R2 = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (3, 3)}
conditions. That is right propositional logic is relatively • R1 – R2 (Set difference)- is the relations containing all
efficient for certain tasks within an agent but it does not tuples of R1 that do not appear in R2
scale to unbounded environments because it lacks the
R1 – R2 = R1 – R1 ∩ R2
descriptive capacity to deal concisely with time, space
and universal patterns of object relationship. R1 – R2 = {(2, 2), (3, 3)}
Hence (b) and (d) correct options. • R1 ∩ R2 (Intersection) - is the relation containing all
tuples that appear in both R1 and R2
63. Which of the following statement are true ?
R1 ∩ R2 = R1 and R2 = {1, 1}
(A) Minimax search is breadth first, it
processes all the nodes at a level before moving • R2 – R1 (Set difference)- is the relation containing all
to a node in next level. tuples of R2 that do not appear is R1
(B) The effectiveness of the alpha-beta R2 – R1 = R2 – R1 ∩ R2 = {(1, 2), (1, 3), (1, 4)}
prunning is highly dependent on the order in Hence the correct answer is
which the states are examined. A-I, B-IV, C-II, D-III

UGC NET JRF Computer Science June 2020 Paper-II 371 YCT
 Search on TG: @apna_pdf
65. Match list I with List II C  0.5 –0.866 0 (III)
List I List II  0.866 0.5 0 

A. Handshaking I. I/O interface 
 0 0 1 
inform the CPU
that device is
ready for D 1 2 0 (IV)
transfer 0 1 0
B. Programmed I/O II. requires two  
control signals  0 0 1 
working in Choose the correct answer form the options
opposite give below:
directions
(a) A-IV, B-II, C-III, D-I
C Interrupt III. has local
initiated I/O memory & (b) A-IV, B-III, C-II, D-I
control large set (c) A-III, B-II, C-IV, D-I
of I/O devices (d) A-II, B-IV, C-III, D-I
D I/O processor IV. require CPU to Ans. (d) :
check the I/O
 2 0 0
flag & perform  
transfer  0 2 0  it is the scaling matrix 2 in x and y-direction
Choose the correct answer from the options  0 0 1 
given below:
by a factor.
(a) A-I, B-II, C-III, D-IV
(b) A-II, B-IVI, C-III, D-I Hence, A-II is the correct pair.
(c) A-II, B-IV, C-I, D-III 1 0 2
(d) A-IV, B-III, C-II, D-I  0 1 2  is the translation matrix vector 2 in each
 
Ans. (c) : Hand shaking:- when one computer sends a  0 0 1 
message to another indicating that it wants to create a  
contact channel, it is called Handshaking. It requires direction x and y.
two control signals working in opposite directions. Hence B-IV is the correct pair.
Programmed I/O:- The output of the I/O Instructions  0.5 –0.866 0
written in the computer programme is the trigger. It  0.866 0.5 0 is an angle of 60 degrees rotation
 
requires the CPU to check the I/O flag & perform the  0 0 1 
transfer.
matrix.
* Interrupt - Initiated I/O:- Interrupt powered I/O is a
different way to deal with I/O. Interrupt I/O is a method Hence C-III is the correct pair.
of monitoring Input/output operation by sending a  1 2 0 
signal from a peripheral or terminal that needs to send  0 1 0  is the shear matrix of quantity 2 with only x-
or receive data. I/O interface informs the CPU that the  
device is ready for transfer.  0 0 1 
* I/O processor:- A processor with direct memory shear.
access is know as an input output processor (IOP). The
Hence D-I is the correct pair.
computer system is divided into memory units and
processors in this way. I/O processor has local memory 67. Match List I with List II.
& control a large set of I/O devices. List I List II
66. Match List I with List II, List gives 3×3 (A) (I) Key
matrices representing 2D transformations and attributes
List-II shows the corresponding transformation Type
diagrams.
List I (Matrix) List II (Transformation (B) (II) Weak Entity
Diagram) Type
A  2 0 0 (I) (C) (III) total
0 2 0 Participation
  of Entity in a
 0 0 1  relation
B 1 0 2 (II) (D) (VI) Multivalue
Attribute
0 1 2
  Type
 0 0 1  Choose the correct answer from the options
given below:

UGC NET JRF Computer Science June 2020 Paper-II 372 YCT
 Search on TG: @apna_pdf
(a) A-II, B-IV, C-III, D-I Choose the correct answer form the options
(b) A-IV, B-I, C-II, D-III given below:
(c) A-II, B-I, C-IV, D-III (a) A-I, B-IV, C-III, D-II
(d) A-III, B-IV, C-I, D-II (b) A-I, B-II, C-III, D-IV
Ans.(c):*E-R diagrams and their corresponding (c) A-II, B-I, C-III, D-IV
descriptions. (d) A-II, B-IV, C-III, D-I
A-II, B-I, C-IV, D-III Ans. (a): Branch-and-Bound:- Keeps track of all partial
paths which can be a candidate for further exploration
68. Match List I with List II (Ex: A * search, BFS)
With reference to CMM developed by Software Steepest-accent hill Climbing:- Considers all moves
Engineering Institute (SEI). from the current state and selects the best move (Ex.
List I List II Hill-climbing algorithm)
(A) INITIAL (I) Process Constraint satisfaction discovers problem state (s) that
measurement satisfy a set of constraints Ex (map coloring problem)
(B) REPEATRBLE (II) Process definition Means-end-analysis:- Detects the difference b/w the
(C) DEFINED (III) Project management current state and the goal state Ex (means-end-analysis).
(D) MANAGED (IV) ADHOC 70. Match List I with List II
Choose the correct answer form the options List I List II
given below: (A) Topological sort of DAG (I) O(V +E)
(B) Kruskal's MST algorithm (II) O(VE)
(a) A-III, B-IV, C-II, D-I
(C) Bellman Ford's single (III) θ(V + E)
(b) A-IV, B-III, C-I, D-II
source shortest path
(c) A-IV, B-III, C-II, D-I
algorithm
(d) A-III, B-IV, C-I, D-II
(D) Floyd-Warshsall's all pair (IV) θ(V3)
Ans. (c) : Initial (Chaotic, adhoc, individual heroics):- shortest path algorithm
the stage at which a new or undocumented repeat Choose the correct from the options below:
mechanism may be used. (a) A-I, B-III, C-IV, D-II
Repeatable:- At the very least, the procedure is well (b) A-III, B-I, C-IV, D-II
recorded such that the same steps can be tried again. (c) A-III, B-I, C-II, D-IV
Defined:- As a normal business procedure the process (d) A-I, B-III, C-II, D-IV
has been described and verified. Ans. (d) : Topological sort of DAG = O (V + E)
Managed (capable):- The method is Handled Bellman - Ford's single - source shortest path algorithm
quantitatively according to a greed-upon metrics. = O (VE)
69. Match List I With List II Kruskal's MST algorithm = θ (V + E) Due to sorting
the edges the dominat term in kruskal time complexity
List I List II
is O (E log E).
A. Branch and I. Keeps track of all Floyd-Warshall's all-pairs shortest path algorithm = θ
bound partial Paths (V3).
which can be
71. Match List I with List II
candidate for
LR: Regular language, LCF : Context free
further laguage
exploration LREC: Recursive language, LRE: Recursively
B. Steepest accent II. Detects enumerable language.
hill climbing difference List I List II
between current (A) Recursively Enumerable (I) L REC ∪ L RE
state and goal
language
state
(B) Recursive language (II) L CF ∪ L REC
C. Constraint III. Discover problem
satisfaction state(s) that (C) Context Free language (III) L*R ∩ L CF
satisfy a set of Choose the correct answer from the options
constraints given below:
D. Means end IV. Considers all (a) A-II, B-III, C-I
analysis moves from (b) A-III,B-I, C-II
current state and (c) A-I, B-II, C-III
selects best move (d) A-II, B-I, C-III

UGC NET JRF Computer Science June 2020 Paper-II 373 YCT
 Search on TG: @apna_pdf

Ans. (c) : L REC ∪LRE = (Recursive ∪ Recursively C. Recursive Best III. Optimal if optimal
enumerable) = Recursively enumerable First Search solution is
Recursive languages closed under complement. reachable
otherwise, returns
So, L REC is Recursive union of recursive and the best reachable
recursively enumerable is recursively enumerable. optimal solution
LCF ∪ LREC = (Not context free ∪ Recursive) = D. SMA* IV Computation and
(Recursive ∪ Recursive) = Recursive context free is not space complexity is
closed for a complement. too high
So, LCF is Recursive. The union of recursive and Choose the correct answer from the option
recursive is recursive. given below :
LR ∩ LCF = (Regular ∩ Context free) = Context free. (a) A-II, B-IV, C-I, D-III
The Intersections of regular and context free is context (b) A-III, B-II, C-IV, D-I
free. (c) A-II, B-III, C-I, D-IV
72. Match List I with List II (d) A-III, B-IV, C-II, D-I
List I List II Ans. (a) :
A. Serial Line IP I. Application • Greedy best first search algorithm always selects the
(SLIP) layer path which appears best at that moment.
B. Border Gateway II. Transport • A* is optimal and complete but time complexity and
Protocol (BGP) layer space complexity too high. it require more computation.
C. User Data III. Data Link • Recursive best first search ...... more memory
Protocol (UDP) layer knowledge but used only O(bd) memory.
D. Simple Network IV. Network layer • Memory simplified bound A+ such as A* optimal if
management
you can jet optimal solution otherwise as it is memory
protocol
bound.
Choose the correct answer form the options
given below: 74. Find the lexicographic ordering of the bit
(a) A-I, B-II, C-III, D-IV string given below based on the ordering 0 < 1.
(b) A-III, B-IV, C-II, D-I (A) 001 (B) 010
(c) A-II, B-III, C-IV, D-I (C) 011 (D) 0001
(d) A-III, B-I, C-IV, D-II (E) 0001
Ans. (b) : Serial line Internet protocol is a Choose the correct answer form the options
Data link layer Simple protocol that work with TCP/IP given below:
for communication over serial ports and routers. (a) 001 < 010 < 011 < 0001 < 0101
Border Gateway Protocol is a Network layer used to (b) 0001 < 001 < 010 < 0101 < 011
exchange routing information for the internet and is the (c) 0001 < 0101 < 001 < 010 < 011
protocol used b/w ISP which are different ASes. (d) 001 < 010 < 0001 < 0101 < 011
User data gram protocol is a Transport layer protocol. Ans. (b) : Lexicographic order is nothing but dictionary
UDP is a part of the Internet protocol suite referred to as order.
UDP/IP suite. To determine the order of strings we need to compare
SNMP is an application layer protocol that uses UDP each bit of all the strings one by one.
port number 161-162. SNMP is used to monitor the For Ex. Take 001 and 010, hence the second bits of the
network, detect network faults and sometimes even used strings are 0, 1 respectively since 0 < 1 as per the given
to configure remote devices. question 001 < 010
73. Match List I with List II Similarly (0001 < 0001 < 010 < 0101 < 011)
List I List II 75. Arrange the following types of machine is
A. Greedy Best I. Space complexity descending order of complexity:
First Search is O(d) where (A) SISD (B) MIMD
d=depth of the (C) SIMD
deepest optimal Choose the correct answer form the options
solution given below:
B. A* II. Incomplete even if (a) A, B, C (b) C, B, A
the search space is (c) B, C, A (d) C, A, B
finite

UGC NET JRF Computer Science June 2020 Paper-II 374 YCT
 Search on TG: @apna_pdf
Ans. (c) : Choose the correct answer from the given
• MIMD (Multiple Instructions Stream Multiple Data below:
Stream) (a) A → D → E → C → B
This includes machines with multiple processing units (b) A→E→D→C→B
that can apply multiple instruction to different data at (c) B→E→C→D→A
the same time. (d) B → C → E → D → A
• SIMD (Single Instruction stream Multiple Data Ans. (d) :
Stream )This means that a single Instruction is applied
to several data sets at the same time.
• SISD (Single Instruction stream Single Data Stream)
This is the von Neumann principle of serial computer
architecture, which only executes one instruction at a
time.
76. Given below are different properties of 3D
projections from A-D. Identify the correct
order on the basis of property true of (i) a
perspective projection only, (ii) an
orthographic projection only, (iii) both 78. Consider the undirected graph below :
orthographic and projective transformation
and (iv) neither orthographic nor projective
transformation respectively.
(A) Straight lines are mapped to straight lines.
(B) Distance and angles are (in general)
preserved. Using Prim's algorithm to construct a
minimum spanning tree starting with node a,
(C) Far away object appear the same size as
which one of the following sequences of edges
closer ones.
represents a possible order in which the edges
(D) Requires homogeneous coordinates in would be added to construct the minimum
order for it to be encoded into a linear spanning tree?
transformation. (a) (a, b), (a, h), (g, h), (f, g), (c, f), (c, i), (c, d),
Choose the correct answer form the oprions (d, e)
given below: (b) (a, b), (b, h), (g, h), (g, i), (c, i), (c, f), (c, d),
(a) D, C, B, A (b) B, C, D, A (d, e)
(c) D, C,A, B (d) C, D, B, A (c) (a, b), (b, c), (c, i), (c, f), (f, g), (g, h), (c, d),
Ans. (c) : (d, e)
(d) (a, b), (g, h), (g, f), (c, f), (c, i), (f, e), (b, c),
3D Projections Properties
(d, e)
A perspective projection Requires homogeneous
Ans. (a & c): A minimum spanning tree (MST) or
only coordinates in order for minimum weight spanning tree is a subset of the edge
it to be encoded into a (V – 1) of a connected, edge weighted undirected graph
linear transformation. G(V, E) that connects all the vertices together, without
An orthographic Far away object appear any cycle and with the minimum possible total edge
projection only. the same size as closer weight.
ones.
both orthographic and Straight lines are
projective transformation. mapped to straight
lines.
neither orthographic nor Distance and angles are
projective transformation. (in general) preserved.
77. Arrange the following types of Cohesion form
the to worst type.
(A) Logical Cohesion
(B) Sequential Cohesion So, there are two sequence (a, b), (b, c), (c, i), (c, f),
(C) Communication Cohesion (f, g), (g, h), (c, d), (d, e) with a cost 37. Another
sequence is (a, b), (a, h), (g, h), (f, g), (c, f), (c, i), (c, d),
(D) Temporal Cohesion
(d, e) with a cost is 37.
(E) procedural Cohesion
UGC NET JRF Computer Science June 2020 Paper-II 375 YCT
 Search on TG: @apna_pdf
79. Consider the following regular expressions: Statement II: Indirect addressing mode needs
(a) r = a (b + a)* two memory reference to fetch the operand.
(b) s = a (a + b)+ In the light of the above statements, choose the
(C) t = aa*b correct answer from the options given below.
Choose the correct answer form the options (a) Both statement I and statement II are true
given below based on the relation between the (b) Both statement I and statement II are false
language generated by the regular expressions (c) Statement I is correct but statement II is false
above: (d) Statement I is incorrect but statement II is
(a) L(r) ⊆ L(s) ⊆ (t) (b) L(r) ⊇ L(s) ⊇ (t) true
(c) L(r) ⊇ L(t) ⊇ (s) (d) L(s) ⊇ L(t) ⊇ (r) Ans. (a) : (I) Control signal are provided by a hard
Ans. (b) : L(r) = {a, aa, ab, aaa, aab, .........}This is a set wired circuit in hardwired control techniques. The speed
of all strings starting with 'a'. of a hardwired control unit can be optimized.
L(s) = {aa. ab. aaa. aab, ......} This is a set of all strings (II) Indirect addressing mode needs two memory
starting with 'aa' or 'ab'. references to fetch operand as the address of the
L(t) = {ab. aab. aaab. aaaab. .......} This is a set of all operand is not given in instruction but the address field
strings starting with 'a' ending with 'b' and contains any contains the address where the address of the operand is
number of 'a's in between them. stored.
L(r) ⊇ L(s) ⊇ (t) 82. Given below are two statement:
Note :- Represent o or more number of symbols. Statement I: Bezier curves are curves that
interpolate all the of their control points.
Represent 1 or more number of symbols.
Statement II: A cubic bezier curve has four
80. Given below are two statements : control points.
Statement I: 5 divides n5 – n whenever n is a In the light of the above statements, choose the
nonnegative integer. correct answer from the options given below.
Statement II: 6 divides n3 – n wherever n is a (a) Both statement I and statement II are true
nonnegative integer (b) Both statement I and statement II are false
In the light of the above statement, choose the (c) Statement I is correct but statement II is false
correct answer form the option given below: (d) Statement I is incorrect but statement II is
(a) Both statement I and statement II are correct true
(b) Both statement I and statement II are Ans. (d) : Statement I (incorrect)
incorrect The Bezier curve is defined by Po through Pn and n is
(c) Statement I is correct but statement II is named its order (n = 1 for the linear, 2 for the quadratic
incorrect etc). The first and last checkpoints are often the end
(d) Statement I is incorrect but statement II is points of the curve, but interim check points do not
correct usually lie on the curve.
Statement II (correct)-
Ans. (a) : Statement I: 5 divides n5 – n Using
The cubic Bezier curve is defined by four points Po, Pl,
mathematical Induction, if n5–n is divide by 5, then (n +
P2 and P3 in the plane or in greater space.
1)5 – (n + 1) is also divisible by 5.
if 5 divides n5 – n = 5.k
(n + 1)5–(n + 1) = n5 + 2n4 + 10n3 + 10n2 + 5n – n
= 5.k + 5(n4 + 2n3 + 2n2 + n)
This shows that (n + 1)5 – (n + 1) is a multiple of 5.
Hence it si always divisible by 5.
Statement II
n3 – n = n(n2 – 1) Bezier Curve Example
= n(n + 1)(n – 1) A cubic Bezier curve has four control points.
Hence n, n + 1 and n – 1 are three consecutive integers, 83. Given below are two statements :
one of them is a multiple of 2 and the other is a multiple is two variables V1 and V2 are used for
of 3. clustering then consider the following
Hence 6 divides n3 – n is always divisible by 6 statement for k means clustering with k = 3:-
whenever n is a non- negative integer. Statement I: If V1 and V2 have correlation of 1
the cluster centroid will be in straight line.
81. Given below are two statements:
Statement II : If V1 and V2 have correlation of
Statement I: Hardwired control unit can be
0 the cluster centroid will be in straight line.
optimized to produce fast mode of operation.
In the light of the above statements, choose the
correct answer from the options given below.
UGC NET JRF Computer Science June 2020 Paper-II 376 YCT
 Search on TG: @apna_pdf
(a) Both statement I and statement II are true Ans. (a) : Quality control:- Quality control is a series of
(b) Both statement I and statement II are false Inpections, reviews, and tests conducted during the
(c) Statement I is correct but statement II is false software development process to ensure that each work
(d) Statement I is incorrect but statement II is product follows the specifications.
true Hence statement I is correct.
Ans. (c) : Both data points would be in a straight line if ⇒ Quality assurance:- Management auditing and
the correlation between the variables V1 and V2 is 1. As monitoring activities makeup quality assurance. The
a result all there cluster centroids will form a straight aim of quality assurance is to provide management with
line the Information they need to make Informed decisions
84. Assuming that the system call fork () never about product quality.
fails, consider the following C programs P1 and Hence statement II is correct.
P2 executed on a UNIX \/Linux system:
86. Let G be a simple undirected graph, TD be a
/ *P1*/ / *P2*/
DFS tree on G, and TB be the BFD tree on G.
int main () { int main () {
Consider the following statements.
fork (); fork ();
Statement I: No edge of G is a cross with
fork (); Printf("Happy\n");
respect to TD.
fork (); fork ();
Printf("Happy\n"); Printf("Happy\n"); Statement II: For every edge (u,v) of G, if u is
at depth i and v is at depth j in TB then |i–j| = 1.
} fork ();
Printf("Happy\n"); In the light of the above statements, choose the
} correct answer from the options given below.
(a) Both statement I and statement II are true
Statement I: P1 displays "Happy" 8 times.
(b) Both statement I and statement II are false
Statement II: P2 displays "Happy" 12 times.
In the light of the above statements, choose the (c) Statement I is correct but statement II is false
correct answer from the options given below. (d) Statement I is incorrect but statement II is
(a) Both statement I and statement II are true true
(b) Both statement I and statement II are false Ans. (c) : Statement-I Correct
(c) Statement I is correct but statement II is false Undirected groups do not have cross edges in depth first
(d) Statement I is incorrect but statement II is search. But there can be cross edges in directed graphs.
true Statement-II Incorrect
Ans. (c) : Fork () is a system call used to create a child In Breadth first search an edge can be present b/w
process 'n' number of successive fork() call create 2n – 1 vertices of the same level. So |i – j| =0.
child processes.
87. Given below are two statements :
In P1:- Each child process prints one "Happy" parent
process also prints one "Happy". Statement I : The problem "Is L1 ∧ L2 = φ?" is
So. number of time P2 displays "Happy" = (23 – 1)+1 = 8. undecidable for context sensitive language L1
In P2:- At first fork () a new child process with two and L2.
fork () and print f statements is created. Simailarly more Statement II: The problem "Is W∈ ∈L?" is
child processes are created at each form () command decidable for context sensitive language L.
So, P2 show "Happy" 14 (2 + 4 + 8) times (where W is a string).
85. Given below are two statements: In the light of the above statements, choose the
Statement I: Quality control involves the series correct answer from the options given below.
of inspections, reviews and tests used (a) Both statement I and statement II are true
throughout the software process, to ensure (b) Both statement I and statement II are false
each work product meets the requirement (c) Statement I is correct but statement II is false
placed upon it. (d) Statement I is incorrect but statement II is
Statement II: Quality assurance consists of true
auditing and reporting functions of
management. Ans. (a) : The problem "is L1∧L2 = φ?" is undecidable
In the light of the above statements, choose the for context sensitive language L1 and L2. Here L1∧L2 is
correct answer from the options given below. a disjoint operator it's undecidable problem.
(a) Both statement I and statement II are true Hence statement I is correct.
(b) Both statement I and statement II are false • The problem "is W ∈ L ?" is decidable for context
(c) Statement I is correct but statement II is false sensitive language L(where w is a string). Here W is a
(d) Statement I is incorrect but statement II is string that is accepted by the particular language is a
true membership problem and its decidable problem.

UGC NET JRF Computer Science June 2020 Paper-II 377 YCT
 Search on TG: @apna_pdf
88. Given below are two statements : 90. Given below are two statements:
Statement I: The laws of nature put two Statement I: A genetic algorithm is a stochastic
fundamental limits on data rate of channel. The hill climbing search is which a large
H. Nyquist limit restricts the number of populations of states is maintained.
independent samples per second to twice the Statement II: in nondeterministic environment
hand width in a Noiseless channel. agents can apply AND-OR search to generate
Statement II: Shannon's major result about contingent plans that reach the goal regardless
noised channel is that maximum data rate of a of which outcomes occur during execution.
channel whose band width is H Hz, and whose In the light of the above statements, choose the
signal to noise ratio is S/N is given by: correct answer from the options given below.
 S (a) Both statement I and statement II are true
Maximum number of bits/sec = H log2  1 +  (b) Both statement I and statement II are false
 N
(c) Statement I is correct but statement II is false
In the light of the above statements, choose the
correct answer from the options given below. (d) Statement I is incorrect but statement II is
true
(a) Both statement I and statement II are true
(b) Both statement I and statement II are false Ans. (a) : A genetic algorithm is to stochastic hill
climbing algorithm that maintains a wide populations of
(c) Statement I is correct but statement II is false
states.
(d) Statement I is incorrect but statement II is
true Hence statement I is correct.
Agents may use AND-OR search in non-deterministic
Ans. (a) : Noiseless channel :- environment to produce contingent plans that achieve
Nyquist bit rate for a noiseless channel the nyquist bit the target regardless of which outcomes occur during
rate formula defines the theoretical maximum bit rate. execution.
Bit rate = 2x band width x log2L Hence statement II Is correct.
• Noisy Channel :- Shannon capacity in the reality. We Question number (141-145)
cannot have a noiseless channel. the channel is always
Question 91-95 concern a disk with a sector size
noisy.
of 12 bytes, 2000 tracks per surface 50 sectors
Capacity = bandwidth x log2(1 +SNR)] per track, five double sides platters, and
In this formula, bandwith is the bandwith of the channel average seek time of 10 milliseconds.
SNR is the signal to noise ratio and capacity is the 91. If T is capacity of a track is bytes, and S is the
capacity of the channel in bits per second. capacity of each surface in bytes then, (T.S) =
89. Given below are two statements: ____ .
Statement I: In Ceaser Cipher each letter of (a) (50 K, 50000 K) (b) (25 K, 25000 K)
Plain text is replaced by another letter for (c) (25 K, 50000 K) (d) (40 K, 36000 K)
encryption.
Ans. (c) : Track capacity = bytes/sector X sector/track =
Statement II: Diffie-Hellman algorithm is used 512×50 = 25 K bytes/track
for exchange of secret key.
Surface capacity = bytes/track×track
In the light of the above statements, choose the
surface = 25k×2000 = 50000 (bytes/...)
correct answer from the options given below.
(a) Both statement I and statement II are true 92. What is the capacity of the disk, in bytes?
(b) Both statement I and statement II are false (a) 25000 K (b) 5000000 K
(c) Statement I is correct but statement II is false (c) 250000 K (d) 50000 K
(d) Statement I is incorrect but statement II is Ans. (b) : Capacity of the disk = bytes/sector x
true Sector/truck ×track / surface× surface/disk.
Ans. (a) : Caesar Cipher :- It is one of the simplest = 512×50 ×2000×5×2 = 5000000 K
techniques for encryption where each letter of a given 93. Given below are tow statements :
text is replace by a letter some fixed number of Statement I : The disk has a total number of
positions down the alphabet. 2000 cylinders.
Ex- The text "ABC" can be encrypted using the ceasar Statement II: 51200 bytes in not a valid black
cipher technique as "CDE" here the shift (Number of size for the disk.
positions shifted) is 2. In the light of the above statements, choose the
Diffie-Hellman algorithm- Diffie Hellman algorithm is correct answer from the options given below.
used for the exchange of secret key over an insecure (a) Both statement I and statement II are true
channel. (b) Both statement I and statement II are false
• One the key is shared by both the sender and receiver, (c) Statement I is correct but statement II is false
then the communication is done using the shared (d) Statement I is incorrect but statement II is
symmetric keys. true

UGC NET JRF Computer Science June 2020 Paper-II 378 YCT
 Search on TG: @apna_pdf
Ans. (a) : Statement-I The number of cylinder is 2000, HODNAME VARCHAR
which is the same or the number of tracks on each (30)
platter. PRIMARY KEY (DID),
Statement-II The block size will be a multiple of the UNIQUE (DNAME),
sector size. 51200 is not a valid block size in this case FOREIGN KEY (HODID) REGERENCE
because block size cannot exceed the size of a track, EMPLOYEE (EID);
which is 25600 bytes.
PROKECT WORK:
94. If the disk platters rotate at 5400 rpm
(revolutions per minute), then approximately EMPIC VARCHAR NOT NULL
what is the maximum rotational delay? (10)
(a) 0.011 seconds (b) 0.11 seconds PROGNO INT (5) NOT NULL
(c) 0.0011 seconds (d) 1.1 seconds PROJECTLOC VARCHAR NOT NULL
Ans. (a) : In the disk platters rotate at 5400 rpm. (30)
5400 rotational = 1 minute PRIMARY KEY (EMPID, RPOJNO),
1 ROREIGN KEY (EMPIX)R\ REGERENCES
one rotation = ×60seoconds = 0.011 sec EMPLOYEE (EID).
5400
96. On the basis of above given table structures,
95. If one track of data can be transferred per retrieve the distinct employee ID (EMPID) of
revolution, then what is the data transfer rate ?
all employee of university who are working in
(a) 2850 KBytes/second project No, 20, 30, and 40.
(b) 4500 KBytes/second
(a) SELECT EMPID
(c) 5700 KBytes/second
FROM PROJECT WORK,
(d) 2250 KBytes/second
WHERE PROJNO = (20, 30, 40);
Ans. (d) : The capacity of a track is = bytes/sector x (b) SELECT EMPID
sector/track = 512×50= 25K
FROM PROJECT WORK,
Data transfer rate = track size ÷ rotational day
WHERE PROJNO IN (20, 30, 40);
If the disk platters rotate at 5400 rpm, the time requited
for one complete rotation will be, (c) SELECT DISTINCT EMPID
FROM PROJECT WORK,
1
× 60 = 0.011 seconds WHERE PROJNO IN (20, 30, 40);
5400 (d) SELECT DISTINCT EMPID
Rotational delay = 0.011 FROM PROJECT WORK,
Data transfer rate = 2250 K÷ 0.011 = 220 (KBytes/sec) WHERE PROJNO = 20, 30, 40;
Consider the following table structures related Ans. (c) : Since the primary key is a combination of two
to a university for Q 96 to Q 100 keys (EMPID, PROJNQ) so,
EMPLOYEE duplicate values may occur in EMID and PROJNQ. So
NAME VARCHAR NOT distinct key are required to eliminate duplicate in the
(30) NULL combined table. AND IN is a set operator it matches all
EID VARCHAR NOT table values to the set values.
(10) NULL • SELECT DISTINCT EMPID
DEPTND INT (5) NOT FROM PROJECT work
NULL WHERE PROJNO IN (20, 30, 40).
HODEID VARCHAR 97. Given below are two statement to find the sum
(10) of salaries of all employee of the English
SALARY INT (10) department as well as the maximum, minimum
PRIMARY KEY and average salary in English department.
(EID). STATEMENT I; SELCET SUM (SALARY),
FOREIGN KEY (HODEID) REGRENCES MAX (SALARY),, MIN (SALARY), AVG
EMPLOYEE (EID), (SALARY) FROM EMPLOYEE,
FOREIGN KEY (DEPTNO) REGERNCES DERPARTMENT WHERE DECTNO = DID
DEPARTMENT (DID): AND DNAME = 'ENGLISH'.
DEPARTMENT STATEMENT II: SELCET SUM (SALARY),
MAX (SALARY),, MIN (SALARY), AVG
DID INT (5) NOT NULL (SALARY) FROM EMPLOYEE,
DNAME VARCHAR NOT NULL DERPARTMENT WHERE DNAME =
(30) 'ENGLISH'.
HODID VARCHAR NOT NULL In the light of the above statements, choose the
(10) correct answer from the options given below.

UGC NET JRF Computer Science June 2020 Paper-II 379 YCT
 Search on TG: @apna_pdf
(a) Both statement I and statement II are true 99. In reference to the above given table structure,
(b) Both statement I and statement II are false which of the following query/queries will drop the
(c) Statement I is correct but statement II is false 'SALARY' column from 'ENPLOYEE' table?
(d) Statement I is incorrect but statement II is (A) ABTER TABLE EMPLYOEE DROP
true SALARY CASCASE.
Ans. (c): Two tables (join condition) must be matched (B) ALTER TABLE EMPLOYEE DROP
so that records can be linked uniquely. SALARY RESTRUCT.
Query :- SUM (SALARY), MAX (SALARY), MIN (C) ALTER EMPLOYEE DROP SALARY.
(SALARY), AVG (SALARY) FROM EMPLOYEE, Choose the correct answer from the options
DERPARTMENT WHERE DEPTNO = DID AND given below:
DNAME = 'ENGLISH' (a) (A) and (B) only (b) (A) and (C) only
Without DEPTNO = DID condition as in statement II, (c) (B) and (C) only (d) (A) only
there will be the Cartesian product of two tables Ans. (a) : Alter table syntax:-
(EMPLOYEE, DEPARTMENT) and it will appear ALTER TABLE table-name
many duplicate row with DROP [COLUMN] column-name [CASCADE | RESTRICT]
DNAME = 'ENGLISH' • The key word COLUMN, CASCADE, RESTRICT
Hence statement I is correct but statement II is false. are optional. The default CASCADE. It you use the
RESTRICT option, the column drop will be rejected if
98. Which of the following query/queries return
it would invalidate a dependent, schema object.
the employee ID and name of employee whose
salary is greater than the salary of all employee • Since the salary field is not present in any other table
in department number 20 of university. Order CASCADE |RESTRICT| has no impact.
result by employee ID (refer table structure • (c) ALTER ECMPLOYEE DROP SALARY is
given above). incorrect syntax.
(A) SELECT EID. NAME Hence the correct answer is (a) and (b) only.
FROM EMPLOYEE WHERE SALARY 100. Refer table structures given above University
> (SELECT SALARY FROM decided to give all employee in the 'SCIENCE'
EMPLOYEE WHERE DEPTNO = 20); department a 20% rise in salary. Which of the
ORDER BY EID following query/queries will compute the above
(B) SELECT EDI NAME results?
FROM EMPLOYEE WHERE SALARY (A) UPDATE EMPLOYEE
> (SELECT SALARY FROM SET SALARY = SALARY*1.20
EMPLOYEE WHERE DEPTNO = 20); WHERE DEPT NO. IN (SELECT DID FROM
(C) SELECT EID, NAME DEPARTMENT WHERE DNAME =
SCIENCE);
FROM EMPLOYEE WHERE SALARY
(B) UPDATE TABLE EMPLOYEE
> ALL(SELECT FROM EMPLOYEE
WHERE DEPTNO = 20) SET SALARY = SALARY*1.20
ORDER BY EID WHERE DBAME = SCIENCE;
Choose the correct answer from the options (C) ALTER TABLE EMPLOYEE
given below: SET SALARAY = SALARY*1.20
(a) (A) and (B) only (b) (A) and (C) only WHERE DETINO, IN (SELECT DNAME
FROM DEPRTMENT WHERE DNAME =
(c) (B) only (d) (C) only
'SCICENCE')
Ans. (d) : SELECT SALARY FROM EMPLOYEE Choose the correct answer from the options
WHERE DEPTNO = 20 given below:
The above inner query will be written the salary is of an (a) (A) and (B) only
employee whose department number is 20 this will (b) (A) only
match with the salary of the employee > salary of at (c) (B) and (C) only
least one employee.
(d) (C) only
Query :- SELECT EID, NAME
Ans. (b) : Syntax :- UPDATE table _ name
FROM EMPLOYEE
SET column 1 = value 1, column 2 = value 2, .....
WHERE SALARY>ALL(SELECT FROM
WHERE condition.
EMPLOYEE WHERE DEPTNO = 20)
(A) UPDATE EMPLOYEE
ORDER BY EID
SET SALARY = SALARY*1.20
The query returns the employee ID and name of
WHERE DEPT NO. IN (SELECT DID
employees whose salary is grater then the salary of all
employees in department number 20 of the university or FROM DEPARTMENT WHERE DNAME =
"SCIENCE");
order result by employee ID.

UGC NET JRF Computer Science June 2020 Paper-II 380 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. Dec. 2020-June 2021

COMPUTER SCIENCE
(Solved with Explanation)
1. Which of the statements given below is/are (a) -2-25-3-135
correct? (b) -2-25-1-3-135
It is always important and useful to include an
'alt' attribute on 'img' tag in HTML because (c) -1-145-2-245
A. users who cannot see the image due to (d) -2-25-3-1-135
vision impairment can have a textual Ans. (d) : -2-25-3-1-135
description of the image (which can be
spoken aloud by a screen reader). 4. Match List-I with List-II
B. If the image fails to load (slow connection, List - I List - II
broken path, etc.) then alt text is (Programming (Meaning)
displayed instead. Term)
C. SEO (Search Engine Optimization) A. JNDI i. Runtime support
benefits. for running Java
Choose the correct answer from the options programs
given below:
B. RMI ii. The API in support
(a) A only
of naming and
(b) B and C only
directory services
(c) C only
C. JDK iii. The methods
(d) A, B, and C
provided by the
Ans. (d) : When an image contains words that are Java development
important to understanding the context, the all text kit and runtime
should include those words. This will allow the alt text
support for calling
to play the same junction on the page as the image. Note
remote methods
that it does not necessarily describe the visual
characteristics of the image itself but must convey the D. JRE iv. The compiler and
same meaning as the image. class libraries to
Example:- An image on a website provides a link to a develop Java
free newsletter. The image contains the text "Free applications
newsletter. Get free recipes, news, and more. Learn Choose the correct answer from the options
more". the alt text matches the text in the image. <img given below:
src = "news letter.gif" alt = free newsletter. Get free (a) A - II , B - III, C - IV, D - I
recipes, news, and more. Learn more."/> (b) A - II, B - IV, C - III, D - I
2. What does the following function f() in 'C' (c) A - I, B - III, C - IV, D - II
return? (d) A - III, B - II, C - IV, D - I
int f(unsigned int N) { unsigned int counter = 0;
while(N > 0) { counter += N & 1; Ans. (a) :
N = N >> 1;} return counter == 1;} List - I List - II
(a) 1 if N is odd, otherwise 0 (Programming (Meaning)
(b) 1 if N is a power of 2, otherwise 0 Term)
(c) 1 if the binary representation of N is all 1's,
otherwise 0 A. JNDI ii. The API in support
(d) 1 if the binary representation of N has any 1's, of naming and
otherwise 0 directory services
Ans. (b) : 1 if N is a power of 2, otherwise 0 B. RMI iii. The methods
3. Consider the following recursive function F() in provided by the Java
Java that takes an integer value and returns a development kit and
string value: runtime support for
public static String F( int N) {if ( N <= 0) return
calling remote
"–"; return F(N - 3) + N + F(N - 2) + N;}
methods
The value of F(5) is:
UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 381 YCT
 Search on TG: @apna_pdf

C. JDK iv. The compiler and Cam-1

class libraries to 8 block and white image {1 bit}
1-megapixel = 106
develop Java
1
applications ⇒ 8 × 1 bit = 8× B = 1 byte
8
D. JRE i. Runtime support for
⇒ 1 B × 1 × 106 = 1×106 B = 1 MB
running Java
Cam-2
programs 1 8-color image {3 bit}
5. Match List-I with List-II 8-magapixel
List - I List - II 3
(Programming (Characteristic) = 1 × 3 bit ⇒ 1× byte
8
Paradigm)
3
A. Imperative i. Declarative, clausal ⇒ 8×106 × byte
8
representation,
= 3×106 Byte
theorem proving
= 3 MB
B. Object‐‐oriented ii. Side-effect free, Total = 1 MB + 3MB = 4MB
declarative,
7. Which of the statements given below are
expression
correct?
evaluation
The midpoint (or Bresenham) algorithm for
C. Logic iii. Imperative, rasterizing lines is optimized relative to DDA
abstract data type algorithm in that
D. Functional iv. Command-based, A. it avoids round-off operations.
procedural B. it is incremental.
Choose the correct answer from the options C. it uses only integer arithmetic.
given below: D. all straight lines can be displayed as
(a) A - IV, B - III, C - I, D - II straight (exact).
(b) A - III, B - IV, C - I, D - II Choose the correct answer from the options
(c) A - IV, B - III, C - II, D - I given below:
(d) A - II, B - III, C - I, D - IV (a) A and B only
(b) A and C only
Ans. (a) : (c) A, B, C, and D
List - I List - II (d) A, B, and C only
(Programming (Characteristic) Ans. (d) : A, B, and C only
Paradigm) 8. What is the transformation matrix M that
A. Imperative iv. Command‐based, transforms a square in the xy-plane defined by
(1, 1)T, (–1, 1)T, (–1, –1)T and (1, –1)T to a
procedural
parallelogram whose corresponding vertices
B. Object‐oriented iii. Imperative, abstract are (2, 1)T, (0, 1)T , (–2, –1)T and , (0, –1)T ?
data type 1 1 0
C. Logic i. Declarative, clausal (a) M = 0 1 0 
representation, theorem 0 0 1 
proving
1 0 0
D. Functional ii. Side‐effect free,
(b) M = 1 1 0 
declarative, expression
evaluation 0 0 1 
6. Suppose you have eight 'black and white' 1 1 1 
images taken with a 1-megapixel camera and (c) M = 0 1 0 
one '8-color' image taken by an 8-megapixel
camera. How much hard disk space in total do 0 0 1 
you need to store these images on your 1 1 0
computer? (d) M = 1 1 0 
(a) 1 GB (b) 4 MB
0 0 1 
(c) 3 MB (d) 3 GB
Ans. (b) : 4 MB
UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 382 YCT
 Search on TG: @apna_pdf

1 1 0 12. The V components in MVC are responsible for:

Ans. (a) : M = 0 1 0 
(a) User interface.
(b) Security of the system.
0 0 1  (c) Business logic and domain objects.
9. Suppose a Bezier curve p(t) is defined by the (d) Translating between user interface
following four control points in the xy-plane: actions/events and operations on the domain
P0 = ( -2,0 ) ; P1 = ( -2,4 ) ; P2 = ( 2,4 ) ; and P3 = objects.
Ans. (a) : In model-view-controller architectural
(2,0). Then which of the following statements
pattern, there are following parts and there main
are correct?
responsibilities-
A. Bezier curve P(t) has degree 3. Model: Responsible for providing the app's
1
B. P   = ( 0, 3 ) . "business logic".
2 View: Responsible for providing the app's user
C. Bezier curve P(t) may extend outside the interface (UI)
convex hull of its control points. Controller: Responsible for translating UI actions
Choose the correct answer from the options to operations on the model.
given below : So V components in MVC are responsible for user
(a) A and B only interface.
(b) A and C only 13. In software engineering, what kind of notation
(c) B and C only do formal methods predominantly use?
(d) A, B, and C (a) textual
(b) diagrammatic
Ans. (a) : A and B only
(c) mathematical
10. Given below are two statements
(d) computer code
Statement I: The maximum number of sides
Ans. (c) : mathematical
that a triangle might have when clipped to a
rectangular viewport is 6. Formal method :- System design techniques that use
rigorously specified mathematical model to build
Statement II: In 3D graphics, the perspective
software, hardware system.
transformation is nonlinear in z.
In light of the above statements, choose the 14. If every requirement stated in the Software
correct answer from the options given below Requirement Specification (SRS) has only one
interpretation, then SRS is said to be
(a) Both Statement I and Statement II are true.
(a) correct
(b) Both Statement I and Statement II are false
(b) consistent
(c) Statement I is true but Statement II is false
(c) unambiguous
(d) Statement I is false but Statement II is true
(d) verifiable
Ans. (d) : Statement I is false but Statement II is true
Ans. (c) : An SRS is said to be unambiguous if all the
11. In software testing, beta testing is the testing requirements stated have only 1 interpretation.
performed by _______________.
15. A system has 99.99% uptime and has a mean-
(a) potential customers at the developer's location
time-between-failure of 1 day. How fast does
(b) potential customers at their own locations
the system has to repair itself in order to reach
(c) product developers at the customer's location
this availability goal?
(d) product developers at their own locations
(a) ~9 Seconds
Ans. (b) : Beta testing is a type of user acceptance (b) ~10 Seconds
testing among the most crucial testing, which performed
(c) ~11 Seconds
before the release of the software. Beta testing is a type
(d) ~12 Seconds
of field test. This testing performs at the end of the
software testing life cycle. This type of testing can be Ans. (a) : ~9 Seconds
considered as external user acceptance testing. Sol.
Beta testing always is done after the alpha testing, and MTBF
Availability =
before releasing it into the market. Beta testing is a MTBF + MTTR
black-box testing Beta testing performs in the absence = MTBF (in second)
of tester and the presence of real users. Beta testing = 1 day
generally is done for testing software product like = 1×24×60×60
utilities, operating systems, and applications, etc. = 86400 sec

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 383 YCT
 Search on TG: @apna_pdf
86400 Ans. (d) : Waterfall Model :-This model has five
⇒ 99.99% = phases: Requirements analysis and specification,
86400 + x
design, implementation and unit testing, integration and
86400
86400 + x = ×10000 system testing and operation and maintenance. The
0.9999 steps always follow in this order and do not overlap.
86400 + x = 86408.6 The developer must complete every phase before the
x = 86408.6 – 86400 next phase begins.
⇒ x = 8.6
⇒ x = 9 sec
16. In the context of Software Configuration
Management (SCM), what kind of files should
be committed to your source control
repository?
A. Code files
B. Documentation files
C. Output files
D. Automatically generated files that are
required for your system to be used
Choose the correct answer from the options
given below:
(a) A and B only
(b) B and C only
(c) C and D only
(d) D and A only
Ans. (a) : Software configuration management - Evolutionary Model :- The evolutionary model is an
software configuration management (SCM or S/WCM) iterative model as they are characterized in a manner
is the task of tracking and controlling changes in the that enable software engineering to develop a complete
software, part of the larger cross-disciplinary field of version of the software. Such models are applied
configuration management. SCM practices include because the requirement often change. So the end
revision control and the establishment of baseline. product will be unrealistic for a complete version is
So following type of file should be committed to source impossible due to tight market deadlines. It is better to
control repository - A) code files B) Documentation introduce a limited version. Thus, software engineering
files. can follow a process model that has been explicit
designed to accommodate a product that gradually
17. Match List-I with List-II
complete over time.
List - I List - II
(Software (Description)
Process Model)
A. Waterfall i. Software can be
Model developed
incrementally
B. Evolutionary ii. Requirement
Model compromises are
inevitable
C. Component‐ ‐b iii. Explicit recognition
ased Software of risk
Engineering
D. Spiral iv. Inflexible Component Based Development :- Component - based
Development partitioning of the software engineering (CBSE) is an approach to software
project into stages development that relies on the reuse of entities called
'software components'.
Choose the correct answer from the options
given below: • It emerged from the failure of object - oriented
development to support effective reuse single object
(a) A ‐ IV, B ‐ I, C ‐ III, D ‐ II
classes are too detailed and specific.
(b) A ‐ I, B ‐ IV, C ‐ II, D ‐ III • Components are more abstract than object classes and
(c) A ‐ II, B ‐ III, C ‐ I, D ‐ IV can be considered to be stand alone service providers.
(d) A ‐ IV, B ‐ I, C ‐ II, D ‐ III They can exist as stand-alone entities.
UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 384 YCT
 Search on TG: @apna_pdf
Spiral Development:- This software development Life Statement II: Cleanroom software engineering
Cycle models, which provides support for risk follows the classic analysis, design, code, test,
Handling. In its diagrammatic representation, it looks and debug cycle to software development and
like a spiral with many loops. The exact number of focussing on defect removal rather than defect
loops of the spiral is unknown and can vary from prevention.
project to project. In light of the above statements, choose the
Four quadrants are correct answer from the options given below:
1) Objective determination and identify alternative (a) Both Statement I and Statement II are true
solutions (b) Both Statement I and Statement II are false
2) Identify and resolve Risks (c) Statement I is true but Statement II is false
3) Develop next version of the product. (d) Statement I is false but Statement II is true
4) Review and plant for the next phase.
Ans. (c) : The cleanroom software engineering process
is a software development process intended to produce
software with a certificate level of reliability. The focus
of the cleanroom process is on defect prevention, rather
than defect removal.
The cleanroom approach to software
development is based on five key strategies: formal
specification, Incremental development, structured
programming, static verification, and statistical testing
of the system.
20. Given below are two statements, one is labelled
as Assertion A and the other is labelled as
Reason R
Assertion A : Software developers donot do
exhaustive software testing in practice.
Reason R : Even for small inputs, exhaustive
testing is too computationally intensive (e.g.,
18. Identify the correct order of the following five takes too long) to run all the tests.
levels of Capability Maturity Model (from In light of the above statements, choose the
lower to higher) to measure the maturity of an correct answer from the options given below
organization's software process.
A. Defined B. Optimizing (a) Both A and R are true and R is the correct
C. Initial D. Managed explanation of A
E. Repeatable (b) Both A and R are true but R is NOT the
Choose the correct answer from the options correct explanation of A
given below
(c) A is true but R is false
(a) C, A, E, D, B (b) C, E, A, B, D
(d) A is false but R is true
(c) C, B, D, E, A (d) C, E, A, D, B
Ans. (a) : Both A and R are true and R is the correct
Ans. (d) :
explanation of A.
21. Which of the following are logically equivalent?
A. ¬p→ →(q – r) and q →(pvr)
B. (p →q) →r and p → (q→ →r)
C. (p → q) → (r→ → s) and (p → r) → (q →s)
Choose the correct answer from the options
given below :
(a) A only (b) A and B only
(c) B and C only (d) A and C only
Ans. (a) : A only
22. Which of these statements about the floor and
ceiling functions are correct?
19. Given below are two statements
Statement I : 2x = x + x + (1/2)  for all
Statement I: Cleanroom software process real number x
model incorporates the statistical quality
certification of code increments as they Statement II : x + y = x + y for all real
accumulate into a system. number's x and y

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 385 YCT
 Search on TG: @apna_pdf
(a) Both Statement I and Statement II are true Ans. (*) : According to UGC two option (b & c) are
(b) Both Statement I and Statement II are false correct.
(c) Statement I is true but Statement II is false 27. Which of the following Graphs is (are) planer?
(d) Statement I is false but Statement II is true
Ans. (c) : Statement I is true but Statement II is false
Sol.
Statement I
⇒ 2x = x + x + ½
⇒ 2x = x + x + 0.5
x = 1 2×1 = 1 + 1 + 0.5 = 1.5 = 1
2 = 1 + 1 = 2 True
x = 2.75 2×2.7 = 2.75 + 2.75 + 0.5
5.5.  = 2 + 3.75 = 5 = 2 + 3 = True (A) (B)
Statement -II
x + y = x + y
⇒ 0.5 + – 0.75 = 0.5 + (– 0.75) 
1 + 0 = – 0.25
1≠–0=0
1 ≠ 0 False
Statement I is true but Statement II is false.
23. How many ways are there to assign 5 different
jobs to 4 different employees if every employee
is assigned at least 1 job?
(a) 1024 (b) 625
(c) 240 (d) 20 Choose the correct answer from the option
Ans. (c) : 240 given below :
24. A company stores products in a warehouse. (a) A and B only
Storage bins in this warehouse are specified by (b) B and C only
their aisle, location in the aisle, and self. There (c) A only
are 50 aisles, 85 horizontal locations in each (d) B only
aisle, and 5 shelves throughout the warehouse. Ans. (a) : A planar graph is a graph that can be
What is the least number of products the embedded in the plane, i.e., it can be drawn on the plane
company can have so that at least two products in such a way that its edges intersect only at their end
must be stored in the same bin? points.
(a) 251 (b) 426 In other words, it can be drawn in such a way that no
(c) 4251 (d) 21251 edges cross each other.
Ans. (d) : 21251 For a simple, connected, planar graph with v vertices
total product and e edges and f faces, the following simple conditions
= 50×85×5 hold for v ≥ 3 :
= 21250 • Theorem 1. e ≤ 3v – 6,
= 1 product in 1 bin • Theorem 2. If there are no cycles of length 3, then e ≤
= 21250 + 1 2v – 4
= 21251 • Theorem 3. f ≤ 2v – 4.
25. Let us assume a person climbing the stairs can
28. Match List-I with List-II
take one stair or two stairs at a time. How
many ways can this person climb a flight of List - I List - II
eight stairs Identity Name
(a) 21 (b) 24 A. x + x =x i. Identity Law
(c) 31 (d) 34
B. x+0=x ii. Absorption Law
Ans. (d) : 34
26. For which value of n is Wheel graph Wn C. x +1 = 1 iii. Idempotent law
regular? D. x + xy = x iv. Domination Law
(a) 2 (b) 3 Choose the correct answer from the options
(c) 4 (d) 5 given below:
UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 386 YCT
 Search on TG: @apna_pdf
(a) A ‐ III, B ‐I , C ‐ II, D ‐ IV ⇒ (a * b)* c * c = d * c
(b) A ‐ I, B ‐III , C ‐ IV, D ‐ II ⇒a*b*c=d*c
(c) A ‐ III, B ‐I , C ‐ IV, D ‐ II ⇒d*c=d
(d) A ‐ III, B ‐IV , C ‐ I, D ‐ II Similarly
Ans. (c) : Identify Law :- The law of identity states a*(a*b*c) = a * d
that each thing is identical with itself. ⇒ a * a *(b * c) = a* d
x+0=x ⇒ a * (b * c) = a * d
Absorption Law :- To affirm that either some ⇒a*d=d
proposition is true or else that proposition and some Thus d * c = a * d = d
other proposition are both true is equivalent to affirming Now,
the first proposition. c*d*c=c*a*d=c*d
x + xy = x
⇒ c=c*a*d=c*d
Idempotent Law :- It is the property of certain
and
operations in mathematics and computer science that
they can be applied multiple time without changing the d* c * a = a * d * a = d * a
result beyond the initial application. ⇒ d*c*a=a=d*a
x+x=x So,
1 + 1 = 1 and 0 × 0 = 0 = a * c = (d * a) * (c * d)
Domination Law :- F∧X = F; if the first thing in an = d * (a * c) * d = d
AND expression is false, then it doesn't matter whether Thus a * b * c = a * c
the second thing is true or false. The AND expression is 30. Consider the following linear optimization
going to be false either way. problem:
T∨X = T: If the first thing in an OR expression is true, Maximize Z = 6x+5y
then, it doesn't matter whether the second thing is true Subject to 2x ‐ 3y <= 5
or false the OR expression is going to be true either
way. x+3y <= 11
4x + y <=15
29. Let (X, *) be a semigroup. Furthermore, for
and x>=0, y >= 0.
every a and b in X, if a ≠ b, then a*b ≠ b*a.
The optimal solution of the problem is:
Based on the defined semigroup, choose the
correct equalities from the options given below: (a) 15
A. For every a in X, a*a = a (b) 25
B. For every a, b in X, a*b *a= a (c) 31.72
C. For every a, b, c in X, a*b *c= a*c (d) 41.44
(a) A and B only Ans. (c) : 31.72
(b) A and C only 31. Which of the following languages are not
(c) B and C only regular?
(d) A, B and C A. L={ (01)n 0k | n > k, k>=0 }
Ans. (d) : a. Let a*a = b.(a*a)*a = b*a B. L={ cn bk an+k | n >= 0, k>=0 }
Since (X, *) is a semi group, * is closed and associative. C. L={ 0n 1k | n≠ ≠k }
So, Choose the correct answer from the options
(a*a)*a = a*(a*a) ⇒ a*b = b*a given below:
Which is possible only if a = b . Thus we proved a*a = a (a) A and B only
b. Let (a*b) * a = c (b) A and C only
⇒ (a * b) *a *a = c * a (c) B and C only
⇒ a*b*a = c*a (d) A, B and C
⇒c*a=a Ans. (d) : A, B and C , no one are regular
Similarly, 32. Any string of terminals that can be generated
a * (a*b*a) = a*c by the following context free grammar (where
⇒ a * a * ( b * a) = a * c S is start non terminal symbol)
⇒ a * (b * a) = a * c S → XY
⇒a*c=a=c*a X→ 0X 1X 0
So, c = a
c. Let (a * b)*c = d Y→ Y0 Y1 0

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 387 YCT
 Search on TG: @apna_pdf
(a) has at least one 1
(b) should end with 0
(c) has no consecutive 0's or 1's
(d) has at least two 0's
Ans. (d) : A language, which has at least two 0's
33. Let
L1 = { 0n1n 0m | n>=1, m>=1 } (a) (aa* (a+b)ab)*
L2 = { 0n 1m 0m | n>=1, m>=1 } (b) (a+b)ab(ab+bb+ aa* (a+b)ab)*
L3 = { 0n 1n 0n | n>=1} (c) a* ab(ab+bb+ aa* (a+b)ab)*
(d) a* (a+b)ab(ab+bb+ aa* (a+b)ab)*
Which of the following are correct statements?
A. L3 =L1∩ L2 Ans. (*) :
B. L1 and L2 are context free languages but L3 37. What language is accepted by the pushdown
is not a context free language automaton
C. L1 and L2 are not context free languages but M=({q0 , q1 , q2}, {a, b}, {a, b, z}, δ, q0 , z, {q })
L3 is a context free language with δ(q0 , a, a) ={ (q0 , aa) }; δ(q0 , b, a) ={(
D. L1 is a subset of L3 q0 , ba)}
Choose the correct answer from the options δ(q0 , a, b) ={ (q0 , ab) }; δ(q0 , b, b) ={ (q0 ,
given below: bb)}
(a) A and B only δ(q0 , a, z) ={ (q0 , az) }; δ(q0 , b, z) ={ (q0 , bz)
(b) A and C only }
(c) A and D only δ(q0 , λ, b) ={ (q1 , b) }; δ(q0 , λ, a) ={ (q1 ,
(d) A only a)}
Ans. (a) : A and B are correct option. δ(q1 , a, a) ={ (q1 , λ) }; δ(q1 , b, b) ={ (q1 ,
34. Given below are two statements λ)}
Statement I: The family of context free δ(q1 , λ, z) ={ (q2 , z) }?
languages is closed under homomorphism (a) L = { w | na (w) = nb (w), w Є {a, b}+ }}
Statement II: The family of context free (b) L = { w | na (w) <= nb (w), w Є {a, b}+ }}
languages is closed under reversal (c) L = { w | nb (w) <= na (w), w Є {a, b}+ }}
In light of the above statements, choose the (d) L= {wwR | w Є {a, b}+ }
correct answer from the options given below :
Ans. (d) : L= {wwR | w Є {a, b}+ }
(a) Both Statement I and Statement II are true
38. Match List - I with List - II
(b) Both Statement I and Statement II are false
(c) Statement I is true but Statement II is false
(d) Statement I is false but Statement II is true List - I List - II
Ans. (a) : Both Statement I and Statement II are true Production Rules Grammar
35. What is the minimum number of states A. S → XY I. Greibach
required to the finite automaton equivalent to X→→0 Normal Form
the transition diagram given below? Y→→1
B. S → aS bSS c II. Context
Sensitive
Grammar
C. S → AB III. Chomsky
A → 0A 1A 0 Normal Form

B → 0A
(a) 3 D. S → aAbc IV. S - Grammar
(b) 4 Ab → bA
(c) 5 Ac → Bbcc
(d) 6 bB → Bb
Ans. (c) : 5 aB → aa aaA
36. Find the regular expression for the language Choose the correct answer from the options
accepted by the automata given below. given below:

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 388 YCT
 Search on TG: @apna_pdf
(a) A ‐ III, B ‐I , C ‐ IV, D ‐ II 40. Given below are two statements
(b) A ‐ III, B ‐II , C ‐ I, D ‐ IV Statement I: LL(1) and LR are examples of
(c) A ‐ III, B ‐IV, C ‐ I, D ‐ II Bottom‐ ‐up parsers.
(d) A ‐ IV, B ‐III , C ‐ I, D ‐ II Statement II: Recursive descent parser and
SLR are examples of Top‐ ‐down parsers
Ans. (*) :
In light of the above statements, choose the
39. Which of the following concepts can be used to
identify loops? correct answer from the options given below:
A. Depth first ordering (a) Both Statement I and Statement II are true
B. Dominators (b) Both Statement I and Statement II are false
C. Reducible graphs (c) Statement I is true but Statement II is false
Choose the correct answer from the options (d) Statement I is false but Statement II is true
given below: Ans. (b) : Both Statement I and Statement II are false.
(a) A and B only 41. The postfix form of the expression (A + B) * (C
(b) A and C only * D ‐ E) * F / G is _______ .
(c) B and C only (a) A B + C D * E – F G / * *
(d) A, B and C
(b) A B + C D * E – F * * G /
Ans. (d) : A Depth first ordering :- Depth - first
search (DFS) is an algorithm for traversing or searching (c) A B + C D * E – * F * G /
tree or graph data structures. The algorithm starts at the (d) A B + C D E * – * F * G /
root node (selecting some orbitrary node as the root Ans. (c) : A B + C D * E – * F*G/
node in the case of a graph) and explores as for as
Sol. postfix expression-
possible along each branch before back tracking.
Vertex Orderings :- ⇒ ((A + B) *((C + D) – E)) * F)/G
i) pre ordering ⇒ ((AB + ) * ((CD * ) E – )) F * ) G/
ii) post ordering ⇒ ((AB + ) (CD * E –) * )) F * ) G /
iii) reverse preordering ⇒ AB + CD * E – * F * G /
iv) reverse postordering
for binary trees there is additionally- 42. A double‐ ‐ended queue (dequeue) supports
e) in ordering adding and removing items from both the ends
f) reverse in - ordering. of the queue. The operations supported by
dequeue are AddFront(adding item to front of
the queue), AddRear(adding item to the rear of
the queue), RemoveFront(removing item from
the front of the queue), and
RemoveRear(removing item from the rear of
the queue). You are given only stacks to
implement this data structure. You can
implement only push and pop operations.
What’ ’s the time complexity of performing
AddFront() and AddRear() assuming m is the
size of the stack and n is the number of
elements?
(a) O(m) and O(n) (b) O(1) and O(n)
(c) O(n) and O(1) (d) O(n) and O(m)
Dominators :- Dominators are defined in a directed Ans. (b) : O(1) and O(n)
graph with respect to a source, vertex S. formally, a 43. Two balanced binary trees are given with m
node a is said to dominate a node w art source vertex S and n elements, respectively. They can be
if all the paths from S to w in the graph must pass merged into a balanced binary search tree in
through node u. Note that only the vertices that are ____ time.
reachable from source vertex in the directed graph are (a) O(m*n) (b) O(m+n)
considered here.
(c) O(m*log n) (d) O(m*log(m+n))
Reducible Graph :- A control how graph G is said to
be reducible if the removal of its back edges leads to an Ans. (b) : First we store the inorder traversals of both
acyclic graph where each node can be reached from the the trees in two separate arrays and then we can merge
initial node of G. these sorted sequences in O(m+n) time. And then we
So All above concepts can be used to identify loops. construct the balanced tree from this final sorted array.

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 389 YCT
 Search on TG: @apna_pdf
44. A data structure is required for storing a set of Ans. (a) : Statement 1 theorem :- An undirected graph
integers such that each of the following has an even number of vertices of odd degree.
operations can be done in O(log n) time, where Proof : Let v1 be the vertices of even degree and v2 be
n is the number of elements in the set. the vertices of odd degree in an undirected graph G =
• Deletion of the smallest element (V , E) with m edges.
• Insertion of an element if it is not already Then
present in the set
Which of the following data structures can be
used for this purpose?
(a) A heap can be used but not a balanced binary
search tree.
(b) A balanced binary search tree can be used but
not a heap.
(c) Both balanced binary search tree and heap
can be used.
(d) Neither balanced binary search tree nor heap
can be used.
Statement -II :-The degree of any vertex is the number
Ans. (b) : A balanced binary search tree can be used but of edges or arcs or lines connected to it. The sum of
not a heap. degrees of any graph can be worked out by adding the
45. Consider the following graph. degree of each vertex in the graph. The sum of degrees
is twice the number of edges. Therefore the sum of
degrees is always even.
Theorem Let G = (V, E) be an undirected graph with m
edges. Then
2m = ∑ deg(v)
ν∈v

47. Which of the given options provides the

increasing order of asymptotic complexity of
Among the following sequences functions f1, f2, f3 and f4?
I. a b e g h f A. f1(n) = 2n
II. a b f e h g B. f2(n) = n3/2
III. a b f h g e C. f3(n) = n log n
IV. a f g h b e D. f4(n) = nlogn
Which are depth first traversals of the above Choose the correct answer from the options
graph? given below
(a) I, II, and IV only (a) C, B, D, A
(b) I and IV only (b) C, B, A, D
(c) II, III, and IV only (c) B, C, A, D
(d) I, III, and IV only (d) B, C, D, A
Ans. (d) : I, III, and IV only Ans. (a) : n log n > n3/2 > nlog n > 2n
46. Given below are two statements 48. The order of a leaf node in a B+ tree is the
Statement I: In an undirected graph, number maximum number of (value, data record
of odd degree vertices is even. pointer) pairs it can hold. Given that the block
Statement II: In an undirected graph, sum of size is 1K bytes, data record pointer is 7 bytes
degrees of all vertices is even. long, the value field is 9 bytes long and a block
In light of the above statements, choose the pointer is 6 bytes long, what is the order of the
correct answer from the options given below leaf node?
(a) Both Statement I and Statement II are true. (a) 63
(b) Both Statement I and Statement II are false. (b) 64
(c) Statement I is true but Statement II is false. (c) 67
(d) Statement I is false but Statement II is true. (d) 68
UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 390 YCT
 Search on TG: @apna_pdf
Ans. (a) : Disk block size = 1024 bytes. List - I List - II
Data record pointer size, r = 7 bytes Ans. (a): Standard graph Time
Value size, V = 9 bytes algorithms comple
Disk Block ptr, P = 6 bytes. xities
Let order of leaf be m.A leaf node in B + tree contains A.
Bellman‐Ford III. O(n*m)
at most m record pointers, at most m values, and one algorithm
disk block pointer. B. I. O(m*lo
Kruskal’s
r × m + V × m + P < = 1024 g n)
algorithm
16 m < = 1018
C. Floyd‐Warshall II. O(n3 )
m = < 63
algorithm
49. A hash function h defined as h(key)=key mod 7,
D.
with linear probing, is used to insert the keys Topological IV. O(n+m)
44, 45, 79, 55, 91, 18, 63 into a table indexed sorting
51. Which agent deals with the happy and
from 0 to 6. What will be the location of key
18? unhappy state?
(a) 3 (b) 4 (a) Utility‐based agent
(c) 5 (d) 6 (b) Model‐based agent
Ans. (c) : Keys 44, 45, 79, 55, 91, 18, 63 (c) Goal‐based Agent
h (key) = key mod 7 (d) Learning Agent
h (44) = 44 mod 7 = 2
Ans. (a) : Utility Based Agent :-Utility based agent
h (45) = 45 mod 7 = 3
choose actions on the basis of utilities or preference and
h (79) = 79 mod 7 = 2
choose the actions that maximize the expected utility.
but 2 is already filled 44, linear probing is applied but 3
Utility describes the happiness of the agent.
is also filled.
Model Based Agent :- Model based agents have a
So 79 will occupy 4
model i.e. knowledge about how things happen in the
h (55) = 55 mod 7 = 6 whole world & based on the model it performs actions.
h (91) = 91 mod 7 = 0
Goal based Agent :- Goal based agents expand the
h (18) = 18 mod 7 = 4 capabilities of the model - based agent by having the
but 4 is occupied by 79 So, it will occupy 5. "goal" information. They choose an action, so that they
h (63) = 63 mod 7 = 0 , 0 is also occupied so, it will
can achieve the goals. These agents may have to
occupy1. consider a long sequence of possible actions before
50. In the following table, the left column contains
deciding whether the goal is achieved or not.
the names of standard graph algorithms andLearning agents :- learn from past experiences and
the right column contains the time complexities
automatically adapt through learning. It has learning
of the algorithms. Here, n and m are number of
capabilities.
vertices and edges, respectively. Match each
Hence, Utility - based agents deal with happy &
algorithm with its time complexity.
unhappy agents.
List - I List - II
52. Given below are two statements
Standard graph Time
algorithms Statement I: Breadth‐
complexities ‐First Search is optimal
when all the step costs are equal whereas
A. Bellman‐ ‐Ford I. O(m*log n)
uniform‐ ‐cost search is optimal with any
algorithm
step‐‐cost.
B. Kruskal’ ’s algorithm II. O(n3)
Statement II: When all the step costs are same
C. Floyd‐ ‐Warshall III. O(n*m) uniform‐ ‐cost search expends more nodes at
algorithm depth d than the Breadth‐ ‐First Search.
D. Topological sorting IV. O(n+m) In light of the above statements, choose the
Choose the correct answer from the options correct answer from the options given below
given below : (a) Both Statement I and Statement II are true
(a) A ‐ III, B ‐ I, C ‐ II, D ‐ IV (b) Both Statement I and Statement II are false
(b) A ‐ II, B ‐ IV, C ‐ III, D ‐ I (c) Statement I is true but Statement II is false
(c) A ‐ III, B ‐ IV, C ‐ I, D ‐ II (d) Statement I is false but Statement II is true
(d) A ‐ II, B ‐ I, C ‐ III, D ‐ IV Ans. (a) : Both Statement I and Statement II are true.

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 391 YCT
 Search on TG: @apna_pdf
53. Consider the given tree below. Calculate the full joint distribution is a 2×
×2××2 table as
value at the root of the tree using alpha‐
‐beta shown in the figure below.
pruning algorithm. toothache ¬toothache
catch ¬catch catch ¬ catch
cavity 0.108 0.012 0.072 0.008
¬cavity 0.016 0.064 0.144 0.576
The marginal probability of cavity P(cavity) is
__________.
(a) 0.200
(a) 3 (b) 0.216
(b) 5 (c) 0.120
(c) 6
(d) 0.080
(d) 9
Ans. (a) : 0.200
Ans. (b) : 5
Probability (Cavity)
54. Which among the following statement(s) is(are)
FALSE? = 0.108 + 0.012 + 0.072 + 0.008
A. Greedy best‐ ‐first search is not optimal but = 0.200
is often efficient. 57. The probability of a cavity, given evidence of a
B. A* is complete and optimal provided h(n) is toothache, P(cavity | toothache) is __________.
admissible or consistent. (a) 0.400
C. Recursive best‐ ‐first search is efficient in (b) 0.600
terms of time complexity but poor in terms of
(c) 0.280
space complexity.
D. h(n) = 0 is an admissible heuristic for the (d) 0.216
8‐‐puzzle. Ans. (b) :
(a) A only P(Cavity ∩ toothache)
= P(Cavity | toothache) =
(b) A and D only P(toothache)
(c) C only
0.108 + 0.012
(d) C and D only =
0.108 + 0.012 + 0.016 + 0.064
Ans. (c) : C is false only.
0.120
55. Consider the sentence below. = = 0.600
0.200
There is a country that borders both India and
Pakistan. 58. The probability of a toothache, given evidence
Which of the following logical expressions of a cavity, P(toothache | cavity) is __________.
express the above sentence correctly when the (a) 0.400
predicate Country(x) represents that x is a (b) 0.600
country and Borders(x, y) represents that the (c) 0.280
countries x and y share the border? (d) 0.216
(a) ∃c Country(c) ^∧ Border (c, India) ∧ BorderAns. (b) : P(toothache | cavity)
(c,Pakistan) = P(toothache ∧cavity)|P(cavity)
(b) ∃c Country(c) ⇒ [Border (c, India) ∧ Border = (0.108 + 0.012)|(0.108 + 0.012 + 0.072 + 0.008)
(c,Pakistan)] = 0.600
(c) [∃c Country(c)] ⇒ [Border (c, India) ∧ 59. P(cavity ∨ toothache) is __________.
Border (c,Pakistan)]
(a) 0.200
(d) ∃c Border (Country(c), India ∧ Pakistan) (b) 0.120
Ans. (a) : ∃c Country(c) ∧ Border (c, India) ∧ Border (c) 0.280
(c,Pakistan) (d) 0.600
56. Next five questions are based on the following Ans. (c) :
passage. = 0.108 + 0.012 + 0.072 + 0.008 + 0.016 + 0.064
Consider a domain consisting of three Boolean = 0.280
variables Toothache, Cavity, and Catch. The

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 392 YCT
 Search on TG: @apna_pdf
60. The probability for Cavity, given that either 63. Given a fixed‐ ‐length record file that is
Toothache or Catch is true, P(Cavity | ordered on the key field. The file needs B disk
toothache ∨ catch) is _______. blocks to store R number of records. Find the
(a) 0.6000 average access time needed to access any
(b) 0.5384 record of the given file using binary search.
(c) 0.8000
(d) 0.4615 B
(a)
Ans. (d) : P(cavity | toothache ∨ catch) 2
= cavity and (toothache or catch) | (catch or (b) B + R
toothache) (c) B
= (0.108 + 0.012 + 0.072)| 0.416 (d) log2 B
= 0.4615 Ans. (d) : log2 B
61. Which of the DBMS component ensures that 64. Given the following STUDENT‐ ‐COURSE
concurrent execution of multiple operations on scheme: STUDENT (Rollno, Name, courseno)
the database results into a consistent database COURSE (courseno, coursename, capacity),
state? where Rollno is the primary key of relation
(a) Logs STUDENT and courseno is the primary key of
(b) Buffer manager relation COURSE. Attribute coursename of
COURSE takes unique values only. Which of
(c) File manager
the following query(ies) will find total number
(d) Transaction processing system
of students enrolled in each course, along with
Ans. (d) :Transaction Processing System :- A its coursename.
transaction processing system (TPS) is a type of A. SELECT coursename, count(*) 'total' from
information system that collect, stores, modifies and STUDENT natural join COURSE group by
retrieves the data transactions of an enterprise. coursename;
In order to qualify as a TPS, transactions made by the B. SELECT C.coursename, count(*) 'total'
system must pass the ACID test. The ACID tests refers from STUDENT S, COURSE C where
to the following four requisites : - S.courseno=C.courseno group by
1) Atomicity coursename;
2) Consistency C. SELECT coursename, count(*) 'total'
3) Isolation from COURSE C where courseno in
4) Durability (SELECT courseno from STUDENT);
TPS provides, Rapid response, continuous availability (a) A and B only
data integrity, Ease of use. (b) C only
ex - Online transaction processing (OLTP), Real time (c) A only
transaction. (d) B only
62. Consider following two statements: Ans. (a) : A and B only
Statement I: Relational database schema 65. Given the following STUDENT‐ ‐COURSE
represents the logical design of the database. scheme: STUDENT (Rollno, Name, Courseno)
Statement II: Current snapshot of a relation COURSE (Courseno, Coursename, Capacity),
only provides the degree of the relation. where Rollno is the primary key of relation
In the context to the above statements, choose STUDENT and Courseno is the primary key of
the correct option from the options given relation COURSE. Attribute Coursename of
below: COURSE takes unique values only. The
(a) Statement I is TRUE but Statement II is number of records in COURSE and STUDENT
FALSE tables are 3 and 5 respectively. Following
(b) Statement I is FALSE but Statement II is relational algebra query is executed:
TRUE R=STUDENT X COURSE
Match List-I with List-II in context to the
(c) Both Statement I and Statement II are FALSE
above problem statement.
(d) Both Statement I and Statement II are TRUE
List - I List - II
Ans. (a) : Degree of relationship represents the number
of entity types that associated in a relationship. Types of A. Degree of table R i. 15
degree are, unary, Binary, Temary, N- ary. B. Cardinality of table R ii. NIL

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 393 YCT
 Search on TG: @apna_pdf
C. Foreign key of relation iii. 6 Choose the correct answer from the options
STUDENT given below:
D. Foreign key of relation iv. Courseno (a) C only
COURSE (b) B and C only
(c) A and C only
Choose the correct answer from the options
given below: (d) B only
(a) A ‐III , B ‐I , C ‐IV , D ‐ II Ans. (c) : A and C only
(b) A ‐I , B ‐III , C ‐IV , D ‐ II 68. A company is consuming parts in the
manufacturing of other products. Each of the
(c) A ‐I , B ‐III , C ‐IV , D ‐ II part is either manufactured within the
(d) A ‐I , B ‐III, C ‐II , D ‐ IV company or purchased from the external
Ans. (a) : suppliers or both. For each part, partnumber,
List -I List-II partname is maintained. Attribute
batchnumber is maintained if the consumed
A. Degree of table R iii. 6 part is manufactured in the company. If part is
B. Cardinality of table R i. 15 purchased from external supplier, then
C. Foreign key of relation iv. Courseno supplier name is maintained. Which of the
STUDENT following constraints need to be considered
D. Foreign key of relation ii. NIL when modelling class/subclass concepts in ERD
COURSE for the given problem.
(a) Total specialization and overlapping
66. Suppose a B+ tree is used for indexing a constraints
database file. Consider the following (b) Disjoint constraint only
information: size of the search key field= 10 (c) Partial participation
bytes, block size = 1024 bytes, size of the record (d) Partial participation and disjoint constraints
pointer= 9 bytes, size of the block pointer= 8 Ans. (a) : Total specialization and overlapping
bytes. constraints
Let K be the order of internal node and L be 69. A transaction may be in one of the following
the order of leaf node of B+ tree, then (K, states during its execution life cycle in
L)=______. concurrent execution environment.
(a) (57, 53) A. FAILED
(b) (50, 52) B. TERMINATED
(c) (60, 64) C. PARTIALLY COMMITTED
(d) (34, 31) D. COMMITTED
E. ACTIVE
Ans. (a) : 57, 53
Given a transaction in active state during its
Sol. Internal Node :- execution, find its next transitioned state from
n * Pb + (n – 1)keys ≤ BS the options given below:
k * 8 + (k – 1) 10 ≤ 1024 (a) A only (b) Either A or C only
8k + 10k – 10 ≤ 1024 (c) C only (d) D only
1024 Ans. (b) : Either A or C only
k≤ = 57
18 70. Which of the following is used to create a
Leaf Node :- database schema?
Pb (n – 1) (key + record) ≤ BS (a) DML (b) DDL
8 + (L – 1)(10 + 9) ≤ 1024 (c) HTML (d) XML
19L ≤ 1033 Ans. (b) : The DDL commands in SQL are used to
create database schema and to define the type and
1033
L≤ = = 53 structure of the data that will be stored in a data base.
19 Sql DDL commands are further divided into the
67. Given a relation scheme R(x,y,z,w) with following major categories : create, alter, drop, truncate.
functional dependencies set F={x y, z w}. All 71. Given memory access time as p nanoseconds
attributes take single and atomic values only. and additional q nanoseconds for handling the
A. Relation R is in First Normal FORM page fault. What is the effective memory access
B. Relation R is in Second Normal FORM time if a page fault occurs once for every 100
C. Primary key of R is xz instructions?

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 394 YCT
 Search on TG: @apna_pdf
q C. Interrupt vector contains the memory
(a) p +
100 addresses for speciaized interrupt handlers.
p+q In the context of above statements, choose the
(b) correct answer from the options given below:
100
(a) A is TRUE only
(c) p + q
(b) Both B and C are TRUE only
p (c) Both A and B are TRUE only
(d) +q
100 (d) Both A, C are TRUE only
Ans. (a) : Given, memory Access Time = P Ans. (b) : Both B and C are TRUE only
nanoseconds. 74. Match List-I with List-II
Page Fault service Time = q nanoseconds. List - I List - II
one page fault occurs for every 100 instructions. System calls Description
Formula: A. fork() i. Sends a signal from one
Effective Memory Access Time (EMAT) = process to another
Page fault rate * Page fault service time + (1 – Page process
fault rate) * Memory Access time B. exec() ii. Indicates termination of
Calculation: the current process
Page fault rate = 1/100 {since, 1 page every 100 C. kill() iii. Loads the specified
instruction} program in the memory
EMAT : 1/100 * q + (1 – 1/100) * P D. exit() iv. Creates a child process
q P Choose the correct answer from the options
= +P− given below:
100 100
(a) A ‐ II , B ‐ III , C ‐ IV , D ‐ I
q P
= P+ {Since, is too small, (b) A ‐ IV , B ‐ III , C ‐ I , D ‐ II
100 100
(c) A ‐ IV , B ‐ I , C ‐ II , D ‐ III
we can neglect it}
(d) A ‐ IV , B ‐ III , C ‐ II, D ‐ I
72. In a file allocation system, the following Ans. (b) : Fork () : Fork system call is used for creating
allocation schemes are used: a new process, which is called child process, which runs
A. Contiguous currently with the process that makes the fork() call
B. Indexed (pavement process.)
C. Linked allocation exec() : The exec() family of functions replaces the
Which of the allocation scheme(s) given above current process image with a new process image. It
will not suffer from external fragmentation? loads the program into the current process space and
runs it from the entry point.
Choose the correct answer from the options
Kill() : kill is a command that is used in several, popular
given below:
operating systems to send signals to running process.
(a) A only
Exit() : exit() terminates the calling process
(b) B and C only "immediately"
(c) A and B only 75. Consider the following 3 processes with the
(d) C only length of the CPU burst time given in
Ans. (b) : Contiguous allocation suffer from external milliseconds:
fragmentation. But Linked and indexed allocations are Process Arrival Time Burst Time
non-contiguous, so they will not suffer from external P1 0 8
fragmentation. P2 1 4
73. Given below are three statements related to P3 2 9
interrupt handling mechanism What is the average waiting time for these
A. Interrupt handler routine is not stored at a processes if they are scheduled using
fixed address in the memory. preemptive shortest job first scheduling
B. CPU hardware has a dedicated wire called algorithm?
the interrupt request line used for handling (a) 5.5 (b) 2.66
interrupts (c) 4.66 (d) 6

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 395 YCT
 Search on TG: @apna_pdf
Ans.(c): Whenever new process arrives, there may be Ans. (b) : 4 kb = 22 ×210 = 212 B
pre-emption of the running process, based on burst LAS 232
time. No. of page = = =
page size 212
Process Arri
val
Bur
st
complet
ion CT
TAT WT Respo
nse
= 232–12 = 220
time Ti Time 78. Read the following and answer the questions:
me Consider a machine with 16 GB main memory
P1 0 8 12 12 4 0 and 32‐ ‐bits virtual address space, with page
P2 1 4 5 4 0 0 size as 4KB. Frame size and page size is same
for the given machine.
P3 2 9 21 19 10 11
What is the minimum number of bits needed
35 14 for the physical address?
Avg = Avg =
P1 P2 P2 P1 P3 5 3 (a) 28
= 11.33 = 4.66 (b) 34
0 1 2 5 12
21
(c) 24
(d) 12
76. Read the following and answer the questions:
Ans. (b) : ∵ Physical Address space = 16 GB = 234
Consider a machine with 16 GB main memory
∴ 34 number of bits needed for the physical address.
and 32‐ ‐bits virtual address space, with page
79. Read the following and answer the questions:
size as 4KB. Frame size and page size is same
Consider a machine with 16 GB main memory
for the given machine. and 32‐ ‐bits virtual address space, with page
The number of bits reserved for the frame size as 4KB. Frame size and page size is same
offset is ______. for the given machine.
(a) 12 (b) 14 What is the size of page table for handling the
(c) 32 (d) 8 given virtual address space, given that each
page table entry is of size 2 bytes?
Ans. (a) : Physical Address space = 16 GB
(a) 2MB
= 24 × 230 =234
(b) 2 KB
Virtual Address space = 232 (c) 32 MB
Page size = 4 kb = 22 ×210 = 212 (d) 12KB
Ans. (a) : No. of entries in page table = No. of page in a
process = 220
Size of page table = 2 × 220
= 2 × 1 MB
= 2 MB

So bits reserved for frame of set = 12

77. Read the following and answer the questions:
Consider a machine with 16 GB main memory
and 32‐ ‐bits virtual address space, with page
size as 4KB. Frame size and page size is same
for the given machine.
Find number of pages required for the given
virtual address space.
(a) 210
80. Read the following and answer the questions:
(b) 220
Consider a machine with 16 GB main memory
(c) 230
and 32‐
‐bits virtual address space, with page
(d) 212

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 396 YCT
 Search on TG: @apna_pdf
size as 4KB. Frame size and page size is same (a) 16, 8x1
for the given machine. (b) 8, 16x1
If a process of size 34KB is to be executed on (c) 8, 8x1
this machine, then what will be the size of
(d) 16, 16x1
internal fragmentation for this process?
(a) 4 KB Ans. (a) : N = 8, K = 16
(b) Zero If there are 'N' number of K-bit registers
(c) 1KB then,
(d) 2 KB No. of mux = K = 16
Ans. (d) : 2 KB Size of mux = N×1 = 8×1
Page size = 4 KB 84. Which of the following is not an example of
= Break process into pages pseudo‐
‐instruction?
34KB (a) ORG
= = 8.- - -
4KB (b) DEC
alot Fragmetion 8 time (c) END
(d) HLT
34 – 4 = 30 8×4 = 32 KB Ans. (d) : HLT
30 – 4 = 26 process of size = 34 KB Pseudo - instruction :-
26 – 4 = 22 34 – 32 = 2 KB ⇒ do not perform any operation on data
... ... .. .. ... (Freagmentaion) Ans. ⇒ giving some into to the a sembler
... ... .. .. ...
⇒ 4 Pseudo - instn,
8 time
ORG → origin
⇒
END
81. Match List-I with List-II
Dec → decimal
List -I List -II
HEX
A. Odd i. NAND gate
Function 85. The reverse Polish notation of the following
B. Universal ii. XOR gate infix expression [A*{B+C*(D+E)}] / {F*(G+H)}
Gate is__________.
C. 2421 code iii. Amplification (a) ABCDE+*+*FGH+*/
D. Buffer iv. Self‐
‐Complementing (b) ABCDE*++*FGH+*/
(c) ABCDE+*+*FGH*+/
Choose the correct answer from the options
given below: (d) ABCDE+**+FGH+*/
(a) A ‐ I, B ‐ II, C ‐ III, D ‐ IV Ans. (a) : ABCDE+*+*FGH+*/
(b) A ‐ II, B ‐ I, C ‐ IV, D ‐ III 86. Arrange the following in the increasing order
(c) A ‐ I, B ‐ III, C ‐ II, D ‐ IV of complexity.
(d) A ‐ IV, B ‐ II, C ‐ III, D ‐ I A. I/O Module
Ans. (b) : A ‐ II, B ‐ I, C ‐ IV, D ‐ III B. I/O processor
82. The Octal equivalent of hexadecimal (D.C)16 is: C. I/O Channel
(a) (15.6)8 D. DMA
(b) (61.6)8 Choose the correct answer from the options
(c) (15.3)8 given below
(d) (61.3)8 (a) D, C, B, A
Ans. (a) : (15.6)8 (b) C, D, A, B
83. A digital computer has a common bus system (c) A, B, C, D
for 8 registers 16 bits each. How many (d) A, D, C, B
multiplexers are required to implement Ans. (d) : I/O Module<DMA< I/O channel< I/O
common bus? What size of multiplexers is processar.
required?
UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 397 YCT
 Search on TG: @apna_pdf
87. The characteristics of the combinational (a) A
circuits are: (b) B
A. Output at any time is function of inputs at (c) C
that time (d) D
B. Contains memory elements Ans. (b) : Program Control instruction :-The
C. Do not have feedback paths program control instructions control the flow of
program execution and are capable of branching to
D. Clock is used to trigger the circuits to obtain
different program segments. Some of the program
outputs control instructions are listed in the table.
Choose the correct answer from the options Name Mnemonics
given below: Branch BR
(a) A and B only Jump JMP
(b) B and C only Skip SKP
(c) A and C only Call Call
(d) B and D only Return RET
Ans. (c) : A and C only Compare CMP
(by subtraction)
88. The cache coherence problem can be solved
Test TST
A. by having multiport memory
91. Match List-I with List-II
B. allow only nonshared data to be stored in
List - I List - II
cache
A. Data Link i. True end-to-end
C. using a snoopy cache controller
Layer layer
D. uisng memory interleaving
B. Network ii. Token Management
Choose the correct answer from the options Layer
given below:
C. Transport iii. Produce billing
(a) A and C only Layer information
(b) B and C only D. Session iv. Piggybacking
(c) D and C only Layer
(d) B and D only Choose the correct answer from the
Ans. (b) : B and C only options given below:
89. Given below are two statements (a) A ‐ IV, B ‐ III, C ‐ I, D ‐ II
Statement I: CISC computers have a large of (b) A ‐ IV, B ‐ II, C ‐ I, D ‐ III
number of addressing modes. (c) A ‐ II, B ‐ III, C ‐ I, D ‐ IV
Statement II: In RISC machines memory (d) A ‐ IV, B ‐ I, C ‐ III, D ‐ II
access is limited to load and store instructions. Ans. (a) : Data Link Layer : pigybacking is sometimes
In light of the above statements, choose the referred to as "wi-fi squatting". The usual purpose of
correct answer from the options given below: piggybacking is simply to gain free network access
(a) Both Statement I and Statement II are true rather than any malicious intent, but it can slow down
(b) Both Statement I and Statement II are false data transfer for legitimate users of network.
(c) Statement I is true but Statement II is false Transport Layer : Responsible for true end-to-end
layer from source to destination. It is termed as and end-
(d) Statement I is false but Statement II is true to-end layer because it provides a point to point
Ans. (a) : Both statements are true connection rather than hop to hop. It reliably deliver the
90. Which of the following statement is true? services between the source-host and destination host.
A. Control memory is part of the hardwired Session Layer : is responsible for establishing
managing, synchronizing and termination session
control unit.
between end-user application processes. It works as a
B. Program control instructions are used to dialog, controller. It allows the system to communicate
alter the sequential flow of the program. in either. Half duplex or full duplex mode of
C. The register indirect addressing mode for communication. It is responsible for token management.
accessing memory operand is similar to Network Layer :- subnet usage accounting : has
displacement addressing mode. accounting functions to keep track of frames forwarded
D. CPU utilization is not affected by the by subnet intermediate systems, to produce billing
introduction of Interrupts. information.

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 398 YCT
 Search on TG: @apna_pdf
92. Given below are two statements (a) Half the baud rate
Statement I : Telnet, Ftp, Http are application (b) twice the baud rate
layer protocol (c) Thrice the baud rate
Statement II: The Iridium project was planned (d) Same as the baud rate
to launch 66 low orbit satellites. Ans. (a) : In manchester encoding, 2 signals changes to
In light of the above statements, choose the represent a bit. So the baud rate = 2*bit rate so that bit
correct answer from the options given below: rate is half the baud rate.
(a) Both Statement I and Statement II are true
95. The address of class B host is to be split into
(b) Both Statement I and Statement II are false
subnets with 6‐ ‐bit subnet number. What is
(c) Statement I is true but Statement II is false
the maximum number of the subnets and the
(d) Statement I is false but Statement II is true
maximum number of hosts in each subnet?
Ans. (a) : Both statement are true. (a) 62 subnets and 262142 hosts
93. Which of the following statement is False? (b) 64 subnets and 1024 hosts
(a) Packet switching leads to better utilization of (c) 64 subnets and hosts 262142
bandwidth resources than circuit switching. (d) 62 subnets and 1022 hosts
(b) Packet switching results in less variation in
Ans. (d) : In class B
the delay than circuit switching.
First 2 octet are reserved for NID and remaining for
(c) Packet switching sender and receiver can use
HID... so first 6 - bits of 3rd octet are used for subnet
any bit rate, format or framing method unlike
and remaining 10 bits for host... maximum number of
circuit switching.
subnets = 26 –2 = 62 Note that 2 is subtracted because
(d) Packet switching can lead to reordering
subnet value consisting of all zeros and all ones
unlike circuit switching
(broadcast), reducing the number of available subnets
Ans. (b & c) : Packet– Switched networks move data by two in classical subnetting. In modern networks we
in separate, small packets based on the destination can have 64 as well and no of hosts = 210 –2 = 1022 so
address in each packet. When received, packets are total 62 subnets and 1022 hosts.
reassembled in the proper sequence to make up the
96. In electronic mail, which of the following
message.
protocols allows the transfer of multimedia?
Circuit- Switched networks : required dedicated point-
(a) IMAP
to-point connections during calls.
(b) SMTP
• Packet switching leads to better utilization of
(c) POP3
bandwidth resources than circuit switching //
(d) MIME
Because data move in packets therefore better use
of resources. Ans. (d) :IMAP :- is for the retrieval of emails and
SMTP is for the sending of emails. That means IMAP
• Packet switching results in less variation in delay
talks to both the client and server to get emails, and
than circuit switching // Queueing delay
SMTP talks only to servers to send emails.
flunctuation is more in packet switching as there is
no dedicated path. POP3/IMAP :- Post office protocol (POP) is an
application layer Internet standard protocol used by
• Packet switching requires more per packet local e-mail clients to retrieve email from a remote
processing than circuit switching // All the info
server over a TCP/IP connection. Virtually all modern
needs to be in packet as well as packet
e-mail clients and servers support POP3, and it along
reassembling has to be done at end therefore more
with IMAP (Internet Message Access Protocols) are the
processing.
two most prevalent Internet standard protocols for email
• Packet switching can lead to reordering unlike in retrieval, with IMAP (Internet Message Access
circuit switching // because reassembling is done at Protocol) are the two most prevalent Internet standard
destination, packing reordering might occur. protocols for emails retrieval, with many webmail
94. In Ethernet when Manchester coding is used, service provides such as Google mail, Microsoft mail
the bit rate is__________. and Yahoo!

UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 399 YCT
 Search on TG: @apna_pdf
MIME :- MIME stands for multipurpose Internet mail
Extensions. It is used to extend the capabilities of
Internet e-mail protocols such as SMTP. The MIME
protocols allows the users, to exchange various types of
digital content such as pictures, audio, video, and
various types of documents and files in the e-mails.
97. A message is encrypted using public key
cryptography to send a message from sender to
receiver. Which one of the following statements
is True?
(a) Sender encrypts using receiver's public key
So, connect option is (A) sender encrypts using
(b) Sender encrypts using his own public key receiver's public key.
(c) Receiver decrypts using sender's public key 98. Which of the following statements are true?
(d) Receiver decrypts using his own public key A. Frequency division multiplexing technique
Ans. (a) : In Public key cryptography, both sender and can be handled by digital circuits.
receiver generate a pair of keys, – public key and B. Time division multiplexing technique can be
private key. Public keys are known globally. suppose A handled by analog circuits
is sender and B is the receiver. C. Wavelength division multiplexing technique
is used with optical fiber for combining two
So, A has 3 keys : signals.
1. Public key of A (everyone knows) D. Frequency division multiplexing technique
2. Private key of A (only A knows) can be applied when the bandwidth of a link is
3. Public key of B (Everyone knows) greater than the bandwidth of the signals to be
And B also has 3 keys : transmitted.
Choose the correct answer from the options
1. Public key of B (Everyone knows)
given below:
2. Private key of B (only B knows) (a) B and D only (b) C and D only
3. Public key of A (Everyone knows) (c) A and D only (d) B and D only
• Anything that is encrypted using public key of A can Ans. (b) : C and D only
be decrypted only using private key of A. 99. Which of the following statements are true?
• Anything that is encrypted using private key of A can A. X.25 is connection-oriented network
be decrypted only using public key of A. B. X.25 doesn't support switched virtual
• Anything that is encrypted using public key of B can circuits.
be decrypted only using private key of B. C. Frame relay service provides
acknowledgements.
• Anything that is encrypted using private key of B can
D. Frame relay service provides detection of
be decrypted only using public key of B. transmission errors.
Now A wants to send a secret message to B. so for Choose the correct answer from the options
encryption : A has following 3 options : given below:
1- Public key of A (Everyone knows) : So for (a) A and D only (b) B and D only
decryption B needs - Private key of A - only A knows (c) C and D only (d) B and C only
it. So, B will not be able to decrypt it. Ans. (a) : A and D only
2. Private key of A (only A knows) So, for decryption B 100. Let G(x) be the generator polynomial used for
needs - public key of A - Everyone known it. So CRC checking. The condition that should be
everyone can decrypt it. So it is of no use. satisfied by the G(x) to catch all errors
consisting of an odd number of inverted bits is:
3. Public key of B (Everyone knows) : So, for
(a) (x+1) is factor of G(x)
decryption B needs - private key of B - only B knows it.
(b) (x‐1) is factor of G(x)
So only B will able to decrypt it (That's what we want)
(c) (x2 +1) is factor of G(x)
So for providing security.
(d) (1‐x2 ) is factor of G(x)
Sender encrypts using receiver's public key and
Ans. (a) : (x+1) is factor of G(x)
Receiver decrypts using his own.
UGC NTA NET JRF Computer Science Dec. 2020-June 2021 P-II 400 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. Dec. 2021-June 2022

COMPUTER SCIENCE
(Solved with Explanation) (Exam : 8.10.2022)
1. For multiprocessor system, interconnection Final solution.
network - cross bar switch is an example of String made by numerators = 101111110
(a) Non blocking network String made by denominators = 101111110.
(b) Blocking network As you can see, string are same.
(c) That varies from connection to connection List - A List - B
(d) Recurrent network Y: 10 101 List A = numerator
Ans. (a) : For a multiprocessor system, interconnection 0111 11 List B = denominator
network- crossbar switch is an example of non-blocking 101 011
network. • The first index has to be 1 because only the pair 10 and
A non-blocking network is a type of inter connection 101 begin with the same symbol.
network in which concurrent communication can occur • Then whatever indexes we choose to continue, there will
between multiple nodes without blocking. The crossbar be more 1's in the string constructed from the first list
switch is a non-blocking network because it can than the second (because in each corresponding pair
connect any input to any output with out any blocking. there are at least as many 1's in the second list).
This allows for efficient communication and data Thus the two string cannot be equal so correct answer is (a).
transfer between multiple processors memory modules 3. Using 'RSA' algorithm, if p = 13, q = 5 and e =
and input/output devices in a multiprocessor system. 7, the value of d and cipher value of '6' with (e,
2. Consider two lists A and B of three strings on n) key are
{0, 1} (a) 7, 4 (b) 7, 1
(c) 7, 46 (d) 55, 1
List A List B
Ans. (c) : RSA algorithm is an asymmetric
1 111 cryptography algorithm there should be two key
X: involve while communicating i.e. public key and
10111 10
private key. There are simple steps to solve problems
10 0 on the RSA algorithm.
Steps
List A List B 1. Select two prime number 'p' and 'q'.
10 101 2. Calculate n = p × q
Y:
011 11 3. Calculate φ (n) = (p –1) × (q – 1)
4. Choose value of e
101 011 1 < e < φ (n) and gcd (φ (n), e) = 1
Which of the following is true? 5. Calculate
(a) Only PCP in X has solution d = e–1 mod φ (n)
(b) Only PCP in Y has solution or de = mod φ (n)
(c) PCP in both X and Y has solution 6. Public key = {e, n}
(d) PCP neither in X nor in Y has solution 7. Private key = {d, n}
Given that in question
Ans. (a) : Given string on {0, 1} P = 13, q = 5 and e = 7
List - A List - B n = 13 × 5 = 65
X: 1 111 List A = numerator φ(n) = (13 – 1) (5 – 1) = 48
10111 10 List B = denominator So given e = 7 as 1 < 7 < 48
10 0 and gcd (7, 48) = 0
We will start with title in which numerator and Now
denominator are starting with same number, so we can ed = 1 mod φ (n)
start with either 1 or 2. Let go with second tile, string made 7 × d = 1 mod φ (n)
by numerator – 10111, string made by denominator is 10. So (7 × d) mod 48 = 1
• We need 1s in denominator to match 1s in number so So d = 1, 7 possible
we will go with first tile, string made by numerator is Since e = 7, d = 7, P = 6
10111,1 string made by denominator is 10111. Public key = {e, n} = {7, 65}
• There is extra 1 is numerator to match this 1 we will Private key = {d, n} = {7, 65}
add first tile in sequence, string made by numerator is Cipher text (c)
now 10111 11, string made by denominator is 10. C = P mod n
• Now there is extra 1 in denominator to match it we C = 67 mod 65
will add third tile, string made by numerator is 10111 C = 279936 mod 65
11 10 string made by denominator is. C = 46
10 111 1110. So option (c) is correct.

UGC NTA NET JRF Computer Science Dec. 2021-June 2022 P-II 401 YCT
 Search on TG: @apna_pdf
4. Consider the following statements about (C) Inheritance (III) Attaches a
Context free Language (CFL) number with
Statement I : CFL is closed under each
homomorphism possibility
Statement II : CFL is closed under complement (D) Probability (IV) Representing
Which of the following is correct? mode concepts,
(a) Statement I is true and Statement II is false events, time,
(b) Statement II is true and Statement I is false physical
(c) Both Statement I and Statement II are true concepts of
different
(d) Neither Statement I nor Statement II is true domains
Ans. (a) : Context Free Language (CFL) A B C D
CFL's are closed under union, concatentation and (a) (II) (I) (IV) (III)
Kleene closure. Also, under reversal homomorphisms (b) (I) (II) (III) (IV)
and inverses homomorphisms but not closed under (c) (IV) (III) (I) (II)
intersection or complement. (d) (IV) (I) (II) (III)
By definition
Ans. (d) : Ontological Engineering is a large-scale
Option (a) is correct answer. representation of abstract concepts such as action, time,
5. Size and complexity are a part of physical objects and beliefs would be an example of
(a) People Metrics Ontological engineering.
(b) Project Metrics So A → (iv)
(c) Process Metrics Taxonomy Hierarchy– Taxonomic hierarchy is the
(d) Product Metrics process of arranging various organisms into successive
Ans. (d) : Software metrics can be classified into three levels of the biological classification either in a
categories. decreasing or an increasing order from kingdom to
species and vice versa.
Product metrics–Describes the characteristics of
product such as size complexity, design features, So B → (i)
performance and quality level. Inheretance– An inherected class is called a subclass
Process metrics–These characterstics can be used to of its parent class or super class. The term
‘‘inheritance’’ is loosely used for both class-based and
improve the development and maintenance activities of prototype-based programming, but in narrow use the
the software. term is reserved for class-based programming. (One
Project metrics–This metrics describe the project class inherits from another), with the corresponding
characteristics and execution. technique is prototype based programming being
So correct answer is product metrics. instead called delegation (one object delegates to
6. The solution of the recurrence relation T(n) = another.
( )
3T n + nlgn is
4
So (C) → (II)
Probability mode– A probability model is a
(a) θ ( n 2 lg n )
mathematical representation of a random phenomenon.
(b) θ ( n lg n ) It is defined by its simple space, events within the
(c) θ ( n lg n )
2
(d) θ ( n lg lg n ) simple space and probabilities associated with each
event.
Ans. (b) : The master theorem D → III.
Recurrence relations of the form T(n) = a T (n/b) + f So option (d) is correct answer.
(n), where a, b > 0 are constant, and f (n) is an 8. A 4-stage pipeline has the stage delay as 150,
asymptotically positive function. 120, 160, and 140 ns respectively. Registers
given that: that are used between the stages have delay of
recurrence relation T(n) = 3T (n/4) + nlgn 5 ns. Assuming constant locking rate, the total
So, a = 3, b = 4, f (n) = nlgn time required to process 1000 data items on
Using master theorem, we can see that the solution to this pipeline is
a 3
the recurrence is T(n) = θ (nlgn), since logb = log4 = 1 (a) 160.5 ms (b) 165.5 ms
and f(n) = nlgn = θ (nlgn). (c) 120.5 ms (d) 590.5 ms
So correct answer is option (b). Ans. (b) : K stage pipeline can process n task in Tk time
7. Match List I with List II: Tk = [k + (n – 1)] τ
When τ = τm+d where τm is the maximum stage delay
List I List II and d is delay max (150, 120, 160, 140)
(A) Ontological (I) Organizing = 160
Engineering subclass τ = 160 + 5 = 165 ns
–3
relations τ = 165 × 10 ms
(B) Taxonomy (II) Organizing k = 4, n = 1000
Hierarchy knowledge T = [4 + (1000 – 1)] τ
–3
into category = 1003 × 165 × 10
and sub τ = 165.5ms
category So option (b) is correct.

UGC NTA NET JRF Computer Science Dec. 2021-June 2022 402 YCT
 Search on TG: @apna_pdf
9. The number of nodes of height h in any n - 11. In reference to Big data, consider the following
element heap is atmost : database:
n n n −1 (A) Memcached
(a) n h +1 (b) h −1 (c) h (d) h −1 (B) Couch DB
2 2 2 2 (C) Infinite graph
Choose the most appropriate answer from the
Ans. (a) : options given below.
(a) (A) and (B) only
(b) (A) and (C) only
(c) (A) and (B) only
(d) (A) (B) and (C) only
Ans. (d) : Big data – The definition of big data is data
that contains greater variety, arriving in increasing
volume and with more velocity.
This is also known as the three vs.
The three V3 means volume, velocity, variety.
Heap sort is a comparison based sorting technique Memcached is a free and open source high-
based on binary heap data structure where we first find performance memory caching system. It's typically
the maximum element and place the minimum element used to cache data base data, API call or page rendering
at the beginning. Repeat the same process for the chunks in RAM to increase the application
remaining element such as- performance.
Height of the node with data 4 is 3 height of the node It can store data as little as a number or as big, as a
with data 2, 6 is 1 height of the node with data 1, 3, 5, 7 finished HTML page.
is 0 number of nodes present at height ‘h’ in Couch DB is an open source database developed by
 n  Apache software foundation. The focus is on the ease of
heap/complete binary tree = ceil   . In above use embracing the web. It is a No SQL document store
 2h+2  database.
heap, find number of nodes at height 1 The prominent big data analytics tools that use non-
n = 7, h = 1 relation databases are Mongo DB cassandra, oracle No-
 n  7 SQL and Apache Couch DB.
N = ceil   = ceil   = 2 Couch DB is a NoSQL database for document storage.
2 
h +1
4 Documents are the fundamental unit of data in Couch
Node with data 2 and 6 are present at height 1. DB, and they also contain metadata.
So option (1) is correct. Infinite graph is a distributed graph database
++
10. Consider the following statements: implementated in Java and C and is from a class of
Satement I : Conservative 2 PL is a deadlock- NOSQL database technologies that focus on graph data
free protocol. structures. Developers use infinite graph to find useful
Statement II : Thomas's write rule enforces and often hidden relationship in highly connected,
conflict serializability. complex big data set.
So option (a), (b) and (c) is correct answer.
Statement III : Timestamp ordering protocol
ensures serializability based on the order of 12. Consider the hash table of size 11 that uses
transaction timestamps. open addressing with linear probing. Let h(k) =
Which of the following is correct? k mod 11 be the hash function. A sequence of
records with keys 43, 36, 92, 87, 11, 47, 11, 13,
(a) Statement I, Statement II true and Statement 14 is inserted into an initially empty hash table,
III false the bins of which are indexed from 0 to 10.
(b) Statement I, Statement III true and Statement What is the index of the bin into which the
II false least record is inserted?
(c) Statement I, Statement II false and Statement (a) 8 (b) 7
II true (c) 10 (d) 4
(d) Statement I, Statement II and Statement III Ans. (b) : Given that
true hash table of size = 11
Ans. (b) : Statement I: Conservation 2 PL is a deadlock hash function = h(k) = k mod 11
free protocol. sequence of records with keys
This is correct statement. 43, 36, 92, 87, 11, 47, 11, 13, 14
Statement II: Thomas's write rule enflict serializability.
‘‘Thomas write rule allows schedules that do not h (1) = 43% 11 = 10
conflict seriabilzable schedules satisfy the definition of h (2) = 36% 11 = 3
view serializable schdules. The Thomas write rule is a h (3) = 92% 11 = 4
concurrency control modification of the timestamp- h (4) = 87% 11 = 10
ordering protocol. The Thomas write rule is applied h (5) = 11% 11 = 0
when a predefined logical order is assigned to h (6) = 47% 11 = 3
transactions when they start.’’ Now collision occurs due to index places is same.
By definition statement II is false and statement III is The element is allotted next nearest place that is 1
true. index.
So option (b) is correct answer. h (5) = 11% 11 = 1
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 403 YCT
 Search on TG: @apna_pdf
h (6) = 47% 11 = 3
h (7) = 11% 11 = 2
h (8) = 13% 11 = 2
Now, collision occurs due to index places is same.
Index 3 is already allotted to h index (2) index (4) is
already allotted to n (3) index 5 is already allotted to
6.
The element is allotted next nearest place that is 6
index.
h (8) = 13% 11 = 6
h (9) = 14% 11 = 3
So
Now, collision occurs due to index places is same. 14. Which Metrics are derived by normalizing
Index 4 is already allotted to h (3). quality and/or productivity measures by
considering the size of the software that has
Index 5 is already allotted to h (3) been produced?
Index 6 is already allotted to h (8) (a) Function-Oriented Metrics
The element is allotted next nearest place that is 7 (b) Function-Point Metrics
index. (c) Line of Code Metrics
h (9) = 14% 11 = 7 (d) Size Oriented Metrics
0 87 Ans. (d) : Lines of Code (LOC) is a software metric
1 11 used to measure the size of a computer program by
counting the number of lines in the text of the program's
2 11 source code.
3 36 Size oriented software–Metrics are derived by
4 92 normalizing quality and productivity measures by
considering the size of the software that has be
5 47 produced.
6 13 Function oriented metrics–They are also known as
7 14 function point model.
So correct answer is size oriented software.
8
15. Assume that f(n) and g(n) are asymptotically
9 positive. Which of the following is correct
10 43 (a) f(n) = O (g(n)) and g(n) = O(h(n))⇒ f(n) =
Correct answer is 7. ω(h(n))
13. Consider the primal problem: (b) f(n) = Ω (g(n)) and g(n) = Ω(h(n))⇒ f(n) =
maximimze z = 5x1 + 12x2 + 4x3 Ο(h(n))
Subject to x1 + 2x2 + x3 = 10 (c) f(n) = o(g(n)) and g(n) = o(h(n))⇒ f(n) =
ο(h(n))
2x1 – x2 + 3x3 = 8
(d) f(n) = ω(g(n)) and g(n) = ω(h(n))⇒ f(n) =
x1, x2,x3 ≥ 0 Ω(h(n))
its dual problem is
Ans. (c) : Omega notation (Ω)
Minimize ω = 10y1 + 8y2 It is define as lower bound and lower bound on an
Subject to y1 + 2y2 ≥ 5 algorithm is the least amount of time required.
2y1 – y2 ≥ 12 f(x) define running time of an algorithm f(x) is said to
y1 + 3y2 ≥ 4 be Ω (g(n)) if there exists positive constant C and (n0)
Which of the following is correct? such that.
(a) y1 ≥ 0, y2 unrestricted 0 ≤ Cg(n) ≤ f(n) for all n ≥ n 0
(b) y1 ≥ 0, y2 ≥ 0 n = used to given lower bound on a function.
(c) y1 is unrestricted, y2 ≥ 0
(d) y1 is unrestricted, y2 restricted
Ans. (a) : Given that
Max Z = 5x1 + 12x2 + 4x3
Subject to x1 + 2x2 + x3 = 10
2x1 – x2 + 3x3 = 8
x1. x2 . x3 ≥ 0
Its dual problem is
Minimize w = 10y1 + 8y2 According to transitive property
subject to f(n) = o (g(n)) and g(n) = o (h(n)) ⇒ f(n) = o (h(n)) is
correct answer.
y1 + 2y2 ≥ 5
16. Fault base testing technique is
2y1 – y2 ≥ 12 (a) Unit testing (b) Beta testing
y1 + 3y2 ≥ 4 (c) Stress testing (d) Mutation testing
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 404 YCT
 Search on TG: @apna_pdf
Ans. (d) : Mutation testing purpose is to evaluate the Ans. (b) : Transport layer
quality of the case that should be able to fail the mutant • Transport layer is responsible for source to
code hence this method is also known as fault based destination delivery of the entire message.
testing as it used to produce an error in the program that • It divides each message into the packets at the source
why we can say that the mutation testing is performed and reasonable then at the destination.
to check the efficiency of the test cases. Network layer–The main function of this layer is to
deliver packets from source to destination across
17. A classeless address is given as multiple networks.
167.199.170.82/27. The number of addresses in • It translates logical network address in to physical
the network is machine address the number used as destination IDs
(a) 64 addresses (b) 32 addresses in the physical network cards.
(c) 28 addresses (d) 30 addresses Data link layer–The data link layer or layer 2, is the
Ans. (b) : To calculate the number of addresses in the second layer of the seven layers OSI model of computer
networking. The data link layer provides the functional
given network you can use the formula : 2(32–subnet_mask). and procedural means to transfer data between network
In this case, the subnet mask is /27 entities and may also provide the means to detect and
(Which means 27 bits are used for the network portion). possible correct errors that can occur in the physical layer.
So, the number of addresses = 2(32–27) So option (b) is correct.
= 25 21. Consider a memory system having address
= 32 addresses spaced at a distance of m. T = Bank cycle time
Therefore, the correct answer is option (b) 32 addresses. and n number of banks, then the average data
access time per word access in synchromous
18. Consider a B-tree of height h. minimum degree organization is.
t ≥ 2 that contains any n-key, where n ≥ 1.
 T
Which of the following is correct?  m, for m << n
n +1 n +1 (a) t =  n
(a) h ≥ log t (b) h ≤ log t  T for m >> n
2 2
n −1 n −1 T for m << n
(c) h ≥ log t (d) h ≤ log t (b) t =  n
2 2
 T for m >> n
Ans. (b) : In the case of B-tree with a minimum no of
i
keys, there is one key in the root, 2 nodes at depth 1, 2t –  m.T for m << n
(c) t = 
1 nodes at depth i.  T for m >> n
Let h be the height of the tree and n be the number of
nodes. Then  m.T for m << n
(d) t = m
n
for m >> n
n ≥ 1 + (t − 1)∑ 2t i − 1  T
i =1 Ans. (a) : Given that
n + 1 Distance at which address is spaced = m
Which workout to t h ≤ • Bank cycle time = T
2
• Number of bank = n
So, logt taking the both sides • When the distance at which address spaced is very
(n +1) less than the number of banks, that is, m << n, then
h ≤ log t the average data across time per word access is =
t
So option (b) is correct. T
m. .
19. Which of the following is an indirect measure n
of product? • When the distance at which address spaced much
(a) Quality (b) Complexity more than the number of banks that is m >> n, then
the average data access time per word access = T.
(c) Reliability (d) All of these
• Combining above two points, we get the average
Ans. (d) : Software Measurement data access time per word access in synchronous
Direct measures of software engineering process organisation as
include cost and effort.
• Direct measures of the product include lines of code  T
 m, for m << n
(LOC), execution speed, memory size, defects per t= n
reporting time period.  T for m >> n
• Indirect measures, examine the quality of the So option (a) is correct
software product itself, e.g. functionality, 22. Consider the language L = {anbm : n ≥ 4, m ≤ 3}
complexity, efficiency reliability maintainability. Which of the following regular expression
20. Which layer divides each message into packets represents language L?
at the source and re-assembles them at the (a) aaaa* (λ + b + bb + bbb)
destination? (b) aaaaa* (b + bb + bbb)
(a) Network layer (b) Transport layer (c) aaaaa* (λ + b + bb + bbb)
(c) Data link layer (d) Physical layer (d) aaaa* (b + bb + bbb)
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 405 YCT
 Search on TG: @apna_pdf
Ans. (c) : Given that Condition field has four status bits, it needs 4 bits for
n m
The language L = {a b : n ≥ 4, m ≤ 3} four different conditions branch field have four option
So so, it needs 2 bits for four option.
So there 7 bit are required for 128 different location.
• In the regular expression, there should be least four But BR field is used in conjuction with the address field
a (S). therefore the size of the address field is 7-2 = 5.
• In the regular expression, there should be at most 3 Intruction field is 20 bits.
b(s) So Statement I and Statement II is true.
So option (c) is correct. 25. Which mode as a block cipher implementation
*
aaaaa (λ + b + bb + bbb) there are compulsorily 4 a(S) as a self synchronizing stream cipher?
and than a = λ or ε
*
(a) Cipher Block Chaining Mode
After that, we have all possible combinations of b(S), (b) Cipher Feedback Mode
which can be 0 to at max. (c) Electronic Codebook Mode
23. Consider the following NPDA = ({q0, q1,qf} {a, (d) Output Feedback Mode
b}, {1, z}, δ, q0, z {qf}) Ans. (b) : Cipher Block Chaining Mode (CBC) is a
δ(q0, λ, z) = {(qf, z)} mode of operation for a block Chiper one in which a
δ(q0, a, z) = {(q1, 11z)} sequence of bits are encrypted as a single unit, or block,
δ(q1, a, 1) = {(q1, 111)} with a Chipher key applied to the entire block. Cipher
δ(q1, b, 1) = {(q1, λ)} block chaining uses what is know as an initialization
δ(q1, λ, z) = {(qf, z)} vector (IV) of a certain length.
Which of the following Language L is accepted Cipher Feedback Mode
by NPDA? In this mode the Cipher is given as feedback to the next
(a) L = {a2n bn : n ≥ 0} (b) L = {anb2n : n ≥ 0} block of encryption with some new specifications. First,
an Initial Vector (IV) is used for first encryption and
(c) L = {a2n bn : n > 0} (d) L = {an b2n : n > 0} output bits are divided as a set of 5 and b-s bits. The left
Ans. (a) : The NPDA (Non Deterministic Pushdown hand side 5 bits are selected along with plaintext bit to
Automata) starts in the initial state q0 with symbol z. which an XOR operation is applied.
When it reads the first symbol a it pushes 2's on the The result is given as input to a shift register having b-s
stack δ (q0, a, z) = (q1, 11z). bits to rhs, s bits to rhs and the process continues. The
and encryption and decryption process for the same is show
δ (q1, a, 1) = {q1, 111} so a = {11} below, both of them encryption algorithms.
δ (q1, b, 1) = {q1, λ} so b {λ} Electronic code book mode–Electronic code book is
When the stack becomes empty. the easiest block Cipher mode of functioning. It is
The NDPA transition to the final start qf (δ (q1, λ, z) = easier because of direct encryption of each block of
{qf, z} input plaintext and output is in form of blocks of
encrypted Ciphertext. Generally, if a massage is larger
Therefore the NPDA accepts the language than b bits in size, it can be broken down into a branch
2n n
L = a b : n ≥0 of block and the procedure is repeated.
24. Given below are two statements: Output Feedback Mode–The output feedback it
Statement I : Consider 20 bit 'Branch' involves feeding the successive output block form the
microinstruction code format given below: underlying block Cipher back to it.
3 3 3 2 2 7 So option (b) is correct.
F1 F2 F3 CD BR AD 26. Consider the following:
F1. F2. F3 : Micro-operation fields List I List II
CD : Condition for branching (A) Activation record (I) Linkage Loader
BR : Branch field (B) Location counter (II) Garbage
AD : Address field Collection
Statement II : Instruction represented in above (C) Reference ouput (III) Subroutine Cell
format can perform branch in 4 conditions. (D) Address (IV) Assembler
In the light of the above statements, choose the relocation
most appropriate from the options given below. Which of the following is correct mathcing?
(a) Both statement I and Statement II are correct A B C D
(b) Both statement I and Statement II are incorrect (a) (III) (IV) (I) (II)
(c) Statement I is correct but statement II is incorrect
(b) (IV) (III) (I) (II)
(d) Statement I is incorrect but statement II is correct
(c) (II) (III) (I) (IV)
Ans. (a) : Given statement I. (d) (II) (III) (I) (IV)
3 3 3 2 2 7
Ans.(*): Activation record – Subroutine call
F1 F3 F3 CD BR AD Location counter – Assembler
F1 F2 F3 : Microoperation fields Reference count – Garbage collection
CD : Condition for branching (2) Address relocation – Linking loader
BR : Branch field (2) 27. Alpha and Beta testing are forms of
AD : Address field (7)
F1, F2, F3 each having seven distinct microoperation. (a) White-Box Testing (b) Black-Box Testing
So, 3 bit are required for each. (c) Acceptance Testing (d) System Testing
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 406 YCT
 Search on TG: @apna_pdf
Ans. (c) : Alpha and Beta testing are forms of Ans. (a) : Evolutionary process model resembles the
acceptance testing and they both try to determine how interative model. The same phases are defined for the
an application and its features behave. waterfall model differs from the interative enhancement
• When the goal is to obtain Alpha and Beta tests are model in the sense that this does not require a useful
typically run. That way, every application of the product at the end of each cycle.
product can be tested and gather feedback internally In evolutionary development requirements are
and externally. implemented by a category rather than by priority.
• Both of the ensure a good quality product. 31. The condition num! = 65 cannot be replaced by
28. Consider the properties of recursively (a) num > 65 | | num < 65
enumerable sets : (b) ! (num = = 65)
(A) Finiteness (B) Context Freedom (c) num – 65
(C) Emptiness (d) ! (num – 65)
Which of the following is true? Ans. (d) : The condition ! (num – 65) evaluates to true if
(a) Only (A) and (B) are not decidable number is not equal to 65, and false if num is equal to 65.
(b) Only (B) and (c) are not decidable 32. Consider an error free 64 kbps satellite
(c) Only (C) and (A) are not decidable channel used on send 512 byte data frames in
(d) All (A), (B) and (C) are not decidable one direction with very short acknowledgements
Ans. (d) : Rice's theorem every non-trivial property ψ coming back the other way. What is the
of the recursively enumerable languages in indecidable. maximum throughput for window size of 15?
Consequences of Rice's theorem. (a) 32 kbps (b) 48 kbps
The following properties of recursively enumerable set (c) 64 kbps (d) 70 kbps
are not decidable. Ans. (c) : Given that
(i) Emptiness (ii) Finiteness Tranmission time for 1 frame = 512 byte
(iii) Regnlerity (iv) Context Freedom
So option (d) is correct. 512
The earth - Satellite = kbps
29. Which of the following is correct for the (64/8)
destination address 4A : 30 : 10 : 21 : 10 : 1A? = 64 ms
(a) unicast addres • Propagataion time = 270
(b) multicast addres
• Round trip time = 2 × propagation time = 540
(c) broadcast addres
(d) unicast and broadcast address • Transmission time + Roundtrip time = 604 ms
We know maximum throughout is possible when window
Ans. (a) : The destination address
4A:30:10:21:10:1A is  2 Tpropagation 
Unicast address. size = 1+ 
A unicast address uniquely identifies 
 Ttransmission time 
a single interface by its address. 540
An interface can have multiple unicast address and Window size = 1+ 64 = 9.43 ~ 10
must have at least one link- local address. A link-local So window size = 15 will given through put as
address is an address used on a link between two nodes. maximum bandwidth available is 64 kbps.
30. The model in which the requirements are
implemented by its category is 33. The logic expression ( P ∧ Q ) ∨ ( P ∧ Q ) ∨ ( P ∧ Q )
(a) Evolutionary Development Model is equaivalent to
(b) Waterfall Model (a) P ∨ Q (b) P ∨ Q
(c) Prototyping Model
(d) Iterative Enhancement Model (c) P ∨ Q (d) P ∨ Q
Ans. (c) : Given Expression
(P ∧ Q) ∨ (P ∧ Q) ∨ (P ∧ Q)
Truth Table
Given Expression
Truth Table
(P ∧ Q) ∨ (P ∧ Q) ∨ (P ∧ Q)
Truth Table
P Q P Q P^Q P^Q P^Q P∨Q (P ^ Q) ∨ (P ^ Q)
(P ^ Q) ∨
(P ^ Q)
∨
(P ^ Q)
T T F F T F F T F T
T F F T F F T F T T
F T T F F T F F T T
F F T T F F F F F F
by using truth table (P ∧ Q) ∨ (P ∧ Q) ∨ (P ∧ Q) = P ∨ Q So correct answer (c).

UGC NTA NET JRF Computer Science Dec. 2021-June 2022 407 YCT
 Search on TG: @apna_pdf
34. Match List I with List II : Using Baye's theorem
List I List II P (E1 ).P (A/E1 )
P (E1/A) =
(A) DES (I) Key size- 256 P (E1 ).P (A/E1 ) + P (E 2 ).P (A/E 2 ) + P (E/ 3 ).P(A/E3 )
(B) AES (II) Key size-1024
1 2
(C) 3 DES (III) Key size-56 ×
(D) RSA (IV) Key size-168 = 3 9
1 2 1 2 1 3
Choose the correct answer from the options × + × + ×
given below: 3 9 3 7 3 7
A B C D 2/27 14
(a) (I) (II) (IV) (III) = = = 0.237
2 2 3 59
(b) (III) (I) (IV) (II) + +
27 21 21
(c) (III) (IV) (II) (I) 36. The number of gate inputs, required to realize
(d) (IV) (II) (III) (I)
expression ABC + ABCD + EF + AD is
Ans. (b) : DES (Data Encryption Standard) is a block (a) 12 (b) 13
cipher that operates and data block of 64 bit in size.
DES uses a 64-bit key 8 × 8 actual key is 56 bits. (c) 14 (d) 15
SO (A) → (III) Ans. (d) : To realize the expression
AES (Advanced Encryption Standard keys are ABC + ABCD is using logic gates
symmetric keys that can be three different key lengths
(128, 192 or 256 bits).
The 256-bit keys are the longest allowed by AES.
So (B) → (I)
3 DES – DES actual key is 56 bits.
In general Triple DES with three independent key has a
key length of 168 bits.
So (C) → (IV)
RSA – The minimum size of secure RSA keys on the
Taken Key Data Set (TKDS) is 1024 bits.
So (D) → (II)
So option (b) is correct answer. So, the number of gate input would be 15.
35. There are three boxes, First box has 2 white, 3 37. Let ({a,b},*) be a semigroup, where a* a = b.
black and 4 red balls, Second box has 3 white, (A) a * b = b* a
2 black and 2 red ball. Third box has 4 white. 1 (B) b * b = b
black and 3 red balls. A box is chosen at
random and 2 balls are drawn out of which 1 is Choose the most appropriate answer from the
white, and 1 is red. What is the probability that options given below:
the balls came from first box? (a) (A) only true
(a) 0.237 (b) 0.723 (b) (B) only true
(c) 0.18 (d) 0.452 (c) Both (A) and (B) true
Ans. (a) : Let B1, B2, C3 are three boxes and E1, E2, E3 (d) Neither (A) nor (B) true
be the events that the balls are chosen from an box B1, Ans. (d) : Semigroup
B2 and B3 respectively. (S, *) is samigroup
We have, B1 = {2 white, 3 black, 4 red} where * defined by
a * (b * c) = (a * b) * c
B2 = {3 white, 2 black, 2 red } Associative of * let a, b, c ∈ s.
B3 = {4 white, 1 black, 3 red} Commutative property which is
Let ‘A’ be the event that 1 white and 1 red balls in a * b = b * a is not true for semigroup.
drawn. The equation b * b = b is not true for all semigroups.
1 So neither (A) nor (B) true.
∴ P (E1) = P (E2) = P (E3) =
3 38. Which one is the connectionless transport –
2 C .4 C
layer protocol that belongs to the Internet
2!× 4 2× 4 protocol family?
∴ P(A/E1 ) = 1 1 = =
9C
2
9×8 36 (a) Transmission Controll Protocol (TCP)
2 (b) User Datagram Protocol (UDP)
2 (c) Routing Protocol
= (d) Datagram Contol Protocol (DCP)
9
Ans. (b) : User Datagram Protocol (UDP) is also a
3 C .2 C 3× 2 2
∴ P (A/E 2 ) = 1 1
= = transport – layer protocol and an alternative to TCP. It
7C
2
7×6 7 provides a connectionless data transmission service
2 between application. UDP has less error checking than
4 C .3 C 4×3 3 TCP. If UDP users want to be able to respond to errors,
∴ P (A/E 2 ) = 1 1 = = the communicating programs must establish their own
8C
2
8× 7 7 protocol for error handling with high quality
2 transmission network, UDP errors are of little concern.
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 408 YCT
 Search on TG: @apna_pdf
39. Hidden surface removal problem with minimal 42. A top down approach to programming cells for :
3D pipeline can be solved with Statement I : Working from the general to the
(a) Painter's algorithm specific.
(b) Window Clipping algorithm Statement II : Postpone the minor decision.
(c) Brute force rasterization algorithm Statement III : A systematic approach.
(d) Flood fill algorithm Statement IV : Intermediate coding of the
Ans. (a) : The proble of hidden surface removal is the problem
determine which triangles of a scene are visible are Which of the following is true?
visible from a virtual camera and which triangles are (a) Statement I only
hidden. (b) Statement I and Statement II only
Many algorithm have been developed to this problem. (c) Statement I, Statement II and Statement III
Just two algorithm. only
1. The painter's algorithm. 2. The z-Buffer Algorithm. (d) Statement I, Statement II and Statement IV
So option (a) is correct. only
40. Consider the following graph : Ans. (d) : Procedural programming follows top-down
For the graph; the following sequences of approach. Top-down approach also called as step-wise
depth first seartch (DFS) are given approach. Top-down approach starts with high level
(A) abcghf (B) abfchg (C) abfhgc (D) afghbc system or design then it goes to low level system or
Which of the following is correct? design or development.
(a) (A), (B) and (D) only (b) (A), (B), (C) and (D) Top-down approach first focus on abstract of overall
(c) (B), (C) and (D) only (d) (A), (C) and (D) only system or project. At last it focus on detail design or
Ans. (d) : Given graph development.
In this approach first programmers has to write code for
main function. In main function they will call other sub
function. At last they will write code for each sub
function.
Top-down approach expects good planning and good
understanding of the systems.
So Statement I, Statement II and Statement III is true
but Statement IV is false.
option (a), (c) and (d) is correct Option (c) is correct answer.
but
Option (b) abfchg 43. In a database, a rule is defined as (P1 and P2)
You see f not connected to c or P3? R1 (0.8) and R2 (0.3), where P1, P2, P3
so (B) is incorrect. are premises and R1, R2 are conclusions rules
41. Match List I with List II : with certainty factors (CF) 0.8 and 0.3
respectively. If any running program has
List I List II produced P1, P2, P3 with CF as 0.5, 0.8, 0.2
(A) Type 0 (I) Finite automata respectively, find the CF of results on the basis
(B) Type 1 (II) Tuning machine of premises.
(C) Type 2 (III) Linear bound (a) CF (R1 = 0.8), CF (R2 = 0.3)
automata (b) CF (R1 = 0.40), CF (R2 = 0.15)
(D) Type 3 (IV) Pushdown (c) CF (R1 = 0.15), CF (R2 = 0.35)
automata (d) CF (R1 = 0.8), CF (R2 = 0.35)
Choose the correct answer from the options Ans. (b) : Given Rule is (P1 and P2) or P3
given below : R1 and R2 are conclusions of rule
A B C D CF of R1 = 0.8
(a) (III) (IV) (II) (I) CF of R2 = 0.3
(b) (II) (III) (IV) (I) CF of P1 = 0.5
CF of P2 = 0.8
(c) (III) (IV) (I) (II)
CF of P3 = 0.2
(d) (II) (III) (II) (IV) (Where P1 and P2, P3 are premises).
Ans. (b) : Chomsky Hierarchy So the CF of given rule ((P1 and P2) or (P3))
Type 3 ⊂ Type 2 ⊂ Type 1 ⊂ Type-0 = MAX {MIN {CF (P1), CF (P2)}, CF (P3)}
Type-3 Type-2 Type-1 Type-0 = MAX {MIN {0.5, 0.8}, 0.2}
class class class class = MAX {0.5, 0.2}
Set of all Set of all Set of all Set of all = 0.5
regular context free context recurssively So, CF of R1 based on premises = 0.5 × CF (R1)
language language sensitive enumrable = 0.5 × 0.8
language. languages = 0.40
Finite Pushdown Linear Turning CF of R2 based on premises = 0.5 × CF (R2)
Automata Automata Bound Machine = 0.5 × 0.3
(FA) PDA Automata (TM) = 0.15
(FSM) (LBA) So option (b) is correct.
So option (b) is correct answer. CF (R1 = 0.40), CF (R2 = 0.15).

UGC NTA NET JRF Computer Science Dec. 2021-June 2022 409 YCT
 Search on TG: @apna_pdf
44. Pointers cannot be used to Ans. (d) : The priority encoder is a combinational logic
(a) find the address of a variable in memory n
circuit that contains 2 input lines and n output lines
(b) reference value directly and represents the highest priority input among all the
(c) simulate call by refrence input lines.
(d) maniputlate dynamic data structure 8 to 3 Priority Encoder
Ans. (b) : Reference value directly cannot be used in This kind of encoder is also named an 8-bit or Octal to
pointers. binary priority encoder.
So directly references a value, where as a pointer Given logic gate circuit
indirectly references a value through the memory 3
address it stores. 8 input lines (Do, D1........D7) = 2
45. If an operating system does not allow a child 3 output lines (Ao, A1, A2)
process to exist when the parent process has A2 = D4 + D5 + D6 + D7
been terminated, this phenomenon is called as A1 = D2 + D3 + D6 + D7
(a) Threading (b) Cascading termination A = D + D + D + Do
o 1 3 5
(c) Zombie termination (d) Process killing + indicates logical OR operation.
Ans. (b) : Threading –A thread is a separate execution
path. It is a lightweight process that the operating
system can schedule and run concurrently with other
threads.
Cascading termination – Some system, Including
VMS, do not allow a child to exist if its parent has
terminated. such system, If a process terminates either
normally or abnormally, then have to be terminated.
This concept is referred to a cascading termination.
Zombie termination – We can say that a zombie
process is a terminated or completed process that
remains in the process table.
Process killing- terminating a process forcefully is
called process killing.
46. Consider the following in Boolean Algebra
X : a ∨ (b ∧ (a ∨ c)) = (a ∨ b) ∧ (a ∨ c)
So correct answer is priority encoder.
Y : a ∧ (b ∨ (a ∧ c)) = (a ∨ b) ∨ (a ∧ c)
a ∨ (b ∧ c) = (a ∨ b) c is satisfied if 48. Consider the following statements:
(a) X is true Statement I : Composite attributes cannot be
(b) Y is true divided into smaller subparts.
(c) Both X and Y are true Statement II : Complex attribute is formed by
(d) If does depend on X and Y nesting composite attributes and multivalued
Ans. (c) : Given Boolean Algebra attributes in an arbitrary way.
X : a∨ (b ∧ (a∨c)) = (a∨b) ∧ (a∨c) Statement III : A derived attribute is an
Using distributive properties right side attribute whose values are computed from
a ∨ (b ∧ (a ∨ c)) = a ∨ (b∧c) other attribute.
Put OR (∨) = + AND (∧) = •, Which of the following is correct?
a + bc = a + bc (a) Statement I, Statement II and Statement III
So X is true. are true
Y : a ∧ (b ∨ (a∧c)) = (a∧b) ∨ (a∧c) (b) Statement I true and Statement II, Statemennt
Using distributive law right side III false
a ∧ (b ∨ (a ∧ c) = a ∧ (b ∨ c) (c) Statement I, Statement II true and Statement
Put And ∧ = •, OR ∨ = + III false
a + bc = a + bc (d) Statement I false and Statement II, Statement
So Y is true. III true
Option (c) is correct answer. Ans. (d) : There are six type of attributes simple,
47. Consider a logic gate circuit, with 8 input lines composite, single-valued, multi-valued and derive
(D0, D1.......D7) and 3 output lines (A0, A1, A2) attribute.
specified by following operations Composite attributes – An attribute that can be split into
A 2 = D4 + D5 + D 6 + D7 components is a composite attribute.
A 1 = D2 + D3 + D 6 + D7 Derived attribute – An attribute that can be derived
A 0 = D1 + D3 + D 5 + D0 from other attributes is derived attributes.
Where + indicates logical OR operation. This Complex attribute – Those attributes, which can be
circuit is formed by the nesting of composite and multiple-valued
(a) 3 × 8 multiplexer attributes, are called ‘‘Complex Attributes’’.
(b) Decimal to BCD converter So by definition statement II.
(c) Octal to Binary encoder Statement III is true and statement I false.
(d) Priority encoder ∴ option (d) is correct answer.
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 410 YCT
 Search on TG: @apna_pdf
49. Match List I with List II 51. The representation of 4 bit code 1101 into 7 bit,
List I List II even parity Hamming code is
(A) BCNF (I) It remove (a) (1010101) (b) (1111001)
multivaled (c) (1011101) (d) (1110000)
dependency Ans. (a) : Hamming (7, 4) code: It is a linear error-
(B) 3 NF (II) It is not always connecting code that encodes four bits of data into, by
dependency adding three parity.
preserving Hamming code
Bits 1 2 3 4 5 6 7
(C) 2 NF (III) It removes Transmitted Bits P1 P2 do P3 d1 d2 d3
transitive
dependency P 1 = do ⊕ d1 ⊕ d3
P 2 = do ⊕ d3 ⊕ d2
(D) 4 NF (IV) It removes
partial P 3 = d1 ⊕ d3 ⊕ d2
functional Given data 1101 i.e.
dependency do = 1, d1 = 1, d2 = 0, d3 = 1
We can write
A B C D P 1 = do ⊕ d1 ⊕ d3 = 1 ⊕ 1 ⊕ 1 = 1
(a) (III) (II) (IV) (I) P 2 = do ⊕ d3 ⊕ d2 = 1 ⊕ 1⊕ 0 = 0
(b) (II) (IV) (I) (III) P 3 = d1 ⊕ d3 ⊕ d2 = 1 ⊕ 1 ⊕ 0 = 0
(c) (II) (III) (IV) (I) Then transmitted
(d) (II) (I) (IV) (III) P1 P2 do P3 d1 d2 d3
Ans. (c) : Nomalization – Database normalization is a 1 0 1 0 1 0 1
technique of organizing the data in the database. So 1010101
Normalization is used for mainly two purposes. 52. Consider the following statements of
• Eliminating redundant (useless) data approximation algorithm:
• Ensuring data dependencies make sense i.e. data is Statement I : Vertex-cover is a polynominal
logically stored. time 2 - approximation algorithm.
First normal form (1NF) – The first normal form help Statement II : TSP-tour is a polynomial time 3-
to eliminate duplicate data and simplify queries. approximation algorithm for travelling
Second normal form (2NF) – is based on the concept salesman problem with the triangle inequality.
of fully functional dependency 2NF removes partial Which of the following is correct?
functional dependency. (a) Statement I true and Statement II false
Third normal form (3NF) – A relation is in the third (b) Statement I and Statement II true
normal form (3NF) if it is second normal form and no (c) Statement I false and Statement II true
transitive dependencies exist.
Fourth normal form (4NF) – A group of tables that (d) Statement I and Statement II false
satisfies the first, scored and third normal forms are Ans. (a) : Approximation algorithm is a way of dealing
sufficiently well-designed 4NF removes multivalued with NP-completeness for an optimization problem.
dependency. This technique does not guarantee the best solution.
Boyce-Codd Normal Form BCNF is an extension to The goal of the approximation algorithm is to come as
the third normal form also known as 3.5 normal form. close as possible to the optimal solution in polynomial
• BCNF is not always dependency preserving. time. Such algorithm9s are called approximation
The correct answer is option (c). algorithms or heuristic algorithms.
50. In a cache memory, if address has 9 bits in Tag 1. The Vertex Cover Problem–In the vertex cover
field and 12 bits in index field, the size of main problem, the optimization problem is to find the vertex
memory and cache memory would be respectively cover with the fewest vertices vertices and the
(a) 2 K, 4 K (b) 1024 K, 2K approximation problem is to find the vertex cover with
(c) 4 K, 2048 K (d) 2048 K, 4K few vertices.
Ans. (a) : Given that Theorem: Approx – Vertex – Cover is a polynomial
Tag field = 9 bits time 2-approximation algorithm for vertex cover.
index field = 12 bits APPROX-VERTEX-COVER (G)
Main memory address 1. C = θ
Tag Index 2. E' = G.E
9 bits 12 bits 3. While E' ≠ 0
Total bits = 9 + 12 = 21 bits 4. Let (u, v) be an arbitrary edge of E'
Size of main memory = 2 = 2 × 2
21 20 5. C = C U {u, v}
= 2 × 1024K 6. Remove from E' every edge incident or either u or v.
= 2048K 7. Return C
Size of cache memory So statement I is true.
= 2 index + offset Approximate: Tour triangle inequality TSP is still NP-
= 212 + 0 complete, but there is a 2-approximation algorithm for
= 22 × 210 it. The algorithm finds a minimum spanning tree and
= 4 × 1K then coverts this to a low cast tour.
=4K So statement II is false.
So answer is 2048 K, 4K. ∴ Option (a) is correct answer.
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 411 YCT
 Search on TG: @apna_pdf
53. Given below are two statements : one is (D) Distributed (IV) O/S routines
labelled as Assertion (A) and the other is operating are
labelled as Reason (R) : system distributed
Assertion (A) : A load and go assembler avoids organization among
the overhead of writing the object program out availabel
and reading it back in. processors
Reason (R) : This can be done with either one- Choose the correct answer from the option
pass or two pass assembler : given below:
In the light of the above statements, choose the
correct answer from the options given below : A B C D
(a) Both (A) and (R) are true and (R) is the (a) (III) (II) (IV) (I)
correct explanation of (A) (b) (I) (II) (III) (IV)
(b) Both (A) and (R) are true but (R) is NOT the (c) (II) (III) (I) (IV)
correct explanation of (A) (d) (II) (I) (III) (IV)
(c) (A) is true but (R) is false Ans. (c) : Least frequently used a type of cache
(d) (A) is false but (R) is true algorithm used to manage memory within a computer.
Ans. (a) : Load-and-go Assembler Characteristics So (A) → (II)
• Useful for program development and testing. Critical section refers to the segment of code or the
• Avoids the overhead of writing the object program program which tries to access or modify the value of
out and reading it back. the variables in a shared resource.
• Both one-pass and two-pass assemblers can be So (B) → (III)
designed as load and go. Loosely coupled multiprocessor system are also
• However one-pass also avoids the over head of an knows as distributed memory, as the processors do not
additional pass over the source program. share physical memory and have their own I/O channels.
• For a load and go assembler, the actual address
must be known at assembly time, we can use an So (C) → (I)
absolute program by characteristics. Distributed operating system organization is an
Option (a) is correct answer. essential sort of operating system. Many central
processors are used in distributed systems to support
54. A trigger is: various real time applications and users. As a result jobs
(a) A statement that enables to start DBMS for data processing are split across the processors.
(b) A statement that is executed by the user when
debugging an application program. So (D) → (IV)
(c) A condition the system tests for the validity So option (c) is correct answer.
of the database user 56. What is called Journaling in Linux operating
(d) A statement that is executed automatically by system?
the system as a side effect of modification to (a) Process scheduling
the database (b) file saving as transaction
Ans. (d) : Triggers- Triggers are the SQL statement (c) A type of thread
that automatically executed when there is any change in (d) An editor
response to certain events (INSERT, OR DELETE) in a Ans. (a) : A journaling file system is a file system that
particular table. keeps tracks of changes not yet committed to the file
So option (d) is correct. systems main part by recording the goal of such
55. Match List I with List II changes in a data structure known as a "journal".
List I List II So file saving as transaction is called journaling in
(A) Least (I) Memory is Linux operating system.
frequently used distributed 57. Consider the production rules of grammer G:
among S → AbB
processors
A → aAb|λ
(B) Critical Section (II) Page
replacement B → bB|λ
policy in cach Which of the following language L is generated
memory by grammer G?
(C) Loosely coupled (III) Program (a) L = {an bm : n ≥ 0, m ≥ n}
multiprocessor section that (b) L = {an bm : n ≥ 0, m ≥ 0}
system one begin (c) L = {an bm : n ≥ m}
must (d) L = {an bm : n ≥ m, m > 0}
complete
execution Ans. (a) : Formal definition of Grammar:
before Any Grammar can be represented by four tuples –
another < N, T, P, S>
processor • N–Finite non-empty set of non-Terminal symbols.
access the • T-Finite set of terminal symbols.
same shared • P-Finite Non-Empty Set of production rules.
resource • S-Start Symbol.
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 412 YCT
 Search on TG: @apna_pdf
Production Rules Ans. (c) : The first type of self balancing binary search
A production or production rule in computer science is tree to be invented is the AVL tree.
a rewrite rule specifying a symbol substitution that can There are usually four cases of rotation in the balancing
be recursively performed to generate new symbol algorithm of AVL trees : LL, RR, LR, RL.
sequences. given sequence
Grammar G is 35, 50, 40, 25, 30, 60, 78, 20, 28
S →AbB
A → aAb|λ
B → bB|λ
Languge L is generated by grammer G is:
n m
L = {a b : n ≥ 0, m > n}
String can be generated by grammer G is:
n m
{b, b, abb, abbb_ _ _ _}here a : n ≥ 0 and b : m > b.
So option (a) is correct answer.
58. Match List I with List II :
List I List II
(A) Firmware (I) Number of
logical records
into physical
blocks
(B) Batch file (II) ASCII format
(C) Packing (III) Resource
allocation
(D) Banker's (IV) ROM
Algorithm
Choose the correct answer from the options
given below :
A B C D
(a) (II) (I) (IV) (III)
(b) (II) (I) (III) (IV)
(c) (IV) (II) (I) (III)
(d) (IV) (I) (II) (III)
Ans. (c) : Firmware is a piece of software stored in
read-only memory.
∴ (A) → (IV)
Batch file support elementary program flow commands So 3 left rotation
such as if and goto, they are not well-suited for general- 2 right rotations.
purpose programming. Batch file are ASCII file. 60. Match List I with List II
∴ (B) → (II)
Packing a number of logical records into physical List I List II
block is a common solution to this problem. (A) BIND (I) Block the caller
So (C) → (I) until a
connection
Banker's Algorithm is a resource allocation and attempt arrives
deadlock avoidance algorithm that tests for safety by
simulating the allocation for the predator mined (B) LISTEN (II) Give a local
maximum possible amounts of all resources, then address to a
socket
makes an "s-state" check to test for possible activities,
before deciding whether allocation should be allowed to (C) ACCEPT (III) Show
continue. willingness to
accept
So (D) → (III) connections
So option (c) is correct answer.
(D) SOCKET (IV) Create a new
59. How many rotations are required during the point
construction of an AVL tree if the following Choose the correct answer from the options
elements are to be added in the given sequence? given below:
35, 50, 40, 25, 30, 60, 78, 20, 28 A B C D
(a) 2 left rotations, 2 right rotations (a) (I) (III) (II) (IV)
(b) 2 left rotations, 3 right rotations (b) (II) (III) (I) (IV)
(c) 3 left rotations, 2 right rotations (c) (III) (II) (I) (IV)
(d) 3 left rotations, 1 right rotations (d) (I) (II) (III) (IV)
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 413 YCT
 Search on TG: @apna_pdf
Ans. (b) : Correct match is. 64. Consider the following two lists:
List-I List-II List I List II
(A) BIND (ii) Give a local address to a socket. (A) Stack overflow (I) Software
(B) LISTEN (iii) Show willingness to accept interrupt
connections. (B) Timer (II) Internal
(C) ACCEPT (i) Block the caller until a connection interrupt
attempt arrives. (C) Invalid opcode (III) External
(D) SOCKET (iv) Create a new point. interrupt
So option (b) is correct answer. (D) Superior call (IV) Machine check
61. This transformation is called interrupt
Which of the following is correct match?
 x  a1 b1 c1 d1   x  A B C D
 y  a b c d   y  (a) (I) (II) (III) (IV)
 = 2 2 2 2
−  (b) (II) (III) (I) (IV)
 z   a 3 b 3 c3 d 3   z 
      (c) (I) (II) (IV) (III)
 w  e f g h  1  (d) (II) (III) (IV) (I)
(a) Scaling (b) Shear Ans. (d) : Interrupts–An interrupt is a signal to the
(c) Homography (d) Steganography currently executing program, and run a specified
Ans. (a) : In linear algebra, if T is a linear routine when ever the execution of the routine is
n m completed, the processor switches to its original.
transformation mapping R to R and x is a column There are two types of interrupts:
vector with n entires, then • Hardware interrupt
T (x) = Ax • Software interrupt
For some m × n matrix A, called the transformation • Stack overflow is an internal interrupt
matrix of T. • Time is an external interrupt.
62. Which mechanism in XML allows organizations • Invalid opcode is a machine check interrupt.
to specify globally unique names as element • Superior call is a software interrupt.
tags in documents? 65. Let ∈ = 0.0005 and Let Re be the relation {(x,
(a) root (b) header y) ∈R2: |x – y|<∈}, Re could be interpreted as
(c) schema (d) namespace the relation approximately equal Re is
Ans. (d) : This allows organization to specify globally (A) Reflexive
unique name as element tags in documents, as each (B) Symmetric
element name can be associated with a different name (C) transitive
space. Choose the correct answer from the options
When using prefixes in XML, a namespace for the given below:
prefix must be defined. The namespace declaration has (a) (A) and (B) only true
the following syntax. (b) (B) and (C) only true
xmlns : prefix = "URL." (c) (A) and (C) only true
63. Consider the following related to Fourth (d) (A), (B) and (C) true
Generation Technique (4GT) Ans. (a) : Given that
(A) It controls efforts ∈= 0.0005
(B) It controls resources. The relation
2
(C) It controls cost of development {(x, y) ∈R : | x – y | < ∈}
2
Choose the correct answer from the options Now, for every x∈R (x, x) ∈R as |x – x| = 0
given below: 0 < ∈ is true.
(a) (A) and (B) only (b) (B) and (C) only ∴ Re is reflextive
(c) (C) and (A) only (d) All (A), (B) and (C) Now, for every x, y∈ Re if (x, y) ∈R
⇒ |– (x – y)| is also a real.
Ans. (d) : The term fourth generation techniques (4GT) ⇒|(y – x|
encompasses as broad array of software tools that have So |x – y| = |y – x|
one thing in common : each enables the software ∴ (y, x) ∈Re
engineer to specify some characteristic of software at a 2
⇒ R is symmetric.
high level. The tool then automatically generates source Consider the following example.
code based on the developer's specification. Let x = 0, y = 0.0004, and z = 0.0005
Benefits of the 4GT Then |x – y| = |0 – 0.0004| = 0.0004 < ∈
1. Flexible (y – z) = |0.0004 – 0.0005| = 0.000 1 < ∈
2. Scalable |x – z | = |0 – 0.0005| = 0.0005
3. Total Data Access |x – z | = |x – y| + |y – z|
4. Controls Efforts It meaning (x, z) is not in Re.
5. Controls Resources Re is not transitive.
6. Controls Cost of Development. Therefore, Re is reflective and symmetric but not
So all (a), (b) and (c) is correct answer. transitive.

UGC NTA NET JRF Computer Science Dec. 2021-June 2022 414 YCT
 Search on TG: @apna_pdf
66. Of the following, which is NOT a logical error? 69. Match List I with List II :
(a) Using the '=', instead of ' = =' to determinte if List I List II
two values are equal (A) Physical (I) Routing of the
(b) Divide by zero layer signals divide the
(c) Failing to initialize counter and total variables outgoing message
before the body of loop into packets, to act
(d) Using commas instead of two required as network
semicolon in a for loop header controller for
Ans. (d) : Logical error routing data
A logic error (or logical error) is a mistake a program's (B) Data link (II) Make and break
source code that results in incorrect or enexpected layer connections, define
behaviour. It is a type of runtime error that may simply voltage and data
produce the wrong output or may cause a program to rates, convert data
crash while running. bits into electrical
Using commas instead of two required semicolon in a signal
for loop header is not logical error. This is syntax error. (C) Network (III) Synchronization,
So option (d) is correct answer. layer error detection and
67. Which statement is false? correction, To
(a) All function call in C pass arguments using assemble outgoing
call by value message into frames.
(b) Call by reference enables a called function to (D) Presentat (IV) It work as a
modify a variable in calling function ion layer translating layer
(c) Call by value is always more efficinet than Choose the correct answer from the options
call by reference. given below:
(d) Programmers use pointers and indirection A B C D
operation to simulate call by reference. (a) (IV) (III) (II) (I)
Ans. (c) : Difference between call by value and call (b) (II) (III) (IV) (I)
by reference. (c) (IV) (III) (I) (II)
Call by value Call by reference (d) (II) (III) (I) (IV)
• In this case value of the • In this case address of Ans. (d) : Correct match is.
variable is passed. the variable is passed. A. Physical layer (ii) Make and break connections
• Can't change value of • Can change value of define voltage and data rates
actual argument by actual argument by convert data bits into electrical
signal.
using formal argument. using formal argument.
B. Data link layer Synchronization error detection
• No pointer are used. • Pointers are used. (iii) and correction to assemble out
• Its requires move • Its require less memory. going massage into frames.
memory. • It is more efficient. C. Network layer (i) Routing of the signals divide the
• It is less efficient. outgoing message network
So option (c) is correct answer. controler for routing data.
68. Consider the following: D. Presentation (iv) It works as a translating layer.
layer
List I List II
So option (d) is correct answer.
(A) Stack (I) Deadlock
algorithm 70. Which of the following algorithm design
approach is used in quick sort algorithm?
(B) Elevator (II) Disk (a) Dynamic programming
algorithm shceduling (b) Back Tracking
(C) Priority (III) Page (c) Divide and Conquer
scheduling replacement (d) Greedy approach
algorithm
Ans. (c) : Merge sort, quicksort uses divide and
(D) Havender's (IV) CPU conquer, so it's a recursive algorithm.
algorithm scheduling
71. Given below are two statements: one is labelled
Which of the following is correct matching? as Assertion (A) and the other is labelled as
A B C D Reason (R)
(a) (III) (II) (IV) (I) Assertion (A) : p
(b) (II) (III) (IV) (I)
(c) (III) (II) (I) (IV) Reason (R) : ( r → q, r ∨ s,s → q, p → q )
(d) (II) (III) (I) (IV) In the light of the above statements, choose the
Ans. (a) : The correct match is. correct answer from the option given below:
A. Stack algorithm (iii) Page replacement (a) Both (A) and (R) are true and (R) is the
correct explanation of (A)
B. Elevator algorithm (ii) Disk scheduling (b) Both (A) and (R) are true but (R) is NOT the
C. Priority scheduling algorithm (iv) CPU scheduling correct explanation of (A)
D. Havender's algorithm (i) Deadlock (c) (A) is true but (R) is false
So option (a) is correct answer. (d) (A) is false but (R) is true

UGC NTA NET JRF Computer Science Dec. 2021-June 2022 415 YCT
 Search on TG: @apna_pdf
Ans. (a) : Given statement 74. A magnetic tape drive has transport speed of
Assertion (A) : P 200 inches per second and a recording density
of 1600 bytes per inch. The time required to
Reason (R) : (r → q, r ∨ s,s → q, p → q) write 600000 bytes of data grouped in 100
Using truth table characters record with a blocking factor 10 is
r q q r →q r s r∨s s q q s →q
T T F F T T T T T F F (a) 2,0625 sec. (b) 2,625 sec.
T
F
F
T
T
F
T
T
T
F
F
T
T
T
T
F
F
T
T
F
T
T
(c) 2, 0062 sec. (d) 2,6150 sec.
F F T T F F F F F T T Ans. (b) : Given that
p q p p→q Number of record per block = 10
T T F T Number of bytes per block = 1000
T F F F (100 Characters × 10 records per block)
F T T T Number of balks required = 600 (600000 bytes / 1000
F F T T
So by using truth table option (a) is correct. bytes per black.
72. Consider the following statements: Blocking factor = 10
Statements I : LALR parser is more powerdful The length of tape required for one block can be
than cononical LR Parser. calculated as follows:
Statements II : SLR parser is more powerful Length of tape required for one block
than LALER = (Number of bytes per block)/(Recording density)
Which of the following is correect: 1000
(a) Statement I true and Statement II fasle = = 0.625 inches
1600
(b) Statement I false and Statement II true Therefore the total length of tope required for 600
(c) Both Statement I and Statement II false blocks of tape required
(d) Both Statement I and Statement II true = (Length of tape required for one block)×(Number of
Ans. (c) : LALR parser: blocks)
LALR parson is also a bottom-up parser that used a = 0.625 × 600
look a head LR (1) parsing table to parse an input =375
sequence. Now we can calculate the time required to write this
• It is more efficient and faster than the canonical LR length of tape:
parser.
• It can handle a large class of grammers but not all ( length of tape )
Time required =
LR (1) grammars. ( Transport speed )
SLR Parser : 375
• SLR parser is a simple bottom up parser that uses a =
200
parse table constructed from a LR (0) state machine = 1.875 second
to parse an input sequence.
• It is the simplest and fastest of all LR parsers but can But option (b) is the official Answer although it is
handle only a subset of LR (1) grammars. incorrect.
So statement I and Statement II are false. 75. The reduced grammer equivalent to the
73. Consider L = {ab, aa, baa} grammer, whose production rules are given
Which of the following string is NOT in L* below, is
(a) baaaaabaaaaa (b) abaabaaabaa S → AB | CA
(c) aaaabaaaa (d) baaaaabaa B → BC | AB
Ans. (a) : Given that A→a
L = {ab, aa, baa} C → a B|b
Option (a) baaaaabaaaaa. (a) S → CA, A →a, C→b
This is not a correct combination of { ab, aa, baa}. (b) S → CA | B, B → BC|B, A → a, C → aB|b
baa, aa, ab, aa, aa, (c) S→CA|B, B →BC, A → a, C → aB|b
Option (b) abaabaaabaa (d) S→AB|AC, B→ BC|BA,A → a, C→aB|b
The combination of {ab, aa, baa} Ans. (a) : Given that
forms abaa baa ab aa. S  → AB| CA
This is correct combination.
ab, aa, baa, ab, aa. B  → BC | AB
Option (c) aaa ab aaaa A  →a
The combination of {ab, aa, baa} C  → aB|b
from aaaabaaaa. This is the correct combination. From the productions
aa, aa, baa, aa. S  → CA
Option (d) baaaaabaa
The combination of {ab, aa, baa} A  →a
from baaaaabaa. C  → b
This is the correct combination. B do not lead to a string terminal; that means B is
baa, aa, ab, aa. unless symbols.
Correct answer is option (a). So answer is S  → CA, A  → a, C  → b.
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 416 YCT
 Search on TG: @apna_pdf
76. RAD software process model stands for 80. The total storage capacity of a floppy disk
(a) Rapid Application Development having 80 tracks and strong 128 bytes/sector is
(b) Relative Application, Development 163, 840 bytes. How many sectors does this
disk have?
(c) Rapid Application Design 7
(a) 2 (b) 2048
(d) Recent Application Development
(c) 4K (d) 16
Ans. (a) : The RAD (Rapid Application Development)
is a software development methodology that uses Ans. (d) : Given that, Number of track = 80
minimal planning in favour of rapid prototyping. A Number of bytes per sector = 128
prototype is working model that is functionally Let's assume that the number of sector per track = S
equivalent to a component of the product. So we know that
So RAD software process model stands for Rapid Total storage capacity = Number of track × number of
Application Development. sector per track × number of bytes per sector.
= 80 × S × 128
77. If every requirement can be checked by a cost - Given that the total storage capacity of the floppy disk
effective process, then SRS is called is 163,840 bytes.
(a) Verifiable (b) Tracable Therefore, we can write
(c) Modifiable (d) Complete 80 × S × 128 = 163,840
Ans. (a) : Quality characteristics of a good software 163840
requirement specification (SRS) document include. ⇒ S= = 16
1. Completeness 2. Clarity 3. Correctness 80×128
So option (d) is correct.
4. Consistency 5. Verifiability 6. Ranking
7. Modifiability 8. Tracebility 9. Feasibility 81. Consider α, β , γ as logical variables, Indentify
which of the followoing represents correct
So if every requirement can be checked by a cost logical equivalence:
effective process, then SRS is called verifiable.
(A) (α ∧(β ∨ γ)) ≡ ((α ∧ β) ∨ (α ∧γ))
78. The process to gather the software requirements (B) (α ∨ β) ≡ – α ∨ β
from client, analyze and document is known as–
(C) (α ⇒ β) ≡ (–β ⇒ –α)
(a) Software Engineering Process
(D) (–(α ∨ β)) ≡ (–α ⇒ – β)
(b) User Engineering Process
Choose the correct answer from the option
(c) Requirement Elicitation Process given below :
(d) Requirement Engineering Process (a) (A) and (D) only (b) (B) and (C) only
Ans. (d) : The Requirement Engineering process to (c) (A) and (C) only (d) (B) and (D) only
gather the software requirements from client, analyze Ans. (c) : Important Logical Equivalences
and document them is known as requirement Identity Law
engineering. α ∧T⇔ α
Requirement Engineering process it is a four steps
process. α∨F⇔α
Domination Law
• Feasibility.
α∨T⇔F
• Requirement gathering.
• Software requirement specification. α∧F⇔F
Idempotent Laws
• Software requirement validation.
α∨α⇔α
79. Consider the grammer S → SbS|a: α∧α⇔α
Consider the following statements: Double Negation Law : ¬ (¬α) ⇔ α
The string abababa has Commutative Laws :
(A) two parse trees α∨β⇔q∨α
(B) two left most derivations α∧β⇔β∧α
(C) two right most derivations Associative Laws:
Which of the following is correct? (α∨ β) ∨γ ⇔ α∨ (β∨γ)
(a) All (A), (B) and (C) are true Distributive Laws:
(b) Only (B) is true α ∨ (β ∧ γ) ⇔ ( α ∨ β) ∧ ( α ∨γ )
α ∧ (β∨ γ) ⇔ ( α ∧β) ∨ ( α ∧γ )
(c) Only (C) is true De Morgan's Laws:
(d) Only (A) is true ¬ (α ∧β) ⇔ ¬ α ∨¬β
Ans. (d) : Given string W = abababa∈L (G). ¬ (α ∨β) ⇔ ¬ α ∨¬β
Thus two parse trees for W as shown in figure given Absorption Laws:
below. α ∧ (α ∨β ) ⇔ α
α ∨ (α ∧β ) ⇔ α
Implication Law: (α → β) ⇔ (¬α ∨β)
Contrapositive Law: (α → β) ⇔ (¬β → ¬α)
Tautology α ∨ ¬ α ⇔ T
Contradiction : α ∧ ¬ α ⇔ F
Equivalence:
(α →β) ∧ (β → α) ⇔(α → β)
So option (a) is distributive law.
option (c) is contrapositive law
So option (d) is correct. So correct answer is option (c).
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 417 YCT
 Search on TG: @apna_pdf
82. Match List I with List II : Ans. (c) : Correct Match is
List I List II Algorithm Complexities
(A) Localization (I) Encapsulation A. Breadth first search (ii) O (v + E)
(B) Packaging or (II) Abstraction B. Rabin-karp algorithm (iii) θ (n – m –1) m
binding of a
collection of C. Depth-first search (i) θ (v + E)
items D. Heap sort (worst case) (v) O (nlgn)
(C) Mechanism (III) Characteristic E. Quick sort (worst case) (iv) O (n2)
that enables of software that So option (c) is correct answer.
designer to indicates the
focus on manner in 84. Given below are two statements:
essential which Statement I : "Grandparent is a parent of
details of a information is one's parent"
proram concentrated in Statement II : First Order Predicate Logic
component program (FOPL) is representation of above statement is
(D) Information (IV) Suppressing ∀ g, c grandparent (g, c) ⇔ ∃ p parent (g, p) ∧
hiding the operational parent (p, c)
details of a In the light of the above statements, choose the
program most appropriate answer from the options
component given below:
Choose the correct answer from the options (a) Both Statement I and Statement II are correct
given below: (b) Both Statement I and Statement II are
A B C D incorrect
(a) (I) (II) (III) (IV) (c) Statement I is correct but Statement II is
(b) (II) (I) (III) (IV) incorrect
(c) (III) (I) (II) (IV) (d) Statement I is incorrect but Statement II is
(d) (III) (I) (IV) (II) correct
Ans. (c) : Localization is a characteristic of software Ans. (a) : Given statement
that indicates the manner in which information is Statement I – ‘‘Grandparent is a parent of one's
concentrated in program. parent.’’
Encapsulation is the packing of data and function into
one component and then controlling access to that Statement II – First order predicate logic representation
component to make a ‘‘blackbox’’ out of the object. of above statement is.
Because of this, a user of that class only needs to know ∀ g, c grandparent (g, c) ⇔ ∃p parent (g, p) ∧ parent (P,
its interface that is, the data and function exposed C)
outside the class, not the hidden implementation. • ∃p parent (g, p) means for at least one grandparent of
Abstraction is a mechanism that enables the designer parent.
to focus on the essential details of a program • Parent (P, C) means parent of child.
component with little concern for lower-level details.
Information hiding is a software design principle, Its meant statement I and statement II is true.
where certain aspects of a program or module are So option (a) is correct answer.
inaccessible to clients. The primary goal is to prevent 85. For the following page reference string
extensive modification to clients whenever the 4,3,2,1,4,3,5,4,3,2,1,5 the the number of page
implementation details of a module or program are faults that occur in Least Recently Used (LRU)
changed. page replacement algorithm with frame size 3 is
So option (c) is correct answer. (a) 6 (b) 8
83. Consider the following algorithms and their (c) 10 (d) 12
running times: Ans. (c) : Using Least Recently Used (LRU) page
Algorithms Complexities replacement algorthm.
(A) Breadth First (I) θ(v + E) String 4, 3, 2, 1, 4, 3, 5, 4, 3, 2 1, 5
Search
4 4 4 1 1 1 5 5 5 2 2 2
(B) Rabin-Karp (II) O (v + E) 3 3 3 4 4 4 4 4 4 1 1
Algorithm 2 2 2 3 3 3 3 3 3 5
(C) Depth-First (III) θ((n – m – 1)m) M M M M M M M H H M M M
Search Frame size = 3
(D) Heap sort (IV) O(n)2 M = Miss
(worst case)
H = Hit
(E) Quick sort (v) O(nlgn) Total number of page fault = 10.
(worst case)
Which one of the following is correct? 86. Modules X and Y operate on the same input
and output, then the cohesion is
A B C D E
(a) (III) (II) (I) (IV) (V) (a) Logical cohesion
(b) (II) (III) (I) (IV) (V) (b) Sequential cohesion
(c) (II) (III) (I) (V) (IV) (c) Procedural cohesion
(d) (III) (I) (II) (IV) (V) (d) Communicational cohesion
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 418 YCT
 Search on TG: @apna_pdf
Ans. (d) : A communicationally cohesion module is 89. Consider the traversal of a tree
one which performs several functions on the same input Preorder–ABCEIFJDGHKL
or output data. For example, obtain author, title or price Inorder-EICFJBGDKHLA
of book from bibliographic record, based on a passed
flag. Which of the following is correct post order
traversal?
87. Let R (ABCDEFGH) be a relation schema and
F be the set of dependencies F = {A → B, (a) EIFJCKGLHDBA (b) FCGKLHDBUAE
ABCD →E, EF → G, EF → H and ACDF → (c) FCGKLHDBAEIJ (d) IEJFCGKLHDBA
EG}. The minimal cover of a set of functional Ans. (d) : Given that
dependencies is Preorder  → ABCEIFJDGHKL
(a) A → B, ACD → E, EF→ G and EF → H
(b) A → B, ACD → E, EF→ G → EF → H and Inorder  → EICFJBGDKHLA
ACDF → G Traversing a tree have a particular order they follow.
(c) A → B, ACD → E, EF→ G → EF → H and • For inorder, you traverse from the left subtree to the
ACDF → E root then to the right subtree.
(d) A → B, ABCD → E, EF→ H and EF → G • For preorder, you traverse from the root to the left
Ans. (a) : Given relation schema subtree then to the right subtree.
Set of dependencies F = {A → B, ABCD → E, EF→ G, • For post order, you traverse from the left subtree to
EF → H and ACDF → EG } the right subtree then to the root.
EF → G and EF → H Inorder = Left, Root, Right
EF → GH Preorder = Root, Left, Right
B is extraneous in ABCD → E because BEABCD and
Post order = Left, Right, Root.
{A → B, ABCD → E, EF → GH, ACDF → EG}
logically implies {A → B, ACD → E, EF → GH, So using preorder and we find left and right child using
ACDF → EG} inorder.
This is because every ACD → E.
This FD can be derived using Armstrong Axioms form
A → B and ABCD → E via transitivite rule.
So remove B from ABCD → E.
F = { A → B, ACD → E EF → GH, ACDF → EG}
E is extraneous in ACDF → EG because E∈EG and {A
→ B, ACD → E, EF → GH, ACDF → G} logically New root = B since preorder contains B next
implies {A → B, ACD → E, EF → GH, ACDF → EG}
remove E from ACDF → EG
F = {A → B, ACD → E EF → GH, ACDF → G}
G is extraneous in ACDF → G is already implied by
ACD → E and EF → GH in F
remove ACDF → G from F
None of the remaining FD's in F have extraneous
attributes so the minimal cover is.
A → B, ACD → E, EF → G, EF → H.
So the correct anwer is option (a).
88. A good software requirement specification does Next root = C
NOT have the characteristic
(a) Completeness (b) Consistency
(c) Clarity (d) Reliability
Ans. (d) : Characteristics of software requirement
specification (SRS)
Quality characteristics of a good software requirement
specification (SRS) document include.
1. Complete 2. Consistent
3. Unambiguous 4. Traceable
5. Verifiable 6. Modifiable
7. Prioritized 8. Testable
9. High-level and low level 10. Relevant
11. Human readable
12. Aligned with business goals
13. Agile methodologies
So reliability is not characteristics of good (SRS).
So option (d) is correct answer. Next root

UGC NTA NET JRF Computer Science Dec. 2021-June 2022 419 YCT
 Search on TG: @apna_pdf
Ans. (d) : Alpha – Beta pruning can be applied
at the root (0) level of a game playing search tree. It is a
search algorithm used to reduce the number of modes
explored in a minimax search improving the efficiency
of the search process by pruning branches that are
unlikely to affect the final decision.
So option (d) is correct.
Read the following and Answer the questions
(91-95) :
Consider the relational schema of sailors S.
Reserves R and Boats B.
Table 1 : Reserves R
Sid Sname Ratting Age
Next root 22 Dustin 7 45.0
29 Brutus 1 33.0
31 Lubber 8 55.5
32 Andy 8 25.5
58 Rusty 10 35.0
64 Horatio 7 35.0
71 Zorba 10 16.0
74 Harotio 9 35.0
85 Art 3 25.5
95 Bob 3 63.5
Table 2 : Reserves R
Sid Bid day
Next root 22 101 10 /10 / 98
22 102 10 /10 / 98
22 103 10 / 8 / 98
22 104 10 / 7 / 98
31 102 11/10 / 98
31 103 11/ 6 / 98
31 104 11/12 / 98
64 101 9 / 5 / 98
64 102 9 / 8 / 98
74 103 9 / 8 / 98
Table 3 : Boats B
So post order traversal is
Bid Bname Colour
IEJFCGKLHDBA
So option (d) is correct. 101 Interlake blue
90. In a game playing search tree, upto which 102 Interlake red
depth α – β pruning can be applied? 103 Clipper green
(A) Root (0) level
104 Marine red
(B) 6 level
(C) 8 level 91. Which of the following relational algebra
(D) Depends on utility value in a breadth first query computes the name of sailors who have
order reserved a red and a green boat?
Choose the correct answer from the options (a) ρ (Tempred, πsid ((δcolor = 'red' Boats) ⨝
given below: Reserves), ρ (Tempgreen, πsid (δcolour = 'green'
(a) (B) and (C) only (b) (A) and (B) only Boats) ⨝ Reserves)), πsname (Tempred ∩
(c) (A), (B) and (C) only (d) (A) and (D) only Tempgreen) ⨝ Sailors
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 420 YCT
 Search on TG: @apna_pdf
(b) ρ (Tempboats 2, (δcolor = 'red' Boats) ∩ (δcolor = (c) πsid (δage = 20 Sailors) – πsid ((δcolour = 'red' Boats)
green Boats)) πsname (Tempboats 2 ⨝ Reserves) ⨝ Reserves ⨝ Sailors)
(c) πsname ((δcolor = 'red' Boats) ∩ (δcolor = 'green' (d) πsid (δage > 20 Sailors) ∧ πsid (δcolour = 'red' Boats)
Boats) (Tempboats 2 ⨝ Sailors ⨝ ⨝ Reserves ⨝ Sailors)
Reserves))
Ans. (a) : We know that
(d) ρ (Tempboats 2, (δcolor = 'red' color = 'green' Boats)
Relational algebra
πsname (Tempboats 2 ⨝ Sailors))
Ans. (a) : The name of sailors who have reserved a red
and a green boat is
ρ ( Tempred, πsid ((δcolor= green Boats) ⨝ Reserves)),
ρ (Tempgreen, πsid ((δcolor= green Boats) ⨝ Reserves)),
πsname (Tempred ∩ Tempgreen) ⨝ Sailors.

92. Which of the following relational algebra

query/queries computes/compute the name of
sailors who have reserved boat 103? The Sid's of sailors with age over 20
Q1. πsname ((δbid = 103 Boats) ... Sailors) = πsid (δage > 20 Sailors)
Q2. πsname (δbid = 103 (Reserves ... Sailors)) Reserved a red boat = πsid ((δcolor = red Boat
Q3. πsname ((δbid = 103 Reserves)... Sailors) So by question.
(a) Both Q1 and Q3 (b) Both Q2 and Q3 The Sid's of sailors with age our
(c) Only Q3 (d) Only Q2
20 who have not reserved a red Boat
name of Sailors = πsid (ago> 20 Sailors) πsid ((δcolor = red boats) ⋈ reserves
Ans. (b) : who have reserved boat
Detail of sailorsid ⋈ Sailors
103 sid, bid in rescues table Option (a) is correct answer.
• πsname ((δbid = 103 Reserves) ⨝ Sailors) 95. Which of the following relational algebra
• πsname (δbid= 103(Reserves ⨝ Sailors)) query computes the names of sailor who have
So option(b) is correct answer. reserved all boats?
93. Which of the following relational algebra (a) ρ (Tempsides, (πbid Reserves)/ πbid Boats)
query/queries computes/compute the names of πsname ((Tempsids) ⨝ Sailors)
sailors who have reserved a red boat? (b) ρ (Tempside, (πsid, bid Reserves)/ πbid Boats)
Q1 πsame ((δcolour = 'red' Boats) ... Sailors) πsname ((Tempsides) ⨝ Sailors)
Q2 πsame (πsid δcolour = 'red' Boats) ... Reserves) .. (c) ρ (Tempsids, (πsid Sailors)/ πbid Boats) πsname
Sailors)
((Tempsids) ⨝ Sailors)
Q3 πsame ((δcolour = 'red' Reserves) Boats ...
Sailors) (d) ρ (Tempsids, (πsid Reserves)/ πbid Boats)
(a) Both Q1 and Q2 (b) Both Q2 and Q3 πsname ((Tempsids) ⨝ Boats)
(c) Only Q1 (d) Only Q2 Ans. (b) : We know
Ans. (a) : given statement • πsid bid (Reserves)/πbid (Boats)– This query Computer
Q1. πsame ((δcolor = 'red' Boats) ⨝ Reserves ⨝Sailors ) the number of reservation records for each boat and
this is true statement. divides the count by the number of boats, producing a
Q2. πsame (πsid ((πbid δcolor = 'red' Boats) ⨝ Reserves) ⨝ relation Tempsides that includes two attributes: Sid
Sailors) (Sailor ID) and bid (Boat ID)
This is true statement • (Tempside) ⨝ Sailors – The Join operator ⨝ is used
Q3. πsame ((δcolor = 'red' reserves) Boats ⨝ Sailors this to join the result of the previous query with the sailors
false. relation, producing a relation that contains the sailor ID.
The join operator ⨝ is used to join the result of the Boat ID, and sailor name for each sailor who has
result of the δ operation with the reserves relation. This resaved a boat.
results in a relation that contains only reservation P (Tempsids, (.....) πsname (.....) – The final query
records for red Boats. projects only the sailor name from the result of the join,
94. Which of the following relational algebra giving us the names of sailor who have reserved a boat.
query computes the Sid's of sailors with age So P (Tempsids (....πsid, bid Reserves)/πbid Boats)
over 20 who have not reserved a red boat? πsname ((Tempsids) ⨝ Sailors.
(a) πsid (δage > 20 Sailors) – πsid ((δcolor = 'red' Boats) Based on the following passage, answer the
⨝ Reserves ⨝ Sailors) Questions (96-100) :
(b) ⨝ sid ((δcolour = 'red' ∧ age > 20 (Boats ⨝ A 3000 km long trunk operates at 1.536 mbps
Sailors ⨝ Reserves) and is used to transmit 64 bytes frames and
UGC NTA NET JRF Computer Science Dec. 2021-June 2022 421 YCT
 Search on TG: @apna_pdf
uses sliding window protocol. The propagation • Packet size = 64 bytes
speed is 6 µ sec/km. • Propagation speed = 6 µ sec/km
96. The minimum number of bits required in the
sequence number field of the packer is We calculate previous question efficiency = 0.587
(a) 6 bits (b) 7 bits We know that Maximum achievable throughput
(c) 5 bits (d) 4 bits = efficiency × Bandwidth
Ans. (b) : we calculate = 0.587×1.536 Mbps
Tt = 333.33 µ sec =0.901632 Mbps
Maximum achievable through put = 0.9016 Mbps
Tp= 18000 µ sec
So option (c) is correct answer.
Value of 'a'-
99. The transmission and operation delays are
Tp 18000 µ sec respectively
a= =
Tt 333.33 µ sec (a) Tt = 333.33 µ sec. Tp = 18000 µ sec
a = 54 (b) Tt = 300 µ sec. Tp = 15360 µ sec
So Bits required in Sequence Number (c) Tt = 33.33 µ sec. Tp = 1800 µ sec
field = log 2 (1 + 2a)  (d) Tt = 1800 µ sec. Tp = 33.33 µ sec
= log 2 (1 + 2 × 54)  Ans. (a) : Given that:
• Distance = 3000 km
= log 2 (109 
• Band width = 1.536 Mbps
= 6.76  • Packet size = 64 bytes
= 7 bits • Propagation speed = 6 µ sec/km
So option (b) is correct answer.
Packetsize
97. If only 6 bits are reserved for sequence number Transmission delay (Tt) =
field then the efficiency of the system is..... Band width
(a) 0.587 (b) 0.875 64 bytes
(c) 0.578 (d) 0.50 =
1.536 Mbps
Ans. (a) : Given that
If only 6 bits are reserved in the sequence, number field 64 × 8bits
=
then 1.536 ×10 – 6 bits per sec
Maximum sequence number possible = 26 = 64 T = 333.33 µ sec
Tt = 333.33 µ sec For 1 Km.
Tp = 18000 µ sec Propagation Delay (Tp) = 6 µ sec
Value of 'a'-
Tp For 3000 km, propagation delay = 3000×6 µ sec
a=
Tt Tp = 18000 µ sec
= 18000 µ sec So option (a) is correct answer.
333.33 µ sec
100. The sender window size to get the maximum
a = 54 efficiency is
Sender window size = 1 + 2a
(a) 108 (b) 109
= 1 + 2 × 54
(c) 55 (d) 56
= 1 + 108
= 109 Ans. (b) : We calculate
Maxiumum sequence number possible Tt = 333.33 µ sec, Tp = 18000 µ sec
Efficiency =
Sender window size a = 54
64 We know that
Efficiency = The sender window size to get the maximum efficiency
109
= 1 + 2a
Efficiency = 0.587 = 1 + 2 × 54
98. The maximum achievable throughput is. = 1+ 108
(a) 0.768 (b) 0.678 = 109
(c) 0.901 (d) 0.887 So option (b) is correct answer.
Ans. (c) : Given
Distance =3000 km
•Bandwidth 1.536 Mbps

UGC NTA NET JRF Computer Science Dec. 2021-June 2022 422 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December 2022

COMPUTER SCIENCE
(Solved with Explanation) (Exam : 11.03.2023)
1. The negation of "Some students like hockey" is : Ans. (c) : Suppose Mr. and Mrs. attend a party with
(a) Some students dislike hockey there other married copies AA', BB' and CC'. So several
(b) Every student dislike hockey handshakes took place.
(c) Every student like hockey Conditions – (i) No one shook hands with himself (or
(d) All students like hockey herself) or with their partner.
(ii) No one shook hands with the same person more than
Ans. (b) : Negation is an operation that takes a once.
proposition P to another proposition 'not P', standing for
'P is not true', written ¬ P, ~ P, or P . The Statement
"Some students like hockey" says that 'atleast' one
student like hockey. So, the negation of this statement is
"Every student not like (dislike) hockey".
2. A relation 'R' is defined on ordered pairs of
integers as :
(x, y) R (u, v) if x<u and y>v. Then R is
(a) Neither a partial order nor an equivalence
relation Suppose A shook 6 hands, then A' shook 0 hands
(b) A partial order but not a total order B Shook . 5 hands, then B' Shook 1 hands
(c) A total order C shook 4 hands, then C' shook 2 hands
(d) An equivalence relation So Mr. shook 3 hands and Mrs. also shook 3 hands.
Ans. (a) : An equivalence relation on set x is a subset of 4. Consider the following conditional code, which
x*x, i.e., a collection R of ordered pairs of elements of returns a Boolean values
x, satisfying certain properties. Write "xRy" to mean (x, If ((x>25) && (y>100))
y) is an element of R and We say "x is related to y. return 'false';
Then the properties are Reflexive, Symmetric, else if ((x≤≤25) && (y≤≤100))
Transitive. return 'true';
An partial order relation on a set x is a subset of x*x, else if ((x>25) && (y≤ ≤100))
satisfying certain properties. The properties are return 'false';
Reflexive, Anti-Symmetric, Transitive. else
An total order relation a set x is a subset of x*x, return 'true';
satisfying certain properties. The properties are Simplify it by filling in the following blank with
Reflexive, Anti-Symmetric, Transitive, Comparability. a single Boolean expression without changing
As given in question, a relation "R" is defined on the behaviour of the conditional code.
ordered pairs of integers as : (x, y) R (u, v) if x < u and if (----------)
y > v, Reflexive property is not satisfied here, because return 'true';
there is > or = v (or x = v and y = v) kind of relation else
among elements of sets then reflexive property could return 'false';
have been satisfied. Since reflexive property in not (a) x > 25 (b) x ≤ 25
satisfied here, so given relation cannot be equivalence,
partial order or total order relation. (c) y > 100 (d) y ≤ 100
So, option (a) is correct. Ans. (b) : Given conditional code, which returns a
Boolean Values
3. Suppose you are married and you and your if ((x > 25) & & (y> 100))
partner attend a party with three other return 'false';
married couples. Several handshakes took
else if ((x < 25) && (y < 100)
place. No one shook hands with himself (or
herself) or with their partner, and no one shook return 'true';
hands with the same person more than once. else if ((x > 25) && (y < 100))
After all hand shaking was completed, suppose else
you asked each person, including your partner, return 'true';
how many hands they had shaken. Each person by conditional
gave a different answer. How many hands did if (x < 25)
your spouse shake? return 'true';
(a) 1 (b) 2 else
(c) 3 (d) 4 return 'false';
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) P-II 423 YCT
 Search on TG: @apna_pdf
5. Which one of the following types of memory is Under unpipeline time = 4.4 × (10) = 44
fastest under pipeline time
(a) Cache Memory (b) Register Memory = 10 + overhead = 10 + 1 = 11
(c) Main Memory (d) Secondary Memory 44
Ans. (b) : Register memory is the smallest and fastest So, speedup = = 4 times.
11
memory in a computer. It is not a part of the main
memory and located in the CPU in the form of registers, 9. Machine Level Language is a/an
which are the smallest data holding elements. A register (a) Assembly Language
temporarily holds frequently used data instruction and (b) Low Level Language
memory address that are to be used by CPU. (c) High Level Language
6. The memory size for n address lines and m (d) Translating language
data lines is given by Ans. (b) : Machine Level Language
(a) 2m × n (b) m × n2 (c) 2n × m (d) n × m2 Machine language is a low-level language made up of
Ans. (c) : We know that binary numbers or bits that a computer can understand.
It is also know as machine code or object code and
ROM memory size = 2n × m. extremely tough to comprehend.
n = Number of address lines. The only language that the computer understands is
m = Number of data lines. machine language.
7. Simplify the following using K-Map 10. Which of the following is wrong about the data
F(A, B, C, D) = ∑(0, 2, 5, 7, 8, 10, 13, 15) typies?
(a) BD + B'D' (b) AC + A'C' (a) The number is always positive qualifier
(c) BC + B'C' (d) AD + A'D' 'unsigned' is used
Ans. (a) : Minterm = 0, 2, 5, 7, 8, 10, 13, 15 (b) The number can be positive or negative when
Variable = A, B, C, D the qualifier 'signed' is used
Using K = Map (c) The range of values for signed data types is
more than that of unsigned data types
(d) The left most bit in unsigned data type is used
to represent the value
Ans. (c) : In C language, unsigned is also one data type
in which is a variable type of int data type can hold zero
and positive numbers. There is also a signed int data
type which is a variable type of int data type that can
hold negative zero and positive number. This unsigned
int data type cannot represent a negative number.
Unsigned integers range from 0 to 4 billion in 32-bit
integers signed version ranges from around 2 billion to
+2 billion.
Positions = 0, 2, 8, 10 So option C is correct answer.
Simplified B' D' 11. If a constructor 'Date' is declared explicitly and
Positions = 5, 7, 13, 15 has to be defined outside the class, which of the
Simplified = B.D. following is correct?
So Σ (0, 2, 5, 7, 8, 10, 13, 15) = BD + B'D' (a) Data::Date(int dd) {/*...*/}
8. Consider an unpipelined machine with 10nsec (b) explicit Date :: Date(int dd) {/*...*/}
clock cycles which uses four cycles for ALU (c) Such a constructor cannot be defined
operations and branches where as five cycles (d) Constructor always has to be defined inside
for memory operation. Assume that the relative the class
frequencies of these operations are: 40%, 20% Ans. (a) : Constructor Defined Outside the class–The
and 40% respectively. Due to clock skew and constructor can be defined outside the class but it has to
setup pipeline let us consider that the machine be declared inside the class. Here you will use the scope
adds one nsec overhead to the clock. How much resolution operator.
speedup is observed in the instruction The syntax for constructor definition outside class :
execution rate when a pipelined machine is Class Class_Name {
considered. Public :
(a) 2 times (b) 4 times (c) 6 times (d) 8 times Class name ();
Ans. (b) : Consider the unpipelined machine with 10 ns },
clock cycles. It // Constructor definition outside class
Class name :: Class name ()
Operation Frequency Clock cycles
{
ALU 40% 4 }
Branch 20% 4 So option (a) is correct answer.
12. Which one of the following allows the session to
Memory 40% 5 continue?
Total clock cycle = 0.40 × 4 + 0.20 × 4 + 0.40 × 5 (a) When a user quits a browser
= 1.6 + 0.8 + 2 (b) When the user logs out and is invalidated by
= 4.4 clock cycle the servlet

UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 424 YCT
 Search on TG: @apna_pdf
(c) When the session is timed out due to Ans. (b) : Primary key – is a column or group of
inactivity columns in a table that uniquely indentify every row in
(d) When the user refreshes the browser and there that table.
is a persistent cookie. Foreign key – is a column that creates a relationship
Ans. (d) : Persistent cookies are stored on a user's between two tables. The purpose of foreign keys is to
device to help remember information settings, maintain data integrity and allow navigation between
preferences, or sign on credentials that a user has two different instances of an entity.
previously saved persistent cookies track visitors as So, only did "because the did in employee table will
they move around the website to figure out what people reference to did in department table ; since there could
like about the website to help improve the user be no employee working in a department which does
experience. The most popular persistent cookie is a not exist in the department table.
Google Analytics Cookie.
16. Which of the following statement is correct,
Session cookies is also called, Non-persistent cookies or according to the following instance of the
temporary cookies are storied in memory and never relational schema R(X, Y, Z)?
written to the disk.
Session cookies remain active as long as the browser X Y Z
remains active-once the browser is closed, the cookies 1 1 a
vanish. 1 1 a
13. Overfitting is expected when we observe that? 2 1 b
(a) With training iterations error on training set 3 2 b
as well as test set decreases
(b) With training iterations error on training set (a) X→Y, Z→X (b) Y→Z, Z→X
decrease but test set increases (c) X→Y, X→Z (d) Y→X, X→Z
(c) With training iterations error on training set Ans. (c) : given the relational scheme R (X, Y, Z)
as well as test set increases
(d) With training iterations training set as well as X Y Z
test error remains constant 1 1 a
Ans. (b) : Overfitting is expected–
High training accuracy, but low test accuracy when a 1 1 a
model achieves a high accuracy on the training data 2 1 b
but performs poorly on unseen data, it suggests
overfitting. The model has essentially "memorized" 3 2 b
the training examples including the noise or Option (a) is in correct
irrelevant patterns and cannot generalize well.
14. Identify the incorrect statement(s).
(a) A candidate key is minimal set of one or more
attributes that, taken collectively, allows us to
uniquely identify any entity in the entity set.
(b) A candidate key for which no proper subset is
also a candidate key is called a super key.
(c) A super key is a set of one or more attributes Option (b) is incorrect because Y→ Z is not acceptable..
that, taken collectively, allows us to uniquely Option (c) is correct
identify any entity in the entity set.
(d) A super key for which no proper subset is X→ Y and X→ Z is acceptable.
also a super key is called a candidate key. Option (d) is incorrect because Y→ X is not acceptable.
Ans. (b) : Candidate key : The minimal set of 17. In Linux Operating System, when _____ is
attributes that can uniquely identify a tuple is know as a invoked, it is passed a set of flags that
candidate kay. determine how much sharing is to take place
It is a minimal super key. between the parent and child tasks.
It most contain unique values. (a) fort() (b) clone()
The minimal set of attributes that can uniquely (c) pthread() (d) thread()
identify a record. Ans. (b) :
Super key : The set of attributes that can uniquely The main use of clone () is to implement threads :
identify a tuple in know a super key. multiple threads of control in a program that run
A candidate key is a super key but vice versa is not concurrently in a shared memory space.
true. The clone () system call is an upgraded version of the
So option (b) is correct. fork call. It's powerful science it creates a child process
15. Consider the two relations below. The primary and provides more precise control over the data shared
keys are underlined. Identify all possible between the parent and child processes.
foreign key(s) from the options based only on 18. The main function of the microkernel is to
the two relations. provide a communication facility between the
EMP (eid, ename, did) _____ program and the various ________ that
DEPT (did, dname) are also running in user space.
(a) eid (b) did (a) Virtual, Processes (b) System, Processes
(c) eid, did (d) eid, did, ename (c) Client, Services (d) Virtual, Services
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 425 YCT
 Search on TG: @apna_pdf
Ans. (c) : The microkernel is one of the Kernel's Ans. (d) : Non function requirement or NFRs are a set
classification being a Kernel it handles all system of specification that describe the system's operation
resources. It provides a minimal amount of process and capabilities and constraints and attempt to improve its
memory management services. The interaction between functionality. These are basically the requirements that
the client application and services running in user outline how well it will operate including thing like
address space is established via message passing that speed, security, reliability, data integrity, scalability etc.
helps to reduce the speed of microkernel execution. But user interaction is not NFRs.
19. Consider an operating system capable of 22. COCOMO stands for _____
loading and executing a single sequential user
process at a time. The disk head scheduling (a) Consumed cost model
algorithm used is first come first served (b) Constructive cost model
(FCFS). If FCFS is replaced by shortest seek (c) Common control model
time first (SSTF) and the vendor claims 50% (d) Composition cost model
better benchmark results. What is the expected Ans. (b) : COCOMO (Constructions Cost Model) is a
improvement in the I/O performance of user regression model based on LOC, i.e. Number Lines of
programs? Code. It is a procedural cost estimate model for
(a) 50% (b) 100% software projects and is often use as a process of
(c) 25% (d) 0% reliably predicting the various parameters associated
Ans. (d) : "Single sequential user process". So all thewith making a project such as size, effort cost, time and
requests to disk scheduler will be in sequence and eachquality.
one will be blocking the execution and hence there is no
23. Modifying the software to match changes in the
use of any disk scheduling algorithm. Any disk ever changing environment is called as
scheduling algorithm gives the same input sequence and
hence the improvement will 0% for SSTF over FCFS. (a) Adaptive maintenance
(b) Corrective maintenance
20. For the following set of processes scheduled
using FCFS policy, determine the average (c) Perfective maintenance
waiting time. Assume that the process arrived (d) Preventive maintenance
in the order P1, P2, P3, P4. Ans. (a) : Type of software maintenance corrective
Process Burst Time (ms) maintenance
P1 8 Corrective maintenance aims to correct any remaining
P2 15 errors regardless of where they may cause
specifications, design, coding testing and
P3 10 documentation etc.
P4 7 Adaptive maintenance–It contains modifying the
(a) 8 (b) 16 software to match changes in the ever changing
(c) 32 (d) 48 environment.
Ans. (b) : Given that Preventive Maintenance–It is the process by which
the process arrived in the order P1, P2, P3, P4, we prevent our system from being obsolete. It
Process Burst Time C.T. TAT Waiting Time involves the concept of reengineering & reverse
engineering in which and old system with old
CT-AT technology is re-engineered using new technology.
P1 8 8 8 0 This maintenance prevents the system from dying
P2 15 23 23 8 out.
P3 10 33 33 23 Perfective Maintenance–It defined improving
P4 7 40 40 33 processing efficiency or performance or restricting
the software to enhance changeability. This may
Ready Queue contain enhancement of existing system functionality
improvement in computational efficiency.
24. For a function of two variables, boundary value
CT = Completion Time analysis yields,
TAT = Turn Around Time (a) 4n+3 test cases (b) 4n+1 test cases
AT = Arrival Time (c) n+4 test cases (d) 2n+4 test cases
0 + 8 + 23 + 33 Ans. (b) : A program of n variables Boundary value
Average waiting time = analysis yields 4n + 1 test cases Robustness testing
4 yields 6n + 1 test cases worst case testing yields 5n.
64
= So option (b) is correct.
4 25. How many different trees are possible with 'n'
Average waiting time = 16 nodes?
21. Which of the following is not a Non functional (a) n–1 (b) 2n–1
n
requirement? (c) 2 (d) 2n-n
(a) Portability. (b) Security. Ans. (*) : Different tree are possible with n nodes, there
(c) Scalability (d) User interaction exist (2n)!/(n+1)!
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 426 YCT
 Search on TG: @apna_pdf
26. Let 'n' denote a positive integer. Suppose a 28. Consider the Graph below:
function F is defined as
 0, n = 1

f (n ) =    n  
f    + 1  n > 1
 2  How many spanning trees can be found?
What is f(25)? and what does this function find?
(a) 4, [log2 n] (b) 14, [log2 n] (a) 10 (b) 5
(c) 9 (d) 8
n n Ans. (d) : If a graph is a complete graph with n vertices
(c) 4,   (d) 14,  
2 2 then total number of spanning trees is n(n–2).
Ans. (a) : given function Where n is the number of nodes in the graph given
graph.
 0, n = 1

f (n ) =    n  
f   2  + 1  n > 1
   
f(25) so
n = 25 > 1

We know that
for a 3×3 matrix (3 rows and 3 column)
a b c
A =  d e f 
 g h i 
The determinant is
A = a ( ei − fh ) − b ( di − fg ) + c ( dh − eg )
Matrix representation
So f (25) = 4 [ log 2 n ] is correct answer.
1 2 3 4
27. Given the FFT we can have ___ time procedure
for multiplying two polynomials A(x) and B(x) 1 2 −1 0 −1
of degree bound n where input and output 2 −1 3 −1 −1
representations are in coefficient form, assuming
n is a power of 2. 3 0 −1 2 −1
(a) O(n2) (b) O(n.log2n) 4 −1 −1 −1 3
(c) O(2n) (d) O(log2n) Then living first row and first columns
Ans. (b) : 1. Double degree-bound : Create coefficient
representations of A(x) and B(x) as degree-bounded  3 −1 −1
 
polynomial by adding n high-order zero coefficients to A = det  −1 2 −1
each.  −1 −1 3 
2. Evaluate : Compute point-value representation of  
A(x) and B(x) of length 2n through two applications Calculate the determinate is
of the FFT of order 2n. These represents contain the A = 3 × 5 − ( −1)( −4 ) + ( −1) × 3
values of the two polynomials at the (2n)th roots of = 15 – 4 – 3
unity.
=8
3. Pointwise multiply : Compute a point value
representation for the polynomial C(x) = A(x) B(x) So option (d) is correct.
by multiplying these values together pointwise. This 29. The transition function 'δ δ' in multi-tape Turing
representation contains the value of c(x) and each machine is defined as:
(2n)th root unity. (a) δ: 2Q×Гk → 2Q×Гk×{L, R, S}k
4. Interpolate : Create the coefficient representation of
(b) δ: Q×Q×Гk → Q×Q× Гk×{L, R, S}k
the polynomial c(x) through a single application of
an FFT on 2n point value pairs to compute the (c) δ: Q×Гk → Q × Гk×{L, R, S}k
inverse DFT. (d) δ: Q× Гk 2Q → Q× Гk×2Q ×{L, R, S}k
Step (1) and (3) take time O(n) and Step (2) and (4) take Ans. (c) : The transition function for a multi-tape Turing
time O (nlgn). Thus, once we show how to use the FFT, Machine has the form
we will have proven the following.
So the product of two polynomials of degree-bound n δ : Q×Гk → Q × Гk×{L, R, S}k
can be computed in time O (nlgn), with both the input There are 6 tuple (Q, Г, B, δ, qo, F)
and output representations in coefficient form. Q is a finite set of states
So option (b) is correct. Г is the tape alphabet
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 427 YCT
 Search on TG: @apna_pdf
B is the blank symbols 33. Given Ethernet address 0101101000010001
δ is a relation on states and symbols K is the number 01010101 00011000 10101010 00001111 in
of tapes binary, what is the address in hexadecimal
q0 is the initial state notation?
F is the set of final states. (a) 5A:88:AA:18:55:F0
30. In Pumping Lemma for regular languages, to (b) 5A:81:BA:81:AA:08
say a language is satisfying pumping lemma, (c) 5A:18:5A:18::55:0F
what is the minimum length of 'y' if you (d) 5A:11:55:18:AA:0F
consider the string as 'xyz'. Ans. (d) : Given ethernet address
(a) n (b) 2 (c) 1 (d) 0 01011010 00010001 010100101 00011000
Ans. (c) : Let L be a regular language. 10101010 00001111
Then there exists a constant c such that for every string
w is L. Decimal Binary Hexa
|w|>c 0 0000 0
We can break w into three strings w = xyz such
1 0001 1
|y|>0
| xy | < c 2 0010 2
For all k > 0 the string xyk z is also L 3 0011 3
So the maximum length of y = 1
4 0100 4
31. The item generated by the production A → ε is:
(a) A → . (b) A → ε. (c) A → .ε (d) A → ε 5 0101 5
Ans. (a) : Canonical Collection of LR (0) items 6 0110 6
a LR (0) item is a production G with "dot" at some 7 0111 7
position on the right side of the production.
Example 8 1000 8
S → AC S → AC S→A C 9 1001 9
A→ε A→ ε A→ 10 1010 A
C→a C→ a C→a
11 1011 B
C→b C→ b C→b
So option (a) is correct. 12 1100 C
32. In the ε-NFA, M = ({q0, q1, q2, q3}, {a}, δ, q0, { 13 1101 D
q3}) where 'δ δ' is given in the transition table 14 1110 E
below, what is the minimum length of string to
reach to the final state? 15 1111 F
ε a So by table 5A : 11 : 55 : 18 : AA : 0F
q0 { q 1} {} 34. A Computer on a 10 Mbps network is
q1 { q 2} {} regulated by a token bucket. The token bucket
q2 {} { q 2, q 3} is filled at a rate of 2 Mbps. It is initially filled
q3 {} {} to capacity with 16 megabits. What is the
maximum duration for which the computer can
(a) 0 (b) 1 (c) 2 (d) 3 transmit at the full 10 Mbps?
Ans. (b) : Given that (a) 1.6 seconds (b) 2 seconds
M = [{qo, q1, q2, q3}, {a}, δ , qo , {q3}] (c) 5 seconds (d) 8 seconds
Number of state = {q o ,q1 ,q 2 ,q3 Ans. (b) : Given that
Variable = {a] Outgoing rate = 10 Mbps
Transition function = δ Incoming rate = 2 Mbps
Initial state = q0 Initially capacity = 16 Mb
Final state = {q3} We know that
given by table Initial capacity
Duration =
Outgoing Rate-Incoming Rate
16 16
= =
ε a 10 − 2 8
q0 {q1} { } Maximum duration = 2 seconds
q1 {q 2 } { } 35. In the standard Ethernet with transmission
rate of 10 Mbps, assume that the length of the
q2 { } {q 2 , q 3 } medium is 2500m and size of a frame is 512
q3 { } {} bytes. The propagation speed of a signal in a
according to the this graph minimum length of string cable is normally 2 x 108 m/s. Calculate
= εεa Transmission delay and propagation delay.
=a (a) 25.25µs and 51.2µs (b) 51.2µs and 12.5µs
So option (b) is correct (c) 10.24µs and 50.12µs (d) 12.5µs and 51.2µs
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 428 YCT
 Search on TG: @apna_pdf
Ans. (b) : Given that heuristic estimate of the cost from a node to a goal no
Bandwidth = 10 Mbps algorithm expands fewer nodes. Then A* and
Distance = 2500 m guarantees to find a lowest-cost path.
Propagation speed = 2 × 108 m/s So option (a) is correct.
packet size = 512 bytes 38. Which Artificial intelligence technique enables
We know that the computers to understand the associations
Transmission delay (Tt) and relationships between objects & Events?
(a) Heuristic Processing. (b) Cognitive Science.
Packet size
= (c) Relative symbolism. (d) Pattern Matching.
Bandwidth Ans. (d) : Pattern matching is a way to cheak a given
512 sequence of tokens in order to determine the presence of
Tt =
10 × 106 a given character or data in the given sequence. It
−6 allows computers to understand the relationship
Tt = 51.2µs 1µ = 10 between objects and events.
Distance 39. Where does the values of alpha-beta search get
Propagation delay (Tp) = updated?
Speed
(a) Along the path of search.
2500
Tp = (b) Initial state itself.
2.0 × 108 (c) At the end.
Tp = 12.5 µs (d) None of these.
So option (b) is correct. Ans. (a) : Alpha-Beta search updates the value of Alpha
and Beta gets along and prunes the remaining branches
36. In CRC coding if the data word is 111111, at node.
divisor 1010 and the remainder is 110. Which
of the following code is true? 40. A 4-input neuron has weights 1, 2, 3, 4. The
(a) 011111101 (b) 001010110 transfer function is linear with the constant of
(c) 111111110 (d) 110111111 proportionality being equal to 3. The inputs are
5, 7, 10, 30 respectively
Ans. (c) : Given that Then the output will be,
data word = 111111 (a) 120 (b) 213
divisor = 1010
(c) 410 (d) 507
Data plus CRC received = n – 1
n = number of divisor Ans. (d) : It is given that
n=4 weight = 1, 2, 3, 4
Data plus CRC received = 3 Transfer function = 3
Input = 5, 7, 10, 30
We know that
n
Output = Transfer function ∑I W
a =1
a a

I = Input
W = Weight
Output = 3 × (1× 5 + 2 × 7 + 10 × 3 + 4 × 30 )
= 3 × ( 5 + 14 + 30 + 120 )
Output = 3 × 169
So add the data word is 111111110 Output = 507
So option (c) is correct.
So option (d) is correct.
37. The A* algorithm is optimal when,
(a) It always finds the solution with the lowest 41. Consider the following statements:
total cost if the heuristic 'h' is admissible. P: There exists no simple, undirected and
(b) Always finds the solution with the highest connected graph with 80 vertices and 77 edges.
total cost it the heuristic 'h' is admissible. Q: All vertices of Euler graph are of even
(c) Find the solution with the lowest total cost if degree.
the heuristic 'h' is not admissible. R: Every simple, undirected, connected and
(d) It always finds the solution with the highest acyclic graph with 50 vertices has at least two
total cost if the heuristic 'h' is not admissible. vertices of degree one.
Ans. (a) : Optimality of the A* algorithm S: There exits a bipartite graph with more than
A search algorithm is optimal if no other search ten vertices which is 2-colorable.
algorithm uses less time or space or expands fewer What is the number of correct statement
nodes both with a guarantee of solution quality. among the above statements.
Optimality of A*–Among search algorithms that only (a) 1 (b) 2
use are costs and a heuristic estimate of the cost and a (c) 3 (d) 4
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 429 YCT
 Search on TG: @apna_pdf
Ans. (d) : By graph theory Choose the correct answer from the options
There exist no simple undirected and connected given below:
graph with 80 vertices 77 edges. (a) A, B and D Only (b) A, B and C Only
All vertices of Euler graph are of even degree. (c) C and D Only (d) B and D Only
Every simple undirected connected and acyclic graph Ans. (a) : Difference Between static RAM and
with 50 vertices has at least two vertices of degree
one. Dynamic RAM
There exists a bipartite graph with more than ten Basic of comparison SRAM DRAM
vertices which is 2-colorable. Speed Faster Slower
So all statements are correct. Size Small Large
42. Consider the following statements: Cost Expensive Cheap
A. There exists a Boolean algebra with '5'
elements. Used in Cache Main
B. Every element of Boolean algebra has Memory Memory
unique complement. Destruction Less Dense Highly Dense
C. If a Lattice 'L' is a Boolean algebra then Power Consumption Low High
'L' is not relatively complemented. So option (a) is correct.
D. The direct product of two Boolean
Algebras is also a Boolean algebra. 45. Which of the following statement is/are false?
Choose the correct answer about the four (A) The processor has direct access to both
statements given above. primary and secondary memory
(a) Only A and D are correct (B) Primary memory stores the active instructions
(b) Only B and D are correct and data for the program being executed on
(c) All statements are NOT correct the process
(d) All statements are correct (C) Secondary memory is used as a backup
Ans. (b) : Since each Boolean Algebra must have 2n memory
element for some integer n. (D) Memory system is implemented on a single
So first statement in incorrect. level memory
Every element of Boolean algebra has unique Choose the correct answer from the options
complement. given below :
If a Lattice 'L' is a Boolean algebra then 'L' is (a) A and B only (b) B and C only
relatively complemented.
The direct product of two Boolean Algebras is also a (c) A, B and C only (d) A and D Only
Boolean algebra. Ans. (d) : Primary memory can be accessed by the data
So option (b) is correct. bus where as secondary memory is accessed by 110
43. Which of the statement is not true in regards to channels.
virtual memory? Primary memory data is directly accessed by the
(a) The main objective for using virtual memory processing unit. Whereas secondary memory data
is to increase the effective capacity of the cannot be accessed directly accessed by the processing
memory system unit.
(b) Size of the program can be as large as the size In memory system
of the secondary memory Level O : CPU registers
(c) Program and data are stored in the secondary Level 1 : Cache memory
memory
(d) None of these Level 2 : Main memory or primary memory
Ans. (d) : Virtual Memory– Level 3 : Magnetic disks or secondary memory
Virtual memory is a storage allocation scheme in which Level 4 : Optical disks or magnetic types tertiary
secondary memory can be addressed as though it were memory.
part of the main memory. The addresses a program may So option (d) is correct.
use to reference memory are distinguished from the 46. Given a vector with Cartesian components (x,
addresses the memory system uses to identify physical
storage sites and program-generated addresses are 0.5 0 
y), if scaling is done with matrix  ,
translated automatically to the corresponding machine  0 1.5 
addresses. which of the following are true.
So all statement is correct.
(A) Decrease the vertical by three halves
So option(d) is correct.
(B) Increases the vertical by three halves
44. Which of the following is/are true for Dynamic
RAM (DRAM)? (C) Doubles the horizontal
A. It is slower than static RAM (SRAM) (D) Halves the horizontal
B. Packing Density is higher than Static RAM Choose the correct answer from the options
(SRAM) given below :
C. It is faster than static RAM(SRAM) (a) A and C only (b) A and D only
D. It requires data refreshing (c) B and C only (d) B and D only
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 430 YCT
 Search on TG: @apna_pdf
Ans. (d) : To determine the effect of scaling on the Choose the correct answer from the options
given vector with Cartesian components (x, y) using the below :
(a) A, B (b) A, C
0.5 0 
matrix  0 1.5 , we can perform matrix (c) B, C (d) A, B, C
  Ans. (a) : Hierarchical databases have a parent - child
multiplication relationship. In a Hierarchical databases model, data is
0.5 0   x  0.5x + 0  0.5x  organized in a tree-like structure where each record or
 0 1.5 ,  y  =  0 + 1.5y  = 1.5y  data element has a parent and can have multiple
        children.
The resulting vector is (0.5x, 1.5y) comparing this to the Network database is similar to hierarchical databases
original vector (x, y) we can observe the following but allow more flexible relationships between records.
changes.
So option (a) is correct.
The horizontal component has been halved (0.5x)
The vertical component has been increased by three 50. Identify the correct operation which produces
halves (1.5y) that below given output based on two relations
So option (d) is correct. R1 and R2.
R1
47. Which of the following lists defined in HTML
share similar elements? Name Class
(A) Unordered lists (B) Ordered lists a1 9
(C) Definition lists (D) Correlated lists b1 5
(E) Enumerated lists c1 6
Choose the most appropriate answer from the d1 11
options given below :
(a) A, B, D only (b) A, C, E only
(c) A, B, C only (d) A, C, D only R2
Ans. (*) : HTML lists→are used to present list of Name Class
information in well formed and semantic way. There are b1 5
three different types of list in HTML and each one has a f1 8
specific purpose and meaning.
Unordered list – Used to create a list of related items,
in no particular order. Output
Ordered list – Used to create a list of related items in Name Class
a specific order. b1 5
Description list – Used to create a list of terms and Choose the correct answer from the options
their descriptions.
below:
48. What are the drawbacks of using file systems to (a) R1 ∩ R2 (b) R1 – R2
store data?
(A) Data inconsistency (c) R1 – (R1 – R2) (d) R1 ∪ R2
(B) Difficulty in accessing data Ans. (a) : Given two relation
(C) Data isolation R1 R2
(D) Atomicity of updates
Choose the correct answer from the options Name Class Name Class
given below : a1 9 b1 5
(a) A, B only (b) B, C, D only
(c) A, B, C only (d) A, B, C, D b1 5 f1 8
Ans. (d) : Using the fill system to stone data has several c1 6
drawbacks. d1 11
Distinguished and Isolated Data.
Data Duplication/Data redundancy Output
Dependence on data Name Class
Data representation is challenging from the user's
perspective b1 5
Different file types Intersection of set→The intersection of two given sets is
Data protection the set that contains all the element that are common to
Issues with Transactions both sets given Relation.
Concurrent issues. R 1 {9, 5, 6, 11}
So option (d) is correct.
R 2 {5, 8}
49. Which of the following database model, we
have a parent-child relationship? R 1 ∩ R 2 = {5}
(A) hierarchical databases So option (a) is correct. but commission answer were
(B) network databases both(a & c).
(C) relational databases
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 431 YCT
 Search on TG: @apna_pdf
51. Which of the following statements are true? C. Software increments must be delivered in
A. Shortest remaining time first scheduling short time periods.
may cause starvation D. Software processes must not adapt to
B. Preemptive scheduling may cause changes incrementally
starvation Choose the correct answer from the options
C. Round robin is better than FCFS in terms given below :
of response time (a) A only (b) B only
Choose the correct answer from the options (c) C only (d) D only
given below : Ans. (c) : Manage unpredictability
(a) A only (b) B, C only Process adaptability (to rapidly changing project and
(c) A, B only (d) A, B, C technical conditions.)
Agile software process must adapt incrementally.
Ans. (d) : (A) Shortest remaining time first scheduling
To accomplish incremental adaptation, an agile team
is pre-emptive version of shortest job scheduling. In
SRTF, Job with the shortest CPU burst will be requires customer feedback.
An effective catalyst for customer feedback is an
scheduled first. Because of this process, it may cause
operational prototype or a portion of an operational
starvation is shorter processes may keep coming a long
CPU burst process never get CPU. system.
Software increments (executable prototypes or
(B) Pre-emptive just means a process before completing
portions of an operational system) must be delivered
execution stopped and other process can start execution.
The stopped process can later come back and continuein shoot time periods so that adaptation keeps pace
with change (unpredictability).
from where it was stopped. In pre-emptive scheduling,
54. Software project manager is responsible for the
suppose process P1 is executing in CPU and after some
following tasks:
time process P2 with high priority then P1 will arrive in
ready queue then P1 is pre-empted and P2 will brought A. Project Planning
into CPU for execution. In this way if process which is B. Project status tracking
arriving in ready queue of higher priority than P1, thenC. Resource management
D. Risk management
P1 is always pr-empted and it may possible that it suffer
from starvation. E. Project delivery within time & budget
(C) Round Robin will give better response time than Choose the correct answer from the options
FCFS, in FCFS when process is executing, it executed given below:
up to its complete burst time, but in Round Robin it will(a) All the statements are correct.
execute up to time quantum. So Round Robin (b) Only B & C are correct
Scheduling improves response time as all processes get (c) Only A & D are correct
CPU after a specified time. (d) All the statements are not correct.
So statements A, B and C is true. Ans. (a) : Software project
52. In design protocol of critical section problem,
→ A software project is the complete procedure of
each process must ask permission to enter software development from requirement gathering to
critical section in _________ code; it then testing and maintenance, carried out according to the
executes in the critical section; once it finishes
execution methodologies, in a specified period of
time to achieve intended software product.
executes in the critical section it enters the
_______ code. The process then enters the Need of software project management.
_______ code. Project Planning
(a) entry section, remainder section, exit section
Scope Management
(b) entry section, exit section, remainder section
Project Estimation
(c) remainder section, entry section, exit section
Resourse management
(d) remainder section, exit section, entry section
Project risk management
Ans. (b) : Critical section problem in OS Project Execution & Monitoring
Do { Project Communication Management
Project Management Tools
Entry section;
So option (a) is correct Answer.
Critical section 55. Mr. X designed open source software which
Exit Section must comply with some criteria. Choose the
false statement in respect of above.
Remainder Section
A. No restriction on redistribution of the
} while (true) software as part or whole.
So option (b) is correct. B. The integrity of the author's source code
53. How do you create agile processes to manage must be maintained.
unpredictability? C. The software can be sold after distribution.
A. Requirements gathering must be Choose the correct answer from the options
conducted very carefully. given below :
B. Risk analysis must be conducted before (a) A only (b) B only
planning takes place (c) C only (d) All statements are false
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 432 YCT
 Search on TG: @apna_pdf
Ans. (c) : Open source doesn't just means access to the C. The order of operands in infix expression
source code. The distribution terms of open source and postfix expression are the same.
software must comply with the following criteria. D. The order of operands in infix expression,
Free Redistribution prefix expression and postfix expression
Derived work are the same.
Integrity of the Author's Source Code Choose the most appropriate answer from the
options given below :
No Discrimination Against persons or Groups
(a) A, C and D Only (b) C and D Only
No Discrimination Against Fields of Endeavor
(c) A and B Only (d) A and D Only
Distribution of license
License must not be specific to a product Ans. (b) : Given expression
License must be technology Neutral. (A+B*D) / (E – F) + G
So option (c) is correct. Prefix Notation
+ / + A* BD – EFG
56. Circuit satisfiability problem: Given a Boolean Postfix Notation
combinatorial circuit composed of AND. OR ABD* + EF – / G +
and NOT gates, is it satisfiable? A one output
Boolean combinatorial circuit is satisfiable So option (b) is correct.
means for the given inputs the output will be 1. 58. Which of the following is (are) correct about
A. The circuit satisfiability problem belongs the regular expression?
to class NP aa*bb*cc*dd*
B. The circuit satisfiability problem is at least A. The language for the given expression is:
as hard as any language in NP L = {anbncmdm|n≥ ≥1} ∪ {anbmcmdn|n≥
≥1, m≥ ≥1,
C. The circuit satisfiability is NP - Complete m≥ ≥1}
D. The size of the circuit is Θ(K2 + 1) B. The context free language for the give
E. If P ≠ NP, this situation would contradict expression is:
the NP - Completeness of the problem. S → AB | C
Choose the correct answer from the options A → aAb | ab
given below : B → cBd | cd
(a) A, C, D Only (b) B, D, E Only C → aCd |aDd
(c) A, B, C Only (d) B, C, D Only D → bDc | bc
Ans. (c) : C. The language generated by this expression
is equal number of 'a' s, followed by equal
number of 'b' s, followed by equal number
of 'c' s and followed by equal number of 'd' s.
Choose the correct answer from the options
given below:
(a) Only A is correct
(b) Only B is correct
(c) Both A and B are correct
(d) All the tree A, B and C are correct
Ans. (c) : Given expression
aa* bb* cc* dd*
Y1 = X2 ∩ X3 (A) The language for the given expression
Y2 = Y1 ∩ X3 L= {a n b n cm d m if n ≥ 1 m ≥ 1}
Y3 = X3 ∪ X4
U = {a n b m cm d n /n ≥ m ≥ 1}
∴ f = Y1 ∩ Y2 ∩ Y3 ∩ Z
Therefore the circuit satisfiability is NP – Complete So put m =1 , n = 1
ex. Circuit satisfiability problem L = aa* bb* cc* dd* ,
An instance of the problem is an input specified to the We know the aa* = a, bb* = b
problem. An instance of the problem is a Boolean cc* = c, dd* = d
formula f. Since NP- Complete problem is a problem So A is correct.
which is both NP and NP-Hard, the proof or statement (B) The context Free Language
that a problem is NP-Complete consists of two parts : S → AB / C
1→The problem itself is in NP class. A→aAb
2→All other problems in NP class can be polynomial- A→ab
time reducible so that. A→a a b b
If the 2nd conditions is only satisfied then the problem is
called NP-Hard. B→cBd
So option (c) is correct Answer. B→cd
57. Given an expression B→c c d d
(A + B * D)/(E – F) + G C→aCd
A. The prefix notation is +/+A *DB-EFG C→aDd
B. The prefix expression is the reverse of the C→a a D d d
postfix expression
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 433 YCT
 Search on TG: @apna_pdf
D→bDc 61. Consider two hosts P and Q are connected
D→bc through a router R. The maximum transfer
unit (MTU) value of the link between P and R
D→b b c c is 1500 bytes and between R and Q is 820 bytes.
D Value put in C A TCP segment of size of 1400 bytes is
C → aa bb cc dd transferred from P to Q through R with IP
So identification value of 0x1234. Assume that IP
header size is 20 bytes. Further the packet is
S → a a bb cc dd / aa bb cc dd allowed to be fragmented that is Don't
So B is correct. Fragment (DF) flag in the IP Header is not set
But (c) is incorrect. by P. which of the following statement is/are
The correct Answer is option (c) true
59. Which of the following statements are correct? A. Two fragments are created at R and IP
A. The first three-address instruction in the datagram size carrying the second
intermediate code is a leader. fragment is 620 bytes
B. The instruction which is exactly at the B. If the second fragment is lost then R resend
middle of the given three address code is a the fragment with IP Identification value
leader. of 0x 1234
C. Any instruction that is the target of a C. If the second fragment is lost then P
conditional or unconditional jump is a required to resend the entire TCP segment
leader. D. TCP destination port can be determined by
D. Any instruction that immediately follows a analyzing the second fragment only
conditional or unconditional jump is a Choose the correct answer from the options
leader. given below :
Choose the correct answer from the options (a) A, B and C Only (b) A and C Only
given below : (c) C and D Only (d) B and D Only
(a) A, B and C (b) B, C and D Ans. (b) : Given that
(c) A, C and D (d) A, B, C and D TCP segment of size = 1400 bytes
Ans. (c) : Basic Block process–Instruction from IP header size = 20 bytes
intermediate code which are leaders are determined. At R packet will be Fragmented
Following are the rules used for finding a leader. MTU = 800 + 20 (Header)
The first three-address instruction of the intermediate Packet size = segment size + IP Header Size
code is a leader. = 1400 + 20
Instructions that are targets of unconditional or = 1420 bytes
conditional jump/goto statements are leaders. Hence Packet's Data (1400) will be divided in two
Instructions that immediately follow unconditional or packets = (800 + 600)
conditional jump/goto statement are considered First Fragment = (800 + 20) // Data + Header
leaders. Second Fragment = (600 + 20) bytes
So A, C, D is correct. A. Two fragments are created at R and IP datagram
60. Which of the following are correct on regular size carrying the second fragment is 620 bytes.
expressions? It is correct.
A. ϕ + L = L + ϕ = L B. It is second fragment is lost then R resend the
B. εL = L ε = L fragment with IP Identification value of 0x1234.
C. ϕL = L ϕ = ϕ It is incorrect As if any of the fragments is lost then
the entire packet/TCP segment has to be retransmitted.
D. ϕL = L ϕ = L C. If the second fragment lost then P required to resend
Choose the correct answer form the options the entire TCP segment.
given below : It is correct. If any of the fragments is lost then the
(a) A, B and D only (b) A, B and C only entire packet /TCP segment has to be retransmitted this
(c) B and D only (d) A and D only one of the drawbacks of fragmentation.
Ans. (b) : Given regular expressions D. TCP destination port can be determined by
We know that analyzing the second fragment only.
ϕ = 0 or null or empty = ε It is incorrect as Destination port number can be
A. ϕ + L = L + ϕ = L identified by looking at any packet or fragment not just
0+L=L+0=L only from second.
So A is correct. So correct option is (b).
B. ε.L = L.ε = L 62. The Solution to Silly Window Syndrome
ε is identity. problem is/are:
So B is correct A. Nagle's Algorithm
B. Clark's Algorithm
C. ϕL = Lϕ = ϕ C. Jacobson's Algorithm
0 . L = L. 0 = 0 = ϕ D. Piggy backing Algorithm
So C is correct. Choose the correct answer form the options
D. ϕL = L . ϕ = L given below:
So D is incorrect. (a) A and B Only (b) A and C Only
So option (b) is correct Answer. (c) C and D Only (d) B and D Only
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 434 YCT
 Search on TG: @apna_pdf
Ans. (a) : Silly Window Syndrome is a problem that 66. Match List I with List II
arises due to poor implementation of TCP. List-I List-II
Cause 1 : Sender window transmitting one byte of Data A. Planar Graph i. Probabilistic
repeatedly– Model
This problem is solved by Nagla's algorithm. B. Bipartite Graph ii. Deterministic
Cause 2 : Receiver window accepting one byte of data Model
repeatedly–
This problem is solved by problem is clark's solution or C. PERT iii. 4-Colorable
clark''s algorithm. D. CPM iv. 2-Colorable
So option (1) is correct answer. Choose the correct answer from the options
63. Which AI System mimics the evolutionary given below :
process to generate increasingly better (a) A-IV; B-III; C-I; D-II
solutions to a process to a problem? (b) A-III; B-IV; C-II; D-I
A. Self organizing neural network. (c) A-II; B-IV; C-I; D-III
B. Back propagation neural network (d) A-III; B-IV; C-I; D-II
C. Genetic algorithm Ans. (d) : Planar Graph
D. Forward propagation neural network (A) 4 color Theorem–"The chromatic number of a
Choose the correct answer from the options planar graph is no greater than 4."
given below : A (iii) Planar Graph → 4 colorable
(a) A Only (b) B Only (B) Bipartite Graph–A bipartite graph is possible if
(c) C Only (d) D Only the graph coloring possible using two colors such
Ans. (c) : Genetic Algorthms–An AI system that that vertices in a set are colored with the same
mimics the evolutionary, survival of the fittest process color.
to generate increasing to better solutions to a problem. B (iv) Bipartite Graph → 2-Colorable.
Genetic Algoritms use three concepts of evolution : PERT (Nature of modal) PERT is a probabilities
Selection or the survival of the fittest. modal i.e. it takes into account uncertainties involved in
64. Consider the following Learning algorithms. the estimation of time of a Job or an activity. It uses
A. Logistic regression three estimates of the activity time optimistic of the
B. Back propagation activity time optimistic pessimistic and most likely.
C. Linear regression Thus the expected duration of each activity is
probabilistic and expected duration indicates that there
D. Forward propagation is 50% probability.
Which of the following options represents
classification algorithm? (i) (C) PERT→ Probabilistic modal.
Choose the correct answer form the options CPM (Nature of Model) CPM is a deterministic model
given below : i.e. does not take into account the uncertainties involved
(a) A & C only (b) B & D only in the estimation of time for execution of a job or an
activity.
(c) A & B only (d) C & D only
(D) (ii) Deterministic model→CPM
Ans. (c) : Learning algoritm So option (d) is correct answer.
A learning algorithm is a set of instructions used in
machine learning that allows a computer program to 67. Match List I with List II
imitate the way a human gets better at characterising List-I List-II
some type of information. A. Direct i. MVI, A, FFH
(A) Logistic regression–It is used for binary Addressing
classification problems. It used to obtain an odds ratio B. Indirect ii. MOV, A, B
in the presence of more than one variable. Addressing
(B) Back propagation–It is the essence of neural net C. Register iii. STAFFFH
training. It is the method of fine tuning the weights of a Addressing
neural net based on the error rate obtained in the
previous iteration. It is a standard method of training D. Immediate iv. MOV, A, M
artificial neural networks. Addressing
65. Which Boolean operation on two variables can Choose the correct answer from the options
be represented by a single perception layer? given below:
A. X1 AND X2 B. X1 OR X2 (a) A-I, B-II, C-III, D-IV
C. X1 NOR X2 D. X1 XOR X2 (b) A-II, B-III, C-IV, D-I
Choose the most appropriate answer from the (c) A-III, B-IV, C-II, D-I
options given below : (d) A-IV, B-III, C-I, D-II
(a) A and B Only (b) B and C Only Ans. (c) : Direct Addressing Mode
(c) A, B and C Only (d) A, B, C and D Only In direct addressing mode, the data to be operated is
Ans. (c) : A single perceptron can represent any linearly available inside a memory location and that memory
separable function. AND, OR and NOR are linearly location is directly specified as an operand. The operand
separable in 2D plane and hence a single perception is directly available in the instruction itself Example.
(single perception layer) can represent them. STA F FFFH
So option (c) is correct. (A) (iii) Direct addressing → STA F FFFH

UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 435 YCT
 Search on TG: @apna_pdf
(B) Indirect Addressing–In register indirect addressing Ans. (b) :
mode, the data to be operated is available inside a A. (iii) If the implementation of generated or derived
memory location and that memory location is indirectly classes differ only through a parameter we have to use
specified by register pair. templates.
Example B. (i) If the actual types of objects used cannot be
MOV A, M (Move the contents of the memory location known at compile time, then we have to use class
pointed by the H–L pair to the accumulator. hierarchy.
(B) (iv) Indirect Addressing mode C (ii) If inline operations are essential and templates
used then we have improved runtime efficiency.
→ MOV AM D. (iv) To gain access to differing instances for derived
(C) Register Addressing–In register addressing mode classes through base we have to use explicit casting.
the data to be operated is available inside the register So option (b) is correct answer.
(S) and register (S) is are operands. 69. Match List I and List II
Therefore the operation is performed within various List-I List-II
registers of the microprocessor.
A. Apache i. Platform for
Example : Kafka constructing data
MOV A, B (move the contents of register B to register flows for extract,
A) transform, and load
C (ii) Register Addressing → Move A, B (ETL) processing
(D) Immediate Addressing–Immediate addressing and analysis of large
mode the source operand is always data. If the data is 8 datasets.
bit, then the instruction will be 2 bytes, if the data is 16 B. Pig ii. General-purpose
bit then the instruction will be 3 bytes. computing model
and runtime system
D (I) MVIA, FFH →Immediate for distributed data
Addressing analytics.
So option (c) is correct. C. Apache iii. Open-source
68. Match List I with List II Mahout platform that was
List-I List-II created by
Linkedin.
A. If the i. to use class
implementation hierarchy D. Mapreduce iv. Open-source
platform used for
of generated or creating scalable
derived classes machine learning
differ only algorithms.
through a Choose the correct answer from the options
parameter we given below :
have (a) A-II, B-IV, C-I, D-III
B. If the actual ii. improved (b) A-II, B-I, C-IV, D-III
types of objects run-time (c) A-III, B-I, C-I, D-II
used cannot be efficiency (d) A-I, B-II, C-IV, D-III
known at Ans. (c)
compile time, A. (iii) Apache Kafka is an open-source platform that
then we have was created by Linkedin.
C. If inline iii. to use B. Pig is a general-purpose computing model and
operations are templates runtime system for distributed data analytics.
essential and C. (iv) Apache Mahout is an open-source platform
templates are used for creating scalable machine learning
used then we algorithms.
have D. (ii) Mapreduce is a general-purpose computing
model and runtime system for distributed data
D. To gain access to iv. to use explicit analytics.
differing casting
So option (c) is correct answer.
instances for
derived classes 70. Match List I with List II
through base we List-I List-II
have A. IPC i. Resource Allocation
Choose the correct answer from the options B. Demand ii. Computational
given below : Paging speedup
(a) A-I, B-II, C-IV, D-III C. Banker's iii. Task Control Block
(b) A-III, B-I, C-II, D-IV Algorithm
(c) A-I, B-III, C-II, D-IV D. PCB iv. Virtual Memory
(d) A-II, B-I, C-III, D-IV
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 436 YCT
 Search on TG: @apna_pdf
Choose the correct answer from the options 72. Match List I with List II
given below : List-I List-II
(a) A-II, B-I, C-IV, D-III (b) A-II, B-IV, C-I, D-III
A. Dijkstra's i. Calculates path
(c) A-I, B-II, C-III, D-IV (d) A-II, B-III, C-I, D-IV
Algorithm matrix
Ans. (b) : IPC helps achieve these things
B. Prim's ii. Stores minimum
Computational speedup
Algorithm cost edge
Modularity
Information and data sharing C. Warshall's iii. Stores the total
Privilege separation Algorithm cost from a source
Processes can communicate with each other and node to the
synchronize their action. current node
A. (ii) IPC ––––––––→ Computational speedup. D. Kruskal's iv. Finds Minimum
B. (iv) Demand paging ––––––––→Virtual Memory algorithm Spanning Tree
Demand paging in operating system is a technique Choose the correct answer from the options
used in virtual memory management that enables a given below :
computer to use its physical memory more efficiently. (a) A-I, B-II, C-III, D-IV
C. (i) Banker's Algorithm––––––→Resource Allocation (b) A-III, B-II, C-I, D-IV
The Banker's algorithm is a resource allocation and (c) A-II, B-I, C-IV, D-III
deadlock avoidance algorithm that tests for safety by (d) A-III, B-IV, C-II, D-I
simulating the allocation for the predetermined Ans. (b) : Dijkstra's Algorithm–
maximum possible amounts of all resources.
Once the algorithm has found the shortest path between
D. (iii) PCB ––––––––––→ Task Control Block the source node and another node that node is marked as
Process Control Block is a data structure that contains "visited" and added to the path.
information of the process related to it the process
control block is also known as a task control block, A (iii) Dijkstra's stores the total cost from a source
entry of the process table etc. node to the current node.
So option (b) is correct answer. Prim's Algorithm→
71. Match List I with List II Prim's algorithm is a minimum spanning tree algorithm
that takes a graph is input and finds the subset of the
List-I List-II edges of that graph.
A. Product i. System B (ii) Prim's Algorithm→stores minimum cost edge.
complexity Requirements
Design C. Warshall's Algorithm→is used to determine the
transitive closure of a directed graph or all paths in a
B. Structured ii. Software directed graph by using the adjacency matrix.
System analysis design.
C. (1) Warshall's Algorithm→Calculate path matrix.
C. Coupling & iii. Validation
Cohesion techniques. D. Kruskal's Algorithm–Kruskal's Algorithm is used to
find the minimum spanning tree for a connected
D. Symbolic iv. Software cost weighted graph.
Execution estimation.
D. (iv) Kruskal's algorithm→Find minimum spaning
Choose the correct answer from the options
given below : tree.
(a) A-II, B-III, C-IV, D-I So option (b) is correct answer.
(b) A-III, B-I, C-IV, D-II 73. Match the following based on the language
(c) A-IV, B-I, C-II, D-III accepted by using brute force method of
(d) A-III, B-IV, C-I, D-II parsing.
Ans. (3) : Product complexity→ → List-I List-II
Product complexity is related with software complexity. A. S → aSa|aa i. ((2n*3) – 4); n ≥ 1
Complexity of any software is measured in terms of B. S → aaSaa|aa ii. 2n ; n ≥ 1
software cost estimation.
(iv) Product complexity––––→Software cost estimation C. S → aaaSaaa|aa iii. ((4 *2n) – 6) ; n ≥1
(i) Structured system analysis– D. S → aaaaSaaaa|aa iv. 2n – 2 ; n ≥ 2
––––––––→System Requirement Design. Choose the correct answer from the options
Coupling and Cohesion– given below :
Coupling and Cohesion are two key concepts in (a) A-IV, B-III, C-I, D-II
software engineering that are used to measure the (b) A-II, B-IV, C-I, D-III
quality of software system's design. (c) A-I, B-IV, C-III, D-II
C. (ii) Coupling & Cohesion (d) A-II, B-III, C-I, D-IV
–––––––→Software design.
Ans. (b) :
Symbolic Execution→Symbolic execution is a
validation technique A (ii) S → a S a/aa → 2n ,n > 1
or It is a software testing technique. B (iv) S → aa S aa/aa →2n – 2, n > 2
D. (iii) Symbolic Execution––→ Validation techniques. C (i) S → aaa S aaa/aa → ((2n * 3) – 4), n > 1
So option (c) is correct answer. D (iii) S → aaaa S aaaa/aa → ((4 * 2n) –6, n > 1
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 437 YCT
 Search on TG: @apna_pdf
74. Match List I with List II Ans. (a) : (A) There does not exist a polynomial time
List-I List-II algorithm to solve integer linear programming problem.
A. CDMA i. It provides mobile internet True
connection with faster data B. The main focus of PERT is to minimize the time
transfer rates required for completion of the project. B is true.
B. GSM ii. It allows users to connect to So correct answer is (a).
a network or to other devices 77. The correct sequence in fetch-execute cycle is
over wireless channel _______
C. UMTS iii. Accessing mechanism for A. Decode
multiple transmitters over a B. Fetch
single channel C. Execute
D. WiFi iv. It is cellular technology Chose the correct answer from the following
employs hybrid of FDMA (a) A-B-C (b) B-C-A
and TDMA (c) C-B-A (d) B-A-C
Choose the correct answer from the options Ans. (d) : The fetch execute cycle, which shows how
given below : the CPU can conduct calculations. The stages of the
(a) A-III, B-IV, C-II, D-I fetch execute cycle are broken into three parts :
(b) A-III, B-IV, C-I, D-II 1. Fetch 2. Decode 3. Execute
(c) A-II, B-III, C-IV, D-I So option (d) is correct answer.
(d) A-II, B-I, C-IV, D-III 78. In what sequence the initialization, testing and
Ans. (b) : CDMA → A(III) Accessing mechanism for execution of body is done while using do-while
multiple transmitters over a single channel. loop?
B(iv) GSM → It is cellular technology employs hybrid A. Commenting
of FDMA and TDMA. B. Execution of the body
C (i) UMTS → It provides mobile internet connection C. Initialisation
with faster data transfer rates. D. Testing the condition
D (ii) WiFi → It allows users to connect to a network or Choose the correct answer form the following
to other devices over wireless channel. (a) D, B, C (b) D, C, B
So option (b) is correct answer. (c) C, A, B (d) C, B, D
75. Match List I with List II Ans. (d) : Do while loop is a control flow statement that
List-I List-II executes a block of code and then either repeats the
A. Text planning i. Natural language block or exits the loop depending on a given Boolean
understanding condition.
So the sequence in a do while loop is option (d)
B. Sentence planning ii. Natural language Initialization, execution of body, testing the condition.
generation.
79. Select the correct order of DBSCAN algorithm.
C. Sentence
generation A. Find recursively all its density connected
points and assign them to the same cluster
D. Map the input to as the core point.
useful B. Find all the neighbor points with eps and
representations identify the core points with more than
Choose the correct answer from the options Min Pts neighbors.
given below : C. Iterate through the remaining unvisited
(a) A-I, B-II, C-I, D-II (b) A-II, B-II, C-I, D-II pointed in the dataset.
(c) A-I, B-II, C-II, D-I (d) A-II, B-II, C-II, D-I D. For each core point if it is not already
Ans. (d) : Text Planning, Sentence Planning, Sentence assigned to a cluster, create a new cluster.
generation are natural language generation. Choose the correct answer from the following:
D(1) Map the input to useful representation→Natural (a) B, D, C, A (b) D, B, C, A
language understanding. (c) B, D, A, C (d) D, B, A, C
So option (d) is correct answer. Ans. (c) : Step used in DBSCAN Algorithm.
76. Consider the statements: 1. Find all the neighbor points within eps and identify
A. There does not exist a polynomial time the cone points or visited with more then Min Pts
algorithm to solve integer linear neighbors.
programming problem. 2. For each cone point if it is not already assigned to a
B. Main focus of PERT is 'minimizing time'. cluster, create a new cluster.
Choose the correct option about the statements 3. Find recursively all its density connected points and
A and B. assign them to the same cluster as the cone point.
(a) A is True; B is True 4. Iterate through the remaining unvisited points in the
(b) A is True; B is False dataset. Those points that do not belong to any
(c) A is False; B is True cluster are noise.
(d) A is False; B is False So option (c) is correct Answer.

UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 438 YCT
 Search on TG: @apna_pdf
80. Select the correct order of events after power is Ans. (c) : Given graph using minimum spanning tree
initialized on a system. algorithms.
A. Bootstrap loader is loaded from the disk
B. Kernel is loaded onto the memory
C. Firmware ROM loads boot block
Choose the correct answer form the options
given below :
(a) B, C, A (b) C, A, B
(c) A, B, C (d) A, C, B
Ans. (b) : Power is initialized on system
Kernel is loaded onto the memory. d – f, a – b, b – f, d – e, d – c
Bootstrap loader is loaded from the disk. So option (c) is correct answer.
Firm ware ROM loads boot block. 83. What is the safest order while simplifying
81. Given below are two statements: one is labeled context Free Grammar?
as Assertion A and the other is labelled as (a) Elimination of ε-productions, Unit productions
Reason R. and then Useless symbols & productions.
Assertion A : Cohesion is a qualitative (b) Elimination of useless symbols & productions,
indication of the degree to which a module can ε-productions and then Unit productions.
be written more compactly and is able to (c) Elimination of Unit productions, ε-productions
complete its function in a timely manner. and then Useless symbols and productions.
Reason R : Cohesion is a qualitative indication (d) Elimination of ε-productions, Useless symbols
of the degree to which a module is connected to and productions and then Unit productions.
other modules and the outside world. Ans. (a) : Simplifying Context Free Grammar
In the light of the above statements, choose the
We remove all these redundant productions from a
most appropriate answer from the options grammar, while keeping the transformed grammars
givens given below. equivalent to the original grammar simplifying CFGs is
necessary to later convert them into normal form.
(a) Both A and R are correct and R is the correct
explanation of A. Types of redundant production and the procedure of
removing them into mentioned below.
(b) Both A and R are correct but R is NOT the
correct explanation of A. Eliminating ε productions
(c) A is correct but R is not correct. Eliminating unit production
(d) A is not correct but R is correct. Eliminating useless symbols.
Ans. (c) : Assertion A : Cohesion is a qualitativeSo option (a) is correct answer.
indication of the degree to which a module can be 84. Rearrange the following sequence in the
written more compactly and is able to complete its context of OSI Layers:
function in a timely manner. A. Transforming the raw bits in the form of
Coupling between modules/components is their degree frame for transmission
of mutual under dependence. B. Transmission of raw bits over
So A is correct but R is not correct. communication channel
82. Given the graph below which one of the C. Handling user interfaces
following edges cannot be added in that order D. Control and monitoring of subnet
to find a minimum spanning tree algorithm. E. Transmission data through connection
oriented or connection less using datagrams
Choose the correct answer from the options
given below :
(a) A-B-C-D-E (b) B-C-D-E-A
(c) B-A-D-E-C (d) A-B-D-E-C
Ans. (c) : Sequence in the context of OSI layers–
(1) Physical layer
The function of the Physical Layer
Bit synchronization
Bit rate control
Physical topologies
Transmission Mode
(2) Data Link Layer
Framing
Physical Addressing
A. a-b B. d-f Error Control
C. b-f D. d-c Flow Control
E. d-e Access Control
Choose the correct answer from the options (3) Network Layer
given below : The function of the network layer
(a) A, B, C, D, E (b) A, B, D, C, E Routing
(c) B, A, C, E, D (d) B, A, D, C, E Logical Addressing
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 439 YCT
 Search on TG: @apna_pdf
(4) Transport Layer 87. Assertion A : A Raster scan device is a CRT
The function of Transport Layer graphic device and can use a television monitor
Segmentation and Reassembly for display
Service Point Addressing Reason R : In Raster scan display the picture is
(5) Session Layer composed of a series of dots. These dots are
traced out as a series of horizontal lines.
The function of Session Layer Television words in a similar fashion.
Synchronization In the light of the above statements, choose the
Dialog Controller correct answer from the options given below:
(6) Presentation Layer (a) Both A and R are true and R is the correct
The function of Presentation Layer explanation of A
Translation (b) Both A and R are true but R is not the correct
Encryption / Decryption explanation of A
Compression (c) A is true but R is false
(7) Application Layer (d) A is false but R is true
The function of Application Layer Ans. (a) : Raster Scan Displays are most common type
Network Virtual Terminal of graphics monitor which employs CRT. It is based on
FTAM television technology.
Mail Services So option (a) is correct answer.
Directory Services 88. An OS follows Round-Robin Scheduling with
So option (c) is correct answer. time quantum of 4ms. Assuming that the CPU
is free now and there are 20 processes waiting
85. Choose the correct option describing the in the ready queue, the maximum amount of
features of Artificial neural network time that a process waits before getting into the
A. It is essentially machine learning algorithm. CPU is __________.
B. It is useful when solving the problems for (a) 80ms (b) 76ms
which the data set is very large. (c) 84ms (d) None of the above
C. They are able to extract features without Ans. (b) : Given that
input from the programmer. time quantum = 4 ms
D. These are systems modeled on the human Processes = 20
brain and nervous system
Ready queue P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11
Choose the correct answer from the options
given below :
(a) All the statements are correct. P12 P13 P14 P15 P16 P17 P18 P19 P20
(b) Only B & C are correct.
(c) Only A & D are correct.
(d) All the statements are not correct.
Ans. (a) : Features of Neural Network
Neural Network systems are modeled on the human
brain and nervous system.
They are able to automatically extract features
without input from the programmer.
Every neural network node is assentially a machine
learning algorithm. The maximum amount of time that a process waits
It is useful when solving problems for which the data before getting into the CPU is 76
set is very large. 89. Statement 1: Given a graph G = (V, E) in which
So option (a) is correct answer. each vertex v ∈V has an associated positive
86. Four persons: P, Q, R and S are in police weight w(v), we can use linear programming to
find the lower bound on the weight of the
custody and one of them has committed a minimum-weight vertex cover.
crime. They confess as follows: Statement 2: The lower bound can be found by
A. Person P: Q did it. maximizing the following
B. Person Q: S did it.
C. Person R: I did not do it. ∑ nν∈V w(ν)x(ν)
D. Person S: Q lied. subject to
If exactly one of the statements is false, which x(u) + x(v) ≥ 1 for each (u, v) ∈ V
of the following is the guilty person. x(v) ≤ 1 for each v ∈V
(a) P (b) Q x(v) ≥ 0 for each v ∈ V
(c) R (d) S In the light of the above statements, choose the
Ans. (b) : Given statement most appropriate answer from the options
given below:
A. Person P : Q did it (a) Both statement I and Statement II are correct
B. Person Q : S did it (b) Both statement I and Statement II are incorrect
C. Person R : I did not do it (c) Statement I is correct but Statement II is
D. Person S : Q lied incorrect
So guilty person is S and false statement is Q. (d) Statement I is incorrect and Statement II is
So option (b) is correct answer. correct
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 440 YCT
 Search on TG: @apna_pdf
Ans. (c) : Given that 92. An organization is granted the block
G = (V, E) be an undirected graph solving integer linear 130.56.0.0/16. The administrator wants to
programs is NP-Hard therefore we use Linear create 1024 subnets. Find the subnet prefix.
Programming (LP) to approximate the optimal solution. (a) 130.56 (b) 136.0
OPT (I) for the integer program. First we can relax the (c) 136.255 (d) 136.56.255
constraint xv ∈ {0, 1} to xv ∈ [0, 1]. It can be further Ans. (a) : 1024 = 2n where n = 10
simplified to xv > 0 ∀ v ∈ V. This is class B IP address and the default mask is 16
Thus, a linear programming formulation for vertex therefore we need 10 bits the subnets and now the
cover is subnet mask is /(16 + 10) = / 26 as slash notation with
n IP address prefix.
min ∑ w v x v represents a group of IPV4 addresses Number the
v∈V represents the group
Subject to If the prefix length is / P so P = 26
x u + x v ≥ 1∀e ( u, v ) ∈ E x v ≥ 0 1. Copy the first P bits P = 5 bits
We now use the following algorithm Vertex cover VIA 2. Change the rest of the bits to 0.
LP So, 130.56.0.0
Solve LP to obtain an optimal fractional solution x* So The subnet of prefix = 130.56
 1 93. An organization is granted the block
Let S =  v / x *v ≥  130.56.0.0/16. The administrator wants to
 2 create 1024 subnets. Find first and last
Output S addresses of First subnet.
Then the following claims are true. (a) 130.56.0.0 130.56.254.254
So option (c) is correct answer. (b) 130.56.0.0 130.56.0.63
90. A TCP Server application is programmed to (c) 130.0.0.0 130.255.255.255
listen on port on port P on Host S. A TCP (d) 130.56.0.0 130.56.255.63
Client is connected to the TCP Server over the Ans. (b) : The first address is subnet 1 = 130.56.0.1
network. Considered that while TCP
Connection is active the server is crashed and The last address is subnet 1 = 130.560.62 the first
rebooted. Assume that the client does not use address of is the address 130.56.00 and subnet mask/26
TCP keepalive timer. Which of the following connected by AND, and next can be estimated as
behaviors is/are possible? 10000010 00000010.0.0
Statement I : If client is waiting to receive a This address cannot be assigned, so consider the
packet, it may wait indefinitely following 10000010 00111000 00000000
00000001(130.56.0.1
Statement II : If the client sends a packet after
the server reboot, it will receive the FIN Similarly to the last address that can be assigned before
segment. In the light of the above statements, the broadcast address is 130.56.0.62.
choose the correct answer from the options 94. An organization is granted the block
given below 130.56.0.0/16. The administrator wants to
(a) Both Statement I and Statement II are true create 1024 subnets. Find first and last
(b) Both Statement I and Statement II are false addresses of last subnet.
(c) Statement I is true but Statement II is false (a) 130.56.0.0 130.56.254.255
(d) Statement I is false but Statement II is true (b) 130.56.255.0 130.56.255.255
(c) 130.56.0.192 130.255.255.255
Ans. (c) : A Keepalive timer is used to prevent a long
idle connection between two TCPs (d) 130.56.255.192 130.56.255.255
So, in absence of TCP Keepaline timer, Statement I is Ans. (*) : First address in 1024 subnet
correct. = 130.56.255.193
But statement(II) is false. 1024 last address in subnet = 130.56.255.254 this is
So option (c) is correct answer. total number of addresses.
91. An organization is granted the block 95. An organization is granted the block
130.56.0.0/16. The administrator wants to 130.56.0.0/16. The administrator wants to
create 1024 subnets. Find the number of create 1024 subnets. Find subnet mask.
addresses in each subnet (a) 130.255.255.255 (b) 130.56.255.255
(a) 32 (b) 64 (c) 130.56.0.255 (d) 130.56.155.192
(c) 128 (d) 16 Ans. (*) : 2n = 1024
Ans. (b) : 2n = 1024 Therefore, n = 10. The address So n = 10
given here is a class B, therefore the default mask Address is class B, so the default mask for it / 16. Since
is/16.10 bits are required for subnets and hence the subnet and require 10 bits the correct subnet mask is /
required subnet mask is / (16 + 10) = / 26 In dotted (16 + 10) = /26. The subnet mask is 255.255.255.192
decimal format, it shall be 192 and therefore, the subnet because it is 192 in decimal format with dots.
mask will be 255.255.255.255.192. The remaining bits 96. A Turing Machine for the language L =
must be used for the address in each subnet i.e. there {anbmcndm | n ≥ 1, m ≥ 1} is designed. The
will be 32 – 26 = 6 bits available for the address resultant model is M =
component. There will be a total of 26 = 64 bits ({q0,q1,q2,q3,q4,q5,q6,q7,qf}), {a, b, c, d}, {a, b, c,
available. d, X1, X2, Y1, Y2}, δ, q0, B, {qf} and part of 'δ δ' is
So option (b) is correct answer. given in the transition table. You need to write
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 441 YCT
 Search on TG: @apna_pdf
the following questions based on design of
Turing Machine for the given language. Note
that, while designing the Turing Machine X1
and X2 are used to work with 'a's and 'c's and
Y1 and Y2 are used to handle 'b's and 'd's of the
given string.

Turing Machine design

What is the Move in the cell with number 'M1'

of the resultant Table?
(a) (q2, X2, R) (b) (q2, X2, L)
(c) (q3, X2, L) (d) Error Entry
Ans. (b) : Turing Machine
given language {an bm cn dm / n > 1 m > 1}

So
a→ X1
c→ X2
b→ Y1
d→ Y2

RESULTANT TABLE
a b c d X1 X2 Y1 Y2 B
q0 (q1, XL R)
q1 (q1, a, R) (q1 b, R) (q2, X2, L) (q1, X2, R)
q2 (q2, a1, L) (q2, b, L) (q3, XL, R) (q2, Y2, L)
q3 (q1, X1, R) (q4, Y, R)
q4 (q4, b, R) (q5, X2, L) (q4, X2, R) (q4, Y2, R)
q5 (q5,b,L) (q5, X2, L) (q5, Y2, L)
q6 (q6, X2, R) (q6, Y2, R)
q7 (q7, Y2, R) q7, B, R
The Move in the cell with number 'M1' of the resultant Table.
(q2, X2, L)
97. A Turing Machine for the language L = What is the Move in the cell with number 'M2'
{anbmcndm | n ≥ 1, m ≥ 1} is designed. The of the resultant Table?
resultant model is M = (a) (q1, X1, R)
({q0,q1,q2,q3,q4,q5,q6,q7,qf }, (b) (q1, a,R)
{a,b,c,d,X1,X2,Y1,Y2}, δ, q0, B, {qf}) and part of (c) (q1, X1,R)
δ' is given in the transition table, You need to
'δ (d) Error Entry
write the following questions based on design
of Turing Machine for the given language. Note Ans. (d) : Turning machine
that, while designing the Turing Machine X1 given language {a b c d / n > 1 m > 1}
n m n m

and X2 are used to work with 'a's and 'c's and So

Y1 and Y2 are used to handle 'b's and 'd's of the
given string.

a→ X1
c→ X2
b→ Y1
d→ Y2

UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 442 YCT
 Search on TG: @apna_pdf

Turing Machine design

RESULTANT TABLE
a b c d X1 X2 Y1 Y2 B
q0 (q1, XL R)
q1 (q1, a, R) (q1 b, R) (q2, X2, L) (q1, X2, R)
q2 (q2, a1, L) (q2, b, L) (q3, XL, R) (q2, Y2, L)
q3 (q1, X1, R) (q4, Y, R)
q4 (q4, b, R) (q5, X2, L) (q4, X2, R) (q4, Y2, R)
q5 (q5,b,L) (q5, X2, L) (q5, Y2, L)
q6 (q6, X2, R) (q6, Y2, R)
q7 (q7, Y2, R) q7, B, R
The Move in the cell with number 'M2' of the resultant Table.
Error Entry
98. A Turing Machine for the language L = b → Y1
{anbmcndm | n ≥ 1, m ≥ 1} is designed. The d → Y2
resultant model is M =
({q0,q1,q2,q3,q4,q5,q6,q7,qf}), {a,b,c,d,},
{a,b,c,d,X1,X2,Y1,Y2}, δ, q0, B, {qf} and part of
δ' is given in the transition table. You need to
'δ
write the following questions bases on design of
Turing Machine for the given language. Note
that, while designing the Turing Machine X1
and X2 are used to work with 'a's and 'c's and
Y1 and Y2 are used to handle 'b's and 'd's of the
given string.

Turing Machine design

What is the Move in the cell with number 'M3'

of the resultant Table?
(a) (q1, X1,L) (b) (q4,X1,R)
(c) (q1,X1,R) (d) Error Entry
Ans. (c) : Turning machine
given language {an bm cn dm / n > 1 m > 1}
So

a → X1
c → X2
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 443 YCT
 Search on TG: @apna_pdf
RESULTANT TABLE
a b c d X1 X2 Y1 Y2 B
q0 (q1, XL R)
q1 (q1, a, R) (q1 b, R) (q2, X2, L) (q1, X2, R)
q2 (q2, a1, L) (q2, b, L) (q3, XL, R) (q2, Y2, L)
q3 (q1, X1, R) (q4, Y, R)
q4 (q4, b, R) (q5, X2, L) (q4, X2, R) (q4, Y2, R)
q5 (q5,b,L) (q5, X2, L) (q5, Y2, L)
q6 (q6, X2, R) (q6, Y2, R)
q7 (q7, Y2, R) q7, B, R
The Move in the cell with number 'M3' of the resultant Table.
q1, XL, R)
99. A Turing Machine for the language L =
{anbmcndm | n ≥ 1, m ≥ 1} is designed. The
resultant model is M =
({q0,q1,q2q3,q4,q5,q6,q7,qf}, {a,b,c,d},
{a,b,c,d,X1,X2,Y1,Y2}, δ, q0, B, {qf}) and part of
δ' is given in the transition table. You need to
'δ
write the following questions based on design of
Turing Machine for the given language. Note
that, while designing the Turing machine X1
and X2 are used to work with 'a's and 'c's and
Y1 and Y2 are used to handle 'b's and 'd's of
the given string.

Turing Machine design

What is the Move in the cell with number 'M4'

of the resultant Table?
(a) (q5,Y1,L) (b) (q3,Y1,R)
(c) (q4,Y1,L) (d) (q3,Y1,L)
Ans. (*) : Turing machine
given language {an bm cn dm / n > 1 m > 1}
So

a→ X1
c→ X2
b→ Y1
d→ Y2

RESULTANT TABLE
a b c d X1 X2 Y1 Y2 B
q0 (q1, XL R)
q1 (q1, a, R) (q1 b, R) (q2, X2, L) (q1, X2, R)
q2 (q2, a1, L) (q2, b, L) (q3, XL, R) (q2, Y2, L)
q3 (q1, X1, R) (q4, Y, R)
q4 (q4, b, R) (q5, X2, L) (q4, X2, R) (q4, Y2, R)
q5 (q5,b,L) (q5, X2, L) (q5, Y2, L)
q6 (q6, X2, R) (q6, Y2, R)
q7 (q7, Y2, R) q7, B, R

UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 444 YCT
 Search on TG: @apna_pdf

100. A Turing Machine for the language L =

{anbmcndm | n ≥1, m ≥ 1} is designed. The
resultant model is M =
({q0,q1,q2,q3,q4,q5,q6,q7,qf}, {a,b,c,d},
{a,b,c,d,X1,X2,Y1,Y2}, δ, q0, B, {qf}) and part of
δ' is given in the transition table. You need to
'δ
write the following questions based on design of
Turing Machine for the given language. Note
that, while designing the Turing Machine X1
and X2 are used to work with 'a's and 'c's and
Y1 and Y2 are used to handle 'b's and 'd's of the
given string.

Turing Machine design

What is the Move in the cell with number 'M5'

of the resultant Table?
(a) (q4,X2,R) (b) (q5,X2,R)
(c) (q5,X2,L) (d) Error Entry
Ans. (*) : Turing machine
given language {an bm cn dm / n > 1 m > 1}
So

a→ X1
c→ X2
b→ Y1
d→ Y2
RESULTANT TABLE

a b c d X1 X2 Y1 Y2 B

q0 (q1, XL R)

q1 (q1, a, R) (q1 b, R) (q2, X2, L) (q1, X2, R)

q2 (q2, a1, L) (q2, b, L) (q3, XL, R) (q2, Y2, L)

q3 (q1, X1, R) (q4, Y, R)

q4 (q4, b, R) (q5, X2, L) (q4, X2, R) (q4, Y2, R)

q5 (q5,b,L) (q5, X2, L) (q5, Y2, L)

q6 (q6, X2, R) (q6, Y2, R)

q7 (q7, Y2, R) q7, B, R

UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 11.03.2023) 445 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December 2022

COMPUTER SCIENCE
(Solved with Explanation) (Exam : 15.03.2023)
1. Which of the following is NOT logically Ans. (c) :
equivalent to P → Q? The given data
(a) ~P v Q (b) ~ Q → ~P Seven possible grades = {S, A, B, C, D, P, F}
(c) ~ (P ^ ~ Q) (d) ~Q→P n=7
Ans. (d) : By using truth table get the same grade
K+1=6
P Q ~ ~ P→ ~P∨ ~Q ~ ~(P^~
K=5
P Q Q Q →~ Q Q
P → By pigeonhole principle
P The minimum number of student = kn+1
= 5 × 7 + 1 = 35 + 1 = 36
T T F F T T T T T So option (c) is correct.
T F F T F F F T F 5. In 16-bit 2's Complementation representation,
F T T F T T T T T the decimal number 28 is
F F T T T T T F T (a) 1111 1111 0001 1100
So by truth table option (d) is correct. (b) 1111 1111 1111 0100
(c) 1111 1111 1110 0100
2. Seven people enter a lift. The lift stops only at (d) 1111 1111 1110 0011
three floors (which are unspecified). At each of
the three floors no one enters the lift, but at Ans. (c) : Given decimal number
least one person leaves the lift. After the three (28)10 = (11100) = (0000 0000 0001 1100)2
floor stops the lift is empty in how many ways 2's complement of 0000 0000 0001 1100
this can happen? = 1111111111100100
(a) 1844 (b) 2187 (c) 1806 (d) 343 Note : Start reading the bits from LSB (right hand side)
Ans. (c) : According to the question there are many and write it unless first 1 is encounter leave the first 1 as
it is and complement the remaining bits.
possible combinations in that case.
i.e. 5 – 1 – 1, 4 – 2 – 1, 4 – 1 – 2, 3 – 3 – 1, 6. Simplify the following using K-Map F(A, B, C,
3 – 2 – 2, 3 – 1 – 3, 2 – 4 – 1, 2 – 3 – 2, D) = ∑(3, 4, 5, 6, 7, 11, 15)
(a) AB + C'D (b) A'B + CD
2 – 2 – 3, 2 – 1 – 4, 1 – 5 – 1, 1 – 4 – 2, (c) AC + BD (d) A'B + B'C
1 – 3 – 3, 1 – 2 – 4, 1 – 1 – 5.
There are just 4 possible patterns, Ans. (b) : Given K-map
F(A, B, C, D) = ∑(3, 4, 5, 6, 7, 11, 15)
5 – 1 – 1, 4 – 2 –1, 3 – 3 – 1 and 3 – 2 – 2
In each possible way you need to find the permutations.
Computer (Choose people) × (Permute patterns),
 7  4  3!
For the 3 – 3 – 1 pattern,    (!) ×
 3  3  2!
By computing each pattern and adding up then.
The answer is 1806.
3. The coefficients of x2y3z2 in the expansion of
(x+y+z)7 is
(a) C(7, 3) * C(5, 2) (b) C(7, 2) * C(5, 3)
(c) C(7, 3) * C(7, 2) (d) C(5, 3) * C(5, 2)
Ans. (b) : So simplified Expression = A'B + CD
General term of (x+y+z)7 7. Consider a 3-bit counter, designed using T flip
7! p q r flops as shown below :
= x ×y ×z
p!q!r!
So coefficient of x2y3z2
7! 7!
= × 12.13.12 = = 210
2!3!2! 2!3!2!
So option (b) is correct
4. What is the minimum number of students in
discrete mathematics class to be sure that at Assume the initial state of the counter given by
least six will receive the same grade, if there are PQR as 000, what are the next three states?
seven possible grades : S, A, B, C, D, P and F? (a) 011, 101, 000 (b) 001, 010, 111
(a) 7 (b) 13 (c) 36 (d) 14 (c) 011, 101, 111 (d) 001, 010, 000
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) P-II 446 YCT
 Search on TG: @apna_pdf
Ans. (a) : From the above counter- Internal functions are known as compile time. This
is the incorrect statement. Internal functions also
TP = R, TQ = P , TR = Q and PQR = 000 known as static functions have their scope limited to
Present Input Next state the file they are defined in they are not known
TP = R TQ = P TR = Q P +
Q+ R+ outside of the file they are delcared in at compile
time but they are still knwon within file during the
0 1 1 0 1 1 linking phase.
1 1 0 1 0 1 So option (c) is correct.
1 0 1 0 0 0 10. Given int arr[3][4][2] = {{{2, 4}, {7, 8}, (3, 4},
{5, 6}}, {{7, 6}, {3, 4}, {5, 3}, {2, 3}}}, {{8, 9}, {7,
Where P+ = P⊕P, Q+ = P ⊕ Q, R+ = Q ⊕ R 2}, {3, 4}, {5,1}}}};
So, next three states are- 011, 101, 000 Which one of the following can be used to refer
8. Let R1 and R2 be two 4-bit registers that store to element 1 in the above 3-d array?
numbers in 2's complement form. For the (a) arr[3][4][2]
operation R1+ R2 which one of the following (b) *(*(*(arr+2)+3)+1)
values of R1 and R2 gives an arithmetic (c) *(arr+2) + *(arr+3) + *(arr+1)
overflow? (d) arr[2][3][2]
(a) R1 = 1011 and R2 = 1110 Ans. (b) : The given code
(b) R1 = 1100 and R2 = 1010 int arr[3][4][2] = {{2, 4}, {7, 8}, {3, 4}, {5, 6}}
(c) R1 = 0011 and R2 = 0100 {{7, 6}, {3, 4}, {5, 3}, {2, 3}}
(d) R1 = 1001 and R2 = 1111 {{8, 9}, {7, 2}, {3, 4}, {5, 1}}}}
Ans. (b) : If two numbers are represented using 2's - To refer to element 1 in the given 3- dimensional array,
complement with n-bits you should uses option (b)
Condition for overflow : Overflow occurs if the signs *(*(*(arr + 2) + 3) +1)
of addends are the same and the sign of sum is different Let's break this expression step-by-step
from the addends. 'sign'. 1. *(arr+2) : This accesses the 3rd element (index 2) in
the outermost dimensional of the array. This given a
2-dimensional of the array. This given a 2-
dimensional array {{8,9}, {7,2}, {3,2}, {3,4}, {5,1}}
2. *(*(arr+2)+3) : Now we move to the 4th element
(index 3) in the second dimensional of the 2-
Note : Same and then different ⇒ overflow dimensional array obtained in the previous step.
Here, In this particular question : This given us {5, 1}
Here in all option sign bits of addends are same ⇒ 3. *(*(*(arr+2) + 3) +1) : Finally we access the 2nd
overflow many occur element (index 1) in the last 1-dimensional array
obtained in the previous step, which given us the
desired element.
So option (b) is correct.
11. Allowing different derived classes to be used
interchangeably though the interface provided
(Same in all options) by a common base class is called _____
(a) Derived polymorphism
(b) Compile time polymorphism
(c) Static polymorphism
(d) Run time polymorphism
Ans. (d) : Run time polymorphism- This is achieved
through the use of virtual functions and is a
different fundamental concept in object oriented programming.
only (b) option, sum's sign if different from addends' At runtime the appropriate derived class's implmentation is
sign ⇒ overflow. called based on the actual type of the object being
It should be roted that while perfarming the addition referred to through a pointer or reference to the base
carry bit generated will be discasded. class. This allows for dynamic dispatch and enables the
program to behave polymorphically choosing the
9. In the context of Binding which one of the appropriate method implementation based on the actual
following is incorrect? runtime type of the object. So option (d) is correct.
(a) Static binding is done at Compile Time 12. In ______ cruve the last and the first vertices of
(b) Absolute addresses are known at Load Time the polygon lie on the curve and all other
(c) Internal functions are known at link time vertices define the derivatives order and shape
(d) Target of a function is known at runtime of the curve.
Ans. (c) : Static binding is done at compile time. This is (a) B-Spline Curve (b) Boxline curve
correct. Static binding also known as early binding, (c) Bezier curve (d) Gaussain curve
occurs the competation phase. The compiler resolves Ans. (c) : In a Bezier curve, the first and the last vertices of
the method of function calls at compile time and the the polygon lie on the curve, and all the other vertices
binding is fixed. (also called control points) define the derivatives, order
Absolute addresses are known as load time This is and shape of the curve. Bezier curves are commonly-aided
also correct. In a system with static memory design (CAD) applications for creating smooth curves
allocation, the addresses of variables and functions and surfaces. They are define by Bernstein polynomials
are determined and fixed during the load time of the and offer precise control over the shape of the curve by
program. adjusting the positions of the control points.
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 447 YCT
 Search on TG: @apna_pdf
13. A ______ operation combines the rows of the Ans. (c) : The correct statement is : The internal nodes
two relations and outputs a new relation that in a branch are connected by "AND" and branches by
has both input relations rows in it. "OR".
(a) Difference (b) Union When converting a decision tree into a set of logical
(c) Certesian product (d) Project rules, each path from the root to a leaf in the decision
Ans. (b) : The operation that combines the rows of two tree represents a conjunction of conditions, and the
different paths branches are combined using the logical
relations and outputs a new relation that has both input OR operation. Each internal node in a branch represents
relation's rows in its is the "Union operation. a condition connected by logical AND. By following
So the option (b) is correct. this approach you can express the decision tree as a set
14. Consider the relation R(P, Q, R, S, T, U, V, W, of logical rules that capture the same decision - making
X, Y) and FDs : process.
{P, Q, S} → T 17. Model of protection can be viewed as
R→Y (a) Owner matrix (b) Domain matrix
{P, Q} → V (c) Access Matrix (d) Global matrix
{R, X} → X Ans. (c) : Access Matrix - The model of protection that
we have been discussing can be viewed as an access
Q→U matrix in which columns represent different system
V → {W, X} resources and rows represent different protection
Which of the following is a candidate key? domains. Entries within the matrix indicate what access
(a) {P, Q, R, S} (b) {R, Q, X} that domain has to that resource.
(c) {V, X} (d) None of the above
Ans. (a) : Given the function dependencies (FDs)
1. (P, Q, S) → T
2. R → V
3. {P, Q} → V
4. (R, X) → X
5. Q → U
6. V → {W, X} This is access matrix graph
Let's check if all attributes are covered by {P, Q, R, S} 18. Process in memory also contain the heap
T : T is covered by (P, Q, S) → T section. What is the use of heap section?
U : U is covered by Q → V (a) Contains temporary data
V : V is covered by {P, Q} → V (b) Dynamically allocate the memory during
W : W is not directly determined by any candidate process run time
key. (c) Contains Process priority and pointers to
X : X is covered by {R, X} → X and V → {W, X} scheduling queues
Y : Y is covered by (R) → Y (d) Contains amount of CPU and real time use.
Since all attributes are covered {P, Q, R, S} is a Ans. (b) : The heap section in memory is crucial for
candidate key. managing dynamically allocate data during a process's
runtime. It allow programs to allocate memory as
So option (a) is correct. needed, making it possible to handle data with varying
15. Which RAID level is appropriate for storing sizes and life spans efficiently.
the log file of a ticket booking system where a However proper memory management is essential to
huge database update is required? prevent memory leaks and excessive memory
(a) Level 0 (b) Level 1 consumption.
(c) Level 2 (d) Level 3 So option (b) is correct.
Ans. (b) : RAID (Redundant Array of Independent 19. How many page faults occur for optimal
Disks) Level 1 provided mirroring, meaning that data is algorithm for the following string with four
duplicated across two or more drives. In this frames?
configuration, all data written to one drive is also 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8
written to another drive in real-time. This redundancy (a) 8 (b) 7 (c) 6 (d) 5
ensures data integrity and availability making it a Ans. (a) : The given reference string :
suitable choice for storing critical log file that must be 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8
preserved and protected during a huge database update. Number of frames : 4
So option (b) is correct. Let's simulate the algorithm step by step
16. If we convert a decision tree to a set of logical 1. Frame status [–, –, –,–] page fault! Page 1 is loaded
rules then : into frame 1.
(a) The internal nodes in a branch are connected 2. Frame status : [1, –, –, –] Page fault!
by AND and branches by AND Page 2 is loaded into frame 2.
(b) The internal nodes in a branch are connected 3. Frame status : [1, 2, –, –] page fault!
by OR and branches by OR Page 3 is loaded into frame 3.
(c) The internal nodes in a branch are connected 4. Frame status : [1, 2, 3, –] page fault!
by AND and branches by OR Page 4 is loaded into frame 4.
(d) The internal nodes in a branch are connected 5. Frame status : [1, 2, 3, 4] page fault!
by OR and branches by AND Page 5 is loaded into frame 1.
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 448 YCT
 Search on TG: @apna_pdf
6. Frame status : [5, 2, 3, 4] page fault! Ans. (b) : Component Adaptation Techniques-
Page 3 is already in a frame so no page fault occurs. • White-box wrapping (integration conflicts removed
7. Frame status : [5, 2, 3, 4] page fault! by marking code level modifications to the code)
Page 4 is already in a frame, so no page fault • Grey box wrapping (used when component library
occurs. provides a component extension language or API that
8. Frame status : [5, 2, 3, 4] page fault! allows conflicts to be removed or masked)
Page 1 is already in a frame, so no page fault • Black-box wrapping (requires the introduction of pre-
occurs. and post-processing at the component interface to
9. Frame status : [5, 2, 3, 4] page fault! remove or mask conflicts)
Page 6 is loaded into frame 2. So clear-box wrapping is a technique used for
10. Frame status : [5, 6, 3, 4] page fault! component wrapping.
Page 7 is loaded into frame 3. 24. The cyclomatic complexity metric provides the
11. Frame status : [5, 6, 7, 4] page fault! designer with information regarding the
Page 8 is loaded into frame 4. number of _____
12. Frame status : [5, 6, 7, 8] page fault! (a) Cycles in the program
Now, when Page 7 is requested again, it will be (b) Errors in the program
replaced because it's the last occurrence in the (c) Independent logic paths in the program
reference string that requires a page replacement. (d) Statements in the program
Total page faults : 8 Ans. (c) : The cyclomatic metric provides the designer
So, for the given reference string and four frames the with information regarding the number of linearly
optimal algorithm result in 8 page faults. independent paths through a program's source code. It is
20. Degree of concurrency in thread can be a quantitative measure of the complexity of the
arranged in the manner. complexity of a program is controlflow.
(a) One-to-one > many-to-one > many-to-many The formula to calculate cyclomatic complexity is as
(b) One-to-one > many-to-many > many-to-one follows.
(c) many-to-many > many-to-one>one-to-one Cyclomatic complexity (V) = E – N + 2
(d) None of the above Where
Ans. (c) : The correct arrangement of degree of E = the number of edges in the control flow graph
concurrency from highest to lowest is many-to-many > N = the number of nodes in the control flow graph.
many-to-one > one- to - one. 25. In a ______ the left and right sub trees for any
21. Which of the following is not one of the given node, differ in height by more than one.
principles of good coding? (a) Balanced Binary Tree
(a) Create unit tests before you begin coding. (b) Weight balanced binary tree
(b) Create visual layout that aids understanding. (c) Height balanced tree
(c) Refractor the code after you completes the (d) Binary Search Tree
first coding pass. Ans. (*) : an unplaced binary tree is a type of binary
(d) Write self-documenting code not program tree where the height of the left and right sub trees for
documentation. any given node given differs by more than one level.
Ans. (d) : Good principles of coding is UGC has drop this question.
Create unit tests before you begin coding. 26. FFTs are ______ techniques used to encode
Create visual layout that aids understanding. digital video and audio information and helps
Refractor the code after you completes the first analyse the signal in _____ domain.
coding pass. (a) Encryption, time
DRY (Don't repeat yourself) (b) Encryption, frequency
KISS (Keep It short and simple) (c) Compression, time
Refactor (d) Compression, frequency
Creation over legacy Ans. (d) : Fourier Transform is a mathematical concept
Open/closed that can covert a continuous signal from time - domain
So option (d) is correct. to frequency - domain. FFTs are compression
22. If P is the risk probability, L is the loss, then techniques used to analyze digital video and audio
Risk exposure (RE) is computed as _____ information and help analyze the signal in the frequency
(a) RE = P/L (b) RE = P + L domain. So the correct answer is compression,
(c) RE = P * L (d) RE = 2 + (P*L) frequency.
Ans. (c) : The correct formula to calculate Risk 27. Given six weights 4, 15, 25, 5, 8, 16 construct a
Exposure (RE) based on the risk probability (P) and loss 2-T tree. What is the minimum weighted path
(L) is length?
RE = P * L (a) 231 (b) 172 (c) 73 (d) 77
This formula multiplies the risk probability (P) by the Ans. (b) :
loss (L) to determine the Risk Exposure (RE). It takes The given weights = 4, 15, 25, 5, 8, 16
into account both the likelihood of an event occurring Seat = 4, 5, 8, 15, 16, 25
(Risk probability) and the potential impact or loss Using Huffman's Algorithm
associated with that event. (i)
23. Which of the following is a technique used for
component wrapping?
(a) Black-box wrapping (b) Clear-box wrapping
(c) Gray-box wrapping (d) White-box wrapping again increasing order.

UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 449 YCT
 Search on TG: @apna_pdf
(ii) 28. Suppose we store n keys in a hash table of size
m=n2 using a has function h randomly chosen
from a universal class of hash functions. Then
the probability is _____ that there are any
collisions.
(iii) (a) greater than 1/5 (b) greater than 1/2
(c) less than 1/2 (d) less than 1/5
n
Ans. (c) : There are   pair of keys that may collide;
2
each pair collides with probability 1/m if n is chosen at
again increasing order random from a universal class of hash function,
(iv) Let x be a random variable that counts the number of
collisions. When m=n2 the expected number of
collisions is
n 1
E(x) =   . 2
2 n
n2 − n 1
= .
2 n
1
E(x) <
2
So option (c) is correct.
again increasing order 29. In Pumping Lemma for context free languages,
to say a language is satisfying pumping lemma,
(v) what is the minimum length of 'vx' together, if
you consider the string as 'uvwxy'?
(a) 0 (b) 1
(c) 2 (d) n
Ans. (a) : The pumping Lemma for context free
languages that for any context - free language L, there
exists a constant 'n' (called the pumping length) such
that any string S in L, with length at least 'n' can be
divded into five pieces u, v, w, x, y satisfying the
following conditions.
1. For each i ≥ 0 the string uv w xy is also in L.
2. |vwx| ≥ 1 (i.e. the combined length of v and x is at
least 1)
3. |vwx| ≤ n (i.e. the combined length of v and x is at
again increasing order most the pumping length.)
(vi) So in this context, the minimum length of 'vx' to gather
(i.e. |vwx|) for a language to satisfy the pumping
Lemma is 1.
So option (b) is correct.
30. Which of the following is ε-free grammar?
(a) Type-0 (b) Type-1
(c) Type-2 (d) Type-3
Ans. (b) : ε - Free grammar is also known as context
sensitive grammar.
S → ∈ it is allow to the starting symbol.
So option (b) is correct by Chomsky hierarachy.
31. While processing a string by an LR parser, the
reading of the given string by the parser is .......
(a) From right to left
(b) From left to right
(c) Can be either from left to right or right to left
(d) From the centre of the given string
Ans. (b) : The leading of a given string by an LR parser
is from left to right. LR (Left-to-right, right most
derivation) parser is a type of shift reduce parser used in
Minimum weighted path length parsing computer languages. It starts from the leftmost
=15 × 2 + 16 × 2 + 8 × 3 + 4 × 4 + 5 ×4 + 25 × 2 end of the input string and builds the parse tree in a
= 30 + 32 + 24 + 16 + 20 + 50 bottom up manner by repeatedly applying shift and
= 172 reduce operations until the input is completely parsed.
So option (b) is correct. So option (b) is correct.
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 450 YCT
 Search on TG: @apna_pdf
32. What is the minimum and maximum number 34. In CRC coding if the data word is 111111,
of initial, dead, unreachable and final states in divisor is 1010 and the remainder is 110. Which
a valid 'n' state finite automaton, where the of the following code is true?
language accepted is not 'ϕ ϕ'? (a) 011111101 (b) 001010110
(a) Minimum : 1, 1, 1, 1; Maximum : 1, (n-1), (n- (c) 111111110 (d) 110111111
1), n Ans. (c) : The given data word = 111111
(b) Minimum : 1, 0, 0, 0; Maximum : 1, (n–1), divisor = 1010
(n-1), n remainder = 110
(c) Minimum : 1, 0, 0, n; Maximum: 1, n, (n-1), steps to perform CRC on the sender side
(n-1) ■ String of n o's is appended to the data unit to be
(d) Minimum : 1, 0, 0, 1; Maximum: 1, (n-1), (n- transmitted.
1), n ■ Where, n→ number of bits in CRC divisor-1
Ans. (d) : The minimum and maximum number of ■ Binary division is performed of data unit with the
initial, dead, unreachable, and final state can be defined CRC divisor.
as follows. ■ The remainder obtained after division is called
1. Initial state CRC.
■ Minimum : There must be at least one initial state ■ Append CRC at last of data units.
for the automation to start its computation So, the So append CRC 110 at last of data unit - 111111110
minimum number of initial states is 1.
■ Maximum : There can be only one initial state in a So option (c) is correct.
finite automation having more than one initial state 35. In Go-back-N protocol, the values of Sf(Send
would lead to ambiguity and violate the definition window, the first outstanding packet) = 3, Sn
of a finite automation. (Send window, the next packet to be send) = 7,
2. Dead states (Non-Accepting states) after receiving the packet with AckNo. 6, the
■ Minimum : There can be zero dead state in the value of Sn is _____
automation. A dead state is a state from which no (a) 6 (b) 7
final state can be reached, and it cannot accept any (c) 5 (d) 4
string. Ans. (b) : Given the values
■ Maximum : The maximum number of dead states is ■ Sf (send window, the first outstanding packet) = 3
n-1. This occurs when there is a single accepting ■ Sn (Send window, the next packet to be sent) = 7
state, and all other state are dead states. and after receiving an acknowledgement with ACKNo.
3. Unreachable states : 6, it means that packets, 3, 4, 5 and 6 have been
■ Minimum : There can be zero unreachable states in successfully received. Thus the sender can safely move
the automation, meaning that all states are reachable its window forward.
from the initial states. The updated value of Sn will be the next packet that
Maximum : The maximum number of unreachable needs to be sent. Since packets 3, 4, 5 and 6 have
states is n-1. This occurs when there is a single acknowledged the next packet to be sent is packet 7.
reachable state, and all other states are unreachable Therefore, after receiving the acknowledgement with
from the initial state(s) ACK No. 6, the value of Sn becomes 7.
4. Final states (Accepting states) So option (b) is correct.
■ Minimum : There are must be at least one final state 36. What is the minimum Hamming Distance in a
to accept strings in the language. So the minimum block code if we want to be able to detect up to
number of final states is 1. S errors?
■ Maximum : The maximum number of final states (a) S (b) S+1
can be n. This happens when all states in the (c) 1 (d) 0
automation are final states meaning that any state
can lead to an accepting state. Ans. (b) : Hamming distance between two words of the
same size is the number of differences between the
So corresponding bits. It can be calculated by applying the
■ Minimum Initial states : 1 XOR operation.
■ Maximum Initial states : 1 Formula
■ Minimum Dead states : 0 To guarantee the detection of up to S errors in all cases
■ Maximum Dead states : n -1 the hamming distance in a block code must be
■ Minimum Unreachable states : 0 d≥S+1
■ Maximum Unreachable states : n - 1 hamming distance be minimum
■ Minimum Final states : 1 ∴ dmin = S + 1
■ Maximum Final states : n So option (b) is correct
So option (d) is correct 37. Which search technique is complete and
33. Which protocol is used to acquire the MAC optimal, when h(n) is consitent?
address of a host whose IP address is known? (a) Best First Search (b) Depth First Search
(a) Dynamic Host control protocol (c) A* Search (d) Breadth First Search
(b) Address Resolution Protocol Ans. (c) : When the heuristic function h(n) is consistent
(c) Reverse Address Resolution Protocol (also know as "admissible" or "monotonic", the A*
(d) User Datagram Protocol search algorithm becomes both complete and optional.
Ans. (b) : Address Resolution Protocol (ARP) is a So option (c) is correct
procedure for mapping a dynamic IP address to 38. What is the process of capturing inference
permanent physical machine address in a local area process as a single inference rule?
network (LAN). The physical machine address is also (a) Ponens (b) Clauses
know as a media access control (MAC) address.
(c) Generalized modus ponens (d) Variable
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 451 YCT
 Search on TG: @apna_pdf
Ans. (c) : All kinds of inference process can be Ans. (b) : Binary Trees - A tree whose element
captured as a single inference rule that can be called as have 0 or 1 or 2 children is called a binary tree. Since
generalized modus ponens. each element in a binary tree can have only 2 children,
39. Fuzzy logic is a form of ____ we typically name them the left and right child.
(a) Two valued logic (b) Crisp set logic ■ The number of binary search trees possible with 'n'
(c) Binary set logic (d) Many valued logic nodes is (2n)!/((n+1)!n!)
Ans. (d) : Fuzzy logic is a form of many-valued logic in ■ The number labeled binary search trees possible
which the truth many-valued logic in which the truth with 'n' nodes is (2n)!(n+1)!
value of variable may be any real number between 0 ■ The number of simple, undirected and labeled
and 1. It is employed to handle the concept of partial graphs possible with n nodes can be calculated
truth. Where the truth value may range between using the catalan number formula.
completely true and completely false. Cn = (2n)!/[n+1!*n!]
40. The 4Ws problem canvas helps in identifying So statement C is false.
the key elements related to the problem 4Ws So option (b) is correct.
problem canvas is a part of ______ 43. The relation R = {(1, 3), (1, 1), (3, 1), (1, 2), (3,
(a) Problem scoping (b) Data acquisition 3), (4, 4)} defined in (1, 2, 3, 4) is _____
(c) Data modeling (d) Problem Evaluation (a) Reflexive, Symmetric but not Transitive
Ans. (a) : Problem Scoping : Problem scoping means (b) Symmetric anti-symmetric and transitive
selecting a problem which we might want to solve using (c) Asymmetric, anti-symmetric and not transitive
our AI knowledge. (d) Not reflexive, not symmetric and not transitive
Problem scoping is the process of indentifying the scope Ans. (d) : The given relation
the problem (like cause, nature or solution of a problem) R = {(1, 3), (1, 1), (3, 1), (3, 1), (1, 2), (3, 3), (4,4)}
that you wish to solve with the help of your project. Check Reflexive
Who What > Where > Why 4Ws problem canvas is a
part of problem scoping. If the relation is reflexive
So option (a) is correct. then (a, a) ∈ R for every a∈ {1, 2, 3, 4}
41. Consider the following statements : Since (1, 1) (3, 3) (4, 4) ∈ R but (2, 2) ∉ R
A. A group can have zero elements. ∴ R is not reflexive.
B. A group cannot have any element which is Check symmetric
idempotent except the identity element. To check whether symmetric or not
C. An isomorphism from a group <G, *> to <G, If (a, b) ∈R then (b, a) ∈ R
*> is called an automorphism Here (1, 2) ∈R, but (2, 1) ∉ R
D. If every element in a group is its own inverse ∴ R is not symmetric
then the group must be abelian. Check transitive
Choose the correct answer about the four To check whether transitive or not
statements given above. If (a, b) ∈R &(b, c) ∈R, then (a, c) ∈R
(a) B, C and D are correct
(b) Only A and C are correct Here (1, 3) ∈R and (3, 2) ∉ R and (1, 2) ∈ R
(c) Only B and C are correct ∴ R is not transitive
(d) All A, B, C and D are correct Hence, R are not reflexive, symmetric and transitive
The correct Answer is (d)
Ans. (a) : A group is a non-empty set with an operation
that satisfies the associative, has an identity element, 44. Consider the Boolean expression given by F
and every element of the set has an inverse element. =(X+Y+Z)(X'+Y)(Y'+Z), Which of the
So statements A is false. following Boolean expressions is/are equivalent
B. A group cannot have any element which is idempotent to F (Complement of F)?
except the identity element. This is true statement. A. (X'+Y' + Z') (X+Y') (Y+Z')
C. An isomorphism from a group <G, *> to <G, *> is B. (XY' + Z')
called an automorphism C. (X+Z') (Y'+Z')
This is true statement. D. (XY'+YZ' + X'Y'Z')
D. If every element in a group is its own inverse then Choose the correct answer from the options
the group must be abelian. This is true statement. given below.
So option (a) is correct. (a) A, B and C only (b) B, C, and D only
42. Consider the following statements: (c) A, C and D only (d) A, B and D only
A. The number of labelled binary trees Ans. (b) : The given Boolean expression
possible with 'n' nodes is (2n)!/(n+1)! F = (X + Y + Z) (X' +Y) (Y'+Z)
B. The number of binary search trees possible F' = [(X+Y+Z) (X' + Y)(Y'+Z)]'
with 'n' nodes is (2n)!/((n+1)!n!) using De Morgon's Law : (A+B)' = A'.B'
C. The number of unlabeled binary trees (A.B)' = A' + B'
possible with 'n' nodes is C(2n, n)!/(n+1)! F' = (X + Y + Z)' + (X' + Y)' + (Y' + Z)'
D. The number of simple, undirected and F' = X'Y'Z' + XY' + YZ'
labelled graphs possible with 'n' vertices is F' = Y' (X+X'Z') + YZ'
2n(n-1)/2 [using property : A+A'B = (A+B)]
Choose the correct answer from the options
given below. F' = XY' + Y'Z' + YZ' ⇒ F' = XY' + Z' (Y'+Y)
(a) A, B and C only correct F' = XY' + Z'
(b) A, B and D only correct F' = Z' + XY'
(c) B, C and D only correct F' = (Z' + X) (Z' + Y') [Using Distributive property
(d) A, C and D only correct A+BC = (A+B).(A+C)] So correct Answer is (b)
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 452 YCT
 Search on TG: @apna_pdf
45. Which of the following statement is/are True? Choose the most appropriate answer from the
A. The processor has direct access to both options given below :
primary and secondary memory. (a) A, C only (b) B, C only
B. Primary memory stores the active (c) B, D only (d) A, D only
instructions and data for the program Ans. (b) : The given statement
being executed on the process The HR department does not need a separate style sheet.
C. Secondary memory is used as a backup When multiples style sheets are applied to a webpage,
memory the rules defined in one style sheet can be overridden or
D. Memory system is implemented on a single modified by rule in another style sheet. This allows the
level memory HR department to have its own specific style sheet
Chose the correct answer from the options containing the differences from the corporate sheet.
given below : This rules in the HR style sheets will take precedence
(a) A and B only (b) B and C only over the corresponding rules in the corporate style
(c) A, B and C only (d) A and D only sheet, effectively customizing the appearance from that
Ans. (b) : The processor has direct access to both specific department while still maintaining the core
primary and secondary memory is not entirely accurate. corporate look and feel.
While the processor can directly access primary Therefore the correct statement is B and C.
memory (RAM), it typically does not have direct access So option (b) is correct.
to secondary memory. 49. Let Ti be a transaction that transfer Rs. 50
■ Memory system is implemented on a single level from account A to account B. This transaction
memory is incorrect memory systems are typically can be defined as follows :
implemented with multiple levels of memory Step Operation
hierarchy. 1 Read (A)
So correct Answer is option (b) 2 A := A–50
46. Inheritance provides the benefits of _______ 3 Write (A)
A. shared interfaces 4 Read (B)
B. run-time polymorphism
C. less redundant information 5 B:=B+50
D. dynamic binding 6 Write (B)
Choose the Correct answer from the options What will be the status of a database just after
given below : 3rd step but before 5th step of transaction
(a) A, B, C only (b) A, B, D only execution?
(c) B, C, D only (d) A, C, D only (a) Always consistent
Ans. (a) : Inheritance provides the benefits of (b) May be temporarily inconsistent
■ Shared interface (c) Must be abort
(d) Always rollback
■ Run time polymorphism
■ Less redundant information but dynamic binding Ans. (b)th: The status of a data base use after 3rd step but
achieved by polymorphism. before 5 step of transaction execution will be "May be
So correct Answer is (a) temporarily inconsistent."
To understand why, let's look at what happens during
47. Which of the following are correct using the the transaction execution :
constructor? 1. Step 1 : Read (A) - The transaction reads the value
A. string s1; of account A.
B. string s2 (s1); 2. Step 2. A : = A–50 - The transaction deducts Rs. 50
C. string s3{7}; from the value of A (let's say A was 100, So now A
D. string s4{'a'} becomes 50).
E. string s5{7, 'a'} 3. Step 3: Write (A) - The transaction writes the new
Choose the most appropriate answer from the value of A(50) back to the database. If another
options given below. transaction reads the value of A at this movement, it
(a) A, D, E only (b) A, B, C only will see the intermediate state of A(50), which may
(c) A, B, D only (d) A and B only not represent a consistent state of the database. This
Ans. (d) : Statement A and B is correct but C, D and E temporary inconsistency is resolved when the entire
is incorrect constructor does not use curly brackets. Ti transaction is completed (after executing step 6),
and the database return to consistent state.
So correct Answer is (d) So option (b) is correct.
48. Suppose that a corporate website appearance 50. Consider the relation
varies according to the department that owns
various documents. All the documents need to Student (stuid, dept, clsroll)
follow the corporate look and feel. The HR The following functional dependencies are
department does not need a separate style given :
sheet. It needs only the sheet containing the FD1 : stuid → dept
difference from the corporate sheet. FD2 : dept→ →stuid
Which of the following statements justify the FD3: stuid → clsroll
above scenario? FD4: clsroll → stuid
A. The styles sheets cannot stack on each other FD5: dept → clsroll
B. The style sheets can stack on each other. Which functional dependencies should be
C. The style sheets can override each other. removed to obtain the canonical cover of the
D. The style sheets cannot override each other. set?
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 453 YCT
 Search on TG: @apna_pdf
A. FD2 and FD3 B. FD1 and FD5 53. Select the correct order of basic page
C. FD5 D. FD1 replacement :
Choose the correct answer from the options A. page replacement algorithm is used in case
given below : there is no free frame.
(a) A, B only (b) A, C only B. The process is continued by restarting the
(c) B, C only (d) A, B, C only instruction caused by TRAP
Ans. (b) : The given relation C. Location of desired frame is found from
Student (Stuid, dept, clsroll) disk.
The following function dependencies are given D. Desired page is brought into newly freed
FD1 : Stuid → dept frame and page & frame tables are
updated
FD2 : dept → stuid (a) A, B, D, C (b) C, D, A, B
FD3 : stuid → clsroll
(c) C, A, D, B (d) A, D, B, C
FD4 : clsroll → stuid
FD5 : dept → clsroll Ans. (c) :
So stuid is primary key. It can not removed. C. Location of desired frame is found from disk
So option (b) is correct. A. Page replacement algorithm is used in case there is
no free frame.
51. Which of the following statements are true? D. Desired page is brought into newly freed frame and
A. If the time quantum is extremely small, page & frame tables are updated.
round robin can result in a large number B. The process is continued by restarting the
of context switches. instruction caused by TRAP
B. The average turnaround time of a set of So correct order of basic page replacement is
processes does not necessarily improve as
the time-quantum size increases. C, A, D, and B
C. The average turnaround time can be So option (c) is correct Answer.
improved if most processes finish their 54. Given below are two statements :
next CPU burst in a single time quantum. Statement I : Software testing must be
Choose the correct answer from the options recognized as a significant effort, and its
given below : planning must begin at the earliest possible
(a) A only (b) A, B only (c) B, C only (d) A, B, C time.
Ans. (d) : Statement II : The cost of software testing is an
A. If the time quantum is extremely small, round robin important contribution in determining overall
can result in a large number of context switches. software development costs. In the light of the
B. The average turnaround time of a set of processes above statements, choose the correct answer
does not necessarily improves the time - quantum from the options given below.
size increases. (a) Both Statement I and Statement II are true
C. The average turnaround time can be improved if (b) Both Statement I and Statement II are false.
most processes finish their next CPU burst in a (c) Statement I is true but Statement II is false.
single time quantum. (d) Statement I is false but Statement II is ture.
So All statement is true. Ans. (a) : Both statement are true.
52. Consider the following set of processes that Explanation :
need to be scheduled on a single CPU. All the 1. The first statement emphasizes that software testing
times are given in milliseconds. should be considered a significant effort and should
Using the shortest remaining time first be planed from the earliest stages of software
scheduling algorithm, the average process development. This is a valid point as early planning
turnaround (in milliseconds) is _______ for testing ensures that potential issues can be
(a) 7.2 (b) 8.2 (c) 6 (d) 9 identified and resolved early on, which can save
Ans. (a) : time and resources in the long run.
Process Name Arrival Time Execution time 2. The second statement states that cost of software
testing is a crucial factor in determining the overall
A 0 6 software development costs. This is also true
B 3 2 because testing involves various activities such as
C 5 4 designing test cases executing tests, debugging, and
D 7 6 fixing defects, all of which require resources and
effort.
E 10 3 In conclusion, both statement are valid and emphasize
CPU scheduled the importance of software testing in the software
development process.
55. Which of the following need not be assessed
during unit testing?
Average Turnaround Time : A. Algorithmic performance
(8 − 0) + (5 − 3) + (12 − 5) + (21 − 7) + (15 − 10) B. Number of lines of code.
=
5 C. Error handling.
8 + 2 + 7 + 14 + 5 36 D. Execution paths.
= = Choose the correct answer from the options
5 5 given below :
Average Turnaround Time = 7.2 (a) A, B, C only (b) A, B, D only
So option (a) is correct. (c) A, C, D only (d) B, C, D only
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 454 YCT
 Search on TG: @apna_pdf
Ans. (d) : The correct Answer is (d) B, C, D only (a) A, B, C only (b) B, D, E only
Let's go through each option to understand why. (c) A, D, E only (d) A, C, E only
A. Algorithmic performance : This is typically not Ans. (d) : Let's go through each option to explain why
assessed during unit testing. Unit testing is A. Hamiltonian problem is NP=complete : The
concerned with verifying the correctness of the Hamiltonian path problem is known to be NP-
unit's functionality, not its performance complete, which means that its is unlikely to have a
characteristics polynomial-time algorithm to solve it and it is at
B. Number of line of code : The number of line of code least as hard as any problem in the complexity class
is not relevant to unit testing. Unit tests are designed NP.
to check behavior of the unit's functionality, B. This statement is false. A Hamiltonian cycle (or
regardless of how many lines of code are used to path) in a graph with an old number of vertices is
implement it. not always guaranteed.
C. Error handling : Error handling is an essential C. This statement is true. The Hamiltonian path
aspect of unit testing. During unit testing, you want problem is NP-Complete for both directed and
ot ensure that the unit handles errors and exceptions undirected graphs. A directed a cyclic graph (DAG)
properly and produces the expected results in such is a spcial case where there cannot be any
scenarios. Hamiltonian path, as it would require visiting each
D. Execution paths : Unit testing aims to test aims to vertex exactly once without forming any cylces
test different execution path of the unit's code to which is not possible in a DAG.
ensure all possible scenarios are covered. It helps in D. This statement is false. The notation G3 typically
identifying and fixing bugs related to different path refers to the cube of a graph and it does not relate to
through the unit code. finding Hamiltonian path or cycles.
56. Which of the following rotations are correctly E. If any NP complete problem is polynomial time
explained in the context of an AVL tree. solvable the P = NP
A. LL rotation : The new node is insterted in This statement is true.
the left sub-tree of the left sub-tree of the Therefore, the correct statements are A, C and E.
critical node.
B. RR rotation : The new node is inserted in 58. For matrix multiplication, if we use divide and
the right sub-tree of the right sub-tree of conquer algorithm, then _____
the critical node. A. the running time is T(n) = Θ(n3)
C. LR rotation : The new node is inserted in B. the running time is T(n) = Θ(n2 log n)
the right sub-tree of the left sub-tree of the C. The recurrence can be defined as T(n) =
critical node. 8T(n/2) + Θ(n2)
D. RL rotation : The new node is inserted in D. the recurrence relation is T(n) = 8T(2n) +
the left sub-tree of the right sub-tree of the Θ(n2log n)
critical node E. Masters theorem, one of the cases is
Choose the correct answer from the options applicable
given below. Choose the most appropriate answer from the
(a) A, D only (b) A, C only options given below.
(c) A, B only (d) B, C only (a) A, C, E only (b) A, D, E only
Ans. (*) : An AVL tree defined as a self - balancing (c) B, D, E only (d) B, C, D only
Binary search Tree (BST). Where the difference Ans. (a) : Matrix multiplication, if we use decide and
between heights of left and right sub trees for any node conquer algorithm, them.
cannot be more than one.
Rotating the sub trees in an AVL tree. A. The running time is T(n) = θ(n2)
■ Left Rotation This statement is true.
■ Right Rotation B. The recurrence can be defined a
■ Left-Right Rotation T(n) = 8T(n/2) + θ(n2)
■ Right-left Rotation When using the decide and conquer algorithm for
UGC has drop this question. multiplication, the recurrence relation is typically of the
form.
57. In the context of a Hamiltonian problem which
of the following are correct? n
T(n) = aT   + f (n) , where "a" represents the number
A. Hamiltonian cycle problem is NP-complete. b
B. If G is an undirected Bipartite graph with of sub problems, "b" is the size of each sub problem,
an odd number of vertices, then G is and "f(n)" denote the time completely for combining the
Hamiltonian. sub problem solution.
C. Hamiltonian path problem cannot be This indicates that the running time of the algorithm is
solved in polynomial time on directed θ(n2) since each level of the recursion involves θ(n2)
acylic graph. work and there are log(n) level in total.
D. If G is a connected undirected graph with So option (a) is correct.
at least three vertices and G3 is the graph
obtained by connecting all pairs of vertices 59. Which of the following Finite Automata,
that are connected by a path in G of length recognizes the language L=(a, b)*?
at most 3. A. M =({q0}, (a,b},δ δ,q0{q0)}) where δ is
E. If any NP complete problem is polynomial a b
time solvable the P = NP. q0 {q0} {q0}
Choose the most appropriate answer from the B. M =({q0, q1}, {a,b}, δ, q0,{q0, q1}) where δ
options given below. is
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 455 YCT
 Search on TG: @apna_pdf
a b 61. Consider a computer network using the
q0 {q0,q1} {q0,q1} distance vector routing algorithm in its
q1 {q1} {q1} network layer. The objective is to find the
C. M =({q1, q1}, {a,b}, δ, q0,{q0, q1}) where δ shortest cost path from router R to routers P
is and Q. Assume that R does not initally know
the shrotest routes to P and Q. Assume that R
a b has three neighboring routers, namely; X, Y
q0 {q0, q1} {q0} and Z. During one iteration R measures its
q1 - {q1} distance as 3, 2 and 5, 7, 6 and 5 from router X,
D. M =({q0, q1,q2}, {a,b}, δ, q0,{q0}) where δ Y and Z to router P, respectively. The routing
is vector also indicates that the distance to router
a b Q from Routers X, Y and Z are 4, 6, 8
q0 {q0} {q0} respectvely. Which of the following statement
q1 {q2} - is/are True with respect to the new routing
q2 {q0} {q2} table at router R after updation during this
iteration.
(a) A and B (b) A and D
A. The distance from R to P will be stored as 10.
(c) A, B and C (d) A, B, C and D
B. The distance from R to Q will be stored as 7.
Ans. (d) : The given language C. The next hop router for a packet from R to
L = {a, b}* P is Y.
q0 = initial state, input = a, b, δ–Transition state {q0} D. The next hop router for a packet from R to
final state. Q is Z
Choose the correct answer from the option
given below.
(a) B and C only (b) A and C only
(c) C and D only (d) B and D only
Ans. (a) :

{q0, q1} {q0, q1}

{q0}

b
As per Distance Vector routing Algorithm, R to
So option (d) is correct P = min {R – X – P, R–Y–P, R–Z–P}
60. Which of the following statement(s) are correct? = {10, 8, 10} = 8
A. Syntax Directed Translation can be applied R to Q = min{R – X – Q, R – Y – Q, R – Z – Q}
in Type Checking. = min {7, 8, 13} = 7
B. Syntax Directed Translation can be used in Hence statements (B) and (C) are correct.
3-address code generation. So option (a) is correct.
C. Syntax Directed Translation can be used in 62. Consider the routing table of an organization's
construction of syntax tree. router as shown in the table given below
D. Syntax Directed Translation can be used to Subnet Number Subnet Mask Next Hop
recognize valid tokens. 12.20.164.0 255.255.252.0 R1
Choose the most appropriate answer from the 12.20.170.0 255.255.254.0 R2
options given below :
(a) A, B and C (b) A, B, C and D 12.20.168.00 255.255.254.0 Interface 0
(c) A, C and D (d) B, C and D 12.20.166.0 255.255.254.0 Interface 1
Ans. (a) : Statement A, B and C is correct but D is Default R3
false. Which of the following prefixes in CIDR
Syntax directed translation can be used to recognize Notation can be collectively used to correctly
valid token. aggregate all of the subnets in the routing
Correct - Syntax Directed Translation can be used to table?
define the translation rules for recognizing and A. 12.20.164.0/20 B. 12.20164.0/22
generating valid tokens during lexical analysis. C. 12.20.164.0/21 D. 12.20.168.0/22
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 456 YCT
 Search on TG: @apna_pdf
Choose the correct answer from the options B, D are false
given below : B is false as ID number changes on re-transmission.
(a) A and B only (b) A and C only D is false as at destination, reassembly of fragments is
(c) C and D only (d) B and D only done.
Ans. (d) : The given subnet number So
1. 12.20.164.0 = 12.20.10100100.0
2. 12.20.170.0= 12.20 10101010.0
3. 12.20.168.0 = 12.20.10101000.0
4. 12.20.166.0 = 12.20.10100110.0
1 and 4 first 6 bits are same.
So merging So option (d) is correct.
12.20.101001001/22 64. Consider the following features of Neural
12.20.164.0/22 networks.
So statement (B) is correct A. It is essentially a machine learning algorithm.
again 2 and 3 first 6 bits are same so merging. B. It is useful when solving problems for
12.20.10101000.0/22 which the data set is very large.
12.20.168.0/22 C. They are able to extract features without
So statement (D) is correct. input from the programmer.
Hence option (d) is correct. D. These are systems modeled on the human
63. Consider two hosts P and Q are connected brain and nervous system.
through a router R. The maximum transfer Choose the most appropriate answer from the
unit (MTU) value of the link between P and R options given below.
is 1500 bytes and between R and Q is 820 bytes. (a) A only (b) A & B only
A TCP segment of size of 1400 bytes is (c) A, B & C only (d) A, B, C & D
transferred from P to Q through R with IP Ans. (d) : Let's consider the features of neural networks
identification value of 0x12334. Assume that IP you mentioned :
header size is 20 bytes. Further the packet is A. Correct, Neural networks are indeed a machine
allowed to be fragmented that is Don't learning algorithm commonly used for various tasks
Fragment (DF) flag in the IP Header is not set like image recognition natural language processing
by P. and more.
Which of the following statement is/are not B. Correct, Neural networks can handle large datasets
true? effectively making them suitable for complex
A. Two fragments are created at R and IP problems with vast amounts of data.
datagram size carrying the second C. Correct, That's one of the key advantages of neural
fragment is 620 bytes. network-they can automatically learn and extract
B. If the second fragment is lost then R resend relevant features from the input data without
the fragment with IP Identification value explicit programming.
of 0x1234 D. Correct, Neural network are inspired by the
C. If the second fragment lost then P required structure and function of the human brain and
to resend the entire TCP segment. nervous system. They consist of interconnected
D. TCP destination port can be determined by artificial neurons that process and transmit
analyzing the second fragment only. information mimicking biological neural networks.
Choose the correct answer from the options So option (d) is correct.
given below. 65. Consider the following draw backs is/are of
(a) A and B only (b) A and C only Rule based approach is/are :
(c) C and D only (d) B and D only A. The learning is static.
Ans. (d) : B. Any changes made to the original data will
not be considered.
C. Once trained the model cannot improve on
the basis of feedback.
Choose the correct answer from the options
given below.
(a) All the above statements are correct
(b) The statements A & B only are not correct
(c) The statements B & C only are not correct
(d) All the above statements are not correct
Ans. (a) : The correct statement is A, B, and C the draw
pack of the Rule - based approach are
A. The learning is static
2. fragments B. Any changes made to the original data will not be
Now if 2nd fragment is lost, as it is TCP, (Connection considered.
oriented) So P will send again the whole data (1400) → C. Once trained the model cannot improve on the basis
within MTV of P → R link. of feedback.
Now its R who has the job of fragmentation, so R will These limitations highlight the inflexibility and lack of
send both packets again. adaptability of Rule- based system compared to other
A, C are true machine learning approaches.
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 457 YCT
 Search on TG: @apna_pdf
66. Match List I with List II Ans. (b) : The Correct is
List-I List-II A. 2-D Array Input III. Camera
A. Linear I. Prim's B. Transmissive I. Liquid Crystal display
Program Algorithm device
B. Predate Logic II. In order C. Binary image IV. Ink jet printer
C. Tree Traversal III. Simplex D. 1-D array input II. Flat-bed scanner
Algorithm So correct Answer is Option (b)
D. Minimum IV. First order logic 69. Match List I with List II
Spanning Tree
Problem List-I List-II
Choose the correct answer from the options A. Timestamp I. As long as the
given below : protocol transaction is already
(a) A-IV; B-III; C-I; D-II running, it will try to
(b) A-III; B-IV; C-II; D-I obtain the required
lock in the first part
(c) A-II; B-IV; C-I; D-III
(d) A-III; B-IV; C-I; D-II B. Strict two- II. Indicates final lock of
phase the schedule
Ans. (b) : The Correct is locking
A. Linear Program III. Simplex protocol
Algorithm C. Two-phase III. Ensures freedom from
B. Predate Logic IV. First order logic locking deadlock
C. Tree Traversal II. In order D. Lock point IV. Ensures cascade-less
D. Minimum Spanning I. Prim's Algorithm in two rollback
Tree Problem phase
So option (b) is correct. locking
protocol
67. Match List I with List II Choose the correct answer from the options
List-I List-II given below :
A. DDA I. Program Control (a) A-III; B-IV; C-II; D-I
instruction (b) A-III; B-IV; C-I; D-II
B. LXI II. Interrupt instruction (c) A-IV; B-III; C-II; D-I
C. RST III. Data Movement (d) A-IV; B-II; C-I; D-III
instruction Ans. (b) : The Correct is
D. JMP IV. Athematic instruction A. Timestamp III. Ensures freedom from
Choose the correct answer from the options protocol deadlock
given below : B. Strict two-phase IV. Ensures cascade-less
(a) A-IV; B-II; C-I; D-III locking protocol rollback
(b) A-IV; B-III; C-II; D-I C. Two-phase I. As long as the
(c) A-IV; B-II; C-III; D-I locking transaction is already
(d) A-III; B-IV; C-II; D-I running, it will try to
Ans. (b) : The Correct is obtain the required
lock in the first part
A. DDA IV. Athematic instruction
D. Lock point in II. Indicates final lock of
B. LXI III. Data Movement instruction two phase the schedule
C. RST II. Interrupt instruction locking protocol
D. JMP I. Program Control instruction So option (b) is correct.
So correct answer is option (b) 70. Match List I with List II
68. Match List I with List II List-I List-II
List-I List-II A. (reference I. Must write out before
A. 2-D Array I. Liquid Crystal bit=0, replacement
Input display modify
B. Transmissive II. Flat-bed scanner bit=0)
device B. (reference II. Probably will be used
C. Binary III. Camera bit=0, again soon and need to
image modify write out.
bit=1)
D. 1-D array IV. Ink jet printer
input C. (reference III. Best page to replace
bit=1,
Choose the correct answer from the options modify
given below : bit=0)
(a) A-I; B-III; C-II; D-IV
D. (reference IV. Probably will be used
(b) A-III; B-I; C-IV; D-II bit=1, again soon
(c) A-III; B-I; C-II; D-IV modify
(d) A-I; B-II; C-IV; D-III bit=1)
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 458 YCT
 Search on TG: @apna_pdf
Choose the correct answer from the options Ans. (c) : Correct Match are -
given below : A. 8-Queens IV. Backtracking
(a) A-II; B-I; C-III; D-IV problem
(b) A-II; B-I; C-IV; D-III
(c) A-III; B-I; C-II; D-IV B. Closest pair of I. Divide and conquer
Points
(d) A-III; B-I; C-IV; D-II
C. String Edit II. Dynamic Programming
Ans. (d) : The Correct is problem
A. (reference III. Best page to replace
bit=0, modify D. Knapsack III. Greedy Method
bit=0) problem
B. (reference I. Must write out before 73. Match List I with List II
bit=0, modify replacement List-I List-II
bit=1) A. Initial Configuration of I. $ w$
C. (reference IV. Probably will be used stack and input in LL
bit=1, modify again soon Parsing process.
bit=0) B. Final Configuration of II. $ $
D. (reference II. Probably will be used stack and input in LL
bit=1, modify again soon and need to Parsing process
bit=1) write out. C. Initial Configuration of III. $S w$
So option (d) is correct. stack and input in LR
71. Match List I with List II Parsing process.
List-I List-II D. Final Configuration of IV. $S $
A. Condition I. Black box testing stack and input in LR
coverage Parsing process
B. Equivalence II. System testing Choose the correct answer from the options
class given below :
partitioning. (a) A-III; B-IV; C-I; D-II
C. Volume III. White box testing (b) A-III; B-II; C-I; D-IV
testing (c) A-II; B-III; C-IV; D-I
D. Alpha IV. Performance testing (d) A-II; B-IV; C-I; D-III
testing Ans. (b) : Correct Match are -
Choose the correct answer from the options A. Initial Configuration of stack and III. $S, w$
given below : input in LL Parsing process.
(a) A-II; B-III; C-IV; D-I B. Final Configuration of stack and II. $, $
(b) A-III; B-I; C-IV; D-II input in LL Parsing process
(c) A-IV; B-I; C-II; D-III
(d) A-III; B-IV; C-I; D-II C. Initial Configuration of stack and I. $ w$
input in LR Parsing process.
Ans. (b) : The Correct is
D. Final Configuration of stack and IV. $S $
A. Condition III. White box testing input in LR Parsing process
coverage
B. Equivalence I. Black box testing 74. Match List I with List II
class List-I List-II
partitioning. A. Physical I. Transforming the raw
C. Volume testing IV. Performance testing layer bits in the form of
D. Alpha testing II. System testing frame for
transmission.
72. Match List I with List II
List-I List-II B. Data Link II. Control and
Layer monitoring of subnet.
A. 8-Queens I. Divide and conquer
problem C. Network III. Transmission of raw
Layer bits over
B. Closest II. Dynamic communication
pair of Programming channel
Points
C. String III. Greedy Method D. Transport IV. Datagrams
Edit layer Transmission data
problem through connection
oriented or connection
D. Knapsack IV. Backtracking less using datagrams.
problem
Choose the correct answer from the options
Choose the correct answer from the options given below :
given below :
(a) A-I; B-II; C-III; D-IV (a) A-III; B-II; C-I; D-IV
(b) A-I; B-IV; C-II; D-III (b) A-II; B-III; C-I; D-IV
(c) A-IV; B-I; C-II; D-III (c) A-III; B-I; C-II; D-IV
(d) A-II; B-III; C-IV; D-I (d) A-II; B-IV; C-I; D-III
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 459 YCT
 Search on TG: @apna_pdf
Ans. (c) : The Correct is 78. Arrange the following search and sort
A. Physical III. Transmission of raw bits algorithms in ascending order of their worst-
layer over communication channel case complexities.
A. Merge sort B. Linear Search
B. Data Link I. Transforming the raw bits in
C. Bubble Sort D. Binary Search
Layer the form of frame for
transmission. Choose the correct answer from the options
given below :
C. Network II. Control and monitoring of (a) A, B, D, C (b) B, D, A , C
Layer subnet.
(c) B, D, C, A (d) B, A, D, C
D. Transport IV. Datagrams Transmission data
layer through connection oriented Ans. (b) : Here are the search and sort algorithms
or connection less using arranged in ascending order of their worst-case
datagrams. complexities.
B. Linear search - worst-cost complexity : O(n)
75. Match List I with List II D. Binary search - worst - case complexity : O(log n)
List-I List-II A. Merge sort - worst - case complexity : O (log n)
A. Regression I. Unsupervised C. Bubble sort - worst - case complexity : O (n2)
Learning So option (b) is correct.
B. KNN II. Supervised Learning 79. Consider the following schedule S.
C. Clustering III. T1 T2 T3 T4 Timestamp
D. Decision IV. R(X) R(Y) t1
Tree
W(X) W(Y) t2
Choose the correct answer from the options
given below : R(Y) R(X) t3
(a) A-I; B-II; C-I; D-II W(Y) W(X) t4
(b) A-II; B-II; C-I; D-II R(X) t5
(c) A-I; B-II; C-II; D-I W(X) t6
(d) A-II; B-II; C-II; D-I R(X) denotes read operation on data item X by
Ans. (b) : The Correct is transaction Ti.
A. Regression II. Supervised Learning W(X) denotes write operation on data item X
B. KNN II. Supervised Learning by transaction Ti.
Choose the correct execution order for the
C. Clustering I. Unsupervised Learning above schedule S.
D. Decision Tree II. Supervised Learning (a) T3-T2-T1-T4 (b) T2-T3-T1-T4
So option (b) is correct. (c) T2-T4-T3-T1 (d) T4-T2-T3-T1
76. Let G be a simple undirected graph with n(n>0) Ans. (c) : The given schedule S.
vertices and 'k' connected components. What is T1 T2 T3 T4 Timestamp
the minimum possible number of edges of 'G'?
(a) k(n–1) (b) n(k–1) R(X) R(Y) t1
(c) n+k–2 (d) n–k W(X) W(Y) t2
Ans. (d) : The minimum possible number of edges in a R(Y) R(X) t3
simple undirected graph G with n vertices and 'k' W(Y) W(X) t4
connected components is n-k. R(X) t5
So correct Answer is option (d) W(X) t6
77. The sequence of events that happen during a R(X) denotes read operation on data item X by
typical fetch operation is/are : transaction Ti
A. Memory B. MBR C. MAR W(X) denotes write operation on data item X by
D. PC E. IR transaction Ti
Choose the correct order from the options
given below :
(a) A, B, C, D, E (b) D, C, A, B, E
(c) E, D, C, B, A (d) D, C, A, E, B
Ans. (b) : During a typical fetch operation the sequence
of events is a follows.
■ The program counter (PC) holds the address of the
next instruction to fetched. So T2 should be start
■ The Memory address resister (MAR) receives the T1 should be end
address from the PC, indicating the location of the T2 – T4 – T3 – T1
in memory. So option (c) is correct.
■ The memory unit retrieves the instruction from the 80. A disk has 300 cylinders (0 to 299). If the initial
memory location specified by the MAR. position of the read-write head is at cylinder
■ The fetched instruction is stored in the memory 101, moving towards the higher end of the disk
Buffer register. calculate the total head movement following
■ The fetched instruction is also loaded into the C_LOOK policy for the read request sequence.
instruction register (IR) allowing the processor to 123, 45, 197, 87, 250, 198, 280
decode and execute the instruction. (a) 456 (b) 450
So option (b) is correct. (c) 458 (d) 455
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 460 YCT
 Search on TG: @apna_pdf
Ans. (a) : Ans. (c) : The precedence of regular expression
operators from lowest to highest precedence is -
Star is highest then concatenation and union is lowest
precedence.
So option (c) is correct.
84. Arrange the following in the correct order
which respect to key generation for RSA
algorithm.
A. Choose an integer e such that 1 < e < λ(n)
B. Compute Key length n = p*q
The total head movement the read request sequence. C. Find d which is equal to 1/e
(280-101) + (280-45) + (87-45) = 456 E. Compute λ(n)
So correct Answer is option (a). Choose the correct answer from the options
81. The incremental model of software given below :
development is ______ (a) A-B-C-D-E (b) D-C-B-E-A
(a) A reasonable approach when requirements are (c) D-B-E-A-C (d) A-B-D-E-C
well defined. Ans. (c) : Here is the correct order for key generation in
(b) A good approach when a working core the RSA algorithm :
product is required quickly.
■ Choose two large prime numbers P and Q.
(c) The best approach to use for project with
large developments teams. ■ Compute the key length n = p*q.
(d) A revolutioary model that is not used for ■ Compute λ(n) (also know as the carmichael's totient
commerical products. function for RSA) which is the least common
multiple of p–1 and q–1.
Ans. (b) : The incremental model of software
development is a good approach when a working core ■ Choose an integer e such that 1 < e < λ(n) and e is
product is required quickly. coprime with λ(n)
82. Consider the graph given below. What is the ■ Find the value of d, which is the multiplication
order in which the nodes mentioned in the inverse of e module λ(n). This means finding d such
options are to be traversed to find the shortest that (*e)%λ(n) = 1
path from A to Z using best first search? After following these steps you will have the public key
(e, n) and the private key (d, n) for the RSA algorithm.
85. Which of the following is related to function of
layers in a neural network?
A. Information - Input layer - Hidden layer
B. Blas - Output layer - hidden layer.
C. Hidden Layer - alogrithm - Output layer
D. Input layer - output layer - algorithms
Choose the correct answer from the options
given below.
A. Node-A B. Node-B (a) Only sequence 'A' is correct.
C. Node-C D. Node-D (b) Only sequence 'B' is correct
E. Node-E F. Node-F (c) Only sequence 'C' is correct
Choose the correct answer from the options (d) Only sequence 'D' is correct
given below Ans. (c) : The correct option related to the function of
(a) A→C→F→D→E (b) A→C→E→B layers in a neural network is
(c) A→C→F→E→B (d) A→C→D→F C. Hidden - Algorithm - Output layer
Ans. (a) : The given graph 86. Given below are the two statements:
Statement I : The main objective for using
virtual memory is to increase the effective
capacity of the memory system.
Statement II : The size of virtual memory can
be larger than the main memory.
In the light of the above statements, choose the
correct answer from the options given below.
(a) Both Statement I and Statement II are true.
(b) Both Statement I and Statement II are false
By given option (c) Statement I is true but Statement II is false
A→C→F→D→E (d) Statement I is false but Statement II is true.
So option (a) is correct. Ans. (a) : The given statement.
83. The precedence of regular expression operators Statement I : The main objective for using virtual
from lowest to highest precedence is : memory is to increase the effective capacity of the
(a) Star, Concatenation, Union memory system. This statement is true.
(b) Union, Star, Concatenation Statement II : The size of virtual memory can be larger
(c) Union, Concatenation, Star than main memory. It is also true.
(d) Star, Union, Concatenation So option (a) is correct.
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 461 YCT
 Search on TG: @apna_pdf
87. Given below are the two statements : Ans. (d) : Both statement (A) and (B) are correct.
Statement I : Any retireval request that is A. For every regular language, we can design a Turing
specified in the basic relational algebra can also Machine. Regular language are equivalent in power
be specified in relational calculus. to the languages that can be recognized by a Turing
Statement II : Any retrieval request that is Machine, So there exists a Turing Machine for
specified in the relational calculus can also be every regular language.
specified in basic relational algebra. B. For every context free language, we can design a
In the light of the above statements, choose the Turing Machine. Similarly, context free language
correct answer from the options given below. are also Turing -recognizable meaning there exists a
(a) Both Statement I and Statement II are true. Turing Machine that can recognize every context-
(b) Both Statement I and Statement II are false free language.
(c) Statement I is true but Statement II is false 90. Given below are two statements one is labelled
(d) Statement I is false but Statement II is true. as Assertion A and the other is labelled as
Ans. (a) : The given statement Reason R
Statement I : Any retrieval request that is specified in A. Artificial Neural Networks are the
the basic relational algebra can also be specified in backbone of deep learning algorithms.
relational calculus. This is true. R. Back propagation is one of the techniques
Statement -II : Any retrieval request that is specified in used to train an ANN.
the relational calculus an also be specified in basic In the light of the above statements, choose the
relational algebra. most appropriate answer from the options
This statement is true. given below :
So option (a) is correct. (a) Both A and R are correct and R is correct
explanation of A.
88. The primary objectives of the SWE-IPT are to : (b) Both A and R are correct but R is NOT the
A. Solicit stake holder needs and expectations. correct explanation of A
B. Specify the software requirements for the (c) A is correct but R is not correct
product and post-development processes. (d) A is not correct but R is correct
C. Generate the integrated technical plans for
accomplishing the software development Ans. (b) : The most appropriate answer is Both A and R
effort. are correct but R is Not the correct explanation of A.
D. Translate stakeholder requirements into a Explanation
complete, specified architectural description. Artificial Neural network are the backbone of deep
E. Ensure that the software technical data learning algorithms.
package is sufficiently detailed to facilitate Back propagation or backward propagation of error is
an efficient and effective software an algorithm that is designed to test for errors working
implementation. back from output nodes to input nodes. It is an
Choose the correct answer from the options important mathematical tool for improving the accuracy
given below : of predications in data mining and machine learning.
(a) All the statements are correct Essentially, back propagation is an algorithm used to
calculate derivation quickly.
(b) Only B & C are correct
So option (b) is correct.
(c) Only A & E are correct
(d) Only C, D & E are correct Use the following schema of the academic institution
relational database :
Ans. (a) : You are taking about the software Student (rollno, name, degree, year, sex, deptno,
Engineering Integrated Product Team (SWE - IPT) advisor)
objectives.
department (deptid, name, hod, phone)
The primary objectives of the SWE - IPT are as follows:
professor (empid, name, sex, startyear, deptno.
1. Solicit stakeholder needs and expectations. phone)
2. Specify the software requirements for the product course (courseid, cname, creidts, deptno)
and post-development processes.
enrollment (rollno, courseid, sem, year, grade)
3. Generate the integrated technical plans for
accomplishing the software development effort. teaching (empid, courseid, sem, year, classroom)
4. Translate stakeholder requirements into a complete, prerequisite (precourseid, courseid)
specified architectural description. deptno is foreign key in the student, professor and
5. Ensure that the software technical data package is course relations referring to deptid of department
sufficiently detailed to facilitate an efficient and relation;
effective software development process. advisor is a foreign key in the student relation
So option (a) is correct. referring to empid of professor relation;
hod is a foreign key in the department relation
89. Consider the following statements: referring to empid of professor relation;
A. For every regular language, we can design rollno is a foreign key in the enrollment relation
Turing Machine. referring to rollno of student relation;
B. For every context free language, we can coursied is a foriegn key in the enrollment, teaching
design Turing Machine. relations referring to courseid of course relation;
Which of the following is correct? empid is a foreign key of the teaching relation
(a) Statement-A is false and Statement-B is true. referring to empid of professor relation;
(b) Statement-A and Statement-B both are false. precouseid and courseid are foreign keys in the
(c) Statement-A is true and Statement-B is false presquisite relation referring to courseid of the course
(d) Statement-A and Statement-B both are true relation; (91-95).
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 462 YCT
 Search on TG: @apna_pdf
91. Which of the following queries would retrieve Ans. (a) : The correct query to compute for each
the roll number and names of students who department, the total credits of all the courses offered by
have enrolled for all the prerequisite course of the department -
the course number 324? Select deptid, name, sum(credits) as totalcredits from
(a) Select s.rollno, s.name From student s, department, course where deptid = deptno.
enrollment e Where e.rollno = s.rollno and
e.courseid = ANY(select precouseied from 94. Which of the following queries would retrieve
prerequisite p where p.courseid = "324") the dept id and name of the all departments
(b) Select s.rollno, s.name From student s, that are such that the total of the credits of all
enrollment e Where e.rollno = s.rollno and the offered courses by the department is
e.courseid = ALL(select precouseied from strictly greater than 40?
prerequisite p where p.courseid = "324") (a) Select deptid, name, sum(credits) as
(c) Select s.rollno, s.name From student s Where totalcredits from department, course where
NOT EXISTS (select * prerequisite p where totalcredits > 40
p.courseid = "324") and NOT EXISTS (select group by deptid, name having deptid =
* from enrollment e where e.courseid = deptno.
p.precoursied and e.rollno = s.rollno.) (b) Select deptid, name, sum(credits) as
(d) Select s.rollno, s.name From student s Where totalcredits from department, course where
EXISTS (select * prerequisite p where deptid = deptno and totalcredits > 40
p.courseid = "324") and EXISTS (select * group by deptid, name
from enrollment e where e.courseid = (c) Select deptid, name, sum(credits) as
p.precoursied and e.rollno = s.rollno.) totalcredits from department, course
Ans. (c) : The correct query to retrieve the roll number group by deptid, name having deptid = deptno
and name of students who have enrolled for all the and totalcredits > 40;
prerequisite courses of the course number 324. (d) Select deptid, name, sum(credits) as
C. Select s.rollno, s.name from student s Where NOT totalcredits from department, course where
EXISTS (select * prerequisite p where p.courseid = deptid = deptno
"324") and NOT EXISTS (select * from enrollment group by deptid, name having totalcredits >
e where e.courseid = p.precoursied and e.rollno = 40
s.rollno.)
Ans. (d) : The correct queries to retrieve the dept id and
92. Given query : select s.rollno from students name of the all departments that are such that the total
where s.sex = ALL (select f.sex from professor f of the credits of all the offered courses by the
where f.empid = s.advisor) department is strictly greater than 40.
Consider the following statements about the Select deptid, name, sum(credits) as totalcredits from
given query that retrieves the set of all students department, course where deptid = deptno group by
whose gender is same as the gender of their deptid, name having totalcredits > 40
advisor:
S1. It has a correlated subquery 95. Given query :
S2. It has an uncorrelated subquery select s.rollno, s.name from student s where
S3. If we replace ALL by ANY in the above EXISTS (select c.courseid from course c Where
query, its result will be different. c.deptno = 5 and EXISTS (select e.* from
enrollment e where e.courseid = c.courseid and
S4. If we replace ALL by ANY in the above e.rollno = s.rollno)));
query, its result will be same.
Identify all the statement that are TRUE : Which one of the following statement is correct
with respect to the given query?
(a) S1 and S3 are true (b) S1 and S4 are true (a) It retrieves the roll number and names of
(c) S2 and S3 are true (d) S2 and S4 are true students who have not enrolled for all course
Ans. (b) : The correct query to retrieves the set of all offered by department number 5.
students whose gender is same as the gender of their (b) It retrieves the roll number and names of
advisor : students who have enrolled for all course
S1. It has a correlated subquery offered by department number 5.
S4. If we replace ALL by ANY in the above query, its (c) It retrieves the roll number and names of
result will be same. students who have enrolled for at least one
So option (b) is correct. course offered by department number 5.
93. Which of the following queries would compute, (d) It retrieves the roll number and names of
for each department, the total credits of all the students who are such that there exists at least
courses offered by the department? one course offered by department number 5
(a) select deptid, name, sum(credits) as which is not enrolled by the student.
totalcredits from department, course where Ans. (c) : Given query :
deptid = deptno group by deptid, name; select s.rollno, s.name From student
(b) select depid, name, count(credits) as Where EXISTS (select c.courseid from course c Where
totalcredits from department, course where
deptid=deptno group by deptid, name; c.deptno = 5 and EXISTS (select e.* from enrollment e
where e.courseid = c.courseid and e.rollno = s.rollno));
(c) select deptid, name, sum(credits) as
totalcredits from department, course The following statement is correct with respect to the
where deptid = deptno given query.
(d) select depid, name, sum(credits) as total ■ It retrievs the roll number and name of student who
credits from department, course group by have enrolled for at lest one course offered by
deptid, name having deptid = deptno; department number 5.
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 463 YCT
 Search on TG: @apna_pdf
96. For a knapsack problem, P and W are profits Ans. (c) : A knapsack problem P and W are profits and
and weights for a set of 7 items as given below: weights for a set of 7 item as given below.
P = {9, 5, 2, 7, 6, 16, 9} P = {9, 5, 2, 7, 6, 16, 9}
W = {2, 5, 6, 11, 1, 9, 3} W = {2, 5, 6, 11, 1, 9, 3}
Find the optimal solution for fractional new item (P=5, W=2) is added.
knapsack problem when its maximum capacity We can use the greedy algorithm first calculate the
is 15. profit to weight ratio for each item.
(a) 43 (b) 40 Profit(P)
Ratio =
(c) 45 (d) 44 Weight(W)
Ans. (b) : To solve the fractional knapsack problem, We know that
you can use the greedy algorithm First, calculate the Best-case time of fractional knapsack = n logn
profit to weight ratio for each item. n is number of item
Profit(P) So total number of item = 8
Ratio = Best-case time of fractional knapsack
Weight(W)
= 8 log8
Then, sort the items in descending order based on their = 8 log23
ratio. Now, you can start adding items to the knapsack = 8 ×3
one by one until the knapsack's weight reaches its = O(24)
maximum capacity of 15 let's calculate the ratios.
So option (c) is correct.
P
= {4.5, 1, 0.33, 0.63, 6, 1.77, 3} 99. For a knapsack problem, P and W are profits
W and weights for a set of 7 items as given below:
P = 6+ 9 + 9 +16 = 40 P = {9, 5, 2, 7, 6, 16, 9}
W = 1 + 2 + 3 + 9 = 15 kg W = {2, 5, 6, 11, 1, 9, 3}
So option (b) is correct. The most efficient solution for the fractional
97. For a knapsack problem, P and W are profits knapsack problem with maximum capacity 15
and weights for a set of 7 items as given below: can be obtained by using ______
(a) Divide and Conquer
P = {9, 5, 2, 7, 6, 16, 9} (b) Dynamic Programming
W = {2, 5, 6, 11, 1, 9, 3} (c) Greedy Algorithm
What is the maximum value of items you can (d) Backtracking
carry if maximum weight allowed is 25 with a
fractional knapsack? Ans. (c) : A knapsack problem, P and W are profits and
weights for a set of 7 items as given below:
(a) 48.1 (b) 79 P = {9, 5, 2, 7, 6, 16, 9}
(c) 47.9 (d) 40 W = {2, 5, 6, 11, 1, 9, 3}
Ans. (a) : Given a knapsack problem, P and W are The most efficient solution for the fractional knapsack
profits and weights for a set of 7 items as problem with maximum capacity 15 can be obtained by
P = {9, 5, 2, 7, 6, 16, 9} using Greedy Algorithm.
W = {2, 5, 6, 11, 1, 9, 3} So option (c) is correct.
We can use the greedy algorithm first, calculate the 100. For a knapsack problem, P and W are profits
profit - to weight ratio for each item and weights for a set of 7 items as given below:
Profit(P) P = {9, 5, 2, 7, 6, 16, 9}
Ratio = W = {2, 5, 6, 11, 1, 9, 3}
Weight(W) Which of the following statements is correct for
P a knapsack?
= {4.5,1,0.33,0.63,6,1.77,3} (a) 0/1 knapsack can be applied for all kinds of
W
Then sort the items in descending order on their ratio. problems but fractional knapsack can be
applied only if the problem meets certain
W = 1 + 2 + 3 + 9 + 5 + 5 = 25 kg conditions.
5 (b) There is no difference between the two. They
P = 6 + 9 + 9 + 16 + 5 + × 7 give the same solution for any problem.
11
= 45 + 3.1 (c) We use greedy algorithm for 0/1 knapsack
and dynamic programming for fractional
P = 48.1 knapsack.
So option (a) is correct (d) In 0/1 knapsack problem, items cannot be
98. For a knapsack problem, P and W are profits divided into smaller portions and in fractional
and weights for a set of 7 items as given below: knapsack we can divide the item into required
P = {9, 5, 2, 7, 6, 16, 9} proportions of weight.
W = {2, 5, 6, 11, 1, 9, 3} Ans. (d) :
If new item (P=5, W=2) is added to the list, In 0/1 knapsack problem is Dynamic Programming.
total items is 8 and capacity is 25, then the best- ■ Fractional knapsack problem is Greedy Algorithm.
case time of fractional knapsack for this case is So correct statement is
_____ In 0/1 knapsack problem, items cannot be divided into
(a) O(8) (b) O(64) smaller portions and in fractional knapsack we can
(c) O(24) (d) O(56) divide the item into required proportions of weight.
UGC NTA NET JRF Comp. Science Dec. 2022 (Ex. 15.03.2023) 464 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. June 2023

COMPUTER SCIENCE
(Solved with Explanation) (Exam : 17.06.2023)
1. Given below are two statements: one is labelled (B) The BUILD- MAX-HEAP procedure, which runs in
as Assertion A and the other is labelled as linear time, produces a max-heap from an unordered
Reason R. input array. So, the statement (B) is incorrect.
Assertion A : Validity checks real need of (C) The MAX-HEAP-INSERT, HEAP-EXTRACT-
system users MAX, HEAP-INCREASE - KEY, and HEAP-
Reason R : Completeness checks system MAXIMUM procedures, which run in O(lgn) time,
defined requirements. allow the heap data structure to be used as a priority
In the light of the above statements, choose the queue. So, the statement (C) is correct and statement
correct answer from the options given below: (D) is incorrect.
(a) Both A and R are true and R is the correct
3. Consider universe positive integer
explanation of A
X = {1 ≤ n ≤ 8} , proposition P = "n is an even
(b) Both A and R are true but R is NOT the
correct explanation of A integers", Q = " ( 3 ≤ n ≤ 7 ) ^ ( n ≠ 6 ) " .Then
(c) A is true but R is false truth set of P ↔ Q is
(d) A is false but R is true
(a) {1, 4} (b) {2, 6}
Ans. (b) : Validity checks are essential to ensure that (c) {3, 4, 5} (d) {1}
the system meets the real needs and requirements of the
Ans. (a) : Given that,
system users. Completeness checks are indeed about
verifying that the system user-defined requirements are X = {1 ≤ n ≤ 8}
fully captured, but this doesn't directly explain the Propositions-
concept of validity checks. So, Assertion A and reason
P = 'n is an even integer' for n in the set X.
R both are correct but Reason R is not the correct
explanation of Assertion A. Q = {3 ≤ n ≤ 7} ^ ( n ≠ 6 ) for n in the set x.
2. Consider the following statements about hea Now, evaluate each proposition.
sort algorithm : P = The even integers in the set X are {2, 4, 6, 8}.
(A) The MAX-HEAPIFY procedure which Q = The integers satisfying 3 ≤ n ≤ 7 and n ≠ 6 are
runs in O lg(n) time, is the key to
{3, 4,5, 7} .
maintaining the max heap property.
(B) The BUILD-MAX-HEAP Procedure, For the bidirectional implication P ↔ Q, it means both
which runs in O lg(n) time. Produces max- proposition have the same truth values for all elements
heap from an unordered input array. in the set X.
(C) The MAX-HEAP-HEAP-INSERT, which P ↔ Q is true for n = 4, as both propositions are true for
runs in O (lg n) time, implements the these values.
insertion operation. P ↔ Q is false for n = 2, 3, 5, 6, 7, 8 as at least one of
(D) The HEAP-INCREASE-KEY procedure the propositions is false for each of these values.
runs in O (nlg n) time, to set the key of new So, , the truth set of P ↔ Q is {1, 4}.
node of its correct value.
4. Let (Z, +) denote the group of all integers
Choose the correct answer from the options
given below : under addition. Then the number of all
(a) A, B only (b) A, C only automorphisms of (Z, +) is
(c) B, D only (d) A, B, C, D (a) 1 (b) 2
(c) 3 (d) 4
Ans. (b) : Analyze the statements :
(A) The MAX-HEAPIFY procedure, which runs in Ans. (b) : The number of automorphisms of the group
O(lgn) time, is the key to maintaining the max-heap of integers under addition is 2. One is identity
property. So, the statement (A) is correct. automorphism and other is the negation automorphism.

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 465 YCT
 Search on TG: @apna_pdf
5. Match List I with List II 7. ______ is intended to show that a system both
LIST I LIST II conforms to its specifications and meets the
A. PERT I. used for non expectation of the system customer.
repetitive jobs (a) Software specification
B. Optimistic II. used for (b) Software design
time repetitive jobs (c) Software evaluation
C. CPM III. The shortest (d) Software validation
possible time to Ans. (d) : Software validation is the process of ensuring
complete the that a software system meets the requirement and
activity if all specifications of its intended users or stakeholders. It
goes well involves evaluating the software at the end of the
D. Pessimistic IV. The longest time development process to determine whether it satisfies
time that an activity the specified requirements and functions correctly in its
takes intended environment. validation ensures that software
Choose the correct answer from the option fulfills its intended purpose and delivers value to the
given below : users.
(a) A-III B-IV C-II D-I (b) A-IV B-I C-II D-III
8. A TCP server application is programmed to
(c) A-IV B-III C-II D-I (d) A-I B-III C-II D-IV
listen on port P on host S. A TCP client is
Ans. (d) Correct match- connected to the TCP server over the network.
LIST I LIST II Consider that while TCP connection is active
A. PERT I. used for non repetitive the server is crashed and rebooted. Assume
jobs that the client does not use TCP keepalive
B. Optimistic time III. The shortest possible timer.
time to complete the Which of the following behavior is are
activity if all goes well possible?
C. CPM II. used for repetitive jobs Statement I : The TCP application server on S
D. Pessimistic time IV. The longest time that can listen on P after reboot.
an activity takes Statement II : If client sends a packet after the
6. Which of the following is used to determine the server reboot, it will receive the RST segment.
cost performance index? In the light of the above statements, choose the
(a) Budgeted cost of work performed – budget at correct answer from the options given below.
completion (a) Both statement I and Statement II are true
(b) Budgeted cost of work performed ÷ budget at (b) Both Statement I and Statement II are false
completion (c) Statement I is true but Statement II is false
(c) Budgeted cost of work performed ÷ Actual (d) Statement I is false but Statement II is true
cost of work performed
(d) Budgeted cost of work performed – Actual Ans. (a) : The TCP application server on S can listen on
cost of work performed P after reboot. when a server crashes and reboots, it
loses its existing connections but can start listening on
Ans. (c) : The cost performance index (CPI) is a
the same port again once its back online. If client sends
method for calculating the cost efficiency and financial
effectiveness of a specific project through the following a packet offer the server reboot. it will receive the RST
formula. segment. When the server reboots., its TCP stack might
send a RST segment to any incoming packets from the
Budgeted cost of work performed
CPI = client, indicating that connection is no longer valid. So,
Actual cost of work performed the both statement I and II are true.
Or 9. Given below statements: one is labelled as
Earned value (EV) Assertion A and the other is labelled as Reason
CPI =
Actual cost (AC) R.
A CPI ratio with a value higher than 1 indicates that a Assertion A : I/O protection is ensured by a
project is performing well budget-wise. A CPI value of hardware trap
1 indicates that a project is performing or budget. A CPI Reason R : I/O interrupt caused by the
value that is less than 1 indicates that a project is over condition like I/O completion and device
budget. malfunction occurring within the I/O devices
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 466 YCT
 Search on TG: @apna_pdf
In the light of the above statements, choose the C. Sweep III. Bias and tension
correct answer from the options given below. representations
(a) Both A and R are true and R is the correct D. Natural objects IV.
painting
explanation of A drawing CAD
(b) Both A and R are true but R is NOT the Choose the correct answer from the options
correct explanation of A given below.
(c) A is true but R is false (a) A-IV B-I C-III D-II
(d) A is false but R is true (b) A-II B-III C-IV D-I
Ans. (d) : Assertion A is false because I/O protection is (c) A-IV B-III C-I D-II
typically ensured by operating system mechanisms such (d) A-II B-IV C-I D-III
as memory protection and privilege levels, rather than
Ans. (c) : Correct match-
hardware traps.
Reason R is true. I/O interrupts can indeed occur due to LIST-I LIST-II
conditions like I/O completion and device malfunction, A. Bezier curves IV. painting drawing CAD
but they are handled by the operating system rather than B. B-Splines III. Bias and tension
being directly related to hardware traps. C. Sweep I. 3 dim objects that have
10. Match List I with List II representations translation rotational
LIST-I LIST-II symmetry
A. Parallel FFT I. θ (n2 ) D. Natural objects II. Fractal geometry
12. Given below are two statements:
B. Iterative FFT II. θ (n) Let f(n) and g (n) be asymptotically positive
C. Evaluation of III. θ ( lg n ) functions. The following conjectures are given
polynomial at n points Statement I:
by Horner method f ( n ) ≥ 1 and f ( n ) = O ( g ( n ) ) ⇒ g ( n ) = Ω ( f ( n ) )
D. Product of two IV. θ ( nlg n ) Statement II:
polynomials that are
represented in point (
f ( n ) = O ( g ( n ) ) ⇒ lg ( f ( n ) ) = O lg ( g ( n ) ) )
value form ( )
where lg ( g ( n ) ) ≥ 1 for all sufficient large n.
Choose the correct answer from the options
given below. In the light of the above statements, choose the
most appropriate answer from the option given
(a) A-III B-I C-II D-III (b) A-II B-I C-III D-IV
below.
(c) A-III B-IV C-I D-II (d) A-II B-III C-IV D-I
(a) Both Statement I and Statement II are correct
Ans. (c) : Correct match- (b) Both Statement I and Statement II are
LIST-I LIST-II incorrect
A. Parallel FFT III. ө ( lgn ) (c) Statement I is correct but Statement II is
incorrect
B. Iterative FFT IV. ө ( nlgn ) (d) Statement I is incorrect but Statement II is
C. Evaluation of polynomial at I. ө (n2 ) correct
n points by Horner method Ans. (a) : Let f(n) and g (n) be asymptotically positive
D. Product of two polynomials II. ө (n) functions.
that are represented in point Statement I:
value form f ( n ) ≥ 1 and f ( n ) = O ( g ( n ) ) ⇒ g ( n ) = Ω ( f ( n ) ) is
11. Match List I with List II correct. If f ( n ) ≥ 1 and f ( n ) is upper-bounded by g(n),
LIST-I LIST-II
f(n) = O(g(n)), then g(n) should be lower - bounded by
A. Bezier curves I. 3 dim objects f (n), g (n) = Ω (f(n)).
that have
Statement II: f(n) = O(g(n)) ⇒ lg (f(n) = O(lg(g(n)) is
translation
correct. If f(n) = O (g(n)), then function lg (f(n)), which
rotational
is presumably larger or equal to 1 for all sufficiently
symmetry
large n, would be bound by O (lglg(n)). This seems
B. B-Splines II. Fractal to depend on the specific nature of the functions f(n)
geometry and g (n).
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 467 YCT
 Search on TG: @apna_pdf
13. Consider the following statements : C. Component III. No new bugs after
S1: LRU page replacement algorithm suffers testing changes in
from the belady's anomaly program
S2: Shortest remaining time first scheduling D. Beta testing IV. The documentation
may cause starvations of a use case
S3: Stack is shared by all threads in a process Choose the correct answer from the options
(a) S1, S2 and S3 are true given below.
(b) S1, S3 false and S2 is true (a) A-IV B-III C-II D-I (b) A-II B-I C-III D-IV
(c) S1, S2 are false and S3 is true (c) A-IV B-III C-I D-II (d) A-III B-I C-IV D-II
(d) S1, S2 and S3 are false Ans. (c) : Correct match-
Ans. (b) : Belady's anomaly actually occurs when LIST-I LIST-II
increasing the number of frames in memory does not A. Scenario IV. The documentation of a
reduce the number of page faults for certain page testing use case
replacement algorithms, such as FIFO (first In, First
B. Regression III. No new bugs after
out). LRU is immune to belady's anomaly because it
testing changes in program
always evicts the least recently used page, regardless of
the number of frames available. C. Component I. To verify the I/O
Shortest Remaining time first (SRTF) scheduling can testing behavior of text object
lead to starvation. Since SRTF always selects the D. Beta testing II. User acceptance
process with the shortest remaining time to execute methodology
next, longer processes may continually get preempted 16. A. If some NP-complete problem P is in P that
by shorted ones, potentially causing them to starve, i.e P = NP
not getting enough CPU time to progress. B. TSP is in NP
In most operating systems, threads within the same C. SAT is in NP
process typically share the same address space, which D. Hamilton circuit problem is not NP-
includes the stack. Each thread has its own stack space complete
within the shared address space of the process. So, the Choose the correct answer from the options
statement S1 and S3 are false and S2 is true. given below :
14. The total cost of retrieving records in sorted (a) A, B and C only (b) B, C and D only
order using an unclustered B+ tree is (P- (c) C, D and A only (d) D, A and B only
Average number of records per data page, N- Ans. (a) : If some NP-complete problem P is in P that P
Data pages = NP. It simply means that this particular NP-complete
F- Ratio of the size of a data entry to the size of problem has a polynomial-time algorithm for a single
a data record) NP-complete problem, then that would mean all NP
(a) (F*N)+P (b) (F+P)*N problems have polynomial-time solutions, i.e. P would
(c) F*N*P (d) F+P/N equal NP. This is the definition of NP-completeness.
Ans. (b) : To calculate the total cost of retrieving The Traveling salesman problem (TSP) is indeed in NP.
records in sorted order using an unclustered B+ tree. This means that given a proposed solution, verify in
We need to consider the cost of accessing each data polynomial time whether it's a valid solution to the
page. This can be calculated by taking into account the problem. The Boolean satisfiability problem (SAT) is in
average number of records per data page (P), the NP. This means that given a proposed solution to a
number of data page entry (N), and the ratio of the size Boolean formula, verify in polynomial time whether is
of a data entry to the size of a data record (F). The satisfies the formula. However, Similar to TSP whether
formula for the total cost can be expressed as: SAT is in P.
Total cost = (F + P) * N. Hamiltonian cycle if graph G contains a Hamiltonian
path. Therefore, any instance of the Hamiltonian cycle
15. Match List I with List II
problem can be reduced to an instance of the
LIST-I LIST-II Hamiltonian path problem. Thus, the Hamiltonian cycle
A. Scenario I. To verify the I/O is NP- Hard. The Hamiltonian cycle is both, a NP.
testing behavior of text problem and NP-Hard. Therefore, it is a NP-complete
object problem.
B. Regression II. User acceptance So, the statement A, B and C are correct and statement
testing methodology D is incorrect.

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 468 YCT
 Search on TG: @apna_pdf
17. A B-tree used as an index for a large database (c) Statement I is correct but Statement II is
table has four levels including the root node. If incorrect
a new key is inserted in this index, then (d) Statement I is incorrect but statement II is
maximum number of nodes that could be newly corrcet
created in the process is Ans. (a) : In many systems, components offer an
(a) 5 (b) 4 operator display interface for users to interact with and
(c) 3 (d) 2 also interface with the communication system for data
Ans. (a) : All nodes are completely full means every exchange or interaction with other components. At the
node has n-1 keys. Given tree has 4 levels if a new key interaction level, Component provide an operator
is inserted then at every level there will be created a display interface and an interface with the
new node. In worst case, root node will also be broken communication system used.
into two parts, and we have 4 levels So, answer should Components at the I/O management level are
be 5 because tree will be increased with one more level. responsible for tasks like operator authentication,
18. Suppose a circular queue of capacity (n–1) generating reports, and managing queries to ensure
elements is implemented with an array of n efficient data handling and user interaction.
elements. Assume that the insertion and 20. Given below are two statements: one is labelled
deletion operations are carried out using as Assertion A and the other is labelled as
REAR and FRONT as array index variable Reason R.
respectively. Initially, REAR = FRONT=0. The Assertion A : A process involves a library
conditions to detect queue empty and queue function to create a thread.
full are Reason R : The threads make system calls to
(a) EMPTY : REAR ==FRONT convey their resource and I/O requirement to
FULL : (REAR +1) mod n == FRONT the Kernel.
(b) EMPTY : (FRONT +1) mod n ==REAR In the light of the above statements choose the
correct answer from the options given below.
FULL: (REAR +1) mod n == FRONT
(a) Both A and R are true and R is the correct
(c) EMPTY (REAR +1) mod n == FRONT
explanation of A
FULL: REAR == FRONT
(b) Both A and R are true but R is NOT the
(d) EMPTY : REAR == FRONT
correct explanation of A
FULL:(FRONT +1) mod n == REAR
(c) A is true but R is false
Ans. (a) : For a circular queue implemented with an (d) A is false but R is true
array of (n-1) elements, the conditions to detect queue
Ans. (b) : Many programming languages and
empty and queue full are as follows:
environment provide library functions to create threads,
1. Queue Empty: when REAR = = FRONT making it easier for developers to implement
2. Queue full : when (REAR + 1) mod n = = FRONT. multithreading in their application.
These conditions ensure that the circular nature of the Threads can indeed make system calls to convey their
queue is properly maintained, allowing elements to resource and I/O requirements to the kernel. However,
wrap around the array when necessary. this is not the primary purpose of using a library
19. Consider the following statements about the function to create a thread. The primary purpose is to
software product line system : enable concurrent execute within the same process.
Statement I: At the interaction level, The system calls for resource and I/O requirements
components provide an operator display typically involve interactions with the operating system,
interface and an interface with the but they are not directly related to the creation of
communication system used. threaded via library functions. So, Assertion A and
Statement II: At the I/O management level, Reason R are true but R is not the correct explanation
components handle operator authentication, of A.
report generator and query manager. 21. Given below are two statements: one is labelled
In the light of the above statements, choose the as Assertion A and the other is labelled as
most appropriate answer from the option given Reason R.
below. Assertion A : The AVL tress are more balanced
(a) Both Statement I and Statement II are correct as compared to Red Black trees, but they may
(b) Both Statement I and Statement II are cause more rotations during insertion and
incorrect deletion
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 469 YCT
 Search on TG: @apna_pdf
Reason R : A Red Black tree with n nodes has Ans. (c) Correct match-
height that is greater than 2log2 (n + 1) and the LIST I LIST II
AVL tree with n nodes has height less than
A. Physical III. Transmission of raw bits
log Φ ( )
5 ( n + 2 ) - 2 (where Φ is golden ratio) layer over communication channel
In the light of the above statement choose the B. Data I. Transforming the raw bits in
correct answer from the option given below. Link the form of frame for
Layer transmission
(a) Both A and R are correct and R is the correct
explanation of A C. Network II. Control and monitoring of
layer subnet
(b) Both A and R are correct and R is NOT the
correct explanation of A D. Transport IV. Datagrams transmission data
layer through connection oriented
(c) A is true but R is false
or connectionless using
(d) A is false but R is true
datagram
Ans. (c) : The AVL trees are generally more balanced
23. Let R = {x:x ∈ N, x is multiple of 3and x ≤ 100}
than Red-Black trees because AVL trees strictly enforce
balance by maintaining a height difference of at most 1 and S = {x:x ∈ N, x is multiple of 5and x < 100} .
between the left and right subtrees of any node. What is the number of elements in
However, this strict enforcement can lead to more ( R I S ) × (S I R ) ?
rotations during insertion and deletion operations.
(a) 36 (b) 33
A Red Black tree with n nodes has height that is no
(c) 20 (d) 6
more than 2 log2 (n + 1). The height of an AVL tree
with n nodes is less than or equal to 1.44 log2 (n + 2) – Ans. (a) : Given that-
1.328. There is not a direct relationship between the R = {x :x ∈ N, x is multiple of 3and x ≤ 100}
height of an AVL tree and the golden ratio. So, R = {3, 6,9,.........99}
Assertion A is true but Reason R is false.
S = {x :x ∈ N, x is multiple of 5and x < 100}
22. Match List I with List II
LIST I LIST II S = {5,10,15,.....95}
A. Physical I. Transforming the The intersection of these two sets, R ∩ S, would be
layer raw bits in the form multiples of both 3 and 5, or multiples of 15, that are
of frame for less than 100.
transmission R ∩ S = {15,30, 45, 60, 75,90}
B. Data Link II. Control and So, there are 6 elements in the intersection of these sets.
Layer monitoring of Since the sets R ∩ S and S ∩ R are the same, which
subnet has 6 elements.
C. Network III. Transmission of raw The number of elements in ( R ∩ S ) × ( S ∩ R )
layer bits over =6×6
communication
= 36
channel
24. Let R (A, B, C, D) be a relational schema with
D. Transport IV. Datagrams following function dependencies :
layer transmission data
A→→B, B→ →C
through connection
C→→D and D→ →B
oriented or
The decomposition of R into (A,B) (B, C) (B, D)
connectionless using
(a) gives a lossless join, and is dependency
datagram
preserving
Choose the correct answer from the option (b) gives lossless joint, but is not dependency
given below : preserving
(a) A-III B-II C-I D-IV (c) does not give a lossless join, but is
(b) A-II B-III C-I D-IV dependency preserving
(c) A-III B-I C-II D-IV (d) does not give a lossless join and is not
(d) A-II B-IV C-I D-III dependence preserving
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 470 YCT
 Search on TG: @apna_pdf
Ans. (a) : Lossless -join Decomposition- Statement II : A program can execute only
Decomposition of R into R1 and R2 is a lossless-join when all of its components are loaded in the
decomposition if at least one of the following functional memory
dependencies are in F+ (closure of functional In the light of the above statement, choose the
dependencies) most appropriate answer from the options
R1 ∩ R2 
→ R1 given below.
Or (a) Both statement I and Statement II are correct
(b) Both Statement I and Statement II are
R1 ∩ R2  → R2
incorrect
Dependency preserving Decomposition-
(c) Statement I is correct but Statement II is
Decomposition of R into R1 and R2 is a dependency pre
incorrect
serving decomposition if closure of functional
(d) Statement I is incorrect but Statement II is
dependencies after decomposition is same as closure of
FDs before decomposition. correct
Ans. (c) : Address translation is indeed performed for
A, B, C and D are all key attributes. We can derive all
every logical address used during the execution of a
attributes from every attribute. Since Intersection of all
program in virtual memory systems. So, statement I is
relations is B and B derives all other attributes, relation
is lossless. The relation is dependency preserving as correct.
well as all functional dependencies are preserved In virtual memory systems, not all components of a
program need to be loaded in to memory at once for the
diversely or indirectly. Note that C→D is also preserved
with following two C→B and B→D. program to execute. This is done by loading parts of the
25. Consider the following finite automata F1 that program that are currently needed, or pages, into
accepts a language L. physical memory while the rest of the program remains
on the disk. This technique is also known as demand
paging. So, Statement II is incorrect.
27. There are M points on one straight line AB and
n points on another straight line AC none of
Let F2 be a finite automata which is obtained them being A. How many triangles can be
by reversal of F1. Then which of the following formed with these points as vertices?
is correct? 1
(a) L (F1) ≠ L (F2) (b) L (F1) = L (F2) (a) mn (m + n – 2) (b) mn ( m + n − 2 )
2
(c) L (F1) ≤ L (F2) (d) L (F1) ≥ L (F2)
1
Ans. (b) : Given, Automata F1 that accepts a language (c) mn ( m + n − 1) (d) mn (m + n –1)
2
L.
Ans. (b) : Given,
There are m points on one straight line AB and n points
on another straight line AC none of them being A.
So, the total number of triangles that can be formed is
Automata F2 obtained by reversal of F1. = m
C1 × n C 2 + m C 2 × n C1
m! n! m! n!
= × + ×
1!( m − 1) ! 2!( n − 2 ) ! 2!( m − 2 ) ! 1!( n − 1) !
1 1
= m × n ( n − 1) + m ( m − 1) × n
Both are finite automata are accept same string 2 2
1
So, L (F1) = L (F2) = mn ( m + n − 2 )
26. Given below are two statement: 2
Which of the following statement/s is/are 28. Given below are two statements:
correct with respect to virtual memory Statement I : Fuzzifier is a part of a fuzzy
Statement I : Address translation is performed system
for every logical address used during the Statement II : Inference engine is a part of
execution of a program fuzzy system
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 471 YCT
 Search on TG: @apna_pdf
In the light of the above statement choose the 31. What will be the output of the following code?
most apropriate answer from the options given # include < stdio. h>
below. int main () {
(a) Both Statement I and Statement II are correct int a, b, c;
(b) Both Statement I and Statement II are a = ox10; b= o10;
incorrect
c = a + b;
(c) Statement I is correct but Statement II is
printf ("%d",c);
incorrect
(d) Statement I is incorrect but Statement II is return 0;
correct }
Ans. (a) : Fuzzifier is indeed a component of a fuzzy (a) 20
system. It's responsible for converting crisp input values (b) 24
into fuzzy sets, which are then used for fuzzy logic (c) Garbage
reasoning. Inference engine is another essential (d) error
component of a fuzzy system. It interprets the fuzzy Ans. (b) : In C language, If number starts with 'o' it is
rules and determines the fuzzy output based on the octal and if it starts with 'ox' it is hexadecimal. In Given
fuzzy sets obtained from the fuzzifier. So, both code 'o × 10' is hexadecimal representation of 16, and
statement I and II are correct. 'o10' is octal representation of 8. Adding them together
29. Consider the following statements: '16 + 8 = 24'. so the output of given code is 24.
(A) A database design is in BCNF if each 32. What is the (4+4) fit binary fixed point
member of the set relation schemas that equivalent of -(3.72)10?
constitutes the design is in BCNF
(B) A BCNF schema can have transitive (a) 0011.1100
dependency (b) 0011.1010
(C) It is always possible to obtain a 3NF design (c) 1100.0100
without sacrificing a lossless join (d) 0011.1011
(D) There are multivalve dependencies in 4NF Ans. (c) : Convert –(3.72)10 in binary fixed point-
(a) A, B and C only (b) B, C and D only Integer part (–3)
(c) A, B and D only (d) A, C and D only  The binary representation of 3 is 001.
Ans. (d) : A BCNF (Boyce-Codd Normal form)  2's complement representation of -3 gives 1101.
schema, can not have any non-trivial dependencies
 We need to consider only 4 bits which is 1100 offer
other than superkeys. Transitive dependencies are a
form of non-trivial dependencies. So, a BCNF schema discarding overflow bits, So, the binary representation
cannot have transitive dependency. Hence, statement B of –3 is 1100.
is false while statement A, C and D are true. Fraction part (0.720)-
30. Which of the following is not a property of a 0.72 × 2 = 1.44
good system for representation of knowledge in the first digit offer decimal point is 1
a particular domain? 0.44 × 2 = 0.88
(a) Presentation adequacy the second digit offer decimal point is 0
(b) Inferential adequacy 0.88 × 2= 1.76
(c) Infertile efficiency the third digit offer decimal point is1
(d) acquisitional efficiency 0.76 × 2 = 1.52
Ans. (a) : Knowledge Representation is a necessary the fourth digit offer decimal point is 1
component of AI. It allows programmers to convert So, the binary equivalent of 0.72 is .1011.
real-world data into a language that a computer can use Therefore, after 4 bit binary fixed point 0.72 is .0100.
to develop an information system that is critical in
So, the (4 + 4 ) bit binary fixed point equivalent of
accomplishing tasks. The following properties should
– (3.72)10 is 1100.0100.
be possessed by a knowledge representation system.
(i) Representational Adequacy 33. Let N denote the set of all natural numbers and
(ii) Inferential Adequacy R be the relation on NXN defined by (a,b) R
(iii) Inferential Efficiency (c,d), if ad (b+c) = bc (a + d). Then R is
(iv) Acquisitional adequacy (a) Symmetric only
Presentation adequacy is not a property of a good (b) Reflexive only
system for representation of knowledge in a particular (c) Transitive only
domain. (d) An equivalence relation

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 472 YCT
 Search on TG: @apna_pdf
Ans. (d) : A relation R on a set N is said to an Ans. (d) : Given,
equivalence relation it is Reflexive, symmetric and Boolean expression-
F ( P, Q ) = ( (1 ⊕ P ) ⊕ ( P ⊕ Q ) ) ⊕ ( ( P ⊕ Q ) ⊕ ( Q ⊕ 0 ) )
transitive.
Reflexive: For any (a,b) in N × N, we nee to show that
(a, b) R (a, b). ( )
= P ⊕ P ⊕ Q ⊕ (P ⊕ Q ⊕ Q) ∴1 ⊕ P = P
ad (b + a) = ab (a + d), which is true since both sides are
equal. Q⊕0 = Q
Symmetric: For any (a, b) and (c, d) in N × N, = (1 ⊕ Q ) ⊕ ( P ⊕ 0 ) ∴P ⊕ P = 1
If (a, b) R (c, d) then (c, d) R (a, b).
Q⊕Q = 0
if ad (b + c) = bc (a + d), then bc (a + d) = ad (b + c),
which is the same relation, so it's symmetric. = Q⊕P Q P ⊕ Q = PQ + PQ
Transitive: For any (a, b) (c, d) and (e, f) in N × N, if (a,
P ⊕ Q = PQ + PQ
b)R (c, d) and (c, d) R (e, f) then (a, b) R (e, f). If ad (b
+ c) = bc (a + d) and ce (d + f) = de (c + e), then ac (b + = PQ ⊕ PQ
f ) = be (a + f), which means (a, b) R (e, f). Now we need to check for the options, if we simplify
Since R satisfies all three properties, it is indeed an
expression P ⊕ Q .
equivalence relation.
34. The maximum yield length of the following P ⊕ Q = PQ + PQ
CNF, CFG is.
S→AB
(
= P+Q . P+Q)( ) by Demargan's Law

A→CD Q PP = 0
B→ e QQ = 0
C→ a
= PP + PQ + PQ + QQ
D→ b
= PQ + PQ

(a) 8 (b) 7 36. What of the following scenario may lead to an

(c) 4 (d) 5 irrecoverable error in a database system?
Ans. (c) : To find the maximum yield length of a CNF (a) A transaction writes a data item after it is read
(Chomsky normal form) CFG (Context - free by an uncommitted transaction
Grammar), we need to look at the rule and find the (b) A transaction reads a data item after it is read
longest path from the start symbol to a terminal symbol. by an uncommitted transaction
S → AB (c) A transaction reads a data item after it is
S → CDe Q A → CD written by a committed transactions
B→e (d) A transaction reads a data item after it is
written by an uncommitted transaction
S → abcd Q C→a Ans. (d) : In database system, reading a data item after
D→b it has been written by an uncommitted transaction is an
We get the longest string- example of a phenomenon known as 'dirty read' or
S → abcd 'uncommitted dependency'. This can lead to inconsistent
or incorrect result if the uncommitted transaction is later
Therefore, the maximum yield length is 4.
rolled back.
35. Let ⊕ denote XOR operation. Let 1 and 0
denote the binary constants and F is the 37. An observational technique that can be used to
Boolean expression over two variables P and Q understand operational process and help to
F ( P,Q ) = ( (1 ⊕ P ) ) ⊕ ( ( P ⊕ Q ) ) ⊕ ( ( P ⊕ Q ) ) ⊕ ( ( Q ⊕ 0 ) )
derive requirement for software to support
operational process is known as
Which of the following is equivalent expression
(a) Requirement specification
to F?
(b) Structural specification
(a) (P ⊕ Q) (b) (P + Q)
(c) Ethnography
(c) (P + Q) (d) (P ⊕ Q) (d) Natural language specification

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 473 YCT
 Search on TG: @apna_pdf
Ans. (c) : Ethnography in software engineering is the C. UMTS Accessing mechanism
III.
application of ethnographic research (qualitative) in the for multiple
development and assessment of computer programs. transmitters over a
Specifically, ethnographical research includes the single channel
observational recordings of human, social and
D. WiFi IV. It is a cellular
organizational needs and experiences. In other word, An
technology that
observational technique that can be used to understand
employs hybrid of
operational process and help to derive requirement for
FDMA and TDMA
software to support operational process is known as
Ethnography. Choose the correct answer from the option
38. Given below are two statement : one is labelled given below :
as Assertion A and the other is labelled as (a) A-III B-IV C-II D-I (b) A-III B-IV C-I D-II
Reason R. (c) A-II B-III C-IV D-I (d) A-II B-I C-IV D-III
A virtual memory system uses first-in first-out Ans. (b): Correct match-
page replacement policy and allocates a fixed LIST I LIST II
number frames to a process
A. CDMA III. Accessing mechanism for
Assertion A: Increasing number of page frames
multiple transmitters over a
allocated to a process sometimes increases the
page fault rate single channel
Reason R: Some programs do not exhibit B. GSM IV. It is a cellular technology that
locality of reference. employs hybrid of FDMA and
In the light of the above statements, choose the TDMA
correct answer from the options given below. C. UMTS I. It provides mobile internet
(a) Both A and R are true and R is the correct connection with faster data
explanation of A transfer rates
(b) Both A and R are true but R is NOT the D. WiFi II. It allows user to connect to a
correct explanation of A network or to other devices
(c) A is true but R is false over wireless channel
(d) A is false but R is true
40. Consider the following language:
Ans. (b) : Increasing the number of page frames
allocated to a process can indeed sometimes increase L = {w ∈ {a,b,c} * : n a ( ω ) + nb ( ω ) = n c ( ω )} L
the page fault rate. This is due to the phenomenon is
known as 'thrashing', where the overhead of managing a (a) Context free but not linear
large number of frames can outweigh the benefits of (b) Not context free
having more frames, leading to more frequent page
(c) Context free and linear
faults. So the Assertion A is true.
(d) Linear
The Reason R is also true. Some programs do not
exhibit locality of reference, meaning they don't have Ans. (a) : Given language-
∈

predictable memory access patterns that benefit from L = {w {a, b, c} * : n a ( ω ) + n b ( ω ) = n c ( ω )}

having more page in memory Programs with irregular
or non-local memory access patterns may experience The language L consists of strings over the alphabet {a,
high page page fault rates regardless of the number of b, c} with the property that the total number of a's and
page ferames allocated to them. So, both A and R are b's in any string must be equal to the total number of c's.
true but R is not the correct explanation of A. The language L is context-free because it can be
39. Match List I with List II generated by a context-free grammar. however, it's not
LIST I LIST II linear because it cannot be recognized by a linear
bounded automaton, as the number of a's and b's needs
A. CDMA I. It provides mobile
internet connection to be remembered to ensure that they match the number
with faster data of c's, which exceeds the capabilities of linear bounded
transfer rates automation.
B. GSM II. It allows user to 41. Which of the following is not a mutation
connect to a network or operator in a genetic algorithm?
to other devices over (A) Random resetting (B) Scramble
wireless channel (C) Inversion (D) Difference
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 474 YCT
 Search on TG: @apna_pdf
Choose the correct answer from the option The average waiting time
given below : 3 + 0 + 8 11
(a) A and B only (b) B and D only = = = 3.67 ms
3 3
(c) C and D only (d) D only
Ans. (d) : Genetic Algorithms (GA) are adaptive 43. Which is not the component of the natural
heuristic search algorithms that belong to the larger part language understanding process?
of evolutionary algorithms. In each generation (a) Morphological analysis
chromosomes undergo mutation and crossover and then (b) Semantic analysis
selection to produce a better population whose (c) Pragmatic analysis
candidates are nearer to our desired solution. (d) Meaning analysis
Mutation operator is a unary operator and it needs only
Ans. (d) : Natural language understanding (NLU) is a
one parent to work on. It does so by selecting a few
genes from our selected chromosome and apply the branch of Artificial Intelligence (AI) that uses computer
desired algorithm. software to understand input in the form of sentences
There are 5 type of mutation operator in a genetic using text or speech. NLU enables human-computer
algorithm- interaction by analyzing language versus just words.
(i) Bit flip mutation There are five components of the natural language
(ii) Random Resetting Mutation understanding process.
(iii) Swap Mutation (i) Morphological and lexical Analysis
(iv) Scramble Mutation (ii) Syntactic Analysis
(v) Inversion mutation (iii) Semantic Analysis
42. Consider the following table of arrival time and (iv) Discourse Integration
burst time for three processes P0, P1 P2: (v) Pragmatic Analysis
Process arrival time Burst time 44. Consider a hash table of size seven with
P0 0 ms 7 starting index zero and a hash function (6x + 3)
P1 1 ms 3 mod 4. Assuming the hash table is initially
P2 2 ms 7 empty. Which of the following is the content of
The pre-emptive shortest job first scheduling the table when the sequence 1, 3 8, 10,5, is
algorithm is used. Scheduling is carried out inserted into the table using closed hashing?
only at arrival or completion of a process. Here"_____" denotes an empty location in the
What is the average waiting time for the three table.
processes? (a) 1,3,8,10,5,__,__ (b) 3,8,1,__,10,__,5
(a) 3 ms (b) 3.67 ms (c) __,3,8,1,__,10,5 (d) __,1,3,8,10,5,__
(c) 4.47 ms (d) 4 ms Ans. (d) : To insert the sequence into the hash table
Ans. (b) : Shortest job first (SJF) Scheduling algorithm using closed hashing, we apply the hash function (6x+3)
associates with each process the length of the process's mod 4 to each element and handle collisions using
next CPU burst. When the CPU is available, it is linear probing.
assigned to the process that has the smallest next CPU
1. Insert 1 :
burst. If the next CPU bursts of two processes are the
same , FCFS scheduling is used top break the tie. Using Hash value (1) = (6 × 1 + 3) mod 4 = 1
SJF scheduling, we would schedule these processes Place 1 in index 1
according to the following Gantt chart. Hash Table :

Turnaround Time = Completion Time – Arrival Time 2. Insert 3:

Waiting Time = Turnaround Time – Burst Time Hash value (3) = (6 × 3 + 3) mod 4 = 1
Process Table- Collision, so we probe to the next available slot place 3
Process Arrival Burst Completion Turnaround Waiting in index 2.
Time Time Time Time Time
Hash Table:
P0 0 7 10 10 3
P1 1 3 4 3 0
P2 2 7 17 15 8

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 475 YCT
 Search on TG: @apna_pdf
3. Insert 8 : 46. Match List I with List II
Hash value (8) = (6 × 8 + 3) mod 4 = 3 LIST I LIST II
Place 8 in index 3. A. RAID level 2 I. Bit interleaved
Hash Table : parity
B. RAID level 4 II. Block interleaved
distributed parity
C. RAID level 5 III. Error correcting
4. Insert 10:
parity
Hash value (10) = (6 × 10 + 3) mod 4 = 3
D. RAID level 3 IV. Block interleaved
Collision, So we probe to the next available slot.
parity
Place 10 in index 4.
Choose the correct answer from the option
Hash Table:
given below.
(a) A-IV B-III C-I D-II (b) A-III B-IV C-II D-I
(c) A-I B-I C-II D-IV (d) A-I B-III C-IV D-I
5. Insert 5: Ans. (b) : Correct match-
Hash value (5) = (6 × 5 + 3) mod 4 = 1 LIST I LIST II
collision, probe to the next available slot. A. RAID level 2 III. Error correcting parity
Place 5 in index 5. B. RAID level 4 IV. Block interleaved parity
Hash Table: C. RAID level 5 II. Block interleaved
distributed parity
D. RAID level 3 I. Bit interleaved parity
47. Match List I with List II
So, the content of the table offer inserting the seqence is
: [–, 1, 3, 8, 10, 5, –] LIST I LIST II
45. A three dimensional array C++ is declared as A. Expert system I. Decision tree
int A [a] [b] [c]. Consider that array elements B. Fuzzy system II. Scramble
are stored in row major order and indexing C. Operator in III. Inference engine
begin from 0. Here the address of an item at genetic
the location A [r] [s] [t] computed in terms of algorithm
word length w of an integer is D. Supervised IV. Mycin
(a) & A[0] [0] [0] + w (b*c*s+c*r+t) technique
(b) & A[0] [0] [0] + w (b*c*r+c*s+t) Choose the correct from the option given
(c) & A[0] [0] [0] + w (a*b*r*+c*s+t) below.
(d) & A[0] [0] [0] + w (a*b*s+c*r+t) (a) A-IV B-I C-III D-II (b) A-III B-IV C-II D-I
Ans. (b) : According to this question we have to find (c) A-IV B-III C-II D-I (d) A-I B-II C-III D-IV
the address of A [r] [s] [t]. To reach rth row we must Ans. (c) : Correct match-
have to cross 0 to r–1 rows i.e. r rows and each rows LIST I LIST II
contains b*c elements. Hence, = b * c * r A. Expert system IV. Mycin
Now to reach 5th element in rth row we have to cross s B. Fuzzy system III. Inference engine
rows and each row contains c (total columns) elements.
C. Operator in genetic II. Scramble
So, = c * s
algorithm
To reach tth elements we have to cross t elements in (r +
D. Supervised technique I. Decision tree
1)th row.
48. Consider following statements:
Total elements to cross = (b * c * r + c * s + t) Now
each element occupies w amount of space in memory. (A) A context free language is generated by LR
(o) grammar if and only if it is accepted by
Therefore total space occupied by these elements = w
a deterministic pushdown automata and
(b * c * r + c * s + t)
has prefix property
Hence, address of A [r] [s] [t] = base address + space
(B) If M1 is single tape TM simulating
occupied by the elements before it multilape TM M, then time taken by M1 to
= & A [0] [0] [0] + w (b * c * r + c * s + t) simulate n moves is (n3)
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 476 YCT
 Search on TG: @apna_pdf
(C) Push down automata behaves like a Turing y' = y − 2
machine when it has one auxiliary z' = z – 3
memory. The equation becomes-
(D) L ={anbncn : n ≥ 1} is not context free but x' + 1 + y' + 2 + z' + 3 + w = 29
context sensitive. x' + y' + z' + w = 23
Choose the correct answer from the option Now, to find the number of integral solutions-
given below : considering x', y', z' and w as indistinguishable stars
(a) A, B and C only (b) A, B only and the 3 separating bars as the separation between the
(c) C, D only (d) B, C only variables.
Ans. (*) : Among the four given sentences. Only We a have a total of [23 + 4–1] position s to place the
sentence D is correct which is not given in the option. bars,
So, this question has beend dropped by UGC. Thus, the number of integral suctioned is
23 + 4 −1
49. Consider a popular sports news site. At a given = C 4 −1
moment, 20,000 concurrent users submit a
26 26!
request (a transaction, T) one every 2 minutes = C3 =
on average. Each transaction requires the 3!( 26 − 3) !
webapp to download a new article that on = 2600
average has 3k bytes in length. What is the 51. Let R (A,B, C,D,F) be a relational schema with
throughput? following functional dependencies:
(a) 8 megabits per second C→→ F, E→ → A, EC→ → D, A→ →B
(b) 4 megabits per second Which of the following is a key for R.
(c) 6 megabits per second (a) CD (b) EC
(d) 2 megabits per second (c) AE (d) AC
Ans. (b) : To calculate the throughput, we first need to Ans. (b) : To find a key for relation scheme R, we need
determine the total amount of data transferred per unit to identify a minimal set of attributes that uniquely
of time. Each user submits a request every 2 minutes. determine all other attributes in the reason.
So, we have- Given the dependencies-
20,000 concurrent users
C→F
Each user generates 1 request every 2 minutes.
E→A
Thus, the total number of request per second is
EC → D
20000
= = 166.67 A→B
2 × 60
We can start with attribute sets, and check if they satisfy
Each request downloads on article that is, on overage, the closure property to include all attributes.
3k bytes in length. So, the total data transferred per
Now, Let's try {E, C}:
second is-
{E, C}+ = {C, E, A, F}
166.67 × 3 k bytes = 500 k bytes
(from C → F and E → A)
To convert this to megabits per second-
It includes all attributes, So {E, C} is a candidate key.
500
= × 8Mb / s We can verify that no subset of {E, C} uniquely
1024 determines all attributes, Hence, {E, C} is the key for
= 4 Mb/s relation scheme R.
Therefore, the throughput is 4 megabits per second. 52. What is the output of following code?
50. How many integral solutions are there to x + y + z + main ()
w = 29, where x ≥ 1, y ≥ 2, z ≥ 3 and w ≥ 0? struct s1
(a) 2400 (b) 2600 { char*z;
(c) 2800 (d) 3000 int i;
Ans. (b) : Let's first adjust the restrictions to simplify Struct s1 * p;
the problem. }
Since, x ≥ 1, y ≥ 2 and z ≥ 3. static struct s1 a[ ]= {
we can introduce new variables- {"Nagpur", 1, a+1}
x ' = x −1 {"Raipur', 2, a +2}
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 477 YCT
 Search on TG: @apna_pdf
{"kanpur' 3.a} Ans. (b) Correct match-
}; LIST I LIST II
struct s1* ptr = a; A. Critical region II. Mutual exclusion
Printf (%s%s%s \nn, a[0] z.ptr→ →z,a[2].P→ →z); B. Wait signal I. Hoare's monitor
} C. Working set III. Principle of locality
(a) Nagpur Raipur Kanpur
D. Deadlock IV. Circular wait
(b) Nagpur Nagpur Nagpur
55. Consider two hosts P and Q that are connected
(c) Kanpur Kanpur Kanpur through a router R. The maximum transfer
(d) Error unit (MTU) value of the link between P and R
Ans. (b) : In given code, each element in the array 'a' is is 1500 bytes and between R and Q is 820 bytes.
initialized with a pointer to the next element's 'z' ATCP segment of size is 1400 bytes is
member. So, transferred from P to Q through R with IP
'a [0], z' refers to the string " Nagpur", which is the 'z' identification value of 0×1234. Assume that IP
value of the first structure. header size is 20 bytes. Further the packet is
allowed to be fragmented that is Don't
'ptr → z' also gives " Nagpur" because 'ptr' was
fragment (DF) flag in the IP Header is not set
intialized to point to the first structure in the array.
by P. which of the following statement/s is/are
'a[2]. p → z' also gives "Nagpur" because 'p' of the third true?
structure was initialized to point to the first structure in A. Two fragments are created at R and IP
the array. datagram size carrying the second
Therefore, the output of this code would be Nagpur fragment is 620 bytes
Nagpur Nagpur. B. If the second fragment is lost, then R
53. Which one of the following is NOT a part of resends the fragment with IP identification
ACID properties of a database transaction? value 0×1234
(a) Atomicity (b) Consistency C. If the second fragment lost, then P requires
(c) Isolation (d) Deadlock-freedom to resend the entire TCP segment.
D. TCP destination port can be determined by
Ans. (d) : A transaction is a single logical unit of work
analyzing the second fragment only.
that accesses and possibly modifies the contents of a
Choose the correct answer from the option
database. Transactions access data using read and write
given below
operations. In order to maintain consistency in a
(a) A, B and C only (b) A and C only
database, before and after the transaction, certain
(c) C and D only (d) B and D only
properties are followed. These are called ACID
properties. Ans. (b) : Analyze each statements-
A = Atomicity (A) The maximum transfer unit (MTU) value of the link
between P and R is 1500 bytes and between R and Q is
C = Consistency
820 bytes, and the IP header size is 20 bytes, the
I = Isolation maximum payload size for the second fragment would
D = Durability be 800 bytes (820–20) R should have received a full
54. Match List I with List II datagram of size 1420 bytes (1400 + 20). The other with
LIST I LIST II the remaining data 600 bytes (1400 – 800). the second
fragment would indeed be 620 bytes (600 + 20). So, the
A. Critical region I. Hoare's monitor statement (A) is true.
B. Wait signal II. Mutual (B) R does not have the capability to resend lost
exclusion fragments. It's the responsibility of the end points (P
C. Working set III. Principle of and Q) to handle packet loss and retransmission. so, the
locality statement (B) is false.
D. Deadlock IV. Circular wait (C) TCP relies or acknowledgments to ensure reliable
delivery. If a fragment is lost and not acknowledged by
Choose the correct answer from the option
the receiver, TCP will trigger a retransmission of the
given below: entire segment. So, the statement (c) is true.
(a) A-IV B-I C-III D-II (D) The destination port is a TCP header field which is
(b) A-II B-I C-III D-IV located in the first fragment. The second fragment does
(c) A-I B-II C-III D-IV not contain this information So, the statement (D) is
(d) A-IV B-III C-I D-II false.

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 478 YCT
 Search on TG: @apna_pdf
56. Given below are two statements: one is labelled (a) 15 (b) 22
as Assertion A and the other is labelled as (c) 18 (d) 13
Reason R. Ans. (c) : Given that -
Assertion A: Dendral is an expert system
Initial value of semaphore = 7
Reason R: The rationality of an agent is not
Final value of semaphore = 5
related to its reaction to the environment.
Number of P operations = 20
In the light of the above statements, choose the
correct answer from the option given below. If denote the number of V operations as 'x;
(a) Both A and R are true and R is the correct then, final value = Initial value + x – Number of p
explanation of A operation
(b) Both A and R are true but R is NOT the 5 = 7 + x – 20
correct explanation of A x = 18
(c) A is true but R is false So, 'x' will be 18.
(d) A is false but R is true 59. Which of the following is not a solution
Ans. (c) : Dendral is indeed an expert system but the representation in a genetic algorithm?
reason provided doesn't accurately describe the (a) Binary valued (b) Real valued
characteristics of an expert system. The rationality of an (c) Permutation (d) Combinations
agent is often related to its reaction to the environment,
Ans. (d) : In genetic algorithms, solution representations
as expert systems like dendral typically exhibit rational
typically include, Binary - valued representation uses
behavior in responding to input data or queries within
their domain of expertise. So, the Assertion A is true but strings of binary digits to encode solutions. Real-valued
Reason R is false. representation encodes solutions as vectors of real
numbers. Permutation representation represents
57. In a multiuser operating system, 20 request are
solutions as permutations of set of elements, However,
made to use a particular resource per hour, on
'combinations' are not typically used as a direct
an average. The probability that no request is
made in 45 minutes is representation in genetic algorithms.
(a) e–15 (b) e–5 60. Which phase of compiler checks the grammar
(c) 1–e –5
(d) 1–e–10 of programming?
Ans. (a) : To calculate the probability that no request is (a) Code optimization (b) Semantic analysis
made in 45 minutes, we need to convert the time frame (c) Code generators (d) Syntax analysis
to hours. Ans. (d) : Syntax analysis is the second phase of a
45 3 compiler, also known as parsing. This phase takes the
Since, 4 minutes is equivalent to = hours.
60 4 stream to tokens generated by the lexical analysis phase
Now, if 20 requests are made per hour on average. and checks whether they conform to the grammar of the
then the average rate of requests per hour would be programming language. The output of this phase is
usually an Abstract syntax tree (AST).
3
× 20 = 15 request per hour. 61. Given the basic ER diagram and relational
4
model, which of the the following is incorrect?
using the Poisson distribution formula-
(a) An attribute of an entity can have more than
e−λ λ k
P(X = k) = one value
k! (b) An attribute of an entity can be composite
Where, λ is the average rate of events per interval k is (c) In a row of relational table, an attribute can
the number of occurrences. have more than one value
So, λ = 15 K=0 (d) In a row of a relational table, an attribute can
e−1515° have exactly one value or a NULL value
P ( X = 0) = =e Q 0! = 1
0! Ans. (c) : The term 'entity' belongs to ER model and the
= e–15 term 'relational table' belongs to relational model.
58. At a particular time of computation, the value Statement of the option (a) and (b) both are correct. ER
of a counting semaphore is 7. Then 20 p model supports both multivalued and composite
operations and 'x' V operations were completed attributes. Statement of the option (c) is incorrect and
on this semaphore. If the final value of (d) is correct. In relation model, an entry in relational
semaphore is 5. x will be table can have exactly one value or a NULL value.
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 479 YCT
 Search on TG: @apna_pdf
62. A processor chip is used for application in timestamp. Based concurrency control algorithm is a
which 30% of execution time is spent on non-lock concurrency control method. In Timestamp
floating point addition. For the new model of based method, deadlock cannot occur as no transaction
the processor, the design team has come up ever waits. so, the statement I is incorrect but statement
with redesign the floating point adder to make II is correct.
it twice as fast. What will be possible maximum 64. Consider the following statements
speed up by this redesign? A. C-Fuzzy means clustering is a supervised
(a) 2.0 (b) 1.06 method of learning
(c) 1.18 (d) 2.5 B. PCA is used for dimension reduction
Ans. (c) : Given, 30% of the execution time is spent on C. Apriori is not a supervised technique
floating point addition, and we are making it twice as D. When a machine learning model becomes
fast. The speedup can be calculated by using Amdahl's so specially tuned to its exact input data
Law as follows: that it fails to generalize to other similar
1 data it is called under fitting
Speedup =
protion improved Choose the correct answer from the options
(1 − portion improved ) + given below :
improvement factor
(a) A and B (b) B and C
Where,
(c) C and D (d) D and A
Portion improved = 0.3 (3% of execution time on
floating point addition). Ans. (b) : C- fuzy means clustering is actually an
Improvement factor = 2 (twice as fast) unsupervised method. So, the statement A is incorrect.
principal component Analysis (PCA) is commonly used
1
Speedup = for dimensionality reduction. So, the statement B is
0.3
(1 − 0.3) + correct. Apriori is indeed an unsupervised technique
2 used in association rule learning. So, the statement C is
1 1 correct. When a model is overly simplified and fails to
Speedup = =
0.7 + 0.15 0.85 capture the underlying patterns of the data, it is called
overfitting. Underfitting happened when a model is too
Speedup ≈ 1.18
simple to learn the underlying structure of the data. So,
So, the maximum possible speedup by redesigning the the statement D is incorrect.
floating point adder would be 1.18.
65. Southerland Hodgeman method is used on
63. Given below are two statements: (a) Smooth curves (b) Line segment
Which of the following concurrency control (c) Convex polygons (d) Concave polygons
protocol ensures both conflict serializability
Ans. (c) : The Sutherland-Hodgeman algorithm is used
and freedom from deadlock?
for clipping polygons against a rectangular window. It
Statement I: Two phase locking works by extending each line of the convex clip
Statement II: Timestamp ordering polygon in turn and selecting only vertices from the
In the light of the above statements, choose the subject polygon that are on the visible side.
most appropriate answer from the option given
66. A. The set of turning machine codes for TM's
below:
that accept all inputs that are palindromes
(a) Both Statement I and Statement II are correct (possible along with some other inputs) is
(b) Both Statement I and Statement II are decidable
incorrect B. The language of code for TM's M that
(c) Statement I is correct but Statement II is when started with blank tape, eventually
incorrect write a 1 somewhere on the type is
(d) Statement I is incorrect but Statement II is undecidable
correct C. The language accepted by a TM M is L (M)
Ans. (d) : Two phase locking (2PL) is a concurrency is always recursive
control method that guarantees serializability. the D. Post's correspondence problem is
protocol utilizes locks, applied by a transaction to data, undecidable
which may block (interpreted as signals to stop) other Choose the correct answer from the option
transactions from accessing the same data during the given below:
transaction. 2PL may be lead to deadlocks that result (a) A, B and C only (b) B, C and D only
from the mutual blocking of two or move transactions. (c) A and C only (d) B and D only
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 480 YCT
 Search on TG: @apna_pdf
Ans. (d) : The set of Turing machine codes for Turing ab
φ ( ab ) =
machines that accept all inputs that are palindromes ab
(along with some other inputs) is undecidable. This is
because the set of palindromes is not recursively φ ( a ) * φ ( b ) =  a  *  b 
   
enumerable, and determining whether a Turing machine  b b
accepts all palindromes is equivalent to determining The function is not one to one, because multiple distinct
whether it accepts all strings in that set, which is elements in G get mapped to the same element in H.
undecidable. So, the statement (A) is incorrect. The function is onto, because every element in H can be
(B) The language of codes for Turing machines that, reached by some element in G. So, the function is an
when started with a blank tape, eventually write a 1 onto homomorphism, which is not one to one.
some where on the tape is undecidable. This falls under
68. Which of the following parser is most powerful
the category of the Halting problem, which is known to parser?
be undecidable. So, statement (B) is correct. (a) Operator precedence (b) SLR
(C) The language accepted by a Turing machine M is (c) Canonical LR (d) LALR
always recursive. This is not necessarily true. there exist
Ans. (c) : The 'canonical LR' parser is more powerful
languages that are not recursive, meaning they cannot
parser because it utilizes the full LR (1) parsing
be decided by a turing machine. so, the statement (C) is
technique, which means it considers one look ahead
incorrect.
symbol when making parsing decisions. This additional
(D) Post's correspondence problem (PCP) is known to look ahead allows it to handle more complex grammars
be undecidable, which means there is no algorithm that and resolve parsing conflicts more effectively than
exists that can solve all instances of the PCP. So, the parsers with limited lookahead, such as SLR and LALR
statement (D) is correct. parsers. canonical LR parsers construct a coronial
R collection of LR (1) sets, providing a more
67. Let G = and H = {–1, 1} be groups under comprehensive analysis of the grammar's structure.
{0}
69. What is x in the following program?
the multiplication. Then the map φ : G → H
# include < stdio h>
x
defined by φ ( x ) = is int main ()
x {typedef (*(* arrfptr[3]) ()) [10]:
(a) Not a homomorphism arrfptr x;
(b) A one-one homomorphism, which is not onto return 0;
(c) An onto homomorphism, which is not on to }
one (a) x is a pointer
(d) An homomorphism (b) x is a array of three pointer
(c) x is an array of three function pointer
Ans. (c) : Given,
(d) Error in x declaration
R
G= and H = {–1, 1} Ans. (c) : In the given program, 'arrfptr' is a typedef for
{0} an array of function pointers. This means 'arrfptr' is an
x array of size 3, where each element is a pointer to a
The map φ : G → H is defined by φ ( x ) = . function. Each function returns a pointer (*) to an array
x
of 10 elements.
Where, G is the set of non-zero real numbers and H is So, 'x' is an array of three function pointer where
the set {-1, 1}, we are considering these groups under function return a pointer to an array of 10 elements.
multiplication.
70. Find the sum of all four digit numbers formed
Now, a mapping φ : G → H is called a homomorphism using the digits 1,2,4 and 6.
if for all a, b in G, we have. (a) 86,658 (b) 88,8858
φ ( ab ) = φ ( a ) * φ ( b ) . (c) 91,958 (d) 93,358
Ans. (a) : To find the sum of all four-digit numbers
x
φ( x ) = , takes any positive number in G to 1 in H formed using the digits 1, 2, 4 and 6 we can calculate
x the sum of each digit in each position and then multiply
and any negative number in G to –1 in H. so, it we take it by the number of times each digit appears in that
two elements a and b in G. we have- position.

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 481 YCT
 Search on TG: @apna_pdf
The sum of digits in that place = 1 + 2 + 4 + 6 = 13 Ans. (c) : To calculate the reliability of the system for
Each digit appears in that place = 6 times one hour of operation using an exponential model, So,
So, the sum contributed by- using the formula-
Thousands place = 13 × 6 × 1000 = 78000 R (t) = e–λt
Hundreds place = 13 × 6 × 100 = 7800 where,
Tens place = 13 × 6 × 10 = 780 R (t) is the reliability at time t.
Unit place = 13 × 6 × 1 = 78 λ is the failure rate (reciprocal of the MTBF) t is the
Adding these sums to gather = 78000 + 7800 + 780 + time period of interest.
78 = 86658 The mean time between failures (MTBF)-
Hence, the sum of all four digit number is 86,658. 6 + 4 + 8 + 5 + 6 29
λ= =
71. Consider the following statements: 5 5
A. Dynamic metrics are collected by Now, put the value to find the reliability for one hour of
measurements made of a program in −
1
×1
operation R (1) = e
29
execution 5

B. Static metrics are collected by 5

−
measurements made of representations of = e 29
the system
73. Which of the following statement is correct?
C. The assessment of software quality is an
(a) Ackermann's function is primitive recursive
objective process
D. An important part of quality assurance in (b) L = {a n b k c n + k : n ≥ 0, k ≥ 0} is regular
the selection of standards that should apply language.
to the software development process. (c) L = {a n b J : n = J 2 } is not context free
Choose the correct answer from the options
given below: language.
(d) For every context sensitive language L not
(a) A, B, C only (b) B, C and D only
including λ, there exists some linear bounded
(c) A, C and D only (d) A, B and D only
automata M such that L ≠ L(M)
Ans. (d) : Analyze these statements-
(A) Dynamic metrics are indeed collected from a Ans. (c) : The language L = {a n b J : n = J 2 } is not
program while it's running, providing insight into its context -free because a context -free grammar cannot
behavior during execution. So, the statement (A) is count occurrences of two different symbols, Like the
correct. number of a's and the square of the number of b's. In
(B) Static metrics, on the other hand, are gathered from this case, the language requires comparing the number
representations of the system, like the source code, of a's to the square of the of the number of b's, which is
without executing it. So, the statement (B) is correct. beyond the capabilities of a context free grammar
(C) The assessment of software quality is not strictly 74. How will you free the memory allocated by the
objective; it involves both objective measures, like following program?
metrics and standards, as well as subjective judgments, # include <stdio.h>
such as user experience and satisfaction So, the # include <stdib.h>
statement (C) is incorrect. # define MAXROW 3
(D) Selecting appropriate standards for the software # define MAXCOL 4
development process is crucial for ensuring quality int main ()
assurance and consistency in development practices. So {
the statement (D) is correct. int** p,i,j;
72. The following table shows the time between P = (int **) malloc (MAXROW * size of (int*));
failures for a software: return ();
Error number 1 2 3 4 5 }
time since last failure 6 4 8 5 6 (a) memfree (int p); (b) dealloc (p);
(Hours) (c) malloc (p, 0); (d) free (p);
The reliability of the system for one hour Ans. (d) : This code first allocates memory for on array
operation assuming an exponential model is- of pointers 'p' then allocates memory for each row
-9
29
-7
29 pointed to by p[i]; Finally, it frees the memory for each
(a) e (b) e
row and then frees the memory for the array of pointers
-5 -3
(c) e 29
(d) e 29 itself.
UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 482 YCT
 Search on TG: @apna_pdf
75. Which is not a basic approach to the problem 78. Consider a disk system with cylinders. The
of conflict resolution in a production system? request to access the cylinders occurs in the
(a) Assigning a preference based on the rule that following sequence.
matched 4,34,10,7,19,73,2,15,6,20
(b) Assigning a preference based the object that Assuming that the head is currently at cylinder
matched 50, what is the time taken to satisfy all request
(c) Assigning a preference based on the action if it takes 1 ms to move from one cylinder to
that the matched rule would perform adjacent one ans shortest seek time first policy
(d) Assigning a preference based on the action is used?
that the matched object would perform (a) 119 (b) 120
(c) 142 (d) 146
Ans. (d) : In a production system, conflicts are typically
resolved by considering factors such as the rule that Ans. (a) : Using the shortest seek Time first (SSTF?)
matched, the objects involved, or the actions that the policy, we select the next cylinder to move to based on
matched rules would perform. Assigning preference the shortest seek time from the current position.
based on the action that the matched object would
perform does not directly address the conflict resolution
within the system's rule-based framework. This
approach might be less common because it's not directly
tied to the rule-based logic of the system.
76. Match List I with List II
LIST I LIST II
A. A ∆ B I. ( A − B) ∪ ( A − C ) 1 ms to move from one cylinder to adjacent one.
Seek time
B. A − ( B ∪ C) II. ( A − B) ∩ ( A − C )
= {( 50 − 34 ) + ( 34 − 20 )( 20 − 19 ) + (19 − 15 ) +
C. A − ( B I C) III. ( A − B) ∪ ( B − A ) (15 − 10 ) + (10 − 7 ) + ( 7 − 6 ) + ( 6 − 4 )
D. A I ( B − C) IV. ( A ∩ B) − ( B ∩ A ) ( 4 − 2 ) + ( 73 − 2 )}×1
Choose the correct answer from the option (16 + 14 + 1 + 4 + 5 + 3 + 1 + 2 + 2 + 71) ×1 = 119 ms
given below:
(a) A-III B-II C-I D-IV (b) A-II B-III C-IV D-I 79. Consider the rectangle with vertices (0,0), (0,2),
(3,0) (3,2). There is scaling of 2 towards x-axis
(c) A-IV B-III C-I D-II (d) A-IV B-I C-III D-II
and 3 towards y-axis. The new coordinates of
Ans. (a) Correct match- the rectangle are
LIST I LIST II (a) (0,0), (6,0), (0,4), (6, 4)
A. A∆B III. ( A − B ) ∪ ( B − A ) (b) (0,0), (6,0), (0,4), (3, 2)
(c) (0,0), (6,0), (0,6), (6, 6)
B. A − ( B ∪ C) II. ( A − B) ∩ ( A − C ) (d) (0,0), (4,0), (0,6), (4, 6)
C. A − ( B I C) I. ( A − B) ∪ ( A − C ) Ans. (c) : To find new coordinates after. scaling you
multiple each coordinate by the scaling factor.
D. A I ( B − C) IV. ( A ∩ B ) − ( B ∩ A ) For the x-axis scaling of 2 the new x - coordinates will
77. The clipping process in computer graphics is be twice the original ones, And for y-axis scaling of 3,
used for the new y-coordinates will be 3 times the original ones.
(a) Adding graphics Original rectangle vertices:
(b) Copying (0, 0), (0, 2), (3, 0), (3, 2)
(c) Zooming After scaling by 2 on the x- axis
(d) Removing objects and lines (02, 0), (02, 2), (32, 0), (32, 2)
= (0, 0) (0, 2) (6, 0) (6, 2)
Ans. (d) : The clipping process in computer graphics is
used to remove objects and lines or portions of objects After sealing by 3 on the y - axis:
that fall outside the viewing area or viewport, ensuring (0, 03), (0, 23), (3, 03), (3, 23)
only the necessary parts are rendered. It helps optimize = (0, 0), (0, 6), (3, 0), (3, 6)
rendering and improves performance by not processing So, the new coordinates of the rectangle are:
unnecessary data. (0, 0), (6, 0), (0, 6), (6, 6)

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 483 YCT
 Search on TG: @apna_pdf
80. Which of the following transforms in 2 Ans. (a) : Analyze each statements:
dimension is used to resize a 2-dimensional (A) In any monoid, there exists a unique identity
object? element. This element is such that when combined with
(a) Translation (b) Rotation any other element in the monoid, it leaves the other
(c) Scaling (d) Shearing element unchanged. So, the statement (A) is correct.
(B) A monoid is indeed a group if there exists an in
Ans. (c) : Scaling transformation refer to the process of
verse for each element of the monoid. This is one of the
resizing an object or an image in a coordinate system. It defining properties that distinguishes a monoid from a
involves multiplying the coordinates of each point in the group so, the statement (B) is correct.
object by a scale factor to either enlarge or reduce its (C) A semigroup only needs to have closure and
size. Scaling transformation in 2 dimension is used to associativeity properties. The property of identity is not
resize a2-dimensional object. necessary for a structure to be considered a semigroup.
81. In the standard Ethernet with transmission So, the statement (C) is incorrect.
rate of 10 Mbps, assume that the length of the (D) Quasi- groups do have the closure property. This
medium is 2500m and size of a frame is 512 means that for any two elements in the set, their
bytes. The propagation speed of a signal in a operation results in another element that is also in the
cable is normally 2 × 103 m/s. The transmission set, So, the statement (D) is correct.
delay and propagation delay are 83. What is the output of following code?
(a) 25.25 µs and 51.2 main ()
{static float a[ ] = {13, 24, 1.5, 4.5, 5.4, 3.5}
(b) 51.2 µs and 12.5
float *j, *k;
(c) 10.24 µs and 50.12 j = a;
(d) 12. 5 µs and 51.2 k=a+4
Ans. (b) : To calculate the transmission delay, we first j = j *2;
need to find time it takes to transmit one frame. using k = k/2
the formula. printf ("%f%f', *j, *k);
size of frame }
Transmission delay = (a) 13, 25, 4.5
Transmission rate
(b) 1.5, 3.5
512 bytes
= = 51.2 µs (c) 13,24, 1.5, 4.5, 5.4, 3.5
10 Mbps (d) lllegal use of pointer in main function
for the propagation delay, using formula- Ans. (d) : Given code has several syntax errors. The
length of medium code indeed contains illegal use of pointers in the 'main
Propagation delay= ()' function. Specifically, the lines j = j * 2; and 'k = k/2;
Propagation speed
are attempting to perform arithmetic operations directly
2500 m on pointer variables, which is not allowed in C.
=
2 ×108 m / s 84. If A = {4n + 2 n is natural number} and B = {3n
= 12.5 µs n is a natural number}. Which of the following
So, the transmission delay is 51.2 microseconds and the is correct for A ∩ B?
propagation delay is 12.5 microseconds. (a) {12n2 + 6n n is a natural number}
(b) {24n – 12 n is a natural number}
82. Consider the following statements.
(c) {60n + 30 n is a natural number}
A. The identity is unique in any monoid
(d) {12n – 6 n is a natural number}
B. A monoid is a group if there exists inverse
Ans. (d) : Given that,
of each element of monoid
A = {4n + 2 n is a natural number}
C. Semi group has closure, associative and
A = {6, 10, 14, 18, 22.....} where n = 1, 2, 3, 4, 5....
identify properties
B = {3n n is a natural number}
D. Quasi group has closure property
= (3, 6, 9, 12, 15, 18,....} where n = 1, 2, 3, ......
Choose the correct answer from the options
Then,
given below.
A ∩ B = {6,18,.....}
(a) A, B and D only (b) B, C and D only
(c) A, B and C only (d) A, C and D only A ∩ B = {12n − 6 n is a natural number}

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 484 YCT
 Search on TG: @apna_pdf
85. Match List I with List II (a) Both Statement I and Statement II are correct
LIST I LIST II (b) Both Statement I and Statement II are
incorrect
A. The running time of I. O (n2)
(c) Statement I is correct but Statement II is
straight forward
incorrect
recursive method to
(d) Statement I is incorrect but Statement II is
compute nth Fibonacci
correct
number Fn
Ans. (b) : Statement I - If f = O(g), it means that the
B. The running time to II. O(lg n) growth rate of f is bounded above by the growth rate of
compute Fn using g up to a constant factor. However, if g ≠ o(f), it means
memorization that g does not grow significantly slower than f. We can
C. The running time to III. O (n) not conclude that the growth rate of g is smaller than
compute Fibonacci that of f, but rather that the growth rate of f is not
number Fn using only strictly larger than that of g. So, the statement I is
integer addition and incorrect.
multiplication Statement II:- The class of all decision problems
decided by a Turing Machine (TM) in exponential time
D. The running time to IV. θ( φn) is typically denoted by EXP, and it is associated with
determine an optimal O(2poly(n)), where 'poly(n)' represents a polynomial in the
bitonic tour input size n. So, the statement II is incorrect.
Choose the correct answer from the option 87. 256 Mb DRAM is organized as a 32 M × 8
given below : memory externally and as a 16K × 16K square
(a) A-I B-III C-IV D-II array internally. Each row must be refreshed
(b) A-IV B-III C-II D-I at least once every 50 mili second to forestall
(c) A-I B-II C-IV D-III loss of data: refreshing one row takes 100
nanoseconds. What fraction of the total
(d) A-IV B-II C-III D-I
memory bandwidth is lost to refresh cycles?
Ans. (b) Correct match- (a) 6.6% (b) 3.3%
LIST I LIST II (c) 9.9% (d) 4.3%
A. The running time of straight IV. θ( φ )n Ans. (b) : To calculate the fraction of total memory
forward recursive method to bandwidth lost to refresh cycles, we need to consider
compute nth Fibonacci the time spent or refreshing compared to the time
number Fn available.
Find out how many row are there in the DRAM-
B. The running time to compute III. O (n)
Fn using memorization Total memory size
Number of Rows =
Number of columns
C. The running time to compute II. O(lg n)
Fibonacci number Fn using 256 MB × 8
Number of rows = = 64
only integer addition and 32 MB
multiplication Now, calculate the time required to refresh all rows-
2
D. The running time to determine I. O (n ) Total Refresh Time = Number of Rows × Time to
an optimal bitonic tour Refresh one Row
86. Given below are two statements: = 64 × 100 ns
Statement I: If f and g are two function and f = = 6400 ns
O(g) but g ≠ o(f), we say that the growth rate of Find the fraction of time lost to refresh cycles-
g is smaller than that of f Total Refresh Time
Fraction of Time Lost = ×100
Statement II: The class of all decision problems Refresh Cycle Time
decided by a TM in exponential time, that is
6400 ns
O(2k), k being a constant. = ×100 ≈ 3.3%
50 ms
In the light of the above statement, choose the
most appropriate answer from the options So, approximately 3.3% of the total memory bandwidth
given below. is lost to refresh cycles.

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 485 YCT
 Search on TG: @apna_pdf
88. Given below are two statements: Ans. (a) : A cross compiler is a compiler capable of
Statement I: subsystem models show logical creating executable code for a platform other than the
grouping of objects into coherent subsystem one on which the complier is running, for example, a
Statement II: State machine models show how compiler that runs on a PC but generates code that runs
objects change their states in response to or Android devices is a cross compiler.
events. 91. Consider the following program fragment that
In the light of the above statements, choose the deals with T with 17 rows and 1024 columns,
most appropriate from the options given computing an average for each column and
below: printing it to screen (i is row index and j is
(a) Both Statement I and Statement II are correct column index):
(b) Both Statement I and Statement II are
for j = [0.... 1023]{
incorrect
temp = 0;
(c) Statement I is correct but Statement II is
incorrect for i =[0...16];
(d) Statement I is incorret but Statement II is temp = temp + T [i] [j];
correct print (temp/17.0;}
Ans. (a) : Subsystem models help organize objects into T [i] [j] and temp are 32 bit floating point
meaningful groups within a larger system, making it values and memory is word addressable. the
easier to understand and manage complex systems state temporary variable temp is kept in a processor
machine models are a powerful way to illustrate the register so access to temp does not involve a
behavior of objects within a system by defining the memory reference. The main memory is page
states they can be in and the transitions between those and holds 16 pages of size 1024 words, the page
states triggered by events. So, the both statement I and replacement policy is "least recently used", If T
II are correct. is stored in the virtual address space in row
89. Given below are two statement; one is labelled major format.
as Assertion A and the other is labelled as Consider again that T is stored in column-
Reason R. major format, what is the main memory hit
Assertion A: It is possible to create doubly ratio?
linked list using only one Pointer with every (a) 80% (b) 95.6%
node. (c) 97.8% (d) 99.9%
Reason R: By storing the XOR of the addresses Ans. (d) : The main memory holds 16 pages and each
of the previous and next nodes. page holds 1024 words, it can store a total of 16 × 1024
In the light of the above statement. choose the = 16384 words.
most appropriate answer from the option given
In column-major format, for each column, there are 17
below.
accesses (one for each row), with 1024 columns, there
(a) Both A and R are true and R is the correct
will be 1024 × 17 = 17408 accesses in total.
explanation of A
However, since the main memory can only hold 16384
(b) Both A and R are true but R is NOT the
correct explanation words, some accesses will result in page faults.
(c) A is true but R is false Total accesses
Number of page faults =
(d) A is false but R is true Words per page
Ans. (a) : Assertion A and Reason R are true and 17408
Reason R is the correct explanation of Assertion A. = = 17
1024
Storing the XOR of the addresses of the previous and
next nodes allows traversal in both directions using a The hit ratio is then calculated as the ratio of the
single pointer, enabling the creation of a doubly linked number of accesses that did not result in page fault to
list with one pointer per node. the total number of accesses.
90. The compiler for high level language that runs ( Total accesses − Number of page faults )
Hitratio = × 100
on one machine and produces code for other Total accesses
machine is called-
(17408 − 17 )
(a) Cross compiler = × 100 = 99.9%
(b) Multipass compiler 17408
(c) Optimizing Compiler So, the main memory hit ratio in column- major format
(d) One pass Compiler is 99.9%

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 486 YCT
 Search on TG: @apna_pdf
92. Consider the following program fragment that There are 1024 columns and 17 rows.
deals with T with 17 rows and 1024 columns, so, the total number of page faults would be
computing an average for each column and = 1024 × 17
printing it to screen (i is row index and j is = 17408.
column index): 94. Consider the following program fragment that
for j = [0.... 1023]{ deals with T with 17 rows and 1024 columns,
temp = 0; computing an average for each column and
for i =[0...16]; printing it to screen (i is row index and j is
temp = temp + T [i] [j]; column index):
print (temp/17.0;} for j = [0.... 1023]{
T [i] [j] and temp are 32 bit floating point temp = 0;
values and memory is word addressable. the for i =[0...16];
temporary variable temp is kept in a processor temp = temp + T [i] [j];
register so access to temp does not involve a print (temp/17.0;}
memory reference. The main memory is page T [i] [j] and temp are 32 bit floating point
and holds 16 pages of size 1024 words, the page values and memory is word addressable. the
replacement policy is "least recently used", If T temporary variable temp is kept in a processor
is stored in the virtual address space in row register so access to temp does not involve a
major format. memory reference. The main memory is page
Consider that T is stored in column major and holds 16 pages of size 1024 words, the page
format, how many page faults will be replacement policy is "least recently used", If T
encountered? is stored in the virtual address space in row
(a) 14 (b) 15 major format.
What is fault ratio of row major to column
(c) 16 (d) 17
major arrangements?
Ans. (d) : See the above explanation. (a) 1024:1 (b) 1301:1
93. Consider the following program fragment that (c) 1240:1 (d) 9107:8
deals with T with 17 rows and 1024 columns, Ans. (a) : For the row-major arrangement:
computing an average for each column and
Each row contains 1024 contiguous memory locations.
printing it to screen (i is row index and j is
Accessing each column sequentially would result in a
column index): page fault every 1024 accesses, Since there are 1024
for j = [0.... 1023]{ columns, there would be 1024 page faults.
temp = 0; For the column-major arrangement:
for i =[0...16]; Each column contains 17 contiguous memory
temp = temp + T [i] [j]; locations. Accessing each column sequentially would
print (temp/17.0;} result in a page fault every 17 accesses.
T [i] [j] and temp are 32 bit floating point Both arrangements result in the same number of page
values and memory is word addressable. the faults, 1024. Therefore, the fault ratio of row major to
temporary variable temp is kept in a processor column major arrangements is 1024:1.
register so access to temp does not involve a 95. Consider the following program fragment that
memory reference. The main memory is page deals with T with 17 rows and 1024 columns,
and holds 16 pages of size 1024 words, the page computing an average for each column and
replacement policy is "least recently used", If T printing it to screen (i is row index and j is
is stored in the virtual address space in row column index):
major format. for j = [0.... 1023]{
How many page faults will be encountered? temp = 0;
(a) 16,402 (b) 17,408 for i =[0...16];
(c) 18,208 (d) 18,608 temp = temp + T [i] [j];
Ans. (b) : Each column spans 17 pages. main memory print (temp/17.0;}
can hold only 16 pages at a time. T [i] [j] and temp are 32 bit floating point
Therefore, for each column, there will be values and memory is word addressable. the
17 – 16 = 1 page fault. temporary variable temp is kept in a processor

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 487 YCT
 Search on TG: @apna_pdf
register so access to temp does not involve a 98. IP datagram has arrived with following partial
memory reference. The main memory is page information in the header (in hexadecimal)
and holds 16 pages of size 1024 words, the page 45000054000300002006....
replacement policy is "least recently used", If T What is the size datagram?
is stored in the virtual address space in row (a) 64 bytes
major format. (b) 74 bytes
What is the main memory hit ratio? (c) 84 bytes
(a) 0 (b) 1 (d) 104 bytes
(c) 2 (d) 3
Ans. (c) : In hexadecimal, this field typically occupies
Ans. (a) : In row-major order, each row is accessed bytes 3 and 4 of the header. From the partial
once for each column iteration since there are 17 rows information provided, the total length field is
and 1024 columns, there will be 17 unique pages represented by '0054' in hexadecimal. Which in
accessed per column iteration. Therefore, for 1024 hexadecimal equals 84 in decimal. Therefore, the size of
column iterations, the total number of unique pages the datagram is 84 bytes.
accessed will be 1024 × 17 = 17408 pages. 99. IP datagram has arrived with following partial
Since, the main memory holds 16 pages, and the LRU information in the header (in hexadecimal)
page replacement policy will replace the least recently 45000054000300002006....
used page when a new page is accessed, only the most
What is the header size?
recently used pages will remain in memory.
(a) 10 bytes
Number of pages in memory (b) 20 bytes
Hit ratio =
Total number of unique pages accessed (c) 30 bytes
16 (d) 40 bytes
=  0.000918
17408 Ans. (b) : In the given partial information the internet
So, the main memory hit ratio is approximately 0 (zero) header length (IHL) field is represented by the first
nibble (4 bits) of the second byts. The second byte is
96. IP datagram has arrived with following partial
'05' in hexadecimal, since the IHL field is measured in
information in the header (in hexadecimal)
32 bit words.
45000054000300002006....
header length = 5 × 4 = 20 bytes
How many more routers can the packet travel
So, the header size is 20 bytes.
to?
(a) 22 (b) 26 100. IP datagram has arrived with following partial
information in the header (in hexadecimal)
(c) 30 (d) 32
45000054000300002006....
Ans. (d) : The Time-to-Live (TTL) field represents the
What is the efficiency of this datagram?
number of routers, the packet can traverse before being
(a) 76.19%
discarded. In hexadecimal, the TTL field is typically
represented by the 9th byte in the header. In the given (b) 80.50%
partial information, the 9th byte is '20'. Which in (c) 82.24%
hexadecimal equal 32 in decimal. So, the packet can (d) 85.45%
travel through 32 more routers before being discarded. Ans. (a) : Given that-
97. IP datagram has arrived with following partial Total length of the datagram = 84 bytes
information in the header (in hexadecimal) The header size = 20 bytes
45000054000300002006.... Payload size = Total length – Header size
What is the protocol of the payload being = 84 – 20
carried by the packet? = 64 byte
(a) ICMP (b) SCTP Now, calculate the efficiency-
(c) TCP protocol (d) IGMP Payload size
Efficiency = × 100
Ans. (c) : In hexadecimal, the protocol field is typically Total length
represented by the 10th byte in the header. In the given
64
partial information, the 10th byte is '06', which in = × 100
hexadecimal equals 6 in decimal. The value '6' 84
corresponds to the TCP protocol. Therefore, the payload = 76.19%
being carried by the packet is using the TCP protocol. So, the efficiency of the datagram is 76.19%.

UGC NTA NET JRF Comp. Science June 2023 (Ex. 17.06.2023) 488 YCT
 Search on TG: @apna_pdf

U.G.C. NET Exam. December 2023

COMPUTER SCIENCE
(Solved with Explanation) (Exam : 07.12.2023)
1. What is the probability that a positive integer Ans. (a) : AVL tree is a balanced tree. AVL tree's time
selected at random from the set of positive complexity of searching = θ (log n) But a binary search
integer not exceeding 100 is divisible by either 2 tree may be a skewed tree, so in the worst case Binary
or 5? search tree searching time = O(n).
(a) 10/5 (b) 3/5 4. What is the result of evaluating the postfix
(c) 2/5 (d) 1/5 expression "43*25*+b-"?
(a) 8 (b) 14
Ans. (b) : Number of positive integers divisible by 2 in
(c) 10 (d) 5
100.
Number of positive integers divisible by 5 in 100. Ans. (*) : The given postfix expression "43*25*+b–" is
invalid so, UGC dropped this question.
So, 100/5 = 20
5. Which of the following circuit is used to store
Number of positive integers divisible by both 2 and 5
one bit of data?
in 100.
(a) Encoder (b) Decoder
So, 100/10 = 10
(c) Flip-Flop (d) Register
Therefore, the total number of positive integers divisible
Ans. (c) : A flip-flop is a fundamental digital electronic
by either 2 or 5 in 100. component used in digital circuits to store binary data. It
50 + 20 – 10 = 60 is capable of storing one bit of data, which can be either
So, the probability is the number of favorable outcomes 0 or 1. Filp - flops are widely used in various digital
(60) divided by the total number of outcomes (100). systems such as computers, microcontrollers and
60 3 communication devices to store and manipulate data.
So, = 6. Identify the code sequence :
100 5
1010 1011 1001 1000
2. Which of the following is not a palindromic
(a) BCD (b) Excess-3
subsequence of the string "ababcdabba"?
(c) Gray (d) Excess-3 gray
(a) abcba (b) abba
Ans. (c) : The Gray code is a sequence of binary
(c) abbbba (d) adba number systems, which is also known as reflected
Ans. (d) : A palindromic subsequence is a sequence of binary code. The reason for calling this code as
characters within a larger sequence that reads the same reflected binary code is the first N/2 values compared
backward as forward. Unlike a palindrome, which must with those of the last N/2 values in reverse order. In this
be read in order, a palindromic subsequence can have code, two consecutive value are differed by one bit of
characters in any order as long as they appear binary digits.
consecutively in the same order as in the original The gray code is a very light weighted code because it
sequence. The given string is "ababcdabba". from this doesn't depend on the value of the digit specified by the
position. This code is also called a cyclic variable code
string 'adba' is not a palindromic subsequence.
as the transition of one value to its successive value
3. Which of the following is TRUE? carries a change of one bit only. Example-
(a) The cost of searching an AVL tree is θ (log n) Decimal Number Binary code Gray code
but that of binary search is 0(n)
10 1010 1111
(b) The cost of searching an AVL tree in θ (log n)
11 1011 1110
but that of complete binary tree is θ (n log n)
12 1100 1010
(c) The cost of searching a binary tree is 0(log n)
13 1101 1011
but that of AVL tree is θ (n)
14 1110 1001
(d) The cost of searching an AVL tree is θ (n log n)
15 1111 1000
but that of binary search tree is 0(n)
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 489 YCT
 Search on TG: @apna_pdf
7. The microoperation which divides a signed New P = (0.0 – (10, 4)) × 4 + (10,4)
binary number by 2 is : = (–10, –4) × 4 + (10, 4)
(a) Circular shift (b) Logical shift = (–40, –16) + (10, 4)
(c) Arithmetic shift right (d) Arithmetic shift left = (–30, – 12)
Ans. (b) : Shift micro-operations are those micro- For point Q:
operations that are used for the serial transfer of New Q = (2, 2 –(10, 4)) × 4 + (10, 4)
information. = (–8, -2) × 4 + (10, 4)
A Logical shift is a bitwise operation where the bits in = (–32, –8) + (10, 4)
a binary number are shifted left or right by a certain
= (–22, – 4)
number of position. In logical shift, the empty bit
So, the coordinates of the magnified triangle are: P (–
positions are filled with zeros.
30, –12), Q (–22, –4) and R (10, 4).
(i) Logical left shift- One position moves each bit to the
left one by one. The empty least significant bit (LSB) is 10. Which of the following statements is TRUE?
filled with zero and the most significant bit (MSB) is (a) Virtual functions do not implement
rejected. Every time we shift a number to words the left polymorphism
by 1 bit it multiplies that number by 2. (b) Virtual functions do not permit calling of
(ii) Logical Right shift- Each bit move to the right one derived class functions using a base class
by one and the LSB is rejected and the empty. MSB is pointer
filled with zero. Every time we shift a number towards (c) We can never build an object from a class
the right by 1 bit divides that number by 2. containing a pure virtual function
8. A program that is used by other routines to (d) Pure virtual functions can never have a body
accomplish a particular task, is called : Ans. (c) : A pure virtual function is a function that is
(a) Micro program (b) Micro operation declared in a base class but does not have an
(c) Routine (d) Subroutine implementation in that base class. Instead, it must be
Ans. (d) : A program that is used by other routine to implemented in any non-abstract derived class, classes
accomplish a particular task, is called 'subroutine' or containing pure virtual function are considered abstract
'function'. A subroutine, also known as a method, classes, and you cannot create objects directly from
procedure, is a set of instructions designed to perform a them. You need to derive build from them and
frequently used operation within a program. They can implement the pure virtual functions to instantiate
accept arguments, perform, Specific operations and objects.
often return a result. 11. What is the output of the following program?
9. Consider a triangle PQR with coordinates as #include<stdio.h>
P(0, 0), Q(2, 2) and R(10, 4). If this triangle is to int main( )
be magnified to four times its size while
{ int i = 3;
keeping R(10, 4) fixed, then the coordinates of
While (i – –)
the magnified triangle are :
{ int i = 10;
(a) (-20, -12), Q(-20, -4) and R(10, 4)
i––;
(b) (-30, -12), Q(-22, -4) and R(10, 4)
printf("%d", i);
(c) (-25, -10), Q(22, -4) and R(10, 4)
(d) (30, -12), Q(-20, 4) and R(10, 4) }
printf("%d", i);
Ans. (b) : To magnify the triangle 4 times its size while
keeping point R fixed at (10,4), we can use the }
following formula to final the coordinates of the other (a) 990 (b) 9990
two points. (c) 999 – 1 (d) 99 – 1
New coordinate = (old coordinate- fixed point) × Ans. (c) : In this program, there are two variables
magnification factor + fixed point named 'i'. One is declared in the outer scope of the
Let's calculate the new coordinates for points P and Q - 'main' function and initialized to 3. The other one is
for point P: declared inside the while' loop and initialized to 10.

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 490 YCT
 Search on TG: @apna_pdf
During the execution of the while loop, the inner 'i' 15. A system bus in which each data item is
(Initialized to 10) is decremented by 1 and printed 9, transferred during a time slice known in
and then the loop condition is cheeked with the outer 'i'. advance to both units source and destination is
This loop, continues until the outer 'i' because 0. After called:
the loop the outer 'i' will be decremented one more time (a) MIMD (b) DMA
due to the post-decrement in the loop condition, So it
(c) asynchronous bus (d) synchronous bus
will become–1. , the outer 'i' is printed outside the loop.
Ans. (d) : Data transfers over the system bus may be
So, the output of the program will be 999-1.
synchronous or asynchronous. In a synchronous bus,
12. The Hue of a colour is related to its :
each data item is transferred during a time slice known
(a) Luminance (b) Saturation
in advance to both source and destination units.
(c) Incandescence (d) Wavelength Synchronization is achieved by driving both units from
Ans. (d) : The Hue refers to the attribute of a color that a common clock source. An alternative procedure is to
allows it to be classified as red, blue, green, etc., and it have separate clocks of approximately the same
corresponds to the dominant wavelength of light that is frequency in each unit. Synchronization signals are
perceived. Shorter wavelength are associated with transmitted periodically in order to keep all clocks in
cooler hues like blue and longer wavelengths with
the system in step with each other.
warmer hues like red. So, the hue of a colour is related
16. What is the output of the following program?
to its wavelength.
# include <stdio .h>
13. "CREATE TABLE T" in SQL is an example
of : # define SQR(x) (x*x)
(a) Normalization (b) DML int main ( )
(c) DDL (d) Primary key { int a, b = 3;
Ans. (c) : SQL is a standard database language used to a = SQR (b + 2);
access and manipulate data in databases. SQL was printf("%d", a);
developed by IBM computer scientists in the 1970s. return 0;
There are several types of SQL statemants- }
(i) Data Definition Language (DDL) (a) 25 (b) 11
(ii) Data Manipulation Language (DML) (c) Garbage value (d) 24
(iii) Data Query Language (DQL) Ans. (b) : In this program, The macro 'SQR (x)' is
(iv) Data control Language (DCL) defined as 'x * x'. In the ' main () function, 'b' is
(v) Transaction control Language (TCL) assigned the value 3. Then 'a' is assigned the result of
In DDL, used to define, modify and delete database 'SQR (b + 2)'.
objects such as tables, indexes, and views. Examples So, 'a' becomes 'b + 2 * b + 2', which is
include CREATE, ALTER, DROP
3+2×3+2
So, 'CREATE TABLE T' in SQL is an example of
= 3 + 6 + 2 = 11
DDL.
So, the output of the program will be 11.
14. An Address in main memory is called:
17. The head of a moving head disk with 200
(a) Virtual address (b) Memory address
tracks, numbered 0 to 199, has just finished a
(c) Logical address (d) Physical address
request at track 125, and currently serving a
Ans. (d) : An address in main memory is called a
request at track 143. The queue of requests is
location or physical address. The set of such locations is
given in the FIFO order as 86, 147, 91, 177, 94,
called the memory space, which consists of the actual
150, 102, 175, 130. What will be the total
main memory locations directly addressable for
number of head movements required to satisfy
processing. As on example, consider a computer with
these requests for SCAN algorithm?
main. memory capacity of 32M words. 25 bits are
needed to specify a physical address in memory since (a) 259 cylinders (b) 169 cylinders
32M = 225. (c) 154 cylinders (d) 264 cylinders

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 491 YCT
 Search on TG: @apna_pdf
Ans. (b) : Given the queue of requests in FIFO order: = 1.075 × 106 × 5
86, 147, 91, 177, 94, 150, 102, 175, 130. = 5.375 × 106 bytes
Sorted requests : 86, 91, 94, 102, 130, 147, 150, 175, So, the size of the whole page table is approximately
177. 5.375 MB.
Current nead position : 143 NOTE- Given question was some mistake so, UGC
Now, applying the SCAN algorithm- dropped the question.
19. In Linux, where is he user password stored?
(a) / etc / passward
(b) / root / passward
(c) / etc / passwd
(d) / root / passwd
Ans. (c) : In Linux systems, user passwords are
typically stored in the '/etc/ passwd' file. This file is
readable by all users on the system. It stores encrypted
passwords and other security - related information for
user accounts.
20. Has functions are used to produce the message
digests which are then encrypted with a private
Total head movements = (147 – 143) + (150 – 147) +
key to get:
(175 – 150) + (177 – 175) + (177 – 86) + (91-86)+ (94 –
91) + (102 – 94) + (130 – 102) (a) Public key
= 4 + 3 + 25 + 2 + 91 + 5 + 3 + 8 + 28 (b) Digital signature
= 169 tracks (c) Cipher text
Therefore, the total number of head movements (d) Data Encryption Standard
required so satisfy these requests for the SCAN Ans. (b) : Hash functions are commonly used to
algorithm with 169 cylinders is 169 tracks. produce message digests, which are then encrypted with
a private key using a process called digital signing to
18. Given as 4 GB (≈ ≈ 4.3×
×10 bytes) of virtual space
9
create a digital signature. This ensures the integrity and
and typical page size of 4 KB and each page
authenticity of the message.
table entry is 5 bytes. How many virtual pages
world this imply? What is the size of whole 21. Let L = {ab, aa, baa}. Which of the following
page table? strings are not in L*.
(a) 107500 and 20480 bytes (a) abaabaaabaa (b) aaaabaaaa
(b) 215000 and 40960 bytes (c) baaaaabaaaab (d) baaaaabaa
(c) 10750 and 10240 bytes Ans. (c) : Any combination of strings in set {ab, aa,
(d) 43000 and 1024 bytes baa} will be in L*.
Ans. (*) : Given- (a) "abaabaaabaa" can be partitioned as a combination
of strings in set {ab, aa, baa}. The partitions are "ab
Total virtual space = 4.3 × 109 bytes
aa baa ab aa''
page size = 4 KB = 4 × 103 bytes
(b) "aaaabaaaa" can be partitioned as a combination of
Number of virtual pages = Total virtual space/page size
strings in set {ab, aa, baa}. The partitions are "aa ab
4.3 × 109 bytes
= aa aa"
4 × 103 bytes (c) "baaaaabaaaab" cannot be partitioned as a
= 1.075 × 106 combination of strings in set {ab, aa, baa}
So, there are approximately 1.075 million virtual pages. (d) "baaaaabaa" can be partitioned as a combination of
Given: Size of each page table entry = 5 bytes strings in set {ab, aa, baa}, The partitions are " baa
Size of page table = Number of virtual pages X size of aa ab aa"
*
each page table entry. So, string' baaaaabaaaab' is not in L .

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 492 YCT
 Search on TG: @apna_pdf
22. Let A = {a, b} and L = A*. Let x = {anbn, n>0}. 25. Which data structure is typically used to
The languages L U X and X are respectively: implement hash table?
(a) Not regular, Regular (a) Linked list (b) Array
(b) Regular, Regular (c) Binary Tree (d) Stack
(c) Regular, Not regular Ans. (b) : A Hash table is a data structure that stores
(d) Not Regular, Not Regular some information and the information has basically two
Ans. (c) : Given- main components, i.e. Key and value. The most
A = {a, b} commonly used data structure to implement a hash table
L = A* is an array. The efficiency of mapping depends upon the
n n
X = {a b , n > 0}, efficiency of the hash function used for mapping.
The language L U X is regular because it is the union of 26. Which collision resolution technique involves
two regular languages, L = A* and x = {an bn, n > 0}, maintaining a linked list of collided keys?
and regular languages are closed under union. (a) Linear probing (b) Quadratic probing
language X is not regular because it represents the (c) Chaining (d) Double hashing
language of strings is the form anbn for n> 0, which
Ans. (c) : Chaining is a collision resolution technique
cannot be recognized by a finite automation due to the
used in hash tables. In chaining, when a collision occurs
requirement to count the number of a's and b's and
(two keys hash to the same index), the collided keys are
ensure they are equal. Therefore, X is not regular.
stored in linked lists at that index. This allows multiple
23. Which of the following symbol table keys to be stored at the same location in the hash table.
implementation is best suited if access time is to
when searching for a key, the hash function is used to
be minimum?
find the correct index, and then the linked list at that
(a) Linear list (b) Search tree
index is traversed to find the desired key.
(c) Hash Table (d) Self organisation list
27. Consider the following functions:
Ans. (c) : Hash table implementations are best suited
for minimizing access time, especially for lookups and f ( n ) = 3n n
inserts, as they provide constant time average case
g (n) = 2 n
log n2
performance for these operations. Its access time is 0(1).
However, their performance can degrade if there are h ( n ) = n!
many collisions or if the hash function is poorly
Which of the following is true?
designed.
(a) h(n) is 0 (f(n)) (b) h(n) is 0 (g(n))
24. Consider a Grammar E → E + n E × n  n for (c) g(n) is not 0 (f(n)) (d) f(n) is 0 (g(n))
a sentence n + n × n, the handles in the right
sentential form of the reduction are? Ans. (d) : Given f(n) = 3n n
(a) n, E + n and E + n × n g (n) = 2 n log n2
(b) n, E + n and E + E × n If f(n) = 0(g (n)), it means that f(n) grows no faster than
(c) n, n + n and n + n × n g (n)
(d) n, E + n and E × n Comparing the growth rates, we observe that as n
Ans. (d) : Given the grammar- approaches infinity, the exponential tern in g (n) 2( ) n

E → E + n E×n n
For a sentence n + n × n, the handles in the right-
will dominate over the polynomial term in f(x) (3n ) .
n

sentential form of the reduction are- Therefore, f(n) = 0(g(n)) is true

E→E×n {Applying E → E × n} So, the correct option is (d) f(n) is O(g(n)).
→E+n×n {Applying E → E + n} 28. 2 – 3 – 4 trees are B – trees of order 4. They are
→n+n×n {Applying E → n} isometric of _______trees.
Hence, the handles in right sentential form is n, E + n (a) AVL (b) AA
and E × n. (c) 2 – 3 (d) Red-Black
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 493 YCT
 Search on TG: @apna_pdf
Ans. (d) : 2 – 3 – 4 tree (also called a 2 – 4 tree) is a Ans. (c) : Test suite is a container that has a set of tests
self-balancing data structure that can be used to which helps testers in executing and reporting the test
implement dictionaries. 2 – 3 – 4 trees are B-trees of execution status. It can take any of the three states
order 4, like B-trees in general, they can search, insert namely Active, Inprogress and completed, A Test case
and delete in 0 (log n) time, 2 – 3 – 4 trees are can be added to multiple test suites and test plans. After
isomorphic to Red-Black trees, meaning that they are creating a test plan , test suites are created which in turn
equivalent data structures. In other words, for every 2 – can have any number of tests. Test suits are created
3 – 4 tree, there exists at least one and at most one red- based on the cycle or based or the scope. It can contain
black tree with data elements in the same order.
any type of tests, functional or Non- functional.
29. The average time required to search a storage
33. A multiplexes combines for 100 Kbps channels
location in memory and obtain its contents is
using a time slot of 2 bits. What is the bit rate?
called:
(a) 100 Kbps (b) 200 Kbps
(a) Access time (b) Latency time
(c) Response time (d) Reading time (c) 40 Kbps (d) 1000 Kbps
Ans. (a) : The average time required to search a storage Ans. (*) : A time division multiplexing system
location in memory and abtain its contents is called Combines multiple channels by interleaving bits by
Access time. Access time is the interval between the time. The bit rate of the multiplexed channel is
beginning of one storage device access and the determined by The number of time slots and the bit rate
beginning of the subsequent access. of the individual channels.
Access time = Latency time + Transfer time. If we combine four 100 kbps channels using a
30. One of the purposes of using intermediate code time slot of 2 bits, the bit rate of the multiplexed
in compilers is to: channel can be calculated as follows.
(a) make parsing and semantic analysis simpler Bit Rate = FrameRate ×Number of Bits per frame
(b) improve error recovery and error reporting = 50000 frames/see× 8 bits/frame = 400 kbps
(c) increase the chances of reusing the machine So the correct option is = 400 kbps.
independent cede optimizer in other 34. Which of the following is not a field in TCP
compilers header?
(d) improve the register allocation (a) Sequence Number (b) Checksum
Ans. (c) : After semantic Analysis, the code is (c) Fragmentation offset (d) Window size
converted into intermediate code which is platform (os
Ans. (d) : Fragmentation offset is a field in the IP
+ hardware) independent, the advantage of converting
header, not in the TCP header. In the TCP header, the
into intermediate code is to improve the performance of
fields are sequence Number, checksum, and window
code generation and to increase the chances of reusing
the machine- independent code optimizer in other size, among others, but not fragmentation offset. TCP
compilers. So, option (c) is correct. operates at the transport layer, while fragmentation
31. The sum of minimum and maximum number occurs at the network layer (IP layer), where packets are
of final states for a Deterministic Finite divided into smaller fragments to fit into the maximum
Automata (DFA) having 'P' state is equal to: transmission unit (MTU) of the network.
(a) p (b) p – 1 35. In "bit stuffing", each frame begins and ends
(c) p + 1 (d) p + 2 with a bit pattern in hexadecimal?
Ans. (c) : The maximum number of final states for a (a) Ox8C (b) Ox6F
DFA can be total number of states itself and minimum (c) OxFF (d) Ox7E
would always be 1, as no DFA exists without a final Ans. (d) : In bit stuffing, each frame typically begins
state. Therefore, Then sum of minimum and maximum and ends with a specific bit pattern, not necessarily in
number hexadecimal. The purpose of this pattern is to enable the
32. Test suite is consist of : receiver to identify the start and end of the frame. In
(a) Set of defect cases some networking protocols, Such as HDLC (High-
(b) Set of boundary cases Level Data Link Control), each frame begins and ends
(c) Set of test cases with a special bit pattern, 01111110 or 0 × 7E in
(d) Set of nest cases hexadecimal. This pattern is a flag byte.

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 494 YCT
 Search on TG: @apna_pdf
36. Level - 0 DFD is also called as: f(1.5) = (1.5)2 – 4(1.5) + 4 = 0.25
(a) Use case Diagram (b) Sequence Diagram for x = 2.0
(c) Context Diagram (d) Prototype Diagram f (2.0) = (2.0)2 – 4 (2.0) + 4 = 0
Ans. (c) : In software engineering DFD (Data Flow for x = 3.0
Diagram) can be drawn to represents the system of f(3.0) = (3.0)2 – 4(3.0) + 4 =1
different levels of abstruction. DFD level - 0 is also for x = 4.5
called a context Diagram. It is a basic overview of the f (4.5) = (4.5)2 – 4 (4.5) + 4 = 6.25
whole system or process being analyzed or modeled. It The individual with x = 4.5 has the highest fitness value
is designed to be an at-glance view, showing the system of 6.25 and would likely be selected as the parent for
as a single high-level process, with its relationship to reproduction in one generation.
external entities. 40. In a feed forward neural network with the
37. What is the generic structure of Multi Agent following specifications:
System (MAS)? Input layer has 4 neurons, hidden layer has 3
(a) Single agent with multiple objectives neurons and output layer has 2 neurons using
the sigmoid activation function for given input
(b) Multiagents with a single objectives
values [0.5,0.8, 0.2, 0.6] as well as the initial
(c) Multiagents with diverse objectives and
weights for the connections.
communication abilities
(d) Multiagent with two objectives W1 : [ 0.1, 0.3, 0.5, 0.2] 
Ans. (c) : The generic structure of a multi Agent system
W2 : [ 0.2, 0.4, 0.6, 0.2] Input layer to
(MAS) typically involves multiagents with diverse W3 : [ 0.3, 0.5, 0.7, 0.2]
objectives and communication, abilities. This structure hidden layer weights
allows for interaction between multiple agents with W4 : [ 0.4, 0.1, 0.3] 
varying goals and the capability to communicate and  Hidden layer to output
collaborate to achieve those objectives.
W5 : [ 0.5, 0.2, 0.4]
layer weights
38. ∈X at
A_______ point of fuzzy set A is a point x∈
What is the output of the output layer when the
which µA (x) = 0.5
given input values are passed through neural
(a) Core (b) Support
network? Round the answer to two decimal
(c) Crossover (d) α – cut places:
Ans. (c) : A crossover point of fuzzy set A is a point (a) [0.62, 0.68] (b) [0.72, 0.78]
x∈x at which µA(x) = 0.5. This point represents the (c) [0.82, 0.88] (d) [0.92, 0.98]
boundary where an element is equally likely to be inside Ans. (a) : The proceed with the calculations-
or outside of the fuzzy set A. (i) weighted sum of inputs to the hidden layer neurons.
39. In a genetic algorithm optimization problem  Neuron 1 : 0.1 × 0.5 + 0.3 × 0.8 + 0.5 × 0.2 + 0.2 ×
the fitness function is defined as f(x) = x2 – 4x + 0.6 = 0.5
4. Given a population of four individuals with  Neuron 2 : 0.2 × 0.5 + 0.4 × 0.8 + 0.6 × 0.2 + 0.2 ×
values of x : {1.5, 2.0, 3.0, 4.5} What is the
0.6 = 0.78
fitness value of the individual that will be
 Neuron 3 : 0.3 × 0.5 + 0.5 × 0.8 + 0.7 × 0.2 + 0.2 ×
selected as the parent for reproduction in one
0.6 = 0.92
generation?
(ii) Apply the sigmoid activation function to the hidden
(a) 2.25 (b) 6.0
layer outputs:
(c) 0.0 (d) 6.25
1
Ans. (d) : To find the fitness value of each individual in  Neuron 1 : ≈ 0.622
1 + e −0.5
the population, we plug in the given values of x into the
fitness function f(x) = x2 – 4x + 4. 1
 Neuron 2 : ≈ 0.685
Given a population of four individuals with values of 1 + e −0.78
x : {1.5, 2.0, 3.0, 4.5} 1
 Neuron 3 : ≈ 0.715
for x = 1.5 1 + e −0.92

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 495 YCT
 Search on TG: @apna_pdf
(iii) weighted sum of input to the output layer neurons 42. If the universe of disclosure is set of integers,
using the outputs of the hidden layer. then which of the followings are TRUE?
Neuron 1 : 0.4 × 0.622 + 0.1 × 0.685 + 0.3 × 0.715 (A) ∀n ∃m (n2 < m)
= 0.557 (B) ∃n ∀m (n < m2)
Neuron 2 : 0.5 × 0.622 + 0.2 × 0.685 + 0.4 × 0.685 (C) ∃n ∀m (nm = m)
= 0.657 (D) ∃n ∃m (n2 + m2 = 6)
(iv) Apply the sigmoid activation function to the output (E) ∃n ∃m (n + m = 4 ∧ n – m = 1)
layer outputs : Choose the correct answer from the options
output layer output- given below:
(a) (A), (B) and (C) Only
1
Neuron 1 : ≈ 0.623 (b) (B) and (C) Only
1 + e −0.557
(c) (C), (D) and (E) Only
1 (d) (C) and (E) Only
Neuron 2 : ≈ 0.685
1 + e −0.657 Ans. (b) : If the universe of disclosure is set of integers,
So, the output of the output layer when the given input then.
values are passed through the neural network is (B) ∃n ∀m (n < m2):
approximately [0.62, 0.68]. This statement says "There exist an integer n such that
2
41. If universe of disclosure are all real number, for every integer m, n is less than m ." This statement is
then which of the following are true? actually true, for example, if n = –1, then for any
(A) ∃x ∀y (x + y = y) positive integer m, –1 is indeed less than m2.
(B) ∀x ∀y (((x ≽ 0) ∧ (y < 0)) → (x - y > 0)) (c) ∃n ∀m (nm = m): This statement says
(C) ∃x ∃y (((x ≼ 0) ∧ (y ≼ 0 )) ∧ (x - y > 0)) "There exists an integer n such that for every integer m,
(D) ∀x ∀y ((x # 0) ∧ (y # 0) ↔ (xy # 0)) nm equal m.' This statement is also true. If n= 1 then for
any integer m, 1m equals m.
Choose the correct answer form the options
given below: So, the statement (B) and (c) are ture.
(a) (A) and (B) Only 43. If N2 = N x N, N is set of natural numbers and
R is relation on N2, s.t. R C N2 x N2 i.e. <x, y> R
(b) (A), (C) and (D) Only
<u, v> ↔ xv = yu, then which of the followings
(c) (A), (B) and (D) Only
are TRUE?
(d) (A), (B), (C) and (D) Only
(A) Reflexive
Ans. (d) : Analyze each statement- (B) Symmetric
(A) ∃x ∀y (x + y = y): There exists some real number x (C) Transitive
such that for all real numbers y, x + y = y, This (D) Assymmetric
statement is true for x = 0 so, statement (A) is true. Choose the correct answer form the options
(B) ∀x ∀y (((x ≽ 0) ∧ (y < 0)) → (x - y > 0)): For all given below :
real x,y that if x is positive and y is negative then x –y is (a) (A) and (B) Only
positive. This is indeed true because if x is positive and
(b) (B) and (C) Only
y is negative, subtracting y from x will increase x and
thus will be positive. Therefore, statement (B), is true. (c) (A), (C) and (D) Only
(C) ∃x ∃y (((x ≼ 0) ∧ (y ≼ 0 )) ∧ (x - y > 0)): This (d) (A), (B) and (C) Only
statement asserts that there are some real numbers x and Ans. (d) : If N2 = N × N
y such that both x and y are negative and the difference N is set of natural number
x –y >0. This condition will be satisfied when y is more R is relation on N2
negative than x. so, statement (c) is true.
RCN2 × N2 < x,y > R <u, v> ⇔ xv = yu
(D) ∀x ∀y ((x # 0) ∧ (y # 0) ↔ (xy # 0)): This
The Relation R is follow the property Reflexive,
condition means that for all x and y, x and y can not
symmetric and transitive, but not Assymmetric because
zero. This condition is always true because in real
, for all (a, b) in N2, if (a,b) R (c,d) then it should not be
numbers, the product of two non-zero numbers is never the case that (c,d) R (a, b). Here, since the relation R is
zero, so, statement (D) is also true. not asymmetric.

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 496 YCT
 Search on TG: @apna_pdf
44. The interface (S) that provide (S) I/O transfer Choose the correct answer from the options
of data directly to and from the memory unit given below :
peripheral is/are termed as: (a) (A) Only
(A) DMA (Direct Memory Access) (b) (B) Only
(B) IOP (Input- Output Processor) (c) (A) and (B) Only
(C) Serial Interface (d) (C) and (D) Only
(D) Parallel Interface Ans. (c) : A tautology is a statement that is always true
Choose the correct answer from the options regardless of the truth values of its of its components.
given below : for example-
(a) (A) Only (P → (P ∧ Q)) → (P → Q)
(b) (B) Only This statement is a tautology because it's always true.
(c) (A) and (B) Only ((P → Q) → Q) → (P ∨ Q)
This statement is a tautology because it's always true.
(d) (C) and (D) Only
47. Consider the three points P1(1, 2, 0), P2(3, 6, 2)
Ans. (c) : DMA (Direct Memory Access) is an interface
and P3(2, 4, 6) and a view point C(0, 0, – 10).
that provides I/0 transfer of data directly to and from the
Choose the correct options.
memory unit and the peripheral. 'IOP (Input-Output
(A) P1 obscure P2, if viewed from C.
Process) is a specialized processed designed to manage
(B) P2 obscure P1, if viewed from C.
input and output operations in a Computer system. It
(C) P3 does not obscure P1, if viewed from C.
handles tasks such as data transfer between peripheral
(D) P2 does not obscure P3, if viewed from C.
devices and the CPU or memory.
Choose the correct answer from the options
So, the interface that provide I/0 transfer of data directly
given below:
to and from the memory unit peripheral are termed as.
(a) (A), (B) and (C) Only
DMA and IOP.
(b) (A), (C) and (D) Only
45. Which of the following (s) are main memory? (c) (B), (C) and (D) Only
(A) Virtual memory (d) (A), (B) and (D) Only
(B) Cache memory Ans. (b) : To determine which points obscure others
(C) RAM from the viewpoint C, need to calculate the depth of
(D) SSD each point relative to C. The depth can be computed
Choose the correct answer from the options using the distance formula.
given below : Depth of P1 (1, 2, 0) from C (0, 0, – 10)
(a) (A) and (C) Only 1 + 4 + 100 = 105
(b) (B) and (C) Only Depth of P2 (3, 6, 20) from C (0,0, –10)
(c) (C) and (D) Only
9 + 36 + 900 = 945
(d) (A), (B) and (C) Only
Depth of P3 (2, 4, 6) from C (0,0 – 10)
Ans. (b) : The main memory is the fundamental storage
4 + 16 + 256 = 276
unit in a computer system. It is associatively large and
The smaller the depth value, the closer the point is to
quick memory and saves programs and information
the viewer comparing the depth.
during computer operations. The technology that make
1. P1 is closer to C than P2. So, P1 obscure P2 from the
the main memory work is base on semiconductor
viewpoint C.
integrated circuits . It is also known as primary
2. P2 is farther to C than P1. so, P2 does not obscure P1
memory. RAM and cache memory is the main memory.
from the viewpoint C.
46. Which of the following are tautology? 3. P3 is closer to C than P1. so, P3 does not obscure P1
(A) (P → (P ∧ Q)) → (P → Q) from the viewpoint C.
(B) ((P → Q) → Q) → (P ∨ Q) 4. P2 is farther to C than P3. so, P2 does not obscure P3
∨ ¬ P) → Q) → ((P∨
(C) ((P∨ ∨ ¬ P) → R) from the viewpoint C.
(D) (Q → (P∧
∧ ¬ P)) → (R → (P∧
∧ ¬ P)) Thus, the statement (A), (C) and (D) are correct.

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 497 YCT
 Search on TG: @apna_pdf
48. Which of the statement are CORRECT? 50. Which of the following is/are NOT CORRECT
(A) Constructors are invoked automatically statement?
when the objects are created. (A) The first record in each block of the data
(B) Constructors do not have return types, not file is known as actor record.
even void and therefore they cannot return (B) Dense index has index entries for every
values. search key value in the data file.
(C) Constructors cannot be inherited though a (C) Searching is harder in the B+ tree than B–
derived class can call the base class tree as the all external nodes linked to each
constructors. other.
(D) Constructors can be declared as virtual. (D) In extendible hashing the size of directory
Choose the correct answer form the options is just an array of 2d–1, where d is global
given below : depth.
(a) (A), (B) and (D) Only Choose the correct answer from the options
(b) (A), (B) and (C) Only given below:
(c) (B), (C) and (D) Only (a) (A), (B) and (C) Only
(d) (A), (C) and (D) Only (b) (A), (C) and (D) Only
Ans. (b) : A constructor in programming is a special (c) (A), (B) and (D) Only
type of method that is automatically called when the (d) (A), (B), (C) and (C) Only
objects are created constructors do not have return typesAns. (b) : (A)- In the data file, the first record of any of
not even void and therefore they cannot return values. the block is called anchor record.
It cannot be inherited though a derived class can call the
(B) Dense index has index entries for every search key
base class constructors. Constructors can not be value in the data file.
declared as virtual. (C) In B+ tree, only the leaf nodes are linked together,
49. Which one of the following statements are not all external nodes
CORRECT? (D) In extendible hashing the size of directory is just an
(A) Granularity is the size of data item in a array of 2d, where d is global depth
database. So, the statements (A),(C) and (D) are not correct in the
(B) Two operations in a schedule are said to be question.
conflict if they belong to same transaction. 51. Which of the following statements is/are NOT
(C) Two schedulers are said to be conflict CORRECT about NUMA?
equivalent if the order of any two (A) LOAD and STORE instructions are used
conflicting operations is the same in both to access remote memory.
schedules. (B) There is a single address space visible to all
(D) Write operations which are performed CPU.
without performing the write operation are (C) Access to local memory is slower than
known as Blind Writes. access to remote memory.
Choose the correct answer from the options (D) When the access time to remote memory is
given below. hidden, the system is called NC - NUMA.
(a) (A) and (B) Only (E) In CC - NUMA, Coherent caches are
(b) (A), (B) and (C) Only present.
(c) (A), (B) and (D) Only Choose the correct answer from the options
(d) (B) and (C) Only given below :
Ans. (b) : Performing the writing operation (updation), (a) (A) and (C) Only
without reading operation a such write operations is (b) (B) and (D) Only
known as a blind writes. Hence, the statement (D) is (c) (A) and (E) Only
incorrect and statement (A), (B) and (C) are correct. (d) (C) and (D) Only
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 498 YCT
 Search on TG: @apna_pdf
Ans. (d) : Non-Uniform Memory Access (NUMA) is a Ans. (c) :
computer memory design used in multiprocessing. (A) A process does not always need to check the state
where the memory access time depends or the memory of the currently executing process to enter the critical
location relative to the processor. under NUMA, a section.
processor can access its own local memory faster than (B) Spin locks uses busy waiting.
non-local memory. In NC-NUMA systems, remote (C) Busy waiting, also known as spinning, is a
memory access times are not hidden by cache
technique where a process continuously checks for a
mechanisms. So, if the access time to remote memory is
condition to be true in a tight loop, without yielding the
not hidden, the system is called NC- NUMA.
CPU to other processes.
Thus, the statements (c) and (d) are not correct.
(d) Critical region is a part of program, where shared
52. Indexed/grouped allocation is useful as: memory is kept.
(A) It supports both sequential and direct
54. Three address codes can be represented in
access.
special structures known as:
(B) Entire block is available for data.
(A) Quadruples
(C) It does not require lots of space for keeping
(B) Triples
pointers.
(C) Patterns
(D) No external fragmentation.
(D) Indirect Triples
Choose the correct answer from the options
given below. Choose the correct answer from the options
given below:
(a) (A) Only
(a) (A) and (B) Only
(b) (B) and (C) Only
(c) (B) Only (b) (A), (B) and (D) Only
(d) (A), (B) and (D) Only (c) (B) and (C) Only
(d) (B), (C) and (D) Only
Ans. (d) : Indexed/grouped allocation typically supports
both sequential and direct access. Entire block is Ans. (b) : Three address codes can be represented in
available for data. It helps prevent external special structures known as.
fragmentation as all files have their own index block 1. Quadruples – Quadruples are a type of three address
that keeps track of the blocks associated with it. Indexed code representation. They consist of four field:
allocation actually needs space to store pointers in the operator, operand 1, operands2, and result.
index block for each file. 2. Triples– Triples are another form of three address
53. Which of the following statements are code representation. They consist of three fields:
CORRECT? operator, operand1, and operand2.
(A) A process always check state of currently 3. Indirect Triples– indirect triples are similar to triples
executing process to enter critical schema. but with an added feature of indirect addressing. In
(B) Spin locks uses busy waiting. indirect triples, the operands can be memory
(C) Periodically testing a variable until some location instead of just values.
value appear is known as busy waiting. Patterns and other structures and not typically used to
(D) Critical region is a part of program, where represent three address codes in compilers.
shared memory is kept. 55. Which of the statement is/are CORRECT?
(E) Printer daemon, continuously checks to see (A) Moore and Mealy machines are finite state
if there are any file to be printed. machines with output capabilities.
Choose the correct answer from the options (B) Any given Moore machine has an
given below: equivalent Mealy machine.
(a) (A) and (B) Only (C) Any given Mealy machine has an
(b) (B) and (C) Only equivalent Moore machine.
(c) (B) and (D) Only (D) Moore machine is not a finite state
(d) (B) and (E) Only machine.
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 499 YCT
 Search on TG: @apna_pdf
Choose the correct answer form the options (D) ∃x P(x)- This statement means ''There exits an
given below : integer x such that x = x2. ''Since this is not true for any
(a) (A) and (B) Only integer except 0 and 1, This statements is false.
(b) (A), (B) and (C) Only
(E) ∀x P(x)- This statement ''for all integer x, x = x2.
(c) (B) and (D) Only
''Since this is only true for x = 0 and 1, and false for all
(d) (A), (B) and (D) Only
other integer, this statement is false.
Ans. (b) : Let's break down each statements-
So, the correct option is (c).
(A) Moore and Mealy machines are finite state machine
with output capabilities. 57. Which of the following statement are truth
This statement is correct, Both Moore and Mealy statements if universe of disclosure is set of
machine are types of finite state machine that have the integers:
ability to produce output based on their current state. (A) ∀n (n2≥0)
(B) Any given Moore machine has an Equivalent Mealy
(B) ∃n (n2 = 2)
machine.
(C) ∀n (n2 ≥ n)
This statement is correct. It's possible to correct to
convert any Moore machine into an equivalent Mealy (D) ∃n (n2 < 0)
machine. Choose the correct answer from the options
(C) Any given Mealy machine has an equivalent Moore given below :
machine. (a) (A) and (B) Only
This statement is incorrect. Unlike converting from
(b) (B) and (C) Only
Moore to Mealy. It's not always possible to convert a
Mealy machine into an equivalent Moore machine. (c) (C) and (D) Only
(D) Moore machine is not a finite state machine. (d) (A) and (C) Only
This statement is incorrect. Moore machines are indeed Ans. (d) : ∀n (n2≥0): This statement is true because the
a type of finite state machine. square of any integer is always greater than or equal to
So, the correct answer is (b). 0. For example, if x = 3, then 32 = 9 which is greater
2
56. The statement P(x): "x = x ", If the universe of than or equal to 0.
disclosure consists of integers, what are the
(2) ∃n (n2 = 2): This statement is false because there
following have truth values:
are no integers whose square is equal to 2. The square
(A) P(0)
of any integer will be an integer, and the square root of
(B) P(1)
2 is not an integer.
(C) P(2)
(c) ∀n (n2 ≥ n) : This statement is true because for any
(D) ∃x P(x)
integer n, n2 is always greater than or equal to n. For
(E) ∀x P(x)
example, if n = 2 then 22 = 4, which is greater than or
Choose the correct answer form the options
given below: equal to 2.
(a) (A), (B) and (E) Only (d) ∃n (n2 < 0): This statement is false because the
(b) (A), (B) and (C) Only square of any integer is always greater than or equal to
(c) (A), (B) and (D) Only 0. There is no integer whose square is less than 0.
(d) (B), (C) and (D) Only So, The correct answer is (A) and (C).
Ans. (c) : Let's evaluate each of the options- 58. Which of the following graphs are trees?
(A)- P(0)- Substituting 0 for x, we get 0 = 02, which is
true. So, P(0) is true.
(B) P(1)- Substituting 1 for x, we get 1 = 12, which is (A)
true. So, P(2) is true.
(C) P(2)- Substituting 2 for x we get 2 = 22. Which is
false. So, P(2) is false.
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 500 YCT
 Search on TG: @apna_pdf
Ans. (b) : CSMA (Carrier Sense Multiple Access) has
different access methods- including.
(B) 1. 1- persistent CSMA
2. Non- persistent CSMA
3. P - Persistent CSMA
4. Q- persistent CSMA
60. The selection of Spiral Model based on
characteristics of requirements:
(A) Are requirements easily understandable
(C) and defined?
(B) Do we change requirements quite often?
(C) Can we define requirements early in the
cycle?
(D) Requirements are indicating a complex to
be built
Choose the correct answer from the options
(D) given below :
(a) (C) Only
(b) (B) Only
Choose the correct answer from the options (c) (B) and (D) Only
given below: (d) (A) and (C) Only
(a) (A) and (B) Only Ans. (c) : The spiral Model in software development is
(b) (A), (B) and (D) Only a risk. driven model which involves four phases,
(c) (A) and (D) Only planning, risk analysis, engineering and evaluation. This
(d) (A), (B), (C) and (D) Only model is ideal for large. complex and innovation
projects where the requirement might not be clearly
Ans. (a) : In graph Theory a tree is a type of undirected
defined up front or are highly likely to evolve during the
graph where any two vertices are connected by exactly
course of the project.
one path.
(2) Do we change requirements quite often? This indeed
Trees have several properties
aligns with the spiral model as changes can be
1. Connected, Every pair of vertices in a tree is introduced in the system in the subsequent phases,
connected by a unique path. making it highly flexible.
2. Acyclic A true has no cycles or loops. Adding any (4) Requirements are indicating a complex to be built
edge to a tree would Create a cycle. spiral model is suitable for conflux projects are the risk
3. N–1 Edges and 4. Maximally Acyclic. analysis phase allows for identification and mitigation
So A and B graphs trees. of any potential issues, especially important in a
59. Which of the following are example of CSMA complex project.
channel sensing methods? 61. The work done by UDP is/are:
(A) 1-persistent (A) Congestion control
(B) 2-persistent (B) Flow control
(C) p-persistent (C) Retransmission
(D) o-persistent (D) Segment transmission
Choose the correct answer from the options Choose the correct answer from the options
given below: given below:
(a) (A), (B) and (D) Only (a) (A) and (D) Only
(b) (A), (C) and (D) Only (b) (C) Only
(c) (B), (C) and (D) Only (c) (D) Only
(d) (A), (B) and (C) Only (d) (B) and (C) Only

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 501 YCT
 Search on TG: @apna_pdf
Ans. (c) : UDP (User Datagram Protocol) is a (D) NRZ-L and NRZ-I both have DC
connectionless protocol that operates at the Transport component problems.
Layer of the a network without the need for establishing (E) The minimum bandwidth of Manchester
a connection. UDP does not provide features like and differential Manchester is 3 times that
congestion control, Flow control or retransmission of of NRZ
lost packets. It simply encapsulates the data into Choose the correct answer from the options
datagram's (segments) and transmits them without any given below :
guarantee of delivery or ordering. (a) (A), (B) and (C) Only
62. Which of the following statement/s is/are NOT (b) (A), (C), (D) and (E) Only
CORRECT? (c) (B), (C) and (D) Only
(A) OSPF is based on distance-vector routing (d) (A), (B), (C) and (E) Only
protocol. Ans. (c) : All correct explanation.
(B) Both link-state and distance-vector routing (A) NRZ is a bipolar scheme in which the positive
are based on the least cost goal. voltage define bit 1, not 0.
(C) BGP4 is based on the path-vector (B) NRZ-L and NRZ-I both have an average signal rate
of N/2.
algorithm.
(C) The idea of RZ and NRZ-L are combined into
(D) The three-node instability can be avoided
Manchester scheme.
using split horizon combined with poison
(D) Both NRZ-L and NRZ-I have DC component
reverse.
problems.
(E) RIP is based on link state algorithm.
(E) The minimum bandwidth of Manchester and
Choose the correct answer from the options
differential Manchester is 3 times that of NRZ, not
given below: 3 time.
(a) (A), (D) and (E) Only So correct answer is (c) (B) (C) and (D) only.
(b) (A) and (B) Only
64. Which of the following are commonly used
(c) (B) and (C) Only parsing techniques in NLP (Natural Language
(d) (B), (C) and (E) Only Processing) for syntactic analysis.
Ans. (a) : QSPF is based on distance- vector routing (A) Top down parsing
protocol. This statement is incorrect. OSPE (Open (B) Bottom Up parsing
shortest path first) is a link- state routing protocol, not (C) Dependency parsing
distance- vector. (D) Statistical machine translation
The three node instability can be avoided using split (E) Early parsing
horizon combined with poison reverse. This statement is Choose the correct answer from the options
incorrect split horizon and poison reverse are techniques given below :
used to avoid the count to infinity problem in distance (a) (A), (C), (D), (E) Only
vector routing protocols. (b) (B), (C), (D), (E) Only
RIP is based on link state algorithm. This statement is (c) (A), (B), (C), (E) Only
also incorrect. RIP (Routing Information Protocol) is a (d) (A) and (B) Only
distance vector routing protocol, not a link state. Ans. (c) : The commonly used parsing techniques in
63. Which of the following are LNP. for syntactic analysis are-
statement/s
CORRECT? (1) Top-down parsing
(A) NRZ is a bipolar scheme in which the (2) Bottom-up parsing
positive voltage define bit is 0 (zero). (3) Dependency parsing
(B) NRZ-L and NRZ-I both have an average (5) Early parsing
signal rate of N/2 (4) Statistical machine translation is not a parsing
(C) The idea of RZ and NRZ-L are combined technique. It is a method used for translation form on
into Manchester scheme. language to another statistical models.
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 502 YCT
 Search on TG: @apna_pdf
65. In the content of Alpha Beta pruning in game Ans. (d) : The correct match is-
trees which of the following statements are List - I List - II
correct regarding cut off procedures?
(A) Alpha Beta pruning can eliminate sub trees A. φ ⋂ {φ}= (I). φ
with certainly when certainly when the B. {φ} ⋂ {φ}= (II). {φ}
value of a node exceeds both the alpha and
beta bonds. C. {φ, {φ}} – φ = (IV). {φ, {φ}}
(B) The primarily purpose of Alpha-Beta
D. φ ⋃ {{φ}}= (III). {{φ}}
pruning is to save computation time by
67. Match List - I with List - II.
searching fewer nodes in the same tree.
List - I List - II
(C) Alpha Beta pruning guarantees the optimal
solution in all cases by exploring the entire A. SZA I Increment M and skip it zero
game tree. B. SKI II Skip if AC is negative
(D) Alpha and Beta bonds are initialized to C. SNA III Skip if input flag is on
negative and positive infinity respectively D. ISZ IV Skip if AC is Zero
at the root note.
Choose the correct answer from the options
Choose the correct answer from the options given below:
given below :
(a) (A)-(II), (B)-(IV), (C)-(I), (D)-(III)
(a) (A), (C), (D) Only
(b) (A)-(IV), (B)-(III), (C)-(II), (D)-(I)
(b) (B), (C), (D) Only
(c) (A)-(IV), (B)-(II), (C)-(I), (D)-(III)
(c) (A), (B), (D) Only
(d) (A)-(III), (B)-(IV), (C)-(II), (D)-(I)
(d) (C), (B) Only
Ans. (b) : The correct match is
Ans. (c) : The correct statement regarding cutoff
List - I List - II
procedures in Alpha Beta pruning are.
A. SZA (IV). Skip if AC is Zero
(A) Alpha Beta pruning can eliminate subtrees with
certainty when the value of a node exceeds both the B. SKI (III). Skip if input flag is on
alpha and beta bounds. C. SNA (II). Skip if AC is negative
(B) The primary purpose of Alpha Beta pruning is to D. ISZ (I). Increment M and skip it zero
save computation time by searching fewer nodes in the 68. Match List - I with List - II.
same tree.
List - I List - II
(C) Alpha and Berta bounds are initialized to negative
A. Bresenham I Hidden surface
and positive infinity respectively at the root node.
removal
So the correct answer would be - (A), (B) and (D).
B. Cohen- II Line drawing
66. Match List-I with List-II.
Sutherland algorithm
List-I List-II
C. Sutherland- III Line clipping algorithm
A. φ ⋂ {φ φ}= I φ
Hodgeman
B. φ} ⋂ {φ
{φ φ}= II φ}
{φ
D. Z-Buffer IV Polygon clipping
C. φ, {φ
{φ φ}} – φ = III φ}}
{{φ
algorithm
D. φ ⋃ {{φ φ}}= IV φ, {φ
{φ φ}}
Choose the correct answer from the options Choose the correct answer from the options
given below: given below:
(a) (A)-(I), (B)-(II), (C)-(III), (D)-(IV) (a) (A)-(III), (B)-(II), (C)-(IV), (D)-(I)
(b) (A)-(II), (B)-(I), (C)-(III), (D)-(IV) (b) (A)-(II), (B)-(III), (C)-(I), (D)-(IV)
(c) (A)-(II), (B)-(I), (C)-(IV), (D)-(III) (c) (A)-(II), (B)-(III), (C)-(IV), (D)-(I)
(d) (A)-(I), (B)-(II), (C)-(IV), (D)-(III) (d) (A)-(II), (B)-(IV), (C)-(III), (D)-(I)

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 503 YCT
 Search on TG: @apna_pdf
Ans. (c) : The correct match is- C. Long term III The decision to add to
List - I List - II scheduling the number of processes
A. Bresenham (II) Line drawing algorithm that are partially or
B. Cohen- (III) Line clipping algorithm fully in main memory
Sutherland D. Medium IV The decision to add to
C. Sutherland- (IV) Polygon clipping term the pool of processes to
Hodgeman algorithm scheduling be executed
D. Z-Buffer (I) Hidden surface removal Choose the correct answer from the options
69. Match List - I with List - II. given below:
List - I List - II (a) (A)-(I), (B)-(III), (C)-(IV), (D)-(II)

A. BCNF iff I every JD is implied by (b) (A)-(II), (B)-(I), (C)-(IV), (D)-(III)

the candidate keys (c) (A)-(III), (B)-(II), (C)-(I), (D)-(IV)
B. 5 NF iff II all underlying domains (d) (A)-(IV), (B)-(II), (C)-(III), (D)-(I)
contain scalar values only Ans. (b) : The correct match is-
C. 1 NF iff III every MVD is implied by List - I List - II
the candidate keys
A. LRU (II). A page that has not been
D. 4 NF iff IV every FD is implied by referenced for the longest time
the candidate keys is replaced
Choose the correct answer from the options
B. Demand (I). A page is written to
given below:
deaning secondary memory only when it
(a) (A)-(III), (B)-(II), (C)-(I), (D)-(IV)
has been selected for
(b) (A)-(IV), (B)-(I), (C)-(II), (D)-(III)
replacement
(c) (A)-(II), (B)-(III), (C)-(IV), (D)-(I)
C. Long term (IV). The decision to add to the
(d) (A)-(IV), (B)-(I), (C)-(III), (D)-(II)
scheduling pool of processes to be executed
Ans (b) : The correct match is
D. Medium (III). The decision to add to the
List - I List - II
term number of processes that are
A. BCNF iff (IV). every FD is implied by the
scheduling partially or fully in main
candidate keys
memory
B. 5 NF iff (I). every JD is implied by the
candidate keys 71. Match List - I with List - II according to input
to the compiler phase that process it:
C. 1 NF iff (II). all underlying domains
contain scalar values only List - I List - II
D. 4 NF iff (III). every MVD is implied by A. Syntax tree I Code generator
the candidate keys B. Intermediate II Semantic
70. Match List - I with List - II. representation analyzer
List-I List-II C. Token stream III Lexical analyze
A. LRU I A page is written to D. Character stream IV Syntax analyzer
secondary memory only
Choose the correct answer from the options
when it has been
given below :
selected for
replacement (a) (A)-(IV), (B)-(III), (C)-(I), (D)-(II)
(b) (A)-(II), (B)-(I), (C)-(IV), (D)-(III)
B. Demand II A page that has not
cleaning been referenced for the (c) (A)-(II), (B)-(IV), (C)-(I), (D)-(III)
longest time is replaced (d) (A)-(IV), (B)-(I), (C)-(II), (D)-(III)

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 504 YCT
 Search on TG: @apna_pdf
Ans (b) : The correct match is- C. Recursive III Optimal if optimal
List - I List - II best first solution is reachable
search otherwise return the
A. Syntax (II). Semantic analyzer
best reachable
B. Intermediate (I). Code generator
optimal solution
representation
D. SMA* IV Computation and
C. Token stream (IV). Syntax analyzer
space complexity is
D. Character stream (III). Lexical analyze two light
72. Match List - I with List - II. Choose the correct answer from the options
List - I List - II given below:
Propositions Disjunctive Normal (a) (A)-(II), (B)-(IV), (C)-(I), (D)-(III)
Form (DNF) (b) (A)-(II), (B)-(III), (C)-(I), (D)-(IV)
A. ∧(P→
P∧ →Q) I ∨Q
P∨ (c) (A)-(III), (B)-(II), (C)-(IV), (D)-(I)
(d) (A)-(III), (B)-(IV), (C)-(II), (D)-(I)
B. ¬(P∨
∨Q) → ( P∧
∧Q) II ∧¬P)∨
(P∧ ∨( P∧
∧Q)
Ans (a) : The correct match is-
C. →Q
P→ III ¬P)∨
(¬ ∨Q
List - I List - II
D. ∨ ( Q∧
P∨ ∧R) IV ∧P)∨
(P∧ ∨(P∧
∧Q)
A. Greedy Best (II). Incomplete even if the
∨(P∧
∧R)∨
∨(Q∧
∧R)
first search search space is finite
Choose the correct answer from the options
B. A* (IV). Computation and space
given below:
complexity is two light
(a) (A)-(I), (B)-(II), (C)-(III), (D)-(IV)
C. Recursive best (I). The space complexity as
(b) (A)-(II), (B)-(I), (C)-(III), (D)-(IV)
first search O(d) where d = depth of the
(c) (A)-(III), (B)-(I), (C)-(II), (D)-(IV) deepest optimal solution
(d) (A)-(IV), (B)-(III), (C)-(II), (D)-(I)
D. SMA* (III). Optimal if optimal
Ans (b) : The correct match is- solution is reachable
List - I List - II otherwise return the best
Propositions Disjunctive Normal reachable optimal solution
form (DNF) 74. Match List - I with List-II.
A. P∧(P→Q) (II). (P∧¬P)∨( P∧Q) List - I List - II
B. ¬(P∨Q) → ( P∧Q) (I). P∨Q A. Monoalphabetic I Round key
Cipher
C. P→Q (III). (¬P)∨Q
B. DES II One-to-many
D. P∨ ( Q∧R) (IV). (P∧P)∨(P∧Q)
relationship
∨(P∧R)∨(Q∧R)
C. Stream Cipher III One-to-one
73. Match List - I with List - II. relationship
List - I List - II D. Polyalphabetic IV Feedback
A. Greedy Best I The space complexity Cipher mechanism
first search as O(d) where d = Choose the correct answer from the options
depth of the deepest given below:
optimal solution (a) (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
B. A* II Incomplete even if (b) (A)-(III), (B)-(IV), (C)-(II), (D)-(I)
the search space is (c) (A)-(I), (B)-(III), (C)-(IV), (D)-(II)
finite (d) (A)-(II), (B)-(I), (C)-(IV), (D)-(III)
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 505 YCT
 Search on TG: @apna_pdf
Ans (a) : The correct match is- (B) Remainder of 2446 when divided by 9. The
List - I List - II remainder is 7.
A. Monoalphabetic (III). One-to-many (C) Remainder of 11517 when divided by 17. since 155
Cipher is a multiple of 17, the remainder of 155n when divided
relationship
by 17 will always be 2, irrespective of the value of n. So
B. DES (I). Round key
the remainder is 2.
C. Stream Cipher (IV). Feedback
(D) Last digit of the number > 45.
mechanism
The cycle for the last desist of powers of 7 is 7, 9, 3, 4,1
D. Polyalphabetic (II). One-to-one repeating every 4th power. Therefore that last digit of
Cipher relationship >45 (where 45 mod 4 = 1) will be 7.
75. Match List - I with List - II. So the correct answer is option c : (A), (C), (B), (D)
List - I List - II 77. In most general case, the computer needs to
∧
A. Hill climbing I O(b d) process each instruction with the following
B. Best first search II O(bd) sequence of steps:
C. A*Search III O(1) (A) Calculate the effective address
D. Depth first search IV O(b∧ m) (B) Execute the instruction
(C) Fetch the instruction from memory
Choose the correct answer from the options
given below: (D) Fetch the operand from memory
(a) (A)-(III), (B)-(I), (C)-(IV), (D)-(II) (E) Decode the instruction
(b) (A)-(II), (B)-(I), (C)-(IV), (D)-(III) Choose the correct answer from the options
(c) (A)-(II), (B)-(IV), (C)-(I), (D)-(III) given below :
(d) (A)-(I), (B)-(III), (C)-(II), (D)-(I) (a) (A), (B), (C), (D), (E)
Ans (a) : The correct match is- (b) (A), (B), (C), (E), (D)
(c) (C), (E), (A), (D), (B)
List - I List - II
(d) (C), (E), (D), (A), (B)
A. Hill climbing (III) O(1)
Ans. (c) : The correct sequence of steps in the most
B. Best first search (I) O(b∧ d)
general case of processing an instruction by a computer
C. A*Search (IV) O(b∧ m) is:
D. Depth first search (II) O(bd) (3) fetch the incarnation from memory
76. Arrange the following in ascending order: (5) Recode the instruction
(A) Remainder of 4916 when divided by 17 (1) Calculate the effective address
(B) Remainder of 2446 when divided by 9 (4) Fetch the operand from memory
(C) Remainder of 15517 when divided by 17 (2) Execute the instruction
(D) Last digits of the number 745 Therefore, the correct answer is
Choose the correct answer from the options (c) - (C), (E), (A), (D), (B).
given below:
78. Consider the following code segment:
(a) (A), (B), (C), (D)
int arr [ ] = {0, 1, 2, 3, 4};
(b) (A), (B), (D), (C)
int i = 1, *ptr;
(c) (A), (C), (B), (D)
ptr = arr + 2;
(d) (D), (C), (B), (A)
arrange the following printf statements in the
Ans. (c) : (A) Remainder of 4916 when divided by 17.
increasing order of their output.
Recall that if we look at power of 49 module 17, we
find that they alternate between 32 (equivalent to 15 (A) printf ("%d", ptr[i]);
mod 17) and 1. That's because 492 = 2401, which is 17 (B) printf ("%d", ptr[i + 1]);
* 141 +1. Since 16 is even. 49 ^ 16 is equivalent to 1 (C) printf ("%d", ptr[- i]);
mod 17. so the remainder is 1. (D) printf ("%d", ptr[- i + 1]);
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 506 YCT
 Search on TG: @apna_pdf
Choose the correct answer from the options 80. Arrange the following levels of interrupt
given below: protection within the Linux Kernel, in the
(a) (C), (A), (B), (D) order of increasing priority.
(b) (C), (D), (A), (B) (A) user mode programs
(c) (D), (A), (B), (C) (B) bottom half interrupt handlers
(d) (A), (B), (D), (C) (C) kernel system service routines
Ans. (b) : Let's analyze the code segment. (D) top half interrupt handlers
int arr [] = {0,1,2,3,4}: - This creates an array arr with 5 Choose the correct answer from the options
elements.
given below:
int i = 1, * ptr:- This declare an integer i and a pointer
(a) (A), (B), (D), (C)
ptr.
(b) (A), (C), (B), (D)
Ptr = arr + 2; - This assigns 'ptr' to the address of arr [2]
(value 2). (c) (A), (C), (D), (B)
Now let's evaluate the printf statement (d) (D), (A), (C), (B)
(A) printf ("% d", ptr [i]); Ans. (b) : The correct order of increasing priority for
prt [i] is equivalent to * (ptr +i), which is * (arr + 2 + 1) the given levels of interrupt protection within the Linux
= arr [3] = 3 kernel is-
(B) printf ("%d", ptr [i + 1]); - ptr [i + 1] is equivalent to (A) User mode programs
* (ptr + i + 1), which is * (arr + 2 + 1 + 1) = arr [4]. (C) Kernel system service routines
(C) printf ("%d", ptr [–i]); - ptr [–i] is equivalent to * (B) Bottom half interrupt handlers
(ptr – i), which is * (arr + 2 – 1) = arr [1] = 1
(D) Top half interrupt handlers
(D) printf ("%d", ptr [–i + 1]); - ptr [–i + 1] is equivalent
81. Arrange the following phases of a compiler as
to * (ptr – i + 1), which is * (arr + 2 – 1 + 1) = (arr + 2)
= arr [2] = 2 per their order of execution (start to end)
So, the correct order of the printf statement in terms of (A) Target code generation
their output values is (C), (D), (A), (B). The correct (B) Syntax Analysis
answer is (b). (C) Code optimization
79. The steps for analysis and design of object (D) Semantic Analysis
oriented system. (E) Lexical Analysis
(A) Draw interaction diagrams Choose the correct answer from the options
(B) Draw state chart and object diagram given below
(C) Draw use case and activity diagram (a) (B), (E), (D), (A), (C)
(D) Draw component and deployment diagram (b) (E), (D), (B), (A), (C)
(E) Draw class diagram (c) (E), (B), (D), (C), (A)
Choose the correct answer from the options
(d) (B), (D), (E), (A), (C)
given below:
Ans. (c) : Compiler operates in various phases each
(a) (E)→(B)→(A)→(C)→(D)
phase transforms the source program from one
(b) (B)→(A)→(E)→(D)→(C)
representation to another. Every phase takes inputs from
(c) (E)→(C)→(B)→(D)→(C)
its previous stage and feeds its output to the next phase
(d) (C)→(A)→(E)→(B)→(D)
of the compiler.
Ans. (d) : The correct sequence for the steps for
The phases of a compiler are-
analysis and design of object oriented system is.
1. Lexical analysis
(C) Draw use case and activity diagram
2. Syntax analysis
(A) Draw interaction diagrams
3. Semantic analysis
(E) Draw class diagram
(B) Draw state chart and object diagram 4. Intermediate code generator
(D) Draw component and deployment diagram 5. Code optimizer
So, the correct option is (d). 6. Target code generation

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 507 YCT
 Search on TG: @apna_pdf
82. The prototyping model has the sequence: Binary Encoding- Binary encoding is the most basic
(A) Customer Evaluation form of ending where each parameter of a solution is
(B) Quick design represented as a string of binary digits (Os and 1s).
(C) Requirements Real valued Encoding- Real valued encoding is used
(D) Implement when the parameters of the solution space are
(E) Design continuous. In this encoding real number are used to
represent the values of parameters.
Choose the correct answer from the options
given below: 84. Arrange the following steps in the correct
(a) (C)→(A)→(D)→(B)→(E) order for a DHCP Client to renew its IP lease
with a DHCP server :
(b) (B)→(C)→(A)→(D)→(E)
(A) DHCP client sends a DHCPREQUEST
(c) (C)→(B)→(D)→(A)→(E)
message
(d) (E)→(B)→(C)→(D)→(A)
(B) DHCP server acknowledges the renewal
Ans. (c) : The correct sequence for the prototyping with a DHCPACK message
model is- (C) DHCP client checks the local lease timer
Explanation- and initiates renewal
(C) Requirements- Gather initial requirements. (D) DHCP server updates its lease database
(B) Quick Design- Create a basic design or prototype. Choose the correct answer from the options
(D) Implement - Develop the prototype. below :
(A) Customer Evaluation - Present the prototype to the (a) (A), (B), (C), (D)
customer for evaluation. (b) (C), (D), (B), (A)
(E) Design- Refine and finalize the design based on (c) (C), (B), (A), (D)
feedback. (d) (C), (A), (B), (D)
83. Arrange the following encoding strategies used Ans. (d) : The correct order for a DHCP client to renew
in Genetic Algorithms (GAs) in the correct its IP lease with a DHCP server is-
sequence starting from the initial step and (C) The DHCP client checks the local lease timer and
ending with the final representation of initiates renewal.
solutions:
(A) The DHCP client lends a DHCPREQUEST
(A) Binary Encoding message to the DHCP server requesting to renew its
(B) Real valued Encoding lease.
(C) Permutation Encoding (B) The DHCP server acknowledge the renewal with a
(D) Gray coding DHCPACK message.
Choose the correct answer from the options (D) The DHCP server updates its lease database to
given below: reflect the renewed lease.
(a) (D), (B), (A), (C) 85. Arrange the following steps in the correct
(b) (B), (D), (A), (C) sequence for applying an unsupervised
(c) (C), (D), (A), (B) technique such as K-means clustering is to a
(d) (B), (C), (A), (D) data set :
Ans. (c) : The correct answer is (C), (D), (A), (B) (A) Randomly initialize cluster centroids
Permutation Encoding- In this encoding strategy the (B) Assign each data point to nearest centroid
representation of solutions is done by permuting the (C) Update the cluster centroids based on the
order of element in the solutions space. mean of data points assigned to each
Gray coding- Gray coding is a binary numeral system cluster
where two successive values differ in only one bit. In (D) Specify the number of clusters (K) to
the context of generic algorithm. Gray coding is used to partition the data into
reduce the chance of introducing errors during the (E) Repeat steps B and C until convergence
encoding and decoding processes. criteria are met
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 508 YCT
 Search on TG: @apna_pdf
Choose the correct answer from the options 87. Given below are two statements:
given below : Statement (I) : The friend function and the
(a) (D), (A), (B), (C), (E) member functions of a friend class directly
(b) (A), (B), (C), (D), (E) access the private and protected data.
Statement (II) : The friend function can access
(c) (C), (B), (A), (D), (E)
the private data through the member functions
(d) (D), (C), (A), (B), (E)
of the base class
Ans. (a) : The correct order of a unsupervised learning In the light of the above statements, choose the
technique such as k-means clustering. most appropriate answer from the options
(D) Specify the number of clusters (K) to partition the given below:
data into. (a) Both Statement I and Statement II are correct
(A) Randomly initialize cluster centroids. (b) Both Statement I and Statement II are
(B) Assign each data point to nearest cluster centroids. incorrect
(C) update the cluster centroids based on the mean of (c) Statement I is correct but Statement II is
incorrect
data point assigned to each cluster.
(d) Statement I is incorrect but Statement II is
(E) Repeat steps B and C until convergence criteria are
correct
met.
Ans. (a) : The friend function and the member functions
86. Given below are two statements: of a friend of class directly access the private and
Statement (I) : If H is non empty finite subset protected data. So the statement 1 is correct.
of a group G and ab∈ ∈H ∀ a, b∈ ∈H, then H is The friend function can access the private data through
also a group the member function of the base class, So the statement
Statement (II) : There is no homomorphism II is also correct.
exist from (Z, +) to (Q, +); where Z is set of 88. Given below are two statements:
integers and Q is set of rational number. Statement (I) : A thread is a dispatchable unit
In the light of the above statements, choose the of work that does not executes sequentially and
most appropriate answer from the options is not interruptible
Statement (II) : It is not possible to alter the
given below:
behavior of a thread by altering its context
(a) Both Statement I and Statement II are correct
when thread is suspended
(b) Both Statement I and Statement II are
In the light of the above statements, choose the
incorrect most appropriate answer from the options
(c) Statement I is correct but Statement II is given below:
incorrect (a) Both Statement I and Statement II are correct
(d) Statement I is incorrect but Statement II is (b) Both Statement I and Statement II are
correct incorrect
Ans. (c) : If H is a non-empty finite subset of a group G (c) Statement I is correct but Statement II is
incorrect
such that ab∈H for all a , b∈H, then H is also a group
(d) Statement I is incorrect but Statement II is
under the operation of G restricted to H. This is because
correct
H inherits associatively, identity and inverses from G,
Ans. (b) : A thread is a dispatchable unit of work that
and closure under the group operation is given. So the
can execute concurrently with other threads, and it can
statement (1) is correct.
be interrupted. so the statement I is incorrect I is
There does exist a homomorphism form (Z, +) to (Q, +). incorrect.
One such homomorphism is the identity map, Which The behavior of a thread can be altered by altering its
maps every integer in Z to the corresponding rationed context, especially when the thread is suspended and its
number in Q. This map preserves addition, making it a execution is controlled by the programmer or the
homomorphism. operating system. so the statement-II is also incorrect.

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 509 YCT
 Search on TG: @apna_pdf
89. Given below are two statement : Question Label : Comprehension
Statement (I) : In Reuse Oriented Model, Food X contains 6 units of Vitamin D per gram
Modification of the old system parts and 7 units of Vitamin E per gram and cost is
appropriate to the new requirements. Rs 12 per gram. Food Y contains 8 units of
Statement (II) : In Reuse Oriented Model, vitamin D per gram and 12 units of Vitamin E
Integration of the modified parts are not per gram and cost is Rs 20 per gram. The daily
possible into the new system. minimum requirements of vitamin D and E are
In the light of the above statements, choose the 100 units and 120 units respectively.
most appropriate answer from the options Suppose x is quantity (in gram) of food X, y is
given below: quantity (in gram) of food Y.
(a) Both Statement I and Statement II are correct Answering the following question based on the
(b) Both Statement I and Statement II are above paragraph given.
incorrect 91. The cost function of total food is:
(c) Statement I is correct but Statement II is (a) Z = 6x + 7y (b) Z = 8x + 12y
incorrect
(c) Z = 12x + 20y (d) Z = 20x + 12y
(d) Statement I is incorrect but Statement II I
Ans. (c) : The cost function for the total food, we need
correct
to consider the cost per gram of each type of food (X
Ans. (c) : In the reuse Oriented Model. modification of
and Y) and the quantities (X and Y) of each type.
old system parts is done to fit the new requirements, but
Given-
the emphasis is on reusing existing components rather
than modifying them extensively. The model focuses on Food X costs Rs 12 per gram.
identifying and reusing existing component framework, Food Y costs Rs 20 per gram.
and system that can be integrated into the new system, The cost function (z) calculated as follows.
reducing the need for expensive modification of Follows-
existing components. So the statement (I) is correct and Z = Cost of food X + cost of food Y
statement (II) is incorrect. Z = (Cost per gram of food X Quantity of food X) +
90. Given below are two statements: (Cost per gram of food Y * quantity of food Y)
Statement (I) : In datagram networks - routers Z = (12* x) + (20* Y)
hold state information about connections so the correct option is
Statement (II) : In virtual circuit network - Z = 12x + 20 Y
each virtual circuit requires router table space
92. Which of the following constrains when
per connection
formulating the LPP?
In the light of the above statements, choose the
(a) 6x + 7y ≤ 100, 8x + 12y ≤ 120, x, y ≥ 0
most appropriate answer from the options
given below: (b) 6x + 8y ≤ 100, 7x + 12y ≤ 120, x, y ≥ 0
(a) Both Statement I and Statement II are correct (c) 6x + 7y ≥ 100, 8x + 12y ≥ 120, x, y ≥ 0
(b) Both Statement I and Statement II are (d) 6x + 8y ≥ 100, 7x + 12y ≥ 120, x, y ≥ 0
incorrect Ans. (d) : The correct constraint when formulating the
(c) Statement I is correct but Statement II is Liner Programming Problem (LPP) based on the given
incorrect information is-
(d) Statement I is incorrect but Statement II is 6x + 7y = 100, 8x + 12y ≥ 120, x, y ≥ 0
correct The constraint 7x + 12y ≥ 120 implies that the total
Ans. (d) : In datagram networks, routes do not hold units of vitamin E from food X and Y combined must
state information about connection because each packet be greater than or equal to 120, which is also correct as
is treated independently. so statement (I) is incorrect.
it meets the minimum requirement of 120 units.
However, in virtual circuit networks, each Virtual
Therefore, the constraints 6x + 8y ≥ 100 ,
circuit does require routers need to maintain state
information for each virtual circuit. So statement (II) is 7x + 12y ≥ 120, x, y ≥ 0 is valid for formulation the LPP
correct. based on the given scenario.
UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 510 YCT
 Search on TG: @apna_pdf
93. Which of the following are quantities (in Ans. (a) : To find the dual of the given liner
grams) of food X and Y respectively when the programming problem (LLP), we need to converts the
cost of food is minimum : objective function and constraints. The dual of the LPP
1 5 is-
(a) 0 and 12 (b) 15 and
2 4 Maximize ≥ = 100 u + 120v
120 Subject to-
(c) and 0 (d) 0 and 10
7
6u + 8v ≤ 100
Ans. (b) : To find the quantities of food X and Y that
7u + 12v ≤ 120
minimize the cost, we need to set up a system of
u, v ≥ 0
equations based on the cost and the minimum
requirements for vitamins D and E. So, the correct option is (a).
1. Cost equation- C x * x + C y * y (Total cost) 95. The minimum cost of food is:
2. Vitamin D equations- 6x + 8y > = 100 (a) 205
3. Vitamin E equations- 7x + 12y > = 100 (b) 250
We want to minimize the total cost, So the objective (c) 330
function is C x * x + C y * y . (d) 200
The first check the given quantities of 15 and 5/4 to see Ans. (a) : To find the minimum cost of food that meets
it they satisfy the constraints for x = 15 and y = 5/4. the daily requirements for vitamin D and E. We need to
Cost: 12*(5/4) = 180 + 25 = 205 set up the following option problem-
Vitamin D - 6 * 15 + 8 * (5/8) = 90 + 10 = 100 minimize the cost - 12x + 20y
Vitamin E - 7 * 15 + 12 * (5/4) = 105 + 15 = 120 Subject to the constraints-
So, the quantities 15 and 5/4 do satisfy the constraints
6x + 8y ≥ 100 (minimum requirement for vitamin D)
and the cost is Rs - 205, However, we can't conclude
that this is the minimum cost without further analysis. 7x + 12y ≥ 120 (minimum requirement for vitamin E)
94. The dual of the formulated LPP is : Solving this linear programming problem- We find the
(a) Max Z = 100u + 120υ minimum cost is Rs- 205.s
s.t. Question Label : Comprehension
6u + 7υ ≤ 12 Consider the following relations X (S, Si, C)
8u + 12υ ≤ 20 and Y (S, P, D).
u, υ ≥ 0
(b) Max Z = 12u + 20υ
s.t.
6u + 7υ ≤ 100
8u + 12υ ≤ 120
u, υ ≥ 0
(c) Max Z = 100u + 120υ
s.t.
96. Find the number of tuples by applying the
6u + 7u ≤ 12 operation X ⋉!x.s = y. s.Y is
8u + 7υ ≤ 20 (a) 1
u, υ are unrestricted (b) 3
(d) Max Z = 100u + 120u (c) 4
s.t. (d) 6
6u + 7υ ≥ 12
Ans. (c) : 4 tuples present by applying the operation
8u + 12υ ≥ 20
X⋉ !
u, υ ≥ 0 x.s = y. s.Y

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 511 YCT
 Search on TG: @apna_pdf
Ans. (d) : To perform a right outer join on the relations
97. Result of X⋉!x.s = y. s.Y is:
X and Y. We need to match tuples based on the
common attributes 's' and include all tuples from Y and
(a)
matching tuples from x. If there is no match in X for a
tuples in Y, Null values are included for attributes of X
in the result.
Given X:
S Si C
(b) J 1 M
B 2 N
R 3 H
T 4 G
and Y:
(c) S P D
J S1 CA
B P1 AB
R D1 DC
(d) None of these A H1 MD
Ans. (b) : Result of X⋉!x.s = y. s.Y is-
Performing a right outer join on X and Y-
S Si C P D
J 1 M S1 CA
B 2 N P1 AB
R 3 H D1 DC
98. Which of the following join is used to get all the
A H1 MD
tuples of relation X and Y with Null values of
corresponding missing values? The result has 4 tuples, So, the correct answer is
(a) Left outer join (D) 4.

(b) Right outer join 100. Number of tuples obtained by applying

(c) Natural join Cartesian product over X and Y are:
(d) Full outer join (a) 16 (b) 12

Ans. (d) : To get all the types of relation X and Y with (c) 04 (d) 32
null values for corresponding missing values, you Ans. (a) : To find the number of tuples obtained by
would use a full outer join. This join type returns all applying the Cartesian product over X and Y, we need
records when there is match in either the left (X) or to multiply the number of tuples in each relation.
right (Y) table recodes. If there is no match, the missing X has tuples: (J, 1 M), (B, 2, N), (R, 3, H), (T, 4, G).
side will contain null. Y has 4 tuples: (J, S1, CA), (B, P1, AB), (R, D1, DC),
99. Number of tuples by applying right outer join (A, H1, HD).
on relation X and Y is/ are: The Cartesian product will contain all possible
(a) 16 combinations of tuples between X and Y.
(b) 5 Number of tupless = Number of tuples in X * Number
(c) 3 tuples in Y
(d) 4 = 4 * 4 = 16

UGC NTA NET JRF Comp. Science Dec. 2023 (Ex. 07.12.2023) 512 YCT