Youth Competition Times

NTA/UGC-NET/JRF
COMPUTER
SCIENCE
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
Youth Competition Times
12, Church Lane Prayagraj-211002
Mob. : 9415650134
Email : [email protected]
website : www.yctbooks.com

Publisher Declaration
Edited and Published by A.K. Mahajan for YCT Publications Pvt. Ltd.
and printed by Roop Printing Press, Prayagraj. In order to Publish the book,
full care has been taken by the Editor and the Publisher,
still your suggestions and queries are welcomed.
Rs. : 595/-
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
NTA/UGC NET/JRF Exam. Computer Science 2021 Solved Paper II .........................................................7-26
NTA/UGC NET/JRF Exam. Computer Science June -2020 Solved Paper II ............................................27-50
NTA/UGC NET/JRF Exam. Computer Science December-2019 Solved Paper II ....................................51-76
NTA/UGC NET/JRF Exam. Computer Science June-2019 Solved Paper II ...........................................77-102
NTA/UGC NET/JRF Exam. Computer Science December-2018 Solved Paper II ................................103-122
NTA/UGC NET/JRF Exam. Computer Science June-2018 Solved Paper II .........................................123-139
UGC NET/JRF Exam. Computer Science November-2017 Solved Paper II .........................................140-147
UGC NET/JRF Exam. Computer Science November-2017 Solved Paper III ........................................148-160
UGC NET/JRF Exam. Computer Science June-2017 Solved Paper II ...................................................161-168
UGC NET/JRF Exam. Computer Science June-2017 Solved Paper III .................................................169-181
UGC NET/JRF Exam. Computer Science August-2016 Solved Paper II ...............................................182-188
UGC NET/JRF Exam. Computer Science August-2016 Solved Paper III .............................................189-202
UGC NET/JRF Exam. Computer Science June-2016 Solved Paper II ...................................................203-210
UGC NET/JRF Exam. Computer Science June-2016 Solved Paper III .................................................211-223
UGC NET/JRF Exam. Computer Science December-2015 Solved Paper II ..........................................224-231
UGC NET/JRF Exam. Computer Science December-2015 Solved Paper III ........................................232-243
UGC NET/JRF Exam. Computer Science June-2015 Solved Paper II ...................................................244-251
UGC NET/JRF Exam. Computer Science June-2015 Solved Paper III .................................................252-264
UGC NET/JRF Exam. Computer Science December-2014 Solved Paper II ..........................................265-271
UGC NET/JRF Exam. Computer Science December-2014 Solved Paper III ........................................272-284
UGC NET/JRF Exam. Computer Science June-2014 Solved Paper II ...................................................285-293
UGC NET/JRF Exam. Computer Science June-2014 Solved Paper III .................................................294-306
UGC NET/JRF Exam. Computer Science December-2013 Solved Paper II ..........................................307-313
UGC NET/JRF Exam. Computer Science December-2013 Solved Paper III ........................................314-325
UGC NET/JRF Exam. Computer Science September-2013 Solved Paper II .........................................326-333
UGC NET/JRF Exam. Computer Science September-2013 Solved Paper III .......................................334-345
UGC NET/JRF Exam. Computer Science June-2013 Solved Paper II (Cancel) ....................................346-352
UGC NET/JRF Exam. Computer Science June-2013 Solved Paper III (Cancel) ...................................353-363
UGC NET/JRF Exam. Computer Science December-2012 Solved Paper II ..........................................364-370
UGC NET/JRF Exam. Computer Science December-2012 Solved Paper III ........................................371-382
UGC NET/JRF Exam. Computer Science June-2012 Solved Paper II ...................................................383-388
UGC NET/JRF Exam. Computer Science June-2012 Solved Paper III .................................................389-400

2
 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
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
 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
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
 U.G.C. NET Exam. 2021
COMPUTER SCIENCE
(Solved with Explanation)
1. Which of the statements given below is/are (a) -2-25-3-135
correct? (b) -2-25-1-3-135
It is always important and useful to include an
'alt' attribute on 'img' tag in HTML because (c) -1-145-2-245
A. users who cannot see the image due to (d) -2-25-3-1-135
vision impairment can have a textual Ans. (d) : -2-25-3-1-135
description of the image (which can be
spoken aloud by a screen reader). 4. Match List-I with List-II
B. If the image fails to load (slow connection, List - I List - II
broken path, etc.) then alt text is (Programming (Meaning)
displayed instead. Term)
C. SEO (Search Engine Optimization) A. JNDI i. Runtime support
benefits. for running Java
Choose the correct answer from the options programs
given below:
B. RMI ii. The API in support
(a) A only
of naming and
(b) B and C only
directory services
(c) C only
C. JDK iii. The methods
(d) A, B, and C
provided by the
Ans. (d) : When an image contains words that are Java development
important to understanding the context, the all text kit and runtime
should include those words. This will allow the alt text
support for calling
to play the same junction on the page as the image. Note
that it does not necessarily describe the visual remote methods
characteristics of the image itself but must convey the D. JRE iv. The compiler and
same meaning as the image. class libraries to
Example:- An image on a website provides a link to a develop Java
free newsletter. The image contains the text "Free applications
newsletter. Get free recipes, news, and more. Learn Choose the correct answer from the options
more". the alt text matches the text in the image. <img given below:
src = "news letter.gif" alt = free newsletter. Get free (a) A - II , B - III, C - IV, D - I
recipes, news, and more. Learn more."/> (b) A - II, B - IV, C - III, D - I
2. What does the following function f() in 'C' (c) A - I, B - III, C - IV, D - II
return? (d) A - III, B - II, C - IV, D - I
int f(unsigned int N) { unsigned int counter = 0;
while(N > 0) { counter += N & 1; Ans. (a) :
N = N >> 1;} return counter == 1;} List - I List - II
(a) 1 if N is odd, otherwise 0 (Programming (Meaning)
(b) 1 if N is a power of 2, otherwise 0 Term)
(c) 1 if the binary representation of N is all 1's,
otherwise 0 A. JNDI ii. The API in support
(d) 1 if the binary representation of N has any 1's, of naming and
otherwise 0 directory services
Ans. (b) : 1 if N is a power of 2, otherwise 0 B. RMI iii. The methods
3. Consider the following recursive function F() in provided by the Java
Java that takes an integer value and returns a development kit and
string value: runtime support for
public static String F( int N) {if ( N <= 0) return calling remote
"–"; return F(N - 3) + N + F(N - 2) + N;}
methods
The value of F(5) is:
UGC NTA NET JRF Computer Science 7 YCT
 C. JDK iv. The compiler and Cam-1
class libraries to 8 block and white image {1 bit}
1-megapixel = 106
develop Java
1
applications ⇒ 8 × 1 bit = 8× B = 1 byte
8
D. JRE i. Runtime support for
⇒ 1 B × 1 × 10 = 1×106 B = 1 MB
6
running Java
Cam-2
programs 1 8-color image {3 bit}
5. Match List-I with List-II 8-magapixel
List - I List - II 3
(Programming (Characteristic) = 1 × 3 bit ⇒ 1× byte
8
Paradigm)
3
A. Imperative i. Declarative, clausal ⇒ 8×106 × byte
8
representation,
= 3×106 Byte
theorem proving
= 3 MB
B. Object‐oriented ii. Side-effect free, Total = 1 MB + 3MB = 4MB
declarative,
7. Which of the statements given below are
expression
correct?
evaluation
The midpoint (or Bresenham) algorithm for
C. Logic iii. Imperative, rasterizing lines is optimized relative to DDA
abstract data type algorithm in that
D. Functional iv. Command-based, A. it avoids round-off operations.
procedural B. it is incremental.
Choose the correct answer from the options C. it uses only integer arithmetic.
given below: D. all straight lines can be displayed as
(a) A - IV, B - III, C - I, D - II straight (exact).
(b) A - III, B - IV, C - I, D - II Choose the correct answer from the options
(c) A - IV, B - III, C - II, D - I given below:
(d) A - II, B - III, C - I, D - IV (a) A and B only
(b) A and C only
Ans. (a) : (c) A, B, C, and D
List - I List - II (d) A, B, and C only
(Programming (Characteristic) Ans. (d) : A, B, and C only
Paradigm) 8. What is the transformation matrix M that
A. Imperative iv. Command‐based, transforms a square in the xy-plane defined by
(1, 1)T, (–1, 1)T, (–1, –1)T and (1, –1)T to a
procedural
parallelogram whose corresponding vertices
B. Object‐oriented iii. Imperative, abstract are (2, 1)T, (0, 1)T , (–2, –1)T and , (0, –1)T ?
data type 1 1 0
C. Logic i. Declarative, clausal (a) M = 0 1 0 
representation, theorem 0 0 1 
proving
1 0 0
D. Functional ii. Side‐effect free,
(b) M = 1 1 0 
declarative, expression
evaluation 0 0 1 
6. Suppose you have eight 'black and white' 1 1 1 
images taken with a 1-megapixel camera and (c) M = 0 1 0 
one '8-color' image taken by an 8-megapixel
0 0 1 
camera. How much hard disk space in total do
you need to store these images on your 1 1 0
computer? (d) M = 1 1 0 
(a) 1 GB (b) 4 MB
0 0 1 
(c) 3 MB (d) 3 GB
Ans. (b) : 4 MB
UGC NTA NET JRF Computer Science 8 YCT
 1 1 0 12. The V components in MVC are responsible for:
Ans. (a) : M = 0 1 0 
(a) User interface.
(b) Security of the system.
0 0 1  (c) Business logic and domain objects.
9. Suppose a Bezier curve p(t) is defined by the (d) Translating between user interface
following four control points in the xy-plane: actions/events and operations on the domain
P0 = ( -2,0 ) ; P1 = ( -2,4 ) ; P2 = ( 2,4 ) ; and P3 = objects.
Ans. (a) : In model-view-controller architectural
(2,0). Then which of the following statements
pattern, there are following parts and there main
are correct?
responsibilities-
A. Bezier curve P(t) has degree 3. Model: Responsible for providing the app's
1
B. P   = ( 0, 3 ) . "business logic".
2 View: Responsible for providing the app's user
C. Bezier curve P(t) may extend outside the interface (UI)
convex hull of its control points. Controller: Responsible for translating UI actions
Choose the correct answer from the options to operations on the model.
given below : So V components in MVC are responsible for user
(a) A and B only interface.
(b) A and C only 13. In software engineering, what kind of notation
(c) B and C only do formal methods predominantly use?
(d) A, B, and C (a) textual
(b) diagrammatic
Ans. (a) : A and B only
(c) mathematical
10. Given below are two statements
(d) computer code
Statement I: The maximum number of sides
Ans. (c) : mathematical
that a triangle might have when clipped to a
rectangular viewport is 6. Formal method :- System design techniques that use
rigorously specified mathematical model to build
Statement II: In 3D graphics, the perspective
software, hardware system.
transformation is nonlinear in z.
In light of the above statements, choose the 14. If every requirement stated in the Software
correct answer from the options given below Requirement Specification (SRS) has only one
interpretation, then SRS is said to be
(a) Both Statement I and Statement II are true.
(a) correct
(b) Both Statement I and Statement II are false
(b) consistent
(c) Statement I is true but Statement II is false
(c) unambiguous
(d) Statement I is false but Statement II is true
(d) verifiable
Ans. (d) : Statement I is false but Statement II is true
Ans. (c) : An SRS is said to be unambiguous if all the
11. In software testing, beta testing is the testing requirements stated have only 1 interpretation.
performed by _______________.
15. A system has 99.99% uptime and has a mean-
(a) potential customers at the developer's location
time-between-failure of 1 day. How fast does
(b) potential customers at their own locations
the system has to repair itself in order to reach
(c) product developers at the customer's location
this availability goal?
(d) product developers at their own locations
(a) ~9 Seconds
Ans. (b) : Beta testing is a type of user acceptance (b) ~10 Seconds
testing among the most crucial testing, which performed
(c) ~11 Seconds
before the release of the software. Beta testing is a type
(d) ~12 Seconds
of field test. This testing performs at the end of the
software testing life cycle. This type of testing can be Ans. (a) : ~9 Seconds
considered as external user acceptance testing. Sol.
Beta testing always is done after the alpha testing, and MTBF
Availability =
before releasing it into the market. Beta testing is a MTBF + MTTR
black-box testing Beta testing performs in the absence = MTBF (in second)
of tester and the presence of real users. Beta testing = 1 day
generally is done for testing software product like = 1×24×60×60
utilities, operating systems, and applications, etc. = 86400 sec

UGC NTA NET JRF Computer Science 9 YCT

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

UGC NTA NET JRF Computer Science 11 YCT

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

UGC NTA NET JRF Computer Science 13 YCT

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

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

UGC NTA NET JRF Computer Science 14 YCT

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

UGC NTA NET JRF Computer Science 15 YCT

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

47. Which of the given options provides the

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

UGC NTA NET JRF Computer Science 17 YCT

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

UGC NTA NET JRF Computer Science 18 YCT

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

UGC NTA NET JRF Computer Science 19 YCT

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

UGC NTA NET JRF Computer Science 20 YCT

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

UGC NTA NET JRF Computer Science 21 YCT

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

So bits reserved for frame of set = 12

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

UGC NTA NET JRF Computer Science 22 YCT

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

UGC NTA NET JRF Computer Science 24 YCT

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

UGC NTA NET JRF Computer Science 25 YCT

MIME :- MIME stands for multipurpose Internet mail
Extensions. It is used to extend the capabilities of
Internet e-mail protocols such as SMTP. The MIME
protocols allows the users, to exchange various types of
digital content such as pictures, audio, video, and
various types of documents and files in the e-mails.
97. A message is encrypted using public key
cryptography to send a message from sender to
receiver. Which one of the following statements
is True?
(a) Sender encrypts using receiver's public key
So, connect option is (A) sender encrypts using
(b) Sender encrypts using his own public key receiver's public key.
(c) Receiver decrypts using sender's public key 98. Which of the following statements are true?
(d) Receiver decrypts using his own public key A. Frequency division multiplexing technique
Ans. (a) : In Public key cryptography, both sender and can be handled by digital circuits.
receiver generate a pair of keys, – public key and B. Time division multiplexing technique can be
private key. Public keys are known globally. suppose A handled by analog circuits
is sender and B is the receiver. C. Wavelength division multiplexing technique
is used with optical fiber for combining two
So, A has 3 keys : signals.
1. Public key of A (everyone knows) D. Frequency division multiplexing technique
2. Private key of A (only A knows) can be applied when the bandwidth of a link is
3. Public key of B (Everyone knows) greater than the bandwidth of the signals to be
And B also has 3 keys : transmitted.
Choose the correct answer from the options
1. Public key of B (Everyone knows)
given below:
2. Private key of B (only B knows) (a) B and D only (b) C and D only
3. Public key of A (Everyone knows) (c) A and D only (d) B and D only
• Anything that is encrypted using public key of A can Ans. (b) : C and D only
be decrypted only using private key of A. 99. Which of the following statements are true?
• Anything that is encrypted using private key of A can A. X.25 is connection-oriented network
be decrypted only using public key of A. B. X.25 doesn't support switched virtual
• Anything that is encrypted using public key of B can circuits.
be decrypted only using private key of B. C. Frame relay service provides
acknowledgements.
• Anything that is encrypted using private key of B can
D. Frame relay service provides detection of
be decrypted only using public key of B. transmission errors.
Now A wants to send a secret message to B. so for Choose the correct answer from the options
encryption : A has following 3 options : given below:
1- Public key of A (Everyone knows) : So for (a) A and D only (b) B and D only
decryption B needs - Private key of A - only A knows (c) C and D only (d) B and C only
it. So, B will not be able to decrypt it. Ans. (a) : A and D only
2. Private key of A (only A knows) So, for decryption B 100. Let G(x) be the generator polynomial used for
needs - public key of A - Everyone known it. So CRC checking. The condition that should be
everyone can decrypt it. So it is of no use. satisfied by the G(x) to catch all errors
consisting of an odd number of inverted bits is:
3. Public key of B (Everyone knows) : So, for
(a) (x+1) is factor of G(x)
decryption B needs - private key of B - only B knows it.
(b) (x‐1) is factor of G(x)
So only B will able to decrypt it (That's what we want)
(c) (x2 +1) is factor of G(x)
So for providing security.
(d) (1‐x2 ) is factor of G(x)
Sender encrypts using receiver's public key and
Ans. (a) : (x+1) is factor of G(x)
Receiver decrypts using his own.
UGC NTA NET JRF Computer Science 26 YCT
 U.G.C. NET Exam. June, 2020
COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. The number of position integers not exceeding Ans. (d) :
100 that are either odd or the square of an Options A:- (p → r)∧(q → r) and ((p∨q) → r)
integer is _____ .
Both are equal and it gives the same truth table.
(a) 63 (b) 59
Hence it is logically equivalent.
(c) 55 (d) 50
Ans. (c) : By using inclusion exclusion principal Options B:- p ↔ q and (⇁p ↔ ⇁ q)
|A ∪ B| = |A| + |B| – |A ∩ B| (p →q) (q → p) and (> p → q)
Number of odd number in the range of (1 – 100) (⇁q→ p) (p + q ) (q + p ) and (p + q ) (q + p )
= 100/2 = 50 (1, 3, 5, 7, ..... 97, 99) = |A|
Both the equal and it gives the same truth table.
Number of squares = 10
(1, 4, 9, 16, 25, 36, 49, 81, 100) = |B| Options C:- ((p ∧ q) ∨ ( ¬ p → q)) and p ↔ q
Number of odd number and square = 5 hence logically equivalent.
(1, 9, 25, 49, 81) = |A ∩ B| Options D:- ((p∧q → r)) and ((p → r) ∧ (q → r))
Number of positive integers not exceeding 100 that are P Q R ¬ P ¬ Q P⇒Q Q⇒R (P⇒R)∩(Q
either odd or the square = |A ∪B| = 50 + 10 – 5 = 55 ⇒R)
2. How many ways are there to pack six copies of T T T F F T T T
the same book into four identical boxes. Where
a box can contain as many as six books? T T F F F F F F
(a) 4 T F T F T T T T
(b) 6 T F F F T F T F
(c) 7 F T T T F T T T
(d) 9
F T F T F T F F
Ans. (d) : Here there are six copies of the same book
into four. F F T T T T T T
Identical boxes (Same box). We will enumerate all F F F T T T T T
ways to pack the books for each way to pack the books The above truth table is not equivalent.
we will list the number of books in the box with the Hence the above statement is true, logically not
largest numbers of books, followed by the numbers of equivalent.
books in each box containing at least one book, in order
Hence, the correct answer option d.
to decreasing the number of books in a box.
6, 0, 0, 0 4. Consider the following linear programming
5, 1, 0, 0 (LP):
4, 2, 0, 0 Max, z = 2x1 + 3x2
4, 1, 1, 0 Such that 2x1 + x2 ≤ 4
3, 3, 0, 0 x1 + 2x2 ≤ 5
3, 2, 1, 0 x1,x2 ≥ 0
3, 1, 1, 1
The optimum value of the LP is
2, 2, 2, 0
(a) 23
2, 2, 1, 1
(b) 9.5
So, the number of way is 9.
(c) 13
3. Which of the following pairs of propositions
are not logically equivalent? (d) 8
(a) (p → r)∧(q → r) and (p∨q) → r) Ans. (d) : Max z = 2x1 + 3x2
(b) p ↔ q and (– p ↔ – q) 2x1 + x2 ≤ 4
(c) ((p∧q) ∨ (– p ∧ –q)) and p ↔ q x1 + 2x2 ≤ 5 x1,x2 ≥ 0
(d) ((p∧q → r)) and ((p → r) ∧ (q → r)) Graphical method;

UGC NET JRF Computer Science 27 YCT

 n
210 CLA Clean accumulator (set to
0)
211 ADD 217 Add contents of location
217, 1234 H to accumulator
212 INC Increment accumulator by 1
so accumulator contain
Draw lines by removing in equality z at 1234 H
(1, 2) = 2 + 6 = 8 213 STA 217 Store this value 1235 H at
location 217
z at (2, 0) = 4 + 0 = 4
214 LDA 218 Load accumulator with the
z at (0, 5/2) = 0 + 15/2 = 7.5 = 8 Ans.
content of 218. So
5. Consider a machine with a byte addressable accumulator now has
main memory of 216 bytes and block size of 8 9CE2H
bytes. Assume that a direct mapped cache 215 CMA Complement (1's
consisting of 32 lines used with this machine. complement) accumulator,
How many bits will be there in Tag, line and so accumulator now have
word field of format of main memory 631 DH
addresses. 216 AND 217 perform bitwise AND
(a) 8, 5, 3 operation with the content
(b) 8, 6, 2 of 217
(c) 7, 5, 4 217 1234 H
(d) 7, 6, 3 218 9CE2H
Ans. (a) : Main memory size = 216 bytes no of blocks in ⇒ (9CE2)16 = (1001 1100 1110 0010)2
main memory(m) = 216 ÷ 23 1's complement of (9CE2)16
3
Block size(p) = 2 bytes = (0110 0011 0001 1101)2 = (631 D)16
No of block in cache memory (N) = 25 bytes (631 D)16 and(1235)16 = (0215)16
Tag = 28 = Tag bits = log2(M/N) Hence the correct answer is 0215 H
5 7. A non-pipeline system takes 50ns to process a
Line or cache block = 2 = cache block bits = log2N
word field or word off set 23 = word task. The same task can be processed in six
segment pipeline with a clockcycle of 10ns.
offset bits = log2P
Determine approximately the speedup ration of
Hence, the correct answer is (8, 5, 3). the pipeline for 0 tasks.
6. The following program is stored in memory (a) 6 (b) 4.95
unit of the basic computer. What is the content (c) 5.7 (d) 5.5
of the accumulator after the execution of Ans. (b) : Time for non - pipelined execution per task =
program? (All location numbers listed below tn = 50 ns
are in hexadecimal) time for pipelined execution per task = tp = 10 ns
Location Instruction number of stages in the pipeline = K = 6
210 CLA number of takes = 500
211 ADD 217 Calculation :- time for non pipelined = Tn = 50×500
212 INC Time for pipelined = Tp = 1×6×10 + (500 – 1) × 10
213 STA 217 T
Speed up factor = S = n = 4.95
214 LDA 218 Tp
215 CMA 8. What is the radix of the numbers if the solution
216 AND 217 to the quadratic equation x2 - 10x + 26 = 0 is x
217 1234 H = 4 and x = 7 ?
218 9CE2H (a) 8
(a) 1002H (b) 2011H (b) 9
(c) 2022H (d) 0215H
(c) 10
Ans. (d) : (d) 11
Location Instructio Execution of program
Ans. (d) : If one solve the quadratic equation,
UGC NET JRF Computer Science 28 YCT
 ax2 + bx + c, then the sum of root of quadrate • An image map is made up of an image with clickable
equation = – b areas, When you click on the image it will open to a
a new or previously selected destination.
Quadratic equation x2 – 10x + 26 = 0 11. Suppose you are compiling on machine with 1-
Since 4 and 7 are the root of the equation byte chars, 2-byt shorts, 4-byte ints and 8-byte
–b =
(10 ) r = (4)r + (7)r doubles and with alignment rules that require
a (1)r the address of every primitive date element to
be an integer multiple of the element's size.
r = 4 + 7 = 11
Suppose further that the compiler is not
9. Consider the following pseudo-code fragment, permitted to reorder fields padding is used to
where a and b are integer variables that have ensure alignment. How much space will be
been initialized.
consumed by the following array.
/*Pre-conditions : (a > 1 ∧ a < b) */ struct {
/*Assume that overflow never occurs */ short s;
int x = 0; int p = 1;
char c;
while (p < b) {
short t;
p = p * a;
char d;
x = x + 1;
double r;
}
int i;
When the while loop terminates, what will be
} A[10]; /*10-element array of structs*/.
the value of x is terms of a and b ?
b (a) 150 bytes (b) 320 bytes
(a) a
(c) 240 bytes (d) 200 bytes
(b) ba
Ans. (c) : Padding it save are CPU cycle.
(c) log ab  */   means floor */
given data Assume: → CPU cycle 8 byte
(d) log ab  /*   means ceil */
Ans. (d) : Since a > 1 and a < b
int x = 0, int p = 1
Let us assume q = 2 and b = 15
Whenever the 100 p is entered the value of P is.
doubles and the value of x incremented by 1.
in iteration 1 : P = 2, x = 1
⇒ 8 ×3 = 24
in iteration 2 : P = 4, x = 2
Array of size = 10 ⇒ 24×10 = 240 Ans
in iteration 3 : P = 8, x = 13
in iteration 4 : P = 16, x = 4 Data type 32 - bit(4 bytes) 64 - bit(8 bytes)
final values are a = 2, b = 15, p = 16, x = 4. Char 1 1
Form the above value if can be seen that x = log ab  Short 2 2
10. In HTML <map> tag is used for Int 4 4
(a) defining a path between two nodes in an Floot 4 4
image Double 8 8
(b) defining clickable region in an image Pointer 4 8
(c) highlighting an area in an image
(d) defining the site amp of a web-site 12. Consider the following recursive Java function
f that takes two long arguments and returns a
Ans. (b) :
float value :
• The <map> tag is used to define an image map. An
public static float f (long m, long n) {
Image map is an image with clickable areas.
float result = (float)m /(float)m;
• The required name attribute of the <map> element is
if (m < 0|||| n < 0) return 0,0f;
associated with the <img>'s use map attribute and
creates a relationship b/w the image and the map. else result – = f (m * 2, n * 3);
return result;
}
UGC NET JRF Computer Science 29 YCT
 Which of the following real values best Ans. (d) :
approximates the value of f (1, 3)? • Key point :- 3 pages of physical memory mean 3
(a) 0.2 (b) 0.4 frames (So at a time only max 3 pages in frames) 5
(c) 0.6 (d) 0.8 pages of virtual memory mean 5 page.
Ans. (a) : The function f(1, 3) pass the value to m, n • FIFO (First in, first out):- The operating system uses
then the value will type cast to float and result = 0.3333 this algorithm to keep track of all pages in memory in a
(1/3). queue with the oldest page at the top. When a page has
Then it enters into else statement the function result as to be replace the first page in the queue is chosen for
0.2 (2/9). replacement.
Hence, the correct answer is 0.2. Page faults - ABC DABF CDBA
13. The data node and name node in HADOOP are A D D D E E E B B
(a) Worker Node and Master Node respectively
B B A A A C C C A
(b) Master Node and Worker Node respectively
(c) Both Worker Nodes C C C B B B D D D
(d) Both Master Nodes Page Fault = 11
Ans. (a) : The main difference between Name Node and Least Recently used (LRU):- In this algorithm the page
data node in HADOOP is that the Name Node is master will be replace which is the least recently used. Page
node in HADDOP distributed file system (HDFS) that fault = ABCDABECDEBA
manages the file system meta data distributed file A D D D E C C C B B
system that stores the actual data as instructed by the
B B A A A A D D D A
Name Node.
C C C B B B B E E E
14. Consider a relational scheme S = (U, V, W, X,
Y, Z) on which the following functional Page fault = 12
dependencies hold. 16. Consider a disk system having 60 cylinders,
{U →V, VW→X, Y→W,X→U} Disk requests are received by a disk drive for
Which are the candidate keys among following cylinders, 10, 22, 20, 2, 40, 6 and 38 in the
options ? order. Assuming the disk head is currently at
(a) UY, VY cylinder 20, what is the time taken to satisfy all
(b) UY, VY, XY the requests if it takes milliseconds to move
(c) UYZ, VYZ, VWZ from one cylinder to adjacent one and Shortest
(d) UYZ, VYZ, XYZ Seek Time First (SSTF) algorithm is used ?
(a) 240 milliseconds
Ans. (d) : A candidate key is a column or set of
columns in a table that can uniquely identify any data (b) 96 milliseconds
base record without referring to any other data. (c) 120 milliseconds
The following functional dependencies, (d) 112 milliseconds
U → V, VW → X, Y → W, X →U Ans. (c) : Shortest Seek Time First (SSTF) :-
S = (U, V, W, X, Y, Z) SSTF = 22–20+22–10+10–6+6–2+38–2+40–38
Here YZ an independent key, so for every key, the YZ = 2 + 12 + 4 + 4 + 36 + 2
Should their. Hence only option 4 is containing YZ for = 60
all keys. Hence the correct answer is UYZ, VYZ, XYZ.
15. Consider a hypothetical machine with 3 pages
of physical memory, 5 pages of virtual memory,
and <A,B,C,D,A,B,E,A,B,C,D,E,B,A,B> as the
stream of page references by an application. If
P and Q are the number of page faults that the It takes 2 milliseconds to move from one cylinder to
application would incur with FIFO and page adjacent one = 60×2
replacement algorithms respectively, then (P, = 120 milliseconds
Q) = ____ . (Assuming enough space for
storing 3 page frames) 17. Suppose you have a Linux file system where the
(a) (11, 10) block size is 2K bytes, a disk address is 32 bits
and in i-node contains the disk addresses of
(b) (12, 11)
first 12 direct blocks of file, a single indirect
(c) (10, 11) block, and a double indirect block.
(d) (11, 12)

UGC NET JRF Computer Science 30 YCT

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

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

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

UGC NET JRF Computer Science 33 YCT

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

UGC NET JRF Computer Science 34 YCT

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

UGC NET JRF Computer Science 36 YCT

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

UGC NET JRF Computer Science 37 YCT

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

UGC NET JRF Computer Science 38 YCT

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

UGC NET JRF Computer Science 41 YCT

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

UGC NET JRF Computer Science 42 YCT

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

UGC NET JRF Computer Science 43 YCT

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

UGC NET JRF Computer Science 44 YCT

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

UGC NET JRF Computer Science 47 YCT

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

UGC NET JRF Computer Science 48 YCT

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

UGC NET JRF Computer Science 49 YCT

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

UGC NET JRF Computer Science 50 YCT

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

UGC NET JRF Computer Science 51 YCT

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

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

Accumulator
C1A5 2nd

UGC NET JRF Computer Science 53 YCT

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

UGC NET JRF Computer Science 57 YCT

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

UGC NET JRF Computer Science 58 YCT

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

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

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

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

UGC NET JRF Computer Science 62 YCT

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

UGC NET JRF Computer Science 63 YCT

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

UGC NET JRF Computer Science 64 YCT

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

UGC NET JRF Computer Science 65 YCT

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

UGC NET JRF Computer Science 66 YCT

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

UGC NET JRF Computer Science 67 YCT

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

UGC NET JRF Computer Science 69 YCT

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

UGC NET JRF Computer Science 71 YCT

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

UGC NET JRF Computer Science 72 YCT

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

UGC NET JRF Computer Science 73 YCT

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

UGC NET JRF Computer Science 75 YCT

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

UGC NET JRF Computer Science 76 YCT

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

UGC NET JRF Computer Science 78 YCT

Then from the matrix we can say that the relation given Now, choose the lowest positive number including zero
is in theta and mark if key row.
{(a, a), (a, c), (b, b), (c, a), (c, b)} Intersection on key column and key row is key
Now, what are the minimum number of ordered pairs elements key column is Xu.
that we should add to the given relation that it becomes Key row is the minimum value in Theta i.e 1st row. key
transitive relation ? element is 2(S1 X1)
Using Warshall's Algorithm we can see that (c, c) and But key element should be 1 so, divide the complete row
(a, b) are missing. by 2
After adding them to the relation and making the matrix Cj 2 -1 2 0 0 0
again the matrix will become CB Base X1 X2 X3 S1 S2 S3 b
1 1 1  0 S1 2 1 0 1 0 0 10
0 1 0 
  0 S2 0 2 0 0 1 1 15
1 1 1  2 X3 1/2 0 1 0 0 1/2 5/2
10. Consider and LPP given as Zj = \ 0 0 0 0 0 0 5
Max Z = 2x1 – x2 + 2x3 (\ sum
Subject to the constraints {C-
2x1 + x2 ≤ 10 B}{X-
J}\)
x1 + 2x2 – 2x3 ≤ 20
x1 + 2x2 ≤ 5 Cj=Cj- 2 -1 2 0 0 0
Zj
x1, x2, x3 ≥ 0 st
What shall be the solution of the LPP after Hence 1 iteration table is prepared b indicates value of
applying first iteration of the Simplex Method? variable which is corresponding in column Cj (only
take the give Xi variable). therefore X1 = 0, X2 = 0,
5
(a) x1 = , x2 = 0, x3 = 0, Z = 5 X3 = 5/2
2
b indicated values of Zmax in Row Cj and therefore
5
(b) x1 = 0, x2 = 0, x 3 = , Z = 5 Zmax = 5
2
11. Which type of addressing mod, less number of
5 5
(c) x1 = 0, x 2 = , x3 = 0, Z = − memory references are required?
2 2 (a) Immediate
(d) x1 = 0, x2 = 0, x3 = 10, Z = 20 (b) Implied
Ans. (b) : (c) Register
Given max z = 2x1 – x2 + 2x3 + OS1 + OS2 + OS3 (d) Indexed
2x1 + x2 + s1 = 10 Ans. (c) : (Dropped Question by NTA)
x1 + 2x2 – 2x3 + S2 = 20
Immediate addressing mode- may or may not need
x1 + 2x3 + S3 = 5 memory reference
initial simplex table : Implied addressing mode- may or may not need
Cj= 2 -1 2 0 0 0 Theta
memory reference (Like push, pop or CMA instruction)
CB Base x1 x2 x3 S1 S2 S3 b
Register Addressing mode- It does not need memory
0 S1 2 1 0 1 0 0 10 ND
reference as operands one always in register.
0 S2 1 2 -2 0 1 0 20 -10
0 S3 1 0 2 0 0 1 5 5/2
Indexed addressing mode- need memory reference.
Zj = \ 0 0 0 0 0 0 12. Suppose that the register A and the register K
( \ sum have the bit configuration. Only the three
{C_B} leftmost bits of A are compared with memory
x _ j}\ ) words because K has I's in these positions.
Cj=Cj-Zj 2 -1 2 0 0 0 Because of its organization, this type of
Here in Cj, we have two numbers which are highest (ie. memory is uniquely suited to parallel searches
2 in column 1st and 2 in column 3rd) by data association. This type of memory is
So we can choose any column to begin with : known as
So lets start with column 3rd for convenience. (a) RAM
Hence column 3rd become key column. (b) ROM
Now, we find Theta = b/corresponding key column (c) content addressable memory
element. (d) secondary memory
UGC NET JRF Computer Science 79 YCT
Ans. (c) : The time required to find an item stored in word. When a word is to be read from memory, the
memory can be reduced considerably if stored data is content of the word is specified, and memory locates all
identified for access by the content of the data itself words which matches the specified content and marks
rather than by an address. Memory unit associated by them for reading.
content is called an associative memory or content 13. How many different Boolean functions of
addressable memory (CAM). degree n are there?
n
CAM is accessed simultaneously and in parallel on the (a) 22
2 n
basis of data content rather than specific location. When (b) (2 )
a word is written in CAM, no address is given. Memory n
(c) 22 − 1
is capable of finding an unused empty slot to store the (d) 2 n

2n
Ans. (a) : In general for n variable there are 2n rows and 2 possible functions.
Degree of Boolean function = number variables = n
Variable is of Boolean type
Sequence possible of two Boolean = 2n
Different Boolean function = \({{2}^{{{2}^{n}}}}\)
Example :
By taking n = 2
A B F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15
0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1
0 1 0 0 0 0 1 1 1 1 0 0 0 0 0 1 1 1
1 0 0 0 1 1 0 0 1 0 0 0 1 1 1 0 1 1
1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
Different Boolean function = \({{2}^{{{2}^{n}}} = {{2}^{2}}^{2} = 16\)
Therefore 16 Boolean function is possible.
14. The fault can be easily diagnosed in the micro- 15. What will be the number of states when a
program control unit using diagnostic tools by MOD-2 counter is followed by a MOD-5
maintaining the contents of counter?
(a) flags and counters (a) 5
(b) registers and counters (b) 10
(c) flags and registers (c) 15
(d) flags, registers and counters (d) 20
Ans. (d) : Flags, registers and counters- Ans. (b) : When mod- x counter is followed by mod-y
within the computer, a control unit manages the counter then the resultant counter is always mod-(x * y)
computer's resources and orchestrates the performance counter.
of its functional parts in response to the instructions. So simply multiply MOD value, answer will be 10.
Microprogrammed control unit operates by executing 16. For a magnetic disk with concentric circular
instructions that define the functionality of the control tracks, the seek latency is not linearly
unit. In this, set of micro instructions is stored in the proportional to the seek distance due to
control memory. The control address register contains (a) non-uniform distribution of requests
the address of the next micro instruction to be read. (b) arm starting or stopping inertia
When a micro instruction is read from the control
(c) higher capacity of tracks on the periphery of
memory, it is transferred to a control buffer register.
the platter
Next element is sequencing unit that loads the control
address register and issues a read command. (d) use of unfair arm scheduling policies
Ans. (b) : Whenever head moves from one track to
other then its speed and direction changes. Which is
nothing but change in motion or the case of inertia.
The positioning time, or random-access time, consists
of two parts : the time necessary to move the disk arm
to the desired cylinder, called the seek time, and the
time necessary for the desired sector to rotate to the disk
head, called the rotational latency.
UGC NET JRF Computer Science 80 YCT
The seek letency is not linearly proportional to the seek 2-put b = 7
distance due to arm starting and stopping inertia. It (49 + 28 + 6)10 + (75 + 5 + 3)10 = (64 × 2 + 32 + 6)10
means seek time is not directly dependent on the seek (166)10 = (166)10 True
distance traveled, but also on the accelerational So 7 is right Answer.
deceleration (on inertia) of actuator arm. 19. How many address lines and data lines are
17. The parallel bus arbitration technique uses an required to provide a memory capacity of 16k
external priority encoder and a decoder. × 16?
Suppose, a parallel arbiter has 5 bus arbiters. (a) 10, 4 (b) 16, 16
What will be the size of priority encoder and (c) 14, 16 (d) 4, 16
decoder respectively? Ans. (c) : Memory capacity = 16k × 16 = 214 × 24
(a) 4 × 2, 2 × 4 Memory capacity is of the form = 2m × 2n
(b) 2 × 4, 4 × 2 Address lines required = r = 14
(c) 3 × 8, 8 × 3 Data lines required = 2n = 16
(d) 8 × 3, 3 × 8 20. Suppose that a computer program takes 100
Ans. (d) : Arbiters → Arbiters are electronic devices seconds of execution time on a computer with
that allocate access to shared resources. multiplication operation responsible for 80
Example → seconds of this time. How much do you have to
A bus arbiter is a device used a multi master bus system improve the speed of multiplication operation if
to decide which bus master will be allowed to control you are asked to execute this program four
the bus for each bus cycle. times faster?
Since, it is given that the parallel arbiter has 5 bus (a) 14 times faster
arbiters. Hence, number of bits required to provide 5 (b) 15 times faster
bus arbiters are 3 bits (Since 23 = 8). (c) 16 times faster
Now encoder is a type of combinational circuit which (d) 17 times faster
consist of 2n input lines and n output lines i.e 2n × n Ans. (c) : Total Execution time = time to execute
encoder. Now n = 3 bits. Therefore, size of encoder is 8 multiplication operation + time for other operations.
× 3. Similarly decoder is a combinational circuit which Calculation → Total execution time = 100 seconds
consist of n-input lines and 2n output lines, i.e, n × 2n Time to execute multiplication operation = 80 Seconds
decoder. So size of decoder is 3 × 8. Then time to execute other operation = 100 – 80
18. Consider the equation (146)b + (313)b–2 = (246)8 = 20 Seconds.
Which of the following is the value of b? To execute the program four time faster, we have to
(a) 8 improve the multiplication operation according to the
(b) 7 question.
(c) 10 To execute the program four times faster.
(d) 16 Total execution time will become = 100/4 = 25 Second
Ans. (b) : First convert each term is base 10 to find base New time to perform multiplication operation
and make equation = new total execution time – time for other operations
Method 1:- New time to perform multiplication operation
First convert all into base 10 = 25 – 20 = 5 Sec.
(146)b + (313)b-2 = (246)8 So speed of multiplication operation is improved by =
⇒ b2 + 4b + 6 + 3(b-2)2 + 1(b – 2) + 3 = 128 + 32 + 6 80/5 = 16 times
b2 + 5b + 7 + 3 (b2 + 4 – 4b) = 166 speed becomes 16 times fast.
b2 + 5b + 7 3b2 + 12 – 12b = 166 21. Consider the following pseudo-code fragment
4b2 – 7b + 19 – 166 = 0 in which an invariant for the loop is "m*xk = pn
4b2 – 7b – 147 = 0 and k ≥ 0" (here, p and n are integer variables
that have been initialized) :
+7 ± 49 − 4 × 4 × −147
b= /* Pre-conditions : p ≥ 1 ^ n ≥ 0 * /
2× 4
/* Assume that overflow never occurs */
7 ± 49 56
= = =7 int x = p; int K = n; int m = 1;
8 8 while (k < > 0) {
Method 2:- By elimination if (k is odd) then m = m*x;
1-put b = 8 convert each into base 1 x = x*x;
(64 + 32 + 6)10 + (3 × 36 + 6 × 3)10 = (64 ×2 + 32 + 6)10 k = k/2; /*floor (k/2)*/
(219)10 ≠ (166)10 false }

UGC NET JRF Computer Science 81 YCT

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

UGC NET JRF Computer Science 82 YCT

25. Which of the following statements is/are true? XML declaration syntax is :
P : In a scripting language like JavaScript, types <?Xml version = "1.0"
are typically associated with values, not encoding = "UTF – 8"?
variables. 27. Consider a raster system with resolution 640 by
Q : It is not possible to show images on a web page 480. What size is frame buffer (in bytes) for
without the <img> tag of HTML. this system to store 12 bits per pixel?
Select the correct answer from the options (a) 450 kilobytes
given below :
(b) 500 kilobytes
(a) P only
(c) 350 kilobytes
(b) Q only
(d) 400 kilobytes
(c) Both P and Q
(d) Neither P nor Q Ans. (a) : Raster scan system : In this electron beam
move on the screen from top to bottom covering each
Ans. (a) : P → In a scripting language like Java script, row one by one.
types are typically associated with values, not variables.
Explanation :
Java script is a client side as well as server-side
scripting language. Java Script data types are : number, Given resolution of the system is : 640 × 480 we have
string, Boolean, object undefined. Basically, the type of to store 12 bits per pixel.
a value determines the operations and methods Frame buffer size = resolution (number of pixels)
performed or it. Variables are not directly associated x number of bits per pixel
with any particular type; any variable can be assigned Frame buffer size = (640 × 480) × 12
values of all type. = 3686400 bits
Images can be shown on a web page without the use of convert it into bytes.
image tag of HTML. We can use div by giving the URL frame buffer size = 3686400/8 = 460800 Byte
of the image in that. = 450 KB
26. Which of the following statements is/are true? 28. Consider the following statement regarding 2D
P : An XML document with correct syntax as transforms in computer graphics :
specified by W3c is called "Well Formed".
1 0 
Q : An XML documented validated against a DTD S1 :   is a 2 × 2 matrix that reflects (mirrors)
is both "Well formed" and "Valid". 0 −1
R : <xml version = "1 . 0" encoding = "UTF – 8"> only 2D point about the X-axis.
is syntactly correct declaration for the version S2 : A 2 × 2 matrix which mirror any 2D point
of an XML document. about the X-axis, is a rotation matrix.
Select the correct answer from the options What can you say about the statements S1 and
given below : S2?
(a) P and Q only (a) Both S1 and S2 are true
(b) P and R only (b) Only S1 is true
(c) Q and R only (c) Only S2 is true
(d) All of P, Q and R (d) Both S1 and S2 are false
Ans. (a) : XML - XML stands for extensible markup Ans. (b) : First matrix is reflection matrix about x-axis
language It is a meta markup language for text S1 is true always.
documents/data. It allows to define language to
represent text. It is designed to describe data not to 1 0 
display data. XML tags are not predefined. 0 −1 is trans formation matrix for reflection about x
 
Some points in XML are as follows : - axis.
* An XML document is well formed it. Satisfies rule S2 is false because reflection about x - axis will give
specified by the W 3C. rotation of θ = 90°
* A well - formed XML have a proper starting and
closing tag.
* An XML documented validated against a DTD is both
"Well formed" and "valid"
* Purpose of DTD is to define the structure and legal
elements and attributed of a XML document.
* XML does not require DTD.
* XML carries the data; it does not represent it.
* XML can be used for off loading and reloading of So if clockwise rotation occurs
database.
UGC NET JRF Computer Science 83 YCT
cos θ − sin θ  cos 90o − sin 90o   0 −1 This component shows the reflected light in a specific
 sin θ cos θ  =  o =  direction. It reflects on the basis of reflection of incident
   sin 90 cos 90o  1 0  light. The special light depends on the position of
and if anticlockwise rotation occurs- observer with respect to the surface.
Specular component finds the strength which is the
 cos θ sin θ   cos 90o sin 90o   0 1 
 − sin θ cos θ  =  o
=  multiplication of specular surface constant with specular
  − sin 90 cos 90   −1 0
o
 intensity and with dot product of reflection direction
Both of these matrix are not same as matrix given in S1. and the direction of surface towards the view. It means
So S2 is false. it is determined by the angle between reflected and view
vector.
29. In the context of 3D computer graphics, which
of the following statements is/are true? So ans. is d. the
P : Orthographic transformations keep parallel reflected vector & the
lines parallel. view vector.
Q : Orthographic transformations are affine
transformations.
Select the correct answer from the options
given below: 31. Which of the following has same expressive
(a) Both P and Q power with regard to relational query
(b) Neither P nor Q language?
(c) Only P (A) Relational algebra and domain relational
calculus
(d) Only Q
(B) Relational algebra and tuples relational
Ans. (a) : orthogonal projections are parallel projection calculus
Each line that is originally parallel will be parallel after (C) Relational algebra and domain relational
this transformation- calculus restricted to safe expression
orthographic projection (sometimes referred to as (D) Relational algebra and tuples relational
orthogonal projection, used to be called analemma is a calculus restricted to safe expression
means of representing three dimensional objects in two (a) (A) and (B) only
dimensions. It is a form of parallel projection, in which (b) (C) and (D) only
all the projection lines are orthogonal which to the (c) (A) and (C) only
projection plane. (d) (B) and (D) only
In Euclidean geometry, an affine transformation or an
Ans. (b) :
affinity (from the Latin, affini's, connected with is a
* Relational algebra is a procedural query language,
geometric transformation that preserve lines and
which takes instances of relations as input and
parallelism (but not necessarily distance and angles). yields instances of relations as output. It uses
The orthographic projection can be represent by a affine operation (selection, projection, union etc) to
transformation. perform queries
30. Using the phong reflectance model, the * Relational calculus consists of two calculi, the tuple
strength of the specular highlight is determined relational calculus and the domain relational
by the angle between calculus, that are part of the relational model for
(a) the view vector and the normal vector databases and provide a declarative way to specify
(b) the light vector and the normal vector database queries.
(c) the light vector and the reflected vector * Relational algebra, Domain relational calculus
restricted to safe expression and tuple relational
(d) the reflected vector and the view vector
calculus restricted to safe expression have the same
Ans. (d) : Phong reflectance model : expressive power.
* It is local illumination model. In real world, light is Relation algebra's expressive power is not equal to
shown with the help of its spectrum. In computer Domain relational calculus or Tuple relational
graphics, light color is made of a triplet that is of three calculus unless they are restricted to safe operation.
colours RGB(red, green and blue). 32. Which of the following features is supported in
* The reflectance spectrum is a triple of percent the the relational database model?
light seen on a surface can be divided into four (a) Complex data-types
components such as : emissive component, ambient (b) Multivalued attributes
component, diffusive component, specula component. (c) Associations with multiplicities
Specular component : (d) Generalization relationships
UGC NET JRF Computer Science 84 YCT
Ans. (c) : RDBMS (Relational database management 34. In relational databases, if relation R is in
system) is structured in database tables. It stores the BCNF, then which of the following is true
data into collection of tables which are related by some about relation R?
fields. Goal of RDBMS is to generate a set of relation (a) R is in 4NF
scheme that allows as to store information without (b) R is not in 1 NF
unnecessary redundancy and to retrieve information (c) R is in 2NF and not in 3NF
easily. (d) R is in 2NF and 3NF
Composite data types : Those data types that are Ans. (d) : relation is in 'N' Normal form it means it
must be in 1NF, 2NF, ............... N-1 NF.
composed of other existing data types such as date,
images, time etc. They are used as objects. Complex standard Normal form hierarchy :→
data types are not allowed in RDBMS. These are stored 1NF → 2NF → 3NF → BCNF
in LOB, they cannot be accessed directly in RDBMS. So Relation is in BCNF then it must be in 1NF, 2NF, &
3NF Hence option 4 is correct.
Multivalued attributed : An attribute that contains more
35. Which of the following key constraints is
than one value for with it. It is not allowed in RDBMS.
required for functioning of foreign key in the
An attribute can contain only one value at one time.
context of relational data bases?
Association with multiplicities : → Multiplicity means (a) Unique key
the cardinality of a particular entity which can be (b) Primary key
associated with other entities. In terms of data base, it (c) Candidate key
means participation and cardinality of the relation. It is (d) Check key
allowed in RDBMS. Ans. (b) :
Generalization Relationship : Generalization means * Candidate Key →
combination of lower entities to form a higher entity • It can be null,
Entities are combined which have common attribute.
• It is null in that such case
33. With respect to relational algebra, which of the • Foreign key point to primary key.
following operations are included from * Alternate Key → unique and null
mathematical set theory? * If candidate key is null in such case foreign key
(A) Join points to primary key.
(B) Intersection though foreign keys can always point to primary
(C) Cartisian product key but not to candidate key.
(D)Project
(a) (A) and (D)
(b) (B) and (C)
(c) (C) and (D)
(d) (B) and (D)
Ans. (b) : Relational Algebra :→ It is a procedure
oriented language. In this, we use relation as values
instead of numbers. It works on relational model. Main
work is to retrieve data, perform operations such as
insert, delete, update etc.
* Basic operation in relational algebra are select,
Project, union, set difference, Cartesian product, 36. In relational database management, which of
rename. the following is/are property/properties of
candidate key?
* other operations are natural join, intersection
division. P : Uniqueness
* from the above options, operator that are included Q : Irreducibility
from mathematical set theory are intersection and (a) P only
Cartesian product. (b) Q only
* In mathematical set theory, intersection is used to (c) Both P and Q
find the common elements between two sets. It (d) Neither P nor Q
works same in relational algebra. Ans. (c) : candidate key : It uniquely identifies the
* Cartesian product is used to find the multiplication tuples in a relation. A candidate key is a super key with
of two sets by including common element only no redundant attribute. In a relation, there can be more
once. than one candidate key.

UGC NET JRF Computer Science 85 YCT

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

UGC NET JRF Computer Science 86 YCT

 Employee_id Manager_id Ans. (d) :
25 40 = (50 – 34) + (34 – 20) + (20 – 19) + (19 – 15) + ( 15 –
10) + (10 – 7) + ( 7 – 6) + (6 – 4) + (4 – 2) + (73 – 2)
40 45
= 16 + 14 + 1 + 4 + 5 + 3 + 1 + 2 + 2 + 71
45 25 = 119 ms
Apart from (20, 40) (30, 20) also gets deleted to 42. Match List-I with List-II
maintain the referential integrity of table.
List-I List-II
40. K-mean clustering algorithm has clustered the
(A) Disk (i) Thread
given 8 observations into 3 clusters after Ist
iteration as follows: (B) CPU (ii) Signal
C1 : {(3, 3), (5, 5), (7, 7)} (C) Memory (iii) File system
C2 : {(0, 6), (6, 0), (3, 0)} (D) Interrupt (iv) Virtual address
C3 : {(8, 8), (4, 4)} space
What will be the Manhattan distance for Choose the correct option from those given
observation (4, 4) from cluster centroid C1 in below :
second iteration? (a) (A)-(i), (B)-(ii), (C)-(iii), (D)-(iv)
(a) 2 (b) (A)-(iii), (B)-(i), (C)-(iv), (D)-(ii)
(c) (A)-(ii), (B)-(i), (C)-(iv), (D)-(iii)
(b) 2 (d) (A)-(ii), (B)-(iv), (C)-(iii), (D)-(i)
(c) 0 Ans. (b) :
(d) 18 List-I List-II
Ans. (a) : Manhattan distance is the distance between (A) Disk (iii) File system
two points measured at right angle along both the X-
(B) CPU (i) Thread
axis and Y-axis.
formula- It is calculated as : if there is a point P(X1, Y1) (C) Memory (iv) Virtual address
space
and Q(X2, Y2). Then Manhattan distance is
(D) Interrupt (ii) Signal
X 2 − X1 + Y2 − Y1
43. Consider that a process has been allocated 3
calculation : frames and has a sequence of page referencing
C1 : {(3, 3), (5, 5), (7, 7)} as 1, 2, 1, 3, 7, 4, 5, 6, 3, 1.
C2 : {(0, 6), (6, 0), (3, 0)} What shall be the difference in page faults for
C3 : {(8, 8), (4, 4)} the above string using the algorithms of LRU
first point is (4, 4) and optimal page replacement for referencing
the string?
we have to find the Manhattan distance for cluster C1 in
(a) 2
2nd iteration :
(b) 0
for 2nd iteration : points will be
(c) 1
 (\left({\frac{1}{3}\left({3 + 5 + 7}\ right)}\right), (d) 3
\left ({\frac{1}{3}\left({3 + 5 + 7}\right )}\right) =
Ans. (a) : LRU ALGORITHM :- Replace the least
\left({5,\;5}\right)\)
recently used page if frames are not empty.
So Manhattan distance = 5 − 4 + 5 − 4 = 1 + 1 = 2
41. Consider a disk system with 100 cylinders. The
requests to access the cylinders occur in the
following sequence :
4, 34, 10, 7, 19, 73, 2, 15, 6, 20
Assuming that the head is currently at cylinder
50, what is the time taken to satisfy all requests
if it takes 1ms to move from the cylinder to
adjacent one and the shortest seek time first
policy is used? XL denotes the frames to be replaced
(a) 357 ms ∴ Total page faults = 9
(b) 238 ms Optimal page Replacement Algorithm :- Replace the
(c) 276 ms page which will not be used for longest duration of time
(d) 119 ms if the frames are not empty.
UGC NET JRF Computer Science 87 YCT
 So, here only 2 switching possible (when we did not
consider the starting and ending switching)
Now here might be confusion that at t = 2. P1 is
preempted and check that available process have
shortest job time or not, but he did not get anyone So it
should not be consider as context switching.
46. At a particular time of computation, the value
XR denotes the frames to be replaced of a counting semaphore is 7. Then 20 P (wait)
operations and 15V (signal) operations are
∴ Total page faults = 7
completed on this semaphore. What is the
∴ Difference in LRU and optimal page replacement resulting value of the semaphore?
page faults = (9 – 7) = 2
(a) 28
44. Which of the following are Not shared by the (b) 12
threads of the same process? (c) 2
(A) Stack (d) 42
(B) Registers
Ans. (c) : I → P represent wait and v represent signal. P
(C) Address space
operation will decrease the value by 1 every time and Y
(D) Message queue operation will increase the value by 1 every time.
(a) (A) and (D) Value of counting semaphore = 7
(b) (B) and (C) After 20 P operations value of semaphore = 7 – 20
(c) (A) and (B) = –13
(d) (A), (B) and (C)
After 15 v operations value of semaphore
Ans. (c) : "In general each thread has its own registers = –13 + 15 = 2
(including its own program counter), its own stack
47. The minimum number of page frames that
pointer, and its own stack. Everything else is shared
must be allocated to a running process in a
between the threads sharing a process,
virtual memory environment is determined by
why register cannot be shared?
(a) page size
Each thread needs its own program counter value
(b) physical size of memory
(which is a register)
(c) the instruction set architecture
why stack cannot be shared?
(d) number of processes in memory
Each thread may have its own calling sequence.
So stack and registers is correct. Ans. (c) : There are two important task in virtual
memory management : a page replacement strategy and
45. Consider three CPU intensive processes, which a frame-allocation strategy. Frame allocation strategy
require 10, 20 and 30 units of time and arrive say gives the idea of minimum number of frames that a
at times 0, 2 and 6 respectively. How many process must be allocated is dependent on system
context switches are needed if the operating architecture, and corresponds to the number of pages
system implements a shortest remaining time that could be touched by a single (machine) instruction.
first scheduling algorithim? Do not count the So the instruction set architecture is right answer.
context switches at time zero and the end.
48. A computer has six tape drives with n processes
(a) 4
competing for them. Each process may need
(b) 2 two drives. What is the maximum value of n for
(c) 3 the system to be deadlock free?
(d) 1 (a) 5
Ans. (b) : Let three process be P0, P1 and P2 with (b) 4
arrival times 0, 2 and 6 respectively and CPU burst (c) 3
times 10, 20 and 30 respectively. At time 0, P0 is the (d) 6
only available process so it runs. At time 2, P1 arrives, Ans. (a) : Given tape drive = 6 and each process may
but P0 has the shortest remaining time, So it continues need 2 drive.
At time 6, P2 arrives, but P0 has the shortest remaining When we give 1 drive to 1 process then total process
time process. At time 30, P2 is scheduled. Only two will be 6 but in this case there will definitely deadlock
context switches are needed. P0 to P1 and P1 to P2. occur because every process contain 1 drive and waiting
Processes executes as per the following Gantt chart for another drive which is hold by other process
UGC NET JRF Computer Science 88 YCT
therefore when we reduce 1 process then system to be (c) P and Q
deadlock free. (d) Neither P nor Q
Hence maximum value of n = 6 – 1 = 5 Ans. (b) : statements P : In software engineering,
49. A processor can support a maximum memory defects that are discovered, defects that are discovered
of 4 GB where memory is word addressable earlier are more expensive to fix.
and a word is 2 bytes. What will be the size of This statement is not correct. In software engineering,
the address bus of the processor? defects which are early detected are easier to fix. It
(a) At least 28 bits reduces error fixing cost. It increases the productivity.
(b) At least 2 bytes Early defect detection improves the overall quality of
(c) At least 31 bits software.
(d) Minimum 4 bytes Statement Q : A software design is said to be a good
design, if the components are strongly cohesive and
Ans. (c) : Maximum Memory = 4GB = 232 bytes weakly coupled.
size of a word = 2 bytes Coupling : Coupling in software engineering mean
Therefore, Number of words = 232/2 = 231 interdependence between the modules. Cohesion means
So, we require 31 bits for the address bus of the how the elements of one module are related with each
processor. other. It means intra-dependency between the module.
50. Which of the following UNIX/Linux pipes will For a good software design, low coupling and high
count the number of lines in all the file having c cohesion is desired.
and h as their extension in the current working 52. The M components in MVC are responsible for
directory? (a) user interface
(a) cat*ch|wc–1 (b) security of the system
(b) cat*[c–h]|wc–1 (c) business logic and domain objects
(c) cat*[ch]|1s–1 (d) translating between user interface
(d) cat*[ch]|wc–1 actions/events and operations on the domain
objects
Ans. (d) : Pipes in Linux/Unix : Pipe is a command
which produces an output which serves as input for next Ans. (c) : MODEL-VIEW-CONTROLLER (MVC):
command. It works as a pipeline structure in computer. * MVC refers to three different realms of
Explanation : responsibility in the design of a graphical user
interface.
We have to find the number of lines in all the files
having .c and .h as their extension in the current * when the MVC pattern is applied to a component
the model consists of the data that represents the
working directory.
current state of the component.
WC- in Unix/Linux, "WC" is used for word count.
* The view is simply the visual presentation of the
Cat- it is used to display the content of the files. component on the screen.
Option 4- Cat * .[ch] //it represent the content of files * The controller is the aspect of the component that
having .c and .h extension carries out actions in response to events generated
Option 2 → by the user (or by other source such as timers).
Cat * [c -h]/ WC-L //it also includes the files with c and The idea is to assign responsibility for the model,
.h extension but it also considers the other extensions the view, and the controller to different objects.
that come between because it is a range which is not 53. In the context of software testing, which of the
required in this question. following statements is/are Not correct?
So cat * [ch]/WC-L P : A minimal test set that achieves 100% path
It will count the number of Lines in all the files having coverage will also achieve 100% statement
.c and .h as their extension in current working directory. coverage.
51. Which of the following statements is/are true? Q : A minimal test set that achieves 100% path
P : In software engineering, defects that are coverage will generally detect more faults than
discovered earlier are more expensive to fix. one that achieves 100% statement coverage.
Q : A software design is said to be a good design, if R : A minimal test that achieves 100% statement
the components are strongly cohesive and coverage will generally detect more faults than
weakly coupled. one that achieves 100% branch coverage.
Select the correct answer from the options (a) R only
given below : (b) Q only
(a) P only (c) P and Q only
(b) Q only (d) Q and R only

UGC NET JRF Computer Science 89 YCT

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

UGC NET JRF Computer Science 90 YCT

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

UGC NET JRF Computer Science 91 YCT

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

UGC NET JRF Computer Science 93 YCT

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

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

approach. a (mod P).

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

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

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

UGC NET JRF Computer Science 96 YCT

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

UGC NET JRF Computer Science 97 YCT

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

UGC NET JRF Computer Science 98 YCT

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

3) Then again min value is considered

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

value

92. Match List-I with List-II

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

UGC NET JRF Computer Science 100 YCT

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

UGC NET JRF Computer Science 101 YCT

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

biological organisms.
0 − (1) (1 + e −2x ) − (1) ( e −2x ) ( −2 )
d
Explanation: Genetic algorithm use a direct analogy of
dx =
natural behavior. They work with a population of =
individuals, each representing a possible solution to a (1 + e −2x ) (1 + e−2x )
2

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

score according to how good a solution to the problem it =
(1 + e−2x )
2

is. The highly fit individual are given opportunities to

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

UGC NET JRF Computer Science 102 YCT

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

UGC NET JRF Computer Science 105 YCT

17. The second smallest of n elements can be found 20. Suppose a cloud contains software stack such
with _______ comparisons in the worst case. as Operating systems, Application softwares,
3n etc. This model is referred as _______ model.
(a) n – 1 (b)
2 (a) MaaS (b) SaaS
(c) n + ceil(lg n) – 2 (d) lg n (c) LaaS (d) PaaS
Ans. (c) : The second smallest of n elements can be Ans. (b) :
found with n + ceil(lg n) – 2 comparisons in the worst
case
18. Consider the following statements related to
AND-OR Search algorithm.
S1 A solution is a subtree that has a goal node at
every leaf.
S2 OR nodes are analogous to the branching in a
deterministic environment.
S3 AND nodes are analogous to the branching in
a non-deterministic environment.
Which one of the following is true referencing
the above statements?
Choose the correct answer from the code given
below :
Code :
(a) S1 – False, S2 – True, S3 – True
(b) S1 – True, S2 – True, S3 – False 21. What does the following Java function
(c) S1 – True, S2 – True, S3 – True perform? (Assume int occupies four bytes of
(d) S1 – False, S2 – True, S3 – False storage)
Ans. (c) : A solution for an AND-OR search problem public static int f(int a)
is a subtree that { //Pre-conditions : a > 0 and no overflow /
(1) has a goal node at every leaf underflow occurs
(2) specifies one action at each of its OR nodes
int b = 0;
(3) includes every outcome branch at each of its
AND nodes for (int i = 0; i < 32; i++)
(4) OR nodes are analogous to the branching in a {
deterministic environment. b = b << 1;
(5) AND nodes are analogous to the branching in a b = b | (a & 1);
non-deterministic environment. a = a >>>1; // This is a logical shift
19. A binary search tree is constructed by inserting }
the following numbers in order : return b;
60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34 }
The number of nodes is the left subtree is (a) Returns the int that has the binary
(a) 5 (b) 6 representation of integer a.
(c) 3 (d) 7 (b) Return the int that represents the number of
Ans. (d) : Binary Search Tree–The left subtree of a 0's in the binary representation of integer a.
contains only < ROOT (c) Return the int that represents the number of
The right subtree of a node contains only nodes > 1's in the binary representation of integer a.
ROOT (d) Return the int that has the reversed binary
The left and right subtree each must also be a binary representation of integer a.
search tree.
Ans. (d) : Return the into that has the reversed binary
representation of integer a.
Output:
a = 5, b = 9
a&b=1
a | b = 13
a ^ b = 12
~a = 250
b<<1 = 18
So, option is 7 on left subtree. b>>1 = 4
UGC NET JRF Computer Science 106 YCT
22. A host is connected to a department network Ans. (b) : SMI = Mt – ( Fa + Fc + Fd)/Mt, Where
which is part of a university network. The SMI – is the Software Maturity Index value
university network, in turn, is part of the Mt – is the number of software functions/modules in
Internet. The largest network, in which the the current release
Ethernet address of the host is unique, is Fc – is the number of functions/modules that contain
(a) the department network changes from the previous release
(b) the Internet Fa – is the number of functions/modules that contain
(c) the subnet to which the host belongs additions to the previous release
(d) the university network Fd – is the number of functions/modules that are
Ans. (b) : Ethernet address is basically the MAC deleted from the previous release.
address, which is supposed to be unique to a NIC. SMI =(940 - (40 + 90 + 12 )) /940
Thus it is unique over the Internet. =0.8489
23. Find the boolean expression for the logic circuit =0.849
shown below : 26. If the frame buffer has 10-bits per pixel and 8-
(1-NAND gate, 2-NOR gate, 3-NOR gate) bits are allocated for each of the R, G, and B
components, then what would be the size of the
colour lookup table (LUT)?
(a) (210 + 211) bytes (b) (210 + 224) bytes
(c) (28 + 29) bytes (d) (210 + 28) bytes
Ans. (a) : Number of indexes the frame buffer = 210 =
1024
Size of each entry = 8 bits for R component + 8 bits for
(a) AB (b) AB G component + 8 bits for B component = 24 bits = 3
(c) AB (d) AB Bytes
Size of frame buffer = 1024 * 3 = (210 + 211) bytes
Ans. (c) :
27. An attribute A of datatype varchar (20) has the
value 'xyz', and the attribute B of datatype
char(20) has the value "Imnop", then the
attribute A has _______ spaces and attribute B
has ______ spaces.
(a) 3, 5 (b) 20, 5
(c) 20, 20 (d) 3, 20
So, option (c) is correct. Ans. (d) : char is a fixed-length data type, the storage
size of the char value is equal to the maximum size for
24. Suppose P, Q and R are co-operating processes this column.
satisfying Mutual Exclusion condition. Then, if
→ varchar is a variable-length data type, the storage
the process Q is executing in its critical section
size of the varchar value is the actual length of the data
then entered, not the maximum size for this column.
(a) Neither 'P' nor 'R' executes in their critical → So, A varchar(20) has only 3 spaces because its
section. initialized to 'xyz' and B char(20) has 20 spaces as char
(b) Both 'P' and 'R' execute in critical section. data type occupies the storage space equivalent to the
(c) 'P' executes in critical section. maximum size.
(d) 'R' executes in critical section. 28. Consider the following grammar G :
Ans. (A) : Suppose P, Q and R are co-operating S→A|B
processes satisfying Mutual Exclusion condition. A→a|c
Then, if the process Q is executing in its critical B→b|c
section then Neither 'P' nor 'R' executes in their critical
where {S, A, B} is the set of non-terminals, {a,
section.
b, c} is the set of terminals.
25. A legacy software system has 940 modules. The Which of the following statement(s) is/are
latest release required that 90 of these modules correct?
be changed. In addition, 40 new modules were S1 : LR(1) can parse all strings that are
added and 12 old modules were removed. generated using grammar G.
Compute the software maturity index for the S2 : LL(1) can parse all strings that are
system. generated using grammar G.
(a) 0.524 (b) 0.849 Choose the correct answer from the code given
(c) 0.923 (d) 0.725 below :
UGC NET JRF Computer Science 107 YCT
 Code :
(a) Neither S1 nor S2 (b) Both S1 and S2
(c) Only S2 (d) Only S1
Ans. (a) : First Leftmost Derivation
S→F
F→c
Second Leftmost Derivation
S→H
H→c
An Ambiguous grammar can neither be
LR(1) nor LL(1)
Or Neither S1 nor S2.
29. Consider the following method :
int f(int m, int n, boolean x, boolean y)
{
int res = 0;
if(m < 0) {res = n – m;}
else if (x || y) {
res = –1;
if(n = = m) {res = 1;}
}
else {res = n;}
return res;
} /* end of f*/
If P is the minimum number of tests to achieve
full statement coverage for f(), and Q is the
minimum number of tests to achieve full
branch coverage for f(), then (P, Q) =
(a) (3, 2) (b) (3, 4)
(c) (2, 3) (d) (4, 3)
Ans. (b) : Lets consider first for full branch coverage.
Here there are 4 possible cases of branching which are
:- Case 1. The first "if" condition is true, which happen
when m<0 Case 2:- The else if condition is true which
happen when m>0. Case 3. The second "if" condition
is true, which happen when P=3; Case 4:- The else if
condition is true which happen when Q=4.
30. WFLQ=_fLvmd)QL;vRd)-:_A;Lg--fAv)d)g_gz--Av d)A_;A--fAv)d)g_gz-f2L2gQ2reFfF_ g:Lv3d)f_

UGC NET JRF Computer Science 108 YCT

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

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

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

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

UGC NET JRF Computer Science 234 YCT

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

UGC NET JRF Computer Science 236 YCT

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

UGC NET JRF Computer Science 239 YCT

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

C 14 4 10 13 30 databases are true?

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

UGC NET JRF Computer Science 242 YCT

70. Consider a unit square centred at origin. The (a) Pareto analysis is a statistical method used
coordinates of the square are translated by a for analyzing causes, and is one of the
1  primary tools for quality management
factor  ,1  and rotated by an angle of 90o. (b) Reliability of a software specifies the
2  probability of failure-free operation of that
What shall be the coordinates of the new software for a given time duration
square?
- 2
1

- 2
1

- 2
3

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

,
1
,

,
1
,

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

1 2

3 2

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

1 2

- 2
3

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

,
1
,

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

1 2

- 2
3

- 2
3
,
0
,
,
1
,

,
1
,

,
0

So answer is option (d)

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

UGC NET JRF Computer Science 246 YCT

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

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

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

Therefore, postorder is - debfgca

UGC NET JRF Computer Science 247 YCT

23. Level order Traversal of a rooted Tree can be Codes :
done by starting from root and performing : A B C D
(a) Breadth first search (b) Depth first search (a) (iv) (i) (ii) (iii)
(c) Root search (d) Deep search (b) (ii) (i) (iv) (iii)
Ans. (a) : Level order traversal is similar to breadth (c) (ii) (iv) (iii) (i)
first search whereas preorder traversal is similar to (d) (ii) (iv) (i) (iii)
depth first search. Ans. (d) :
So answer is (a) 23 port number is (TELNET) that uses by remote login
24. The average case occurs in the Linear search 25 port number is (SMTP) that uses by E-mail
Algorithm when 80 port number is (HTTP) that uses by world wide web
(a) The item to be searched is in some where 119 port number is used by USENET news
middle of the array
28. Which of the following is not associated with
(b) The item to be searched is not in the array the session layer?
(c) The item to be searched is in the last of the (a) Dialog control
array
(b) Token management
(d) The item to be searcher is either in the last or
(c) Semantics of the information transmitted
not in the array
(d) Synchronization
Ans. (a) : Linear search runs in at worst linear time
and make at most n comparisons, where n is the length Ans. (c) : Semantics of the information transmitted is
of the list. If each element is equally likely to be not associated with the session layer but associated
searched then the linear search has an overage case of with presentation layer
(n/2) comparisons, but the average case can be affected So answer is (c)
if the search probability for each element vary. 29. What is the size of the 'total length' in IPv4
25. To determine the efficiency of an algorithm the datagram?
time factor is measured by: (a) 4 bits (b) 8 bits
(a) Counting micro seconds (c) 16 bits (d) 32 bits
(b) Counting number of key operations Ans. (c) : Total length 16 bit field define the entire
(c) Counting number of statements packet size in IPv4, including header and data, in
(d) Counting kilobytes of algorithm bytes. The minimum length packet is 20 bytes (20 byte
Ans. (b) : The complexity is commonly estimated by header. + 0 byte data) and maximum is 65, 535 bytes
counting the number of elementary operations the maximum value of a 16 bit word.
performed by the algorithm, where an elementary 30. Which of the following is/are restriction (s) in
operation takes a fixed amount of time to perform. classless addressing?
Thus the amount of time taken and the number of (a) The number of addresses needs to be power
elementary operations performed by the algorithm of 2
differ by at most a constant factor. (b) The mask needs to be include in the address
26. Which of the following protocols is an to define the block
application layer protocol that establish, (c) The starting address must be divisible by the
manages and terminates multimedia sessions? number of addresses in the block
(a) Session maintenance protocol (d) All of the above
(b) Real – time streaming protocol Ans. (d) : In class addressing : (1) the number of
(c) Real – time transport control protocol addresses needs to be power of 2
(d) Session Initiation protocol (2) The mask needs to be included in the address to
Ans. (d) : Session initiation protocol is an application define the block
layer control protocol that can establish, modify & (3) The starting address must be divisible by the
terminate multimedia sessions such as internet number of addresses in block
telephony calls. So answer is (d)
27. Match the following port numbers with their 31. Match the following :
uses : List – I List - II
List - I List - II (A) Forward (i) Assembler
(A) 23 (i) World wide web Reference directive
(B) 25 (ii) Remote login Table
(C) 80 (iii) USENET news (B) Mnemonic (ii) Uses array data
(D) 119 (iv) E-mail Table structure
UGC NET JRF Computer Science 248 YCT
 (C) Segment (iii) Contains 35. Which phase of compiler generates stream of
Register machine OP atoms?
Table code (a) Syntax Analysis (b) Lexical Analysis
(D) EQU (iv) Uses linked list (c) Code Generation (d) Code Optimization
data structure Ans. (a) : Syntax analysis is the second phase of a
Codes : compiler. A syntax analyzer takes the input from a
A B C D lexical analyzer in the form of taken streams. The
(a) (ii) (iii) (iv) (i) parser analyzer the source code against the production
(b) (iii) (iv) (ii) (i) rules to detect any errors in the code & the output of
(c) (iv) (i) (iii) (ii) the phase is stream of atoms.
(d) (iv) (iii) (ii) (i)
36. A disk drive has 100 cylinders, numbered 0 to
Ans. (d) : 99. Disk requests come to the disk driver for
(a) Forward reference table uses linked list data cylinders 12, 26, 24, 4, 42, 8 and 50 in that
structure so it satisfies (iv) order. The driver is currently serving a request
(b) Mnemonic table contains machine op code, so it at cylinder 24. A seek takes 6 msec per cylinder
satisfies (iii)
moved. How much seek time is needed for
(c) Segment register table uses array data structure so
shortest seek time first (SSTF) algorithm?
it satisfies (ii)
(d) EQO satisfies (i) (a) 0.984 sec (b) 0.396 sec
(c) 0.738 sec (d) 0.42 sec
32. The translator which performs macro calls
expansion is called : Ans. (d) : Given requests is: 12, 26, 24, 4, 42, 8, 50
(a) Macro processor Using SSTF (shortest seek time first) algorithm:
(b) Micro pre-processor Total distance covered
(c) Macro pre-processor = 2 + 22 + 46 = 70
(d) Dynamic Linker Total seek time is:
Ans. (c) : Translator which performs macro calls = 70 × 6 msec
expansion is called macro pre-processors = 70 × 6 × 10-3 sec = 0.42 sec
33. If all the production rules have single non- 37. Let Pi and Pj be two processes, R be the set of
terminal symbol on the left side, the grammar variables read from memory, and W be the set
defined is : of variables written to memory. For the
(a) context free grammar concurrent execution of two processes Pi and Pj
(b) context sensitive grammar which of the following conditions is not true?
(c) unrestricted grammar (a) R(Pi) ∩ W(Pj) = Φ
(d) phrase grammar (b) W(Pi) ∩ R(Pj) = Φ
Ans. (a) : Context free grammar is a set of recursive (c) R(Pi) ∩R(Pj) = Φ
rewriting rules used to generate patterns of strings. It is (d) W(Pi) ∩W(Pj) = Φ
consisting of finite set of grammar rules is a quadruple
& if all the production rule have single non-terminal Ans. (c) : Reading of two process won't create any
symbol on the left side, the grammar defined is context problem,
free grammar So answer is (c)
i.e. V → (T + V)+ 38. A LRU page replacement is used with four
34. Which one from the following is false? page frames and eight pages. How many page
(a) LALR parser is Bottom – up parser faults will occur with the reference string
0172327103 if the four frames are initially
(b) A parsing algorithm which performs a left to
empty?
right scanning and a right most deviation is
RL (1) (a) 6 (b) 7
(c) LR parser is Bottom - Up parser (c) 5 (d) 8
(d) In LL (1), the 1 indicates that there is a one - Ans. (b) :
symbol look - ahead. 1 2 3 4 5 hit hit hit 6 7
Ans. (b) : There is nothing RL (1) parsing we have LR 0 0 0 0 3 3 3 3 0 0
(1) parsing algorithm where L stands for left to right 1 1 1 1 1 1 1 1 1
scanning of the input string & R signifies that we will
7 7 7 7 7 7 7 7
get a right most derivation. LALR & LR are bottom up
parsers. 2 2 2 2 2 2 3
So answer (b) Total Page fault = 7

UGC NET JRF Computer Science 249 YCT

39. What does the following command do? Codes :
grep – vn "abc" x A B C D
(a) It will print all of the lines in the file x that (a) (iii) (iv) (i) (ii)
match the search string "abc" (b) (ii) (i) (iv) (iii)
(b) It will print all of the lines in file x that do not
(c) (iv) (ii) (iii) (i)
match the search string "abc"
(c) It will print the total number of lines in the (d) (iii) (i) (iv) (ii)
file x that match the string "abc" Ans. (d) :
(d) It will print the specific line numbers of the (a) Size oriented metrics is directly implied with (iii)
file x in which there is a match for string (b) Function oriented metrics is number of user inputs,
"abc" number of user outputs, number of files, number of
Ans. (b) : Grep (globally search a regular expression external interfaces. So it satisfies (i)
& print it) with –V (verbose) option display those line (c) Extended function point metrics is a superset of the
which do not contain the specified string. function point measure that can be applied to system. It
So answer is (b) uses algorithm characteristics as one of the
40. The Unix Kernel maintains two key data measurement parameter.
structures related to processes, the process (d) Function point is a "unit of measurement" to
table and the user structure. Which of the express the amount of business functionality an
following information is not the part of user information provides to a user.
structure? 42. In which testing strategy requirements
(a) File descriptor table established during requirements analysis are
(b) System call state validated against developed software?
(c) Scheduling parameters (a) Validation testing (b) Integration testing
(d) Kernel stack (c) Regression testing (d) System testing
Ans. (c) : The unix kernal maintains two key data Ans. (a) : Validation is "Are we building the right
structures related to processes, the process table and
product? According to the capability maturity model
the user structure. In user structure there is no place for
scheduling parameter process table stores the Software validation : The process of evaluating
information of all running process. The process table software during or at the end of the development
contains process ID's, memory usage of the process, process to determine whether it satisfies specified
what are file descriptor used in the process. So, option requirements.
(c) is correct. 43. Which process model is also called as classic
41. Match the following : life cycle model?
List - I List - II (a) Waterfall model (b) RAD model
(A) Size- (i) Uses number of (c) Prototyping model (d) Incremental model
oriented external Ans. (a) : The waterfall model was first process model
metrics interfaces as one to be introduce.
of the
measurement • It is also referred as linear sequential life cycle
parameter model
(B) Function- (ii) Originally • It is very simple to understand and use. In this each
oriented designed to be phase must be complicated fully before the next
metrics applied to phase can begin.
business • In this model the testing stands only after the
information development is complete
system
• In this model phases do not overlap
(C) Extended (iii) Derived by
function normalizing 44. Cohesion is an extension of :
point quality and/or (a) Abstraction concept
metrics productivity (b) Refinement concept
measures by (c) Information hiding concept
considering the (d) Modularity
size of the
Ans. (c) : A cohesion module performs a single task
software
within a software procedure, requiring little interaction
(D) Function (iv) uses algorithm with little procedures in other parts of software.
point characteristics
as one of the Type of cohesion :
measurement • A module that performs takes that are related
parameter logically is logically cohesion
UGC NET JRF Computer Science 250 YCT
 • When a module contains takes that are related by PVM task and that there is no limit to the size
the fact that all must be executed with the same or number of such messages
span of time, the exhibits temporal cohesion (d) In PVM model, the message order is not
• At the low end of the spectrum, a module that preserved.
performs a set of takes that relate to each other Ans. (d) : Fault tolerance through dynamic addition &
loosely called coincidentally cohesive. deletion of hosts/processes.
45. Which one from the following is highly A widely used parallel message passing library defines
associated activity of project planning? • How takes communicative or synchronize with
(a) Keep track of the project progress each other
(b) Compare actual and planned progress and 48. Which of the following algorithms sort n
costs integers, having the range 0 to (n2 – 1), in
(c) Identify the activities, milestones and ascending order in O(n) time?
deliverables produced by a project (a) Selection sort (b) Bubble sort
(d) Both (b) and (c) (c) Radix sort (d) Insertion sort
Ans. (c) : Project planning is commonly perceived as Ans. (c) : Radix sort take O(n) time, so answer is (c)
creating 'Gantt chart', which is incorrect. Gantt chart is 49. Which of the following statements is FALSE
merely visual representation of project schedule. about weak entity set?
(a) Weak entities can be deleted automatically
when their strong entity is deleted
(b) Weak entity set avoids the data duplication
and consequent possible inconsistencies
caused by duplicating the key of the strong
entity
(c) A weak entity set has no primary keys unless
attributes of the strong entity set on which it
depends are included
(d) Topples in a weak entity set are not
46. In the case of parallelization, Amdahl's law partitioned according to their relationship
states that if P is the proportion of a program with topples in a strong entity set
that can be made parallel and (1–P) is the Ans. (d) : We have weak entities for several reasons :
proportion that cannot be parallelized, then the • We want to avoid the data duplication and
maximum speed-up that can be achieved by consequent entity. Possible inconsistencies caused
using N processors is : by duplicating the key of strong.
1 1 • Weak entities be stored physically with their strong
(a) (b)
( )
1 − P + N.P ( N − 1)P + P entities
1 1 • Weak entities can be detected automatically when
(c) (d)
(1 − P ) +
P
P+
(1− P)
their strong entity is detected.
So (d) is incorrect statement, Hence (d) is the answer.
N N
50. Which of the following is not valid with
Ans. (c) : Amdahl's law states that if P is the reference to message passing interface (MPI)?
propagation of a program that can be made parallel &
(a) MPI can run on any hardware platform
(1 – P) is the propagation that cannot be parallelized,
then the maximum speed up that can be achieved by (b) The programming model is a distributed
using N processors is. memory model
(c) All parallelism is implicit
1
(d) MPI - Comm. - size returns the total number
P
(1 − P ) + of MPI processes in specified communication
N
Ans. (c) : Message passing interface (MPI) is a
47. Which of the following statement is incorrect standardized and portal message passing system.
for parallel virtual machine (PVM)?
• It can run on any hardware platform. It is portable,
(a) The PVM communication model
efficient, flexible.
asynchronous blocking send, asynchronous
blocking receive, and non-blocking receive • It has become a de facto standard for
function. communication among memory system.
(b) Message buffers are allocated dynamically • MPI – Comm. – Size returns the total number of
(c) The PVM communication model assumes MPI processes in specified communication.
that any task can send a message to any other So answer is (c)

UGC NET JRF Computer Science 251 YCT

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

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

4 4
(a) CALL 0010 H (b) CALL 0034 H
6. The number of flip-flops required to design a
(c) CALL 0035 H (d) CALL 003C H
modulo – 272 counter is :
Ans : (c)
(a) 8 (b) 9
Interrupt Vector Address (c) 27 (d) 11
RST0 0000 H Ans : (b) Remember with 'n' number of flip-flop you
RST1 0005 H can get upto maximum modulo - (2n) counter.
RST2 0010 H Since 29 = 512 > 272 it can satisfy the condition.
UGC NET JRF Computer Science 252 YCT
7. Let E1 and E2 be two entities in E-R diagram (b) Non_key attribute V_name is dependent on
with simple single valued attributes. R1 and R2 Qty_sup
are two relationships between E1 and E2 where (c) Key attribute Qty_sup is dependent on
R1 is one - many and R2 is many - many. R1 primary_key unit price
and R2 do not have any attribute of their own. (d) Key attribute V_ord_no is dependent on
How minimum number of tables are required primary_key unit price
to represent this situation in the Relational Ans : (a) Option (a) is which it is clearly mentioned
model? that partial dependency exists is against 2NF principle.
(a) 4 (b) 3 Question seems incomplete, because there is nothing
(c) 2 (d) 1 said about functional dependency.
Ans : (b) One table for each entity : 2 11. The relation schemas R1 and R2 form a
R1 is one to many (No separate table): 0 Lossless join decomposition of R if and only if :
R2 is many to many and requires one separate table: 1 (1) R1 ∩R2 → → (R1 – R2)
Total number of tables: 3 (2) R 1 →R 2

8. The STUDENT information in a university (3) R1 ∩ R2 → → (R2 – R1)

stored in the relation STUDENT (Name, SEX, (4) R2 → R1 ∩ R2
Marks, DEPT _Name) Codes :
Consider the following SQL query SELECT (a) (1) and (2) happens
DEPT_Name for STUDENT where SEX = 'M' (b) (1) and (4) happens
group by DEPT_Name having avg (Marks) > (c) (1) and (3) happens
SELECT avg (Marks) STUDENT. It Returns (d) (b) and (3) happens
the Name of the Department for which : Ans : (c) Let F be a set of functional dependencies on
(a) The average marks of male students is more R, and R1 and R2 form a decomposition of R. The
than the average marks of students in the decomposition is a lossless join decomposition of R if at
same Department least one of the following functional dependencies are
+
(b) The average marks of male students is more in F
than the average marks of students in the 1– R1 ∩ R2 → R 1
University 2– R1 ∩ R2 → R 2
(c) The average marks of male students is more
than the average marks of male students in 12. In the indexed scheme of blocks to a file, the
the University maximum possible size of the file depends on :
(d) The average marks of students is more than (a) The number of blocks used for index and the
the average marks of male students in the size of index
University (b) Size of Block and size of Address
(c) Size of index
Ans : (b) The average marks of male students is more
than the average marks of student in the university. (d) Size of Block
Ans:(a) When indexes are created, the maximum
9. Select the 'False' statement from the following
number of blocks given to a file depends upon the size
statements about Normal forms : of the index which indicates the number of blocks
(a) Lossless preserving decomposition into 3NF required and size of each block.
is always possible 13. Give the number of principal vanishing point
(b) Lossless preserving decomposition into (s) along their direction for the standard
BCNF is always possible perspective transformation :
(c) Any Relation with two attributes is in BCNF (a) Only one in the direction K
(d) BCNF is stronger than 3NF (b) Two in the directions I and J
Ans : (c) A BCNF decomposition which is both (c) Three in the directions I, J and K
lossless as well as dependency preserving at the same (d) only two in the directions J and K
time is not always possible. Ans : (a) In this case the view plane normal n is vector.
Example: Relation R(a, b, c) with FDs ( ab → c, c → b ) Since N.I = 0 & N.J =0, so there are no vanishing points
cannot be preserved when decomposition is done. in the direction I & J. On the other hand N.K. = K.K =
10. The Relation 1. Thus there is only one principal vanishing point & it
is in k direction.
Vendor Order (V_no, V_ord_no, V_name,
Qty_sup, unit_price) 14. Consider a triangle A (0,0), B(1,1) and C(5,2).
is in 2NF because : The triangle has to be rotated by an angle of
(a) Non_key attribute V_name is dependent on 45o about the point P(–1, –1). What shall be the
V_no which is part of composite key coordinates of the new triangle?
UGC NET JRF Computer Science 253 YCT
 ( )
(a) A ' = 1, 2 − 1 , B' = −1,2 2 − 1( ) 16. Which of the following is not a basic primitive
of the Graphics kernel system (GKS) ?
 9 
and C ' =  3 2 − 1, 2 − 1 (a) POLYLINE (b) POLYDRAW
 2  (c) FILL AREA (d) POLYMARKER
( ) (
(b) A ' = 1, 2 − 1 , B' = 2 2 − 1, −1 ) Ans : (b) The main five primitives in graphics kernel
system (GKS)
 9 
and C ' =  3 2 − 1, 2 − 1 (1) Polyline : which draw a sequence of connected
 2  line segments
( )
(c) A ' = −1, 2 − 1 ,B' = −1, 2 2 − 1 ( ) (2) Polymarker : Which marks a sequence of points
with same symbol.
 9 
and C ' =  3 2 − 1, 2 − 1 (3) Fill area : which displays a specified area.
 2  (4) Text : which dreams a string of characters
(d) A ' = ( ) (
2 − 1, −1 ,B' = −1, 2 2 − 1 ) (5) Cell array : which displays an image composed of
a variety of colors or grey scales.
 9 
and C ' =  3 2 − 1, 2 − 1 17. Which of the following statement(s) is/are
 2  incorrect?
Ans : (c) (1) Mapping the co-ordinates of the points and
1 0 0  2 /2 2 / 2 0 lines that form the picture into the
    appropriate co-ordinates on the device or
R45 p = 0 1 0 − 2 /2 2 / 2 0 workstation is known as viewing
1 1 1  
   0 0 1 transformation
  (2) The right-handed Cartesian co-ordinates
 2 /2 0 system in whose co-ordinates we describe the
 1 0 0 
2 /2
 picture is known as world co-ordinate system
  − 2 /2
 0 1 0  = 2 /2 0 (3) The co-ordinate that corresponds to the
 −1 −1 1   
   −1
 ( 2 −1 ) 1

device or workstation where the image is to
be displayed is known as physical device co-
Now, ordinate system
 0
(4) Left - handed co-ordinate system in which
 A '  A  0 0 1  − 2 / 2 2 /2
 the display area of the virtual display device
 B'  =  B  Rus.P = 1 1 1  − 2 / 2 0
       2 /2
 corresponds to the unit ( x ) square whose
 C'   C  5 2 1  −1
 ( 2 −1 ) 1

lower left-hand corner is at the origin of the
co-ordinate system, is known as normalized
 
( )
device co-ordinate system
 −1 2 −1 1
  (a) (1) only (b) (1) and (2)

=  −1 (
2 2 − 1 1 ) (c) (3) only (d) (4) only
Ans : (d) Normalized device co-ordinate system make
 
  3 2 − 1  9 2 − 1 1 up a coordinate system that describes positions on a
 2 
  2   virtual plotting device. The left corresponds to (0,0) &

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

UGC NET JRF Computer Science 255 YCT

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

W1 W2 W3 Supply

↓ F1 16 20 12 200
Factory F2 14 8 18 160
F3 26 24 16 90
Demand 180 120 150
The initial basic feasible solution of the above
transportation problem using Vogel's
Approximation method (VAM) is given below :
UGC NET JRF Computer Science 262 YCT
 → Warehouse 69. Given the following statements with respect to
W1 W2 W3 Supply linear programming problem :
F1 16(140) 20 12(60) 200
S1 : The dual of the dual linear programming
↓ F2 14(40) 8(120) 18 160
Factor
problem is again the primal problem
F3 26 24 16(90) 90
y S2 : If either the primal or the dual problem
Demand 180 120 150
has an unbounded objective function
The solution of the above problem :
value, the other problem has no feasible
(a) is degenerate solution
solution
(b) is optimum solution
S3 : If either the primal or dual problem has
(c) needs to improve
a finite optimal solution, the other one
(d) is infeasible solution
also possesses the same, and the optimal
Ans : (b) value of the objective functions of the two
w1 w2 w3 problems are equal.
16(140) 20 12(60) u1 = 0 Which of the following is true ?
14(40) 8(120) 18 u2 (a) S1 and S2
26 24 16(90) u3 (b) S1 and S3
v1 v2 v3 (c) S2 and S3
c11 = v1 + v1 v1 = 16 u1 = 0 (d) S1, S2 and S3
16 = 0 + v1 v2 = 10 u2 = –2
Ans : (d) All 3 statement are correct as they all
v2 = 12 u3 = 4
properties of dual & primal.
C13 = u1 + u3
70. Consider the two class classification task that
12 = 0 + v3
consists of the following points :
C21 = u2 + v1
Class C1 : [1 1.5] [1 –1.5]
u1 = u2 + 16
u2 = –2 Class C2 : [–2 2.5] [–2 –2.5]
C22 = u2 + v2 The decision boundary between the two classes
using single perceptron is given by :
8 = –2 + v2
(a) x1 + x2 + 1.5 = 0
v2 = 10
(b) x1 + x2 – 1.5 = 0
C33 = u3 + v3
16 = u3 + 12 (c) x1 + 1.5 = 0
v3 = 4 (d) x1 – 1.5 = 0
Un allocated Ans : (c) Simply plot the all points of C1 & C2 in 2-D
d12 = C12 – (u1 + v2) coordinates then see which option's line separates the
= 20 – (0 + 10) points of C1 & C2
= 10 all points of C1 should be one side & all points of C2
d23 = (23 – (u3 + v3) should be on other side of line.
= 18 – (–2 + 12 only line given in option C X1 + 1.5 = 0 does that.
= .8 71. Let A and B be two fuzzy integers defined as :
d31 = C31 – (u3 + v1) A = {(1, 0.3), (2, 0.6), (3, 1), (4,0.7), (5,0.2)}
= 26 – (4 + 16) B = {(10, 0.5), (11,1), (12,0.5)}
=6 Using fuzzy arithmetic operation given by
d32 = C32 – (u3 + v2)
= 24 – (4 + 10)
µA + B( ) =
Z
⊕
x + =z
(µA ( x ) µB ( y ))
y
= 10
 ⊕ = max 
all d's are p + vc so it is optimum solution. f(A + B) is ............  Note : 
 ⊕ = min 
UGC NET JRF Computer Science 263 YCT
 (a) {(11,0.8), (13, 1), (15, 1)} (C) wait (iii) To increase or decrease
(b) {(11, 0.3), (12, 0.5), (13, 1), (14, 1), (15, 1), the size of data region
(16, 0.5), (17, 0.2)} (D) fork (iv) A process synchronizes
(c) {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 1), with termination of child
(16, 0.5), (17, 0.2)} process
(d) {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, Codes :
0.7), (16, 0.5), (17, 0.2)} A B C D
Ans : (d) A = {(1, 0.3), (2, 0.6), (3, 1), (4, 0.7), (5, (a) (ii) (iii) (iv) (i)
0.2)} (b) (iii) (ii) (iv) (i)
B = {(10, 0.5), (11, 1), (12, 0.5) (c) (iv) (iii) (ii) (i)
A + B (z) = ⊕ × + y = z (uA (x) ⊗ uB (y) is also given (d) (iv) (iii) (i) (ii)
as below (add elements of A & B while keeping the
Ans : (a) exec : replaces the current program in the
min. membership value e.g. 1 + 10 = 11 & min (0.3,
current process, without forking a new process.
0.5) = 0.3 & so on for rest
⇒ brk() & sbrk() change the location of the program
⊕ x + y = z {(11, 0.3), (12, 0.3), (13, 0.3), (12, 0.5), (13, break, which defines the end of the process's data
0.6), (14, 0.5), (13, 0.5), (14, 1), (15, 0.5), (14, 0.5), (15, segment.
0.7), (16, 0.5), (15, 0.2), (16, 0.2), (17, 0.2)} bin
⇒ The parent process may then issue a wait system
considering min membership value
call, which suspends the execution of the parent
Now considering min membership value process while the child executes.
{(11, 0.3), (15, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16,
⇒ Fork–creates new process.
0.5), (17, 0.2)}
74. WOW32 is a :
72. Suppose the function y and a fuzzy integer
(a) Win 32 API library for creating processes
number around – 4 for x are given as y = (x –
and threads
3)2 + 2
(b) Special kind of file system to the NT name
Around – 4 = {(2, 0.3), (3, 0.6), (4, 1), (5, 0.6),
space
(6, 0.3)} respectively. Then f (Around –4) is
(c) Kernel - mode objects accessible through
given by :
Win 32 API
(a) {(2, 0.6), (3, 0.3), (6, 1), (11, 0.3)}
(d) Special execution environment used to run 16
(b) {(2, 0.6), (3, 1), (6, 1), (11, 0.3)}
bit Window applications on 32-bit machines
(c) {(2, 0.6), (3, 1), (6, 0.6), (11, 0.3)}
Ans : (d) Wow 32 is a running environment used in
(d) {(2, 0.6), (3, 0.3), (6, 0.6), (11, 03)}
windows to run 16 bit windows application on a 32 bit
Ans : (c) y = (x – 3)2 +2
machine
around– 4 = {(2, 0.3), (3, 0.6), (4, 1), (5, 0.6), (6, 0.3)}
75. The Unix command :
putting x = 2, 3, 4, 5, 6 in 4 = (x – 3)2 + 2 will give
$ vi file1 file2
3 2 3 6 11 with their original x membership values
(.3, .6, 1, .6, .3) here is present with 2 membership (a) Edits file1 and stores the contents of file1 in
values .3 & 1 so 1 is considered & final result will be file2
{(3,1), (2, .6), (6, .6), (11, .3)} (b) Both files i.e. file1 and file2 can be edited
using 'ex' command to travel between the
73. Match the following for Unix system calls :
files
List - I List - II (c) Both files can be edited using 'mv' command
(A) exec (i) Creates a new process to move between the files
(B) brk (ii) Invokes another program (d) Edits file1 first, saves it and then edits file2
overlaying memory space Ans : (b) You can edit more than one file at a time
with a copy of an with vi.
executable file vi file1 file2 vi two (or more) files at the same time.
UGC NET JRF Computer Science 264 YCT
 U.G.C. NET Exam. December, 2014
COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. Consider a set A = {1, 2, 3, ............1000}. How 4. A computer program select an integer in the
many members of A shall be divisible by 3 or set {k : 1 ≤ k ≤ 10,00,000} at random and prints
by 5 or both 3 and 5? out the result. This process is repeated 1
(a) 533 (b) 599 million times. What is the probability that the
(c) 467 (d) 66 value k = 1 appears in the printout at least
Ans : (c) Because, number of member divisible by 3 = once?
{3, 6, 9 .......... 999} : 999/3 = 333 (a) 0.5 (b) 0.704
Number of member divisible by S = {5, 10, 15 (c) 0.632121 (d) 0.68
........1000} : 1000/5 = 200 Ans : (c) Because, probability of k = 1 is 1/1000000 =
Number of member divisible by 15 = {15, 30 .........990} 10–6
: 999/15 = 66 probability of k! = 1 is 1 – 10–6 = 0.999
So, no. divisible by 3 or by 5 or both 3 and 5.
probability that k = 1 is never printed in all 106 print
(A ∨ B) = (A + B) − (A ∧ B)A outs = 0.999 × 0.999 × ........ 0.999 (106 time)
Thus the total number in set = 333 + 200 - 66 = 467 = 0.999 10∧6
So the answer is (c) Probability that 1 is printed at least once = 1 –
2. A certain tree has two vertices of degree 4, one probability that 1 is never printed
vertex of degree 3 and one vertex of degree2. If ⇒ 1 – 0.999∧10∧6
the other vertices have degree 1, how many ⇒ 0.6321
vertices are there in the graph?
(a) 5 (b) n–3 5. If we define the functions f, g and h that map R
(c) 20 (d) 11 into R by :
Ans : (d) Number of edges in a tree with n vertices: f(x) = x4, g(x) = x 2 + 1,h(x) = r 2 + 72 , then the
e = n -1
value of the composite functions ho(gof) and
Now, using theorem Handshaking theorem
(hog) of are given as
V∈V
∑ deg(V) = 2| e | (a) x2 – 71 and x8 – 71
(b) x8 – 73 and x8 – 73
Therefore,
(c) x8 + 71 and x8 + 71
⇒ 2 × 4 + 1× 3 + 1× 2 + (n − (2 + 1 + 1)) ×1 (d) x8 + 73 and x8 + 73
= 2(n - 1) Ans : (d) f = x4
⇒13 + (n − 4) = 2n − 2
⇒13 + 2 − 4 = 2n − n gof = ( x + 1)
8

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

3. Consider the Graph shown below : this!
ho(gof) = x8 + 73 = x8 + 73
So the answer is (d)
6. The BCD adder to add two decimal digits
needs minimum of
(a) 6 full adders and 2 half adders
(b) 5 full adders and 3 half adders
This graph is a ................. (c) 4 full adders and 3 half adders
(a) Complete graph (b) Bipartite graph
(c) Hamiltonian graph (d) All of the above (d) 5 full adders and 2 half adders
Ans : (c) Because, According to dirac's theorem, in a Ans : (d) Because, BCD adder to add two decimal digit
graph of n nodes, each node has degree greater than n/2, needs 5 full adders & 2 half adders.
graph is Hamilton So answer is (d)
• In given graph n = 6 7. The Excess-3 decimal code is self-
• All nodes have degree = 4 complementing code because
• Hence graph is Hamiltonian (a) The binary sum of a code and its 9's
• So Hamiltonian path is ABCDEF complement is equal to 9
So the answer is C (b) It is a weighted code
UGC NET JRF Computer Science 265 YCT
 (c) Complement can be generated by inverting Ans : (b) Because, total input to the ROM decoder will
each bit pattern be (8 + 8(two 8 bit number) + 1(mode) + 1(carry in))
(d) The binary sum of a code and its 10's So total number of words out of decoder will be 2∧18.
complement is equal to 9 Result will be 8 bit so 8 vertical lines + (1 for carry) + 1
Ans : (a or c) The Excess-3 decimal code is a self- (for saying under flow) means 218 × 10
complementing code because the binary sum of a code So the answer is (b)
and its 9's complement is equal to 9 and complement 11. What will be the output of the following 'C'
can be generated by inverting each bit pattern. code?
8. How many PUSH and POP operations will be main ( )
needed to evaluate the following expression by { int x = 128 ;
reverse polish notation in a stack machine (A pritf("\n%d", 1 + x ++);
×B) + (C × D/E)? }
(a) 4 PUSH and 3 POP instructions (a) 128 (b) 129
(b) 5 PUSH and 4 POP instructions (c) 130 (d) 131
(c) 6 PUSH and 2 POP instructions Ans : (b) main ( )
(d) 5 PUSH and 3 POP instructions {
Ans : (b) To evaluate postfix expression we need int x = 128;
operand stack given expression is infix, so convert it printf ("\n%d", 1 + x++)
into postfix. So, resulting postfix expression: }
AB * CD * E/ + In the following C program There is post increment
operation: So, printf will print 1 + 128 as output. ++
will increment the x value i.e. x = 129.
12. What does the following expression means?
char *(*(*a[N])())( );
(a) a pointer to a function returning array of n
So, total 5 push and 9 POP. We can reduce POP since pointers to function returning character
keep one operand in separate register, so need only 1 pointers
POP operation instead of 2 POP. So, can be answer but (b) a function return array of N pointers to
if 5 push and 8 POP given then 'b' is wrong. functions returning pointers to characters
(c) an array of n pointers to function returning
9. The range of representable normalized pointer characters
numbers in the floating point binary fractional (d) an array of n pointers of function returning
representation in a 32-bit word with 1-bit sign, pointers to functions returning pointers to
8-bit excess 128 biased exponent and 23-bit characters
mantissa is : Ans : (d) Because,
(a) 2–128 to (1–2–23) × 2127 a –– a
(b) (1–2–23)×2–127 to 2128 a[N] – – is an N-element array
(c) (1–2–23) × 2–127 to 223 *a[N] – – of pointers
(d) 2–129 to (1–2–23) ×2127 (*a[N])( ) – – to functions
Ans : (d) Because, the range of respectable normalized *(*a[N])( ) – – returning pointers
number in the floating point binary fractional (*(*a[N]())( ) – – to function
representation in a 32–bit word *(*(*a[N]()) ( ) – – returning pointers
bais = 2n–1 = 28–1 = 128 Char *(*(*a[N]())( ) – – to char
Number 1 in normalized format = 0.00000......23 times means, an array of n pointers to functions returning
= 20–128 = 2–128 pointers to function returning pointers to characters.
Maximum number 111111..........22 time = 0.1111.....23 So the answer is (d)
times = (1 – 2–23) × (2555–228) = 1 – 2–23) × (2127) 13. Which of the following is not a member of
So the answer is (d)
class?
10. The size of the ROM required to build an 8-bit (a) Static function (b) Friend function
adder/subtracter with mode control, carry (c) Const function (d) Virtual function
input, carry output and two's complement Ans : (b) A friend function that is a "friend" of C
overflow output is given as : given class, is a function that is given the same access
(a) 216 × 8 than methods to private and protected data. A friend
(b) 218 × 10 function is declared by the class that is granting access,
(c) 216 × 10 so friend functions are part of the class interface like
(d) 218 × 8 methods.
UGC NET JRF Computer Science 266 YCT
14. When an array is passed as parameter to a III. Natural join and outer join operations
function, which of the following statements is are equivalent.
correct? (a) I and II are correct
(a) The function can change values in the (b) II and III are correct
original array (c) Only III is correct
(b) In C, parameters are passed by value, the (d) Only I is correct
function cannot change the original value in
the array Ans : (d) Because only I is correct. Self join is
implemented in a single table by alias names rest 2 are
(c) It results in compilation error when the
function tries to access the elements in the incorrect, so the answer is (d)
array 18. What kind of mechanism is to be taken into
(d) Results in a run time error when the function account for converting a weak entity set into
tries to access the elements in the array strong entity set in entity relationship
Ans : (a) When an array is passed as parameter to a diagram?
function then the function can change values in the (a) Generalization
original array. (b) Aggregation
15. Which of the following differentiates between (c) Specialization
overloaded functions and overridden (d) Adding suitable attributes
functions? Ans : (d) Weak entity is an entity which does not have
(a) Overloading is a dynamic or runtime binding sufficient attributes to form a primary key. Weak entity
and overridden is a static or compile time is represented by Double rectangle In an ER Diagram. It
binding must be in a 1:M relation. A member of a weak entity is
(b) Overloading is a static or compile time called a subordinate entity. For converting a weak entity
binding and overriding is dynamic or runtime set into strong entity set in entity-relationship diagram
binding
by simply adding appropriate attributes.
(c) Redefining a function in a friend class is
called overloading, while redefining a 19. The best normal form of relation scheme R(A,
function in a derived class is called as B, C, D) along with the set of functional
overridden function dependencies F = { AB → C, AB → D, C → A,
(d) Redefining a function in a derived class is D →B} is :
called function overloading, while redefining (a) Boyce-Codd Normal form
a function in a friend class is called function (b) Third Normal form
overriding
(c) Second Normal form
Ans : (b) Because, In method overloading, method call (d) First Normal form
to its definition has happens at compile time & while in
method overriding, method call to its definition happens Ans : (b) Because, keys are AB, CD, BC, AD
at run time. Here A, B, C, D all are prime attributes
So the answer is (b) So, no partial or transitive dependency are there
16. Division operation is ideally suited to handle So it in 3NF
queries of the type : Hence the answer is (b)
(a) customers who have no account in any of the 20. Identify the minimal key for relational scheme
branches in Delhi R(A, B, C, D, E) with functional dependencies
(b) customers who have an account at all F = {A → B, B → C, AC → D}
branches in Delhi (a) A (b) AE
(c) customers who have an account in atleast one (c) BE (d) CE
branch in Delhi
(d) customers who have only joint account in any Ans : (b) Because, {A} + = {A, B, C, D}
one branch in Delhi Here A can not be a key because we can't get attribute E
Ans : (b) Because division identify the attribute values from here.
from relation that are found to be paired with all of the {AE}= {A, B, C, D, E}
values from the other relation. Here AE is the minimal key we can't remove anything
So the answer is (b) from it
17. Which of the following is true? Hence the correct choice is (b)
I. Implementation of self-join is possible is 21. Convert the following infix expression into its
SQL with table alias equivalent post fix expression
II. Outer-join operation is basic operation (A + B∧ D)/(E – F) + G
in relational algebra (a) ABD∧ + EF –/G+ (b) ABD+ ∧EF –/G+
UGC NET JRF Computer Science 267 YCT
 (c) ABD+ ∧EF/ –G+ (d) ABD∧ + EF /–G+ 26. The period of a signal is 10 ms. What is its
Ans : (a) Given infix notation is frequency in Hertz?
= (A + B ↑ D) /(E − F) + G (a) 10 (b) 100
= Convert it into postix expression (c) 1000 (d) 10000
Ans : (b) Because, frequency = 1/period = 1/10 ms =
= ((((A + (B ↑ D)) /(E − F)) + G)
1/10–2 s = 100 Hz
= ((((ABD ↑ + ) /(EF −)) + G) So the answer is (b)
= ABD ↑ + EF − / G + 27. In a classful addressing, first four bits in Class
22. You have to sort a list L. consisting of a sorted A IP address is :
list followed by a few 'random' elements. (a) 1010 (b) 1100
Which of the following sorting method would (c) 1011 (d) 1110
be most suitable for such a task? Ans : (none of these) In class A the first bit (MSB) of
(a) Bubble sort (b) Selection sort first octed is 0.
(c) Quick sort (d) Insertion sort Class A: 0xxx : x can be 0 or 1.
Ans : (d) For a sorted list with few random numbers: Class B: 10xx
(i) Bubble sort will take O(n2) time in best case. Class C: 110x
(ii) Selection sort will take O(n2) time in best case. Class D: 1110
(iii) Quick sort will take O(n2) time in this case Class E: 1111
because it is the worst case for quick sort. 28. Which of the following algorithms is not a
(iv) Insertion sort will take O(n) broadcast routing algorithm?
23. The directory can be viewed as .............. that (a) Flooding
translates filenames into their directory entries. (b) Multi destination routing
(a) Symbol table (b) Partition (c) Reverse path forwarding
(c) Swap space (d) Cache (d) All of the above
Ans : (a) The directory can be viewed as symbol table Ans : (d) Because, flooding is suited for ordinary point
that translates file-names into their directory entries. to point communication, for broadcasting it might be
Symbol table is an important data structure created and good solution. The problem with flooding is it generates
maintained by compilers in order to store information too may packets & consumes too much bandwidth
about the occurrence of various entities such as variable
Multi destination routing have each packet contains
names, function names, objects, classes, interfaces, etc.
either a list of destination and reverse path forwarding is
24. Consider an array A[20, 10], assume 4 words an attempt to approximate the spanning tree broadcast
per memory cell and the base address of array even when the routers do not know anything at all about
A is 100. What is the address of A [11, 5]? spanning tree
Assume row major storage. So the correct choice is (d)
(a) 560 (b) 565
29. An analog signal has a bit rate of 6000 bps and
(c) 570 (d) 575
Ans : (a) Because, Each cell needs 4 words a baud rate of 2000 baud. How many data
elements are carried by each signal element?
• A [0][0], A[0] [1],..... A[0][9] needs 4 × 10 = 40
(a) 0.336 bits/baud
words
(b) 3 bits/baud
• Since array starts at 100, A [0] [9] will be at 100 +
(c) 120,00,000 bits/baud
40 = 140th location
(d) None of the above
• Similarly from A[0][0] to A[10][9] there are 11 ×
10 = 110 elements Ans : (b) Because the analog signal 2000 bauds or
element in one second.
• From A[11][0] to A[11][5] there are 5 elements
• To send this 6000 bits are transmitted second
• Total 115 elements are present before A[11][15]
• Thus 6000/2000 = 3 bits/baud is transmitted
• Hence A[11][15] will be 100 + 4 × 115 = 560
So the answer is (a) 30. How may distinct stage are there in DES
25. A full binary tree with n leaves contains algorithm, which is parameterized by a 56-bit
(a) n nodes (b) log2 nodes key?
(c) 2n – 1 nodes (d) 2n nodes (a) 16 (b) 17
Ans : (c) Because, full binary tree with n leaves (c) 18 (d) 19
contains n–1 internal nodes Ans : (d) Because, DES (Data encryption Standard)
So total nodes = internal nodes + leaves = n – 1 + n algorithm which is parameterized by a 56 bit key has 19
= 2n–1 distinct edges including 16 rounds.
So the answer is (c) So the answer is (d)
UGC NET JRF Computer Science 268 YCT
31. Shift-Reduce parsers perform the following : Ans : (c) Because, debugger is computer program used
(a) Shift step that advances in the input stream by programmers to test and debug a target program and
by K(K >1) symbols and Reduce step that it use instructions - set simulators rather than running a
applies a completed grammar rule to some program directly on the processor to achieve a higher
recent parse trees, joining them together as level of control over its execution. It also use to allow,
one tree with a new root symbol. set breakpoints, execute a segment of program and
(b) Shift step that advances in the input steam by display content of register.
one symbol and Reduce step that applies a 35. The following context-free Grammar (CFG) :
completed grammar rule to some recent parse S → aBbA
trees, joining them together as one tree with a
A → aasbAA
new root symbol
(c) Shift step that advances in the input steam by B → bbsaBB
K(K =2) symbols and Reduce step that will generate
applies a completed grammar rule to form a (a) odd numbers of a's and odd numbers of b's
single tree. (b) even numbers of a's and even numbers of b's
(d) Shift step that does not advance in the input (c) equal numbers of a's and b's
stream and Reduce step that applies a (d) different numbers of a's and b's
completed grammar rule to form a single tree Ans : (c) Because, if you consider this CFG you can
Ans : (b) Because, Shift step advances in the input definitely generate odd no. of a's and odd no. of b's and
stream by one symbol. That shifted symbol becomes a we can generate the string aabb (which is a
new single-node parse tree contradiction of option b & a)
• Reduce step applies a completed grammar rule to Given CFL also can generate ab(which is contradiction
some of the recent parse tree, joining them together to the option d)
as one tree with a new root symbol. ⇒ Means when you consider option (c) in this you can
• If the input has no syntax errors, the parser generate all possible string out of this grammar is
continues with these steps until all of the input has which you are going to have equal no. of a's and
been consumed and all of the parse tree have been equal no. of b's
reduced to a single tree representing an entire legal ⇒ So the correct choice is (c)
input. 36. Consider the following justifications for
32. Which of the following is true? commonly using the two-level CPU scheduling:
(a) Canonical LR parser is LR (1) parser with I. It is used memory is too small to hold all
single look ahead terminal the ready processes
(b) All LR (K) parsers with K > 1 can be II. Because its performance is same as that
transformed into LR (1) parsers of the FIFO.
(c) Both (a) and (b) III. Because it facilitates putting some set of
(d) None of the above processes into memory and a choice is
Ans : (c) Because, A canonical LR parser or LR (1) is made from that.
an LR (k) parser for k = 1, i.e. with a single look ahead IV. Because it does not allow to adjust the set
all LR (k) parser's with k>1 can be transformed into a of in-core processes
LR (1) parser. Which of the following is true?
(a) I, III and IV (b) I and II
33. In a two-pass assembler, symbol table is : (c) III and IV (d) I and III
(a) Generated in first pass Ans : (d) Because, two level scheduling is a method to
(b) Generated in second pass more efficiently perform process scheduling that
(c) Not generated at all involved swapped out process. Two level scheduling
(d) Generated and used only in second pass uses two different schedulers, one lower-level
Ans : (a) In a two-pass assembler, symbol table is schedulers which can only select among those processes
generated in first pass but it need two pass to scan in memory to run. That scheduler could be a round
whole source file. While one pass assembler scan whole Robin scheduler. The other scheduler is the higher level
file in a go. scheduler whose only concern is to swap in and swap
34. Debugger is a program that : out processes from memory.
(a) allows to examine and modify the contents of 37. A specific editor has 200 K of program text, 15
registers K of initial stack, 50 K of initialized data, and
(b) does not allow execution of a segment of 70 K of bootstrap code. If five editors are
program started simultaneously, how much physical
(c) allows to set breakpoints, execute a segment memory is needed if shared text is used?
of program and display contents of register (a) 1135 K (b) 335 K
(d) All of the above (c) 1065 K (d) 320 K
UGC NET JRF Computer Science 269 YCT
Ans : (b) Because, initial stack, initialized data and 41. ................... are applied throughout the
bootstrap code can be shared among the editors. software process.
Because text is shared so no need to multiply 200 with 5 (a) Framework activities
and other need each for running. Then the total memory (b) Umbrella activities
is = 200 + 15 +150 + 70 = 335K (c) Planning activities
38. Which of the following conditions does hold (d) Construction activities
good for a solution to a critical section Ans : (b) The umbrella activities in a software
problem? development life cycle process include the following:
(a) No assumptions may be made about speeds software project management, formal technical reviews,
or the number of CPUs. software quality assurance and software configuration
(b) No two processes may be simultaneously management.
inside their critical sections. Umbrella activities occur throughout the software
(c) Processes running outside its critical section process and focus primarily on project management,
may block other processes tracking and control.
(d) Processes do not wait forever to enter its
critical section. 42. Requirement Development, Organizational
Ans : (c) Because, if a process is running outside the process focus, organizational training, risk
critical section we don't care whatever it is doing out management and integrated supplier
there either it is blocking some processes or not it is not management are process areas required to
going to affect the processes which are running inside achieve maturity level
the critical section. (a) Performed (b) Managed
39. For the implementation of a paging scheme, (c) Defined (d) Optimized
suppose the average process size be x bytes, the Ans : (c) Because, maturity level 3 – defined
page size be y bytes, and each entry requires z ATM : Acquisition technical management
bytes. The optimum page size that minimizes AVAL : Acquisition validation
the total overhead due to the page table and the IPM : Integrated project management
internal fragmentation loss is given by : OPF : organizational process focus
x xz OT : organizational training
(a) (b)
2 2 RSKM : Risk management
xz 43. The software ................. of a program of a
(c) 2xz (d) computing system is the structure or structures
2
Ans : (c) Because, average amount of internal of the system, which comprise software
fragmentation persegement is y/2 components, the externally visible properties of
Average no. of pages per process segment is x/y each those components, and the relationships among
page requires 'z' bytes of page table. them.
So each process segment require page table size of xz/y (a) Design (b) Architecture
bytes. (c) Process (d) Requirement
Total overload per segment, therefore, due to internal Ans : (b) Because, software architecture encompasses
fragmentation to minimize the overhead, differentiate the set of significant decisions about the organization of
with respect to page size, P & equal to 0 a software system including the selection of the
d(xz/y + y/2)/dy = –xz/y2 + 1/2 = 0 structural elements and their interfaces by which the
⇒ y = 2xz system is composed; behavior as specified n
collaboration among those elements, composition of
So the answer is (c) these structural and behavioral elements into larger
40. In a demand paging memory system, page table subsystems : software architecture also involves
is held in registers. The time taken to service a functionality, usability, performance etc.
page fault is 8 m. sec. if an empty frame is 44. Which one of the following set of attributes
available or if the replaced page is not modified, should not be encompassed by effective
and it takes 20 m. sec. if the replaced page is software metrics?
modified. What is the average access time to
service a page fault assuming that the page to be (a) Simple and computable
replaced is modified 70% of the time? (b) Consistent and objective
(a) 11.6 m. sec. (b) 16.4 m. sec. (c) Consistent in the use of units and dimensions
(c) 28 m. sec. (d) 14 m. sec. (d) Programming language dependent
Ans : (b) Because service a page fault = 8 m.sec. Ans : (d) Because, effective software metrics should be
simple, computable, consistent, objective and consistent
page is not modified = 20 m.sec. in the use of units and dimensions. But it should not be
page replace = 70% of time programming language dependent as them it will not be
then the average time of service a page fault consistent in measuring the software.
= 0.7 × 20 + 0.3 × 8 = 14.4.4 = 16.4 ms Hence the answer is option (d)
UGC NET JRF Computer Science 270 YCT
45. Which one of the following is used to compute 48. Which e-business model allows consumers to
cyclomatic complexity? name their own price for products and
(a) The number of regions–1 services?
(b) E – N + 1 , where E is the number of flow (A) B2 B (B) B2 G
graph edges and N is the number of flow (C) C2 C (D) C2 B
graph nodes Ans : (d) Because, C2B model called a reverse auction
(c) P – 1, where P is the number of predicate or demand collection model, enables buyers to name or
nodes in the flow graph G. demand their own price, which is often binding, for a
(d) P + 1, where P is the number of predicate specific good or service. The website collects the
nodes in the flow graph G. demand bids then offers the bids to participating sellers
Ans : (d) Because, cyclomatic complexity is a metric and C2C is a consumer to consumer business model and
to measure logical complexity of a program. B2B and B2G has nothing to concern about consumer
• Cyclomatic complexity defines the number of price setting.
independent paths in a program 49. __________ model is designed to bring prices
• It gives an upper bound for the number of tests that down by increasing the number of customers
must be conducted to ensure that all statements have who buy a particular product at once.
been executed at least once.
(A) Economic Order Quantity
⇒ Cyclomatic complexity is computed in one of three
(B) Inventory
ways.
(1) Number of regions of the flow graph (C) Data Mining
(2) Cyclometic complexity, V(G), for a flow graph (D) Demand-Sensitive Pricing
G, is defined as V(G) = E – N + 2 K where E is Ans : (d) Because, Inventory and data mining has
the number of flow graph edges, N. is the nothing to do with price. Economic order quality (ECQ)
number of flow graph and K is the number of is the order quantity that minimizes the total holding
connected components costs and ordering cost it is one of the oldest classical
(3) V(G) = P + 1 where P is the number of production scheduling models. So these three options
predicate nodes contain in the flow graph G. So are get neglect so the correct is (d)
the answer is (d) 50. Match the following :
46. Consider the following statements S1 and S2 : List – I List – II
S1 : A hard handover is one in which the
channel in the source cell is retained and a. Call control i. Interface between
used for a while in parallel with the protocol Base Transceiver
channel in the target cell. Station (BTS) and
S2 : A soft handover is one in which the Base Station
channel in the source cell is released and Controller (BSC)
only then the channel in the target cell is b. A-bis ii. Spread spectrum
engaged. c. BSMAP iii. Connection
(a) S1 is true and S2 is not true. management
(b) S1 is not true and S2 is true. d. CDMA iv. Works between
(c) Both S1 and S2 are true. Mobile Switching
(d) Both S1 and S2 are not true. Centre (MSC) and
Base Station
Ans : (d) Because, Hard handover is one in which the
Subsystem (BSS)
channel in the source cell is released and only the
channel in the target cell is engaged Codes :
⇒ Soft handover is one is which the channel in the A B C D
source cell is retained and used for a while parallel (a) iii iv i ii
with the channel in the target cell (b) iii i iv ii
⇒ So the both are hot true, hence the correct choice is (d) (c) i ii iii iv
47. Fact-less fact table in a data warehouse (d) iv iii ii i
contains Ans : (b) (i) Call control protocol do Connection
(a) only measures (b) only dimensions management.
(c) keys and measures (d) only surrogate keys (ii) BSMAP works between Mobile Switching
Ans : (b) A fact-less fact table is a fact table that does Centre (MSC) and Base Station Subsystem (BSS)
not have any measures. It is essentially an intersection (iii) A-bis is a interface between Base
of dimensions (it contains nothing but dimensional key) Transceiver Station (BTS) and Base Station Controller
there are two types of fact-less tables : one is for (BSC)
capturing an event and one is for describing conditions. (iv) CDMA is a spread spectrum.
UGC NET JRF Computer Science 271 YCT
 U.G.C. NET Exam. December, 2014
COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. A hierarchical memory system that uses cache 4. Match the following 8085 instructions with the
memory has cache access time of 50 nano flags :
seconds, main memory access time of 300 nano List – I List – II
seconds, 75% of memory requests are for read, A. XCHG i. only carry flag is
hit ratio of 0.8 for read access and the write- affected
through scheme is used. What will be the B. SUB ii. no flags are affected
average access time of the system both for read
and write requests? C. STC iii. all flags other than carry
(a) 157.5 n.sec (b) 110 n.sec. flag are affected
(c) 75 n.sec. (d) 82.5 n.sec. D. DCR iv. all flags are affected
Ans : (a) Because, Tread = 0.8 × 50 + 0.2 × (300 + 50) = Code :
110 NS A B C D
(a) iv i iii ii
Twrite = 1 × max(300, 50) = 1 × 300 = 300 ns
(b) iii ii i iv
Hence average access time for both read and write is =
(c) ii iii i iv
0.75 × 110 + 0.25 × 300 = 157.5 ns (d) ii iv i iii
2. For switching from a CPU user mode to the Ans : (d) Because, (a) XCHG : Exchange H & L with
supervisor mode following type of interrupt is D & E no flag is affected in this instruction
most appropriate : (b) SUB : Subtract all flags (CY, S, Z, AC, P) are
(a) Internal interrupts (b) External interrupts affected by subtract operation
(c) STC : Set Carry flag to 1 so only carry flag is
(c) Software interrupts (d) None of the above
affected
Ans : (c) Because, internal interrupts occur due to (d) DCR : Decrement all flags other than carry flag are
some internal error (like division of zero) affected.
External interrupts occur due H/w problem Hence the answer is (d)
Software interrupts are the most appropriate method for 5. How many times will the following loop be
switching user mode to kernel mode. executed?
3. In a dot matrix printer the time to print a LOP : DCX B
character is 6 m.sec., time to space in between MOV A, B
ORA C
characters is 2 m.sec., and the number of
JNZ LOP
characters in a line are 200. The printing speed
(a) 05 (b) 07
of the dot matrix printer in characters per
(c) 09 (d) 00
second and the time to print a character line
Ans : (b) Because, value 7 is placed in register pair B
are given by which of the following options?
every time value is by one by DCX B
(a) 125 chars/seconds and 0.8 seconds
Contents of B are moved to accumulator and logical OR
(b) 250 chars/seconds and 0.8 seconds is performed with C but that don't affect the repetition
(c) 166 chars/second and 0.8 seconds of loop which is controlled by JNZ(JUMP is not zero)
(d) 250 chars/second and 0.4 seconds LOP instruction. So loop executes for B values 7, 6, 5,
4, 3, 2, 1 total 7 times
Ans : (*) Because, total characters = 200
total time to print 200 chars. = 200 × 6 = 1200 ms 6. Specify the contents of the accumulator and the
total time to space in = 200 × 2 = 400 ms status of the S, Z and CY flags when 8085
microprocessor performs addition of 87 H and
200 characters total print time = 1600 ms = 1.6 sec 79 H.
The printing speed of the dot matrix printer is character (a) 11, 1, 1, 1 (b) 10, 0, 1, 0
per second = 200/1.6 = 125 chars/sec. (c) 01, 1, 0, 0 (d) 00, 0, 1, 1
UGC NET JRF Computer Science 272 YCT
Ans : (d) Because, 87 H – 10000111 Ans : (b) {A}+ = {A, B, C, D}
79 H – 01111001 {F} = {E}
100000000 Hence the correct option is (b)
S–sign flag– Since MSB of result is 0, hence sign bit 11. Consider the following statements :
should be 0. I. Re-construction operation used in mixed
Z-zero flag– Since result is zero, hence zero bit should fragmentation commutative rule.
be 1. II. Re-construction operation used in vertical
Cy–Carry flag– Since these is carry from MSB, hence fragmentation satisfies commutative rule
Cy = 1 Which of the following is correct?
7. Location transparency allows : (a) I
I. Users to treat the data as if it is done at (b) II
one location (c) Both are correct
II. Programmers to treat data as if it is at one (d) None of the statements are correct
location Ans : (d) All reconstructions are need two operation
III. Managers to treat the data as if it is at one • Join
location • Union
Which of the following is correct? Because the operation above are commutative, the
(a) I, II and III (b) I and II only reconstructions are commutative too.
(c) II and III only (d) II only 12. Which of the following is false ?
Ans : (a) Because, In distributed computer networks, (a) Every binary relation is never be in BCNF
location transparency is the use of names to identify (b) Every BCNF relation is in 3NF
network resources, rather than their actual location.
(c) 1 NF, 2 NF, 3 NF and BCNF are based on
8. Which of the following is correct? functional dependencies
I. Two phase locking is an optimistic protocol (d) Multivalued dependency (MVD) is a special
II. Two phase locking is pessimistic protocol case of join dependency (JD)
III. Time stamping is an optimistic protocol Ans : (a) Every binary relation (a relation with only 2
IV. Time stamping is pessimistic protocol attributes) is always in BCNF. Because if both attributes
(a) I and III (b) II and IV form the primary key, the relation is in BCNF. If one of
(c) I and IV (d) II and III the attribute is a primary key, the other must be
determined by it and thus in BCNF.
Ans : (d) Two phase locking is pessimistic protocol
(assumes bad thing going to happen) since it applies 13. Which of the following categories of language
locks (for safety) do not refer to animation language?
Time stamping is an optimistic protocol (assumes good (a) Graphical languages
thing going to happen) since it uses no locking. If bad (b) General-purpose languages
things happen, then they are handled later. (c) Linear-list notations
9. ..........rules used to limit the volume of log (d) None of the above
information that has to be handled and Ans : (d) All 3 mentioned are refer to animation
processed in the event of system failure language. Linear list notations are B rotate "Palm" etc.
involving the loss of volatile information: General purpose language eg. Grasp my-cube etc.
(a) Write-ahead log (b) Check-pointing General language describe animation in a usual way
(c) Log buffer (d) Thomas instead of using a scripts.
So the correct choice is (d)
Ans : (b) Check pointing is a technique to add fault
tolerance into computer system. It basically consist of 14. Match the following :
saving a snapshot of the application state, so that it can List –I List –II
restart from that point in case of failures A. Tablet, Joystick i. Continuous
10. Let R = ABCDE is a relational scheme with devices
functional dependency set F = {A → B, B → C, B. Light pen, Touch ii. Direct devices
AC → D}. The attribute closures of A and E screen
are : C. Locator, Keyboard iii. Logical devices
(a) ABCD, φ (b) ABCD, E D. Data Globe, Sonic iv. 3D interaction
(c) Φ, φ (d) ABC, E pen devices
UGC NET JRF Computer Science 273 YCT
 Codes:
 2 2 
A B C D  0
2 2
(a) ii i iv iii    
A ' A  0 0 1  

 B'  =  B  R p =  1 1 1 − 2 2 
(b) i iv iii ii
    45   0
(c) i ii iii iv  C '   C   5 2 1  2 2 
 
(d) iv iii ii i 
−1 ( 2 −1 ) 1

Ans : (c) Keyboard is a logical device & so is locator  
data globe, sonic pen are 3D interaction devices  
Table joystick are continuous devices as we can not lift 

−1 2 −1 ( 1

)
our hand during their operation
Light Pen & touch screen are direct devices as we =  −1 (
2 2 − 1 1 )
directly touch them & get our work done.  
  3 2 − 1  9 2 − 1 1
15. A technique used to approximate halftones  2 
  2  
without reducing spatial resolution is known So
as............
A' = (
−1, 2 − 1 ,B' = −1, 2 2 − 1 & ) ( )
(a) Half toning (b) Dithering 3 9 
C' =  2 − 1, 2 − 1
(c) Error diffusion (d) None of the above  2 2 
Ans : (b) It is a technique can be used to approximate Hence the correct choice is (a)
halftones without reducing spatial resolution. In this 17 . In Cyrus-Beck algorithm for line clipping the
approach the dither matrix is treated very much like a value of t parameter is computed by the
floor file that can be repeatedly positioned one copy relation :
next to another to cover entire floor. (Here P1 and P2 are the two end points of the
line, f is a point on the boundary, n1 is inner
16. Consider a triangle represented by A(0,0), normal)
B(1,1), C(5,2). The triangle is rotated by 45
(a)
( P1 − fi ) .n i (b)
( fi − P1 ) .n i
degrees about a point P(–1, –1). The co- ( P2 − P1 ) .n i ( P2 − P1 ) .n i
coordinates of the new triangle obtained after
rotation shall be– (c)
( P2 − fi ) .n i (d)
( fi − P2 ) .n i
( P1 − P2 ) .n i ( P1 − P2 ) .n i
(a) ( ) ( 3
A ' −1, 2 − 1 ,B' −1, 2 2 − 1 ,C"
9
2
) 
2 − 1, 2 − 1

2
Ans : (b)
( fi − P1 ) .n i
(b) A' ( ) ( )3
2 − 1, −1 ,B' 2 2 − 1, −1 ,C"
2
2 − 1,
9
2

2 − 1

( P2 − P1 ) .n i
18. Match the following :
(c) ( ) ( 3
A ' −1, 2 − 1 ,B' 2 2 − 1, −1 ,C"
2
)
2 − 1,
9
2

2 − 1
 A. Cavalier i. The direction of
(d) ( ) ( 3
A ' −1, 2 − 1 ,B' 2 2 − 1, −1 ,C"
2
)
2 − 1,
9
2

2 − 1

Projection projection
chosen so that
is

Ans : (a) there is no

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

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

UGC NET JRF Computer Science 277 YCT

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

(a)

(b) So the answer is (c)

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

UGC NET JRF Computer Science 278 YCT

 (c) complexity metric 48. Temporal cohesion means
(d) Length metric (a) Coincidental cohesion
Ans : (b) Function point metric, this approach is (b) Cohesion between temporary variables
independent of the language tools or methodologies
(c) Cohesion between local variables
used for implementation.
(d) Cohesion with respect to time
44. To compute function points (FP), the following
relationship is used Ans : (d) Temporal cohesion is when pairs of module
is grouped by when they are processed the parts are
FP = Count – total × (0.65 + 0.01 × Σ(Fi) where
Fi (i = 1 to n) are value adjustment factors processed at a particular time in program execution.
(VAF) based on n questions. The value of n is : 49. Various storage devices used by an operating
(a) 12 (b) 14 system can be arranged as follows in increasing
(c) 16 (d) 18 order of accessing speed :
Ans : (b) Number of value adjustment factor are based (a) Magnetic tapes → magnetic disks → optical
on response of 14 (Fi, i = 1 to 14) question
disks → electronic disks → main memory →
Fp = count total x (0.65 + 0.01 × Σ (Fi)) where count
cache → registers
total is the sum of all FP entries.
(b) Magnetic tapes → magnetic disks →
45. Assume that the software term defines a
electronic disks → optical disks → main
project risk with 80% probability of
occurrence of risk in the following manner: memory → cache → registers
Only 70 percent of the software components (c) Magnetic tapes → electronic disks →
scheduled for reuse will be integrated into the magnetic disks → optical disks → main
application and the remaining functionality memory → cache → registers
will have to be custom developed. If 60 (d) Magnetic tapes → optical disks → magnetic
reusable components were planned with
disks → electronic disks → main memory →
average component size as 100 LOC and
software engineering cost for each LOC as $ cache → registers
14, then the risk exposure would be : Ans : (d) The electronics are definitely faster because
(a) $ 25,200 (b) $ 20,160 they are ram or flash. So the answer is (d)
(c) $ 17,640 (d) $ 15,120 50. How many disk blocks are required to keep list
Ans : (b) Number of reusable components planed = 60 of free disk blocks in a 16 GB hard disk with 1
• Part of reusable component actually included = 70% kb block size using linked list of free disk
• Number of components developed freshly = 30% of blocks? Assume that the disk block number is
60 = 18 stored in 32 bits.
• Development cost = 18 × 100 × 14% (a) 1024 blocks (b) 16794 blocks
• Probability of occurrence risk = 80% (c) 20000 blocks (d) 1048576 blocks
• Risk exposure = 0.8 × 18 × 100 × 14 = 20160$ Ans : (none of these)
So the answer is (b)
256 disk block address → 1 disk block
46. Maximum possible value of reliability is :
16 M disk block address → X
(a) 100 (b) 100
16M
(c) 1 (d) 0 X= = 65794 {M → 220}
256
Ans : (c) Maximum possible reliability is 1 or 100%
So answer is (c) 51. Consider an imaginary disk 40 cylinders. A
47. 'FAN IN' of component A is defined as request come to read a block on cylinder 11.
While the seek to cylinder 11 is in progress,
(a) Count of the number of components that can
new requests come in for cylinders1, 36, 16, 34,
call, or pass control, to a component A
9 and 12 in that order. The number of arm
(b) Number of components related to component motions using shortest seek first algorithm is :
(c) Number of components dependent on (a) 111 (b) 112
component
(c) 60 (d) 61
(d) None of the above
Ans : (d) 11 – 12 – 9 – 16 – 34 – 36 sequences of
Ans : (a) FAN-in is the number of modules that call a
given module access
Fan-out is the number of modules that called by a given So, 1 + 3 + 7 + 15 + 33 + 2 = 61
module. Hence the answer is (d)

UGC NET JRF Computer Science 279 YCT

52. An operating system has 13 tape drives. There Ans : (b) DSM (Distributed shared memory) is a form
are three processes P1, P2 & P3. Maximum of memory architecture where the (physical separate)
requirement of P1 is 11 tape drives, P2 is 5 tape memories can be addressed as one (logical shared)
drives and P3 is 8 tape drives. Currently, P1 is address space. DSM system is to make interprocess
allocated 6 tape drives, P2 is allocated 3 tape communication transparent to end users.
drives and P3 is allocated 2 tape drives. Which 55. Equivalent logical expression for the Well
of the following sequences represent a safe Formed Formula (WFF)
state? ~(∀x)F[x] is :
(a) P2 P1 P3 (b) P2 P3 P1 (a) ∀x (~F[x]) (b) ~(∃x)F[x]
(c) P1 P2 P3 (d) P1 P3 P2 (c) ∃x(~F[x]) (d) ∀xF[x]
Ans : (a) Ans : (c) ~((∀x) fx) = (∃ X) (~F(x))
Allocated Max need So answer is (c)
P1 6 11 5 56. An A* algorithm is a heuristic search
P2 3 5 2 technique which :
Total resources = 13 & free resources = 13 – 11 = 2 (a) is like a depth-first search where most
So clearly these 2 can only be given promising child is selected for expansion
allocated max need (20) (b) generates all successor nodes and computes
an estimate of distance (cost) form start node
P3 1 8 6
to a goal node through each of the successors.
to P2 which will be completed 8 release its all 5 It then chooses the successor with shortest
resource then next P1 can take 5 resource & be cost
completed & finally P3 (c) saves all path lengths (costs) from start node
So right answer is (a) P2 P1 P3 to all generated nodes and chooses shortest
53. Monitor is an Interprocess Communication path for further expansion
(IPC) technique which can be described as : (d) none of the above/j
(a) It is higher level synchronization primitive Ans : (b) A* is an informed search algorithm, or a
and is a collection of procedures, variables, best-first search, meaning that it solves problems by
and data structures grouped together in a searching among all possible paths to the solution for
special package the one that incurs the smallest cost (least distance
travelled, shortest time etc) and among these paths it
(b) It is a non-negative integer which apart from first consider the ones that appear to lead most quickly
initialization can be acted upon by wait and to the solution.
signal operations
57. The resolvent of the set of clauses
(c) It uses two primitives, send and receive
which are system calls rather than language (A ∨ B, ~A ∨ D, C ∨ ~B) is :
constructs (a) A ∨ B (b) C ∨ D
(d) It consists of the IPC primitives implemented (c) A ∨ C (d) A ∨ D
as system calls to block the process when Ans : (b) A∨ B, ~A∨D, C∨~B
they are not allowed to enter critical region to A & ~A will cancel out & so will B & ~B
save CPU time Hence answer is (b)
Ans : (a) Monitor is a thread-safe class, object or 58. Match the following :
module that uses wrapped mutual exclusion in order to
Script i. Directed graph
safely allows access to a method or variable by more A. with labelled
than one thread monitor is that its methods are executed nodes for
with mutual exclusion : at each point in time & monitor graphical
grouped their data's in a special package. representation
54. In a distributed computing environment, of knowledge
distributed shared memory is used which is : B. Conceptual ii. Knowledge
(a) Logical combination of virtual memories on Dependencies about objects
the nodes and events is
(b) Logical combination of physical memories stored in
record-like
on the nodes
structures
(c) Logical combination of the secondary
consisting of
memories on all the nodes slots and slot
(d) All of the above values
UGC NET JRF Computer Science 280 YCT
 C. Frames iii. Primitive inferencing steps
concepts and at any time
rules to during
represent consultation
natural D. Knowledge iv. Permits the user
language base to communicate
statement with the system
D. Associative iv. Frame like in a natural way
Network structures used Codes :
to represent
A B C D
stereotypical
(a) i iii iv ii
patterns for
commonly (b) iv iii i ii
occurring (c) i iii ii iv
events in terms (d) iv i iii ii
of actors, roles, Ans : (b)
props and (a) I/O interface : Method is used to transfer
scenes information between internal storage & external I/O
Codes : device is know as I/O interface means it permits the
A B C D user to communicate with the system in a natural way.
(a) iv ii i iii (b) Explanation module : Gives the user, the ability to
(b) iv iii ii i follow inferencing steps at any time during consultation.
(c) ii iii iv i (c) Interference engine : The interference engine is the
main processing element of the expert system. The
(d) i iii iv i
interference engine chooses rules from the agendas to
Ans : (b) fire. It there are no rules on the agenda, the internee
(a) Script : Scripts are a development of the idea of engine must obtain information from the user in order to
representing action and events using semantic networks. add more rules
Script is the idea is that whole set of action fall into (d) Knowledge base : Where the information is stored
stereotypical patterns. in the expert system in the form of fact & rules.
(b) Conceptual Dependences : Conceptual dependency 60. A computer based information system is
is a model of natural language understanding used in AI
needed :
system means it is a primitive concepts & rules to
represent natural language statements. (I) as it is difficult for administrative staff to
process data
(c) Frames : consideration of the use of cases suggest
(II) due to rapid growth of information and
how we can tighten up on the semantic net notation to
communication technology
give something which is more consistent.
(III) due to growing size of organizations which
(d) Associative network : Associate networks are
need to process large volume of data
cognitive models that incorporate long-known
(IV) as timely and accurate decisions are to be
principles of association to represent key feature of
taken
memory means it is a directed graph with labelled nodes
for graphical representation of knowledge. Which of the above statement (s) is/are true?
(a) I and II (b) III and IV
59. Match the following components of an expert
(c) II and III (d) II and IV
system :
Ans : (b) A computer based information system is
I/O interface i. Accepts user's needed because of growing size of organizations which
A. queries and need to process large volume of data & so large data
responds to need timely & accurate decisions
question through So the correct choice is (b)
I/O interface
61. Given the recursively enumerable language
B. Explanation ii. Contains facts
(LRE), the context sensitive language (LCS), the
module and rules about
recursive language (LREC), the context free
the domain language (LCF) and deterministic context free
C. Inference iii. Gives the user, language (LDCF). The relationship between
engine the ability to these families is given by :
follow (a) LCF ⊆ LDCF ⊆ LCS ⊆ LRE ⊆ LREC
UGC NET JRF Computer Science 281 YCT
 (b) LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE 63. According to pumping lemma for context free
(c) LDCF ⊆ LCF ⊆ LCS ⊆ LRE ⊆ LREC languages :
(d) LDCF ⊆ LCF ⊆ LCS ⊆ LREC ⊆ LRE Let L be an infinite context free language, then
Ans : (d) Elements of the Chomsky Hierarchy there exists some positive integer m such that
any w ∈ L with w ≥ m can be decomposed as
w=uvxyz
(a) with vxy ≤ m such that uvi xyi z ∈ L for all
i = 0, 1, 2
(b) with vxy ≤ m, and vy ≥ 1, such that uvi
xyi z ∈ L for all i = 0, 1, 2, ..........
(c) with vxy ≥ m, and vy ≤ 1, such that uvi
xyi z ∈ L for all i = 0, 1, 2, ..........
(d) with vxy ≥ m, and vy ≥ 1, such that uvi
xyi z ∈ L for all i = 0, 1, 2, ..........
Ans : (b) Context free pumping lemma to the
following. Let L be an infinite context language. Then
62. Match the following : there exists some positive integer m such that any w that
List –I List –II is a member of L with w  ≥ m can be decomposed as
A. Context free i. Linear bounded w = uvxyz
grammar automaton with v × y ≤ & vy ≥ 1
B. Regular ii. Pushdown such that wi = uvixyi z
grammar automaton is also in L for all i = 0, 1, 2, .....
C. Context iii. Turing machine 64. Given two spatial masks
sensitive
0 1 0  1 1 1
grammar
S1 = 1 -4 0  and S 2 = 1 -8 1
D. Unrestricted iv. Deterministic
0 1 0  1 1 1
grammar finite automaton
Codes : The Laplacian of an image at all points (x, y)
A B C D can be implemented by convolving the image
(a) ii iv iii i with spatial mask. Which of the following can
(b) ii iv i iii be used as the spatial mask?
(c) iv i ii iii (a) only S1 (b) only S2
(d) i iv iii ii (c) Both S1 and S2 (d) None of these
Ans : (b) Ans : (b) Spatial mask for point (x, y) used to
implement the digital laplacian of the 2-D is given by
[f(x + 1, y), + (x –1, y), f(x, 4–1)–4 f(x, y)] so possible
masks are.
0 1 0 1 1 1
1 −4 1 or 1 8 1
0 1 0 1 1 1
here in S1 a 1 is mission on the right side of –4
So the correct answer is (b)
65. Given a simple image of size 10 × 10 whose
histogram models the symbol probabilities and
is given by :
p1 p2 p3 p4
So the answer is (b) a b c d

UGC NET JRF Computer Science 282 YCT

 The first order estimate of image entropy is 69. Five men are available to do five different jobs.
maximum when From past records, the time (in hours) that
(a) a = 0, b = 0, c = 0, d = 1 each man takes to do each job is known and is
1 1 given in the following table :
(b) a = ,b = ,c = 0,d = 0
2 2
1 1 1
(c) a = , b = ,c = ,d = 0
3 3 3
1 1 1 1
(d) a = ,b = ,c = ,d =
4 4 4 4
Ans : (d) In option (d) all elements are in class 1/4.
Hence entropy is least. In option c, a, 3 elements are in Find out the minimum time required to
single class & one in other class. In option b, maximum complete all the jobs.
diffusion, 2 in each class, hence max entropy means (a) 5 (b) 11
option d is the right answer. (c) 13 (d) 15
66. A Butterworth lowpass filter of order n, with Ans : (c) (By using Hungarian method)
cutoff frequency at distance D0 from the origin, Subtract smallest number from present in row/column
has the transfer function H(u, v) given by : (1) All rows
1 1 (2) All columns
(a) 2n
(b) n
 D ( u, v )   D ( u, v ) 
1+   1 +  
 D0   D0 
1 1
(c) 2n
(d) n
 D0   D0 
1+   1+  
 D ( u, v )   D ( u, v ) 
Ans : (a) The transfer function of Butterworth low pass
filter of order n with cutoff frequency at distance do the
origin is defined as : H (u, v) = 1/1+(D(u, v) D0)2n
So answer will be (a)
67. If an artificial variable is present in the 'basic
variable' column of optimal simplex table, then
the solution is :
(a) Optimum (b) Infeasible
(c) Unbounded (d) Degenerate
Ans : (b) Else if condition is false it may be unbounded
So answer is (b)
So, P–2, Q–1, R–4, S–3, T–3
68. The occurrence of degeneracy while solving a
= 2 + 1 + 4 + 3 + 3 = 13
transportation problem means that
So the answer is (c)
(a) total supply equals total demand
70. Consider the following statements about a
(b) total supply does not equal total demand
perception :
(c) the solution so obtained is not feasible
I. Feature detector can be any function of the
(d) none of these
input parameters.
Ans : (c) Choice A is must be start for a solution
II. Learning procedure only adjusts the
Choice B is converted to case A first then we try
connection weights to the output layer.
solution we can find unfeasible solution i.e. allocations
Identify the correct statement out of the
are less than m+n–1 which is a case degenracy.
following :
UGC NET JRF Computer Science 283 YCT
 (a) I is false and II is false Codes :
(b) I is true and II is false A B C D
(c) I is false and II is true (a) i ii iii iv
(d) I is true and II is true (b) i iii ii iv
(c) ii iv iii i
Ans : (d) (i) Feature detection includes methods for
(d) ii iii iv i
computing abstractions of image information & it can
Ans : (a) Supervise is under some guidance by some
be function of the input parameters
teacher
(ii) The learning procedure only adjust the connection to Reinforcement is evaluation in form of reward
the output layer because output layer calculate it's Unsupervised is no information about desired responses
output in the same way as the hidden layer. Recording is be some memory storage.
71. A......... point of a fuzzy set A is point x ∈ at 73. Which of the following versions of window O.S.
which µA(x) = 0.5 contain built-in partition manager which
(a) core (b) support allows us to shrink and expand pre-defined
drives?
(c) crossover (d) α-cut
(a) Windows vista (b) Window 2000
Ans : (c) The crossover of a fuzzy set is the element in (c) Window NT (d) Window 98
U at which its membership function is o.5. Ans : (a) Windows vista have logical disk manager
The support of a fuzzy set F is the crispset of all points that supports shrinking & expanding volumes vista also
in the universe of discourse U such that the membership have a program that allow a user to upgrade their
function of f is non-zero running vista to higher edition.
If membership is 1 then it is a core of fuzzy set alpha 74. A Trojan horse is :
cut can be anything term to 1 (0<=λ⇐1) (a) A program that performs a legitimate
µ A(x) = 0.5 function that is known to an operating system
or its user and also has a hidden component
72. Match the following learning modes w.r.t.
that can be used for nefarious purposes like
characteristics of available information for attacks on message security or impersonation
learning : (b) A piece of code that can attach itself to other
A. Supervised i. Instructive programs in the system and spread to other
information on systems when programs are copied or
transferred
desired
(c) A program that spreads to other computer
responses
systems by exploiting security holes like
explicitly
weaknesses in facilities for creation of
specified by a remote processes
teacher (d) All of the above
B. Recording ii. A priori design Ans : (a) Trojan horse is any malicious program which
information for is used to hack into a computer by misleading users of it
memory storing true intent. Trojan can achieved any number of attack
C. Reinforcement iii. Partial on the host from irritating the user to damaging the host
(deleting files, stealing data, spread other virus)
information
about desired 75. Which of the following computing models is
responses, or not an example of distributed computing
environment?
only "right" or
(a) Cloud computing
"wrong"
(b) Parallel computing
evaluative
(c) Cluster computing
information
(d) Peer-to-peer computing
D. Unsupervised iv. No information
Ans : (b) Parallel computing means that different
about desired activities happen at same time. It means speed out a
responses single application over many processors to get it faster.
UGC NET JRF Computer Science 284 YCT
 U.G.C. NET Exam. June, 2014
COMPUTER SCIENCE
(Solved with Explanation Paper–II)
1. Infrared signals can be used for short range c. Network layer iii. Process to
communication in a closed area using _______ process message
propagation. delivery
(a) ground (b) sky d. Transport layer iv. Transmission of
(c) line of sight (d) space bit stream
Ans : (c) Because, wireless communication is of three e. Application v. Formation of
types:- (1) Radio wave, (2) Micro wave, (3) Infrared Layer frames
Infrared signal are used for short range communication Codes :
in a closed area using line of sight propagation. a b c d e
2. A bridge has access to ______ address in the (a) iv v ii iii i
same network. (b) v iv i ii iii
(a) Physical (b) Network (c) i iii ii v iv
(c) Datalink (d) Application (d) i ii iv iii v
Ans : (a) Because, A function of a Bridge take place in
Ans : (a) Because, (a) Physical layer : Responsible for
the Data link layer that means it cannot read ID address
transmission of packet in the stream of bit with proper
so giving it access to the physical address of all stations
encoding method.
connected to it.
(b) Data Link Layer : Formation of frame means
3. The minimum frame length for 10 Mbps framing is done at this layer and maximum frame size is
Ethernet is ______ bytes and maximum is is 1500B.
_____ bytes.
(c) Network Layer : Door to door delivery of packet
(a) 64 & 128 (b) 128 & 1518
(d) Transport Layer : End to end delivery
(c) 1518 & 3036 (d) 64 & 1518
(e) Application Layer : Allow resources to Network
Ans : (d) The original ethernet IEEE 802.3 standard access.
define the minimum ethernet frame size as 64 bytes and
maximum as 1518 bytes. 6. A grammar G is LL(1) if and only if the
following conditions hold for two distinct
Where payload size in ethernet defined the minimum 46
bytes and maximum 1500 bytes. productions A → α | β
I. First (α) ∩ First (β) ≠ {a} where a is some
4. The bit rate of a signal is 3000 bps. If each
signal unit carries 6 bits, the baud rate of the terminal symbol of the grammar.
signal is _____. II. First (α) ∩ First (β) ≠ λ
(a) 500 baud/sec (b) 1000 baud/sec III. First (α) ∩ Follow (A) = φ if λ ∈ First (β)
(c) 3000 baud/sec (d) 18000 baud/sec (a) I and II (b) I and III
Ans : (a) Because, Bit rate = Numbers of bits per unit (c) II and III (d) I, II and III
time Ans : (d) Because, Assume S → aX | aYb
Baud rate = Number of signal element or signal units first (aX) = a
per unit time . first (aYb) = a
Here, baud rate = (1/6)th bit rate So there will 2 entries for S in terminal 'a' which
Therefore baud rate = (1/6) ∗ 3000 = 500 baud /sec violates the rule of LL(1) grammar because for every
5. Match the following : variable and for every terminal there can be at most 1
production.
List - I List – II
Hence their intersection should be φ
a. Physical layer i. Allow resources
So, first one statement is correct
to network access
Second one is true with similar reasoning as for first.
b. Datalink layer ii. Move packets
Now, third assume example
from one
destination to (1) S → aSA | ε
other (2) A → C | ε
UGC NET JRF Computer Science 285 YCT
Now take 2) Production 10. The regular grammar for the language L =
first (c) = c {w|na (w) and nb(w) are both even, w ∈ {a, b} *}
follow (A) = follow (s) ⇒ first (A) = C, E, $ is given by :
Now the first (C) ∩ follow (A) = C (a) p → aq | br | λ, q → bs | ap
Means there will be again 2 entries for A in C place that r → as | bp, s → ar | bq, p and s
means again violation of LL(1) rules.
are initial and final states.
So first (C) ∩ follow (A) = φ is true
Hence the answer is (d). (b) p → aq | br, q → bs | ap
7. Which of the following suffices to convert an r → as | bp, s → ar | bq, p and s
arbitrary CFG to an LL(1) grammar? are initial and final states.
(a) Removing left recursion alone (c) p → aq | br | λ, q → bs | ap
(b) Removing the grammar alone r → as | bp, s → ar | bq
(c) Removing left recursion and factoring the
p is both initial and final states.
grammar
(d) None of the above (d) p → aq | br, q → bs | ap
Ans : (d) Removing left recursion and factoring from r → as | bp, s → ar | bq
the grammar do not suffice to covert an arbitrary CFG p is both initial and final states.
to LL(1) grammar.
Ans : (c) Because, This is Even − Even language.
Since, LL(1) parser is top down parser. For top-down
parsers, the grammar should be unambiguous, Number of a a's are divisible by 2 and number of b's are
deterministic and from left recursion. divisible by 2.
All the conditions must be satisfied. P → aA | bR | λ
8. A shift reduce parser suffers from Q → bS | aP
(a) shift reduce conflict only
(b) reduce reduce conflict only R → aS | ph
(c) both shift reduce conflict and reduce reduce S → aR | bQ
conflict
(d) shift handle and reduce handle conflicts ⇒ Design DFA for language.
Ans : (c) Because, A shift reduce and parses the input
text in one forward pass over the text, without backing
up (That forward direction is generally left to right
within a line, and top to bottom for multiline inputs)
9. The context free grammar for the language L =
{anbmck | k = |n − m|, n ≥ 0, m ≥ 0, k ≥ 0} is
(a) S → S1S3, S1 → aS1c | S2| λ, S2 → aS2b|λ,
S3 → aS3b| S4 | λ, S4 → bS4c|λ Convert DFA to CFG
(b) S → S1S3, S1 → aS1S2c | λ, S2 → aS2b|λ,
Hence option (c) is correct.
S3 → aS3b| S4 | λ, S4 → bS4c|λ
(c) S → S1|S2, S1 → aS1S2c | λ, S2 → aS2b | λ, 11. KPA in CMM stands for
S3 → aS3b | S4 | λ, S4 → bS4c|λ (a) Key Process Area
(d) S → S1 | S3, S1 → aS1c |S2 | λ, S2 → aS2b | λ, (b) Key Product Area
S3 → aS3b | S4 | λ, S4 → bS4c|λ (c) Key Principal Area
Ans : (d) Because, Elimination Method (d) Key Performance Area
(1) S → S1S3 → aS1c aS3b Ans : (a) Because, Key Process Area (KPA) used in
→ ac ab CMM identifies a cluster of related activities that, when
(which will not be generated by the Language.) performed collectively, achieve a set of goals
(2) S → S1S3 → aS1S2c aS3b considered important.
→ ac ab (same case as above) 12. Which one of the following is not a risk
(3) S → S1S2, S → S1 → aS1S2c management technique for managing the risk
aS1S2c → aaS1S2cS2c due to unrealistic schedules and budgets?
→ aaS2cS2c (a) Detailed multi source cost and schedule
→ aa ca S2 bc estimation.
→ aa ca bc (b) Design cost
(Which cannot be generated) (c) Incremental development
Hence the answer is (d). (d) Information hiding
UGC NET JRF Computer Science 286 YCT
Ans : (d) Because, Risk management is the Process of 16. How many different truth tables of the
identifying, controlling threats to an organization's compound propositions are there that involve
capital and earning. Risk management can be the propositions p & q?
considered as dealing with the possibility and actual (a) 2 (b) 4
occurrence of those events that are not regular expected (c) 8 (d) 16
and information hiding is the principle of segregation of Ans : (d) Because, Number of different truth table
the design decision in a computer program that are most
means number of different function possible with P &
like to change, thus protecting other parts of the
Q
program from extensive modification if the design
decision is changed. Now a truth table involving 2 prepositions has 4 entries,
each entries can has two possible values, there 2 ^ 4
13. _______ of a system is the structure or
different table i.e. 16, so the answer is (d).
structures of the system which comprise
software elements, the externally visible 17. A Boolean function F is called self-dual if and
properties of these elements and the only if
relationship amongst them. F(x1, x2, .......xn) = F( x1 , x2 ,.....xn )
(a) Software construction How many Boolean function of degree n are self-
(b) Software evolution dual ?
(c) Software architecture 2n

(d) Software reuse

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

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

UGC NET JRF Computer Science 291 YCT

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

UGC NET JRF Computer Science 293 YCT

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

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

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

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 )
2 ( n +1− r )
+ 3x is given as
(a) O (x log x) (b) O (x2) 39. A graph is non-planar if and only if it contains
3
(c) O (x ) (d) O (x2 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
Thus, log.x 2 + 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 311 YCT

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 312 YCT
 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 313 YCT

 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 314 YCT
 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 315 YCT
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 316 YCT
 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 317 YCT
 (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 318 YCT

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)
2.67
Standard) was widely used in the industry for (c) O (n ) (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 319 YCT

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

UGC NET JRF Computer Science 344 YCT

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 345 YCT
 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 346 YCT
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 347 YCT
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 348 YCT
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. S1: First (α) = {tα ⇒ 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 349 YCT

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 350 YCT
 (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
(a) 100P2 (b) 100C2 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 351 YCT
 (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 352 YCT

 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 353 YCT
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
average salary of the organization (c) x2–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 354 YCT
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 (2 m / 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 355 YCT
 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 WW5 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 356 YCT

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 2 20 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 357 YCT
 (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 358 YCT

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 359 YCT
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 360 YCT
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 P1
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 361 YCT
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 362 YCT
 (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 363 YCT
 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 364 YCT
 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 365 YCT
 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 366 YCT
 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 367 YCT

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 368 YCT
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 369 YCT
 (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 370 YCT
 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 371 YCT
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
Link Control).
function E(s) = S e(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 :
b. Transport layer 2. HDLC (a) 900 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 372 YCT
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(n ) 2 (a) 6 (b) 8
Ans. (c): T(n) = O(n ) 2 (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 373 YCT

 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 (3-1)+5 7 7
Ck = C5 = C5= C2 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 =
( 2 )!
3 −
1 T Q 3!
xxxyy : 6 =
T Q ( 2 )!
3 −
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 374 YCT
 3! (b) x11 = 20, x12 = 20, x13 = 10,
xxyxy : 6 = x22 = 20, x23 = 20, x24 = 10,
( 3 − 2 )!
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 =
( 3 − 2 )! 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 375 YCT
 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 376 YCT
 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 377 YCT
 (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 378 YCT

 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
i-1 decomposition (→indicates functional
Ans. (c) : no greater than 2
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 379 YCT

 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 380 YCT

 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 ) e2 π / ω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 381 YCT
 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 382 YCT
 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 383 YCT
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
access. The major advantage of B+ tree is in reducing retrieved from RAM?
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 384 YCT
 Ans. (a) : 2400 bauds (b) Are we building the right product
Modulation Baud rate Bit rate (c) Verification of fields
4 – PSK N 2N (d) None of the above
8 – PSK N 3N Ans. (b) : Are we building the right product
Because validation means "are we building the right
16 – PSK N 4N
product" and verification means "are we building the
Because, two values are provided, one is bps product right".
which is nothing but bits per second which is 9600
23. If a process is under statistical control, then
and also level which is 16. According to table given
it is
above for a 16–PSK give a baud rate N. the bit rate
would be 4N. Here bps is provides which is 9600. In (a) Maintainable (b) Measurable
order to calculate the baud rate we have to divide bs/4. (c) Predictable (d) Verifiable
Because the signal level is 16. So the answer would be Ans. (c) : Predictable is a real valued stochastic
9600/4 = 2400 baud. process whose values are known in a sense, just in
19. The station to hub distance in which it is 2000 advance of time. Because, predictable process is also
metres. said to be under statistical control.
(a) 100 Base-Tx (b) 100 Base-Fx 24. In a function oriented design, we
(c) 100 Base-T4 (d) 100 Base-T1 (a) Minimize cohesion and maximize coupling
Ans. (b) : 100 Base-Fx (b) Maximize cohesion and minimize coupling
Fast Ethernet is refered by 100 Base-x standard has (c) Maximize cohesion and maximize coupling
three specification. Here 100 refers to the speed. (d) Minimize cohesion and minimize coupling
1. 100 Base T4 Ans. (b) : Maximize cohesion and minimize
2. 100 Base Tx coupling.
3. 100 Base Fx Because, the design purpose is to making coupling
⇒ 100 Base Fx uses the 2-standard fibre optic minimize and maximize the cohesion. Cohesion is a
cable and the station to hub distance is 2000 way to understand that how close or bound your
meters. module is, and coupling is the level of interactivity
between modules for a good design to happen.
20. Main aim of software engineering is to produce
Cohesion should be more and coupling should be less.
(a) Program
25. Which of the following metric does not depend
(b) Software
on the programming language used?
(c) Within budget
(a) Line of code (b) Function count
(d) Software within budget in the given schedule
(c) Member of token (d) All of the above
Ans. (d) : Because every software would be produce
Ans. (b) : Function count.
within the specific budget and in the specific time.
Because function count does not depend on
21. Key process areas of CMM level 4 are also programming language. Function count are a unit of
classified by a process which is measure a software just like a unit of measure for
(a) CMM level 2 (b) CMM level 3 temperature would be degree.
(c) CMM level 5 (d) All of the above
26. A/B + tree index is to be built on the name
Ans. (c) : CMM level 5 attribute of the relation STUDENT, Assume
Because, In CMM Model there are five maturity levels that all students names are of length 8 bytes,
is identified by the number 1 to 5. They are– disk block are of size 512 bytes and index
(1) Initial, (2) Managed, (3) Defined, (4) Quantitavely pointers are of size 4 bytes. Given this scenario
Managed, (5) Optimizing what would be the best choice of the degree (i.e.
If a organisation is at level 2. It means it has crossed number of pointers per node) of the B + tree?
over level 1 and the same holds true and subsequent (a) 16 (b) 42
levels. At level 4, the process at level 3 is also (c) 43 (d) 44
included. CMM Level 5 is not correct because the Ans. (c) : (43)
question only talks about level 4. CMM level 2 is not Because, Now we see how it comes,
correct because level 3 includes level & as well. So Let n be the degree
option (c) is correct. given, key size (length of the name attribute of student)
22. Validation means = 8 bytes (k), index pointer size = 4 bytes (b)
(a) Are we building the product right Disk Block Size = 512 bytes
UGC NET JRF Computer Science 385 YCT
 Degree of B+ tree can be calculated if we know the ⇒ Wait time is the amount of time a process has
maximum number of key a internal code can have. The been waiting in the ready queue
formula is, ⇒ Response time is the time taken between the
⇒ (n–1) k + n * b = block size process submission and the first response
⇒ (n–1) * 8 + n * 4 = 512 produced.
⇒ 8n – 8 – 4n = 512 In RR algorithm, value of time slice, plays a crucial
⇒ 12 = 520 role in deciding how effective the algorithm is. If
quantum time is too small then it could be like context
⇒ n = 520/12 = 43 (Option c)
switching and if quantum time is high, the RR be
27. The In order traversal of the tree will yield a haves like FCFS, the average response time varies
sorted listing of elements of tree in irregularly. So the answer is option (d).
(a) Binary tree (b) Binary search tree
31. Resources are allocation to the process non-
(c) Heaps (d) None of the above share below basis is :
Ans. (b) : Binary search tree (a) Mutual exclusion (b) Hold and wait
Because, In BST all elements to the root of the tree will (c) No pre-emption (d) Circular wait
lesser than the root. Also elements greater than the root
Ans. (a) : Mutual exclusion is a program object that
will be right of the root, so the answer is Option (b)
prevents simultaneous access to a shared resource.
28. Mobile IP provides two basic functions This concept is used in concurrent programming with a
(a) Route discovery and registration critical section, a piece of code in which processes or
(b) Agent discovery and registration threads access a shared resource.
(c) IP binding and registration 32. Catch on and interleaved memories are ways of
(d) None of the above speeding up memory access between CPU and
Ans. (b) : Agent discovery and registration slower RAM. Which memory models are best
Because, Mobile IP is the basic behind how wireless suited (i.e. Improves the performance mostly
devices offer IP connectivity. which program)
Agent discovery: A mobile node discovers its foreign (1) Cached memory is best suited for small loops.
and home agents during discovery. (2) Interleaved memory is best suited for small
Registration: the mobile node registers its current loops
location with the foreign agent and him agent during (3) Interleaved memory is best suited for large
registration. Are two basic functions involved here, so sequential code.
the option is (b). (4) Cached memory is best suited for large
29. Pre-emptive scheduling is the strategy of sequential code.
temporarily suspending a gunning process (a) 1 and 2 are true (b) 1 and 3 are true
(a) Before the CPU time slice expires (c) 4 and 2 are true (d) 4 and 3 are true
(b) To allow starving processes to run Ans. (b) : Interleaved memory is best suited for
(c) When it requests I/O small 100 ps.
(d) To avoid collision Because, Here multiple memory chips are grouped
Ans. (a) : Before the CPU time slice expires together to form what we are known as banks. Each of
Because, Every process is allocated a specific time then take turns for supplying data. An interleaved
slice in the CPU and it runs for that entire time. In pre- memory with "n" banks is said to be n-way
emptive scheduling even before the process time slice interleaved. Macintosh system are considered to be one
expires. It is temporarily suspended from its execution. using memory interleaving.
So the option is (a). 33. Consider the following page trace : 4, 3, 2, 1, 4,
30. In round robin CPU scheduling as time 3, 2, 1, 5 Percentage of page fault that would
quantum is increased the average turn around occur if FIFO page replacement algorithm is
time used with number of frame for JOB m = 4 will
(a) Increases (b) Decreases be :
(c) Remains constant (d) Varies irregularly (a) 8 (b) 9
Ans. (d) : Varies irregularly (c) 10 (d) 12
Because, ⇒ Turn around time is the interval of time Ans. (c) : 10
between the submission of a process and its Because, reference string is 4, 3, 2, 1, 4, 3, 2, 1, 5
completion. number of frames m = 4
UGC NET JRF Computer Science 386 YCT
 ⇒ First 4 references (4, 3, 2, 1) cause page faults 37. Interrupts which are initiated by an instruction
and brought into empty frames are
⇒ next reference (4) is already available and so (a) Internal (b) External
there is no page fault (c) Hardware (d) Software
⇒ next reference (3) is also ready available and so Ans. (c) : Hardware
there is no page fault Interrupts are of three types–(1) External interrupts,
⇒ the next reference (5) replaces page 4 which was (2) Internal interrupts, (3) Software interrupts.
brought the first no. of page fault = 5 Hardware interrupts are used by devices to
⇒ next reference (4) replace page 3 which is the communicate that they require attention from the
next to come in no. of page faults = 6 operating system.
⇒ next reference (3) replaces 2 no. of page faults 38. printf("%c" 100)
till now = 7 (a) Prints 100
⇒ next reference (2) replaces 1 a which was to last (b) Prints ASCII equivalent of 100
pages to come in no. of page fault till now = 8 (c) Prints garbage
⇒ next reference (1) replaces 5 which as the first to (d) None of the above
come in the second cycle no. of page faults till
Ans. (b) : Prints ASCII equivalent of 100
now = 9
Because the %c format prints the ASCII equivalent of
⇒ the last reference in the reference string is 5 which
the value.
will replace 4 no. of page faults till now = 10
39. For the transmission of the signal, Bluetooth
⇒ the page faults are the 10 so the answer is option
wireless technology uses
(c).
(a) Time division multiplexing
34. Check sum used along with each packet
(b) Frequency division multiplexing
computes the sum of the data, where data is
treated as a sequence of (c) Time division duplex
(a) Integer (b) Character (d) Frequency division duplex
(c) Real numbers (d) Bits Ans. (c) : Time division duplex is the application of
Ans. (b) : Character time division multiplexing to separate outward and
Because, check sum is the error detecting mechanism return signals.
when data is treated as a sequence of character. parity Here Bluetooth technology uses time division duplex
is a mechanism used when data is treated as a sequence transmission duplex.
of bits. 40. Consider the following statements
35. If an integer needs two bytes of storage, then a. Recursive languages are closed under
the maximum value of a signed integer is complementation.
(a) 216 – 1 (b) 215 – 1 b. Recursively enumerable languages are closed
(c) 216 (d) 215 under union.
15
Ans. (b) : 2 – 1 c. Recursively enumerable languages are closed
In case of magnitude Representation the Range is from under complementation.
(2n–1–1) to (2n–1–1) Which of the above statements are true?
Min no. that can be represent in this system is –(2n–1–1) (a) 1 only (b) 1 and 2
Max no. that can be represent in this system is (2n–1–1) (c) 1 and 3 (d) 2 and 3
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)
216–1 → 215–1 intersection, (5) complement, (6) set difference
36. Which of the following logic families is well Recursively enumerable languages are enclosed
suited for high-speed operations? under 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 under compliment, so the statement (1) and (2) are
speed integrated circuit bipolar transistor logic family. only true.

UGC NET JRF Computer Science 387 YCT

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 388 YCT
 U.G.C. NET Exam. June, 2012
COMPUTER SCIENCE
(Solved with Explanation Paper–III)
1. Consider the following pseudo code segment: (b) require about the same amount of time
K: = O for i1: = 1 to n for i2 : = 1 to i1 : For im: (c) require different amount of time with time
=1to im – 1 K: = K + 1 The value of K after the difference between any two tasks being same
execution of this code shall be (d) require different amount with time difference
(a) C (n + m – 1, m) (b) C (n – m + 1, m) between any two tasks being different
(c) C (n + m – 1, n) (d) C (n – 1 + 1, n) Ans. (b) : Require about the same amount of time.
Ans. (a) : C (n + m – 1, m) Because, Pipe lining is a technique to build fast
Because, In order to understand the solution to this processors it allows the execution of multiple
problem let us consider some sample value of n and m. instruction by overlapping them. Pipe lining can
Let us say n = 3 and m = 2. The value of m also executes multiple instructions. So it requires the same
decides the number of inner loop we have. When we amount of time. So that the answer is B.
say m = 2, the total number of loops we have is 2 only 4. What is Granularity?
n decides the range of outer most loop, so the (a) The size of database
psudocode can be under stood as (b) The size of data item
k=0 (c) The size of record
for i = 1 to n (d) The size of file
for m = 1 to i Ans. (b) : The size of data item is often called the data
k=k+1 item granularity.
⇒ For the value of n = 3 and m = 2, the value of k
5. Suppose that given application is run on a 64-
would be incriminated in following manner
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
Ans. (b) : in delta rule for error minimization, weights (a) {0.9, 0.7, 0.4, 0.8, 0.9}
are adjusted with respect to difference between desired (b) {0.2, 0.4, 0.8, 0.5, 0.2}
output and actual output. (c) {0.1, 0.3, 0.6, 0.3, 0.1}
3. The concept of pipelining is most effective in (d) {0.7, 0.3, 0.4, 0.2, 0.7}
improving performance if the tasks being Ans. (a) :
performed in different stages: Give two fuzzy set
(a) require different amount of time µÁ ={0,2,0.4,0.8, 0.5, 0.1}
UGC NET JRF Computer Science 389 YCT
 µÁ ={0.1,0.3,0.6,0.3,0.2} 10. In an image compression system 16384 bits are
so, µÁUB(x)= {0.2,0.4, 0.8, 0.5, 0.2} used to represent 256 × 256 image with 256
and gray level. What is the compression ratio for
µÁUB(x)= {0.8, 0.6, 0.2, 0.5, 0.8} this system?
= 1-{0.1,0.3, 0.6, 0.3, 0.1} (a) 1 (b) 2
={0.9, 0.7, 0.4, 0.7, 0.9} (c) 4 (d) 8
7. Match the following: Ans. (*) number of bits required to store a 256×256
(a) OLAP 1. Regression image with 256 gray level is
(b) OLTP 2.Data Warehouse 256 gray level is=28
(c) Decision Tree 3. RDBMS Therefore, compression ratio = 256×256×8/16384 =32
(d) Neural Network 4. Classification
11. X.25 is .......... Network.
(a) 2 3 1 4 (b) 2 3 4 1
(a) Connection Oriented Network
(c) 3214 (d) 3241
(b) Connection less Network
Ans. (b) : In OLTP database there is detailed and
(c) Either Connection Oriented or Connection
current data. In OLTP database schema used to store
transaction data usually 3NF. OLAP is characterized Less
by relatively low volume of transactions. (d) Neither Connection Oriented nor Connection
Decision tree is used for classification of data in data Less
mining and AI. Ans. (a) X.25 is an ITU-T standard protocol suite for
Neural networks are used for the purpose of packet switched Wide Area Network communication.
unsupervised learning, regression or classification. NSAP addressing facility was added in the X.25
8. Which level of Abstraction describes what data revision of the specification, and this enabled X.25 to
are stored in the Database? better meet the requirements of OSI connection-
(a) Physical level (b) View level Oriented Network service (CONS).
(c) Abstraction level (d) Logical level 12. Which of the following can be used for
Ans. (d) : Logical level clustering of data?
Because, Logical level describes what data are stored (a) Single lever perception
in the data base and what relationship among those (b) Multilayer Perception
data. (c) Self organizing map
8. The problem that occurs when one transaction (d) Radial basis function
updates a database item and them the Ans. (c) : Self Organizing map is a type of Artificial
transaction fails for some reason is ......... Neural Network that is trained using unsupervised
(a) Temporary Select Problem learning to produce a low dimensional maps. In maps
(b) Temporary Modify Problem
consisting of thousands of nodes, it is possible to
(c) Dirty Read Problem
perform cluster operations on the map itself.
(d) None
13. Which of the following is scheme to deal with
Ans. (c) : Dirty Read Problem
Because, when transaction updates a database item deadlock?
then the transaction fails for some reason, is said to be (a) Time out (b) Time in
Dirty Read Problem or Transaction update problem. (c) Both A & (B) (d) None of the above
9. The problem that occurs when one transaction Ans. (a) : Time out
updates a database item and then the transaction fails Because, One of the strategy to avoid dead lock
for some reason is ________. situation in java multithreading is using timeout.
(A) Temporary Select Problem Suppose, one thread has acquired lock on one resource
(B) Temporary Modify Problem and now waiting for lock on another resource. After
(C) Dirty Read Problem certain time period if it can not acquire lock on
(D) None resource and then it should stop waiting for lock on
Ans (c): The temporary (or dirty read) problem this resource 2. Also it should release lock on resource 1.
problem occurs when one transaction updates a Thus lock is avoided, so the Answer is a
database item and then transaction fails for some 14. It the pixels of an image are shuffled then the
reason. The updated item is accessed by another parameter that may change is
transaction before it is changed back to its original (a) Histogram (b) Mean
value. (c) Entropy (d) Covariance
UGC NET JRF Computer Science 390 YCT
 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 391 YCT

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 392 YCT
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 393 YCT
 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 394 YCT
 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 395 YCT
 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 396 YCT

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 397 YCT

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
n
 1 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 398 YCT

55. 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
–1
and then assigned to a base class pointer, whenever a
(c) 10 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 399 YCT

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 400 YCT