Best Coaching Classes in Pune for B.C.A. - Science (BCA)

Enquire Now


Enrolled Students


IT Courses


Professional Trainers






Best Coaching Classes in Pune for B.C.A. - Science (BCA)

ProIT Academy is one of the best coaching classes for B.C.A. – Science (BCA) in Pune. We are #1 leading institute providing not only coaching but hand-holding experience for all subjects in B.C.A. – Science (BCA)
under SPPU as well Autonomous Universities and Colleges.

BCA (Bachelor of Computer Applications) programme is a popular undergraduate education program for those interested in a career in information technology (IT). Due to the growing demand for IT professionals, a BCA degree has become a desirable curriculum for individuals with an interest in Database Management, Programming, and Software Development.  In-depth coverage of computer applications and software development is provided throughout the three-year BCA degree. However, one needs expert coaching and training to succeed in the world of computer applications.

Completing this course will help you:

Why choose PRO IT Academy for BCA Coaching?

PRO IT Academy is a leading coaching institute that provides excellent coaching for BCA. Here are some of the reasons why PRO IT Academy is a perfect choice for BCA coaching classes in Pune.

Experienced and Qualified Faculty

The faculty of PRO IT Academy is made up of highly skilled professionals who are experts in their fields. They’ve coached and mentored students in the area of computer applications for many years. The PRO IT Academy’s trainers make learning enjoyable and engaging by utilising cutting-edge teaching strategies.

Comprehensive Course Curriculum

PRO IT Academy course curriculum is created to give students a thorough understanding of the most recent advances in Software Development. The curriculum covers several areas of Computer Applications, such as Programming languages (C, C++, Python, Java, etc.,), Database Management, Software Development and Web Design. The BCA course content is regularly updated to keep up with the latest trends in the industry.

State-of-the-Art Infrastructure

The PRO IT Academy is equipped with the most recent technology, including computer labs that are fully functional and modern classrooms. Students can gain practical experience in software development due to the labs’ latest hardware and software.

Online BCA 

BCA Classes online are getting more and more well-liked because of how flexible and convenient they are. When attending BCA classes online, students can access the BCA course content from any place, work at their own pace, and interact virtually with classmates and our instructors. Additionally, PRO IT Academy offers online BCA classes to students, giving them the chance to complete projects and virtual labs to obtain real-world experience.

Placement Assistance

PRO IT Academy provides placement assistance to its students. A dedicated placement cell at the institute helps students find relevant employment openings at reputable businesses. To help students get ready for job interviews, the placement cell also holds mock interviews, group discussions, and personality development programs.

In addition to the above-mentioned benefits, PRO IT Academy offers students the chance to acquire practical experience through internships and industry projects. Students can better connect theory to practice with the support of this hands-on training. The institute also gives each student personalized attention and flexible class timings to support their academic goals.

Do you think getting trained in such a way to apply for these jobs?

What can a student do after BCA?

After completing BCA, students can opt for various career paths. Following are some of the most sought-after careers for BCA graduates: 

Software Developer

One of the most sought-after careers for BCA graduates is in the field of software development. The creation and construction of software applications is done by Software Developers using programming languages and software development tools.

Web Designer

Web designing is another popular career option for BCA graduates. Websites are designed and developed by web designers using tools like HTML, CSS, and others.

Database Administrator

A database administrator manages, keeps current with, and secures an organization’s databases.

System Analyst

System analysts analyse an organization’s computer systems and processes and suggest improvements to enhance their performance.

In addition to the popular career options mentioned earlier, BCA graduates can also pursue careers in Cybersecurity, Data Science, Artificial Intelligence (AI), Machine Learning (ML), and Internet of Things (IoT), Mobile Application development, and Game Development. These fields are currently in high demand and offer lucrative job opportunities.

Moreover, Graduates of BCA programs can also start their own software development or IT consulting businesses. Starting a business requires an entrepreneurial mindset, strong communication skills, and the ability to market and sell services.

What is the scope of BCA?

The scope of BCA is vast and promising. As technology is employed increasingly often across a range of businesses, there is an increasing demand for Computer Application specialists. BCA graduates can work in various industries, such as Software Development, E-Commerce, Finance, Healthcare, and Education. Moreover, BCA graduates can pursue higher education in computer applications, such as MCA, MBA, and PhD.

The BCA is recommended for students who intend to work in the field of Computer Applications and Information Technology. PRO IT Academy is an ideal coaching institute for BCA classes in Pune, that provides comprehensive coaching and training to its students.  PRO IT Academy offers placement aid, a broad course curriculum, cutting-edge infrastructure, and knowledgeable faculty.  The scope of BCA is vast and promising, with job opportunities in various industries and the potential to become successful entrepreneurs.

Coaching Offered

Do you want to become eligible for these jobs?

Play Video

course structure


Fundamentals of Computer:BCA111& BCA115

Duration: 1 – 2 Months


•         None

Course Objectives:

•         To study the basics of Computer System

•         To learn how to configure computer devices

•         To Learn Basic Commands of Operating system and application software

•         To understand Open Source Software

Course Outcomes:

•         At the end of the course, students will be able to

•         Define working of computers and peripherals, types of software and languages

•         Troubleshoot the computer systems and use utility software

•         Choose commands and features of operating systems and application software

•        Use open source software


UNIT I                     Introduction to Computer System

Introduction– Characteristics of Computers, Basic structure and operation of a computer, functional units and their interaction, Types of computers and features- Mini Computers, Micro Computers, Mainframe Computers, Super Computers, Laptops and Tablets

Types of Programming Languages– Machine Languages, Assembly Languages, High Level Languages Translators– Assembler, Compiler, Interpreter

Data Organization– Drives, Directories and Files

Number Systems – Introduction to Binary, Octal, Hexadecimal system, Conversion, Addition, Subtraction, Multiplication, Division

UNIT II                 Computer Peripherals

Primary storage devices – RAM, ROM, PROM, EPROM

Secondary Storage Devices – HDD, CD, DVD, Pen drive

I/O Devices– Keyboards, Scanners, Digitizers, Plotters, LCD, Plasma Display,

Pointing Devices –Mouse, Joystick, Touch Screens

Introduction to Network devices – Hubs, Switches, Routers, NAS, MODEM, Access Points

UNIT III              Computer Software

Types of software: System Software, Application Software.

System Software: Operating System. Types of O.S., Basic Commands in Linux – ls, pwd

Introduction to GUI: Desktop Icons, File and Directory structure, Menu Items, ControlPanel, File and Directory Search

Utility programs: Anti-plagiarism software, Anti-virus, Disk Cleaning, Defragmentation,Compression/Decompression of files. Application software: Examples of commercial software with brief introduction

UNIT IV                Editors, Word Processors, Spreadsheets & Presentation Tools

Editors and Word Processors: Features and functionalities, examples of basic andadvanced editors like notepad, vi and Emacs, Introduction to desktop publishing –Features and functionalities

Spreadsheets: Features and functionalities, Spreadsheet Applications

Introduction to Google Apps: Google Docs, Sheets and Forms and its applications

Presentation Tools: Design Slides (using Text, images, charts, clipart), Slide Animation,

Template and theme creation

UNIT V                   Open Source Software

Introduction: Open Source, Free Software, Free Software vs. Open Source software,Public Domain Software, Problems with traditional commercial software, Open SourceDevelopment Model and Licenses, History, Initiatives, Principles, methodologies andPhilosophy

Open Source Operating Systems: GNU/Linux, Android, Free BSD, Open Solaris. Technologies, Development tools, IDEs, LAMP

Example Open Source Projects: Apache web server, GNU/Linux, Android, Mozilla

(Firefox), Wikipedia, Drupal, WordPress, GCC, github, Open Office.

UNIT VI                PC Hardware & Trouble Shooting

Introduction to Computer Hardware – Motherboard, CPU, Basic Input and Output Setting(BIOS), Network Interface Card (NIC), Graphics card

Logical Fault Isolation – ADJUST method, Common Networking Problems, Tools forgathering information, Troubleshooting PC hardware


Problem Solving and C Programming: BCA112 & BCA116

Duration: 1 – 2 Months


•         None

Course Objectives:

•      To provide a broad overview of problem solving techniques

•      To learn C programming to solve problems

Course Outcomes:

•         Define algorithms and explain their characteristics

•         Formulate algorithm and draw flow chart to solve a given problem

•         Explain use of appropriate data types, control statements

•        Demonstrate ability to use top-down program design

UNIT I                     Problem solving, algorithms and flowcharts

Types of Problems, Problem solving using computer, Difficulties with problem solving, Problem solving aspects.

Definition  &  Characteristics  of  algorithm,  Examples  of  algorithms,  Flow  charts  with

Examples, Top-down design

Problem   solving   using   Arithmetic   Statements,   Conditional   Statement   &   Iterative

Statements such as Addition/Multiplication, check number is positive/negative, Maximum of2 numbers & 3 numbers, sum of first n numbers, sum of given n numbers, reverse digits of a number, check whether the number is palindrome, check number is prime, factorial of number, factors of number, GCD, LCM of numbers etc.

UNIT II                 C Fundamentals

Introduction to C, Features of C, Structure of C Program, C Character Set, Identifiers and

Keywords, Variables and constants

Data types- Basic data types, Enumerated types, Type casting, Declarations, Expressions

Operators and Expressions Unary and Binary arithmetic operators, Increment Decrement operators

Relational and logical operators, Bit wise operators, Assignment operators, Comma operator, size of operator, Ternary conditional operator, Precedence and associativity

UNIT III              Input Output Statements

printf, scanf functions, getchar, putchar, getch functions, gets, puts functions, Escape sequence characters, Format specifiers

UNIT IV               Control & Iterative Structures

If, If- Else Statements, Nested If Statements, Conditional Branching – switch statement,Loop (while, do…while, for), break, continue, goto statements

UNIT V                  Functions

Introduction to Functions, Function Arguments, Library & User defined functions,Methods for parameter passing, Recursion, Storage Classes – Auto, Static, Global andRegister

UNIT VI               Arrays

Introduction, Array Declarations, Bounds Checking, Single dimension Arrays, Two dimension Arrays, Arrays & Function



Computer Organization:BCA121 & BCA125

Duration: 1 – 2 Months


•         BCA111 Fundamentals of Computer

Course Objectives:

To study number system, logic gates

To understand combinational and sequential circuits

To provide a broad overview of architecture and functioning of computer systems

To learn the basic concepts behind the architecture and organization of computers

Course Outcomes:

On completion of the course, student will be able to–

Design of combinational circuits

Design of sequential circuits

Explain block diagram of CPU, Memory and types of I/O transfers


UNIT I                     Data representation and Computers Arithmetic

Review of Decimal, Binary, Octal, Hexadecimal Number system and their inter-conversion,BCD code, Gray code, Excess-3 code, ASCII , EBCDIC, Unicode, Concept of parity code.Signed and Unsigned numbers, 1’s and 2’s complement of binary numbers, Binary arithmetic(Addition, subtraction and subtraction using1’s complement and 2’s complement)

UNIT II                  Boolean Algebra & Logic Gates

Introduction, Logic (AND OR NOT), Boolean theorems, Boolean Laws, De Morgan’s Theorem,Reduction of Logic expression using Boolean Algebra, Deriving Boolean expression from givencircuit, exclusive OR and Exclusive NOR gates, Universal Logic gates, Implementation of other

gates using universal gatesMinterm, Maxterm and KarnaughMaps:Introduction, minterms and sum of minterm form, maxterm and Product of maxterm form,

Reduction technique using Karnaugh maps – 2/3/4 variable K-maps, Grouping of variables in

K-maps, K-maps for product of sum form, minimize Boolean expression using K-map and

obtain K-map from Boolean expression

UNIT III              Combinational Circuits

Introduction – Multi-input, multi-output Combinational circuits, Code converters design and


Arithmetic Circuits: Introduction, Adder, BCD Adder, Excess – 3 Adder, Binary Subtractors,

BCD Subtractor, Multiplier, Comparator

Multiplexer, Demultiplexer, ALU, Encoder and Decoder: Introduction, Multiplexer, Demultiplexer, Decoder, ALU, Encoders

UNIT IV                Sequential circuits

Introduction, Terminologies used, S-R flip-flop, D flip-flop, JK flip-flop, Race-around condition,Master – slave JK flip-flop, T flip-flop, conversion from one type of flip-flop to another,Application of flip-flops.


Introduction, Asynchronous counter, Terms related to counters, IC7493 (4-bit binary counter),Synchronous counter, Bushing, Type T Design, Type JK Design, Pre-settable counter, IC 7490,IC 7492,Synchronous counter ICs, Analysis of counter circuits.

Shift Register:

Introduction, parallel and shift registers, Ring counter, Johnson counter


UNIT V                   CPU, Memory and I/O Organization

Block diagram of CPU, functions of CPU, general register organization, flags, Concept of RISCand CISC, Introduction to hardwired and micro-programmed CPU.Memory System hierarchy, Cache Memory, Internal Memory, External Memory, Concept ofVirtual Memory.Input/ Output: types of I/O data transfers – CPU initiated, interrupt initiated and DMA, Need ofI/O interfaces, Parallel and serial communication (asynchronous and synchronous datatransfer).

UNIT VI                Introduction to Microprocessors and Microcontrollers

Block diagram of Pentium, Functional units, Concept of pipeline and parallelism, ProgrammersmodelIntroduction to Microcontroller Intel 8051 – Functional block diagram, Introduction to multi-coreprocessors


Advance C Programming: BCA122 & BCA126

Duration: 1 – 2 Months


•        BCA112: Problem Solving and C Programming

Course Objectives:

•         To learn advanced features in C Programming

•         To study advanced data types

•         To understand built-in library functions

Course Outcomes:

•         On completion of the course, student will be able to–

•         Write programs using pointers, structures and unions

•         Use Pre-processor directives

•         Manipulate strings using library functions

•        Write programs to perform operations on Files

UNIT I                     Preprocessor

Concept, Format of preprocessor directives, File inclusion directives (#include), Macrosubstitution directives (#define), nested macros, parameterized macros,Macros versus functions, #error / #pragma directives, Conditional compilation(#if/#ifdef/#else/#elif/#endif), Predefined macros (_DATE_ / _TIME_ /_FILE_ /_LINE_/_STDC_ )

UNIT II                  Pointers

Concept – reference & dereference, Declaration, definition, initialization & use, Types ofpointers,

Pointer Arithmetic, Multiple indirection,parameter passing – call by value and call by referenceArrays & Pointers – Pointer to array, Array of pointers,Functions & pointers – Passing pointer to function, Returning pointer from function,Function pointer, Pointers &constDynamic memory management, Allocation, Resizing, Releasing, Memory leak / danglingpointers

UNIT III              Strings

Concept, Declaration, definition, initialization, format specifiers, String literals/ constants &variables – reading & writing from & to console, Importance of terminating NULL character,Strings & pointersArray of strings & array of character pointers, User defined functions, predefined functionsin string.h – strlen , strcpy , strcat , strcmp , strcmpi , strrev , strlwr , strupr , strset , strchr ,strrchr , strstr , strncpy , strncat , strncmp , strncmpi , strnset , strtok, Command linearguments – argc and argv

UNIT IV                Structures

Concept, Declaration, definition, initialization, accessing structure members ( . operator),Array of structures, Pointers to structures, Declaring pointer to structureAccessing structure members via pointer to structure, Structures & functions,Passing each member of structure as a separate argument, Passing structure by value /addressNested structures, typedef& structures,

UNIT V                   Advanced Features

Unions – Concept, Declaration, definition, accessing union members, Difference betweenStructures & unions, structures within union, union within structures, pointers and unions,nested unions, enumerated data types, Bit fields, Concept, need, use, multi-file programs

UNIT VI                File Handling

Concept of streams, need, Types of files, Operations on text & binary files, Randomaccess file, library functions for file handling – fopen, fclose, fgetc, fseek, fgets, fputcetc


Operating System Concepts: BCA123 & BCA127

Duration: 1 – 2 Months


· BCA111: Fundamentals of Computers

Course Objectives:

· To Understand the basic concepts of operating system

·To study Architecture, File systems and basic operating system commands

· To Use of editors and Networking commands.

· To learn Shell Programming and shell scripts.

Course Outcomes:

On completion of the course, student will be able to–

· explain basic concepts of operating system

· use basic Linux commands and Linux documentation

· write shell scripts

UNIT I                     Introduction

Introduction to Operating Systems, Different services provided by Operating System toUsers.

Introduce the concept of Process, Process States, Process Control Block, User Interface,System Calls.

Introduction to Linux Operating System – Features of Linux, Architecture of the Linux,

Introduction to File System and Process Environment.

Working with Linux – The login prompt, General features of commands/ commandstructure, Command arguments and options.

Understanding of some basic commands such as echo, printf, ls, who, date, passwd, cal,Combining commands

UNIT II                  Commands & Processes

What is a Command?, Meaning of Internal and external commands, The type command:knowing the type of a command and locating it, The man command knowing more aboutcommands and using Linux online manual pages. The man with keyword option and whatisOperating system Processes – Concept, Mechanism of process creation, Parent and childprocess, The ps command with its options, Executing a command at a specified point oftime: at command.

The nice command, Background processes. The bg and fg commands, The kill command,The find command with illustrative example.

UNIT III              File System

Linux files – Naming files. Basic file types,

Organization of files. Standard directories, Parent child relationship, The home directoryand the HOME variable.

The PATH variable, manipulating the PATH, Relative and absolute pathnames, Directorycommands – pwd, cd, mkdir, rmdir commands, The dot (.) and double dots (..) notations torepresent present and parent directories and their usage in relative path namesFile related commands – cat, mv, rm, cp, wc and od commands, File attributes andpermissions and knowing them, The ls command with options, Changing file permissions:the relative and absolute permissions changing methodsstrrchr , strstr , strncpy , strncat , strncmp , strncmpi , strnset , strtok, Command linearguments – argc and argv

UNIT IV                Using Shells and Vi Editor

What is Shell? Different types of shells, The shells interpretive cycle, Wild cards and filename generation, Removing the special meanings of wild cards, Three standard files andredirection,Connecting commands: Pipe, The grep, egrep commands. .

Vi Editor – Introduction to the Vi editor, Different ways of invoking and quitting vi, Differentmodes of vi, Input mode commands, Command mode commands, The ex modecommands, Illustrative examples Navigation commands

UNIT V                   Security & Networking

Security Understanding Linux Security, Uses of root, pseudo command, working withpasswords, Bypassing user authentication, Understanding ssh

Networking Basic introduction to Networking, Network protocols: http, ftp etc., IP address,DNS

UNIT VI                Shell Scripts

Shell programming – Ordinary and environment variables, The .profile. Read and read onlycommands, Command line arguments, exit and exit status of a command, Logicaloperators for conditional execution, The test command and its shortcut.

The if, while, for and case control statements, The set and shift commands and handlingpositional parameters, The here ( << ) document and trap command, Simple shell program


File inodes and the inode structure, File links – hard and soft links. Filters, Head and tailcommands.

Cut and paste commands, The sort command and its usage with different options


Database Management System – I: BCA124 & BCA128

Duration: 1 – 2 Months


· Applied Mathematics

Course Objectives:

·  To understand the fundamental concepts of database management such as

·  database design, database languages, and database-system implementation

·  To study and understand systematic database design approaches

·  To learn SQL – the database Query language

Course Outcomes:

On completion of the course, student will be able to–

• Design E-R Model for given requirements and convert the same into database

• Tables.

• Formulate database queries using SQL

• Design a database in appropriate normal form

UNIT I                     File Organization

Introduction, Physical / logical files, Record organization (fixed, variable length)Types of file organization(heap, sorted, indexed, hashed)Combining commands

UNIT II                  Introduction of DBMS

Overview, File system Vs. DBMS, Describing & storing data (Data models – relational,hierarchical, network), Levels of abstraction, Data independence, Structure of DBMS,Users of DBMS, Advantages of DBMS

UNIT III              Conceptual Design (E-R model)

Overview of DB design

ER data model (entities, attributes, entity sets, relations, relationship sets)Additional constraints (key constraints, participation constraints, weak entities, aggregation/ generalization), Case studies

UNIT IV                Structure of Relational Databases

Concepts of a table, a row, a relation, a tuple and a key in a relational databaseConversion of ER to Relational modelIntegrity constraints (primary key, referential integrity, Null constraint, unique constraint,check constraint)

UNIT V                   SQL

Introduction, DDL commands (create, drop, alter) with examples, Basic structure of SQLquery, Set operations, Aggregate functions, Null values, Nested Sub-queries,Modifications to Database (insert, delete, update),SQL mechanisms for joining relations (inner joins, outer joins and their types)

Examples on SQL (case studies)

UNIT VI                Relational Database Design

Pitfalls in Relational-Database Design (undesirable properties of a RDB design likerepetition, inability to represent certain information)Functional dependencies (Basic concepts, Closure of set of functional dependencies,Closure of an Attribute set)Concept of a Super Key and a primary key (Algorithm to derive a Primary Key for arelation)Concept of Decomposition, Desirable Properties of Decomposition (Lossless join andDependency preservation)Concept of Normalization – Normal forms (only definitions) 1NF, 2NF, 3NF, BCNF

Examples on Normalization



Data Structures:BCA231 & BCA234

Duration: 1 – 2 Months


·         BCA112 & BCA122

Course Objectives:

·         To understand algorithms and analysis of algorithms

·         To learn static and dynamic data structures.

Course Outcomes:

·         Apply appropriate data structures for the given problem.

·         Design an efficient algorithm for the given problem.

·         Determine the time and space complexity of a given algorithm.


UNIT I                     Introduction to data structure

·         Data types and data objects

·         Abstract Data Types (ADT)

·         Data structure

·         Algorithm analysis: Frequency counts, Space and Time complexity,

·         Asymptotic notation : BigO, Omega (Ω)

·         Algorithms and its complexity using simple example algorithms

UNIT II                  Arrays

·         Introduction and definition

·         Matrix representation using arrays: Row and column major, operations on

·         matrices, Sparse Matrix

·         Sorting techniques with time complexity: Bubble sort, Insertion sort,

·         Merge sort, Quick sort

·         Searching techniques with time Complexity: Linear search, Binary search

UNIT III              Linked Lists

·         Introduction and Definition

·         Representation: Static &Dynamic

·         Types of linked lists: singly, doubly, circular

·         Operations on link list: create, display, insert, delete, reverse, search, sort,

·         concatenation, Merge

·         Real world applications of Link list (implementation not expected)

UNIT IV                Stacks and Queues

·         Representation of Stack: Using arrays and Linked Lists

·         Operations on stack: push, pop

·         Applications of Stack : Recursion, Infix to postfix, postfix to infix

·         Representation of Queues : Static & Dynamic

·         Operations on queue: insert, delete

·         Types of queue: Circular queue and Priority queue

·         Real world Applications of queue (Implementation not expected)

UNIT V                   Trees

·         Introduction and Tree terminologies: Definitions: Tree, root, child, leaf, level,

·         height, depth

·         Binary trees: Types: Rooted, full, complete and skewed.

·         Representation of Trees: Using arrays and Linked Lists

·         Types of Traversal: Preorder, Inorder, Postorder, Applications of Binary trees

·         Binary Search Tree (BST): Introduction and definition

UNIT VI                Graphs

·         Introduction and Graph terminologies

·         Representation of a Graph – Adjacency matrix, Adjacency list, Adjacency multi-list

·         Graph Traversals – DFS, BFS

·         Applications of graphs – Topological sort

Database Management Systems II: BCA232 & BCA235

Duration: 1 – 2 Months


·         BCA124

Course Objectives:

·         To understand advanced SQL features and procedural SQL.

·         To study concurrency control and crash recovery techniques.

·         To understand need of database security.

·         To learn different database system architectures.

Course Outcomes:

·         Formulate SQL queries using advanced SQL features.

·         Perform Database operations using PL/PostgreSQL.

·         Compare and contrast different concurrency control and recovery techniques.

·         Apply mechanisms for database security.

·         Analyze various database system architectures

UNIT I                     Relational Database Design

1.1. PL/Postgre SQL: Language structure

1.2. Controlling the program flow, conditional statements, loops


1.4. Functions

1.5. Handling errors and exceptions

1.6. Cursors

1.7. Triggers

UNIT II                  Transaction Concepts

2.1 Transaction, properties of transaction, states of transactions

2.2 Concurrent execution of transactions and conflicting operations

2.3 Schedules, types of schedules, concept of serializability, precedence graph for serializability

UNIT III              Concurrency Control

3.1 Ensuring serializability by locks, different lock modes

3.2 2PLand its variations

3.3 Multiple Granularity locking protocol

3.4 Basic timestamp method for concurrency, Thomas Write Rule

3.5 Locks with multiple granularity, dynamic database concurrency (Phantom Problem)

3.6 Timestamps versus locking

3.7 Optimistic concurrency control algorithm, multi version concurrency control

3.8 Deadlock handling methods –

 3.8.1 Detection and Recovery (Wait for graph).

 3.8.2 Prevention algorithms (Wound-wait, Wait-die)

 3.8.3 Deadlock recovery techniques(Selection of Victim, Starvation, Rollback)

UNIT IV                Crash Recovery

4.1 Transaction Failure classification

4.2 Recovery concepts

4.3 Checkpoints

4.4 Recovery with concurrent transactions (Rollback, checkpoints, commit)

4.5 Log base recovery techniques (Deferred and Immediate update)

4.6 Buffer Management

4.7 Database backup and recovery from catastrophic failures

4.8 Shadow paging

UNIT V                   Database Security

5.1 Introduction to database security concepts

5.2 Methods for database security

5.3 Discretionary access control method

5.4 Mandatory access control and role based access control for multilevel security

5.5 Use of views in security enforcement

5.6 Overview of encryption technique for security

5.7 Statistical database security

UNIT VI                Database System Architectures

6.1 Centralized and Client – Server Architectures

6.2 Server System Architectures

6.3 Introduction to Parallel Systems

6.4 Introduction to Distributed Systems

6.5 Introduction to Object Based Databases


Computer Networks: BCA236

Duration: 1 – 2 Months


·         BCA111 & BCA121

Course Objectives:

·         To understand the fundamental concepts of networking standards, protocols and technologies.

·         To study different techniques for framing, error control, flow control and routing.

·         To learn role of protocols at various layers in the protocol stacks.

·         To develop an understanding of modern network architectures from a design and performance

·         perspective

Course Outcomes:

·         Analyze the requirements for a given organization and select appropriate network architecture,

·         topologies, transmission mediums and technologies.

·         Analyze data flow between TCP/IP model using Application, Transport and Network Layer

·         Protocols.

·         Illustrate applications of Computer Network.

·         Compare and contrast different routing and switching algorithms

UNIT I                     Introduction to Data CommunicationsComputer Networks

1.1 Data communications, Characteristics of Data Communication

1.2 Components of Data communication

1.3 Data Representation – Text, Numbers, Images, Audio, Video

1.4 Types of Data flow – Simplex, Half Duplex, Full Duplex

1.5 Computer Networks applications –Business Application, Home Application, Mobile User

1.6 Broadcast and point-to-point networks

1.7 Network Topologies – Bus, Star, Ring, Mesh

1.8 Network Types- LAN, MAN, WAN, PAN, Wireless Networks, Home Networks, internetworks

1.9 Protocols and standards – Definition of a Protocol, Protocol standards: De facto and De jure

UNIT II                  Network Models

2.1. OSI Model – layered architecture, peer-to-peer processes, encapsulation

2.2 TCP/IP Model – layers and Protocol Suite

2.3 Addressing-Physical, Logical, Port addresses, Specific addresses

UNIT III              Physical Layer

3.1Analog and Digital data, Analog and Digital signals, Digital Signals-Bit rate, Bit length

3.2 Baseband Transmission, Broadband Transmission

3.3 Transmission Impairments– Attenuation, Distortion and Noise

3.4 Data Rate Limits– Noiseless channel: Nyquist’s bit rate, noisy channel : Shannon’slaw

3.4 Performance of the Network Bandwidth, Throughput, Latency (Delay), Bandwidth – Delay

Product, Jitters

3.4Line Coding Characteristics, Line Coding Schemes–Unipolar -NRZ, Polar-NRZ-I, NRZ-L, RZ,

Manchester and Differential Manchester, Problems

3.5 Transmission Modes, Parallel Transmission and Serial Transmission– Asynchronous and

Synchronous and Isochronous

3.6 Multiplexing FDM and TDM

3.7 Switching-Circuit Switching, Message Switching and Packet Switching.


UNIT IV                Data Link Layer

4.1Framing – Concept, Methods – Character Count, Flag bytes with Byte Stuffing,Starting& ending

Flags with Bit Stuffing

4.2 Error detection code – Hamming Distance, CRC

4.3 Elementary data link protocols – Simplex stop & wait protocol, Simplex protocol for noisy

channel, PPP, HDLC

4.4 Sliding Window Protocols – 1-bit sliding window protocols, Pipelining – Go-Back N and

Selective Repeat

4.5 Random Access Protocols – ALOHA– pure and slotted, CSMA-1- persistent, p-persistent and

non-persistent CSMA/CD,CSMA/CA

4.6 Controlled Access – Reservation, Polling and Token Passing

4.7 Channelization – Definitions – FDMA, TDMA and CDMA

UNIT V                   Network Layer

5.1 IPv4 addresses: Address space, Notation, Classful addressing, Classless

addressing, NAT,

Sub netting, Super netting

5.2 IPv4: Datagram, Fragmentation, checksum, options

5.3 IPv6 addresses: Structure, address space

5.4 IPv6:packet format, Extension headers

UNIT VI                Transport and Application Layer

6.1. Process-to-Process Delivery, Multiplexing and De-multiplexing

6.2. User Datagram Protocol (UDP) – Datagram Format, Checksum, UDP operations, Use

of UDP 6.3. Transmission Control Protocol (TCP) – TCP Services – Process to-Process

Communication, Stream Delivery Service, Sending and Receiving Buffers, Segments, Full

– Duplex Communication, Connection oriented service, Reliable service

6.4. TCP Features – Numbering System, Byte Number, Sequence Number,

Acknowledgement Number, Flow Control, Error Control, Congestion Control

6.5 TCP Segment Format

6.6 TCP Vs UDP

6.6 Domain Name System (DNS) – Distribution of Name Space, DNS in the Internet

6.7 E-MAIL – Architecture, User Agent, Message Transfer Agent – SMTP, Web Based Mail

6.8 WWW – Architecture

6.9 HTTP – HTTP Transaction


Computer Networks and Web Programming Laboratory: BCA236:

Duration: 1 – 2 Months


·         BCA 111

Course Objectives:

·         To use network commands and study network devices and LAN

·         To understand the principles and methodologies of web based applications development process

·         To learn HTML, CSS, Java Scripts, Cookies and XML

Course Outcomes:

·         Use Networking commands, identify network devices and topology

·         Design a website using HTML and CSS.

·         Write java scripts

·         Interpret and formulate XML queries

UNIT I                     Introduction to Web Technologies

1.1 Introduction to Web Technologies

1.2 Website – Working principal

1.3 Software to create websites

1.4 Qualities of a good website

1.5 Client-Server and its Communication

1.6 Client and Server Scripting Languages

1.7 Basic working of the Internet, Internet Protocols (HTTP, FTP, IP)

1.8 World Wide Web (WWW).

1.9 HTTP request message, HTTP response message

1.10 Types of Websites (Static and Dynamic Websites)

UNIT II                  Introduction to HTML

2.1 Introduction to HTML

2.2 HTML tags and attributes

2.3 Working with Elements.

2.4 Inserting Images

2.5 Client Server image mapping

2.6 Lists

2.7 Tables

2.8 Text and Image links

2.9 Frames

2.10 Forms and controls

2.11 Text boxes, buttons – radio & checkbox, List boxes

UNIT III              Introduction to CSS

3.1Introduction to Style Sheets

3.2 Introduction to Responsive Website

3.3 Types of CSS

3.4 CSS Border, margin, Positioning, color, text, link, background, list, table, padding, image,

display properties

3.5 Use of Id & classes in CSS

3.6 Use of &

3.7 Introduction of CSS3 : Gradients, Transitions, Animations, multiple columns

3.8 Introduction of Bootstrap

UNIT IV                Introduction to JavaScript

4.1 Concept of script, Types of Scripts, Introduction to javascript

4.2 Variables, identifier & operator, control structure.

4.3.Examples on javascript operators

4.4 Functions

4.5 Event Handling in Java Scripts

4.6 Concept of array, Arrays in javascript , types of arrays with examples

4.7 Event handling in javascript with examples

4.8 Math and date objects with examples.

4.9 String objects with examples, and related functions

4. 10 DOM in javascript, DOM objects

4.11 Validations in javascript with examples.

UNIT V                   Working with cookies

5.1 Basics of cookies

5.2 Reading a cookie value, writing a cookie value

5.3 Creating cookies, deleting cookies

5.4 Setting expiry date of cookies.

5.5 Examples on cookies.

UNIT VI                Introduction to XML

6.1 Introduction to XML

6.2 Uses of XML

6.3 Simple XML examples,

6.4 XML key components

6.5.DTD and Schemas,

6.6 Using XML in web applications.

6.7.Introduction to XSL, XSL elements, transforming with XSLT



Object Oriented Programming and C++:BCA241 & BCA244

Duration: 1 – 2 Months


•         BCA112 & BCA122

Course Objectives:

·         To learn principles of Object Oriented Programming (OOP).

·         To understand object-oriented concepts such as data abstraction, encapsulation,

·         inheritance, dynamic binding, and polymorphism.

·         To use the object-oriented paradigm in program design.

Course Outcomes:

·         Compare and contrast procedural and object oriented programming

·         Apply principles of OOP

·         Design and develop applications using object oriented programming language C++


UNIT I                     Introduction to C++

·         How C++ evolved from C?

·         Features of C++

·         Procedure-oriented programming Vs Object-oriented programming

·         The basic anatomy of a C++ program, Simple “Hello World” program

·         Compiling, linking and running a C++ program.

UNIT II                  Object Oriented Programming Concepts

·         Classes and objects

·         Abstraction

·         Inheritance

·         Polymorphism

·         Data Binding

·         Encapsulation

·         Message Passing

UNIT III              Programming in C++

·         Data Types,

·         New operators and keywords,

·         Type casting in C++,

·         reference variables,

·         Classes and Access Specifiers

·         Defining data members and member functions

·         Arrays and Array of objects

·         Usage of namespace, Managing Console I/O, Usage of Manipulators

UNIT IV                Constructors, Destructors, Function andOperator overloading

·         Static Members Call by reference, return by reference

·         Inline Function

·         Friend Function

·         Function overloading

·         Constructer & Destructor and their types

·         Overloading unary and binary operators (with member function and with friend function)

·         Usage of this pointer

·         Overloading using friend functions Overloading “<<>>” operator Type Conversion,

·         Function overloading

UNIT V                   Inheritance

·         Introduction

·         Types of Inheritance

·         Base class and derived class examples

·         Virtual base class

·         Abstract class

·         Polymorphism

·         Virtual functions and pure virtual functions, Overriding


UNIT VI                Files and ExceptionHandling

·         Classes for file stream operations

·         Opening and closing a file

·         Random access files

·         Introduction to Exception handling mechanism



Web Technology: BCA242

Duration: 1 – 2 Months


·         BCA233 & BCA236

Course Objectives:

·         To learn PHP programming and database connectivity

·         To understand and learn AJAX and XML

Course Outcomes:

·         Develop web based application using suitable client side and server side web technologies.

·         Build Dynamic web site using server side PHP Programming and Database connectivity.

·         Build applications using AJAX and XML

UNIT I                     Introduction to PHP

HTTP basics, Introduction to web server and web browser

Introduction to PHP

PHP – Lexical structure, Language basics

UNIT II                  Functions and Arrays

Defining and calling a function

Default parameters

Variable parameters, Missing parameters

Variable function, Anonymous function

Indexed Vs Associative arrays

Identifying elements of an array

Storing data in arrays

Multidimensional arrays

Extracting multiple values

Traversing arrays

Sorting Using arrays

UNIT III              Object Oriented Programming








UNIT IV                Web Techniques


Server information

Processing forms

Setting response headers

Maintaining state



UNIT V                   Databases

Using PHP to access a database

Relational databases and SQL

PEAR DB basics

Advanced database techniques

UNIT VI                Ajax and XML

Understanding java scripts for AJAX

AJAX web application model

AJAX –PHP framework

Performing AJAX validation

Handling XML data using php and AJAX

What is XML?

XML document Structure


XML parser

The document object model

The simple XML extension

Changing a value with simple XML


Software Engineering: BCA233

Duration: 1 – 2 Months


·         Knowledge of Programming and Database

Course Objectives:

·         To learn and understand the principles of System and Software Engineering

·         To be acquainted with methods of capturing, specifying, visualizing and analyzing

·         software requirements.

·         To learn design processes and software quality parameters

Course Outcomes:

·         Compare and contrast various Software Engineering models

·         Decide on appropriate process model for a developing a software project

·         Classify software applications and Identify unique features of various domains

·         Prepare System Requirement Specification (SRS) for the given problem

·         Design and analyze Data Flow diagrams

UNIT I                     Introduction to System Engineering

1.1 Definition

1.2 Basic Components

1.3 Elements of the system

1.4 System Components

1.5 Types of System

UNIT II                  Introduction to Software Engineering

2.1 Definition of Software

2.2 Characteristics of Software

2.3 Software Application Domain

2.4 Definition of Software Engineering

2.5 Need for software Engineering

2.6 Mc Call’s Quality factors

2.7 The Software Process

2.8              Software Engineering Practice

UNIT III              Software Development Life Cycle (SDLC)and Methodologies

3.1 Introduction

3.2 Activities of SDLC

3.3 A Generic Process Model

3.4 Prescriptive Process models Waterfall Model

3.4.2 Incremental Process Models

3.4.3 Evolutionary process Models (Prototyping and Spiral Model)

3.5 Concurrent Models, Types

UNIT IV                Requirement Engineering

4.1 Introduction

4.2 Requirement Engineering Tasks

4.3 Establishing Groundwork for understanding of Software Requirement

4.4 Requirement Gathering

4.5 Feasibility study

4.6 Fact Finding Techniques

UNIT V                   Analysis and Design Engineering

5.1 Decision Tree and Decision Table

5.2 Data Flow Diagrams (DFD)

5.3 Data Dictionary

5.3.1 Elements of DD

5.3.2 Advantages of DD

5.4 Input and Output Design

5.5 PseudoCode

5.6 Case Studies on above topics

UNIT VI                Agile Development

6.1 Agility

6.2 Agile Process

6.2.1 Principles

6.2.2 The Politics Of Agile Development

6.2.3 Human Factors

6.3 Extreme Programming(XP)

6.4 Adaptive Software Development(ASD)

6.5 Scrum

6.6 Dynamic System Development Model (DSDM)


Python Programming Laboratory: BCA246

Duration: 1 – 2 Months


·         BCA – 126, BCA – 234

Course Objectives:

·         To understand programming constructs in Python.

·         To learn problems solving using Python

Course Outcomes:

·         Write programs using Python programming constructs.

·         Develop applications using Python programming.

UNIT I                     Introduction to Python Scripting

1.1 Why Scripting is Useful in Computational Science

·         Classification of Programming Languages

·         Productive Pairs of Programming Languages

·         Gluing Existing Applications

·         Scripting Yields Shorter Code, Efficiency

·         Type-Specification (Declaration) of Variables

·         Flexible Function Interfaces

·         Interactive Computing

·         Creating Code at Run Time

·         Nested Heterogeneous Data Structures

·         GUI Programming

·         Mixed Language Programming

1.2 When to Choose a Dynamically Typed Language

1.3 Why Python? Script or Program?

1.4 Application of Python

UNIT II                  Basic Python

2.1 Python identifiers and reserved words

2.2 Lines and indentation, multi-line statements Comments

2.3 Input/output with print and input functions,

2.4 Command line arguments and processing command line arguments

2.5 Standard data types – basic, none, Boolean (true & False), numbers

2.6 Python strings

2.7 Data type conversion

2.8 Python basic operators (Arithmetic, comparison, assignment, bitwise logical)

2.9 Python membership operators (in & not in)

2.10 Python identity operators (is & is not)

2.11 Operator precedence

2.12 Control Statements, Python loops, Iterating by subsequenceindex, loop control statements (break, continue,pass)

2.13 Mathematical functions and constants (import math), Randomnumber functions

UNIT III              Python String

3.1 Concept, escape characters

3.2 String special operations, String formatting operator ,Single quotes, Double quotes, Triplequotes,Raw String, Unicode strings, Built-in String methods.

3.3 Python Lists – concept, creating and accessing elements, updating & deleting lists, basiclist operations, reverse

3.4 Indexing, slicing and Matrices

UNIT IV                Python List

4.1 built-in List functions

4.2 Functional programming tools – filter(), map(), and reduce()

4.3 Using Lists as stacks and Queues, List comprehensions.

UNIT V                   Python tuples and Sets

5.1 Creating & deleting tuples

·         Accessing values in a tuple

·         Updating tuples, delete tuple elements

5.2 Basic tuple operations

·         Indexing, slicing and Matrices, built- in tuple functions.

5.3 Sets – Concept, operations

UNIT VI                Python Dictionary

6.1 Creating and accessing values in a dictionary

6.2 Updating dictionary, delete dictionary elements

6.3 Properties of dictionary keys

6.4 Built-in dictionary functions and methods

6.5 Defining a function (def)

6.6 Function arguments – Pass by value, Keyword Arguments, default arguments

6.7 Documentation Strings

6.8 Variable Number of Arguments

6.9 Call by Reference

6.10 Order of arguments (positional, extra & keyword)



Java Programming:BCA501

Duration: 1 – 2 Months

Course Objectives:

The syllabus aims in equipping students with

·         To understand fundamentals of object-oriented programming in Java, including defining classes,

·         Invoking methods, using class libraries, etc.

·         To handle abnormal termination of a program using exception handling

·         To use the Java SDK environment to create, debug and run simple Java program


UNIT I         Introduction to Java

·         Basics of Programming Language

·         History and Features of Java

·         JDK,JRE,JIT and JVM

·         Naming Convention

·         Simple java program

·         Java IDE –Eclipse/ NetBeans (Note: For Lab Demonstration)

·         Introduction to Java

·         Data Types

·         Variable: final, static, abstract

·         Types of Comments

·         Array: 1D, 2D, Dynamic array using Vector

·         Accepting input using Command line argument

·         Accepting input from console (Using BufferedReader and Scanner class)

UNIT II      Usage of Objects and Classes

·         Defining Your Own Classes

·         Access Specifiers (public, protected, private, default/friendly)

·         Array of Objects

·         Constructors, Overloading Constructors and use of „this‟ Keyword

·         Predefined classes

·         String class (Basic Functions)

·         StringBuffer class

·         Wrapper class

·         Inner classes, Nested classes, local classes, Anonymous classes(Anonymousobject)

·         Introduction to Packages : Creation, Access and use

·         Garbage Collection (finalize() Method)

UNIT III  Inheritance and Interface

·         Inheritance Basics (extends Keyword)

·         Types of Inheritance

·         use of ‘super’ Keyword

·         Usage of final keyword related to method and class

·         Usage of abstract class and abstract methods

·         Interface: Defining and Implementing Interfaces

·         Runtime polymorphism using interface

UNIT IV    Collection

·         Collection interface

·         Collection framework

·         Collection interfaces & classes-ArrayList, LinkedList, HashSet,TreeSet

·         Iterator and Enumaration, Hash Table.Vector.


UNIT V       Exception Handling and I/O

·         Exception handling fundamentals

·         Exception types

·         Exception class

·         Checked exception

·         Unchecked exception

·         Creating user defined exception

·         Uncaught exceptions

·         Assertions

·         Introduction to package

·         Byte streams

·         Character streams

·         File IO basics

·         Object serialization – Reader and Writer

UNIT VI    Swing , Applet programming

·         MVC(Model View Controller) Architecture

·         Swing components : JFrame, JPanel, JButton, JcheckBox, JtextField,

·         JRadioButton, JLabel, JList, JDialog, JFileChooser, JColorChooser,JMenu

·         Applet fundamentals, Applet lifecycle, Creating and running applets

·         Applets: Event Handling using applets.

UNIT VII                        Database Programming

·         Introduction to JDBC: Architecture (2-tier, 3-tier)

·         JDBC Drivers

·         Connectivity with PostgreSQL: basic steps

·         JDBC statement: Statement, PreparedStatement, CallableStatement

·         JDBC ResultSet and types

·         JDBC Metadata – ResultSetMetaData, DatabaseMetaData

UNIT VIII                     Servlets

·         Introduction to Servlet and Servlet types

·         Lifecycle of servlet

·         Handing HTTPRequest and HTTPResponse

·         HttpServlet:

·         Reading form data from servlet

·         Servlet – Database communication

·         Session tracking –User Authorization, URL Rewriting, Hidden Form fields,

·         Cookies and HttpSession

UNIT IX   Java Server Pages (JSP)

·         Introduction to JSP

·         Life cycle of JSP

·         Implicit Objects

·         Scripting elements –Declarations, Expressions, Scriplets, Comments

·         JSP Directives – Page Directive, include directive

·         Basic JSP program

·         Mixing Scriplets and HTML

·         Example of forwarding contents from database to servlet, servlet to JSP and

·         displaying it using JSP scriplet tag


Advance Web Technology: BCA502

Duration: 1 – 2 Months

Objectives -:

·         To know & understand concepts of internet programming.

UNIT I         Introduction to Object Oriented Programming in PHP

1.1 Classes

1.2 Objects

1.3 Encapsulation

1.4 Constructor and Destructor

1.5 Inheritance

1.6 Interfaces

1.7 Introspection

UNIT II      Web Techniques

2.1 Super global Variables

2.2 Server information

2.3 Sticky forms

2.4 File Uploads

2.5 Setting response headers

2.6 Maintaining state

2.6.1. Session and Cookies

UNIT III  Files and Directories

3.1 Working with files and directories

3.2 Opening and Closing

3.3 Getting information about file

3.4 Reading and writing characters in file

3.5 Rename and delete files

3.6 Random access to file data

3.7 Getting information on file

3.8 Ownership and permissions

UNIT IV    Databases(Postgresql)

4.1 Using PHP to access/insert/update/delete a database tables

4.2 Relational databases and SQL

4.3 Introduction to PEAR DB basics (No assignments)

4.4 Advanced database techniques

4.5 Simple applications

UNIT V       XML

5.1 What is XML?

5 5.2 XML document Structure

5.3 PHP and XML

5.4 XML parser

5.5 The document object model

5.6 The simple XML extension

5.7 Changing a value with simple XML

UNIT VI    Ajax

6.1 Understanding java scripts for AJAX

6.2 AJAX web application model

6.3 AJAX –PHP framework

6.4 Performing AJAX validation

6.5 Handling XML data using php and AJAX

6.6 Connecting database using php and AJAX

UNIT VII                        Introduction to Web Services

7.1. SOAP

7.2. WSDL

7.3. Application of web services


Software Quality Assurance: BCA503

Duration: 1 – 2 Months

Pre-requisites (if any) :

·         Basic concepts of Software Engineering

Course Objectives:

·         To understand the basic of quality software and quality factors.

·         To understand software quality architecture and component.

·         3. To understand software project life cycle, infrastructure and software quality standards.

UNIT I         Introduction to Software Quality.

1.1. Uniqueness of software quality assurance

1.2. Software, Software errors, Faults and Failures

1.3. Classification of the causes of software errors

1.4. Software quality, Software quality assurance and software


UNIT II      Software Quality Architecture and Components

2.1. The need for comprehensive software quality requirements

2.2. Classifications of software requirements into software qualityfactors

2.2.1. Product Operation

2.2.2. Product Revision

2.2.3. Product Transition

2.3. Parties interested in the definition of quality requirements.

2.4. SQA architecture

2.5. Software Quality Components

2.5.1. Pre-project components

2.5.2. Software project life cycle components

2.5.3. Infrastructure components for error prevention andimprovement

2.6. Management SQA components

UNIT III  Project Life Cycle.

3.1. Classic and other software development methodologies

3.2. Factors affecting intensity of quality assurance activities in thedevelopment process

3.3. Verification, validation and qualification

3.4. A model for SQA defect removal effectiveness and cost

3.5. Demonstration of CASE study and CASE tools

3.5.1. What is a CASE tool?

3.5.2. The contribution of CASE tools to software product quality

3.5.3. The contribution of CASE tools to software maintenancequality

3.5.4. The contribution of CASE tools to improved projectManagement

UNIT IV    Software Quality Infrastructure Components

4.1. Procedures and work instructions –

4.1.1. Need

4.1.2. Procedures manuals

4.1.3. work instruction manuals

4.1.4. Procedures and work instructions: preparation,implementation and updating

4.2. Supporting Quality devices

4.2.1. Templates

4.2.2. Checklists

4.3. Configuration management –

4.3.1. Software configuration, its items and its management

4.3.2. Software configuration management – tasks andorganization

4.3.3. Software change control

4.3.4. Release of software configuration versions

4.3.5. Provision of SCM information services

4.3.6. Software configuration management audits

4.3.7. Computerized tools for managing software configuration

UNIT V       Software quality metrics

5.1. Objectives of quality measurement

5.2. Classification of software quality metrics

5.3. Process metrics

5.4. Product metrics

5.5. Implementation of software quality metrics

5.6. Limitations of software metrics

UNIT VI    Software Quality Standards, certification and assessment

6.1. Quality management standards

6.1.1. The scope of quality management standards

6.1.2. ISO 9001 and ISO 9000-3

6.1.3. Certification according to ISO 9000-3

6.1.4. Capability Maturity Models – CMM and CMMIassessment methodology

6.1.5. The Bootstrap methodology

6.1.6. The SPICE project and the ISO/IEC 15504 softwareprocess assessment standard

6.2. Project process standards

6.2.1. Structure and content of IEEE software engineeringstandards

6.2.2. IEEE/EIA Std 12207 – software life cycle processes

6.2.3. IEEE Std 1012 – verification and validation

6.2.4. IEEE Std 1028 – reviews


Operating System: BCA504

Duration: 1 – 2 Months

Pre-requisites :

·         Knowledge of fundamentals of Computer Organization

Course Objectives:

·         To understand the objectives, structure and functions of operating system

·         To learn about concept of processes, threads and its scheduling algorithms

·         To understand design issues in process synchronization and deadlock management

·         To study various memory management schemes

·         To learn about concept file and I/O management in detail.

·         Demonstrate ability to use top-down program design

UNIT I         Introduction to Operating System Concepts

1.1 Operating System Objectives and Functions –

Definition of Operating System ,Role and Objectives ofOperating System, Operating System as a User View andSystem View

1.2 Evolution Of Operating Systems – Batch Operating System,Multi-Programming Operating System ,Time-SharingOperating System, Desktop Operating Systems, Real-Time

Operating System, Distributed Operating System, ParallelSystems, Multimedia Systems, Handheld Systems

1.3 Computer System Architecture – Single-Processor Systems,Multi-Processor Systems, Clustered Systems

1.4 Operating System Operations- Dual-Mode And Multimode Operation, Timer

1.5 Operating System as Resource Management- ProcessManagement, Memory Management, Storage Management(File system ,Mass storage ,Caching I/O systems), ProtectionAnd Security

1.6 Computing Environment-Traditional Computing, ClientServer Computing, Peer To Peer Computing, Virtualization,Cloud Computing

UNIT II     System structure

2.1 Operating System Services

2.2 System Calls Concepts

2.3 Types of system Calls- Process Control, File Management, Device Management, Information Maintenance, Communication, Protection

2.4 System Programs

2.5 System Boot

UNIT III  Process and Thread Management

3.1 Process Concept – Process , Process Model , Process ControlBlock

3.2 Operations on Process – Process creation , Process Termination

3.3 Process Scheduling – Scheduling queues, Schedulers, Contextswitch

3.4 Inter Process Communication –Cooperating Process, SharedMemory Systems, Message Passing Systems

3.5 Overview of Threads

3.6 Concept of Multithreaded Programming and MulticoreProgramming

3.7 Types of threads – User and Kernel

3.8 Multithreading Models – Many to One , One to Many, Many toMany

UNIT IV   Process Scheduling

4.1 Basic Concept – CPU-I/O burst cycle, CPU scheduler,Preemptive scheduling, Dispatcher

4.2 Scheduling Criteria

4.3 Scheduling Algorithms – FCFS, SJF, Priority scheduling,

Round-robin scheduling, Multiple queue scheduling, Multilevelfeedback queue scheduling

UNIT V      Process Synchronization

5.1 Background – Problems with Concurrency , Race Condition

5.2 Critical Section Problem – Peterson‟s Solution(for two process)

5.3 Semaphores: Usage, Implementation

5.4 Classic Problems of Synchronization – Producer Consumer

problem, Reader Writer problem, Dining Philosopher Problem

UNIT VI   Deadlocks

6.1 System Model

6.2 Deadlock Characterization – Necessary Conditions, ResourceAllocation Graph

6.3 Deadlock Prevention

6.4 Deadlock Avoidance – Safe State, Resource Allocation GraphAlgorithm, Banker‟s Algorithm

6.5 Deadlock Detection

6.6 Recovery From Deadlock – Process Termination, ResourcePreemption

UNIT VII                       Memory Management

7.1 Background – Basic Hardware, Address Binding, LogicalVersus Physical Address Space, Dynamic Loading, DynamicLinking and Shared Libraries, Overlays

7.2 Swapping

7.3 Contiguous Memory Allocation – Memory Mapping andProtection, Memory Allocation, Fragmentation

7.4 Paging – Basic Method, Hardware Support, Protection, Shared

7.5 Segmentation – Basic Concept, Hardware

7.6 Virtual Memory Management – Background, Demand Paging

7.7 Page Replacement Algorithms – FIFO, OPT, LRU, SecondChance Page Replacement, LFU, MFU.

7.8 Thrashing – Cause of thrashing , Working-set Model

UNIT VIII                    File System

8.1 File concept

8.2 Access Methods – Sequential, Direct, Other access methods

8.3 Directory and Disk Structure – Storage structure, Directoryoverview, Single level directory, Two level directory, Treestructure directory, Acyclic graph directory, General graphdirectory

8.4 Allocation Methods – Contiguous allocation, Linked allocation,Indexed allocation

8.5 Free Space Management – Bit vector, Linked list, Grouping,Counting, Space maps

UNIT IX  I/O Systems and Disk Management

9.1 I/O Hardware – polling, interrupts, DMA

9.2 Application I/O Interface – block and character devices,network devices, clocks and timers, blocking and non blockingI/O

9.3 Kernel I/O subsystems – (I/O scheduling, buffering, caching,spooling and device reservation, error handling)

9.4 Disk Structure

9.5 Disk Scheduling – Disk Performance Parameters, Schedulingalgorithms(FCFS, SSTF, SCAN,C-SCAN,LOOK,C-LOOK)


Soft Computing: BCA507

Duration: 1 – 2 Months

Pre-requisites :

·         Knowledge of Set Theory

Course Objectives:

·         To learn the concept of soft computing.

·         2. Understand different soft computing techniques like Genetic Algorithms, Fuzzy Logic ,Neural Networks and their combination.

UNIT I         Introduction to Soft Computing

1.1 History of Soft Computing

1.2 Brief Introduction to Neural Networks, GeneticAlgorithms and Fuzzy Systems

1.3 Applications of Soft Computing

UNIT II     Fundamentals of Fuzzy Systems

2.1 Fuzzy sets: Basic Definition and Terminology

2.2 Member Functions

2.3 Fuzzy Logic and Relations

2.4 Extension Principle and its problems

UNIT III  Fundamentals of Evolutionary Computing

3.1 Evolutionary Algorithms

3.2 Encoding

3.3 Operators of genetic Algorithms and its problems

UNIT IV   Fundamental of Neural Network

4.1 Introduction

4.2 Model of Artificial Neuron

4.3 Architectures

4.4 Learning Methods (Supervised and Unsupervised)

4.5 Perceptron and Back-propagation




Android Programming:BCA601

Duration: 1 – 2 Months

Course Objectives:

·         The objective of this course is to understand the Android Operating System and

·         develop applications using Google’s Android open-source platform.


UNIT I                     Introduction to Android

1.1. Overview

1.2. History

1.3. Features of Android

1.4. Architecture of Android

•         Overview of Stack

•         Linux Kernel

•         Native Libraries

•         Android Runtime

•         Application Framework

•         Applications

1.5. SDK Overview

•         Platforms

•         Tools – (JDK, SDK, Eclipse/Android Studio, ADT,AVD, Android Emulator)

•         Versions

1.6. Creating your first Android Application

UNIT II                  Activities, Fragments and Intents

2.1. Introduction to Activities

2.2. Activity Lifecycle

2.3. Introduction to Intents

2.4. Linking Activities using Intents

2.5. Calling built-in applications using Intents

2.6. Introduction to Fragments

2.7. Adding Fragments Dynamically

2.8. Lifecycle of Fragment

2.9. Interaction between Fragments

UNIT III              Android User Interface

3.1 Understanding the components of a screen

•         Views and ViewGroups

•         LinearLayout

•         AbsoluteLayout

•         TableLayout

•         RelativeLayout

•         FrameLayout

•         ScrollLayout

•         ScrollView

3.2. Adapting to Display Orientation

•         Anchoring Views

•         Resizing and Repositioning

3.3. Managing Changes to Screen Orientation

•         Persisting State Information during Changes inConfiguration

•         Detecting Orientation Changes

•         Controlling the Orientation of the Activity

3.4. Utilizing Action Bar

•         Adding Action Items to the Action Bar

•         Customizing the Action Items and Application Icon


UNIT IV                Designing Your User Interface with Views

4.1. Using Basic Views

•         TextView

•         Button, ImageButton, EditText, CheckBox

•         ToggleButton, RadioButton, and RadioGroup Views

•         ProgressBar View

•         AutoCompleteTextView View

4.2. Using Picker Views

•         TimePicker View

•         DatePicker View

4.3. Using List Views to Display Long Lists

•         ListView View

•         Using the Spinner View

4.4. Understanding Specialized Fragments

•         Using a ListFragment

•         Using a DialogFragment

•         Using a PreferenceFragment.


UNIT V                   Displaying Pictures and Menus

5.1. Using Image Views to Display Pictures

•         Gallery and ImageView views

•         Image Switcher

•         Grid View

5.2. Using Menus with Views

•         Creating the helper methods

•         Options Menu

•         Context Menu

UNIT VI                Databases – SQLite

6.1. Introduction to SQLite

6.2. SQLiteOpenHelper and SQLiteDatabase

6.3. Creating , opening and closing database

6.4. Working with cursors, Insert, Update, Delete

6.5. Building and executing queries

UNIT VII            Messaging and E-mail

7.1. SMS Messaging

•         Sending SMS Messages Programmatically

•         Getting Feedback after Sending a Message

•         Sending SMS Messages Using Intent

•         Receiving SMS Messages

•         Caveats and Warnings

7.2. Sending E-mail

UNIT VIII         Location-Based Services and Google Map

8.1. Display Google Maps

•         Creating the project

•         Obtaining the Maps API Key

•         Displaying the Map

•         Displaying the Zoom Control

•         Changing Views

•         Navigating to a specific location

•         Adding Markers

•         Getting the location that was touched

•         Geocoding and Reverse Geocoding

8.2. Getting Location Data

8.3. Monitoring a Location


Python Programming: BCA602

Duration: 1 – 2 Months

Course Objectives:

•          To introduce various concepts of programming to the students using Python.

•          Students should be able to apply the problem solving skills using Python

UNIT I                     Introduction to Python Scripting

•          Why Scripting is Useful in Computational Science

•          Classification of Programming Languages

•          Productive Pairs of Programming Languages

•          Gluing Existing Applications

•          Scripting Yields Shorter Code, Efficiency

•          Type-Specification (Declaration) of Variables

•          Flexible Function Interfaces

•          Interactive Computing

•          Creating Code at Run Time

•          Nested Heterogeneous Data Structures

•          GUI Programming

•          Mixed Language Programming

•          When to Choose a Dynamically Typed Language

•          Why Python? Script or Program?

•          Application of Python

•          Concept (immutable)

UNIT II                  Basic Python

•          Python identifiers and reserved words

•          Lines and indentation, multi-line statements

•          Comments

•          Input/output with print and input functions,

•          Command line arguments and processing command linearguments

•          Standard data types – basic, none, Boolean (true & False),numbers

•          Python strings

•          Data type conversion

•          Python basic operators (Arithmetic, comparison,assignment, bitwise logical)

•          Python membership operators (in & not in)

•          Python identity operators (is & is not)

•          Operator precedence

•          Control Statements, Python loops, Iterating by

•          subsequence index, loop control statements (break,continue, pass)

•          Mathematical functions and constants (import math),Random number functions

UNIT III              Python strings

•          Concept, escape characters

•          String special operations

•          String formatting operator

•          Single quotes, Double quotes, Triple quotes

•          Raw String, Unicode strings, Built-in String methods.

•          Python Lists – concept, creating and accessing elements,updating & deleting lists, basic list operations, reverse

•          Indexing, slicing and Matrices

•          built-in List functions

•          Functional programming tools – filter(), map(), and reduce()

•          Using Lists as stacks and Queues, List comprehensions


UNIT IV                Python tuples and sets

•          Creating & deleting tuples

•          Accessing values in a tuple

•          Updating tuples, delete tuple elements

•          Basic tuple operations

•          Indexing, slicing and Matrices, built- in tuple functions.

•          Sets – Concept, operations.

UNIT V                   Python Dictionary

•          Concept (mutable)

•          Creating and accessing values in a dictionary

•          Updating dictionary, delete dictionary elements

•          Properties of dictionary keys

•          built-in dictionary functions and methods.

UNIT VI                Functions

•          Defining a function (def)

•          Calling a function

•          Function arguments – Pass by value, Keyword Arguments,default arguments

•          Scope of variable – basic rules

•          Documentation Strings

•          Variable Number of Arguments

•          Call by Reference

•          Order of arguments (positional, extra & keyword)

•          Anonymous functions

•          Recursion

•          Treatment of Input and Output Arguments

•          Unpacking argument lists

•          Lambda forms

•          Function Objects

•          function ducktyping& polymorphism

•          Generators (functions and expressions) and iterators, list

•          comprehensions

UNIT VII            Files and Directories

•          Creating files

•          Operations on files (open, close, read, write)

•          File object attributes, file positions, Listing Files in aDirectory

•          Testing File Types

•          Removing Files and Directories

•          Copying and Renaming Files

•          Splitting Pathnames

•          Creating and Moving to Directories

•          Traversing Directory Trees

UNIT VIII         Python Classes / Objects

•          Object oriented programming and classes in Python -creating classes, instance objects, accessing members

•          Data hiding (the double underscore prefix)

•          Built-in class attributes

•          Garbage collection : the constructor

•          Overloading methods and operators

•          Inheritance – implementing a subclass, overriding methods

•          Recursive calls to methods

•          Class variables, class methods, and static methods

•          Illustrative programs: word count, copy file

UNIT IX               Python Exceptions

•          Exception handling : assert statement

•          Except clause – with no exceptions and multiple exceptions

•          Try – finally, raising exceptions, user-defined exceptions.


Data Analytics: BCA604

Duration: 1 – 2 Months

Course Objectives:

•          Able to apply fundamental algorithmic ideas to process data.

•          Learn to apply hypotheses and data into actionable Predictions.

UNIT I                     Introduction to data Science

·         Basics of Data

·         What is Data Science?

·         Data science process

·         Stages in data science project

·         Basics of Data Analytics

·         Types of Analytics – Descriptive, Predictive, Prescriptive

·         Statistical Inference

·         Populations and samples

·         Statistical modeling,

·         Probability

·         Distribution

·         Correlation

·         o Regression

UNIT II                  Introduction to Machine Learning

·         Basics of Machine Leaning

·         Supervised Machine Learning

·         K- Nearest-Neighbors,

·         Naïve Bayes

·         Decision tree

·         Support Vector Machines

·         Unsupervised Machine Learning

·         Cluster analysis

·         K means

·         Association Rule Mining

·         Apriori algorithms

·         Regression Analysis

·         Linear Regression

·         Nonlinear Regression

UNIT III              Data Analytics with Python Programming

·         Numpy

·         Arrays

·         Array indexing

·         Datatypes

·         Array math

·         Broadcasting

·         SciPy

·         Image operations

·         Distance between points

·         Importing Data , Creating A DataFrame,

·         DataFrame Methods,

·         Indexing DataFrames, Boolean Indexing

·         Indexing Using Labels , Multi-Indexing

·         Merge DataFrames

·         Sorting DataFrames

·         Apply Function

·         Pivot Table, Crosstab

·         Iterating over rows of a dataframe

UNIT IV                Data Visualization

·         Basic principles,

·         Ideas and tools for data visualization

·         Graph Visualization,

·         Data Summaries,

·         Model Checking & Comparison

·         Purpose of visualization

·         Multidimensional visualization

·         Tree visualization

·         Graph visualization

·         Visualization techniques

·         Understanding analytics output and their usage

·         Scikit package

·         matplotlib library

·         Plotting

·         Subplots

·         Images


What student are saying

Are You Ready To Start?

More Courses

You might also be interested in these courses

Course 2


The BCS (B.Sc. Computer Science) Coaching at ProIT Academy is designed for students who are enthusiastic about the subject. In addition to programming languages, database administration, software engineering, and artificial intelligence are just a few topics covered in our extensive curriculum. Students get practical skills that are highly sought after in the job market through hands-on projects and industry collaborations. Join the BCS Coaching Classes at ProIT Academy to get the skills and information required to succeed in the rapidly changing world of technology.

Excel as a BCS Student: Master Essential Skills!

BCS: Unlock the world of algorithms, data structures, and software engineering to build a future driven by technology
View Course

Course 3


A thorough BBA Coaching is provided by ProIT Academy, giving students the fundamentals of business. Our curriculum covers key topics: finance, marketing, management, and entrepreneurship. Students work on practical projects and study real-world case studies under the guidance of industry professionals. Enrol in the BBA Coaching Classes at ProIT Academy to realize your potential and succeed in the changing business environment.

Unlock Limitless Opportunities with BBA-CA

Our BBA-CA Course is Where business acumen meets computational expertise, shaping future professionals for the dynamic world of finance and technology.
View Course


Download Pro IT Academy – B.C.A. – Science (BCA) FY Course Brochure


Download Pro IT Academy – B.C.A. – Science (BCA) SY Course Brochure


Download Pro IT Academy – B.C.A. – Science (BCA) TY Course Brochure

405 – 4th Floor, Rainbow Plaza, Pimple Saudagar, Pune – 411017
+91 8308103366 / 020-46302591

Call Now Button