Data Communication and Networks bca chaloexam

Bangalore Central University BCA 5th sem Study Materials and Previous Year Question Paper

Book Free Classes

Bangalore Central University 5th Sem BCA Study Materials

Download free BCA 5th sem module wise notes, latest solved question papers, previous 5 years question paper till 2021, model question papers, easy notes, exam oriented notes are available on this website chaloexam.com of Bangalore Central University

Bangalore Central University BCA syllabus 2020

Syllabus

Syllabus

FIFTH SEMESTER BCA 

BCA501T: DATA COMMUNICATIONS AND NETWORKS 

Total Teaching Hours : 60 No of Hours / Week : 04 

Unit – I  

Introduction: Communication Network and services, Approaches to Network Design,  Network Functions and Network Topology, Message ,packet and circuit Switching ,  Internet, Packet Switching ; Key factors in Communication Network Evolution ;  Layered Architecture and Applications – Examples of Layering , OSI Reference Model,  TCP/IP Model Telnet FTP and IP Utilities. Digital Transmission: Digital Representation  of Information: Properties of digital transmission: Characterization of Communication  Channels Frequency Domain and Time Domain : Fundamental limits in Digital  Communication – The Nyquist Signalling rate, The Shannon channel capacity : Line  coding , Modems & digital Modulations  

[ 12 Hours ] 

Unit - II 

Transmission Systems: properties of media and digital transmission Systems – Twisted  Pair , Coaxial Cable, Optical Fibre, Radio Transmission Intrared Light Error detection  and correction – Error detection , Two – dimensional parity checks , Internet checksum ,  Polynomial code; standardized Polynomial codes , Error detecting capability of a  polynomial code, Multiplexing – frequency – Division , Time – Division , SONET; Wavelength Division Multiplexing Circuit switches; Telephone network , signalling 

Traffic and Overload control in Telephone networks – Concentration, Routing Control, Overload controls Cellular Telephone Networks, Satellite Cellular networks.  [ 12 Hours ] 

Unit – III 

Peer –to-Peer Protocols:- Peer-to peer Protocols and service models ARQ Protocols stop  and wait , Go –back-N Selective Repeat , Transmission efficiency of ARQ Protocols,  Other adaptation functions , - Sliding window flow control Timing Recovery in  Synchronous Services Reliable Stream Service, Data Link Control, HDLC, PPP ;  Statistical Multiplexing. 

[ 12 Hours ] 

Unit - IV 

Local Area Networks and Medium access Control Protocols:- Multiple access  communications; Local Area network – LAN Structure, MAC Sublayer, Logical link  control layer, Random Access protocols ALOHA , Slotted ALOHA, CSMA, CSMA/CD,  Scheduling approaches to medium access control – Reservation Systems, polling , Token  passing rings, comparison of Random access & Scheduling access control Comparison of  Radom access & SHEDULING MEDIUM access controls; Channelization – FDMA,  TDMA, CDMA; 

[ 12 Hours ] 

Unit - V 

LAN Standard –Ethernet and IEF, 802.3 LAN Standard ; Token Ring and IEEE 8025  LAN standard , FDDI, Wireless LAN’s and IEEE 802.11 Standards; LAN Bridges – Transparent Bridges , Source Routing Bridges , Mixed – media Bridges. Packet  Switching Networks :- Network services & Internal Network Operation; Packet Network  Topology; Datagrams & VIRTUAL circuits ; structure of switch/ Router, Connectionless  packet switching ; Virtual – Circuit packet switching ; Overview of Routing and  congestion in packet networks – Routing algorithms classification , Routing tables, 

Page 26 of 38 

shortest path routing algorithms, Flooding , Hierarchical routing , Distance vector routing  Link state routing , congestion control algorithms. [ 12 Hours ] 

Text Books:  

  1. Stallings, “Data and Computer Communications”, 7th Edition,Pearson Education, 2012 Reference Books: 

  2. Andrew S Tanenbaim, “Computer Networks”, 4th Edition, Pearson Education. 2. Behrouz Ferouzan, Introduction to Data Communication & Networking TMH, 1999. 3. Larry &Peterson & Bruce S Davis; Computer networks Second Edition , Morgan   Kaufman, 2000. 

BCA502T : SOFTWARE ENGINEERING 

Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I 

Introduction: Software Products and Software process, Process models: Waterfall modal, Evolutionary Development, Bohemia’s Spiral model, Overview of risk management,  Process Visibility, Professional responsibility. Computer based System Engineering:  Systems and their environment, System Procurement, System Engineering Process,  System architecture modelling. Human Factors, System reliability Engineering. Requirements and Specification: The requirement Engineering Process, The Software  requirement document, Validation of Evolution of requirements, Viewpoint – oriented &  method based analysis , system contexts , Social 7 organizational factors . Data flow ,  

Semantic, Objects, models , Requirement Specification, Non functional requirement. [ 12 Hours ] 

Unit - II 

Software Prototyping: Prototyping in software process, Prototyping techniques, User  interface prototyping. Software Design: Design Process, Design Strategies, Design  Quality , System Structuring control models, Modular decomposition , Domain Specific  architecture. 

[ 12 Hours ] 

Unit - III  

Object Oriented& function oriented design: Objects, object Classes and inheritance  Object identification, An object oriented design example, Concurrent Objects, Data flow  design Structural decomposition, Detailed Design, A Comparison of design Strategies. User interface design: Design Principles, User System interaction, Information  Presentation, User Guidance, Interface Evaluation. 

[ 12 Hours ] 

Unit - IV 

Software Reliability and reusability : Software reliability metrics , Software reliability  Specification , Statistical testing ,Reliability Growth modeling, Fault avoidance &  tolerance, Exception handling & defensive programming , Software development with  reuse, Software’ development for reuse , Generator based reuse, Application System  Portability. 

[ 12 Hours ] 

Unit - V 

Software Verification and Validation : The testing Process , Test Planning & Strategies,  Black Box , Structural, interface testing , Program inspections , Mathematically based  verification, Static analysis tools, Clean room software development. Management  Issues: Project management, Quality management, Software cost estimation, Software  maintenance. [ 12 Hours ]

Page 27 of 38 

Text book 

  1. Ian Sommerville – Software Engineering, 9th Edition, Pearson Education Ltd,  2010. 

Reference Books 

  1. Roger S. Pressman – Software Engineering, A Practitioner’s approach, 7th Edition, McGRAW-HILL Publication, 2010. 

  2. Pankaj Jalote, “An integrated approach to Software Engineering”, 3rd Edition,  Narosa Publishing House, 2013. 

BCA503T: COMPUTER ARCHITECTURE 

Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I 

DIGITAL LOGIC CIRCUITS: Logic gates Boolean algebra, map simplification,  combinational circuits, flip-flop, sequential circuits. INTEGRATED CIRCUITS AND  DIGITAL FUNCTIONS: Digital integrated circuits, IC flip –flops and registers,  decoders and multiplexers, binary counters, shift registers, random –access memories  (RAM) read –only memories (ROM). 

[ 12 Hours ] 

Unit - II 

DATA REPRESENTATION: Data types, fixed-point representation, floating – point  representation, other binary codes, error detection codes. 

DATA TRANSFER OPERATIONS: Register Transfer, Memory Transfer and I/O  Transfer. 

 [ 12 Hours ] Unit – III 

BASIC COMPUTER ORGANISATION AND DESIGN: Instruction codes, computer  instruction, timing and control, execution and instruction, input-output and interrupt,  design of computer. 

 [ 12 Hours ] Unit - IV 

CENTRAL PROCESSOR ORGANIZATION : Processor bus organization, arithmetic  logic unit (ALU) instruction formats, addressing modes, data transfer and manipulation ,  program control, microprocessor organization. 

[ 12 Hours ] 

Unit – V  

INPUT-OUTPUT ORGANISATION: Peripheral devices . asynchronous data transfer ,  direct memory access (DMA) ,priority interrupt, input –output processor (IOP). MEMORY ORGANIZATION : Auxiliary memory, microcomputer memory hierarchy ,  associative memory , virtual memory, cache memory. 

[ 12 Hours ] 

Text Books 

  1. M.Moris Mano , Computer System, Architecture, 2nd Edition Prentice Hall of  India. 

References 

  1. Heuring and Jordan, Computer systems design and Architecture , Peason Edition 2. William Stallings , Computer Organisation and Archotecture, Peason Education 3. Floyed , Digital Fundamentals,8th Edition , Peason Education. 

  2. Andrew S. Temenbauam, Structured Computer Organization , 3rd Edition ;  Prentice Hall of India. 

  3. David Patterson & Hennessy , Computer Organization & Design , Elsevier.

Page 28 of 38 

BCA504T: OBJECT ORIENTED PROGRAMMING USING JAVA Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I 

Introduction to JAVA: JAVA Evolution: Java History, Java Features, How Java Differs  from C and C++, Java and Internet, Java and World Wide Web, Web Browsers,  Hardware and Software Requirements, Java Support Systems, Java Environment.  Overview of JAVA Language: Introduction, Simple Java program, More of Java  Statements, Implementing a Java Program, Java Virtual Machine, Command Line 

Arguments, Programming Style. Constants, Variables, and Data Types: Introduction,  Constants, Variables, Data Types, Declaration of Variables, Giving Values to Variables,  Scope of Variables, Symbolic Constants, Type Casting, Getting Values of Variables,  Standard Default Values, Operators and Expressions: Introduction, Arithmetic Operators,  Relational Operators Logical Operators, Assignment Operators, Increment and  Decrement Operators, Conditional Operators, Bitwise Operators, Special Operators,  Arithmetic Expressions, Evaluation of Expressions, Precedence of Arithmetic Operators,  Type Conversion and Associativity, Mathematical Functions. Decision Making and  Branching: Introduction, Decision Making with if Statement, Simple if Statement, The  if…..else Statement, Nesting of if………Else Statements, The else if Ladder, The Switch  Statement, The ?: Operator. Decision Making and Looping: Introduction. The while  Statement, The do Statement, The for Statement, Jumps in Loops Labeled Loops. 

 [ 12 hours] Unit -II 

Classes, Arrays, Strings and Vectors: Classes, Objects and Methods: Introduction,  Defining a Class, Adding Variables, Adding Methods, Creating Objects, Accessing Class  Members, Constructors, Methods Overloading, Static Members, Nesting of Methods,  Inheritance: Extending a Class Overriding Methods, Final Variables and Methods,  Finalizer methods, Abstract Methods and Classes, Visibility Control. Arrays, Strings and  Vectors: Arrays, One-dimensional Arrays, Creating an Array, Two -Dimensional Arrays,  Creating an Array, Two – dimensional Arrays, Strings, Vectors, Wrapper Classes. 

[ 12 Hours ] 

Unit - III 

Interfaces, Packages, and Multithreaded Programming: Interfaces: Multiple Inheritance:  Introduction, Defining Interfaces, Extending Interfaces, Implementing Interfaces,  Accessing Interface Variables. Packages: Putting Classes together: Introduction, Java  API Packages, Using System Packages, Naming Conventions, Creating Packages,  Accessing a Package, Using a Package, Adding a Class to a Package, Hiding Classes.  Multithreaded Programming: Introduction, Creating Threads, Extending the Thread  Class, Stopping and Blocking a thread, Life Cycle of a thread, Using Thread Methods,  Thread Exceptions, Thread Priority, Synchronization, Implementing the ‘Runnable’  Interface. 

[ 12 Hours ] 

Unit - IV 

Managing Exceptions, Applet Programming: Managing Errors and Exception:  Introduction, Types of Exception Handling Code, Multiple Catch Statements, Using  Finally Statement, Throwing Our Own Exceptions, Using Exceptions for Debugging.  Applet Programming: Introduction, How Applets Differ from Applications, Preparing to  Write Applets, Building Applet Code, Applet Life Cycle, Creating an Executable applet,  Designing a Web Page, Applet Tag, Adding Applet to HTML File, running the Applet,  More About HTML Tags, Displaying Numerical Values, Getting Input from the User. [ 12 Hours ]

Page 29 of 38 

Unit - V 

Graphics Programming, Input/Output: Graphics programming: Introduction, The  Graphics Class, Lines and rectangles, circles, and Ellipses, Drawing Arcs, Drawing  Polygons, Lines Graphs, Using Control Loops in Applets, Drawing Bar Charts.  Managing Input/Output Files in JAVA: Introduction, Concept of Streams, Stream  Classes, Byte Stream Classes, Character Stream Classes, Using Streams, Other Useful  I/O Classes, Using the File Class, Input / Output Exceptions, Creation of Files, Reading /  Writing Characters, Reading / Writing Bytes, Handling Primitive Data Types,  Concatenating and Buffering Files, Interactive Input and output, Other Stream Classes. [ 12 Hours ] 

Text Books: 

  1. A.Balaguruswamy, “Programming with JAVA”, A Primer, TMH, 1999. Reference Books: 

  2. Thomas Boutel, “CGI programming in C and Perl”, Addison – Wesley, 1996. 2. Jefry Dwight et al, Using CGI, Second Edition, Prentice Hall, India, 1997. 3. Patrick Naughton & Herbert Schildt, JAVA 2: The Complete Reference, THM,  1999. 

  3. Schildt, “JAVA The Complete Reference”, 7th Edition. 

BCA505T : MICROPROCESSOR AND ASSEMBLY LAGUAGE Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I 

Architecture and Operation: Introduction to 8085, Microprocessor organization/  architecture & its operation Microprocessor based system, memory interfacing , basic  interfacing concepts ,interfacing I/O devices  

[ 12 Hours ] 

Unit - II 

Programming the 8085: Programming model, instruction classification , Instruction  format, addressing modes, writing assembly level programs-overview of instruction set,  timing diagrams data transfer, Arithmetic, Logic branch operations. 

[ 12 Hours ] 

Unit - III 

Programming techniques- Looping Counting and Indexing , 16 bit arithmetic operations ,  logic operations Compare and rotate operations . Counters and Time delays , Generation  of pulse waveforms. Stacks and subroutines- conditional CALL and RETURN  instructions. Advanced subroutine concepts. BCD to Binary and Binary to BCD  conversions, BCD to 7 segment conversion , Binary to ASCII and ASCII to Binary code  conversion, BCD addition and subtraction , multiplication and division. 

 [ 12 Hours ] Unit – IV 

Memory Interface: Memory and I/O mapping and interfacing concepts. Interrupts : 8085  vectored interrupts , Restart as Software instructions, additional I/O concepts and  processes. 

[ 12 Hours ] 

Unit – V 

Interfacing of peripherals (I/Os) and applications: Interfacing Keyboard (linear and  matrix) and 7 segment display including multiplexes, 8279 programmable keyboard  /display interface, 8255 PPI , 8259 PIC , DMA and 8257 DMA controller , Serial  communication using 8251, D to A converters and interfacing, RS323 serial 

Page 30 of 38 

communication standards. 

[ 12 Hours ] 

Text books  

  1. R.S.Gaonkar – Microprocessor Architectutre , Programming and Application with  8085. Penram Int. 3rd Edn. 

References 

  1. Douglas V.Hall- Microprocessors and digital systems, MH. 

  2. Kenneth L.Short - Microprocessor and Programmed Logic ‘’, PHI , 2nd Edn. 3. Aditya P. Mathur- Introduction to Microprocessors, 3RD Edn. TMH 4. Antonakos: Introduction to Intel family of Microprosessors Pearson Education 5. Hoffer: Modern Systems Analysis and Design Pearson Eduction Kendall, System  Analysis and Design 

BCA504P : JAVA PROGRAMMING LAB 

PART - A 

  1. Write a program to find factorial of list of number reading input as command line  argument. 

  2. Write a program to display all prime numbers between two limits. 3. Write a program to sort list of elements in ascending and descending order and  show the exception handling. 

  3. Write a program to implement all string operations. 

  4. Write a program to find area of geometrical figures using method. 6. Write a program to implement constructor overloading by passing different  number of parameter of different types. 

  5. Write a program to create student report using applet, read the input using text  boxes and display the o/p using buttons. 

  6. Write a program to calculate bonus for different departments using method  overriding. 

  7. Write a program to implement thread, applets and graphics by implementing  animation of ball moving. 

  8. Write a program to implement mouse events and keyboard events. PART – B 

During practical examination the External and Internal examiners may prepare exam  question paper related to theory syllabus apart from Part-A. (A minimum of 10  Programs has to be prepared). 

Note :  

  1. a) The candidate has to write both the programs One from Part-A and other from  Part-B and execute one program as of External examiner choice. 

  2. b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in  the Practical Record. 

  3. c) Scheme of Evaluation is as follows: 

Writing two programs - 10 Marks 

Execution of one program - 10 Marks  

Formatting the Output - 05 Marks 

Viva - 05 Marks 

Record - 05 Marks 

Total - 35 Marks

Page 31 of 38 

BCA505P: ASSEMBLY LANGUAGE PROGRAMMING LAB 

PART - A 

  1. Exchange of two 16-bit numbers. 

  2. Addition & Subtraction of two 8 –bit HEX numbers. 

  3. Subtraction of two 16 –bit numbers. 

  4. Two n-byte Number addition. 

  5. Block Transfer. 

  6. ‘N’ Decimal Number addition. 

  7. 4-Digit BCD addition. 

  8. Subtraction of 16 –bit number. 

  9. Sorting of array in ascending order. 

  10. Multiplication of 2 digit BCD 

PART – B 

During practical examination the External and Internal examiners may prepare exam  question paper related to theory syllabus apart from Part-A. (A minimum of 10  Programs has to be prepared). 

Note :  

  1. a) The candidate has to write both the programs One from Part-A and other from  Part-B and execute one program as of External examiner choice. 

  2. b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in  the Practical Record. 

  3. c) Scheme of Evaluation is as follows: 

Writing two programs - 10 Marks 

Execution of one program - 10 Marks  

Formatting the Output - 05 Marks 

Viva - 05 Marks 

Record - 05 Marks 

Total - 35 Marks 

BCA506P : PROJECT 

Students can develop a project in team (maximum three members). They should  implement their project in college in any RDBMS package or any language available in  the college. The students have to collect data outside practical hours. Project may be  taken outside but must be implemented in the college. Internal marks can be awarded by  the guide by evaluating the performance of the students during the course of project  work. In viva-voce the questions must be directed only on the project work to access the  involvement and understanding of the problem by the students. 

The project carries 100 marks is distributed as follows: 

Demonstration and Presentation 65 Marks 

Viva-voce 25 Marks 

Project Report 10 Marks 

Book Now For Free Classes

Get It Now

Object Oriented Programming using C++​ BCA ChaloExam

Bangalore Central University BCA 3rd sem Study Materials and Previous Year Question Paper

Book Free Classes

Bangalore Central University 3rd Sem BCA Study Materials

Download free BCA 3rd sem module wise notes, latest solved question papers, previous 5 years question paper till 2021, model question papers, easy notes, exam oriented notes are available on this website chaloexam.com of Bangalore Central University

Bangalore Central University BCA syllabus 2020

Syllabus

Syllabus

THIRD SEMESTER BCA 

BCA301T: INDIAN LANGUAGE 

Syllabus as per the one prescribed for science courses of Bangalore University. 

BCA302T: ENGLISH 

Syllabus as per the one prescribed for science courses of Bangalore University. 

BCA303T: OBJECT ORIENTED PROGRAMMING USING C++ Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I 

Introduction :Procedure Languages, definition of OOP, Basic concept of OOP, Object  Class, Data Abstraction, Data Encapsulation, Data Hiding member functions ,  Reusability, Inheritance, Creating new Data Types, Polymorphism, Overloading ,  Dynamic binding and Message passing. C++ Features: The iostream class, C++  Comments, C++ Keywords, Variable declaration, The Const Qualifier. The Endl, Set  Waste precision, Manipulators, The scope resolution operator, The new & delete  Operations. Functions: Simple Functions, Function declaration, calling the function,  function definition, Passing argument to, returning value from function, passing  constants, Variables, pass by value , passing structure variables, pass by reference,  Default arguments, return statements, return by reference, overloaded functions;  Different number of arguments, Different Kinds of argument, inline function. 

[ 12 Hours ] 

Unit - II 

Objects & Classes: Classes & Objects, Class Declaration, Class member; Data  Constructions, Destructors, Member functions, Class member visibility, private, public,  protected . The scope of the class objects constructions, Default Constructor.  Constructor with argument, constructor with default arguments, Dynamic constructor,  copy constructor, Overloaded constructor, Objects as arguments returning objects from 

Page 19 of 38 

functions, class conversion, manipulation private Data members, Destructors classes,  object & memory, arrays as class member data: Array of objects, string as class member.  [ 12 hours ]  Unit - III 

Operator Overloading : Overloading unary operator: Operator Keyword, Operator  arguments, Operator return value, Nameless temporary objects, limitations of increment  operator, overloading binary operator, arithmetic operators, comparison operator,  arithmetic assignment operator, data conversion; conversion between objects of different  classes. Inheritance : Derived Class & Base Class: Specifying the Derived class  accessing Base class members, the protected access specifier, Derived class constructor,  Overriding member functions, public and private inheritance; Access Combinations,  Classes & Structures, Access Specifiers, Level of inheritance; Multilevel inheritance,  Hybrid inheritance, Multiple inheritance; member functions in multiple inheritance ,  constructors in multiple inheritance, Containership; Classes, within classes, Inheritance  & Program development.  

[ 12 Hours ] 

Unit - IV 

Virtual functions: Normal member function accessed with pointers, Virtual member  functions accessed with pointers, Dynamic binding, pure virtual functions, Friend  function; Friends for functional notation, friend classes, the pointer; Accessing Member  Data with this, using this for returning values. Templates & Exception Handling:  Introduction, Templates, Class Templates, function templates, Member function  templates, Template arguments, Exception Handling.  

[ 12 Hours ] 

Unit V 

Streams: The Stream class Hierarchy, Stream classes Header file, string I/O: Writing  strings, reading strings, character I/O, Detecting End – of – file. Object I/O; writing an  object to disk, reading an object from disk, I/O with multiple objects; the fstream class,  The open function, File Pointers; Specifying the position, Specifying the offset. The tellg  Function, Disk I/O with Memory Functions; Closing Files, Error Handling, Command  Line Arguments. 

[ 12 Hours ] 

Text books: 

  1. Lafore Robert, “Object Oriented Programming in Turbo C++”, Galgotia   Publications, 2012. 

Reference: 

  1. Lippman, “C++ Primer”, 3rd Edition, Pearson Education, 2010. 

  2. E. Balaguruswamy: Object Oriented Programming with C++, Tata McGraw Hill   Publications, 2011. 

  3. Farrell, “Object Oriented Programming Using C++”, 1st Edition 2008, Cengage   Learning India 

BCA304T: ACCOUNTING AND FINANCIAL MANAGEMENT Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I 

Introduction: History and Development of Accounting –Meaning Objectives and  functions of Accounting-Book–keeping V/s Accounting –Users of accounting data – systems of book-keeping and accounting – branches of accounting –advantages and  limitations of accounting. Accounting Concepts and conventions: Meaning need and  classification, Accounting standards –meaning, need and classification of Indian 

Page 20 of 38 

accounting standards. Accounting principles V/s Accounting standards. [ 12 Hours ] 

Unit - II 

Financial Accounting Process: Classification of accounting transaction and accounts,  rules of debit and credit as per Double Entry System. Journalisation and Ledger position Preparation of different subsidiary books: Purchase Day Book Sales Day Book, Purchase  Returns Day Books, Sales Returns Day Book, Cash Book. Bank Reconciliation  Statement: Meaning, Need, Definition, preparation of BRS. 

 [ 12 Hours ] Unit - III 

Accounting for bill of exchange: Meaning, Need, Definition, Partice to Bill of Exchange, Types of Bills. Accounts Procedure: Honour of the Bill, Dishonour of the Bill,  Endorsement, Discounting, Renewal, Bills for collection, Retirement of the Bill,  Accommodation Bills, Bill Receivable Book and Payable Book. Preparation of Trial  Balance: Rectification of errors and journal Proper. 

 [ 12 Hours ] Unit - IV 

Preparation of Final accounts: Meaning, need and classification, Preparation of  Manufacturing, Trading, Profit and loss account and Balance-Sheet of sale –traders and  partnership firms. 

 [ 12 Hours ] Unit V 

Accounting Package like Tally 

 [ 12 Hours ] Text Book 

  1. S.Ramesh, B.S.Chandrashekar, a Text Book of Accountancy. 

References 

  1. V.A.Patil and J.S.Korihalli, Book–Keeping and Accounting, (R. Chand and Co.  Delhi). 

  2. R.S.Singhal, Principles of Accountancy, Nageen Prakash pvt.Ltd, Meerut. 3. B.S.Raman, Accountancy, (United Publishers, Mangalore) 

BCA305T: OPERATING SYSTEMS 

Total Teaching Hours : 65 No of Hours / Week : 05 Unit - I 

Introduction: Batch Systems, Concepts of Multiprogramming and Time Sharing, Parallel,  Distributed and real time Systems, Operating System Structures, Components &  Services, System calls, System programs, Virtual machines. Process Management:  Process Concept, Process Scheduling, Co – Operating process, Threads, Inter process  communication, CPU Scheduling Criteria, Scheduling algorithm, Multiple Processor  Scheduling, Real time Scheduling, Algorithm evolution.  

 [ 13 Hours ] 

Unit - II 

Process Synchronization and deadlocks: The Critical Section Problem, Synchronization  hardware, Semaphores, Classical problems of synchronization, Critical regions, monitors,  Dead locks – system model, Characterization, Dead lock prevention, avoidance and  detection, Recovery from dead lock, Combined approach to deadlock handling. 

[ 13 Hours ]

Page 21 of 38 

Unit - III 

Memory Management: Logical and Physical address space, Swapping, Contiguous  allocation, Paging, Segmentation, Segmentation with paging in Mastics and Intel 386,  Virtual memory-Demand paging and it’s performance, Page replacement algorithms,  Allocation of frames, thrashing, page size and other considerations. Demand  Segmentation. 

[ 13 Hours ] 

Unit - IV 

File management (Systems, Secondary Storage Structure): File Concepts, Access  methods, Directory Structure, Protection and consistency, File system structure,  Allocation methods, Free space management, Directory Implementation, Efficiency and  Performance, Recovery. Disk Management (Structure, Disk Scheduling Methods): Disk  Structure & Scheduling methods, Disk management, Swap – Space management.  

[ 13 Hours ] 

Unit - V 

Protection and Security: Goals of protection, Domain Protection, Access matrix, Security Problem, Authentication, One time password, program threats, System threads. Case Study of Windows and Linux Operating System 

[ 13 Hours ] 

Text Books: 

  1. Abraham Silberschatz and Peter Baer Galvin, “Operating System Concepts”, 7th Edition, Pearson Education, 2002. 

Reference Books: 

  1. H.M.Deitel, “Operating Systems”, Pearson Learning Solutions, 3rd Edition, 2003. 2. William Stallings, “Operating Systems”, 6th Edition, Pearson Education, 2010. 3. Stuart, “Operating systems: Principles, Design and Implementation”, 1st Edition  2008, Cengage Learning India 

BCA303P : C++ PROGRAMMING LAB 

PART-A 

  1. Write a program to prepare a shopping lists 

  2. Write a program to perform bank transactions. 

  3. Write a program to swap numbers using friend function. 

  4. Write a program to calculate area and circumference of circle using inline  function 

  5. Write a program to perform multiplication of two matrices using operator  overloading. 

  6. Write a program to implement operation on queue. 

  7. Write a program to create a student report using inheritance technique. 8. Write a Program to find the area and volume of respective figures using function  overloading. 

  8. Write a program to show returning current object, accessing member data of  current object and returning values of object using this pointer 

  9. Write a program to sort elements using template. 

PART - B 

During practical examination the External and Internal examiners may prepare exam  question paper related to theory syllabus apart from Part-A. (A minimum of 8  Programs has to be prepared). 

Note : 

Page 22 of 38 

  1. a) The candidate has to write two the programs One from Part-A and other from  Part-B and execute one program as of External examiner choice. 

  2. b) A minimum of 10 Programs has to be done in Part-B and has to be maintained  in the Practical Record. 

  3. c) Scheme of Evaluation is as follows: 

Writing two programs - 10 Marks 

Execution of one program - 10 Marks  

Formatting the Output - 05 Marks 

Viva - 05 Marks 

Record - 05 Marks 

 Total - 35 Marks 

Book Now For Free Classes

Get It Now

Data structures ChaloExam

Bangalore Central University BCA 2nd sem Study Materials and Previous Year Question Paper

Book Free Classes

Bangalore Central University 2nd Sem BCA Study Materials

Download free BCA 2nd sem module wise notes, latest solved question papers, previous 5 years question paper till 2021, model question papers, easy notes, exam-oriented notes are available on this website chaloexam.com of Bangalore Central University

Bangalore Central University BCA syllabus 2020

Syllabus

Syllabus

SECOND SEMESTER BCA 

BCA201T: INDIAN LANGUAGE 

Syllabus as per the one prescribed for science courses of Bangalore University. 

BCA202T: ENGLISH 

Syllabus as per the one prescribed for science courses of Bangalore University. 

BCA203T: DATA STRUCTURES 

Total Teaching Hours : 60 No of Hours / Week : 04 Unit-I  

Introduction and Overview: Definition, Elementary data organization, Data Structures,  data structures operations, Abstract data types, algorithms complexity, time-space  tradeoff. Preliminaries: Mathematical notations and functions, Algorithmic notations,  control structures, Complexity of algorithms, asymptotic notations for complexity of  algorithms. String Processing: Definition, Storing Stings, String as ADT, String  operations, word/text processing, Pattern Matching algorithms.  

[ 12 Hours ] 

Unit-II 

Arrays: Definition, Linear arrays, arrays as ADT, Representation of Linear Arrays in  Memory, Traversing Linear arrays, Inserting and deleting, Sorting: Bubble sort, Insertion  sort, Selection sort, Searching: Linear Search, Binary search, Multidimensional arrays, 

Page 12 of 38 

Matrices and Sparse matrices.  [ 12 Hours ] 

Unit-III 

Linked list: Definition, Representation of Singly linked list in memory, Traversing a  Singly linked list, Searching a Singly linked list, Memory allocation, Garbage collection,  Insertion into a singly linked list, Deletion from a singly liked list; Doubly liked list,  Header liked list, Circular linked list.  

[ 12 Hours ] 

Unit-IV 

Stacks – Definition, Array representation of stacks, Linked representation of stacks,  Stack as ADT, Arithmetic Expressions: Polish Notation, Application of Stacks,  Recursion, Towers of Hanoi, Implementation of recursive procedures by stack. Queues  – Definition, Array representation of queue, Linked list representation of queues Types  of queue: Simple queue, Circular queue, Double ended queue, Priority queue, Operations  on Queues, Applications of queues. 

 [ 12 Hours ] Unit-V 

Graphs: Graph theory terminology, Sequential representation of Graphs: Adjacency  matrix, traversing a Graph. Tree – Definitions, Binary trees, Representing binary trees in  memory, Traversing Binary Trees, Binary Search Trees, Searching, Inserting and  Deleting in a Binary Search Tree. 

 [ 12 Hours ] TEXT BOOKS 

  1. Seymour Lipschutz, “Data Structures with C”, Schaum’s outLines, Tata  McGraw-Hill, 2011. 

REFERENCES BOOKS 

  1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second  Edition, Pearson Education, 2013. 

  2. Robert Kruse, C.L.Tondo, Bruce Leung, Shashi Mogalla, “Data Structures and  Program Design using C”, Pearson Education, 2009. 

  3. Forouzan, “A Structured Programming Approach using C”, 2nd Edition, Cengage  Learning India, 2008. 

BCA204T : DATA BASE MANAGEMENT SYSTEMS 

Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I 

Introduction: Database and Database Users, Characteristics of the Database Approach,  Different people behind DBMS, Implications of Database Approach, Advantages of  using DBMS, When not to use a DBMS. Database System Concepts and architecture: Data Models, Schemas, and Instances. DBMS Architecture and Data Independence.,  Database languages and interfaces. The database system Environment, Classification of  DBMS.  

[ 12 Hours ] 

Unit - II 

Data Modelling Using the Entity-Relationship Model: High level conceptual Data  Models for Database Design with and example., Entity types, Entity sets, attributes, and  Keys, ER Model Concepts, Notation for ER Diagrams, Proper naming of Schema  Constructs, Relationship types of degree higher than two. Record Storage and Primary  File Organization: Secondary Storage Devices. Buffering of Blocks. Placing file Records  on Disk. Operations on Files, File of unordered Records (Heap files), Files of Ordered 

Page 13 of 38 

Records (Sorted files), Hashing Techniques, and Other Primary file Organization. [ 12 Hours ] 

Unit - III 

Functional Dependencies and Normalization for Relational Database: Informal Design  Guidelines for Relational schemas, Functional Dependencies, Normal Forms Based on  Primary Keys., General Definitions of Second and Third Normal Forms Based on  Primary Keys., General Definitions of Second and Third Normal Forms, Boyce-Codd  Normal Form. Relational Data Model and Relational Algebra: Relational Model  Concepts., relational Model Constraints and relational Database Schema, defining  Relations, Update Operations on Relations., Basic Relational Algebra Operations,  Additional Relational Operations., Examples of queries in the Relational Algebra.,  Relational Database design Using ER-to-Relational Mapping. 

[ 12 Hours ] 

Unit – IV 

Relational Database Language: Data definition in SQL, Queries in SQL, Insert, Delete  and Update Statements in SQL, Views in SQL, Specifying General Constraints as  Assertions, specifying indexes, Embedded SQL. PL /SQL: Introduction.  [ 12 Hours ] 

Unit - V 

Transaction Processing Concepts: Introduction, Transaction and System Concepts,  Desirable properties of transaction, Schedules and Recoverability, Serializability of  Schedules, Transaction Support in SQL, Locking Techniques for Concurrency Control,  Concurrency Control based on time stamp ordering. 

 [ 12 Hours ] Text book: 

  1. Remez Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”,  5th Edition, Pearson Education, 2007. 

References: 

  1. Abrahamsi. Silberschatz, Henry. F. Korth, S. Sudarshan, “Database System  Concepts” 6th Edition, McGraw Hill, 2012. 

  2. C.J.Date, “Introduction to database systems”, Eight Edition, Addison Wesley,  2003. 

BCA205: NUMERICAL AND STATISCAL METHODS 

Total Teaching Hours: 65 No of Hours / Week : 05 Unit - I 

Floating-point representation and errors-Normalized floating-point forms, Errors in  representing numbers, Floating point machine number and machine epsilon, Loss of  significance and its avoidance. Roots of equations-locating roots of f(x)=0 Bisection  method, Newton’s method, Secant method. 

[ 13 Hours ] 

Unit - II 

Interpolation and numerical differentiation-polynomial interpolation, Lagrange and  Newton form of interpolating Polynomial, Divided difference and recursive property,  Inverse interpolation, First and Second derivative formulae via interpolation  Polynomials. Numerical integration-Trapezoidal, Simpson’s and adaptive Simpson rules. 

 [ 13 Hours ] Unit - III 

System of linear equations-Gaussian elimination and back substitution-partial and  complete pivoting, Doolittle, Cholesky and Crout LU decomposition methods, Jacobi and 

Page 14 of 38 

Gauss – Seidel iterative methods. Power (and inverse power) method of obtaining largest  (smallest) eigenvalue and corresponding eigenvector. Ordinary differential equations initial value problem, Picard’s, Taylor series, Runge-Kutta first, second and fourth order  methods.  

[ 13 Hours ] 

Unit – IV 

Basics concepts and definition of statistics. Mean, Standard deviation, coefficient of  Variation, skewness & kurtosis, Carl Pearson Correlation, Rank correlation and  illustrated examples. Probability: Basic concept and definition of probability, probability  axioms, Laws of Probability, Conditional probability, Bayes theorem , Problems and  application. 

[ 13 Hours ] 

Unit - V 

Random variable and Expectation: Discrete and continuous random variables,  expectation of random variables, theorems on expectation, illustrative examples. Probability Distribution: Probability function, Probability mass/density function,  Discrete Distribution – Bernoulli, Binomial Distribution, Continuous distribution – Normal Distribution, applications and problems. 

[ 13 Hours ] 

Text Books: 

  1. M.K.Jain, SRK Iyengar and R.K. Jain Numerical methods for Scientific and   Engineering Computation: Wiley Eastern. 

  2. Ronald E Walpole & Raymond H Meyers : Probability & Statistics for   Engineers and Scientists (Second Edition). 

References 

  1. J.Medhi : Statistical Methods New Age Publications. 

  2. S.C.Gupta and V.K.Kapoor – Elements of Mathematics, Statistics,   Sultan Chand and Sons. 

BCA203P : DATA STRUCTURES USING C LAB 

PART - A 

  1. Write a menu driven C program to perform the following string operations without  using string functions: (i) String Length (ii) String Concatenation (ii) String  Reverse 

  2. Write a C program to search for an element in an array using Binary search 3. Write a C program to sort a list of N elements using Selection Sort Algorithm. 4. Write a C program to construct a singly linked list and perform insertion, deletion  and Display operations. 

  3. Write a C program to demonstrate the working of stack using liked list. 6. Write a C program for Towers of Hanoi problem.  

  4. Write a C program to find GCD of two numbers using recursion 8. Write a C program to convert infix arithmetic expression to post fix expression. 9. Write a C program to simulate the working of Circular Queue using an array.  10. Write a C program to create and traverse a binary search tree.  

PART – B 

During practical examination the External and Internal examiners may prepare exam  question paper related to theory syllabus apart from Part-A. (A minimum of 10  Programs has to be prepared). 

Note : 

Page 15 of 38 

  1. a) The candidate has to write two the programs One from Part-A and other from  Part-B and execute one program as of External examiner choice. 

  2. b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in  the Practical Record. 

  3. c) Scheme of Evaluation is as follows: 

Writing two programs - 10 Marks 

Execution of one program - 10 Marks 

Formatting the Output - 05 Marks 

Viva - 05 Marks 

Record - 05 Marks 

Total - 35 Marks 

BCA304P: DATABASE MANAGEMENT SYSTEM LAB 

PART - A 

  1. The STUDENT detail databases has a table with the following attributes. The primary  keys are underlined. STUDENT(regno: int, name: string, dob: date, marks: int) i) Create the above table. 

  2. ii) Remove the existing attributes from the table. 

iii) Change the date type of regno from integer to string. 

  1. iv) Add a new attribute phoneno to the existing table. 

  2. v) Enter five tuples into the table. 

  3. vi) Display all the tuples in student table. 

  4. A LIBRARY database has a table with the following attributes. 

LIBRARY(bookid:int, title:string, author:string, publication:string, yearpub:int, price:real) i) Create the above table. 

  1. ii) Enter the five tuples into the table 

iii) Display all the tuples in student table. 

  1. iv) Display the different publishers from the list. 

  2. v) Arrange the tuples in the alphabetical order of the book titles. 

  3. vi) List the details of all the books whose price ranges between Rs. 100 and Rs. 300 3. The SALARY database of an organization has a table with the following attributes.  EMPSALARY(empcod:int, empnamee:string, dob:date, department:string, salary:real) i) Create the above table. 

  4. ii) Enter the five tuples into the table 

iii) Display all the number of employees working in each dapartment. iv) Find the sum of the salaries of all employees. 

  1. v) Find the sum and average of the salaries of employees of a particular department. vi) Find the least and highest salaries that an employee draws.

Page 16 of 38 

  1. Consider the insurance database given below. The primary keys are underlined and  the data types are specified. 

PERSON(driver-id-no: string, name: string, address:strong) 

CAR(regno: string, model: string, year: int) 

ACCIDENT(report-no: int, date: date, location: String) 

OWNS(driver-id-no: string, regno: string) 

PARTICIPATED(driver-id-no: string, regno: string, report-no: int, damage-amount: int) i) Create the above tables by properly specifying the primary keys and the foreign keys ii) Enter atleast five tuples for each relation. 

iii) Demonstrate how you 

  1. a) Update the damage amount for the car with a specific regno in the accident with  report no 12 to 25000. 

  2. b) Add a new accident to the database. 

  3. iv) Find total number of people who owned cars that were involved in accidents in 2002 v) Find the number of accidents in which cars belonging to a specific model were involved 5. Consider the following database of students enrollment in courses and books adopted  for each course. 

STUDENT(regno: string, name: string, major: strong, bdate: date) 

COURSE(course-no: int cname: string, dept: string) 

ENROLL(reg-no: string, course-no: int, sem: int, marks: int) 

BOOK-ADOPTION(course-no: int, sem: int, book-isbn: int) 

TEXT(book-isbn: int, book-title: string, publisher: string, author: string) i) Create the above tables by properly specifying the primary keys and the foreign keys ii) Enter atleast five tuples for each relation. 

iii) Demonstrate how you add a new text book to the database and make this book be  adopted by some department. 

  1. iv) Produce a list of text books (include Course-no, book-isbn, book-title) in the  alphabetical order for courses offered by the ‘Compute Science’ department that use  more than two books. 

  2. v) List any department that has all its adopted books published by a specific publisher. 6. The following tables are maintained by a book dealer  

AUTHOR(author-id: int, name: string, city: string, country: string) 

PUBLISHER(publisher-id: int name: string, city: string, country: string)

Page 17 of 38 

CATLOG(book-id: int, title : string, author-id: int, publisher-id: int, category: int, year:  int, price: int) 

CATEGORY(category-id: int, description: string) 

ORDER-DETAILS(order-no: int, book-id: int, quantity: int) 

  1. i) Create above tables by properly specifying the primary keys and the foreign keys. ii) Enter atleast five tuples for each relation. 

iii) Give the details of the authors who have 2 or more books in the catalog and the price  of the books is greater than the average price of the books in the catalog and the year  of publication is after 2010. 

  1. iv) Find the author of the book which has maximum sales. 

  2. v) Demonstrate how to increase price of books published by specific publisher by 10% 7. Consider the following database for BANK. 

BRANCH(branch-name: string, branch-city: string, assets: real) 

ACCOUNT(accno: int, banch-name: string, balance: real) 

DEPOSITOR(customer-name: string, accno: int) 

CUSTOMER(customer-name: string, customer-street: string, customer-city: string) LOAN(loan-no: int, branch-name: string, amount: real) 

ORROWER(customer-name: string, loan-no: int) 

  1. i) Create the above tables by properly specifying the primary keys and foreign keys. ii) Enter atleast five tuples for each relation. 

iii) Find all the customers who have atleast two accounts at the main branch. iv) Find all customer who have an account at all the branches located in a specific city. v) Demonstrate how t0 delete all account tuples at every branch located in specific city. 8. Consider the following database for ORDER PROCEESING. 

CUSTOMER(cust-no: int, cname: string, city: string) 

ORDER(orderno: int, odate: date, ord-amt: real) 

ORDER_ITEM(orderno: int, itemno:int, qty: int) 

ITEM(itemno: int, unitprice: real) 

SHIPMENT(orderno: int, warehouseno: int, ship-date: date) 

WAREHOUSE(warehouseno: int, city: string) 

  1. i) Create the above tables by properly specifying the primary keys and the foreign keys ii) Enter atleast five tuples for each relation. 

iii) List the order number and ship date for all orders shipped from particular warehouse.

Page 18 of 38 

  1. iv) Produce a listing: customer name, no of orders, average order amount v) List the orders that were not shipped within 30 days of ordering 

PART – B 

During practical examination the External and Internal examiners may prepare exam  question paper related to theory syllabus apart from Part-A. (A minimum of 8  Programs has to be prepared). 

Note :  

  1. a) The candidate has to write two the programs One from Part-A and other from Part-B  and execute one program as of External examiner choice. 

  2. b) A minimum of 8 Programs has to be done in Part-B and has to be maintained in the  Practical Record. 

  3. c) Scheme of Evaluation is as follows: 

Writing two programs - 10 Marks 

Execution of one program - 10 Marks  

Formatting the Output - 05 Marks 

Viva - 05 Marks 

Record - 05 Marks 

 Total - 35 Marks 

Book Now For Free Classes

Get It Now

Problem Solving Techniques using C

Bangalore Central University BCA 1st sem Study Materials and Previous Year Question Paper

Book Free Classes

Bangalore Central University 1st Sem BCA Study Materials

Download free BCA 1st sem module wise notes, latest solved question papers, previous 5 years question paper till 2021, model question papers, easy notes, exam-oriented notes are available on this website chaloexam.com of Bangalore Central University

Bangalore Central University BCA syllabus 2020

Syllabus

Syllabus

FIRST SEMESTER BCA 

BCA101T : INDIAN LANGUAGE 

Syllabus as per the one prescribed for science courses of Bangalore University. 

BCA102T : ENGLISH 

Syllabus as per the one prescribed for science courses of Bangalore University. 

BCA103T : PROBLEM SOLVING TECHNIQUES USING C 

Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I  

Introduction to Programming Concepts: Software, Classification of Software, Modular Programming, Structured Programming, Algorithms and Flowcharts with examples. Overview of C Language: History of C, Character set, C tokens, Identifiers, Keywords,  Data types, Variables, Constants, Symbolic Constants , Operators in C, Hierarchy of Operators, Expressions, Type Conversions and Library Functions.  

[12 Hours ] 

Unit - II 

Managing Input and Output Operation: Formatted and Unformatted I/O Functions,  Decision making, branching and looping: Decision Making Statements - if Statement, if– else statement, nesting of if-else statements, else–if ladder, switch statement,?: operator,  Looping - while, do-while, for loop, Nested loop, break, continue, and goto statements.  Functions: Function Definition, prototyping, types of functions, passing arguments to  functions, Nested Functions, Recursive functions. 

[12 Hours ] 

Unit - III 

Arrays: Declaring and Initializing, One Dimensional Arrays, Two Dimensional Arrays,  Multi Dimensional Arrays - Passing arrays to functions. Strings: Declaring and  Initializing strings, Operations on strings, Arrays of strings, passing strings to functions.  Storage Classes - Automatic, External, Static and Register Variables. 

[12 Hours ] 

Unit-IV 

Structures-Declaring and Initializing, Nested structure, Array of Structure, Passing  Structures to functions, Unions, typedef, enum, Bit fields. Pointers – Declarations,  Pointer arithmetic, Pointers and functions, Call by value, Call by reference, Pointers and  Arrays, Arrays of Pointers, Pointers and Structures. Meaning of static and dynamic  memory allocation, Memory allocation functions.  

 [ 12 Hours ] Unit-V 

Files - File modes, File functions, and File operations, Text and Binary files, Command  Line arguments. C Preprocessor directives, Macros – Definition, types of Macros,  Creating and implementing user defined header files.  

 [ 12 Hours ] 

TEXT BOOKS 

  1. E. Balaguruswamy, “Programming In ANSI C”, 4th edition, TMH Publications,  2007 

  2. Ashok N. Kamthane, “Programming with ANSI and Turbo C”, Pearson Education,  2006 

REFERENCES BOOKS

Page 7 of 38 

  1. Ashok N. Kamthane et. al., “Computer Programming and IT”, Pearson Education,  2011  

  2. Mahapatra, “ Thinking In C ”, PHI Publications, 1998. 

  3. Yashwant Kanetkar, “Let Us C”, 13th Edition, PHP, 2013. 

BCA104T: DIGITAL ELECTRONICS 

Total Teaching Hours : 60 No of Hours / Week : 04 Unit - I 

Introduction to network theorems and AC fundamentals: Ohm’s law: Statement,  explanation. Kirchhoff’s law: Statement & explanation of KCL and KVL. Mesh/loop  analysis (up to 2 loops) and node voltage method, Numerical problems. Delta/star and  star/Delta transformation: No derivation for Interco version equations, introduction of  network, port of network (one port network, two port network), unilateral network,  bilateral network, linear network. Need for application of network theorems. (DC  Circuits only). Superposition theorem: statement, (only with TWO voltage sources) steps  to apply the theorem explanation by considering a simple resistive network and  problems. Thevenin’s theorem: Statement, (Only with ONE voltage source) Steps to  apply the theorem, explanation by considering a simple resistive networking and  problems. Norton’s theorem: Statement, (Only with ONE voltage source) steps to apply  the theorem, explanation by considering a simple resistive network and problems.  Maximum power transfer theorem: Statement, explanation of theorem by considering a  simple resisting network, expression for maximum power deliver (P L (max)  =Vth2/4Rth) (no derivation), graph of Vs Pl, numerical problems and applications. Reciprocity theorem, Statement, explanation using resistive network with dc source and  numerical problems. AC Fundamentals: Representation of ac sine wave, instantaneous  value, peak value, peak to peak value, average value, r.m.s value cycle, time period,  frequency. (No derivations, only mention the expressions) Representation of non  sinusoidal waves. 

[ 12 Hours ] 

Unit - II 

Semiconductor Devices: Introduction, atomic structure, energy level, energy band  diagram in solids, classification of conductors, insulators and semiconductors.  Semiconductor, properties, crystal structure of semiconductor, types – intrinsic and  extrinsic semiconductor. Intrinsic semiconductor: Crystal structure (Ge& Si), thermal  generated charges (electron and holes) carriers the effect temp on their motion. Extrinsic  semiconductor: Doping, donor acceptor impurities, c-type, p-type semiconductor,  majority and minority carriers, their currents, concept of immobile ions. Semiconductor  devices : PN junction diode, formation of pn junction layer, potential barrier, energy  level diagram of pn junction, Biasing of pn junction, behaviour of pn junction under  forward and reverse biasing, break down in pn junction, avalanche and zener break  down. Diode characteristics; V-I characteristic, forward and reverse bias, diode  parameters, bulk resistance, knee voltage, static and dynamic resistance, PIV.  Application of diode; As a rectifier, as logic gate, as a switch, etc. Rectifier, types, Half  wave Full wave. Half wave rectifier: Circuit, working, wave forms and expression for  ripple factor and efficiency (no derivation), advantages & disadvantages. Bridge wave  rectifier: Circuit, working, wave forms and expressions for ripple factor and efficiently  (no derivation), advantages & disadvantages. Logic families: Scale of integration, Digital  IC’s, classifications, DTL, TTL, ECL, MOS, CMOS, Mention of features: speed of  operation, power dissipation, propagation delay, fan-in, fan-out. [ 12 Hours ]

Page 8 of 38 

Unit – III 

Number Systems: Introduction to number systems – positional and non-positional, Base  /Radix. Decimal number system-Definition, digits, radix/base, Binary number system – Bit Byte, Conversions: Binary to Decimal and Decimal to Binary. Octal number system Conversion from Octal to Decimal to Octal, Octal to Binary and binary to Octal.  Hexadecimal number system –Conversion : Decimal to Hex, Hex to decimal, Hex to  Binary, Binary to Hex, Octal to Hex, Hex to Octal, Binary, arithmetic –binary addition,  subtraction, multiplication and division (only Integer part). 1’s and 2’s compliment: 2’s  complement subtraction. Binary code: BCD numbers, 8421 code, 2421 code- examples  and applications. Gray code –Conversions-Gray to binary and Binary to Gray,  application of gray code (Mention only). Excess-3 code – self complimenting property  and applications. Definition and nature of ASCII code. Introduction to error detection  and correction code, parity check. Boolean algebra:-Laws and theorems. AND, OR,  NOT Laws, Commutative law, associative law, distributive law, Duality theorem.  Demorgan’s theorems-Statements, proof using truth tables; Simplification of Boolean  expressions using Boolean laws. Definition of product term, sum term, minterm,  maxterm, SOP, standard POS and Standard POS. Conversion of Boolean expression to  Standard SOP and Standard POS forms. Karnaugh maps-Definition of Karnaugh map,  K- map for 2, 3 and 4 variables. Conversion of truth tables into k-map grouping of cells,  redundant groups and don’t care conditions Karnaugh map technique to solve 3 variable  and 4 variable expressions. Simplification of 3 and 4 variable Boolean expression using  K-maps (SOP only) 

[ 12 Hours ] 

Unit - IV 

Logic Gates: AND Gate: Definition, symbol truth table, timing diagram, Pin diagram of  IC 7408. OR Gate: Definition, symbol, truth table, timing diagram of IC 7432. NOT  Gate: Definition symbol, truth table, timing diagram, Pin diagram of IC 7404. NAND  Gate: Definition, symbol, truth table, Pin diagram of IC 7400, NOR Gate: Definition,  symbol, truth table, timing diagram, Pin diagram of IC 7402. Exclusive OR Gate: Definition, symbol, truth table, timing diagram. Combinational logic circuits: Definition,  applications. Half Adder: Symbol, Logic circuits using XOR and basic gates, Truth table,  Full Adder: Symbol, Logic circuits using XOR and basic gates, Truth table, Half  Subtractor: Symbol, Logic circuits using XOR and basic gates, Truth table. Full  Subtractor: Symbol, Logic circuits using XOR and basic gates, Truth table. Adder – Subtractor; Logic circuit, Pin diagram IC 7483, IC 7486. Parallel Adder: 4 –bit parallel  binary adder, BCD adder, IC 7483 NAND –NOR implementation of Adders.  

[ 12 Hours ] 

Unit - V 

Sequential Circuits: Importance of clock in digital circuit and introduction to flip flop.  Flip –flop-difference between latch and flip-flop. Qualitative study of level and edge  triggering. RS latch /unlocked, symbol and truth table. RS flip-flop using NAND gate,  symbol, truth table and timing diagram. D flip –flop – Symbol, truth table, Realization of  JK flip –flop using NAND gates, working, and timing diagram. Race around condition,  present and clear inputs, pin diagram of IC 74112. T flip flop-Logic symbol, JK flip flop  as a T flip –flop truth table and timing diagram. Master slave flip flop; Logic circuit,  truth table and timing diagram, advantage of M/S flip-flop, pin diagram of IC 7473 IC  7476. Registers: Definition, types of registers-Serial in serial out, serial in parallel out,  Parallel in serial out, Parallel in parallel our shift register (Block diagram representation  for each), truth table, timing diagram and speed comparison. 

 [ 12 Hours ]

Page 9 of 38 

Text Books: 

1) Thomas L.Floyd ,’’Digital Fundamentals”, Peason Education Inc, New Delhi,  2003 

Reference Books: 

1) Morris Mano, “Digital Design”, 5Th Edition, Prentice Hall, 2013 

2) R.P.Jain, “Modern Digital Electronics”, 3rd Edition, Tata Mc Graw Hill, 2003. 3) Bignell and Donovan, “Digital Electronics”, 5th Edition, Thomson Publication,  2007. 

BCA105T: DISCRETE MATHEMATICS 

Total Teaching Hours: 65 No of Hours / Week: 05 Unit – I 

Sets, Relations and Functions: Sets, Subsets, Equal Sets, Universal Sets, Finite and  Infinite Sets, Operation on Sets, Union, Intersection and Complements of Sets, Cartesian  Product, Cardinality of Set, De-mogan’s law, Simple Applications. Relations, Properties  of Relations, Equivalence Relation, Function: Domain and Range, Onto, Into, One to  One, one to many Functions, Composite and Inverse Functions. Mathematical Logic:  Proposition and truth values, Logical Connectives and their truth tables, Converse,  Inverse and Contrapositive, Tautology and Contradiction, Logical Equivalence – Standard Theorems, Switching Circuits. 

[ 13 Hours ] 

Unit - II 

Matrices: Review of fundamentals: Definition of matrix, order, Types of matrices: zero,  row, column, square, diagonal, scalar, unit, symmetric, skew-symmetric. Determinant:  Value of determinant of order 2x2, 3x3, minors, cofactors, adjoint, inverse of a matrix.  Solutions of linear equations: Cramers rule and matrix method involving two and three  variables. Eigen values and Eigenvectors: Characteristic equation, characteristic roots,  characteristic vectors (without any theorems) only 2x2 order. Cayley Hamilton theorem.  (Only statement), verification of Cayley Hamilton theorem (only 2x2 matrices), using the  same finding the powers of A (A4, A5, A-1, A-2), Inverse of a Matrix using Cayley Hamilton theorem. 

[ 13 Hours ] 

Unit - III 

Logarithms: Definition of Logarithm, Indices leading to Logarithms and vice versa, Laws  of Logarithms with proofs, Problems, Common Logarithm: Characteristic and Mantissa,  Use of Logarithmic Tables, Problems. Permutation and Combination: Fundamental  Principle of Counting, Factorial n, Permutations: Definition, Examples, Derivation of  Formula nPr, Permutation when all the objects are not distinct, Problems, Combinations:  Definition, examples, Proving nCr = nPr r!, nCr = nCn-r, nCr + nCr-1 = n+1Cr , Problems  based on above formulae. 

[ 13 Hours ] 

Unit - IV 

Groups: Binary operation, Define of group, properties (only statement), problems (both  finite and infinite groups), subgroup, theorems (no proof), problems. Vectors: Definition  of vector and scalar, vector addition, dot and cross product, projection of a vector on the  other (no geometrical meaning), area of parallelogram, area of a triangle, scalar triple  product, volume of parallelepiped, co planarity of three vectors, vector triple product. 

[ 13 Hours ]

Page 10 of 38 

Unit - V 

Analytical Geometry in Two Dimensions: Coordinates, Distance formula, Section  Formula, Area of the Triangle formula (no derivation), Locus of point. Straight Line:  Slope of a line and angle between two lines, Various forms of equations of lines – Derivation and Problems. Equation of family of lines passing through the point of  intersection of two lines, Distance of a point from line (only problems). 

[ 13 Hours ] 

Text Books  

  1. Grewal, B.S.Higher engineering Mathematings, 36th Edition 

Reference Books 

  1. Satyrs S.S, Engineering Mathematics. 

  2. Peter V.O’Neil. Advanced Engineering Mathematics, 5th Edition. 

BCA103P: C PROGRAMMING LAB 

PART – A 

1) Write a C Program to find the roots of the given quadratic equation using if-else if  statement. 

2) Write a menu driven C program using switch-case to find: (a) Sum of the digits of  number (b) Factorial of N.  

3) Write a C program to find cos (x) using series cos(x) = 1 – x2/2! + x4/4! - ………xn/n! ] 

4) Write a Program to find whether a given number is prime number are not 5) Write a C program to arrange the given set of numbers in ascending and  descending order. 

6) Write a C program to find product of two N x M matrices. 

7) Write a C program to calculate NCR= N!/ R! * (N-R)! Using function. 8) Write a C program to display Fibonacci series using recursive function. 9) Write a C program to concatenate two strings using pointers. 

10) Write a C program to copy content of one file to another file. 

PART – B 

During practical examination the External and Internal examiners may prepare exam  question paper related to theory syllabus apart from Part-A. (A minimum of 10  Programs has to be prepared). 

Note :  

  1. a) The candidate has to write both the programs One from Part-A and other from  Part-B and execute one program as of External examiner choice. 

  2. b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in  the Practical Record. 

  3. c) Scheme of Evaluation is as follows: 

Writing two programs - 10 Marks 

Execution of one program - 10 Marks  

Formatting the Output - 05 Marks 

Viva - 05 Marks 

Record - 05 Marks 

Total - 35 Marks 

BCA104P: DIGITAL ELECTRONICS LAB 

  1. Study of Logic Gates–AND, OR, NOT, NAND, NOR XOR 

(Using respective ICs) 

  1. Realization of AND, OR and NOT gates using Universal Gates.

Page 11 of 38 

  1. Design and Realization of Half Adder/Subtracted using NAND Gates. 4. Design and Realization of Full Adder using Logic Gates. 

  2. Design and Realization of 4 bit Adder/Subtractor using IC 7483. 6. Design and Realization of BCD Adder using IC 7483. 

  3. Realization of J-K flip flop using IC 7400 and 7410. 

  4. Realization of T and D flip flop using IC 7476. 

  5. Implementation of PIPO Shift Registers using flip flops. (IC 7476). 10. Design and implementation of odd and even parity checker Generator using  IC 74180.  

PART – B 

During practical examination the External and Internal examiners may prepare exam  question paper related to theory syllabus apart from Part-A. (A minimum of 10  Programs has to be prepared). 

Note :  

  1. a) The candidate has to write both the programs One from Part-A and other from  Part-B and execute one program as of External examiner choice. 

  2. b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in  the Practical Record. 

  3. c) Scheme of Evaluation is as follows: 

Writing two programs - 10 Marks 

Execution of one program - 10 Marks  

Formatting the Output - 05 Marks 

Viva - 05 Marks 

Record - 05 Marks 

Total - 35 Marks 

Book Now For Free Classes

Get It Now

Bangalore University Study Materials

Bangalore Central University 5th Sem BBA Study Materials and Previous year Question paper

Bangalore Central University 5thSem BBA Study Materials

Join WhatsApp Group For BBA Study Materials

Chaloexam Banner Book Now

Bangalore Central University 3rd Sem BBA Study Materials and Previous year Question paper

Bangalore Central University 3rd Sem BBA Study Materials

Join WhatsApp Group For BBA Study Materials

Financial Accounting BBA ChaloExam

Bangalore Central University BBA 1st sem Study Material

Book Free Classes

Bangalore University 1st Sem BBA Study Materials (New Syllabus)

Accounting for Business
Enterprises Management
Corporate Regulations
Production and Inventory Management BBA ChaloExam
Business Mathematics and Logical Reasoning

Bangalore University and Bangalore North University BBA syllabus 2021

Bangalore University 1st Sem BBA Study Materials (Old Syllabus)

Financial Accounting BBA ChaloExam
Fundamentals of Accounting
Quantitative Methods for Business – II BBA ChaloExam
Business Organization and Environment
Organizational Behavior BBA ChaloExam
Quantitative Methods for Business - I
Management Process

Book Now For Free Classes

Get It Now