II BCA

Title of the
Course/

Paper - VI -

MICROPROCESSORS AND ITS

APPLICATIONS

Core

II Year & Third

Credit: 4
Semester
Objective of This course introduces the fundamental concepts of Microprocessors.
the course
Course
Unit 1: Introduction to microcomputers-microprocessor and assembly
outline
languages-microprocessor architecture and its operations-8085 MPU-8085
instruction set and classifications
Unit 2: Writing assembly level programs-programming techniques such as
looping-counting and indexing addressing modes-data transfer instructionsarithmetic and logic operations-dynamic debugging
Unit 3:Counters and time delays-hexadecimal counter modulo 10 counterpulse timings for flashing lights-debugging counter and time delay
program-stack-subroutine-conditional call and return instructions
Unit 4:BCD to binary and binary to BCD conversions-BCD to HEX and
HEX to BCD conversions-ASCII to BCD to ASCII conversions-BCD to
seven segment LED code conversions-binary to ASCII and ASCII to binary
conversions-multi byte addition-multi byte subtraction-BCD addition-BCD
subtraction-multiplication and division
Unit 5:Interrupt-implementing interrupts-multiple interrupt 8085-trapproblems on implementing 8085 interrupt-DMA memory interfaces-RAM
& ROM I/O interface-direct I/O memory mapped I/O.
Recommended Texts
i. R.S.Ganokar-1990-Microprocessor architecture-Programming and Application with
8085/8080A-Wiley Eastern Limited.
ii. A.Mathur-1993-Introduction to Microprocessor-3rd Edition-Tata McGraw Hill.

Title of the
Course/

Paper V

Core

II Year & Third

Credit: 4
Semester
This course introduces the basic concepts of programming in C++ and
Data Structures
Unit 1: Introduction to C++; Tokens, Keywords, Identifiers, Variables,
Operators, Manipulators, Expressions and Control Structures in C++;
Pointers - Functions in C++ - Main Function - Function Prototyping Parameters Passing in Functions - Values Return by Functions - Inline
Functions - Friend and Virtual Functions
Unit-2: Classes and Objects; Constructors and Destructors; and Operator
Overloading and Type Conversions - Type of Constructors - Function
overloading. Inheritance : Single Inheritance - Multilevel Inheritance Multiple Inheritance - Hierarchical Inheritance - Hybrid Inheritance.
Pointers, Virtual Functions and Polymorphism; Managing Console I/O
operations.
Unit 3: Working with Files: Classes for File Stream Operations Opening and Closing a File - End-of-File Deduction - File Pointers Updating a File - Error Handling during File Operations - Command-line
Arguments. Data Structures: Definition of a Data structure - primitive
and composite Data Types, Asymptotic notations, Arrays, Operations on
Arrays, Order lists.
Unit-4: Stacks - Applications of Stack - Infix to Postfix Conversion,
Recursion, Maze Problems - Queues - Operations on Queues, Queue
Applications, Circular Queue. Singly Linked List - Operations,
Application - Representation of a Polynomial, Polynomial Addition;
Doubly Linked List - Operations, Applications.
Unit-5 : Trees and Graphs: Binary Trees - Conversion of Forest to Binary
Tree, Operations - Tree Traversals; Graph - Definition, Types of Graphs,
Hashing Tables and Hashing Functions, Traversal - Shortest Path;
Dijkstra's Algorithm.

Objective of
the course
Course
outline

PROGRAMMING IN C++ AND DATA

STRUCTURES

1. Recommended Texts
i. E. Balagurusamy,1995,Object Oriented Programming with C++, Tata McGraw-Hill
Publishing Company Ltd.
ii..E.Horowitz and S.Shani,1999,Fundamentals of Data Structures in C++ , Galgotia Pub.
2.Reference Books
i. Robert Lafore, Object Oriented Programming in Microsoft C++, Galgotia publication.
ii.. H.Schildt, C++,1998,The Complete Reference-1998-TMH Edition, 1998
iii.R. Kruse C.L. Tondo and B. Leung ,1997, Data Structures and Program design in C,
PHI.
iv.Cangsam,Auguenstein,Tenenbaum,Data Structures using C & C++,PHI
v. D.Samantha,2005, Classic Data Structures, PHI,New Delhi.

Paper - VIII Practical III

PROGRAMMING IN C++ USING DATA
STRUCTURES
Credit: 3
This course deals with practical implementation of Data Structure using
C++.
1. Implement PUSH, POP operations of stack using Arrays.
2. Implement PUSH, POP operations of stack using Pointers.
3. Implement add, delete operations of a queue using Arrays.
4. Implement add, delete operations of a queue using Pointers.
5. Conversion of infix to postfix using stack operations
6. Postfix Expression Evaluation.
7. Addition of two polynomials using Arrays and Pointers.
8. Creation, insertion, and deletion in doubly linked list.
9. Binary tree traversals (in-order, pre-order, and post-order) using linked
list.
10.Depth First Search and Breadth first Search for Graphs using
Recursion.