Back

BCA Solved Paper II Year (Rajasthan University) 2019-2016  (2021)  (English Medium)

Rs. 700.00 350.00/-
ADD TO CART
10  
COD NOT AVAILABLE

Author: Parth
Book Code: OBM/19/12/82940
Publisher: Parth Publishers
University: Rajasthan University (RU)
BCA Solved Paper II Year by Parth Publishers Jaipur

Product Details

BCA Solved Paper II Year

 

This Solved Papers is Written in English Language according to syllabus of Rajasthan University. 

 Question Paper pattern for Main University Examination Max. Marks: 100

Time: Three Hours Part - I (Very Short Answer) consists of 10 questions of two marks each with two questions from each unit.

Maximum limit for each question is upto 20 words.

Part - II (Short Answer) consists of 5 questions of four marks each with one question from each unit. Maximum limit for each question is upto 80 marks.

Part - III (Long Answer) consists of 5 questions of twelve marks each with one question from each unit with internal choice.

 

BCA205: Web Designing and Multimedia

 

UNIT-I

World Wide Web: Elements of the Web, Web browser and its types, viewing pages with a browser, using a browser for Mail, news and chat, security and privacy issues (cookies, firewalls, executable Applets and scripts, blocking system ), Plug-ins and Active controls, dealing with Web pages that contain Active X, playing streaming audio and video, playing MP music. Using Search engines, subscriptions and channels, making use of web resources (Portal, News and weather, Sports Personal Financing and Investing, Entertainment, shopping, Computers and Internet, Travel, Health and Medicine, Communities and Clubs).

UNIT-II

HTML Fundamentals: Intruduction of HTML, Creating HTML Pages, Incorporating Horizontal Rules and Graphical Elements, HyperOlinks, Creating HTML, Tables, Creating HTML Forms, HTML and Image Techniques, HTML and Page, Frames, Development of Website and Webpage (Planning Navigation and Themes, Elements of a Web Page, Steps of creating a site, publishing and publicizing site structuring web site.

UNIT-III

Introduction of DHTML: Features of DHTML, CSS: Type of Style sheets, Different elements of Style sheets, Filter effects, IFrame. DIV and Layer tags.

UNIT-IV

Java Script Fundamental: Introduction to Java Script Working with VAriables and Data Functions. Methods and Events, Controlling Programming Flow. The Java Script Object Model Java Script Language Objects, Developing Interactive Forms. Cookies and Java Script Security Controlling Frames in Java Script, Client-Side Java Script Custom, Java Script Objects. Introduction of JQuery and AJAX.

UNIT-V

Introduction of Photoshop Creating a New File: Main Selections, Picking color, Filling a selection with color, More ways to choose colors and fill selections, Painting with paintbrush tool, Using the magic wand tool and applying a filter, Saving your document (save your file: Save file as a JPEG, TIFF, GIF, PNG), Introduction and use of layers, Introduction and use of tool of Photo Shop. Coral draw:

Introduction to coral draw, use and importance in designing, various graphic file and file extension, vector image an raster images introduction to screen and work area. Introduction and use of tool of coral draw.

BCA203: Operating System

UNIT-I

Necessity of Operating system. Operating system terminology, Evolution of Operating System (multiprogramming systems, batch systems, timesharing system, process control and real-time system). Factors in OS Design (performance protection and security, correctness, maintainability application integration, probability and interoperability). Device Management: General device characteristics, I / O Programming concepts, device controllers, device drivers Interrupts Driven I / O Memory Mapped I / O, Direct Memory Access Buffering, Device Management Scenarios (serial communications, sequentially accessed storage devices, randomly accessed devices) .

UNIT-II

Process Management: Process Definition, Process Control, Initializing Operating System, Process Address Spaces Process Abstraction, Resource Abstraction and Process Hiearchy, Scheduling Mechanisms, Partitioning a process into small processes Non-preemptive strategies (first come-first served, shortest job next, priority scheduling deadline scheduling), Preemptive strategies (Round Robin, two queues, multiple level queues). Basic Synchronization principles: Interactive processes coordinating processes, semaphores, shared memory multiprocessors, AND synchronization, inter process communication, inter process messages, mulboxes. Deadlocks, Resource Status Modeling Handling deadlocks, deadlock detection and resolution deadlock avoidance.

UNIT-III

Memory Management: Requirements on the primary memory mapping the address space to primary memory, dynamic memory for data structures, memory allocation (fixed partition memory allocation strategy), Dynamic Address Relocation, Memory Manager Strategies (Swapping Virtual Memory, Shared Memory Multiprocessors). Virtual Memory: Address translation paging, static and dynamic paging algorithms.

UNIT-IV

Information Management: Files (low level files, structured files. Database management systems, multimedia storage). Low level file implementation. Storage Abstraction (Structure sequential files, indexed sequential files, database management systems, multimedia documents), memory mapped files, directories, directory implementation, file sharing information across network remote Viruses and Worms, Security Design principles, Authentications, Protection mechanisms, encryption, Protection of User Files.

UNIT-V

Distributed Computing: Distributed process management, message passing, remote procedure call, distributed memory management, security in distributed environment, Introduction of Parallel Processing. Protection an Security goals, Domain of Protections, Security Problems, Authentication, System threats, Encryptions, Introduction of different Operating system (Linux, Unix, Windows Server)

Discrete Mathematics

UNIT-I

Number Systems: Number Systems- natural numbers, integers, rational numbers, real numbers, complex numbers, arithmetic modulo a positive integer. Radix r represntation (decimal and binary), Change of radix (decimal to binary and vice versa). Binomial theorem and Mathematical Induction Binomial theorem for positive integral indices, general and middle term in binomial expansion with simple applications. Some simple problems of Principle of Mathematical induction.

Recurrence Relations and Generating Functions: Recurrence relation, linear recurrence relation with constant coefficients, solution of linear recurrence relation with constant coefficients. Generating functions, solution of recurrence relations using generating functions.

UNIT-II

Sets: Definition of sets, representation of sets, type of sets, Operations on sets, Sub sets, Power set, Universal set, Complement of a set, Union and Intersection of two sets, Venn diagrams, De-Morgans law of sets, Parition of sets, Duality Principles.

Relations: Relation, Types of relations reflexive, symmetric, antisymmetric, transitive equivalence and partial order relation and diagraphs, Cartesian product of two sets. Functions: Function, domain and range, One to One and Onto functions, composite functions, inverse of a functions. Binary operations.

UNIT-III.

Logic and Proofs: Proposition, Conjunction, Disijunction, Negation, Compound proposition, Conditional propositions (Hypothesis, conclusion, necessary and sufficient condition) and Logical equivalence, De Morgan's law, Tautology and contradiction, quantifiers, universally quantified statements, component of a Mathematical system (axiom, definitions, undefined terms, theorem, lema and corollary), proofs (direct induction. proofs, indirect proofs, proof by contra-positive), Mathematical Boolean Algebra: Definition and Laws of Boolean Algebra, Bookan functions, simplification of Boolean functions , Special forms of Boolean functions, Application of Boolean algebra (open and c'osed switches, switches in series and parallel). Logic gates and Circuits.

UNIT-IV

Graph: Basic terminology, directed and undirected graphs, path and connectivity, types of graphs- Null, Regular, Complementary, Complete, Weighted and Bipartite Subgraphs, Operation on Graphs- union intersection, complement, product and composition. Representation of graphs in computer memory (matrix representation) - Adjacency matrix, Incidence matrix. Fusion of graphs. Isomorphic and Homeomorphic graphs, paths and cycles, Eulerian and Hamiltonian graphs, shortes path algorithm. Planar graphs, graph coloring. S Shortest path algorithms. Traveling salesman problem.

UNIT-V

Tree: Definition of tree, Fundamental terminologies-Node, Child Parent, Root, Leaf, Level, Height and Subling. Rooted trees, Binar tree, Complete binary tree, Tree of an algebraic expression, Tre searching (traversal algorithms). Preorder, Inorder and Postorde Distance and Center, Relation between general tree and binary treanning trees, algorithms for minimal spanning trees (Kruskal’s an Prim's). Game tree.

 

SYLLABUS

Note- Students are advice to match this syllabus and pattern with the syllabus available at university website.

Question Paper pattern for Main University Examination Max. Marks: 100

Time: Three Hours Part - I (Very Short Answer) consists of 10 questions of two marks each with two questions from each unit. Maximum limit for each question is up to 20 words. "Part - II (Short Answer) consists of 5 questions of four 'marks each with one question from each unit. Maximum limit for each question is up to 80 marks. Part - II (Long Answer) consists of 5 questions of twelve marks each with one question from each unit with internal choice.

BCA201: Business Accounting

UNIT-I

Basics of Book-keeping and Accounting: Financial Accounting: Definition, Scope and Objective of Financial Accounting. Users of accounting information, Limitations of Financial Accounting. Financial Accounting Principles, Concepts and Conventions.

UNIT-II.

System of Book-keeping: Accounting Process, Double Entry System, Books of Prime Entry, Subsidiary Books, Recording of Cash and Bank Transactions.

UNIT-III

Ledger Accounts: Preparation of Ledger Accounts, Bank Reconciliation Statements, Preparation of Trial Balance. Depreciation Accounting: Meaning, Need and Importance of depreciation, Straight Line and Diminishing Balance method, computation and Accounting Statement of Depreciation, change in Depreciation method. Provisions & Reserves, Rectification of Errors.

UNIT-IV

Final Accounts: Opening and Closing Entries, Trading, Profit and Loss Accounts and Balance Sheet.

UNIT-V

Final Accounts with Adjustments: Adjustments of Dividends, Drawings, Outstanding Incomes and Expenses, Depreciation. Tax Liabilities, Insurance Claims for Loss of Stock and Loss of Profit.

 

Syllabus

Note: Students are advice to match this syllabus and pattern with the syllabus available at university website.

Question Paper pattern for Main University Examination Max. Marks: 100

Time: Three Hours Part - I (Very Short Answer) consists of 10 questions of two marks each with two questions from each unit. Maximum limit for each question is upto 20 words. Part - II (Short Answer) consists of 5 questions of four marks each with one question from each unit. Maximum limit for each question is upto 80 marks. Part - II (Long Answer) consists of 5 questions of twelve marks each with one question from each unit with internal choice.

BCA204: Data base management system

UNIT-I

DAtabase System Concepts & Agriculture: Overview of DBMS, Basic DBMS terminology, database system v / s file system, Advantages and disadvantages of DBMS, Codd rules, data independence. Architecture of a DBMS, Schemas, Instances, Database Languages, Database Administrator, Data Models.

UNIT-II

Data Modeling: Data modeling using the entity relationship model; ER Model concepts, notation for ER diagram, mapping constraints, keys, concepts of super key, candidate key, primary key, generalization, aggregation. Relation algebra: Fundamental operations of relational algebra & their implementation, interdependence of operations.

UNIT-III

Database Design: Functional dependencies, loss less decomposition. Ist, 2nd, 3rd normal forms, dependency preservation, boyce codd NF, Introduction to Transaction, transaction states.

Security: Access control, Backup, REcovery. Maintenanc performance.

UNIT-IV

Introduction of SQL: Characteristics of SQL, Advantages of SOL SQL data types and literals, Types of SQL commands, SQL operators and their procedure, Tables, views and indexes, Queries and sub queries, Aggregate functions, insert, update and delete operations Joins Unions , Intersection, Minus in SQL,

UNIT-V

 Introduction ot Advance DBMS: Object-based Databases: Object Oriented Databases: Object oriented data model, Object oriented languages, Persistent Programming languages. Object Relational Databases: Nested Relations, Storage for Object Databases. Distributed Databases: Distributed Data Storage, Distributed Transactions, commit protocol, concurrency control in distributed databases, Availability, Distributed Query Processing.

 

Syllabus

Note: Students are advice to match this syllabus and pattern with the syllabus available at university website.

Question Paper pattern for Main University Examination Max. Marks: 100

Time: Three Hours Part - I (Very Short Answer) consists of 10 questions of two marks each with two questions from each unit. Maximum limit for each question is upto 20 words. Part - II (Short Answer) consists of 5 questions of four marks each with one question from each unit. Maximum limit for each question is upto 80 marks. Part - II (Long Answer) consists of 5 questions of twelve marks each with one question from each unit with internal choice.

BCA205: Object Oriented Programming

Concepts

UNIT-I

Introduction ot Object Oriented Concepts: Evolution of OOP, OOP Paradigm, advantages of OOP, comparison between functional programming and OOP approach, characteristics of object oriented language- objects, classes, inheritance, reusability, user defined data types, polymorphism, overloading.

UNIT-II

Introduction to CH: CH tokens, data types, CH operators, type conversion, variable declaration, arrays, statements, expressions, conditional statements, jumping statements, loops, functions, pointers, structures.

UNIT-III

Classes and Objects: Classes, objects, defining member functions, arrays of class objects, pointers and classes, passing objects, constructiors, type of constructors, destructors, this pointer, access specifiers, friend functions, inline functions.

UNIT-IV

Inheritance: Intruduction, Importance of Inheritance, types of inheritance, Constructor and Destructor in derived classes.

Polymorphism: Function overloading, operator overloading, virtual functions, pure pirtual functions.

 UNIT-V

File Management: Handling Data files (sequential and random). Opening and closing of files, stream state member functions Operations on files, Templates, Execution Handling.

 

 

 

Its also useful for Shekhawati,Matsya, Brij, JNU, MGSU,MDS,Kota,MLSU University Students. 

If you don't found your book
Click here