Faculty of Science & Technology Savitribai Phule Pune University Pune, Maharashtra, India
Faculty of Science & Technology Savitribai Phule Pune University Pune, Maharashtra, India
Faculty of Science & Technology Savitribai Phule Pune University Pune, Maharashtra, India
Syllabus for
Third Year
Bachelor of Computer Applications
(2019 Pattern)
(with effect from A.Y. 2021-22)
Prologue
On behalf of Board of Studies in Computer Applications, it is a great pleasure and
honor for me to present the syllabi for TYBCA (Third Year Computer Applications -
2019 Pattern).
While revising syllabus, every efforts were made to design the syllabus for Computer
Applications program as per the guidelines and objectives set out by the UGC and
our University. The draft was prepared by taking into account the recent
technological developments and expectations of employers.
The revision of Syllabus was carried out with dedicated efforts, active participation
and suggestions from stakeholders. All efforts have been made by the members of
Board of Studies and faculty members from affiliated colleges to decide contents as
per the guidelines and recommendations of faculty of Science & Technology, SPPU,
Pune.
The BoS in Computer Applications had appointed a subcommittee for the preparation
of the draft. Two of our BoS members, Dr. Pallawi Unmesh Bulakh and Dr. M N
Shelar coordinated the task of preparation of drafts for Semesters V and VI
respectively.
For each course, the draft suggests course objectives and outcomes and could be
suitably modified, if needed, by faculty members from affiliated colleges teaching
these courses.
I appreciate various suggestions received through emails and during the online
workshop to finalize the draft contents.
Regards,
Table of Contents
Sr. No. Title Page Number
1. Structure of TYBCA 4
2. Course Drafts for Courses at SEM V 5 - 31
3. Course Drafts for Courses at SEM VI 32 – 52
4. Equivalence for TYBCA syllabus (2016) 53
with TYBCA syllabus (2019)
5. Details of Subcommittee for Syllabus 54 -55
Revision
6. Acknowledgements 56
Semester
V
Semester-V
SEMESTER V
BCA 351: DSE I (Programming in Java)
Teaching Scheme: Credits Examination Scheme:
Theory: 05 Hrs./Week 04 Continuous Evaluation: 30 Marks
End-Semester : 70 Marks
Pre-requisite Course:
● BCA 241 Object Oriented Programming and C++
Companion Course:
● BCA 356 DSE I Laboratory (Programming in Java)
Course Objectives:
● To learn implementation of object-oriented conceptswith Java.
● To understand collection classes and interfaces.
● To know the process of application development using Graphical User Interface (GUI).
● To acquire knowledge about handling databases using Java.
● To study web components for developing web applications.
Course Outcomes:
After successful completion of this course, learner will be able to:
● Identify classes, objects, class members and relationships for a given problem.
● Design end to end applications using object oriented constructs.
● Apply collection classes for storing java objects.
● Use Java APIs for program development.
● Handle abnormal termination of a program using exception handling.
Course Contents
Unit I Introducing Java, Classes and Objects 10 Hrs
Introducing Java
1.1 A Short History of Java
1.2 Features of Java
1.3 Java Environment – Compiler, Interpreter, JVM
1.4 Simple java program
1.5 Types of Comments
1.6 Declaring single and multi-dimensional arrays
1.7 Accepting input using Command line arguments
1.8 Accepting input from console (Using BufferedReader and Scanner
class)
Classes and Objects
1.9 Defining Your Own Classes
1.10 Access Specifiers (public, protected, private, default)
1.11 Array of Objects
1.12 Constructor, Overloading Constructors and use of „this‟ Keyword
1.13 static blocks, static Fields and static methods
1.14 Predefined classes – Object class methods (equals(), toString(),
hashcode())
1.15 Garbage Collection (finalize() Method)
SEMESTER V
BCA 352: DSE II - Data Mining and Data Science
Teaching Scheme: Credits Examination Scheme:
Theory: 05 Hrs./Week 04 Continuous Evaluation: 30 Marks
End-Semester : 70 Marks
Pre-requisite Course:
● BCA 117 Applied Mathematics Laboratory
● BCA 232 Database Management Systems-II
Companion Course:
● BCA 357 DSE- II Laboratory (Data Mining)
Course Objectives:
● To introduce students to the basic concepts and techniques of Data Mining and Data
Science
● To study data mining algorithms for solving practical problems.
● To understand data visualization and exploratory analysis.
Course Outcomes:
After successful completion of this course, learner will be able to:
● Identify the key processes of data mining, data warehousing and knowledge discovery
● Design data warehouse with dimensional modeling and apply OLAP operations.
● Identify appropriate data mining algorithms to solve real world problems
● Compare and evaluate different data mining techniques like classification, prediction,
clustering and association rule mining
● Choose an appropriate method to perform exploratory analysis.
● Interpret results by carrying out data visualization and formal inference procedures
Course Contents
Unit I Introduction to Data Mining 10 Hrs
1.1 Definition Data mining
1.2 Data Mining issues
1.3 Stages of the Data Mining Process (KDD)
1.4 Data Mining Techniques/Tasks
1.5 Knowledge Representation Methods
1.6 Applications of Data mining
1.7 Data Pre-processing
1.7.1 Data Cleaning
1.7.2 Data Transformation
1.7.3 Data Reduction
1.7.4 Data Discretization
Unit II Data Warehousing 08 Hrs
2.1 Introduction to Data Warehouse
2.2 Data Warehouse Architecture and its components
2.3 Data Modeling with OLAP
2.3.1 Introduction
2.3.2 Difference between OLTP and OLAP
E-Books:
1. http://myweb.sabanciuniv.edu/rdehkharghani/files/2016/02/The-Morgan-Kaufmann-
Series-in-Data-Management-Systems-Jiawei-Han-Micheline-Kamber-Jian-Pei-Data-
Mining.-Concepts-and-Techniques-3rd-Edition-Morgan-Kaufmann-2011.pdf
2. https://data-flair.training/blogs/data-mining-tutorial/
3. http://infolab.stanford.edu/~ullman/mmds/book.pdf
4. https://archive.org/details/IntroductionToDataMining
5. https://www.academia.edu/6489220/Data_Mining_ebook
6. https://en.wikibooks.org/wiki/Data_Mining_Algorithms_In_R
7. https://www.cs.umd.edu/~samir/498/10Algorithms-08.pdf
8. http://www.elfhs.ssru.ac.th/morakot_wo/file.php/1/9781788290678-
STATISTICS_FOR_DATA_SCIENCE.pdf
9. https://www.programmer-books.com/introducing-data-science-pdf/
10. https://www.cs.uky.edu/~keen/115/Haltermanpythonbook.pdf
http://math.ecnu.edu.cn/~lfzhou/seminar/[Joel_Grus]_Data_Science_from_Scratch_Fi
rst_Princ.pdf
11. https://www.pdfdrive.com/doing-data-science-d58735039.html
WebSites:
https://www.datacamp.com/community/open-courses/statistical-inference-and-data-
analysis
https://www.coursera.org/learn/python-plotting?specialization=data-science-python
https://epgp.inflibnet.ac.in/
Online Courses:
1) Data Mining : https://onlinecourses.swayam2.ac.in/cec19_cs01/preview
2) https://onlinecourses.nptel.ac.in/noc20_cs12/preview
3) https://www.classcentral.com/course/swayam-data-mining-13982
4) Data Science For Engineers : https://onlinecourses.nptel.ac.in/noc19cs60
5) Introduction to Data Science in Python :https://www.coursera.org/learn/python-data-
analysis
6) Python for Data Science : https://onlinecourses.nptel.ac.in/noc21cs33
SEMESTER V
BCA 353: DSE III (Principles of Operating Systems)
Teaching Scheme: Credits Examination Scheme:
Theory: 05 Hrs./Week 04 Continuous Evaluation: 30 Marks
End-Semester : 70 Marks
Pre-requisite Course:
BCA123 Operating System Concepts
Companion Course:-
● BCA 358 DSE III Laboratory (Operating Systems & AI)
Course Objectives:
● To study algorithms for CPU-scheduling, process creation and termination.
● To understand the notion of a Multithreading and Inter-process communication.
● To learn critical-section problems and classical process-synchronization problems.
● To know the concept of deadlock, different methods for preventing or avoiding
deadlocks and techniques for memory management.
● To learn and understand file system, directory structure, file allocation methods and
disk scheduling algorithms.
Course Outcomes:
After successful completion of this course, learner will be able to:
● Describe algorithms for process, memory and disk scheduling
● Apply technique for inter-process communication and Multithreading.
● Implement concept of critical-section
● Compare and contrast deadlock avoidance and prevention.
● Use functions for file system management
Course Contents
Unit I Process Scheduling and Multithreaded Programming 14 Hrs
1.1 Process Scheduling – Scheduling queues, Schedulers,
context switch
1.2 Operations on Process – Process creation with program
using fork(), Process termination
1.3 Interprocess Communication – Shared memory system,
Message passing systems
1.4 Multithreaded Programming – Overview, Multithreading
Models
1.5 Basic Concept – CPU-I/O burst cycle, CPU Scheduler,
Pre-emptive Scheduling, Dispatcher
1.6 Scheduling Criteria
1.7 Scheduling Algorithms – FCFS, SJF, Priority scheduling, Round-
robin scheduling, Multiple queue scheduling, Multilevel feedback
queue scheduling
1.8 Thread Scheduling
Unit II Process Synchronization 8 Hrs
2.1 Background
2.2 Critical Section Problem
2.3 Semaphores: Usage, Implementation
2.4 Classic Problems of Synchronization – The bounded buffer problem,
The reader writer problem, The dining philosopher problem
Unit III Deadlocks 10 Hrs
3.1 System Model
3.2 Deadlock Characterization – Necessary Conditions,
Resource Allocation Graph
3.3 Deadlock Prevention
3.4 Deadlock Avoidance - Safe state, Resource-Allocation-Graph
Algorithm, Banker‟s Algorithm
3.5 Deadlock Detection
3.6 Recovery from Deadlock – Process Termination, Resource Pre-
emption
Unit IV Memory Management 12 Hrs
4.1 Background – Basic Hardware, Address Binding, Logical Versus
Physical Address Space, Dynamic Loading, Dynamic Linking and Shared
Libraries, Overlays
4.2 Swapping
4.3 Contiguous Memory Allocation – Memory mapping and protection,
Memory allocation, Fragmentation
4.4 Paging – Basic Method, Hardware support, Protection,
Shared Pages
4.5 Segmentation – Basic concept, Hardware
4.6 Virtual Memory Management – Demand paging,
Performance of demand paging, Page replacement – FIFO, Optimal,
LRU, Second Chance Algorithm
4.7 Thrashing – Cause of thrashing, Working-Set Model
Unit V File System 10 Hrs
5.1 File Concept, File Attribute, File Operations, File Types, File
Structure
5.2 Access Methods - Sequential Access Method, Direct
Access Method, Other Access Methods
5.3 Directory overview, Single level directory, Two level
directory, Tree structure directory, Acyclic graph directory, General
graph directory
5.4 File System Structure and Implementation - Partitions and Mounting,
Virtual File Systems
5.5 Allocation Methods - Contiguous allocation, Linked
allocation, Indexed allocation
5.6 Free Space Management – Bit vector, Linked list,
Grouping, Counting, Space maps
6.1 Overview
6.2 Disk Structure
6.3 Disk Scheduling, FCFS Scheduling, SSTF Scheduling, SCAN
Scheduling, C-SCAN Scheduling, LOOK Scheduling
6.4 Disk Management
Reference Books:
1) Operating System Concepts, Avi Silberschatz, Peter Galvin, Greg Gagne, 8th
Edition, Wiley Asia
2) Operating Systems: Internals and Design Principles, William Stallings, Prentice Hall of
India.
3) The Design of the UNIX Operating System By Maurice J. Bach., PHI publication
E-Books:
1) http://www.uobabylon.edu.iq/download/M.S%202013-
2014/Operating_System_Concepts,_8th_Edition%5BA4%5D.pdf
SEMESTER V
BCA354: Artificial Intelligence
Teaching Scheme: Credits Examination Scheme:
Theory: 3 Hrs./Week 02 Continuous Evaluation: 15 Marks
End-Semester :35 Marks
Pre-requisite Course:
● BCA112 Problem Solving and C Programming
● BCA231 Data Structures.
Companion Course:
● BCA358 Laboratory (Operating Systems and AI)
Course Objectives:
● To learn various types of algorithms useful in Artificial Intelligence (AI).
● To convey the ideas in AI research related to emerging technology.
● To introduce ideas and techniques underlying the design of intelligent computer systems
Course Outcomes:
After successful completion of this course, learner will be able to:
● Apply the suitable algorithms to solve AI problems
● Identify and apply suitable Intelligent agents for various AI applications
● Build smart system using different informed search / uninformed search or heuristic
approaches
● Represent complex problems with expressive language of representation
Course Contents
Unit I Introduction to Artificial Intelligence 4 Hrs
1.1 Introduction to AI
1.2 Comparison of AI, Machine Learning, Deep Learning
1.3 Applications of AI
1.4 AI Techniques
1.5 Intelligent Agents, Agents and Environments, Structure of Agents
Unit II Problems, Problem Spaces and search 5 Hrs
2.1 Defining problem as a State Space Search
2.2 Production System
2.3 Problem Characteristics
2.4 Search & Control Strategies
2.5 Problems – Water Jug problem, Missionary Cannibal Problem, Block
words Problem, Monkey & Banana problem
Unit III Searching Algorithms 6 Hrs
3.1 Uninformed Search Algorithms/Blind Search Techniques
3.1.1 Breadth-first Search
3.1.2 Depth-first Search
3.2 Informed (Heuristic) search Techniques
3.2.1 Generate-and-test
3.2.2 Simple Hill Climbing
Reference Books:
1) Artificial Intelligence, Tata McGraw Hill, Elaine Rich and Kevin Knight
2) Computational Intelligence, Eberhart, Elsevier, ISBN 9788131217832
3) Artificial Intelligence: A New Synthesis, Nilsson, Elsevier, ISBN 9788181471901
4) Introduction to Artificial Intelligence and Expert System, Dan Patterson, Prentice Hall of India
Pvt. Ltd., New Delhi, 1997
5) Artificial Intelligence: A Modern Approach, Russel &Norvig, Pearson Education
6) Introduction to Machine Learning, Ethem Alpaydin, PHI
E-References:
1) https://www.oracle.com/in/chatbots/what-is-a-chatbot/
2)https://www.dataversity.net/case-study-predictive-analytics-and-data-science-keep-an-eye-on-
the-weather/
3) https://www.senseforth.ai/conversational-ai-case-studies/SBI-Cards/
SEMESTER V
BCA 355: SEC II (Cloud Computing)
Teaching Scheme: Credits Examination Scheme:
Theory: 3 Hrs./Week 02 Continuous Evaluation: 15 Marks
End-Semester : 35 Marks
Pre-requisite Course:
● BCA233 Computer Network
Course Objectives:
● To study cloud computing concepts, technologies, architecture and applications.
● To understand issues in application deployment and implementations in
cloud environment.
● To learn recent trends in cloud computing.
Course Outcomes:
After successful completion of this course, learner will be able to:
● Explain the core issues in cloud computing such as security, privacy, and
interoperability.
● Choose the appropriate technologies, algorithms, and approaches for the given
application.
● Compare and contrast various cloud services
Course Contents
Unit I Introduction to Cloud Computing 3 Hrs
1.1 Overview, Layers and Types of Cloud
1.2 Desired Features of a Cloud
1.3 Benefits and Disadvantages of Cloud Computing
1.4 Cloud Infrastructure Management
1.5 Infrastructure as a Service
Unit II Abstraction and Virtualization 6 Hrs
2.1 Using Virtualization Technology
2.2 Load Balancing and Virtualization – The Google Cloud
2.3 Understating Hypervisors – Virtual Machine types
2.4 Exploring SaaS – salesforce.com
2.5 Exploring PaaS- force.com, Exploring IaaS – Amazon EC2
Unit III Programming Environment 6 Hrs
3.1 Features of Cloud and Grid Platforms,
3.2 Programming Support of Google App Engine
3.3 Programming on Amazon AWS
3.4 Microsoft Azure
3.5 Emerging Cloud Software Environments.
Savtribai Phule Pune University, Pune 18
CBCS 2019-20 TYBCA
SEMESTER V
Companion Courses:
● BCA 351 DSE I (Programming in Java)
Course Objectives:
● To learn implementation of object-oriented concepts with Java.
● To understand collection classes and interfaces.
● To know the process of application development using Graphical User Interface (GUI).
● To acquire knowledge about handling databases using Java.
● To study web components for developing web applications.
Course Outcomes:
After Completion of this course, students will able to
● Identify classes, objects, class members and relationships for a given problem.
● Design end to end applications using object oriented constructs.
● Apply collection classes for storing java objects.
● Use Java APIs for program development.
● Handle abnormal termination of a program using exception handling.
Database Programming : 04
Use DriverManager class, Statement, PreparedStatement
5 interface, ResultSet interface, ResultsetMetaData Interface to
Execute DML commands
SEMESTER V
Display all rows of the data set having height greater than 120.
Display all rows of data set in ascending order of weight.
a. (Use inbuilt data set woman)
10. Write a R program to perform the following:
Display all the cars having mpg more than 20.
Subset the data set by mpg column for values greater than
15.0
Display all cars having four gears. (Use inbuilt data set mtcar)
11. Write a R Program to perform the following:
Create a Scattered plot to compare wind speed and
temperature.
Create a Scattered plot to show the relationship between
ozone and wind values by giving appropriate values to colour
argument.
Create a Bar plot to show the ozone level for all the days
having temperature > 70. (Use inbuilt datasetair quality)
2 Classification – Decision tree 03
Conversion of Categorical values in numeric format for a given
dataset.
Perform Classification using Decision Tree algorithm
SEMESTER V
BCA 358: DSE III Laboratory (Operating Systems and AI)
Teaching Scheme: Credits Examination Scheme:
PR: 4* Hours/Week 02 Continuous Evaluation : 15 Marks
End-Semester Exam : 35 Marks
Prerequisite Courses:
● BCA123 Operating System Concepts
Companion Courses:
BCA 353 : DSE III (Principles of Operating Systems)
BCA 354: SEC I (Artificial Intelligence)
Course Objectives:
● To study the process management and scheduling.
● To Study Memory Management
● To study and understand searching techniques
Course Outcomes:
After successful completion of this course, learner will be able to:
● Implement algorithms for Process scheduling and Memory management
● Describe process synchronization and multithreading
● Compare and contrast the algorithms for memory management and its allocation policies.
● Use searching algorithms
● Design a simple Expert system
Lab Course Contents
Note down process ids of the parent and the child processes,
check whether the control is given back to the parent after the
child process terminates.
A B C D A B C D A B C D
P0
0 0 1 2 0 0 1 2 1 5 2 0
P1
1 0 0 0 1 7 5 0
P2
1 3 5 4 2 3 5 6
P3
0 6 3 2 0 6 5 2
P4
0 0 1 4 0 6 5 6
b)If the request from process P4 arrives as (0, 0, 4, 1), can it be granted
immediately by keeping system in safe state?
Find the most cost-effective path to reach the final state from
initial state using A* Algorithm.
Consider g(n) = Depth of node and h(n) = Number of misplaced
tiles.
6 Assignment 6: Implement AO* Algorithm 4
Sample Assignment
Implement AO* algorithm on the following graph.
Semester
VI
SEMESTER VI
BCA 361: Android Programming
Teaching Scheme: Credits Examination Scheme:
Theory: 05 Hrs./Week 04 Continuous Evaluation: 30 Marks
End-Semester: 70 Marks
Pre-requisite Course:
● BCA 351: DSE I (Programming in Java)
● BCA 356: DSE I Lab (Programming in Java)
Companion Course:
● BCA 366: DSE IV (Android Programming)
Course Objectives:
● To understand the Android Operating System
● To study Android Apps Development Cycle
● To learn to create Android Applications.
Course Outcomes:
After successful completion of this course, learner will be able to:
● Describe the process of developing mobile applications.
● Create mobile applications on the Android Platform.
● Design and implement mobile applications involving data storage in SQLite database
● Use location-based services while developing applications
Course Contents
Unit I Introduction to Android 06 Hrs
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 10 Hrs
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. Toast
SEMESTER VI
BCA 362: DSE-V Programming in Go
Teaching Scheme: Credits Examination Scheme:
Theory: 05 Hrs./Week 04 Continuous Evaluation: 30 Marks
End-Semester : 70 Marks
Pre-requisite Course:
● BCA122: Advanced C Programming
● BCA241: Object Oriented Programming and C++
Companion Course:
● BCA367: DSE V Lab (Programming in GO and IoT)
Course Objectives:
● To study various programming constructs in GO
● To understand salient features in GO
● To know advance features in GO
Course Outcomes:
After successful completion of this course, learner will be able to:
● Describe the core features and concepts in Go
● Write simple Go programs using functions
● Apply defining methods and Go Interfaces
● Use Go routines and Channels
● Explore Go Packages
Course Contents
Unit I Introduction 10 Hrs
1.1 Go Runtime and Compilations
1.2 Keywords and Identifiers
1.3 Constants and Variables
1.4 Operators and Expressions
1.5 Local Assignments
1.6 Booleans, Numeric , Characters
1.7 Pointers and Addresses
1.8Strings
1.9 if-else, switch, for loop
1.10 Iterations
1.11 Using break and continue
Unit II Functions 10 Hrs
2.1 Parameters and Return Values
2.2 Call by Value and Reference
2.3 Named Return Variables
2.4 Blank Identifiers
2.5 Variable Argument Parameters
2.6 Using defer statements
2.7 Recursive Functions
2.8 Functions as Parameters
Unit III Working with Data 8 Hrs
3.1 Array Literals
3.2 Multidimensional Arrays
3.3 Array Parameters
3.4 Slices and Slice Parameters
SEMESTER VI
BCA 363: DSE VI Software Project Management
Teaching Scheme: Credits Examination Scheme:
Theory: 05 Hrs./Week 04 Continuous Evaluation: 30 Marks
End-Semester: 70 Marks
Pre-requisite Course:
● BCA243 Software Engineering
Companion Course:
● BCA 368 DSE VI Project Laboratory
Course Objectives:
● To understand the fundamentals of Software Project Management
● To introduce Software project planning and management tools
● To study software project scheduling and tracking
● To know the agile project management
● To learn managing people in software project
Course Outcomes:
On Successful completion of the course, learners should be able to
Comprehend Software Project Management Concepts
Use various tools for Software Project Management Schedule various activities in
software projects
Track a project and manage changes
Apply Agile Project Management concepts
Analyze staffing process for team building and decision making
Course Contents
Unit I Introduction to Software Project Management 10 Hrs
1.1 Project Definition
1.2 Project versus Flow type work
1.3 Project Lifecycle
1.4 Processes and Knowledge Areas in Project Management (PM)
1.5 Build or Buy decision,
1.6 Work Breakdown Structure (WBS) and its types
1.7 Introduction to PMBOK,
1.8 Program and Portfolio Management
Unit II Project Planning and Project Management Tools 10 Hrs
2.1 Project Planning
2.2 Steps for Project Planning,
2.3 PERT and Gantt Charts
2.4 Introduction to Project Management using Gantt Project
2.5 Objectives of Activity planning
2.6 Project Schedules, Activities, Sequencing and Scheduling
2.7 Network Planning Models,
2.8 Formulating Network Model.
Unit III Activity based Scheduling 10 Hrs
3.1 Introduction
3.2 Objectives of Activity Planning
3.3 Activity relationships (FS, SF, SS, FF)
SEMESTER VI
BCA364: SEC III Management Information System
Teaching Scheme: Credits Examination Scheme:
Theory: 3 Hrs./Week 02 Continuous Evaluation: 15 Marks
End-Semester : 35 Marks
Pre-requisite Course:
● BCA243 Software Engineering
Companion Course: None
Course Objectives:
To know the role of information technology and decision support systems in business
model.
To learn the fundamental principles of information systems
To understand the principles and techniques used for management and decision making
To explore various applications of MIS
Course Outcomes:
After successful completion of this course, learners will able to
Describe MIS, BPR, EMS
Compare MIS with BPR, DSS and EMS
Identify various ERP modules for a given application
List the applications of MIS in Manufacturing and service sectors
Course Contents
Unit I Introduction to MIS 3Hrs
1.1 Introduction to MIS
1.2 Definition
1.3 Role of MIS
1.4 Impact of MIS
1.5 MIS as a control system.
1.6 MIS: a support to the management.
Unit II Decision Making and Information 5 Hrs
2.1 Decision Making Process and models
2.2 Decision Analysis by Analytical Modeling
2.3 Behavioral Concepts in Decision-Making
2.4 Organizational Decision-Making
2.5 Information Management: Classification of Information
2.6 Methods of Data and information collection
Unit III Business Process Re-engineering (BPR) 5 Hrs
3.1 Introduction to BPR and Business process
3.2 Process Model of the organization
3.3 Value stream Model of Organization
3.4 Relevance of Information Technology
3.5 MIS and BPR
Unit IV Enterprise Management Systems (EMS) 7Hrs
4.1 Introduction to EMS and ERP
4.2 ERP Model, Modules, Benefits of ERP
SEMESTER VI
BCA365: SEC IV Internet of Things (IoT)
Teaching Scheme: Credits Examination Scheme:
Theory: 3 Hrs./Week 02 Continuous Evaluation: 15 Marks
End-Semester : 35 Marks
Pre-requisite Course:
BCA121: Computer Organization
BCA125: Computer Organization Laboratory
BCA233: Computer Networks
BCA355: SEC II (Cloud Computing)
Companion Course:
BCA367 DSE V Laboratory (Programming in GO and IoT)
Course Objectives:
● To understand fundamentals of Internet of Things (IoT) and Embedded Systems
● To know methodologies for IoT application development
● To study the IoT protocols, cloud platforms and security issues in IoT
● To learn real world application scenarios of IoT along with its societal and economic impact
Course Outcomes:
On successful completion of the course, learners should be able to
Define Embedded Systems and the Internet of Things
Apply enabling technologies for developing IoT systems
Design simple IoT applications
Analyze protocols for communication among IoT devices
Describe cloud-based IoT systems
Comprehend security issues in IoT applications
Course Contents
Unit I Introduction to Embedded Systems 5 Hrs
1.1 Definition, Characteristics of Embedded System,
1.2 Real time systems, Real time tasks 1.3 Processor basics: General
Processors in Computer Vs Embedded Processors, Micro controllers and
Properties, Components of Microcontrollers, System-On- Chip and its
examples
1.4 Components of Embedded Systems,
1.5 Introduction to embedded processor.
IoT
Unit III Introduction to IoT Design Methodology 5 Hrs
3.1 Design Steps
3.2 Basics of IoT Networking, Networking Components, Internet Structure
3.3 IoT Communication Models and IoT Communication APIs,
3.4 Sensor Networks
3.5 Four pillars of IoT: M2M, SCADA,WSN, RFID
Reference Books:
1. Arshdeep Bahga,Vijay Madisetti, “Internet of Things– A hands- on approach”,
Universities Press, ISBN: 0: 0996025510, 13:978-996025515
2. Olivier Hersent, David Boswarthick, Omar Elloumi, “The Internet of Things: Key
Applications and Protocols”, 2nd Edition, Wiley Publication,ISBN:978-1-119-99435-0
3. Dawoud Shenouda, Peter Dawoud, “Microcontroller and Smart Home Networks”,
ISBN: 9788770221566, e-ISBN: 9788770221559
4. Charles Crowell, “Internet of Things for Beginners: An Easy-to-Understand Introduction to
IoT”, ISBN-13 : 979-8613100194
5. David Hanes, Gonzalo Salgueiro, Robert Barton, Jerome Henry, “IoT
Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of
Things”, Cisco Press, ISBN-13: 978-1-58714-456-1 ISBN-10: 1-58714-456-5
SEMESTER VI
BCA366: DSE IV Laboratory (Android Programming)
Teaching Scheme: Credit Examination Scheme:
PR: 4* Hours/Week 02 Continuous Evaluation : 15 Marks
End-Semester Exam : 35 Marks
Prerequisite Courses:
BCA 351: DSE I (Programming in Java)
BCA 356: DSE I Lab (Programming in Java)
Companion Courses:
BCA – 361 Android Programming
Course Objectives:
● To understand the Android Operating System and
● To study Android Apps Development Cycle
● To learn to create Android Applications.
Course Outcomes:
After completion of this course, students will able to
● Describe the process of developing mobile applications.
● Create mobile applications on the Android Platform.
● Design and implement mobile applications involving data storage in SQLite database
● Use location-based services while developing applications
Lab Course Contents
Assignment No Assignment Name No. Of Sessions
1 Introduction to Android 02
2 Activities, Fragments and Intents 04
3 Android User Interface 04
4 Designing User Interface with Views 05
5 Databases-SQLite, Messaging and E-mail 05
6 Location-Based Services and Google Map 04
Total Number of Sessions 24
Sample Assignments Programs
Assignment 1 Introduction to Android
Install Android Studio and build simple Hello World application.
Create a Simple Application Which Send ―Hello‖ message from one activity to
another with help of Button (Use Intent).
Assignment 3 Android User Interface
Design following-add a border to an Android Layout
SEMESTER VI
BCA367: DSE V Laboratory (Programming in GO and IoT)
Teaching Scheme: Credits Examination Scheme:
PR: 4* Hours/Week 02 Continuous Evaluation : 15 Marks
End-Semester Exam : 35 Marks
Prerequisite Courses:
Knowledge of Programming Languages C, C++, Java, Python
Companion Courses:
BCA362 Programming in GO
BCA365 Internet of Things (IoT)
Course Objectives:
To introduce essential programming features in GO
To become familiar with programming techniques in GO
To understand the technique of building Packages and File handling
To learn developing simple IoT applications
Course Outcomes:
On completion of this course, students will be able to:
Write programs using features supported in GO
Handle errors and utilize Goroutines and Channels
Write programs on File handling
Compare and contrast features of GO with other object oriented languages
Design Simple IoT application
Lab Course Contents
Assignment No Assignment Name No. Of Sessions
Programming in GO
1 Introduction to Go Programming 02
2 Functions 03
3 Working with data 03
4 Methods and Interfaces 04
5 Go routines and channels 03
6 Packages and files 03
Internet of Things (IoT)
7 Interfacing Raspberry-Pi/ Adriano with IR sensor 02
8 Interfacing Raspberry-Pi/ Beagle board with temperature 02
sensor
9 Interfacing Raspberry-Pi/ Beagleboard with camera 02
24
Sample Assignments Programs
Assignment 1 SET A
1. WAP in go language to print Student name, rollno, division and college name
2. WAP in go language to print whether number is even or odd.
3. WAP in go language to swap the number without temporary variable.
SET B
1. WAP in go to print table of given number.
2. WAP in go language to print PASCALS triangle.
Assignment 4 SET A
1. WAP in go language to create an interface shape that includes area and
perimeter. Implements these methods in circle and rectangle type.
2. WAP in go language to print multiplication of two numbers using method.
3. WAP in go language to create structure author. Write a method show() whose
receiver is struct author.
SET B
1. WAP in go language to create structure student. Write a method show() whose
receiver is a pointer of struct student.
2. WAP in go language to demonstrate working type switch in interface.
3. WAP in go language to copy all elements of one array into another using
method.
SET C
Savtribai Phule Pune University, Pune 47
CBCS 2019-20 TYBCA
1. WAP in go language to create an interface and display it‟s values with the help
of type assertion.
2. WAP in go language to store n student information(rollno, name, percentage)
and write a method to display student information in descending order of
percentage.
3. WAP in go language to demonstrate working embedded interfaces.
Assignment 5 SET A
1.WAP in Go to illustrate how to create an anonymous Goroutine.
2. WAP in Go how to create channel and illustrate how to close a channel using
for range loop and close function.
3. WAP in Go maingoroutine computes the 10th fibonacci number using an
inefficient recursive algorithm.
SET B
1. WAP in GO prints out the numbers from 0 to 10, waiting between 0 and 250
ms after each one using delay function .
2. WAP in GO prints “from 1” every 2 seconds and “from 2” every 3 seconds.
select picks the first channel that is ready and receives from it. If more than one
of the channels are ready then it randomly picks which one to receive from. If
none of the channels are ready, the statement blocks until one becomes available.
3.WAP in Go to illustrate channels buffering.
SET C
1 WAP in GO . Lambda function handler using structured types you can also pass
in structured events to your function handler:
2. WAP in GO implement multiple goroutine function and schedule is determined
by the scheduler.
3. WAP in Go program such that the squares are calculated in a separate
Goroutine, cubes in another Goroutine and the final summation happens in the
main Goroutine
Assignment 6 SET A
1. WAP to create student struct with student name and marks and sort it based on
student marks using sort package
2. WAP in Go language using user defined package calculator that performs one
calculator operation as per the user's choice.
3. WAP in Go language to create an user defined package to find out the area of a
rectangle.
SET B
1. WAP in Go language to add two integers and write code for unit test to test this
code.
2. WAP in Go language to subtract two integers and write code for table test to
test this code.
3. Write a function in Go language to find square of a number and write a
benchmark for it.
SET C
1. WAP in Go language to read a XML file into structure and display structure
2. WAP in Go language to print file information.
3. WAP in Go language to add or append content at the end of text file.
Assignment 7 Understanding the connectivity of Raspberry-Pi/ Adriano with IR sensor.
Write a program to detect obstacle and notify a user using LEDs
Semester VI
BCA368: DSE VI Project Laboratory
Teaching Scheme: Credits Examination Scheme:
PR: 4* Hours/Week 02 Continuous Evaluation : 15 Marks
End-Semester Exam : 35 Marks
Prerequisite Courses:
BCA243 Software Engineering
Companion Course: BCA363 DSE VI (Software Project Management)
Course Objectives:
1. To understand concepts of Project Management
2. To know how various tools for development and management of software projects are used to
carry out various tasks involved
3. To learn the importance of project documentation
Course Outcomes:
After completion of this course, learners will able to
1. Demonstrate a sound technical knowledge of selected project topic.
2. Apply techniques for project management
3. Create various documents used during the development of the project and a project report
Project Implementation Guidelines:
Sr. Guidelines
No.
1 Students shall choose any topic for project work in consultation with project guide, Project
In-charge and head of the department.
2 The students shall work on a Project in a group of not more than three students.
3 Students are expected to work on the chosen project during the entire semester.
4 Students shall undertake application oriented/web-based/database-oriented/research based
work.
5 Students shall successfully implement the chosen work. Only a hypothetical / theoretical
study shall not be accepted.
6 Students shall choose any appropriate programming language/ platform, computational
techniques and tools in consultation with the guide, In-charge and the head of the
department.
7 The faculty members from affiliated college shall act as a project guide for each project
group with equal distribution of groups amongst each eligible faculty.
8 The guide shall track and monitor the project progress on a weekly basis by considering the
workload of 4 laboratory hours per week.
9 The project work shall be evaluated based on the novelty of the topic, scope of the work,
relevance to computer science, adoption of emerging techniques/technologies and its real-
world application etc.
10 Students shall prepare a project report with the following contents:
a) Title Page
b) Certificate
c) Index Page detailing description of the following with their sub sections:-
- Title: A suitable title giving the idea about what work is proposed.
- Introduction: An introduction to the topic giving proper background of the topic.
- Requirement Specification: Specify Software/hardware/data requirements.
- System Design details :Methodology/Architecture/UML/DFD/Algorithms/protocols
used(whichever is applicable)
- System Implementation: Code implementation
Savtribai Phule Pune University, Pune 50
CBCS 2019-20 TYBCA
11 The Project report should be prepared in a spiral bound form with adequate number of
copies. Copy shall be submitted to the guide and college for the records.
12 The Project work and report shall be certified by the concerned Project guide and Head of
the department.
13 Students shall make a presentation of working project and will be evaluated as per the
Project evaluation scheme as detailed below
Assignments using Gantt Project tools
Students are advised to carry out the following assignments w.r.t. their chosen project topics
Evaluation Scheme
II. End Semester Examination in the form of presentation/demonstration and viva: 35 marks
Description Marks
Presentation & Project Report 15
Demonstration of the Project 15
Viva 05
Total 35
Note: Submission of Certified Project Report is mandatory for appearing the Practical
Examination (Project).
TYBCA Semester-V
Name of the Coordinator: Dr. Pallawi U Bulakh
Name of the Institute: PES Modern College of Arts, Science and Commerce, Ganeshkhind, Pune
2.Surekha Jadhav
2.Rajesh Dhumal
3. MadhuriKhadtare
2. Ambike Satish
TYBCA Semester-VI
Subject Code Name of the Course Name of the Team Names of Team
Leader Members
BCA 361 DSE IV – Android Kamil Khan 1. Satish Mulgi
Programming 2.Vrushali Shinde
BCA 362 DSE V-Programming in Dr. Kalyani Salla 1. Dr.DipaliMeher.
Go 2.Thorat Surekha
BCA 363 DSE VI-( Software KishorDhane 1. Rupali Jadhav
Project Management) 2.Manisha Jagdale
3.Nagesh Dhyatonde
BCA 366 DSE IV Laboratory MohsinTamboli 1. RajashreeNehe
(Android Programming) 2. Deepak Kumbhar
BCA 367 DSE V Laboratory Dr. Kalyani Salla 1. Neeta Nadgude
(Programming in GO 2. SonaliPowar
and IoT)
BCA 368 DSE VI Project Dr.ArunGangarde 1. BhushanNikam
Laboratory 2. DeepaliJagdale
3.Priyamvada Patil
BCA 364 SEC III Management Rahul Patil 1.Deepak Derle
Information System 2. SudarshanLakhdive
3. Abhishek Awate
BCA 365 SEC IV Internet of Dr. A.B. Nimbalkar 1.Veena Gandhi
Things (IoT) 2.Rasika Rahalkar
3. Veena Gandhi
Acknowledgment
On behalf of Board of Studies in Computer Applications, it is a great pleasure and
honor for me to present the syllabi for TYBCA (Third Year Computer Applications -
2019 Pattern).
At the outset I am thankful to Hon. Vice Chancellor Prof. Dr. Nitin Karmalkar, Pro-
Vice Chancellor Prof. Dr. N S Umrani and Hon. Dean, Science and Technology,
Prof. Dr. M G Chaskar, SPPU, Pune for their guidance and motivation.
I am thankful each and every faculty members from all affiliated colleges, each
member of the subcommittee, all Heads of the departments and members of the BoS
Prof. Dr. R M Sonar, Dr. M N Shelar, Dr. Pallavi Bulakh and Dr. Razak Sayyad for
their help and support in preparation of this draft. Special thanks to all ex-BoS
members, Dr. Anjali Sardesai, Prof. Arun Gangarde, Prof. R A Patil and Mr.
Abhijeet Vichare for their inputs. I thank Prof. Dr. Manisha Bharambe for her
suggestions.
Regards,