UPKAR PRAKASHAN, AGRA-2

Compiled byChandresh Shah (MCA)

Saurab Mishra (MCA)

Edited bySunil Kumar Ojha (PHDBP)

Revised byDr. Arvind Mohan Parashar

&Prof. Ashok Arora

Revised Edition

© Publishers

Publishers

UPKAR PRAKASHAN2/11A, Swadeshi Bima Nagar, AGRA–282 002Phone : 4053333, 2530966, 2531101Fax : (0562) 4053330E-mail : care@upkar.in, Website : www.upkar.in

Branch Offices :4845, Ansari Road, Daryaganj,New Delhi—110 002Phone : 011–23251844/66

Paras Bhawan(First Floor),Khazanchi Road,Patna—800 004Phone : 0612–2673340

1-8-1/B, R.R. Complex (Near SundaraiahPark, Adjacent to Manasa Enclave Gate),Bagh Lingampally,Hyderabad—500 044Phone : 040–66753330

28, Chowdhury Lane, ShyamBazar, Near Metro Station,Gate No. 4Kolkata—700 004 (W.B.)Phone : 033–25551510

B-33, Blunt Square, KanpurTaxi Stand Lane, Mawaiya,Lucknow—226 004 (U.P.)Phone : 0522–4109080

8-310/1, A. K. House,Heeranagar, Haldwani,Distt.—Nainital—263 139(Uttarakhand)Mob. : 7060421008

● The publishers have taken all possible precautions in publishing this book, yet ifany mistake has crept in, the publishers shall not be responsible for the same.

● This book or any part thereof may not be reproduced in any form byPhotographic, Mechanical, or any other method, for any use, without writtenpermission from the Publishers.

● Only the courts at Agra shall have the jurisdiction for any legal dispute.

ISBN : 978-81-7482-586-5

Code No. 894

Printed at : Upkar Prakashan (Printing Unit) Bye-pass, Agra

CONTENTS

● Previous Years’ Solved Papers

1. Discrete Structures …………….……………………………………… 3–52* Objective Type Questions …………………………………………... 24

2. Computer Arithmetics ………………………………………………… 53–148* Objective Type Questions …………………………………………... 111

3. Principles of Programming in C & C++ ….…………………………… 149–335* Objective Type Questions …………………………………………... 279

4. Computer Graphics ………………………………....………………… 336–385* Objective Type Questions …………………………………………... 379

5. Concepts of Database ………………………………….……………… 386–461* Objective Type Questions …………………………………………... 443

6. Data and File Structure ………………………………..……………… 462–546* Objective Type Questions …………………………………………... 528

7. Computer Networks and Transmission System ………….…………… 547–624* Objective Type Questions …………………………………………... 604

8. System Software and Compilers ……………………...……………… 625–653* Objective Type Questions …………………………………………... 634

9. Operating System …………………………………...………………… 654–753* Objective Type Questions …………………………………………... 718

10. Concepts of Software Engineering………………….....……………… 754–845* Objective Type Questions …………………………………………... 826

11. Current Trends and Technologies……………………………………… 846–916

* Objective Type Questions …………………………………………... 901

12. Artificial Intelligence……………………………………..…………… 917–979

* Objective Type Questions …………………………………………... 1–16

Syllabus

PAPER–II1. Discrete Structures

Sets, Relations, Functions, Pigeonhole Principle, Inclusion-Exclusion, Principle, Equivalence andPartial Orderings, Elementary Counting Techniques, Probability, Measures(s) for information andMutual information.

Computability : Models of Computation—Finite outomata, Pushdown Automata, Non-determinism and NFA, DPDA and PDAs 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 andcircuits. Tree and rooted tree. Spanning trees. Eccentricity of a vertex radius and diameter of agraph. Central Graphs. Centre(s) of a tree. Hamiltonian and Eulerian graphs, Planar graphs.

Groups : Finite fields and Error correcting/detecting codes.

2. Computer ArithmeticPrepositional (Boolean) Logic, Predicate Logic, Well-formed formulae (WFF), Satisfiability andTautology.

Logic Families :TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Booleanfunctions, Flip-flops types, race condition and comparison. Design of combinational and sequentialcircuits.

Representation of Integers : Octal, Hex, Decimal, and Binary. 2's complement and 1’scomplement arithmetic. Floating point representation.

3. Programming in C and C++Programming in C : Elements 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, andpointers.

O-O Programming Concepts : Class, object, instantiation. Inheritance, polymorphism andoverloading.

C++ Programming : Elements of C++ —Tokens, identifiers. Variables and constants, Data types,Operators, Control statements, Functions parameter passing. Class and objects. Constructors anddestructors. Overloading, Inheritance, Templates, Exception handling.

4. Relational Database Design and SQLE-R diagrams and their transformation to relational design, normalization—1NF, 2NF, 3NF, BCNFand 4NF. Limitations of 4NF and BCNF.

( v )

SQL : Data Definition Language (DDL), Data Manipulation Language (DML), Data controlLanguage (DCL) commands. Database objects like—Views, indexes, sequences, synonyms, datadictionary.

5. Data and File StructuresData, 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 NetworksNetwork fundamentals : Local Area Networks (LAN), Metropolitan Area Networks (MAN), WideArea 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 millimeter waves, Lightwave transmission. Telephones—local loop, trunks, multiplexing, switching, narrowband ISDN,broadband ISDN, ATM, High speed LANS, Cellular Radio. Communication satellites—geosynchronous and low-orbit.

Internetworking : Switch/Hub, Bridge, Router, Gateways, Concatenated Virtual circuits,Tunnelling, Fragmentation, Firewalls.

Routing : Virtual circuits and datagrams. Routing algorithms, Conjestion control.

Network Security : Cryptography—public key, secret key. Domain Name System (DNS)—Electronic Mail and Worldwide Web (WWW). The DNS. Resource Records, Name servers. E-mail-architecture and Serves.

7. System Software and CompilersAssembly 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 compilers. Phases of compilation process. Lexicalanalysis. Lex package on Unix system.

Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees asrightmost and leftmost derivations. Bottom up parsers—shift-reduce, operator precedence, and LR.YACC package on Unix system.

Topdown parsers—left recursion and its removal. Recursive descent parser. Predictive parser,Intermediate codes—Quadruples, Triples, Intermediate code generation, Code generation, Codeoptimization.

8. Operating Systems (with Case Study of Unix)Main functions of operating systems. Multiprogramming, multiprocessing, and multitasking.

Memory Management : Virtual memory, paging, fragmentation.

( vi )

Concurrent Processing : Mutual exclusion. Critical regions, lock and unlock.

Scheduling : CPU scheduling, I/O scheduling, Resource scheduling, Deadlock and schedulingalgorithms. Banker’s algorithm for deadlock handling.

UNIX

The Unix System : File system, process management, bourne shell, shell variables, command lineprogramming.

Filters and Commands : Pr, head, tail, cut, paste, sort, uniq, tr. join, etc., grep, egrep, fgrep, etc.,sed, awk, etc.

System Calls (like) : Creat, open, close, read, write, iseek, link, unlink, stat, fstat, umask, chmod,exec, fork, wait, system.

9. Software EngineeringSystem 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 reengineering.

10. Current Trends and TechnologiesThe Topics of current interest in Computer Science and Computer Applications shall be covered.The experts shall use their judgement from time to time to 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 switchingmethods, mobile information access devices, mobile data internetworking standards, cellular datacommunication protocols, mobile computing applications. Mobile databases—protocols, scope,tools and technology. M-business.

E-Technologies

Electronic Commerce : Framework, Media Convergence of Applications, ConsumerApplications, Organisation Applications.

Electronic Payment Systems : Digital Token, Smart Cards, Credit Cards, Risks in ElectronicPayment System, Designing Electronic Payment Systems.

Electronic Data Interchange (EDI) : Concepts, Applications, (Legal, Security and Privacy)issues, EDI and Electronic Commerce, Standardization and EDI, EDI Software Implementation,EDI Envelope for Message Transport, Internet-Based EDI.

( vii )

Digital Libraries and Data Warehousing : Concepts, Types of Digital documents, Issues behinddocument 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 MultimegabitData 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 warehousemethodology, analysis, design, construction and administration.

Data Mining : Extracting models and patterns from large databases, data mining techniques,classification, regression, clustering, summarization, dependency modelling, link analysis,sequencing analysis, mining scientific and business data.

Windows ProgrammingIntroduction to Windows programming— Win32, 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 ProgrammingMultiple Document Interface (MDI), Multithreading. Object linking and Embedding (OLE). ActiveX controls. Active Template Library (ATL). Network programming.

PAPER-III (A)CORE GROUP

Unit–ICombinational Circuit Design, Sequential Circuit Design, Hardwired and Microprogrammedprocessor design, Instruction formats, Addressing modes, Memory types and organisation,Interfacing peripheral devices, Interrupts.

Microprocessor architecture, Instruction set and Programming (8085, P-III/P-IV), Microprocessorapplications.

Unit–IIDatabase Concepts, ER diagrams, 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, ObjectOriented Database Management Systems (Concepts, Composite objects, Integration with RDBMSapplications), ORACLE.

( viii )

Unit–IIIDisplay systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation,Graphic standard, Applications.

Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.

Unit–IVProgramming Language Concepts, Paradigms and models.

Data. Data types, Operators, Expressions, Assignment. Flow of Control—Control structures, I/Ostatements, User-defined and built-in functions, Parameter passing.

Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, referencesemantics and their implementation.

Principles, functions, lists, types and plymorphisms, higher order functions, lazy evaluation,equations and pattern matching.

Principles, horn clauses and their execution, logical variables, relations, data structures, controllingthe search order, program development in prolog, implementation of prolog, example programs inprolog.

Principles of parallelism, coroutines, communication and execution. Parallel Virtual Machine(PVM) and Message Passing Interface (MPI) routines and calls. Parallel programs in PVMparadigm as well as MPI paradigm for simple problems like matrix multiplication.

Preconditions, post-conditions, axiomatic approach for semantics, correctness, denotationalsemantics.

Compiler structure, compiler construction tools, compilation phases.

Finite Automata, Pushdown Automata. Non-determinism and NFA, DPDA, and PDAs andlanguages accepted by these structures. Grammars, Languages—types of grammars—type 0, type1, type 2, and type 3. The relationship between types of grammars, and finite machines. Pushdownautomata and Context Free Grammars. Lexical Analysis—regular expressions and regularlanguages. LEX package on Unix. Conversion of NFA to DFA. Minimizing the number of states ina DFA. Compilation and Interpretation. Bootstrap compilers.

Context free grammars. Parsing and parse trees. Representation of parse (derivation) trees asrightmost and leftmost derivations. Bottom up parsers—shift-reduce, operator precedence, and LR.YACC package on Unix system. Topdown parsers—left recursion and its removal. Recursivedescent parser. Predictive parser, Intermediate codes—Quadruples, triples. Intermediate codegeneration, Code generation, Code optimization.

Unit–VAnalog and Digital transmission, Asynchronous and Synchronous transmission, Transmissionmedia, 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, Networkadministration.

( ix )

Unit–VIDefinition, Simple and Composite structures, Arrays, Lists, Stacks queues, Priority queues, Binarytrees, 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 likefinding of a maximum of n elements. Recursion and its systematic removal. Quicksort—Non-recursive implementation 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–VIIObject, 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–VIIISoftware development models, Requirement analysis and specifications, Software design,Programming techniques and tools, Software validation and quality assurance techniques, Softwaremaintenance and advanced concepts, Software management.

Unit–IXIntroduction, Memory management, Support for concurrent process, Scheduling, System deadlock,Multiprogramming system, I/O management, Distributed operating systems, Study of Unix andWindows NT.

Unit–XDefinitions, AI approach for solving problems.

Automated Reasoning with propositional logic and predicate logic—fundamental proofprocedure, 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.

Frames, scripts, semantic nets, production systems, procedural representations, Prologprogramming.

Components of an expert system, Knowledge representation and Acquisition techniques, Buildingexpert 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 of DSS, Group decision support system and case studies,Adaptive design approach to DSS development, Cognitive style in DSS, Integrating expert andDecision support systems.

( x )

PAPER-III (B)[ELECTIVE/OPTIONAL]

Elective–ITheory of Computation : Formal language, Need for formal Computational models, Non-computational problems, diagonal argument and Russel’s paradox.

Deterministic Finite Automaton (DFA), Non-deterministic Finite Automaton (NFA), Regularlanguages and regular sets, Equivalence of DFA and NFA. Minimizing the number of states of aDFA. Non-regular languages, and Pumping lemma.

Pushdown Automaton (PDA), Deterministic Pushdown Automaton (DPDA), Non-equivalence ofPDA and DPDA.

Context free Grammars : Greibach Normal Form (GNF) and Chomsky Normal Form (CNF),Ambiguity, Parse Tree Representation of Derivations. Equivalence of PDA’s and CFG’s. Parsingtechniques for parsing of general CFG’s—Early’s, Cook-Kassmi-Younger (CKY), and Tomita’sparsing.

Linear Bounded Automata (LBA) : Power of LBA. Closure properties.

Turing Machine (TM) : One tape, multitape. The notions of time and space complexity in termsof TM. Construction of TM for simple problems. Computational complexity.

Chomsky Hierarchy of languages : Recursive and recursively-enumerable languages.

Elective–IIModels for Information Channel : Discreate 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-Ziev (LZ) Codes. Optimality ofthese 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, Generator matrix, Decoding of linear codes,Hamming codes.

Image Processing : Image Registration, Spatial Fourier Transforms, Discrete Spatial(2-dimensional) Fourier Transforms, Restoration, Lossy Compression of images (pictures).

Data Compression Techniques : Representation and compression of text, sound, picture, andvideo files (based on the JPEG and MPEG standards).

Elective–IIILinear Programming Problem (LPP) in the standard form LPP in Canonical form. Conversion ofLPP in Standard form to LPP in Canonical form. Simplex—Prevention of cyclic computations inSimplex and Tableau, Big-M method, dual simplex and revised simplex.

Complexity of simplex algorithm(s). Exponential behaviour of simplex.

Ellipsoid Method and Karmakar’s method for solving LPPs. Solving simple LPPs through thesemethods. Comparison of complexity of these methods.

( xi )

Assignment and Transportation Problems : Simple algorithms like Hungarian method, etc.

Shortest Path Problems : Dijkstra’s and Moore’s method. Complexity.

Network Flow Problems: Formulation. Max-Flow Min-Cut theorem. Ford and Fulkerson’salgorithm. Exponential behaviour of Ford and Fulkerson’s algorithm. Malhotra-Pramodkumar-Maheshwari (MPM) Polynomial algorithm for solving Network flow problem. Bipartite Graphsand Matchings; Solving matching problems using Network flow problems.

Matroids : Definition. Graphic and Cographic 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 ofconvergence of iterative methods for solving these problems.

Elective–IVNeural Networks : Perceptron model, Linear separability and XOR problem. Two and threelayered neural nets, Backpropagation—Convergence, Hopfield nets, Neural net learning,Applications.

Fuzzy Systems : Definition of a Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures,Fuzzy reasoning, Applications of Fuzzy systems.

Elective–VUnix : Operating System, Structure of Unix Operating System, Unix Commands, Interfacing withUnix, Editors and Compilers for Unix, LEX and YACC, File system, System calls, Filters, Shellprogramming.

Windows : Windows environment, Unicode, Documents and Views, Drawing in a window,Message handling, Scrolling and Splitting views, Docking toolbars and Status bars, Commondialogs and Controls, MDI, Multithreading, OLE, Active X controls, ATL, Database access,Network programming.

UGC–NET Computer Science & Applications–II (J–16) | 1

July 2016Computer Science & Applications

(Paper–II)

Note—This paper contains fifty (50) objectivetype questions of two (2) marks each. All questionsare compulsory.

1. How many different equivalence relations withexactly three different equivalence classes arethere on a set with five elements ?(A) 10 (B) 15(C) 25 (D) 30

2. The number of different spanning trees in com-plete graph, K4 and bipartite graph, K2,2 have........... and .......... respectively.(A) 14, 14 (B) 16, 14(C) 16, 4 (D) 14, 4

3. Suppose that R1 and R2 are reflexive relationson a set A. Which of the following statementsis correct ?(A) R1 ∩ R2 is reflexive and R1 ∪ R2 is irre-

flexive(B) R1 ∩ R2 is irreflexive and R1 ∪ R2 is

reflexive(C) Both R1 ∩ R2 and R1 ∪ R2 are reflexive(D) Both R1 ∩ R2 and R1 ∪ R2 are irreflexive

4. There are three cards in a box. Both sides ofone card are black, both sides of one card arered, and the third card has one black side andone red side. We pick a card at random andovserve only one side.What is the probability that the opposite side isthe same colour as the one side we observed ?(A) 3/4 (B) 2/3(C) 1/2 (D) 1/3

5. A clique in a simple undirected graph is a com-plete subgraph that is not contained in any

larger complete subgraph. How many cliquesare there in the graph shown below ?

(A) 2 (B) 4(C) 5 (D) 6

6. Which of the following logic expression isincorrect ?(A) 1 ⊕ 0 = 1 (B) 1 ⊕ 1 ⊕ 1 = 1(C) 1 ⊕ 1 ⊕ 0 = 1 (D) 1 ⊕ 1 = 0

7. The IEEE-754 double-precision format torepresent floating point numbers, has a lengthof ............ bits.(A) 16 (B) 32(C) 48 (D) 64

8. Simplified Boolean equation for the followingtruth table is—

x y z F0 0 0 00 0 1 10 1 0 00 1 1 11 0 0 11 0 1 01 1 0 11 1 1 0

(A)_ _

F yz yz= + (B)_ _

F xy xy= +(C)

_ _F xz xz= + (D)

_ _F xz xz xyz= + +

UGC-NET/JRF Exam., Solved Paper

2 | UGC–NET Computer Science & Applications–II (J–16)

9. The simplified form of a Boolean equation_ _ _ _ _

(AB + ABC + AC) (AC + B) is—

(A)_

AB (B)_

ABC(C)

_AB (D) ABC

10. In a positive-edge-triggered JK flip-flop,if J andK both are high then the output will be ...........on the rising edge of the clock.(A) No change (B) Set(C) Reset (D) Toggle

11. Given, i = 0, j = 1, k = – 1x = 0.5, y = 0.0

What is the output of the following expressionin C language ?

x * y < i + j || k(A) – 1 (B) 0(C) 1 (D) 2

12. The following statement in ‘C’int (*f())[ ];

declares—(A) a function returning a pointer to an array

of integers(B) a function returning an array of pointers

to integers(C) array of functions returning pointers to

integers(D) an illegal statement

13. Which one of the following is correct, when aclass grants friend status to another class ?(A) The member functions of the class gene-

rating friendship can access the membersof the friend class

(B) All member functions of the class grantedfriendship have unrestricted access to themembers of the class granting the friend-ship

(C) Class friendship is reciprocal to each other(D) There is no such concept

14. When a method in a subclass has the same nameand type signatures as a method in the super-class, then the method in the subclass ...............the method in the superclass.(A) Overloads (B) Friendships(C) Inherits (D) Overrides

15. What is the value returned by the function fgiven below when n = 100 ?

int f (int n){ if (n = = 0), then return n;

elsereturn n + f(n-2);

}(A) 2550 (B) 2556(C) 5220 (D) 5520

16. In RDBMS, the constraint that no key attribute(column) may be NULL is referred to as—(A) Referential integrity(B) Multi-valued dependency(C) Entity Integrity(D) Functional dependency

17. Which of the following statement(s) is/areFALSE in the context of Relational DBMS ?1. Views in a database system are important

because they help with access control byallowing users to see only a particular sub-set of the data in the database.

2. E-R diagrams are useful to logically modelconcepts.

3. An update anomaly is when it is not possibleto store information unless some other,unrelated information is stored as well.

4. SQL is a procedural language.

(A) 1 and 4 only (B) 3 and 4 only(C) 1, 2 and 3 only (D) 2, 3 and 4 only

18. In a relational database model, NULL valuescan be used for all but which one of the follow-ing ?(A) To allow duplicate tuples in the table by

filling the primary key column(s) withNULL

(B) To avoid confusion with actual legitimatedata values like 0 (zero) for integer col-umns and (the empty string) for string col-umns

(C) To leave columns in a tuple marked as‘unknown’ when the actual value isunknown

(D) To fill a column in a tuple when that columndoes not really ‘exist’ for that particulartuple

UGC–NET Computer Science & Applications–II (J–16) | 3

22. Consider the following operations performedon a stack of size 5 :Push(a); Pop() ; Push(b); Push(c); Pop();Push(d); Pop(); Pop(); Push (e)Which of the following statements is correct ?(A) Underflow occurs(B) Stack operations are performed smoothly(C) Overflow occurs(D) None of the above

23. Suppose you are given a binary tree with nnodes, such that each node has exactly eitherzero or two children. The maximum height ofthe tree will be—

(A) – 12n

(B) +12n

(C)( – 1)

2

n(D)

( +1)

2

n

24. Which of the following is not an inherentapplication of stack ?(A) Implementation of recursion(B) Evaluation of a postfix expression(C) Job scheduling(D) Reverse a string

25. In how many ways can the stringA ∩ B – A ∩ B – A

be fully parenthesized to yield an infix expres-sion ?(A) 15 (B) 14(C) 13 (D) 12

26. A multiplexer combines four 100-Kbps chan-nels using a time slot of 2 bits. What is the bitrate ?(A) 100 Kbps(B) 200 Kbps(C) 400 Kbps(D) 1000 Kbps

27. In a fully-connected mesh network with 10computers, total .......... number of cables arerequired and ........... number of ports arerequired for each device.(A) 40, 9 (B) 45, 10(C) 45, 9 (D) 50, 10

19. Consider the following two commands C1 andC2 on the relation R from an SQL database :C1 : drop table R;C2 : delete from R;Which of the following statements is TRUE ?1. Both C1 and C2 delete the schema for R.2. C2 retains relation R, but deletes all tuples

in R.3. C1 deletes not only all tuples of R, but also

the schema for R.

(A) 1 only (B) 1 and 2 only(C) 2 and 3 only (D) 1, 2 and 3

20. Consider the following database table havingA, B, C and D as its four attributes and fourpossible candidate keys (I, II, III and IV) forthis table :

A B C D

a1 b1 c1 d1

a2 b3 c3 d1

a1 b2 c1 d2

I : {B} II : {B, C} III : {A, D} IV : {C, D}If different symbols stand for different valuesin the table (e.g., d1 is definitely not equal tod2), then which of the above could not be thecandidate key for the database table ?(A) I and III only(B) III and IV only(C) II only(D) I only

21. Consider the following binary search tree :

If we remove the root node, which of the nodefrom the left subtree will be the new root ?(A) 11 (B) 12(C) 13 (D) 16

UGC NET/JRF/SET Computer Scienceand Applications (Paper-II & III)

Publisher : Upkar Prakashan ISBN : 9788174825865Author : Chandresh Shah &Saurab Mishra

Type the URL : http://www.kopykitab.com/product/11272

Get this eBook

30%OFF