SEMESTER 6

Course Category Theory Practical

Course
Code L T P C CH Core/ Elective/Skill Assessment Assessment
Name
Enhancement/Project IA MTA ETA CA MTA ETA
21CSH- Project 2 0 4 4 6 20 20 60 40 20 40
319 Based
EE
Learning in
Java with Lab

21CSP- Advanced 0 0 2 1 2 EE - - - 40 20 40
351 Programming
Lab – 2

21CST- Network 3 0 0 3 3 CR 20 20 60 - - -
352 Operating
System

21CST- Theory of 3 0 0 3 3 CR 20 20 60 - - -
353 Computation

21CSH- Mobile 2 0 2 3 4 CR 20 20 60 40 20 40
355 Application
Development
with Lab

21CST- Professional 3 0 0 3 3 DE 20 20 60 40 20 40
3** Elective-II

21CSR- Project-III 0 1 2 2 1 PR - - - 40 20 40
359

21TDP- Soft Skills : 0 0 2 1 2 SE 20 20 60 - - -

351 TPP
21TDT- Aptitude : 0 2 0 2 2 SE 20 20 60 - - -
352 TPP
21CST- Software 3 0 0 3 3 SE 20 20 60 - - -
360 Project
Management
: NTPP
21GPT-
General
322 1 0 0 1 1 AE - - - - - -
Proficiency
Total Credits 23 27
Cumulative Credits 134

Bachelor of Engineering (CSE) CS-201 Page 1

SN Program TITLE OF THE COURSE L T P CH Per Course
code CS-201 Week Type
1 Project Based Learning in Java with 2 0 4 6 EE
Lab
21CSH-319 Course Code(s)
21CSH-319
PRE-REQUISITE 21CST-218
CO-REQUISITE 21CST-313,21CSP-314,21CST-315,21CST-316
,21CSP-321
ANTI-REQUISITE 21CSP-356

a. Course Description
Nowadays Industry expects engineers to have skills like critical thinking, problem solving, ability to
work in team, make presentation of the ideas and technology developed etc. Project Based Learning
is a novel teaching method, designed to address these requirements to make students ready for
Industry. It helps students to learn better and it motivates students to gain knowledge, and
remember it longer.

b. Course Objectives
• Programming in the Java programming language.
• Knowledge of object-oriented paradigm in the Java programming language.
• The use of Java in a variety of technologies and on different platforms.
• Understand the server side programming.

c. Course Outcomes
CO1 Recall and understand the various fundamental concepts of Java
CO2 Define and demonstrate the numerous paradigms of OOPs and exception handling in Java
CO3 Illustrate and classify the advance java concepts such as collections and Wrapper classes
CO4 Outline and apply the concept of Input Output streams and JDBC
CO5 Analyze and relate the various functionalities of Servlets, JSP, XML and Web service

d. Syllabus
Unit-1 INTRODUCTION Contact Hours: 10
Java Fundamentals Introduction to Java. Difference between C++ and Java. Keywords, Tokens,
Data types. Use of public, private and protected
OOPS using Java Use of class and method in Java. Inheritance, Abstraction, Polymorphism,
Encapsulation and data privacy. Difference between method overloading and
method overriding
Exception Handing Introduction to Exceptions. Difference between error and exception. Use of
try, catch and throw. Difference between throw and throws. Types of
Exceptions, Exception handling in Java
<Experiment No 1> Create a application to save the employee information using arrays.
< Experiment No Design and implement a simple inventory control system for a small video
2> rental store.
< Experiment No Create a application to calculate interest for FDs, RDs based on certain
3> conditions using inheritance.
Unit-2 COLLECTIONS AND FRAMEWORK Contact Hours: 10
Collection Use of Collections in Java. ArrayList, LinkedList, HashMap, TreeMap, HashSet in
Framework Java.. Multithreading in Java. Thread Synchronization. Thread Priority, Thread

Bachelor of Engineering (CSE) CS-201 Page 2

 LifeCycle.
Wrapper Classes, Use of wrapper classes in Java- Integer, Character, Long, Boolean. Autoboxing
I/O Streams and and Unboxing. Byte stream, Character stream, Object serialization, cloning.
Annotations System defined annotations, Custom annotations, application of annotations,
Testing using JUnit.
JDBC Database connectivity, Types of Drivers for connection, Connection Example.
CRUD operations using Database, Configuring various types of drivers for Java
Database Connectivity, MVC Model for project development, Sequence, Dual
table , Date type management in Java
< Experiment No Create a program to set view of Keys from Java Hashtable.
1>
< Experiment No Create a program to show the usage of Sets of Collection interface.
2>
< Experiment No Write a Program to perform the basic operations like insert, delete, display
3> and search inlist. List contains String object items where these operations are
to be performed.
< Experiment No4> Create a menu based Java application with the following options.1.Add an
Employee2.Display All3.Exit If option 1 is selected, the application should
gather details of the employee like employee name, employee id, designation
and salary and store it in afile. If option 2 is selected, the application should
display all the employee details. If option 3 is selected the application
shouldexit.
Unit-3 (Name of the Unit) Contact Hours: 10
Servlets and JSP Servlet Lifecycle, Generic Servlet, Http Servlet, Linking Servlet to HTML,
HttpServlet Request and Response, Servlet with JDBC, Configuring project
using servlet, Servlet Config and Servlet Mapping JSP declaration, JSP
directives, JSP Scriptlets, JSP include tag, JSP page tag, JSTL.
XML and Web Structure of XML, Elements of XML 1.0, 2.0, DTDs, XML parser, DOM parser,
Services Web services using REST and HTTP, Creating web services for database access
via remote servers
< Experiment No Create a palindrome creator application for making a longest possible
1> palindrome out of given input string.
< Experiment No Create a Servlet/ application with a facility to print any message on web
2> browser.
< Experiment No Create JSP application for addition, multiplication and division.
3>

Text books:
1. Herbert Schildt, Java : The Complete Reference, 9th Edition, Oracle Press.
2. Gary Cornell, Core Java Volume II Advanced Features, 8th Edition, Pearson Education.
3. Jim Keogh, J2ee : Complete Reference, 1st Edition, Tata McGraw Hill.

Reference books:
1. James Gosling, Ken Arnold and David Holmes, Java Programming Language, 5th Edition, Pearson
Education.
2. Gary Cornell, Core Java Volume I, 3rd Edition, Pearson Education

Bachelor of Engineering (CSE) CS-201 Page 3

SN Program TITLE OF THE COURSE L T P CH Per Course
code Week Type*
2 CS-201 Advance Programming Lab-II 0 0 2 2 EE

21CSP-351 Course Code(s)

21CSP-351
PRE-REQUISITE 21CSP-314
CO-REQUISITE 21CST-352,21CST-353,21CST-354,21CST-355,21CST-
357,21CST-371,21CSP-356
ANTI-REQUISITE 21CST-475

a. Course Description
Competitive programming is the course in which students will learn how to apply algorithms in order
to solve complex problems. The goal of this course is to teach students how to apply familiar
algorithms to non-intuitive problems.

b. Course Objectives
Competitive programming is the course in which students will learn how to apply algorithms in order
to solve complex problems.
The goal of this course is to teach students how to apply familiar algorithms to non-intuitive
problems.

c. Course Outcomes
CO1 Describe how algorithmic problems are solved
CO2 Recognize the time and memory complexity of an algorithm or a structure
CO3 Explain the concrete algorithms and data structures
CO4 Analyze the given problem and recognize sub-problems
CO5 Apply the knowledge on a wider set of problems to achieve better time complexity.

d. Syllabus
Unit-1 Data Structures Contact Hours:
Arrays, https://leetcode.com/problems/3sum/
Stacks, Queues https://leetcode.com/problems/jump-game-ii/
and linked list https://leetcode.com/problems/valid-parentheses/
https://leetcode.com/problems/simplify-path/
https://leetcode.com/problems/implement-queue-using-stacks/
https://leetcode.com/problems/queue-reconstruction-by-height/
https://leetcode.com/problems/merge-two-sorted-lists/
https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
https://leetcode.com/problems/reorder-list/
Divide and https://leetcode.com/problems/count-and-say/
conquer https://leetcode.com/problems/1-bit-and-2-bit-characters/
https://leetcode.com/problems/jewels-and-stones/
https://leetcode.com/problems/snakes-and-ladders/
https://leetcode.com/problems/water-and-jug-problem/
https://leetcode.com/problems/find-and-replace-in-string/
Heap https://leetcode.com/problems/kth-largest-element-in-a-stream/

Bachelor of Engineering (CSE) CS-201 Page 4

 https://leetcode.com/problems/last-stone-weight/
https://leetcode.com/problems/race-car/
https://leetcode.com/problems/cheapest-flights-within-k-stops/
https://leetcode.com/problems/k-closest-points-to-origin/
https://leetcode.com/problems/network-delay-time/
https://leetcode.com/problems/distant-barcodes/
https://leetcode.com/problems/furthest-building-you-can-reach/
https://leetcode.com/problems/swim-in-rising-water/
Unit-2 (Name of the Unit) Contact Hours:
Greedy https://leetcode.com/problems/candy/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
https://leetcode.com/problems/remove-duplicate-letters/
https://leetcode.com/problems/can-place-flowers/
https://leetcode.com/problems/assign-cookies/
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-
transaction-fee/
https://leetcode.com/problems/lemonade-change/
https://leetcode.com/problems/boats-to-save-people/
https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/
https://leetcode.com/problems/three-equal-parts/
Trees https://leetcode.com/problems/binary-tree-inorder-traversal/
https://leetcode.com/problems/same-tree/
https://leetcode.com/problems/symmetric-tree/
https://leetcode.com/problems/balanced-binary-tree/
https://leetcode.com/problems/path-sum/
https://leetcode.com/problems/count-complete-tree-nodes/
https://leetcode.com/problems/sum-of-left-leaves/
https://leetcode.com/problems/delete-node-in-a-bst/
https://leetcode.com/problems/diameter-of-binary-tree/
https://leetcode.com/problems/binary-tree-tilt/
Backtracking https://leetcode.com/problems/binary-watch/
https://leetcode.com/problems/stickers-to-spell-word/
https://leetcode.com/problems/all-paths-from-source-to-target/
https://leetcode.com/problems/word-ladder-ii/
https://leetcode.com/problems/subsets/
https://leetcode.com/problems/combinations/
https://leetcode.com/problems/palindrome-partitioning/
Graph https://leetcode.com/problems/is-graph-bipartite/
https://leetcode.com/problems/gray-code/
https://leetcode.com/problems/k-th-symbol-in-grammar/
https://leetcode.com/problems/group-the-people-given-the-group-size-they-
belong-to/
https://leetcode.com/problems/the-skyline-problem/
https://leetcode.com/problems/find-the-difference/

Bachelor of Engineering (CSE) CS-201 Page 5

 https://leetcode.com/problems/predict-the-winner/
https://leetcode.com/problems/construct-the-rectangle/
Dynamic https://leetcode.com/problems/best-time-to-buy-and-sell-stock/
Programming https://leetcode.com/problems/decode-ways/
https://leetcode.com/problems/scramble-string/
https://leetcode.com/problems/climbing-stairs/
https://leetcode.com/problems/unique-paths/
https://leetcode.com/problems/maximum-subarray/
https://leetcode.com/problems/longest-palindromic-substring/
https://leetcode.com/problems/house-robber-ii/
https://leetcode.com/problems/range-sum-query-immutable/
https://leetcode.com/problems/word-break/

e. Assessment Pattern - Internal and External

The performance of students is evaluated as follows:
Theory
Components Continuous Internal Assessment Semester End Examination (SEE)
(CAE)
Marks 60 40
Total Marks 100

f. Internal Evaluation Component

Sr. Type of Weightage of actual Frequency Final Weightage in Remarks

No. Assessment conduct of Task Internal
Assessment
1 Conduct 10 Marks per Practical 1 per 60 Marks per course
practical
2 Report 10 Marks per Practical 1 per
practical
3 Viva- Voce 20 Marks per Course 1 per Course

g. CO-PO Mapping
Course
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
Outcom
1 2 3 4 5 6 7 8 9 0 1 2 1 2
e
CO1 3 3 3 1 2 2 3
CO2 3 3 3 1 2 2 3
CO3 3 3 3 1 2 2 3
CO4 3 3 3 1 2 2 3
CO5 3 3 3 1 2 2 3

Bachelor of Engineering (CSE) CS-201 Page 6

SN Program Code- Course Title L T P CH Per Course
CS-201 Week Type
3 21CST-352 Network Operating System 3 0 0 3 CR
Pre-requisite 21CST-313
Co-requisite 21CST-353,21CST-354,21CST-355,21CST-357,21CST-371,21CSP-356
Anti-requisite 21CST-432

a. Course Description
This course will familiarize students with the concepts of computer networks. The course also includes
an introduction to the OSI and TCP/IP model. Besides this, students will study the architecture of DNS,
DHCP and RPC. The course will also introduce the students to the Microsoft Network Monitoring Tool
Netmon and guides them the installation and configuration of the tool. Also, the various concepts of
operating system are elaborated in detail in this course. The installation and configuration of
Microsoft Server 2008 is discussed in detail. The concepts of Active Directory Administration are
elaborated.

b. Course Objectives
To become familiar with the architecture of RPC, DNS and DHCP, to learn the basic features and
functionalities of network monitoring tools, window server 2008 and active directories.
c. Course Outcomes

CO1 Explain and recall the TCP/IP and OSI reference models, the architecture of DNS, DHCP and RPC
CO2 Analyze and apply the configurations of Network Monitoring Tool.
CO3 Recognize the basic structure of operating systems and classify roles and responsibilities of an
operating System.
CO4 Investigate and demonstrate the features of Windows server 2008.
CO5 Examine and illustrate the various features of Active directories

d. Course Syllabus
Unit-1 Introduction to computer networks Contact Hours:15
Chapter-1.1 Reference Model: OSI Reference Model, TCP/IP reference model, Core
protocols of TCP/IP, IP routing, IProuters, Routing Tables
Chapter-1.2 DNS Architecture, Understanding the DNS Domain Namespace, DNS domain
name hierarchy, DNS and Internet domains, DNS delegation
Chapter-1.3 Introduction to DHCP,DHCP Architecture, Benefits to DHCP,DHCP
Terminologies and DHCP Server Responsibility.
Chapter-1.4 Introduction to RPC, RPC Dependencies and Interaction, RPC
Architecture, RPC Component and RPC Processes and Interaction.
Chapter-1.5 Introduction to netmon tool, Installation and configuration of Netmon.
Unit-2 Introduction to OS and Window Servers Contact Hours:15
Chapter-2.1 Introduction to operating system, Types ofoperatingSystem: Mainframe,
Desktop, Multiprocessor, Distributed, Clustered, Multiprogramming, Real time,
Embedded and Time Sharing
Chapter-2.2 Process Management Component, Memory Management component, I/O
Management component, File Management component, Protection System,
and Networking management component. Comparison of Microsoft OS
(Desktop, Server and Client), Hardware RequirementforOS(Desktop, Server and
Bachelor of Engineering (CSE) CS-201 Page 7
 client), Workgroups and Domains.
Chapter-2.3 Plan for a server-roles and installing windows server core, configure server
core, Add and configure server roles, add backup feature and migrate roles
from previous versions of windows server.
Chapter-2.4 Windows server registry, Control Panel, Delegate administration, Add and
removes feature in window server, initial configuration tasks, server manager
console, server manager wizards and windows power shell.
Unit-3 Active Directory Contact Hours:15
Chapter-3.1 Introducing Hyper-V, Virtual Machines
Chapter-3.2 role of an AD DS Server, features in AD DS, Common Terminologies and Active
Directory Concepts, Active Directory Schema, Active Directory Objects, Active
Directory Concepts, Active Directory Data structure and storage architecture,
Active Directory Structure and storage components, DNS support for active
directory, active directory DNS support components
Chapter-3.3 Installing a new forest by using the graphical user interface (GUI),
Understanding active directory domain. Servicex functional Levels.
Chapter-3.4 Active Directory Users and Computers. Managing organizational units using
Active Directory Users and Computers, Managing Trusts using Active directory
domains and trusts and managing forest trusts using active directory domains
and trusts snap-in

e. Textbooks:
1. Data communication &Networking, Frozen Tata McGraw Hill Publication Buy Data
Communications and Networking | 5th Edition Book Online at Low Prices in India | Data
Communications and Networking | 5th Edition Reviews & Ratings - Amazon.in
2. Data & computer communications, stalling PHI new Delhi.
3. Operating system principles, 7th edition by Abraham Silberschatz, Peter Baer Galvin, Greg
Gagne.
4. Mastering Microsoft Windows Server 2008 R2, Mark Minasi, Darril Gibson, Aidan Finn, Wendy
Henry, Byron Hynes

f. References books:
1. Operating Systems Design and Implementation (Prentice Hall Software Series), Andrew S
Tanenbaum, Albert S Woodhull
2. Zenoss Core Network and System Monitoring, Michael Badger Buy Zenoss Core 3.x Network
and System Monitoring Book Online at Low Prices in India | Zenoss Core 3.x Network and
System Monitoring Reviews & Ratings - Amazon.in
3. Microsoft Windows Server 2008 - https://docs.microsoft.com/en-us/troubleshoot/windows-
server/windows-server-eos-faq/end-of-support-windows-server-2008-
2008r2#:~:text=More%20information%20%20%20%20Product%20%20,%20%204%2F14%2F20
20%20%2016%20more%20rows%20

Bachelor of Engineering (CSE) CS-201 Page 8

SN Program TITLE OF THE COURSE L T P CH Course
Code- Type
4 CS-201 Theory of Computation 3 0 0 3 CR

21CST-353 21CST-353
PRE-REQUISITE 21CST-315
CO-REQUISITE 21CST-352, 21CST-354,21CST-355,21CST-357,21CST-
371,21CSP-356
ANTI-REQUISITE 21CST-462

a. Course Description
This module introduces the theory of computation through a set of abstract machines that serve as
models for computation - finite automata, pushdown automata, and Turing machines - and examines
the relationship between these automata and formal languages.

b. Course Objectives
• To understand the concept of formal languages and their relation with finite automata.
• To study and design different finite automata.
• To study context free grammars and ambiguity related issues.
• To gain familiarization with Push-Down Automata and Turing Machines.
• To explore relationship between different classes of formal languages.

c. Course Outcomes
CO1 Gain knowledge of formal languages and classify basic operations on them.
CO2 Illustrate Finite Automata and differentiate DFA and NFA with the help of examples
CO3 Explain and support the properties of Regular sets using pumping lemma and theorems.
CO4 Analyze finite automata with output and compare and contrast CFG, Regular grammar, CNF,
GNF
CO5 Explain Chomsky hierarchy and be familiar with the concept of Turing Machine, Pushdown
Automata and justify with examples deterministic and non-deterministic Turing machine

d. Syllabus
Unit-1 (Name of the Unit) Contact Hours: 15
Introduction Basic Terminology: Alphabet, Formal Language and operations on formal
languages, Examples of formal languages
Finite automata Concept of Basic Machines, Properties and Limitations of Finite State
Machines, Deterministic Finite Automata(DFA), Non-Deterministic Finite
Automata(NFA), Equivalence of DFA and NDFA , Non-Deterministic Finite
automata with Λ-Transitions
Regular Regular Languages and Regular Expressions, Kleen’s Theorem. Arden’s Method
expression
Unit-2 (Name of the Unit) Contact Hours: 15
Properties of The Pumping Lemma for Regular sets, Application of the Pumping Lemma,
Regular sets Closure Properties of Regular Sets, Myhill- Nerode Theorem and Minimization
of Finite Automata, Minimization Algorithm
Finite Automata Moore and Mealy Machines. Equivalence of Moore and Mealy Machines
with output
Context Free Examples and Definitions, Derivation trees and ambiguity, An Unambiguous
Grammars CFG for Algebraic Expressions. Regular Grammar, Simplified forms and Normal
forms: Removal of useless symbols and unit production, Removal of Λ-moves,

Bachelor of Engineering (CSE) CS-201 Page 9

 Chomsky Normal Form (CNF), Griebach Normal Form (GNF)
Unit-3 (Name of the Unit) Contact Hours: 15
Context sensitive Context sensitive Language and grammar, Relation between languages of
Language classes
Pushdown Introduction and Definition of Push-Down Automaton, Applications of Push
Automata Down Automata
Turing Machines Definitions and Examples, Deterministic and Non- Deterministic Turing
Machines, Unsolvable Problems: A Non-recursive Language and an Unsolvable
Problem, PCP Problem and MPCP Problem
More General Recursively Enumerable and Recursive Languages, Unrestricted grammars,
Languages and Chomsky hierarchies of grammars.
Grammars

Text Books:
1. Martin J.C., “Introduction to Languages and Theory of Computation”, Tata McGraw-Hill
Publising Company Limited, 3rd Edition.
2. Hopcroft J.E. and Ullman J.D., “Introduction to Automata Theory Languages and
Computation”, Narosa Publications.

Reference Books:
1. Sipser,” Theory Of Computation, Cengage Learning.
2. Daniel I.A. Cohen, “Introduction to computer Theory”, John Wiley.

Bachelor of Engineering (CSE) CS-201 Page 10

SN Program Code- Course Title L T P CH Per Course
CS-201 Week Type

5 21CSH-355 Mobile Application Development 2 0 2 4 CR

with Lab
PRE-REQUISITE 21CSH-319- Project Based learning in java with Lab
CO-REQUISITE -
ANTI-REQUISITE -

a. Course Description
This course introduces students to programming technologies, design and development related
to mobile applications. Topics include accessing device capabilities, industry standards, operating
systems, and programming for mobile applications using an OS Software Development Kit (SDK).

b. Course Objectives
• Install and configure Android application development tools.
• Design and develop user Interfaces for the Android platform.
• Save state information across important operating system events.
• Apply Java programming concepts to Android application development.

c. Course Outcomes
CO1 Design and develop User Interfaces for the Android platform.
CO2 Ability to apply general programming knowledge in the field of developing mobile
applications.
CO3 Understanding of the specific requirements, possibilities and challenges when developing for
a mobile context.
CO4 Understanding of the interactions between user interface and
underlying application infrastructure.
CO5 At the end of this course student will Apply essential Android Programming concepts.

d. Syllabus
Unit-1 Introduction to Android Contact Hours: 15
Chapter 1.1 Introduction: Cost of Mobile Application Development, Importance of Mobile
Strategies, Challenges, Myths, Third-Party Frameworks, Mobile Web Presence,
ApplicationsFactors in Developing Mobile Applications :Mobile Software
Engineering ,Frameworks and Tools, Generic UI Development ,Android User
Chapter 1.2 Introduction to Mobility: Mobility Landscape, Mobile Platforms, Mobile apps
development, Overview of Android Platform, Setting up the mobile apps
development environment with emulator.Telephony :a. Deciding Scope of an
App b. Wireless Connectivity and Mobile Apps
c. Android Telephony.
Chapter 1.3 Building block of Mobile apps: App user Interface Designing, Layout, User
Interface elements, Draw-able, Menu, Activity states and lifecycle, Interaction
among activities.
App functionality based user interface:Threads, Asynchronous task, Services-
states and lifecycle, Notifications, Broadcast receivers, Telephony and SMS API.
Experiment No 1.1 Setting Up the Development Environment
Experiment No 1.2 Create "Hello World" Application

Bachelor of Engineering (CSE) CS-201 Page 11

Experiment No 1.3 Create Application by Using Widgets
Unit-2 Data Handling Contact Hours: 15
Chapter 2.1 Naïve Data Handling:On Device File I/O, Shared preferences, Mobile
Databases such as SQLite and enterprise data access.
Chapter 2.2 Sprucing up Mobile Apps: Graphics and animation-custom views, canvas,
animation API multimedia-audio/video playback and record, location aware.
Testing Mobile apps: Debugging Apps, White and Black Box Testing and test
automation of apps.
Chapter 2.3 Creating Consumable Web Services for Mobile Devices: What is a Web
Service, Web Services Languages (Formats), Creating an Example Web Service,
Debugging Web Services
Experiment No 2.1 Creating the Application by using Tex Edit control
Experiment No 2.2 Creating the Application Choosing Options CheckBox
Experiment No 2.3 Creating the Application Choosing Options RadioButton
Experiment No. Creating the Application Choosing Options RadioGroup
2.4
Unit-3 User Interface Design Contact Hours:15
Chapter 3.1 Mobile User Interface Design: Effective Use of Screen Real Estate,
Understanding Mobile Information Design, Understanding Mobile Application
Users, Understanding Mobile Platforms, Using the Tools of Mobile Interface
Design.
Chapter 3.2 Mobile Websites: Choosing a Mobile Web Option, Adaptive Mobile Websites,
Dedicated Mobile Websites Mobile Web Apps with HTML5
Android: Android as Competition to itself, Connecting to the Google Play,
Android Development Practices, Building an App in Android.
Chapter 3.3 Operating Systems iOS: IOS Project, Debugging iOS Apps, Objective-C Basics,
Building the Derby App in IOS
Windows Phone 7: Windows Phone 7 Project, Building an App in Windows
Phone 7, Distribution.

Experiment No 3.1 Create Application by Using Building Blocks for Android Application (Design by
using Linear Layout)
Experiment No 3.2 Create Application by Using Building Blocks for Android Application (Design by
using Relative Layout)
Experiment No 3.3 Create Application by Using Building Blocks for Android Application (Design by
using Absolute Layout)
Experiment No 3.4 Create Application by Using Building Menus and Storing Data
Experiment No 3.5 Design the Application for Menus and Action Bar

Text Books:
1. Jeff Mcwherter, Scott Gowell, Professional Mobile Application Development, Wrox Publisher
(2012), 1st Ed.

Reference Books:
1. Lauren Darcy, Shane Conder, Sams Teach Yourself Android Application Development in 24 Hrs,
1st edition.
2. Himanshu Dwivedi, Chris Clark, David Thiel, Mobile Application Security, Tata McGraw Hill
(2010), 1st Edition.

Bachelor of Engineering (CSE) CS-201 Page 12

SN Program TITLE OF THE COURSE L T P CH Per Course
Code- Week Type
10 CS-201 SOFTWARE PROJECT MANAGEMENT 3 0 0 3 SE
21CST-360 21CST-360
PRE-REQUISITE 21CST-254
CO-REQUISITE 21CST-352,21CST-353,21CST-354,21CST-
355,21CST-357,21CST-371,21CSP-356
ANTI-REQUISITE 21CST-463

a. Course Description:
The course provides an in depth examination of project management principles and modern software
project management practices. Methods for managing and optimizing the software development
process are discussed along with techniques for performing each phase of the
systems development lifecycle.

b. Course Objectives:
Introduces the concepts and methods required for the construction of large software systems.
Gain knowledge on the principles and techniques of software project management.
Provides an understanding of both theoretical and methodological issues involved in software
engineering project management.
c. Course Outcomes:

To implement modeling, communication, construction and deployment practices in software

1
development.
2 To estimate project costs and perform cost-benefit evaluation among projects.
3 To apply schedule and cost control techniques for project monitoring.
To choose estimation techniques from different methods according to project scope, size, and
4
nature.
5 To know the new techniques of software project management and their benefits.

d. Syllabus:
Unit-1 SOFTWARE PROJECT EVALUATION AND PROJECT Contact Hours: 15
PLANNING
<Chapter Name 1> Importance of Software Project Management – Activities Methodologies –
Categorization of Software Projects – Setting objectives – Management
Principles – Management Control – Project portfolio Management – Cost-
benefit evaluation technology
<Chapter Name 2> Risk evaluation – Strategic program Management – Stepwise Project Planning-
Software process and Process Models – Choice of Process models
<Chapter Name 3> Mental delivery – Rapid Application development – Agile methods – Extreme
Programming – SCRUM – Managing interactive processes
Unit-2 SOFTWARE PROJECT LIFE CYCLE AND EFFORT Contact Hours: 15
ESTIMATION
<Chapter Name 1> Basics of Software estimation – Effort and Cost estimation techniques –
COSMIC Full function points - COCOMO II A Parametric Productivity Model -
Staffing Pattern- Objectives of Activity planning
<Chapter Name 2> Project schedules – Activities – Sequencing and scheduling – Network Planning

Bachelor of Engineering (CSE) CS-201 Page 13

 models – Forward Pass & Backward Pass techniques – Critical path (CRM)
method
<Chapter Name 3> Risk identification – Assessment – Monitoring – PERT technique – Monte Carlo
simulation –Resource Allocation – Creation of critical patterns – Cost
schedules.
Unit-3 SOFTWARE PROJECT MANAGEMENT AND CONTROL Contact Hours: 15
<Chapter Name 1> Framework for Management and control – Collection of data Project
termination – Visualizing progress – Cost monitoring – Earned Value Analysis-
Project tracking
<Chapter Name 2> Change control-Software Configuration Management – Managing contracts –
Contract Management - Staffing -Managing people – Organizational behavior
<Chapter Name 3> Best methods of staff selection – Motivation – The Oldham-Hackman job
characteristic model – Ethical and Programmed concerns – Working in teams –
Decision making – Team structures – Virtual teams – Communications genres –
Communication plans

e. TEXT BOOK:
1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata
McGraw Hill, New Delhi, 2012.

Bachelor of Engineering (CSE) CS-201 Page 14