BCC302 / BCC402/ BCC302H / BCC402H :

PYTHON PROGRAMMING
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand

Interpret the fundamental Python syntax and semantics and be fluent in the use of Python control flow
CO 1 K1, K2
statements.
CO 2 Express proficiency in the handling of strings and functions K1, K2
Determine the methods to create and manipulate Python programs by utilizing the data structures like
CO 3 K3
lists, dictionaries, tuples and sets.
CO 4 Identify the commonly used operations involving file systems and regular expressions. K1, K2
Articulate the Object-Oriented Programming concepts such as encapsulation, inheritance and
CO 5 K2, K3
polymorphism as used in Python
DETAILED SYLLABUS
Unit Topic Lecture
I Introduction to Python: Python variables, Python basic Operators, Understanding python
blocks. Python Data Types, Declaring and using Numeric data types: int, float etc. 03

Python Program Flow Control Conditional blocks: if, else and else if, Simple for loops in
II python, For loop using ranges, string, list and dictionaries. Use of while loops in python,
05
Loop manipulation using pass, continue, break and else. Programming using Python
conditional and loop blocks.
Python Complex data types: Using string data type and string operations, Defining list
and list slicing, Use of Tuple data type. String, List and Dictionary, Manipulations Building
III blocks of python programs, string manipulation methods, List manipulation. Dictionary 04
manipulation, Programming using string, list and dictionary in-built functions. Python
Functions, Organizing python codes using functions.
Python File Operations: Reading files, Writing files in python, Understanding read
IV functions, read(), readline(), readlines(). Understanding write functions, write() and 04
writelines() Manipulating file pointer using seek Programming, using file operations.
Python packages: Simple programs using the built-in functions of packages matplotlib,
V numpy, pandas etc. GUI Programming: Tkinter introduction, Tkinter and 04
PythonProgramming, Tk Widgets, Tkinter examples. Python programming with IDE.
Text books:
1. Wesley J. Chun, “Core Python Applications Programming”, 3rd Edition , Pearson Education, 2016
2. Lambert, Fundamentals of Python: First Programs with MindTap, 2nd 1st edition , Cengage Learning publication
3. Charles Dierbach, “Introduction to Computer Science using Python”, Wiley, 2015
4. Jeeva Jose &P.SojanLal, “Introduction to Computing and Problem Solving with PYTHON”, Khanna Publishers, New Delhi,
2016
5. Downey, A. et al., “How to think like a Computer Scientist: Learning with Python”, John Wiley, 2015
6. Mark Lutz, “Learning Python”, 5th edition, Orelly Publication, 2013, ISBN 978- 1449355739
7. John Zelle, “Python Programming: An Introduction to Computer Science”, Second edition, Course Technology Cengage
Learning Publications, 2013, ISBN 978- 1590282410
8. Michel Dawson, “Python Programming for Absolute Beginers” , Third Edition, Course Technology Cengage Learning
Publications, 2013, ISBN 978-1435455009
9. David Beazley, Brian Jones., “Python Cookbook”, Third Edition, Orelly Publication, 2013, ISBN 978-1449340377
 Mathematics –IV
(PDE, Probability and Statistics)
Computer/Electronics/Electrical & Allied Branches, CS/IT, EC/IC, EE/EN,
Mechanical& Allied Branches, (ME/AE/AU/MT/PE/MI/PL)
Textile/Chemical & Allied Branches, TT/TC/CT, CHE/FT
Subject Code BAS303/ BAS303H/ BAS403/BAS403H
Category Basic Science Course
Subject Name MATHEMATICS-IV(PDE, Probability and Statistics)
Theory Sessional
L-T-P Total Credit
Scheme and Credits Marks Test Assig/Att.
3—1—0 70 20 10 100 4
Pre- requisites (if any) Knowledge of Mathematics I and II of B. Tech or equivalent

Course Outcomes
The objective of this course is to familiarize the students with partial differential equation,
their application and statistical techniques. It aims to present the students with standard
concepts and tools at an intermediate to superior level that will provide them well towards
undertaking a variety of problems in the discipline.
The students will learn:
 The idea of partial differential equation and its different types of solution.
 The concept ofmethod of separation of variables and Fourier transform to solve
partial differential equations.
 The basic ideas of statistics including measures of central tendency, correlation,
regression and their properties.
 The idea of probability, random variables, discrete and continuous probability
distributions and their properties.
 The statistical methods of studying data samples, hypothesis testing and statistical
quality control.

Module I: Partial Differential Equations 8

Origin of Partial Differential Equations, Linear and Non-Linear Partial Differential Equations
of first order, Lagrange’s Equations method to solve Linear Partial Differential Equations,
Charpit’s method to solve Non-Linear Partial Differential Equations, Solution of Linear
Partial Differential Equation of Higher order with constant coefficients, Equations reducible
to linear partial differential equations with constant coefficients.
Module II: Applications of Partial Differential Equations and Fourier Transform 8
Method of separation of variables,Solution of one dimensional heat equation, wave equation,
Two dimensional heat equation (only Laplace Equation) and their application, Complex
Fourier transform, Fourier sine transform, Fourier cosine transform, Inverse transform,
convolution theorem, Application of Fourier Transformto solve partial differential equation.

Module III: Statistical Techniques I 8

Overview of Measures of central tendency, Moments, Skewness, Kurtosis, Curve Fitting,
Method of least squares, Fitting of straight lines, Fitting of second degree parabola,
Exponential curves,Correlation and Rank correlation, Regression Analysis: Regression lines
of y on x and x on y.

Module IV: Statistical Techniques II 8

Overview of Probability Random variables (Discrete and Continuous Random variable)
Probability mass function and Probability density function, Expectation and variance,
Discrete and Continuous Probability distribution: Binomial, Poission and Normal
distributions.

Module V: Statistical Techniques III 8

Introduction of Sampling Theory, Hypothesis, Null hypothesis, Alternative hypothesis,
Testing a Hypothesis, Level of significance, Confidence limits, Test of significance of
difference of means, t-test, Z-test and Chi-square test, Statistical Quality Control (SQC) ,
Control Charts, Control Charts for variables ( X and R Charts), Control Charts for Variables
(p, np and C charts).

Text Book:
1. Dr. B.S. Grewal, “Higher Engineering Mathematics”, 44thEdition, Khanna Publishers,
New Dehli.
Reference Book:
1. Peter V. O’Neil, “Advance Engineering Mathematics”, SI Edition 8th Edition,
Cengage Learning, 2017.
2. B. V. Ramana, Higher Engineering Mathematics, McGraw-Hill Publishing Company
Ltd., 2017.
3. S. S. Sastry, “Introductory methods of Numerical solutions”, 4th Edition , Prentice
Hall of India.
4. Erwin Kreyszig , “Advanced Engineering Mathematics”, John Wiley Publications,
1999.
5. R.K.Jain&S.R.K.Iyengar, “Numerical Methods” , New Age International ( P )
Limited
6. James F. Epperson Mathematical Reviews “An Introduction To Numerical Methods
And Analysis” Second Edition, Wiley;
https://perhuaman.files.wordpress.com/2014/07/metodos-numericos.pdf
BAS301/BAS401 Technical Communication L: T: P: 3: 0:0
BAS301H/BAS401H
Course Objectives:

• Students will be able to UNDERSTAND the nature and objective of Technical Communication relevant for
the work place as Engineers.
• Students will b e ab le to DEVELOP an understanding of key concepts of writing, designing and
speaking.
• Students will be ab le to UTILIZE the technical writing skills for the purposes of Technical
Communication and its exposure in various dimensions.
• Students will be able BUILD UP interpersonal communication traits that will make the transition
from institution to workplace smoother and help them to excel in their jobs.
• Students will be able to APPLY technical communication to build their personal brand and handle
crisis communication.

Unit 1 : Fundamentals of Communication and Voice Dynamics:

Role and Purpose of Communication, Types & Flow of Communication, Barriers to Effective Communication,
7 C’s of Communication, Code and Content; Stimulus & Response, Vowel Sounds, Consonant Sounds, Tone:
Rising and Falling Tone.

Unit 2 : Communication Skills for Career Building

CV and Résumé Writing, Interview Skills, Group Discussion, Effective Profiling, Communication and Networking:
Building relationships, Writing the Statement of Purpose (SOP) for admission in Higher Studies, Seminar &
Conference Paper Writing, Expert Technical Lecture: Writing and Presenting.

Unit 3: Communication Skills for Presentation: Writing, Designing, and Speaking

Thesis and Project Report Writing, Technical Proposal Writing, How to Pitch an Idea: Process, Preparation and
Structure, Elements of Speech Delivery: Passion, Poise & Illustrations.
Unit 4 : Communication and Leadership Development
Leadership Communication, Communication and Social competence: context, feelings, intentions, behaviors,
Providing and Receiving feedback, Difference between Tact and Intelligence, Emotional Intelligence: Trust through
Communication, Thinking Skills: Meaning and Types.
Unit 5 : Digital Communication and Personality Making
Content Creation for Social Media: Emails, Webinars, podcasts, Blogs. Effective and Ethical use of Social Media by
Text and Technique, Speech and Personality, Personality Analysis: Types of Personality; Concept of Personality:
Maslow, Freud, Vivekananda, Jung Typology &Personality Assessment.

Prescribed Books:
1. Technical Communication – Principles and Practices by Meenakshi Raman & Sangeeta Sharma, Oxford
Univ. Press, 2018, New Delhi
2. Personality Development and Soft Skills by Barun K. Mitra, OUP, 2012, New Delhi.
3. Technical Communication, by Pfeiffer, 6th edn (Pearson)
4. Soft Skills & Employability, Sabina Pillai and Agna Fernandez Cambridge University Press 2018.
5. Practical Communication: Process and Practice by L.U.B. Pandey; A.I.T.B.S.Publications India Ltd.;
Krishan Nagar, 2014, Delhi.
 FOURTH SEMESTER (DETAILED SYLLABUS)

BCS401 Operating system

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand

CO 1 Understand the structure and functions of OS K1, K2

CO 2 Learn about Processes, Threads and Scheduling algorithms. K1, K2
CO 3 Understand the principles of concurrency and Deadlocks K2
CO 4 Learn various memory management scheme K2
CO 5 Study I/O management and File systems. K2,K4
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
Introduction : Operating system and functions, Classification of Operating systems- Batch,
Interactive, Time sharing, Real Time System, Multiprocessor Systems, Multiuser Systems,
I 08
Multiprocess Systems, Multithreaded Systems, Operating System Structure- Layered structure,
System Components, Operating System services, Reentrant Kernels, Monolithic and Microkernel
Systems.
Concurrent Processes: Process Concept, Principle of Concurrency, Producer / Consumer Problem,
II Mutual Exclusion, Critical Section Problem, Dekker’s solution, Peterson’s solution, Semaphores, 08
Test and Set operation; Classical Problem in Concurrency- Dining Philosopher Problem, Sleeping
Barber Problem; Inter Process Communication models and Schemes, Process generation.
CPU Scheduling: Scheduling Concepts, Performance Criteria, Process States, Process Transition
Diagram, Schedulers, Process Control Block (PCB), Process address space, Process identification
III
information, Threads and their management, Scheduling Algorithms, Multiprocessor Scheduling. 08
Deadlock: System model, Deadlock characterization, Prevention, Avoidance and detection,
Recovery from deadlock.
Memory Management: Basic bare machine, Resident monitor, Multiprogramming with fixed
IV partitions, Multiprogramming with variable partitions, Protection schemes, Paging, Segmentation, 08
Paged segmentation, Virtual memory concepts, Demand paging, Performance of demand paging,
Page replacement algorithms, Thrashing, Cache memory organization, Locality of reference.
I/O Management and Disk Scheduling: I/O devices, and I/O subsystems, I/O buffering, Disk
V storage and disk scheduling, RAID. File System: File concept, File organization and access 08
mechanism, File directories, and File sharing, File system implementation issues, File system
protection and security.
Text books:
1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
2. Sibsankar Halder and Alex A Aravind, “Operating Systems”, Pearson Education
3. Harvey M Dietel, “ An Introduction to Operating System”, Pearson Education
4. D M Dhamdhere, “Operating Systems : A Concept based Approach”, 2nd Edition,
5. TMH 5. William Stallings, “Operating Systems: Internals and Design Principles ”, 6th Edition, Pearson Education
BCS402 Theory of Automata and Formal Languages
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
Analyse and design finite automata, pushdown automata, Turing machines, formal languages,
CO 1 K4, K6
and grammars
CO 2 Analyse and design, Turing machines, formal languages, and grammars K K
4, 6

Demonstrate the understanding of key notions, such as algorithm, computability, decidability,

CO 3 K1, K5
and complexity through problem solving
CO 4 Prove the basic results of the Theory of Computation. K2,K3

CO 5 State and explain the relevance of the Church-Turing thesis. K1, K5

DETAILED SYLLABUS 3-1-0

Unit Topic Proposed
Lecture
Basic Concepts and Automata Theory: Introduction to Theory of Computation- Automata,
Computability and Complexity, Alphabet, Symbol, String, Formal Languages, Deterministic Finite
Automaton (DFA)- Definition, Representation, Acceptability of a String and Language, Non
I 08
Deterministic Finite Automaton (NFA), Equivalence of DFA and NFA, NFA with ε-Transition,
Equivalence of NFA’s with and without ε-Transition, Finite Automata with output- Moore
Machine, Mealy Machine, Equivalence of Moore and Mealy Machine, Minimization of Finite
Automata.
Regular Expressions and Languages: Regular Expressions, Transition Graph, Kleen’s Theorem,
II Finite Automata and Regular Expression- Arden’s theorem, Algebraic Method Using Arden’s
Theorem, Regular and Non-Regular Languages- Closure properties of Regular Languages, 08
Pigeonhole Principle, Pumping Lemma, Application of Pumping Lemma, Decidability- Decision
properties, Finite Automata and Regular Languages
Regular and Non-Regular Grammars: Context Free Grammar(CFG)-Definition, Derivations,
Languages, Derivation Trees and Ambiguity, Regular Grammars-Right Linear and Left Linear
III grammars, Conversion of FA into CFG and Regular grammar into FA, Simplification of CFG, Normal 08
Forms- Chomsky Normal Form(CNF), Greibach Normal Form (GNF), Chomsky Hierarchy,
Programming problems based on the properties of CFGs.
Push Down Automata and Properties of Context Free Languages: Nondeterministic Pushdown
Automata (NPDA)- Definition, Moves, A Language Accepted by NPDA, Deterministic Pushdown
IV Automata(DPDA) and Deterministic Context free Languages(DCFL), Pushdown Automata for 08
Context Free Languages, Context Free grammars for Pushdown Automata, Two stack Pushdown
Automata, Pumping Lemma for CFL, Closure properties of CFL, Decision Problems of CFL,
Programming problems based on the properties of CFLs.
Turing Machines and Recursive Function Theory : Basic Turing Machine Model, Representation of
V Turing Machines, Language Acceptability of Turing Machines, Techniques for Turing Machine
Construction, Modifications of Turing Machine, Turing Machine as Computer of Integer Functions, 08
Universal Turing machine, Linear Bounded Automata, Church’s Thesis, Recursive and Recursively
Enumerable language, Halting Problem, Post’s Correspondance Problem, Introduction to
Recursive Function Theory.
Text books:
1. Introduction to Automata theory, Languages and Computation, J.E.Hopcraft, R.Motwani, and Ullman. 2nd
edition, Pearson Education Asia
2. Introduction to languages and the theory of computation, J Martin, 3rd Edition, Tata McGraw Hill
3. Elements and Theory of Computation, C Papadimitrou and C. L. Lewis, PHI
 4. Mathematical Foundation of Computer Science, Y.N.Singh, New Age Internationa

BCS403 Object Oriented Programming with Java

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand

CO 1
Develop the object-oriented programming concepts using Java K3, K4

CO 2
Implement exception handling, file handling, and multi-threading in Java K2,K4

CO 3
Apply new java features to build java programs. K3

CO 4
Analyse java programs with Collection Framework K4
Test web and RESTful Web Services with Spring Boot using Spring Framework
CO 5 concepts K5

DETAILED SYLLABUS 3-1-0

Unit Topic Proposed
Lecture
Introduction: Why Java, History of Java, JVM, JRE, Java Environment, Java Source File Structure,
and Compilation. Fundamental,

Programming Structures in Java: Defining Classes in Java, Constructors, Methods, Access

Specifies, Static Members, Final Members, Comments, Data types, Variables, Operators, Control
Flow, Arrays & String.
I 08
Object Oriented Programming: Class, Object, Inheritance Super Class, Sub Class, Overriding,
Overloading, Encapsulation, Polymorphism, Abstraction, Interfaces, and Abstract Class.

Packages: Defining Package, CLASSPATH Setting for Packages, Making JAR Files for
Library Packages, Import and Static Import Naming Convention For Packages

Exception Handling: The Idea behind Exception, Exceptions & Errors, Types of Exception, Control
Flow in Exceptions, JVM Reaction to Exceptions, Use of try, catch, finally, throw, throws in
Exception Handling, In-built and User Defined Exceptions, Checked and Un-Checked Exceptions.
II
Input /Output Basics: Byte Streams and Character Streams, Reading and Writing File in Java. 08

Multithreading: Thread, Thread Life Cycle, Creating Threads, Thread Priorities, Synchronizing
Threads, Inter-thread Communication.

Java New Features: Functional Interfaces, Lambda Expression, Method References, Stream API,
III Default Methods, Static Method, Base64 Encode and Decode, ForEach Method, Try-with- 08
resources, Type Annotations, Repeating Annotations, Java Module System, Diamond Syntax with
 Inner Anonymous Class, Local Variable Type Inference, Switch Expressions, Yield Keyword, Text
Blocks, Records, Sealed Classes

Java Collections Framework: Collection in Java, Collection Framework in Java, Hierarchy of

Collection Framework, Iterator Interface, Collection Interface, List Interface, ArrayList, LinkedList,
IV Vector, Stack, Queue Interface, Set Interface, HashSet, LinkedHashSet, SortedSet Interface, 08
TreeSet, Map Interface, HashMap Class, LinkedHashMap Class, TreeMap Class, Hashtable Class,
Sorting, Comparable Interface, Comparator Interface, Properties Class in Java.
Spring Framework: Spring Core Basics-Spring Dependency Injection concepts, Spring Inversion of
Control, AOP, Bean Scopes- Singleton, Prototype, Request, Session, Application, Web Socket, Auto
wiring, Annotations, Life Cycle Call backs, Bean Configuration styles
V
08
Spring Boot: Spring Boot Build Systems, Spring Boot Code Structure, Spring Boot Runners, Logger,
BUILDING RESTFUL WEB SERVICES, Rest Controller, Request Mapping, Request Body, Path
Variable, Request Parameter, GET, POST, PUT, DELETE APIs, Build Web Applications

Text Books

1. Herbert Schildt, "Java The complete reference", McGraw Hill Education

2. Craig Walls, “Spring Boot in Action” Manning Publication
1. Steven Holzner, “Java Black Book”, Dreamtech.
2. Balagurusamy E, “Programming in Java”, McGraw Hill
3. Java: A Beginner’s Guide by Herbert Schildt, Oracle Press
4. Greg L. Turnquist “Learning Spring Boot 2.0 - Second Edition”, Packt Publication
5. AJ Henley Jr (Author), Dave Wolf, “Introduction to Java Spring Boot: Learning by Coding”,
Independently Published

BCS451- Operating System Lab

List of Experiments (Indicative & not limited to)

1. Study of hardware and software requirements of different operating systems (UNIX,LINUX,WINDOWS XP,
WINDOWS7/8
2. Execute various UNIX system calls for
i. Process management
ii. File management
iii. Input/output Systems calls
3. Implement CPU Scheduling Policies:
i. SJF
ii. Priority
iii. FCFS
iv. Multi-level Queue
4. Implement file storage allocation technique:
i. Contiguous(using array)
 ii. Linked –list(using linked-list)
iii. Indirect allocation (indexing)
5. Implementation of contiguous allocation techniques:
i. Worst-Fit
ii. Best- Fit
iii. First- Fit
6. Calculation of external and internal fragmentation
i. Free space list of blocks from system
ii. List process file from the system
7. Implementation of compaction for the continually changing memory layout and calculate total movement
of data
8. Implementation of resource allocation graph RAG)
9. Implementation of Banker‟s algorithm
10. Conversion of resource allocation graph (RAG) to wait for graph (WFG) for each type of method used for
storing graph.
11. Implement the solution for Bounded Buffer (producer-consumer)problem using inter process
communication techniques-Semaphores
12. Implement the solutions for Readers-Writers problem using inter process communication technique -
Semaphore

BCS452- Object Oriented Programming with Java

List of Experiments (Indicative & not limited to)

1. Use Java compiler and eclipse platform to write and execute java program.
2. Creating simple java programs using command line arguments
3. Understand OOP concepts and basics of Java programming.
4. Create Java programs using inheritance and polymorphism.
5. Implement error-handling techniques using exception handling and multithreading.
6. Create java program with the use of java packages.
7. Construct java program using Java I/O package.
8. Create industry oriented application using Spring Framework.
9. Test RESTful web services using Spring Boot.
10. Test Frontend web application with Spring Boo t

BCS453- Cyber Security Workshop

List of Experiments (Indicative & not limited to)

Module 1: Packet Analysis using Wire shark

1. Basic Packet Inspection: Capture network traffic using Wire shark and analyze basic protocols like
HTTP, DNS, and SMTP to understand how data is transmitted and received.
 2. Detecting Suspicious Activity: Analyze network traffic to identify suspicious patterns, such as repeated
connection attempts or unusual communication between hosts.
3. Malware Traffic Analysis: Analyze captured traffic to identify signs of malware communication, such as
command-and-control traffic or data infiltration.
4. Password Sniffing: Simulate a scenario where a password is transmitted in plaintext. Use Wireshark to
capture and analyze the packets to demonstrate the vulnerability and the importance of encryption.
5. ARP Poisoning Attack: Set up an ARP poisoning attack using tools like Ettercap. Analyze the captured
packets to understand how the attack can lead to a Man-in-the-Middle scenario.

Module 2: Web Application Security using DVWA

1. SQL Injection: Use DVWA to practice SQL injection attacks. Demonstrate how an attacker can
manipulate input fields to extract, modify, or delete database information.
2. Cross-Site Scripting (XSS): Exploit XSS vulnerabilities in DVWA to inject malicious scripts into web pages.
Show the potential impact of XSS attacks, such as stealing cookies or defacing websites.
3. Cross-Site Request Forgery (CSRF): Set up a CSRF attack in DVWA to demonstrate how attackers can
manipulate authenticated users into performing unintended actions.
4. File Inclusion Vulnerabilities: Explore remote and local file inclusion vulnerabilities in DVWA. Show how
attackers can include malicious files on a server and execute arbitrary code.
5. Brute-Force and Dictionary Attacks: Use DVWA to simulate login pages and demonstrate brute-force
and dictionary attacks against weak passwords. Emphasize the importance of strong password policies.