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.

Computer Science & ApplicationsUGC-NET/JRF Exam.

(Jan. 2017)Solved Paper

(Held on 22 January, 2017)

Computer Science & Applications(Paper–II)

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

1. Consider a sequence F00 defined as—

F00 (0) = 1, F00 (1) = 1

F00 (n) =10 * F00 (n – 1) + 100

F00 (n – 2) for n ≥ 2

Then what shall be the set of values of thesequence F00 ?

(A) (1, 110, 1200)(B) (1, 110, 600, 1200)(C) (1, 2, 55, 110, 600, 1200)(D) (1, 55, 110, 600, 1200)

2. Match the following—List–I(a) Absurd (b) Ambiguous(c) Axiom (d) ConjectureList–II1. Clearly impossible being contrary to

some evident truth.2. Capable of more than one interpretation

or meaning.3. An assertion that is accepted and used

without a proof.4. An opinion preferably based on some

experience or wisdom.

Codes :(a) (b) (c) (d)

(A) 1 2 3 4(B) 1 3 4 2(C) 2 3 4 1(D) 2 1 3 4

3. The functions mapping R into R are definedas—

f(x) = x3 – 4x, g(x) = 1

x2 + 1 and h(x) = x4

Then find the value of the followingcomposite functions—hog(x) and hogof(x)(A) (x2 + 1)4 and [(x3 – 4x)2 + 1]4

(B) (x2 + 1)4 and [(x3 – 4x)2 + 1]– 4

(C) (x2 + 1)– 4 and [(x2 – 4x)2 + 1]4

(D) (x2 + 1)– 4 and [(x3 – 4x)2 + 1]– 4

4. How many multiples of 6 are there betweenthe following pairs of numbers ?0 and 100 and – 6 and 34(A) 16 and 6 (B) 17 and 6(C) 17 and 7 (D) 16 and 7

5. Consider a Hamiltonian Graph G with noloops or parallel edges and with ⏐V(G)⏐ =n ≥ 3. Then which of the following is true ?

(A) deg(ν) ≥ n2 for each vertex v

(B) ⏐E(G)⏐ ≥ 12 (n – 1) (n – 2) + 2

(C) deg (ν) + deg(w) ≥ n whenever ν and ware not connected by an edge

(D) All of the above

6. In propositional logic if (P → Q) ∧ (R → S)and (P ∨ R) are two premises such that

(P → Q) ∧ (R → S)P ∨ R

⎯⎯⎯⎯⎯⎯⎯⎯Y

⎯⎯⎯⎯⎯⎯⎯⎯Y is the premise—(A) P ∨ R (B) P ∨ S(C) Q ∨ R (D) Q ∨ S

7. ECL is the fastest of all logic families. Highspeed in ECL is possible because transistorsare used in difference amplifier configuration,in which they are never driven into………….

Computer Science–II (UGC) Jan. 2017 | 3

(A) Race condition (B) Saturation(C) Delay (D) High impedance

8. A binary 3–bit down counter uses J–K flip–flops, FFi with inputs Ji, Ki and outputs Qi,i = 0, 1, 2 respectively. The minimizedexpression for the input from following, is—

1. J0 = K0 = 0 2. J0 = K0 = 1

3. J1 = K1 = Q0 4. J1 = K1 = –Q0

5. J2 = K2 = Q1Q0 6. J2 = K2 = –Q1

–Q0

(A) 1, 3, 5 (B) 1, 4, 6(C) 2, 3, 5 (D) 2, 4, 6

9. Convert the octal number 0·4051 into itsequivalent decimal number.

(A) 0·5100098 (B) 0·2096(C) 0·52 (D) 0·4192

10. The hexadecimal equivalent of the octalnumber 2357 is—

(A) 2EE (B) 2FF(C) 4EF (D) 4FE

11. Which of the following cannot be passed to afunction in C++ ?

(A) Constant (B) Structure(C) Array (D) Header file

12. Which one of the following is correct foroverloaded functions in C++ ?

(A) Compiler sets up a separate function forevery definition of function.

(B) Compiler dose not set up a separatefunction for every definition of function.

(C) Overloaded functions cannot handledifferent types of objects.

(D) Overloaded functions cannot have samenumber of arguments.

13. Which of the following storage classes haveglobal visibility in C/C++ ?(A) Auto (B) Extern(C) Static (D) Register

14. Which of the following operators cannot beoverloaded in C/C++ ?(A) Bitwise right shift assignment(B) Address of(C) Indirection(D) Structure reference

15. If X is a binary number which is power of 2,then the value of X & (X – 1) is—(A) 11……11 (B) 00……00(C) 100……0 (D) 000……1

16. An attribute A of datatype varchar (20) hasvalue ‘Ram’ and the attribute B of datatypechar (20) has value ‘Sita’ in oracle. Theattribute A has …………memory spaces andB has…………memory spaces.(A) 20, 20 (B) 3, 20(C) 3, 4 (D) 20, 4

17. Integrity constraints ensure that changes madeto the database by authorized users do notresult into loss of data consistency. Which ofthe following statement(s) is (are) true w.r.t.the examples of integrity constraints ?1. An instructor Id. No. cannot be null,

provided Instructor Id No. being primarykey.

2. No two citizens have same Adhar-Id.3. Budget of a company must be zero.(A) 1, 2 and 3 are true(B) 1 false, 2 and 3 are true(C) 1 and 2 are true; 3 false(D) 1, 2 and 3 are false

18. Let M and N be two entities in an E-Rdiagram with simple single value attributes.R1 and R2 are two relationship between Mand N, whereasR2 are two relationship between M and N,

whereasR1 is one-to-many and R2 is many-to-many.

The minimum number of tables required torepresent M, N, R1 and R2 in the relationalmodel are…………(A) 4 (B) 6(C) 7 (D) 3

19. Consider a schema R(MNPQ) and functionaldependencies M → N, P → Q. Then thedecomposition of R into R1 (MN) and R2(PQ)is ………….(A) Dependency preserving but not lossless

join(B) Dependency preserving and lossless join(C) Lossless join but not dependency

preserving(D) Neither dependency preserving nor

lossless join

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

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

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

Get this eBook

30%OFF