STUDY AND EVALUATION SCHEME BACHELOR OF COMPUTER APPLICATION UNIVERSITY OF LUCKNOW, LUCKNOW. YEAR: FIRST, RAI r Evaluation Scheme Su. | Paper Code Subject Sessional | Exam, | Sub | Credit No. CT | TA | Total | ESE | Total 1 | BCA-201 | Matbemates-T 2 [10 [30 [70 | 100 [a 2 | BCA202 | Advanced Profesional [¥ [0 [O 20 | v0 [30 ]70 100 3 Communication 3. /RCA20S ial Electronics and 3) T [0 [20 [10 [30 [7 |T00 a Computer Organization | BCA204 | Dat Structure using C T fo [30 [10 [30 [70 [100 [a | BCA205 | Accounting and 0 [0 [30 [1 [30 [7 1003 : Financial Management ad : _ PRACTICALS, © [BCA-206P | Advanced Profesional | 0 [0 ]2 [10 [10 [20 [30 [30 |i Communication Lab 7 |BCA207 | DataStuctuetad | o [oO |3|10 |10 |20 |30 30/2 [| BCA-R0aP | Digial Hiccvonies and |O [0 |2 [10 [10 [30 [30 [30 )1 | Computer Organization Lab, 9 [BCA-GP | General Prafiensy —[=— [=| [== == fe Total B/S 00 [22 Abbreviations: CT: Class Test PA: Teacher's Assessment ESE: End Semester Examination@ BC MATHEMA, i 310 UNIT - I: MULTIPLE INTEGRALS a Double and triple integrals, Change of order of integration, Change of variables, Application of integration to Lengths, Surface areas and Volumes- Cartesian and Polar coordinates. UNIT -I: ORDINARY DIFFERENTIAL EQUATIONS 2 Definition and examples, Order and Degree of differential equations, Solutions of first order first degree differential equations, Variable Separable, Equations reducible to variable separable, Linear differential equations, Bemoulli’s Differential equations, Linear differential equations of 1 onder with ‘constant coefficients, Complementary function and particular integral. UNIT - Il: PARTIAL DIFFERENTIAL EQUATIONS 0 Origin of first order partial differential equations, Partial differential equations of the first onder and degree one, Lagrange's solution, Partial differential equation of first order and degree greater than one. Charpit's method of solution. Solution of second order linear partial differential equations ‘with constant coefficients, 5 UNIT - IV: STATISTICS & PROBABILITY i 10 Moments, Moment generating functions, Skewness, Kurtosis, Correlation and Regression analysis, Binomial, Poisson and Normal distributions, Test of signi ‘Text Books: |. BLS. Grewal, Higher Engineering Mathematics, Khanna Publishers. 2. E. Kreyszig, Advanced Engineering Mathematics, John Wiley & Sons, 3. J.N-Kapur, Mathematical Statisties, 8. Chand & company Ltd, 2000, Reference Books: 1. N.P.Bali and Dr. Manish Goyal, Engineering Mathematics University Science Press, Laxmi Publications, Pvt. Ltd. 2. V. Ramana, Higher Engineering Mathematies, Tata Me Graw- Hill Publishing Company Ld. 3. M.D. Raisinghania, Advanced Differential Equations, S. Chand & Company Lid. 4. M.Renardy and R.C.Rogers, An introduction to Partial Differential Equations, New York, Springer 5. C.B.Gupta, Vijay Gupta, Introduction to Statistical Methods, Vikas Publishing. 6. Devore, Probability and Statisties, Thomson (Cengage) Learning, 2007.® BCA.202 ADVANCED PROFESSIONAL COMMUNICATION TP 0 u 0) ‘Communication for Employment: Difference between Resume, CV and Biodata, Types of Resume, Preparing a professional Resume, Offline job application, Online job application, Cover Letter for job application, Application on online job portals (Naukri.com, Angellist, Indeed.com ete), Use of social ‘media for job application (LinkedIn, Facebook), Unit-tl (as) jeed Grammar: Phrase, Clause, Verb Phrase, Complex Sentences, Coordination, Focus, Phrasal (10) iquettes: Netiquettes; the art of Negotiation: ‘Types, Characteristics, and Methods; Leadership: Leadership as a process, Leadership Attributes (Personality types and traits for Leadership, Intelligence and Emotional Intelligence in Leadership), Skills for building strong leadership (Credibility, Communication, Listening with understanding, Assertiveness, Effective stress management, Problem solving, Decision making and Improving’ Creativity); Personality assessment and Grooming; Presentation Strategies. Unity (08) Improving Language through Literature: ‘Of Studies" by Francis Bacon; “Obituary” by Ramanyjam; “Australia” by A D Hope ‘Text Books: |. Bakshi, RN. (2000) A Course in English Grammar. Orient Longman, Hyderabad, 2. Mishra, Binod etal (2015, 6th reprint) Communication Skills for Engineers and Scientists. PHI, New Delhi. Reference Books: |. Effective Technical Communication by Barun K. Mitra, Oxford Univ. Press, 2006, New Delhi Business Correspondence and Report Writing by Prof. R.C, Sharma & Krishna Mohan, Tata MeGraw Hill & Co. Lid, New Delhi Leadership by , |. Hughes, R. C. Ginnett and G. J. Curphy (MeGrow Hil, 8e) "Negotiation by Himanshu Rai (MeGrow Hill)DIGITAL ELECTRONICS AND COMPUTER ORGANIZATION sro Unit (08) Basics of Digital Electronics: Character Codes (BCD, ASCII, EBCDIC) and its arithmetic, Signed numbers, Cyclic codes, error detecting code, Introduction 10 logic gates. Gate-level i Boolean algebra: definition, axioms, basie theorems, and properties, Boolean functions, Canonical and standard forms, NAND and NOR implementation, K- map method up to five variable, don’t care conditions. Unit (10) Combinational Logie: Combinational circuits, analysis and design procedures, binary adder- subtractor, Introduetion to decoders, encoders, multiplexers, De-multiplexers. Sequential logie: Sequential cireuits, Latches, flip flops, analysis of clocked sequential circuits. Registers and Counters Shift registers, Ripple counters. Synchronous and Asynchronous Cireuits: Analysis of clocked sequential circuits, State reduction & assignments, Design procedure. Analysis procedure of Asynchronous sequential circuits, circuit with latches, design procedure, Unit (10) Basics of Computer Organization: Functional units of digital computer and their interconnections, buses. Register, bus and memory transfer. Processor organization, general register organization, stack organization and addressing modes. Arithmetic and logic unit: Fixed and floating point representation, IEBE standard for floating point representation, Signed Adder, Subtracter circuits Multiplication: Signed operand multiplication, Booth’s algorithm. Division and logic operations. Arithmetic & logic unit design. Unit-1V (12) Control Unit: Instruction types, formats, instruction cycles and sub-eycles, micro-operations, execution of a complete instruction. Introduction to mieroprogrammed control organization. Memory: Basic concept and hierarchy, semiconductor RAM memories. ROM memories. Cache memories: concept, design issues. Input / Output: Peripheral devices, V/O interlace, VO ports, Interrupts: Types of interrupts and exceptions. Modes of Data Transfer: Programmed V/O, interrupt initiated 1/0 and Direct Memory Access. ‘Text Books: 1. Computer System Architecture, M. Mano (PH) 2. Computer Organization, W. Stallings (PHI) Reference Books: ‘Computer Organization, Vravice, Zaky & Hamacher (TMH Publication) 1 2. Structured Computer Organization, Tannenbaum (PH) 3. Computer Organization, Jobn P.Hayes (McGraw Hill) 4. Digital Logic and Computer Design, M. Mortis Mano, (Pearson Education India) 5. Digital Circuit and Design, DP Kothari and JS Dhillon, (Pearson Education) : 6. Computer Organization and Design, P Pal Chaudhary, (PHD) , 4BCA-204 DATA STRUCTURES USING C LTP 310 Unitt (10) Introduction: Basie Terminology, Elementary Data Organization, Built in Data Types, Abstract Data Types. Limked lists: Representation and Implementation of Singly Linked List using Array, and Pointer, Doubly Linked List, Operations on a Linked List: Insertion, Deletion, And Traversal Unit (10) Stacks: Array and Linked List Implementation of Stack, Basic operations: Push & Pop; Application of stack: Prefix’ and Postfix Expressions, Evaluation of postiix expression, Reeursion- Principles and types of recursion; example of recursion: Fibonacci series, and Tower of Hanoi Problem. Queues: ‘Array and linked list implementation of queues, Basic operations: Create, Add, Delete, Unit-tth (12) Trees: Basic terminology, Binary Trees, Binary Tree Representation: Array and Linked List Representation, Strictly Binary Trees, Complete Binary Trees, Extended Binaty Trees, Tree Traversal algorithms. Binary Search ‘Trees: Insertion, Deletion and Searching. Concept & Basie Operations on AVL Tree. Searching, Hashing and Sorting: Binary Search, Concept of Hashing & Collision resolution Techniques, Insertion Sort, Selection Sort, Bubble Sort, Quick Sort. unity (08) Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Minimum Cost Spanning Trees. Graph ‘Traversal: Depth First Search and Breadth First Search, Minimum Cost Spanning Trees: Prims and Kruskal algorithm, ‘Text Books |. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J, Augenstein “Data Structures Using C and C++" , PHL 2. R Kruse etal, “Data Structures and Program Design in C”, Pearson Education 3. ‘Thateja, “Data Structure Using C” Oxford Higher Education, Reference Books ipschutz, “Data Structures" Schaum's Outline Series, TMH. 2. Jean Paul Trembley and Paul G. Sorenson, “An Introduction to Data Structures with applications”, McGraw Hill 3. Horowitz and Sahani ‘Fundamentals of Data Structures”, jalgotia PublicationBCA208 ACCOUNTING AND FINANCIAL MANAGEMENT. es oe Unit (10) Overview: Meaning, objectives, Accounting Principles-coneepts and conventions, Branches of Accounting, Accounting Cyele, Debit and Credit, Types of Account, Book-keeping, Source Document, Accounting Equation, Users of Accounting Information, Accounting Standards in India, Matching of Indian Accounting Standards with International Accounting Standards, Capital and Revenue items. Uni (ao) Basies of Accounting: System of Accounting, Double Entry System, Introduction to Journal, Joumalizing the transactions, Ledger and Posting, Trial Balance: Meaning, Methods and Error not disclosed by Trial Balance, Preparation of Final Accounts: Trading, Profit and Loss Account and Balance Sheet with simple adjustment entries. Unit (0) Financial Statement Analysis: Meaning, Objectives, Types and Methods. Ratio Analysis: Profitability Ratio, Activity Ratio, Liquidity Ratio and Solvency Ratio. Fund Flow Statement: Meaning, Objective, Concept of Gross and Net Working Capital. Cash Flow Statement: Meaning, Objectives, Various Cash and Non-Cash Transactions, Application of Computer in Accounting, (10) Nature, Approaches to Financial Management, 's: Profit Maximization and Wealth Maximization, Financial Decisions: Financing, Investment idend Decisions, Liquidity Vs Profitability, Time Value of Money, Valuation Concept: Compounding and Discounting Principles, Sources of Finance: Short term and Long term. inancial Management: Mea ‘Text Books: |. Narayanswami- Financial Accounting: A Managerial Prespective, PHI 2. Tulsian- Financial Accounting, Pearson 3. Ravi M Kishore- Financial Management, Taxmann Reference Books: “Mukherjee- Financial Accounting for Management, TMH. Khan and Jain- Financial Management, Tata McGraw Hill Ghosh T P — Accounting and Finance for Managers, Taxman Ramehandran & Kakani-Financial Accounting for Management, TMH. Ashish K. Bhattacharya- Essentials of Financial Accounting, PHL ‘Chowdhary Anil - Fundamentals of Accounting and Financial Analysis, Pearson Education 6BCA-206P ADVANCED PROFESSIONAL COMMUNICATION LAB LIST OF PRACTICALS ‘Technical GD-1 Technical GD— I Body Language at Workplace Paper presentation techniques for Workshop and Seminars Personality Test Technical Presentation ~ 1 echnical Presentation ~ It Preparations for Personal Interview Reference Books: 1. Pronouncing Dietionary by Daniel Jones 2. A Textbook of English Phonetics for Indian Students by T, Balasubramanian,BCA-207P DATA STRUCTURE LAB Write Program in C for the following: Arrays To implement addition of wo 2D arrays. », To implement multiplication of two 2D arrays, 2. To implement Singly Linked List Stack a. To implement stack using array. b. ‘To implement stack using linked list, 4. Queue ‘a, To implement queue using array. b. To implement queue using linked lis. 5. To implement binary tree using linked list 6. To implement binary search tree using linked list. 7. To implement tree traversals using linked list 8. Graph Traversal a. To implement BFS using linked list b. To implement DFS using linked list. 9. To implement Binary Seareh. 10. To implement Bubble Sorting. 11. To implement Selection Sorting. 12, To implement Insertion Sorting. \ edBCA.208P TAL ELECTRONICS AND COMPUTER ORGANIZATION L. Note: Minimum ten experiments are to be performed from the following list. 1. Nomenclature of digital ICs, specifications, study of the data sheet, Concept of Vee and ground, Verification ofthe truth tables of logic gates using TTL ICs. Realization of basie gates using Universal logic gates Implementation of the given Boolean function using logic gates in both SOP and POS forms. Verification of state tables of RS, JK, Tand D flip-flops using NAND & NOR gates. Decoder/Encoder a, Implementation and verification of Decoder using logic gates. 'b, Implementation and verification of Encoder using logic gates, 6, Implementing HALF ADDER, FULL ADDER using basic logic gates. Multiplexer/ Demultiplexer 4. Implementation of 4:1 multiplexer using logic gates. '. Implementation of 1:4 demultiplexer using logic gates. 8. Implementation of 4-bit parallel adder using 7483 IC. 9. Universal Shift Register ‘a, Realization of Universal Shift Register using JK flip-flops & logic gates. b. Realization of Universal Shift Register using multiplexer & flip-flops. 10, Counters a. Design, and verify the 4-bit synchronous counter. b. Design, and verify the 4-bit asynchronous counter. 1, Design ofan 8-bit ARITHMETIC LOGIC UNIT. 12, Design the data path ofa computer from its register transfer language description.