Techno India University, West Bengal

1ST SEMESTER

Course Code Course Title Contact Hrs. / Week Credit

L T P
Theory

TIU-PEN-S103 Career advancement and Skill Development 1 1 2

(Communicative ENGLISH and other related topics + One
Course from Eduskill)
TIU-PMA-T119 Computer Based Operations Research 2 1 0 3

TIU-PCA-T124 Cloud Computing 2 1 0 3

TIU-PCA-T125 Advanced Database Management Systems (ADBMS) 2 1 0 3

TIU-PCA-T127 Design and Analysis of Algorithms 3 1 0 4

TIU-PCA-T129 Tools and Techniques of Programming using Python 2 1 0 4

Practical

TIU-PCA-L125 ADBMS Lab 0 0 3 2

TIU-PCA-L129 Python programming Lab 0 0 3 2

TIU-PCA-L127 Design and Analysis of Algorithms Lab 0 0 3 2

Sessional

TIU-PES-S199 Entrepreneurship Skill Development 0 0 3 2

Total Credits 33

The students are advised to undergo the following online Certificate Courses to become ready for the IT industry. It
is a CAMPUS CONNECT INITIATIVE.
Programming Programming 101 by Udemy 4 hours
Foundations
Data Structures & Data Structures A-Z : Data Structures + Algorithms 7.5 hours
Algorithms Bootcamp by Udemy
Linux Learn Linux in 5 Days and Level Up Your Career by 6.5 hours
Fundamentals Udemy
Shell Scripting Bash Shell Scripting: Crash Course For Beginners by 5.5 hours
Udemy
Python basics The Python Bible™ | Everything You Need to 9 hours
Program in Python by Udemy

NOTE: 1 CREDIT POINT WILL BE GIVEN BY SUCCESSFUL COMPLETION OF NPTEL/EDUSKILL COURSES IN CAREER
ADVANCEMENT AND SKILL DEVELOPMENT. THE LIST IS ENCLOSED WITH THE SYLLABUS.

Page | 1
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
 DETAILED SYLLABUS

Career advancement and Skill Development

TIU-PEN-S101
L-T-P: 2-0-1
Credit: 3
Objectives:
To enable the students to:
1. Acquire knowledge of soft skills
2. Acquire basic communication skills

COURSE OUTCOME:
After completion of this course the student should be able to:
After completion of this course the student should be able to:
CO1: Participate effectively in critical conversations and demonstrate the ability to prepare, organize, and deliver their work to the public.
CO2: Read critically and interpret texts with attention to form and genre, ambiguity and complexity, considering how aesthetic experiences
fostered by works of literature are central to their meaning and ethical force.
CO3: Practice a deliberate writing process with emphasis on inquiry, audience, research, and revision.
CO4: Differentiate between genres of writing, understand the formal elements of language use in those genres, and write in appropriate genres
and modes for a variety of purposes and audiences, in print and/or digital contexts.
CO5: Read works of criticism and theory, situating their own readings of primary and secondary texts in relation to larger critical debates.

Course Code Topics Credit

Body Language
#Employability Skill
Presentation Skill 1
Development
Time Management & Stress Management

Global Skill SPANISH/FRENCH 1

Applied Communicative
Developing fluency in the language
English
Total 2

Career advancement and Skill Development for IMCA2

TIU-PCA-T101
L-T-P: 2-0-1 Credit: 3
Introduction to PL/SQL.
Presentation on Modern Technologies.

DESIGN AND ANALYSIS OF ALGORITHMS

TIU-PCA-T127

Page | 2
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
L-T-P: 3-1-0 Credit: 4

Course Objectives:
To enable the students to:

1. Know the basics of computational complexity analysis and various algorithm design paradigms.
2. Provide students with solid foundations to deal with a wide variety of computational problems.
3. Provide a thorough knowledge of the most common algorithms and data structures.
4. Analyze a problem and identify the computing requirements appropriate for its solutions
Course Outcomes :
1. Apply Knowledge of Mathematics to perform asymptotic analysis of algorithms.
2. Demonstrate a familiarity with major algorithms and data structures.
3. Apply important algorithmic design paradigms and methods of analysis.
4. Synthesize efficient algorithms in common engineering design situations.

UNIT-I:

REVISION OF BASIC CONCEPTS

1D Array, Multi Dimensional Array, Function, Structure and Union, Pointer, Linear Data Structures, Links Lists, Graph Representation and
Tree Representation in C.
INTRODUCTION TO ANALYSIS OF ALGORITHMS
Analysis of Algorithm, Efficiency Analysis framework, asymptotic notations . Analysis of Non-recursive and recursive algorithms. Solving
Recurrence Equations.

UNIT-II:
DIVIDE AND CONQUER METHOD:
Divide & Conquer: General method, Binary search. Analysis of Sorting Techniques. Large integer multiplication, Strassen’s Matrix
multiplication.

GREEDY METHOD:
General method and characteristics, Prim’s method for MST , Kruskal method for MST (using nlogn complexity), Dijkstra’s Algorithm,
Huffman Trees ( nlogn complexity), Job Sequencing.

UNIT-III :
DYNAMIC PROGRAMMING
General strategy, Principle of optimality, Warshal’s and Floyd’s Algorithm , Optimal Binary Search Trees, 0/1 knapsack Problem, Travelling
Salesman Problem, Matrix Chain Multiplication.

UNIT-IV:
BACKTRACKING
General method, Recursive backtracking algorithm, iterative backtracking method. 8-queens problem, Sum of subsets, Graph coloring,
Hamiltonian Cycle , 0/1 Knapsack Problem.

UNIT –V:
BRANCH AND BOUND
The method, Control abstractions for Least Cost Search, Bounding, FIFO branch and bound,
LC branch and bound, 0/1 Knapsack problem – LC branch and bound and FIFO branch and bound solution, traveling sales person problem, 15
Puzzle Problem.

UNIT-VI:

COMPUTATIONAL COMPLEXITY AND PARALLEL ALGORITHMS

Non Deterministic algorithms, the classes P, NP, NP Complete, NP hard Proofs for NP Complete Problems.

Text Books for Main Reading:

1. Horowitz and Sahani, "Fundamentals of computer Algorithms", Galgotia. ISBN 81
2. R.C.T.Lee, S S Tseng, R C Chang, Y T Tsai “ Introduction to Design and Analysis of Algorithms, A Strategic approach” Tata McGraw Hill.
ISBN
3. Gilles Brassard, Paul Bratle “Fundamentals of Algorithms “, Pearson ISBN 978
Reference Books:
4. Thomas H Cormen and Charles E.L Leiserson, "Introduction to Algorithm" PHI, ISBN:81
Page | 3
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
Anany Levitin,”Introduction to the Design & Analysis of Algorithm “,Pearson ISBN 81
5. Steven S Skiena , The Algorithm Design Manual, Springer,2nd edition,
6. George T. Heineman, Gary Pollice, Stanley Selkow “Algorithms in a Nutshell, A Desktop Quick Reference”, O’Reilly.

Cloud Computing
TIU-PCA-T124

L-T-P: 2-1-0 Credit: 3

COURSE Objective

1. To learn how to use Cloud Services.

2. To know the impact of engineering on legal and societal issues involved in a broader perspective
3. To assess the vision and introduction of IoT.
4. To Understand IoT Market perspective.
5. To Implement Data and Knowledge Management and use of Devices in IoT Technology.
6. To Understand State of the Art - IoT Architecture.

COURSE OUTCOME
After completion of this course the student should be able to:
CO1: Analyze the Cloud computing setup with its vulnerabilities and applications using different architectures.
CO2: Design different workflows according to requirements.
CO3: Apply map reduce programming model.
CO4: Apply suitable Virtualization concept, Cloud Resource Management and design scheduling algorithms.
CO5: Develop combinatorial auctions for cloud resources and design scheduling algorithms for computing clouds.
CO6: Analyze cloud Storage systems and Cloud security, the risks involved, its impact and develop cloud application.
CO7: Interpret the vision of IoT from a global context.
CO8: Determine the Market perspective of IoT.
CO9: Compare and Contrast the use of Devices, Gateways and Data Management in IoT.
CO10: Implement state of the art architecture in IoT.
CO11: Illustrate the application of IoT in Industrial Automation and identify Real World Design
Constraints.

Unit-1: Distributed System Models and Enabling Technologies

Scalable Computing Service over the Internet: The Age of Internet Computing, scalable computing Trends and New Paradigms,
Internet of Things and Cyber-Physical Systems. System Models for distributed and Cloud Computing: Clusters of Cooperative
Computers, Grid Computing Infrastructures, Peer-to-Peer Network Families, Cloud Computing over the Internet. Software
Environments for Distributed Systems and Clouds: Service-Oriented Architecture (SOA), Trends towards Distributed Operating
Systems, Parallel and Distributed Programming Models. Performance, Security, and Energy-Efficiency: Performance Metrics
and Scalability Analysis, Fault-Tolerance and System Availability, Network Threats and Data Integrity, Energy-Efficiency in
Distributed Computing.

Unit-2: Computer Clusters for scalable parallel computing

Clustering for massive parallelism: Cluster Development Trends, Design Objective of Computer Clusters, Fundamental Cluster
Design issues. Virtual machines and Virtualization of clusters and Data centers: Implementation levels of virtualization: levels of
virtualization Implementation, VMM Design requirements and providers, Virtualization support at the OS level, Middleware
Support for Virtualization.
Page | 4
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
Unit-3: Cloud Platform Architecture over Virtualized Data Centers

Cloud computing and Service Models: Public, Private, and Hybrid Clouds, Cloud Ecosystem and Enabling Technologies,
Infrastructure-as- a- Service (IaaS), Platform- and Software-as-a-Service (Paas, SaaS). Architectural Design of Compute and
Storage Clouds: A Generic Cloud architecture Design, Layered Cloud Architectural development, Virtualization Support and
Disaster Recovery, Architectural Design Challenges.

Unit-4: Public Cloud Platforms

GAE, AWS, and Azure: Smart Cloud, Public Clouds and Service Offerings, Google App Engine (GAE), Amazon Web Service
(AWS), Microsoft Windows Azure. Inter-cloud Resource Management: Extended Cloud Computing Services, Resource
Provisioning and Platform Deployment, Virtual Machine Creation and Management. Cloud Security and Trust management:
Cloud Security Defense Strategies, Distributed Intrusion/Anomaly Detection, Data and Software Protection Techniques.

Unit-5: Cloud Programming and Software Environments

Features of Cloud and Grid Platforms: Cloud Capabilities and Platform Features, Traditional Features Common to Grids and
Clouds, Data Features and Databases, Programming and Runtime Support. Parallel and Distributed Programming Paradigms

Unit-6: IoT & Web Technology:

The Internet of Things Today, Time for Convergence, Towards the IoT Universe, Internet of Things Vision, IoT Strategic
Research and Innovation Directions, IoT Applications, Future Internet Technologies, Infrastructure, Networks and
Communication, Processes, Data Management, Security, Privacy & Trust, Device Level Energy Issues, IoT Related
Standardization.

Unit-7 : M2M to IoT – A Basic Perspective:

Introduction, Some Definitions, M2M Value Chains, IoT Value Chains, An emerging industrial structure for IoT, The
international driven global value chain and global information monopolies. M2M to IoT-An Architectural Overview– Building
an architecture, Main design principles and needed capabilities, An IoT architecture outline, standards considerations.

Unit-8 : IoT Architecture -State of the Art:

Introduction, State of the art, Architecture Reference Model- Introduction, Reference Model and architecture, IoT reference
Model, IoT Reference Architecture- Introduction, Functional View, Information View, Deployment and Operational View,
Other Relevant architectural views.

Books for Main Reading:

Page | 5
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
1. Buyya, Selvi ,” Mastering Cloud Computing “,TMH Pub
2. Kumar Saurabh, “Cloud Computing” , Wiley Pub
3. Krutz , Vines, “Cloud Security “ , Wiley Pub
4. Velte, “Cloud Computing- A Practical Approach” ,TMH Pub
5. Sosinsky, “ Cloud Computing” , Wiley Pub
6. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”, 1 st Edition, VPT, 2014
7. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to Connecting Everything”, 1 st Edition, Apress
Publications, 2013.

Books for Supplementary Reading:

1. Gautam Shroff, Enterprise Cloud Computing Technology Architecture App
lications [ISBN: 978-0521137355]

Computer Based Operations Research

TIU-PMA-T119
L-T-P: 3-1-0 Credit: 4
Course Objectives:

To enable the students to

1. Define and formulate linear programming problems and appreciate their limitations.
2. Solve linear programming problems using appropriate techniques and optimization solvers, interpret the results obtained and translate
solutions into directives for action.
3. Conduct and interpret post-optimal and sensitivity analysis and explain the primal-dual relationship.
4. Develop mathematical skills to analyze and solve integer programming and network models arising from a wide range of applications.

Course Outcomes:

Knowledge and technical competence

Coherent and advanced knowledge of the underlying principles and concepts in one or more disciplines.
Problem-solving
Cognitive skills to review critically, analyze, consolidate and synthesis knowledge to identify and provide solutions to complex problems with
intellectual independence.
Communication
Communication skills to present clear and coherent exposition of knowledge and ideas to a variety of audiences.Ethics
Application of knowledge and skills with responsibility and accountability for own learning and professional practice, and in collaborations
with others within broad parameters.

Detailed syllabus

Linear Programming: OR Models, Convex Sets, Graphical Method, Simplex Method, Big M Method, Two Phase Method

Duality and Sensitivity Analysis : Primal – Dual construction, Symmetric and Asymmetric Dual, Weak Duality Theorem, Complimentary
Slackness Theorem, Main Duality Theorem, Dual Simplex Method, Sensitivity Analysis

Transportation and Assignment Formulation of Transportation Problem, Initial Feasible Solution Methods, Optimality Test, Degeneracy in TP;
Assignment Problem, Hungarian Method, Travelling Salesman Problem

Game Theory and Sequencing : Two Person Zero Sum Game, Pure and Mixed Strategies, Algebraic Solution Procedure, Graphical Solution,
Solving by Linear Programming; Sequencing Problem, Processing of n Jobs Through Two Machines and m Machines, Graphical Method of
Two Jobs m Machines Problem

Inventory and Queuing Models: Classical EOQ Models, EOQ Model with Price Breaks, EOQ with Shortage, Probabilistic EOQ Model,
Newsboy Problem. Elements of Queuing Model, Pure Birth Death Model, Single Server and Multi-server Markovian Models with Infinite and
Finite Capacity, Machine Repair Model, Networks of Queues.
Page | 6
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
Recommended Books:
Main Reading:
1. Hamdy A Taha, Operations Research-an introduction, Jain Books, 8th edition.
2. Kanti Swarup, P.K.Gupta & Man Mohan Operations Research , 17th edition, latest reprint 2014,Jain Books.
Supplementary Reading:
1. J. K. Sharma,-Operations Research Theory and Applications-Theory and applications, Jain Books.

Advanced Database Management Systems

TIU-PCA-T125
L-T-P: 3-1-0 Credit: 4
Course Objective

1. To revise the previous concepts of database management systems

2. To provide the concepts of various types of dependencies and their interrelationships
3. To learn the uses of advanced SQL
4. To help students acquire the theoretical foundation of Database Management Systems.
1. To provide the concepts of Query Processing and Optimization
2. To provide the concepts of Distributed Databases
3. To provide the concepts of enhanced database models

Course Outcome

1 Explain the advanced features of database management systems and Relational databases.

2 Design conceptual models of a database UML- based modeling for real life applications

3 The knowledge of indexing and query optimization

4 Knowledge of using advanced SQL

5 Knowledge of advanced database models

Detailed syllabus
Module 1:
Revisionary Concepts
General introduction to database systems, Theory of functional dependency and normalization
· Multi value dependency and 4NF
· Join Dependency and 5NF
· Inclusion Dependencies and Template Dependency
· PJNF/DKNF
· Modeling temporal data
. Closure and its accuracy

Module 2:

Page | 7
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
Database implementation and Tools
Use of UML and its support for database design specifications
· Representing specialization and generalization in UML Class diagram.
· UML based design tools
· Automated database design tools.
Module 3:
Advanced SQL
 Assertion and views
 Cursors, triggers and stored procedures
 PL/SQL,Embedded SQL, dynamic SQL, SQLJ
 Advanced Features of SQL
 Examples of above in Oracle

Module 4:
OVERVIEW OF STORAGE AND INDEXING, DISKS AND FILES
Data on external storage; File organizations and indexing; Index data structures;
Comparison of file organizations; Indexes and performance tuning. Memory hierarchy.
RAID; Disk space management; Buffer manager; Files of records; Page formats and record formats.
TREE STRUCTURED INDEXING: Intuition for tree indexes; Indexed sequential access method.
B trees and B+ trees, Search, Insert, Delete, Duplicates, B+ trees in practice.
HASH-BASED INDEXING: Static hashing; Extendible hashing, Linear hashing, comparisons.

Module 5:
Query Processing, Evaluation and Optimization
Query Execution: Introduction to Physical-Query-Plan Operators, One-Pass Algorithms for Database, Operations, Nested-Loop Joins, Two-
Pass Algorithms Based on Sorting, Two-Pass, Algorithms Based on Hashing, Index-Based Algorithms, Buffer Management, Parallel
Algorithms for Relational Operations, Using Heuristics in Query Optimization, Basic Algorithms for Executing Query Operations.
Measures of Query Cost
 Selection Operation,
 Sorting
 Join Operation
 other Operations
 Evaluation of Expression
 Transformation of Relational Expressions
 Role of Relational Algebra and Relational Calculus in query optimization
 Estimating Statistics of Expression
 Choice of Evaluation Plans
 Views and query processing
 Storage and query optimization

Module 6:
Distributed Databases
 Centralized versus non centralized Database
 Homogeneous and Heterogeneous DDBMS and their comparison
 Functions and Architecture
 Distributed database design, query processing in DDBMS
 Distributed concurrency management, deadlock management
 Distributed Commit Protocols: 2 PC and 3 PC
 Concepts of replication servers

Module 7
ENHANCED DATABASE MODELS
Unit 1: Object Oriented Database
 Limitations of Relational databases
 The need of Object oriented databases
 Complex Data Types
 Structured Types and Inheritance in SQL
 Table Inheritance

Page | 8
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
  Data types (arrays, multi-set etc) and structure in Object oriented databases using SQL
 Object-Identity and Reference Types in SQL
 ODL and OQL
 Implementing O-R Features
 Persistent Programming Languages
 Object-Oriented versus Object-Relational
 An Example of Object oriented and object relational database implementation
Unit 2: Database and XML
 Structured Semi structure and unstructured data
 XML hierarchical tree data model
 Documents DTD and XML schema
 XML Documents & Database
 XML query and transformations

 Storage of XML data

 XML database applications
Unit 3: Emerging Database Models, Technologies and Applications I
 Multimedia database
 Geography databases, Gnome databases
 Knowledge databases, deductive databases and semantic databases
 Spatial database
 Information visualization

Unit 4: Emerging Database Models, Technologies and Applications II

 Mobile databases
 Web databases (JDBC, ODBC)
 Personal databases
 Digital libraries
 Data grids
 Wireless networks and databases
·
·
Recommended Books:
Main Reading:
1. Elmasri, Navathe. Fundamentals of Database Systems (Third Edition), Pearson Education, 2004.

2. Database System Concepts, Fifth Edition, AviSilberschatz, Henry F. Korth, S. Sudarshan

3.Thomas M. Connolly, Carolyn Begg, Database Systems: practical approach to design, implementation, and management, Pearson Education
Limited, (6th edition),2015 1292061189 978-

Supplementary Reading:

1. Introduction to Database Systems by CJ Date

2. Data base Systems design, Implementation, and Management by Rob & Coronel, Thomson, 5th Edition

3. P. Bhattacharyya and A.K. Majumder, Data base management system, TMH

Tools and Techniques of Programming using Python

TIU-PCA-T129
L-T-P: 3-1-0 Credit: 4
Course Objectives

1. Basics of Python programming

2. Decision Making and Functions in Python

Page | 9
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
3. Object Oriented Programming using Python
4. Files Handling in Python
5. GUI Programming and Databases operations in Python
6. Network Programming in Python

Course Outcomes

1. Describe the Numbers, Math functions, Strings, List, Tuples and Dictionaries inPython
2. Express different Decision-Making statements and Functions
3. Interpret Object oriented programming in Python
4. Understand and summarize different File handling operations
5. Explain how to design GUI Applications in Python and evaluate different database operations
6. Design and develop Client Server network applications using Python

Detailed Syllabus:

Module 1: Introduction, Basic Advantages of Python, Python Execution System, ways of Python Code Development, Python character set,
Python Words, Data Types in Python, Python Variables, Constants and Literals, Unicode in Python, Python operators, Precedence and
associativity in Python Operators, Basics of Python Programming, Installation of Python, Syntax and semantics in Python, Running Python as
a displayer, Python as a Desk Calculator.

Module 2: The Procedural Features of Python: Characteristics of a Procedural language, Logic structures in structured programming, Sequence
logic structure in Python. Illustrative examples.

Module 3: The selection logic structure of Python; simple, compound and nested selection logic with syntax; Ternary operation in Python;
illustrative examples with all the logic structures.

Module 4: Programming with the ITERATION Logic (Loop); THE Iteration structures supported by Python; Nested iteration; illustrative
examples with iteration logic.

Module 5: Strings in Python; How to create and use a string; Empty string; Length of a string; Concatenation and repetition of strings; The in
membership operator in strings; Indexing and Slicing of strings; Changing individual characters of a string; String Methods; String formatting
in Python; Translating characters in a string; The format() Method for Formatting Strings; String Formatting Operators; Formatting literals
with f-string; Illustrative examples for implementing the features.

Module 6: Composite Data Types in Python; List; operations on lists: Concatenation; Slicing; Replication of a list; Use of in operator;
Comparison of lists; any() and all() on lists; Copying a list; Built in functions for lists; Methods for lists; application of lists; programming with
lists; Lists and the random module; List comprehensions; The use of else in list comprehension constructs; Working with two-dimensional
lists; Arrays in Python; important methods used on Arrays; Tuple: Updating Tuples; Accessing Tuples; Deletion and other operations on
tuples; Sets in Python: Basic Operations on sets; Operations on multiple sets; Membership and Iteration operations on sets; Frozensets;
Dictionaries; Salient features of a dictionary in Python; Modifications in a dictionary; Important methods for dictionary type of data; Iteration
over dictionaries; Merging two or more dictionaries; Nested Dictionaries; Applications of dictionaries;Data Frames in Python:
concat(),append(),merge and and join() methods with data frames.

Module 7: User-defined functions in Python; Basics of Python Functions; Functions with parameters; Docstrings in Python; Function
arguments with default values; Defining a function with an arbitrary number of arguments; Defining a function with an arbitrary number of
keyword arguments; Anonymous/lambda functions; Defining a function with optional argument; Defining a function with optional mutable
arguments; Argument passing and mutability; Recursive functions; Recursive Lambda using assigned variable; Local and global Scope; The
global Statement; illustrative examples.

Module 8: Various Implementations of Python; Code object in Python; Built-in Functions in Python; Dates and times; Simple date arithmetic;
The Math Module; Implementation of Switch Case logic structure in Python; Multithreading in Python; Pattern Matching with Regular
Expressions. The itertools and collections modules; Exception handling; Modules; Packages; Garbage Collection in Python.

Module 9: Arrays, vectors and data frames in Python for manipulation of data

Module 10: Text Files: Reading from files; Writing to files.CSV files; Reading and Writing CSV files; JSON files; Database Access in Python.
Page | 10
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
Module 11: Graphical representation of data in Python

Module 12: Object-Oriented Programming in Python; Implementation of linked list, stack and Queue using class concept.

Module 13: Introduction to GUI programming in Python.

Books for Main Reading:

1. John V Guttag. “Introduction to Computation and Programming Using Python”, Prentice Hall of India

2. R. Nageswara Rao, “Core Python Programming”, dreamtech

3. Wesley J. Chun. “Core Python Programming - Second Edition”, Prentice Hall

4. Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, “Data Structures and Algorithms in Pyhon”, Wiley.

Books for Supplementary Reading:

1. Kenneth A. Lambert, “Fundamentals of Python – First Programs”, CENGAGE Publication

2. Luke Sneeringer, “Professional Python”, Wrox

3. “Hacking Secret Ciphers with Python”, Al Sweigart, URLhttps://inventwithpython.com/hacking/chapters

ADBMS Lab
TIU-PCA-L125
L-T-P: 0-0-3 Credit: 2
Study of commercial DBMS package (Oracle-latest version).

Developing database application with Oracle, creation of a database, writing SQL queries and retrieving data.

Python programming Lab

TIU-PCA-L129
L-T-P: 0-0-3 Credit: 2
Based on the concerned faculty of the respective subject.

DAA Lab
TIU-PCA-L127

L-T-P: 0-0-3 Credit:2

Lab :1 : Divide and Conquer : > Implement Binary Search using Divide and Conquer approach.
Lab :2 : Divide and Conquer : > Implement Sorting techniques using Divide and Conquer approach > Find Maximum and Minimum element
from a array of integer using Divide and Conquer approach.
Lab :3 : Greedy method(implement any one of the following problem) : >Job sequencing with deadlines.

Page | 11
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):
Lab :4 : Greedy method (implement any one of the following problem) : >Minimum Cost Spanning Tree by Prim's Algorithm >Minimum Cost
Spanning Tree by Kruskal's Algorithm.
Lab :5 : Dynamic Programming : > Find the minimum number of scalar multiplication needed for chain of matrix.
Lab :6 : Dynamic Programming : >Implement all pair of Shortest path for a graph ( Floyed- Warshall Algorithm ) >Implement Traveling
Salesman Problem.
Lab :7 : Dynamic Programming : >Implement Single Source shortest Path for a graph ( Dijkstra , Bellman Ford Algorithm ).
Lab :8 : Backtracking (implement any one of the following problem): >Graph Coloring Problem >Hamiltonian Problem.
Lab :9 : Backtracking: > 8-queens problem.
Lab :10: Brunch and Bound : > Implement 15 Puzzle Problem.

Page | 12
Approved by:
External Expert-1 (Prof. Dr.Subhadip Basu, J.U.)
External Expert-2 (Prof. Dr. Amlan Chakraborty, C.U.)
HOD - (Prof. Dr. A.B. Chowdhury)
Industry Expert (Mr. J. Rudra, CTL):