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
communic