0% found this document useful (0 votes)
22 views34 pages

cse_aiml_updated

CSE syllabus

Uploaded by

princeprem369x
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views34 pages

cse_aiml_updated

CSE syllabus

Uploaded by

princeprem369x
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 34

Kashi Institute of Technology, Varanasi

(An Autonomous Institute of Dr. A.P.J. Abdul Kalam Technical University, Lucknow)

Evaluation Scheme & Syllabus


For
B.Tech. First Year
(Common to CSE & CSE-AIML)

(Effective from Session: 2025-26)

(Updated)

MS 23KM, Varanasi – Prayagraj (Allahabad) Highway, Mirzamurad, Varanasi


Uttar Pradesh - 221307
B.Tech. First Year, Semester-I
(Common to CSE & CSE-AIML)
Evaluation Scheme
Course Course Periods
S.N. Course Title Type FA SA Total Credit
Category Code L T P

1 BSC BSC101 Applied Mathematics-I T 3 1 0 70 30 100 4

2 ESC ESC101 Programming for Problem Solving T 3 1 0 70 30 100 4


Digital Application Fundamentals –
3 ESC ESC103 T 2 1 0 70 30 100 3
STEM (DAF-STEM)
Fundamentals of Computers &
4 PCCCS PCCCS101 T 2 1 0 70 30 100 3
Emerging Technologies
5 PCCCS PCCCS103 Fundamental of Web Designing T 2 0 0 70 30 100 2
Digital Application Fundamentals –
6 ESC ESC155 P 0 0 2 70 30 100 1
STEM (DAF-STEM)-Lab
Fundamental of Web Designing
7 PCCCS PCCCS151 P 0 0 2 70 30 100 1
Lab
Programming for Problem Solving
8 ESC ESC151 P 0 0 2 70 30 100 1
Using C Lab
9 CCA CCA151 Co-Curricular Activities - - - - - - 100 0.5

10 MC MCGP101 General Proficiency - - - - - - 100 0.5


MOOCS (for B.Tech honours
11
degree)
Total
- 12 4 6 560 240 1000 20

B.Tech. First Year, Semester-II


(Common to CSE & CSE-AIML)
Evaluation Scheme
Course Course Period
SN Course Title Type FA SA Total Credit
Category Code L T P
1 BSC BSC104 Discrete Mathematics T 3 1 0 70 30 100 4
2 HSMC HSMC102 Professional Communication T 2 1 0 70 30 100 3
3 PCCCS PCCCS102 Basics of Python Programming T 2 1 0 70 30 100 3

4 PCCCS PCCCS104 Oops with C++ T 2 1 0 70 30 100 3

5 ESC ESC104 Introduction to Cyber Security T 2 0 0 70 30 100 2


6 HSMC HSMC104 Design Thinking L 1 0 0 70 30 100 1

7 PCCCS PCCCS152 Basics of Python Programming Lab P 0 0 4 70 30 100 2

8 PCCCS PCCCS154 Oops With C++ Lab P 0 0 4 70 30 100 2

9 CCA CCA152 Co-Curricular Activities - - - - - - 100 0.5

10 MC MCGP102 General Proficiency - - - - - - 100 0.5


MOOCS (for B.Tech honours
11
degree)
Total - 11 4 4 560 240 1000 21
FA: Formative Assessment, SA: Summative Assessment, L: Lecture, T- Tutorial, P: Practical

Abbreviation Used:
PCC: Professional Core Courses CCA: Co-Curricular Activities
HSMC: Humanities, Social Science and MC: Mandatory Courses
Management Course ESC: Engineering Science Courses
BSC: Basic Science Course
MOOC: Massive Open Online Course
DETAILED SYLLABI
B.Tech 1St Year

 Computer Science & Engineering


 Computer Science & Engineering (Artificial Intelligence &
Machine Learning)

(Effective from Session: 2025-26)

(Updated)
(Common to B.Tech-CSE & CSE-AIML)
Semester: I Course Category Code : BSC
Period / Week Credit
Course Code Course
L T P C
BSC101 Applied Mathematics-I 3 1 0 4

Prerequisite At the end of this course, the students will be able to: Bloom’s Level
Understand the concept of Eigen values, Eigen vectors and
CO1 apply the concept of rank to evaluate linear simultaneous K2,K5
equations.
Remember the concept of differentiation to find successive
CO2 differentiation, Leibnitz Theorem, and find partial and total K1,K5
Course derivatives.
Outcome Applying the concept of partial differentiation to evaluate
CO3
extrema, series expansion and Jacobians.
K3,K5
Remember the concept of Beta and Gamma function; analyze
CO4
area and volume.
K1,K4
Apply the concept of Vector Calculus to analyze and evaluate
CO5
directional derivative, line, surface and volume integrals.
K3,K4,K5

UNIT – I Matrices Contact Hours : 08

Rank of matrix by elementary transformation (Echelon and Normal form); Inverse of the
matrix by Gauss-Jardon’s method; Consistency of linear system of equations
CO1
(Homogeneous and non-homogeneous equation); Eigen values and Eigen vectors;
Cayley-Hamilton theorem with application.
UNIT – II Differential calculus-I Contact Hours : 08
Successive Differentiation (nth order derivatives), Leibnitz theorem, Partial derivatives,
CO2
Euler’s Theorem for homogeneous functions and Total derivative.
UNIT – III Differential calculus-II Contact Hours : 08
Expansion of functions by Taylor’s and Maclaurin’s theorems for functions of one and
CO3
two variables, Maxima and Minima of functions of several variables, Jacobians.
UNIT – IV Multiple integration Contact Hours : 08
Double integral, Triple integral, Change of order of integration, Change of variables,
CO4
Beta and Gama function and their properties.
UNIT – V Vector calculus Contact Hours : 08

Gradient, Curl and Divergence and their Physical interpretation, Line, Surface and
CO5
Volume Integrals, Gauss’s, Green’s and Stoke’s divergence theorems.
Lecture Hours : 30 Tutorial Hours :10 Total : 40
Reference Books:
1. E.Kreyszig,AdvanceEngineeringMathematics, JohnWiley&Sons,2005.
2. PeterV.O’Neil,AdvanceEngineeringMathematics,Thomson(Cengage)Learning,2007.
3. D.Poole,LinearAlgebra:AModernIntroduction,2ndEdition,Brooks/Cole,2005.
4. D.Poole,LinearAlgebra:AModernIntroduction,2ndEdition,Brooks/Cole,2005.
5. RayWylieCandLouisCBarret,AdvancedEngineeringMathematics,McGraw-Hill;SixthEdition..
Text Book:
1. B.V.Ramana,HigherEngineeringMathematics,McGraw-HillPublishingCompanyLtd.,2008.
2. B.S.Grewal,HigherEngineeringMathematics,KhannaPublisher,2005.
3. RK.Jain&SRK.Iyenger,AdvanceEngineeringMathematics,NarosaPublishingHouse2002.
4. Shanti Narayan ,A text Book of Matrices,S.Chand & Co.
5. N.P.Bali. , A text Book of Engineering Mathematics,N.P.Bali
6. H.K.Dass ,Introduction to Engineering Mathematics ,S.Chand & Co.
Video Content:
Unit-1:
https://youtu.be/jLP5Xs8Z8yE?si=Nk9ZxUcOZ6YP-lkU
https://youtu.be/Pgft33DBmUs?si=t0Ah50E49fnY4ZRn
Unit-2:
https://youtu.be/1Cl2Pje4noo?si=8ZdDhtllyQowAjYS
https://youtu.be/gx7NQXl4NC0?si=ZgAIWJcyKpBKFqQW
Unit-3 :
https://youtu.be/AS1UnsPJ8e4?si=PlnSp-IaGrS1c2fC
https://youtu.be/8T7Y_nl8yF8?si=j6_Kz3gAuQwKLbMP
Unit-4 :
https://youtu.be/dLqKr9F2cbA?si=KgpQby-ipVsT29Lr
https://youtu.be/TccLmZ0GW7g?si=HNIhnsHJWyYi_suM
Unit-5:
https://youtu.be/AGX0-tZ5rgQ?si=xoSLJ9A3Le5hayFo
https://youtu.be/WwY50hCSiSc?si=QEJuQXgwssa3VWjO
(Common to B.Tech-CSE & CSE-AIML)
Semester: I Course Category Code: ESC
Course Code Course Period / Week Credit
L T P C
ESC101 Programming for Problem Solving 3 1 0 4
Prerequisite At the end of this course, the students will be able to: Bloom’s
Level
Cousre CO1 Understood the phases of problem-solving techniques for K2,K3
Outcome simple problems.
CO2 Able to write programs using the basic language constructs. K3
CO3 Able to build a larger programs using function oriented K3
approaches.
CO4 Could write efficient programs using advanced concepts to K2
optimize the memory.
CO5 Could write programs to access data from the secondary K2,K3
storage efficiently.
UNIT – I Algorithm Problem Solving Contact
Hours : 8
History and Classifications of Computers – Components of Computer – Working Principle of CO1
Computer – Hardware – Software and its Types – Applications of Computers. Generations of
Programming Languages – Introduction to Number System. Problem solving techniques:
Program development life-cycle – Algorithms – building blocks of algorithms - Algorithmic
problem solving-Flowchart– Pseudo code
UNIT – II Data, Expressions, Statements Contact
Hours : 8
Introduction to C –C Program Structure – C Tokens: Keyword, Identifiers, Constants, CO2
Variables and Data types (simple and user-defined) – Operators and its types – Operator
Precedence – Expression Evaluation – Type Conversion –Managing Input/output operations-
Branching Statements – Looping Statements.
UNIT – III Arrays and Functions Contact
Hours : 8
Arrays – Two dimensional arrays, Multidimensional arrays. Character arrays.Functions: CO3
Function Prototype, Passing Arguments to Function – Call by Value and Call by Reference –
Nested function call – Library Functions – User-defined Functions – Recursion.Strings – String
I/O functions, String Library functions – Storage classes.
UNIT – IV Structures, Unions and Pointers Contact
Hours : 8
Structures – Arrays and structures – Nested structures – Structure as argument to functions– CO4
Union. Pointers – Declaration, Initialization and Accessing Pointer variable – Pointers and
arrays – pointers as argument and return value – Pointers and strings - Pointers and structures.
UNIT – V File Management Contact
Hours : 8
Introduction to File Concepts in C – File types – I/O operations on files – File modes – CO5
Random access to files – Command line arguments. Dynamic Memory Allocation: MALLOC,
CALLOC, FREE, REALLOC. Introduction to preprocessor: Macro substitution directives –
File inclusion directives –Compiler Control directives – Miscellaneous directives
Lecture Hours : 30 Tutorial Hours – 10 Total : 40
Reference Books :
1. Byron Gottfried & Jitender Chhabra, “Programming with C”, Schaum's Outlines Series, 2017.
2. Brian W. Kernighan & Dennis Ritchie. “The C Programming Language”, Pearson Education India.

Text Book:
1. Balagurusamy. E, “Programming in ANSI C”, Tata McGraw Hill, Seventh Edition, 2017.

Video Content:
1. https://youtu.be/irqbmMNs2Bo?si=d9HO8clLvVLuxDxd
2. https://youtu.be/si-KFFOW2gw?si=Zf3V8klsbEoE_1Rn
3. https://youtu.be/rLf3jnHxSmU?si=QqZoZo96sF34DwQ8
Semester : I Course Category Code : ESC

Period / Week Credit


Course Code Course
L T P C

ESC103 Digital Application Fundamental – 2 1 - 3


STEM(DAF-STEM)
-
Prerequisite Bloom’s Level

To describe the basic structure and components of emerging technology


CO1 K1, K2
applications and explain the concept of User Interfaces (UI) and system
architecture
To identify various types of User Interfaces and apply basic UI design
CO2 K1,K2
principles in creating simple, user-friendly interfaces.
Cousre To classify different types of databases and demonstrate basic data
Outcome CO3 storage, retrieval, and simple query operations. K2

To explain the fundamentals of programming languages and develop


CO4 simple programs using variables, control structures, and operators. K1, K3

To describe algorithms and demonstrate the ability to write basic


CO5 K2, K3
algorithms and represent them through flowcharts and pseudocode.
UNIT – I Introduction to Emerging Digital Technologies and Application Architecture Period : 6
What are Emerging Technologies? (AI, IoT, Blockchain, Cloud, AR/VR) — overview Components of a
Technology Application, Introduction to User Interface (UI) & User Experience (UX), Basics of System
Architecture CO1

UNIT – II User Interface Design and Interaction Essentials Period : 6

User Interface, Types of User Interfaces: CLI, GUI, Web UI, Mobile UI, Principles of Good UI CO2
Design, Tools for Designing User Interfaces
Period : 6
UNIT – III Data Management Concepts and Database Fundamentals
Database, Types of Databases: Relational (SQL) & Non-Relational (NoSQL), Basics of Data Storage
& Retrieval, Simple Data Tables & Queries (SQL basics)
CO3

UNIT – IV Programming Fundamentals and Application Logic Period : 6


Introduction to Programming Languages (C, Python, Java — overview), Types of Programming
Paradigms (Procedural, Object-Oriented), Variables, Data Types, Operators, Control Structures: if,
else, loops. CO4
UNIT – V Algorithm Design and Logical Problem Solving Period : 6
Algorithm, Characteristics of a Good Algorithm, Writing Simple Algorithms (Addition, Factorial,
Search), Introduction to Flowcharts & Pseudocode CO5

Lecture Period: 20 Tutorials Period – 10 Total Lecture : 30

Reference Books

1. Fundamentals of Information Technology, Author: Alexis Leon, Mathews Leon


2. Computer Fundamentals and Programming in C, Author: Reema Thareja

Course Link: https://www.futureskillsprime.in/journey/daf-stem/


(Common to B.Tech-CSE & CSE-AIML)
Semester : I Course Category Code: PCCCS
Course Code Course Period / Week Credit
L T P C
PCCCS101 Fundamental of Computers & Emerging 2 1 - 3
Technologies
Prerequisite At the end of this course, the students will be able to: Bloom’s Level
Cousre CO1 Know the fundamental terms associated with computers.
K1, K2
Outcome
CO2 Know different types of computers, mobile devices, memory and
K1,K2
various input and output devices.
CO3 Get familiar with various computer codes.
K2
CO4 Learn Cloud based Google Products and emerging Technologies.
K1,K3
CO5 Learn Gaming Technology, Communication Networks etc.
K2,K3
UNIT – I Introducing Today’s Technologies: Computers, Devices, and the Contact Hours: 6
WebToday's Technology
Computers, Mobile and Game Devices, Data and Information, The Web, Programs and CO1
Apps, Operating Systems, Applications, Communications and Networks, Wired and
Wireless Communications, Networks, Cloud Computing, Technology in Modern
Business.
UNIT – II Processors, Memory, Adapters and Buses Contact Hours: 6

Motherboard, Processors, Memory, Hard disk drive, Portable flash memory, Input and CO2
Output Devices.
UNIT – III Computer Codes Contact Hours: 6
Introduction to Computer Codes Decimal System, Binary System, Hexadecimal System, CO3
Octal System, ASCII code.
UNIT – IV Conversion of Numbers (includes fixed and fractional numbers) Contact Hours: 6

Non-Decimal to Decimal, Binary to Decimal, Decimal to Binary, Binary to Octal, Octal CO4
to Binary, Octal to Decimal, Decimal to Octal, Binary to Hexadecimal, Hexadecimal to
Binary, Hexadecimal to Decimal, Decimal to Hexadecimal
UNIT – V Latest Trends and Contact Hours: 6

Google Cloud and Products, Digital Security and Privacy, Supercomputers, Artificial CO5
Intelligence, 5G Technology, Biometric, Internet of Things(IoT), Cloud Computing,
Augmented Reality/Virtual Reality (AR/VR), Blockchain and Crypto Currency, Robotics,
Natural Language Processing (NLP), 3D Printing,Cyber world.
Lecture Hours: 20 Tutorials Hours: 10 Total: 30
Reference Books
 Discovering Computers 2016 (First Edition) Cengage Learning By Misty E. Vermaat; Susan L. Sebok;
Steven M. Freund; Jennifer T. Campbell; Mark Frydenberg (Shelly Cashman Series)
 Pearson India By M. Morris R. Mano
 Fundamentals of Computer(First Edition- 2009) Publisher: McGraw-Hill by Balaguruswamy
Text Book:

 Computer Fundamentals(First Edition-2010) Publisher: Pearson by Anita Goel


Video Content:
 https://youtu.be/AlAFytUkqHs?si=Q0_GmIGpJ7qfYpkn
 https://youtu.be/SzMiJFOa6w8?si=NQWJTJYxGpP2m32I
 https://youtu.be/hh83IP5hjv8?si=41kApYzzR45erMjO
(Common to B.Tech-CSE & CSE-AIML)
Semester: I Course Category Code: PCCCS
Course Code Course Period / Week Credit
L T P C
PCCCS103 Fundamentals of Web Designing 2 0 0 2
Prerequisite At the end of this course, the students will be able to: Bloom’s Level

Course CO1 Understand the basic concepts of web development, including the
K1, k2
Outcome Internet, the Web, client-server architecture, and the distinctions
between frontend and backend development.
CO2 Demonstrate the ability to create and structure web pages using
K1,K2
HTML, including the use of common elements (headings,
paragraphs, links, lists, images, tables) and advanced features such
as forms, input elements, and multimedia integration.
CO3 Gain skills in applying CSS for styling text and boxes, using the box
K2
model, and implementing layout techniques such as positioning,
floating elements, flexbox, and grid layout. Understand and utilize
different CSS units and measurements.
CO4 Utilize advanced CSS techniques, including CSS variables, pseudo-
K1,K3
classes, and pseudo-elements, as well as transitions and
animations. Design responsive web pages using media queries, a
mobile-first approach, and responsive images and videos. Employ
CSS frameworks like Bootstrap for rapid prototyping.
CO5 Develop, structure, and manage a frontend web project
K2,K3
incorporating HTML, CSS, and JavaScript. Implement version
control using Git and successfully upload and maintain projects on
GitHub for professional review.
UNIT – I Overview Of Web Development Contact Hours : 4

Understanding the Internet and the Web, Client-Server, Architecture, Introduction to CO1
Frontend and Backend Development.
HTML Basics: HTML Syntax and Structure, Common HTML Elements: headings,
paragraphs, links, lists, images, tables, Semantic HTML.
Advanced HTML: Forms and Input Elements, Multimedia: audio, video, HTML5 New
Features.
UNIT – II Introduction to CSS Contact Hours : 4

CSS Syntax and Selectors, Inline, Internal, and External CSS, Styling Text and Boxes: CO2
Fonts, Colors, and Text Properties, Box Model: margins, padding, Borders.
Layout Techniques: Display, Positioning, and Floating Elements, Flexbox and Grid
Layout, CSS, Units and Measurements.
UNIT – III Advanced CSS Technique Contact Hours : 4

CSS Variables, Pseudo-classes and Pseudo-elements, Transitions and Animations. CO3


Responsive Web Design: Media Queries, Mobile-First Design Approach, Responsive
Images and Videos.
CSS Frameworks: Introduction to Bootstrap, Using Bootstrap for Rapid Prototyping.
UNIT – IV Introduction to Java Script Contact Hours : 4

JavaScript Syntax and Basics, Variables, Data Types, and Operators, Control CO4
Structures: conditionals and loops.
Functions and Events: Defining and Calling Functions, Event Handling and DOM
Manipulation.
Arrays and Objects: Array Methods and Iteration, Working with Objects and JSON.
Theory of predicate logic.
UNIT – V Project Work Contact Hours : 4

Structuring a Frontend Project, Project Development using above technologies i.e. CO5
HTML, CSS, JavaScript, Version Control with Git, uploading project on GitHub for
companies review.
Lecture Hours : 20 Tutorial Hours – 00 Total : 20

Reference Books
1. "HTML and CSS: Design and Build Websites" by Jon Duckett.
2. JavaScript and jQuery: Intercave Front-End Web Development" by Jon Duckett.
Text Book:
1. “HTML, CSS and JavaScript Guide “by Gaurav Vishwa.
Video Content:
1. https://youtu.be/JsbxB2l7QGY?si=p1C0Qz3N3EkjKh4w
2. https://youtu.be/0HxjsUqRlIs?si=wc7qUoy3NLXNx5KM
3. https://youtu.be/z0n1aQ3IxWI?si=XkXX0V2kBqz5cKrT
4. https://youtu.be/6mbwJ2xhgzM?si=VMUJXc1nyx1Q0b7i
Semester : I Course Category Code : ESC

Period/Week Credit
Course Code Course
L T P C

ESC155 Digital Application Fundamental – - - 2 1


STEM(DAF-STEM) Lab
Prerequisite -

CO1 To understand and try out new technologies like AI, IoT, Cloud, and simple app
structures.

CO2 To understand and try out new technologies like AI, IoT, Cloud, and simple app
structures.
Course Outcome
CO3 To learn how data is stored in databases and how to get it back using simple
commands.
CO4 To learn few basics of programming languages (C/Python/ Java) and practice simple
programs using variables, operators, and control statements only.
To understand algorithms, write simple algorithms, and draw flowcharts for basic
CO5 problems.

List of Practicals
1.Learn what AI, IoT, Cloud, Blockchain, AR/VR mean through simple videos/demos.

2.Try a small AI tool like a chatbot maker (no coding needed).


CO1
3.Make a simple Cloud storage account (Google Drive / Firebase demo).
4.Draw a basic structure of an online shopping app (boxes and arrows).

5. Make a simple Command-Line app (like a calculator in Python/C++).


6. Create a basic webpage using HTML and CSS.
CO2
7. Use free tools like Canva or Pencil Project to draw simple UI designs.
8. Design a simple mobile app screen layout using Figma / Canva.
9. Install and open MySQL software.
10. Make a simple database and a table (like Student, Product).
CO3
11. Add, update, and delete some records.
12. Fetch specific records using basic queries like SELECT * FROM table.
13. Write a program to display your name and college name.
(In C / Python / Java)
14. Write a program to add, subtract, multiply, and divide two numbers
CO4
15. Write a program to check whether a number is even or odd using if-else.
16. Write a program to print numbers from 1 to 10 using a for loop.
17. Write a program to find the largest of three numbers using if-else or else if.
18. Write a program to swap two numbers using a temporary variable.
19. Write an algorithm and draw a flowchart to add two numbers.
20. Write an algorithm and draw a flowchart to find the factorial of a number.
CO5
21. Write an algorithm and flowchart to find whether a number is even or odd.
22. Write an algorithm for a simple search problem (like finding an item in a list).
23. Write an algorithm for a simple search problem (like finding an item in a list).
(Common to B.Tech-CSE & CSE-AIML)

Semester : I Course Category Code : PCCCS

Period / Week Credit


Course Code Course
L T P C

PCCCS151 Fundamental of Web Design LAB 0 0 2 1

Prerequisite At the end of this course, the students will be able to:

CO1 To introduce the fundamentals of Internet, and the principles of web design.

CO2 To construct basic websites using HTML and Cascading Style Sheets.
To build dynamic web pages with validation using Java Script objects and by
Course CO3
Outcome applying different event handling mechanisms.
Develop web pages using the HTML and CSS features with different layouts as
CO4
per need of applications.

CO5 Use the JavaScript to develop the dynamic web pages.

List of experiment

Design the following static web pages required for an online book store website.
HOMEPAGE:
 The static home page must contain three frames.
 Top frame: Logo and the college name and links to Homepage, Login page, Registration
page, Catalogue page and Cart page (the description of these pages will be given below).
For example: When you click the link “CSE” the catalogue for CSE Books should be displayed in
the Right frame. Right frame: The pages to the links in the left frame must be loaded here. Initially
this page contains description of the web site.

1 Home Page –

Logo Web Site Name

Home Login Registration Catalouge Cart

CSE
ECE
EEE
CIVIL
Lo Login Page - is page looks like
2
3

4
5

9 A:link
A:visited
A:active
A:hover

10
(Common to B.Tech-CSE & CSE-AIML)

Department: Computer Science and Engineering Programme: B.Tech

Semester : I Course Category Code : ESC

Period/Week Credit
Course Code Course
L T P C

ESC151 Programming for Problem Solving using C-Lab 0 0 2 1

Prerequisite At the end of this course, the students will be able to:

CO1 Understood the program editing and compilation environment.

CO2 Able to write simple C programs using most frequently used control structures.
Course CO3 Apply the methods problems using arrays and functions.
Outcome
CO4 Learnt to handle data processing using structures for simple applications.
CO5 Write programs that could handle file i/o and pointers.

Programming Using C
1. Study of Compilation and execution of simple C programs
2. Basic C Programs, Arithmetic Operations, Area and Circumference of a circ. Swapping CO1
with and without Temporary Variables

3. Programs using Branching statements


a. To check the number as Oddor Even.
b. Greatest of Three Numbers.
c. Counting Vowels.
d. Grading based on Student’s Mark.
4. Programs using Control Structures CO2
e. Computing Factorial of a number
f. Fibonacci Series generation
g. Prime Number Checking
h. Computing Sum of Digit
5. Programsusing Arrays
a. Sum of‘n’ numbers
b. Sorting an Array
c. Matrix Addition, Subtraction, Multiplication and Transpose CO3
6. Programsusing Functions
a. Computing nCr
b. Factorial using Recursion
c. Call by Value and Call by Reference
7. Programs using String Operations
a. Palindrome Checking
b. Searching and Sorting Names
8. Programs using Structure CO4
a. Student Information System
b. Employee PaySlip Generation
c. Electricity Bill Generation
9. Programs using Pointers
a. Pointe rand Array
b. Pointers as argument and return value
c. Pointer and Structure
10. Programs using File Operation CO5
a. Counting No.of Lines,Characters and Black Spaces
b. Content copy from one file to another
c. Reading and Writing Data in File
B.Tech. First Year, Semester-II

(Common to CSE & CSE-AIML)


(Common to B.Tech-CSE & CSE-AIML)
Semester : II Course Category Code : BSC
Period / Week Credit
Course Code Course
L T P C
BSC 104 Discrete Mathematics 3 1 0 4
Prerequisite At the end of this course, the students will be able to: Bloom’s Level
Apply the concept of Set, Relation, function and Counting
CO1 Techniques.
K3
Apply the concept of Lattices and Boolean Algebra to create
CO2 Logic Gates and Circuits, Truth Table, Boolean Functions, K3,K6
Karnaugh Map.
Course Remember and apply the concept of Mathematical Logic for
Outcome CO3 K1,K3,K5
Circuits Output.
Understand the concept of Graph theory evaluate
CO4 engineering problems and construct the graph.
K2,K4
Remember the concept of Formal Logic ,Group and Rings to
CO5 evaluate real life problems.
K1,K5
UNIT – I Set, Relation, Function and Counting Techniques Contact Hours : 8
Introduction on Set Function and Relation,Mathematical Induction,: Injective and
surjective functions, composition of function, Inverse function, Use of function in
coding theory, Relation composition of relation, Equivalence relation.Discrete CO1
numeric function and Generating functions, recurrence relations and their solution ,
Pigeonhole principle.
UNIT – II Boolean Algebra and Lattice Contact Hours : 8
Introduction, Partially ordered sets, Hasse Diagram, Maximal and Minimal element,
Upper and Lower bounds, Isomorphic ordered sets, Lattices, Bounded Lattices and ,
Distributive Lattices. Duality, Boolean Algebras as Lattices, Minimization of Boolean CO2
Expressions, prime Implicants, Logic Gates and Circuits, Truth Table, Boolean
Functions, Karnaugh Maps.
UNIT – III Mathematical Logic Contact Hours : 8
Proposition & Propositional Form conditional and Bi-conditional Statements,
Negation operation, Logic connectives and compound statements, conjunction, CO3
disjunction, truth tables, Duality conditional and in-conditional statements.
UNIT – IV Graph theory Contact Hours :8
Definition of a graph, finite and infinite graphs, Incidence and degree, null graph, Sub
graphs walks, Paths and circuits in a graph, connected graphs, Trees, Properties of CO4
Trees,. Matrix Representation of Relation. Digraphs.
UNIT – V Group, Ring ,Field and Ideal Contact Hours : 8
Semi group, Monoid Group, Group,The Dihedral group,Quotient Groups, Cosets,
Lagrange’s theorem , Generators of Group, Cyclic and permutation groups,
CO5
Properties of groups, Rings and Fields (definition, examples and standard results
only), Ideals
Lecture Hours : 30 Tutorials Hours : 10 Total : 40
Reference Books
1. C.L. Liu, "Elenments of Discrete Mathematics" Mc Graw Hill Book Co., 1985
2. N. Deop, "Graph Theory with applications to Engineering and Computer Science", PHI 1993.
3. B. Colman and Robert C. Busby, "Discrete Mathematical structure for Computer Science," PHI.
Text Book:

1. Olympia Nicodemi, "Discrete Mathematics" CBS Publication, Delhi.


Video Content:

1. https://youtu.be/NZeGqylTSN4?feature=shared
2. https://youtu.be/RppxMfN9JqE?feature=shared
(Common to B.Tech-CSE & CSE-AIML)
Semester : II Course Category Code : HSMC
Period / Week Credit
Course Code Course
L T P C
HSMC102 Professional Communication 2 1 0 3
Prerequisite At the end of this course, the students will be able to: Bloom’s Level
Understand the importance of professional
CO1 communication in various contexts, including workplace K2
interactions and professional relationships.
Master the art of crafting a professional resume or CV
CO2 that effectively highlights qualifications, experience, and K1,K2
Course skills.
Outcome Understand the impact of gestures, postures, and overall
CO3 K3
personal appearance on communication effectiveness.
Assess and understand individual personality traits and
CO4 K1,K3
their impact on personal and professional interactions.
Learn to create effective PowerPoint presentations,
CO5 K3
including design, content organization, and visual aids.
UNIT – I Introduction of Communication Skills Contact Hours : 6
Role and purpose of Professional Communication, Introducing/Meeting New
CO1
People, Giving Self Introduction, Interview Skills, Mock Interview Practice.
UNIT – II Business Communication Contact Hours : 6

Resume/C.V. Writing, Soft Skills and Hard Skills, Polite Conversation, Email
CO2
Writing, Letter Writing.

UNIT – III Non- Verbal Communication Contact Hours : 6


Body Language and Personal Appearance: - Gestures and Postures, Kinesics
and Proxemics, Tips for Improving Non Verbal Communication, Self- CO3
Grooming.
UNIT – IV Personality Development Contact Hours : 6
Personality Analysis, SWOT Analysis, Personality and other factors contributing to
CO4
career development, Debate practice, Group Discussion.
UNIT – V Presentation Skills Contact Hours : 6
Preparation of PowerPoint presentation, Presentation skills, Seminars and
Webinars, Etiquettes & Netiquettes to be followed in:- Personal Interview, CO5
Telephonic Interview, Group Discussion, Debate & Seminar.
Lecture Hours : 20 Tutorials Hours :10 Total : 30

Reference Books :
1.Technical Communication by Meenakshi Raman and Sangeeta Sharma, Oxford University Press,2004.
2. Technical Communication by Mike Markel and Stuart A. Selber, Bedford/St. Martin's, 2022.
3. The Art of Learning: An Inner Journey to Optimal Performance by Josh Waitzkin, Free Press, 2007.
4. Personality Development and Soft Skills by Barun K. Mitra, Oxford University Press.
Text Books:
1.Business communication by K.K. Sinha, Galgotiya Publishing Company, New Delhi.
2.Technical Communication by Malti Agrawal, Krishna Prakashan Media Ltd, Meerut.
3.Soft skills by Dr.K.Alex, S.Chand & Company Ltd. New Delhi,2009.
4. Professional Communication by Malti Agarwal, Krishna Prakashan Media Ltd, Meerut, 2013
Video Content:
https://www.youtube.com/live/UudSwjqFdNM?si=2FQ1t32X8Blqrx79
https://youtu.be/OLVUrgQ_BbA?si=hyL95ifShFr7T-6a
https://youtu.be/muXfu-wgLeA?si=H9TO2pRmvbR9PCoO
https://youtu.be/i7og-Xripf0?si=x4T0e-CjyXZXoHXN
https://youtu.be/Q074YSGwRTM?si=0-htw4k-HpG8qTpf
(Common to B.Tech- CSE & CSE-AIML)

Semester : II Course Category Code : PCCCS

Period / Week Credit


Course Code Course
L T P C

PCCCS102 Basics of Python Programming 2 1 0 3

Prerequisite At the end of this course, the students will be able to:
Understood the phases of problem solving techniques for simple
CO1
problems.
CO2 Able to write programs using the basic language constructs.
Course Outcome
CO3 Able to build a larger programs using function oriented approaches.
Could write efficient programs using advanced concepts to optimize the
CO4
memory.
CO5 Could write programs oops concept based.

UNIT – I Introduction of Python Contact Hours : 6


The Programming Cycle for Python, Python IDE, Interacting with Python
Programs, Elements of Python, Type Conversion. Expressions, Assignment CO1
Statement, Arithmetic Operators , Operator Precedence, Boolean Expression.
UNIT – II Conditionals and loops Contact Hours : 6
Conditional statement in Python (if-else statement, its working and execution),
Nested-if Statement and Elif statement in Python, Expression Evaluation & Float
Representation Purpose and working of loops, While loop including its working, CO2
For Loop, Nested Loops, Break and Continue.
UNIT – III Data structure, function and string Contact Hours : 6
Parts of A Function, Execution of A Function, Keyword and Default Arguments,
Scope Rules. Length of the string and perform Concatenation and Repeat
operations in it, Indexing and Slicing of String Tuples, Unpacking Sequences, CO3
Lists, Mutable Sequences, List Comprehension ,Sets, Dictionaries. Treat functions
as first-class Objects, Lambda Expressions.
Sieve of Eratosthenes, File I/O, Exceptions and Assertions
UNIT – IV Contact Hours : 6
Modules
Generate prime numbers with the help of an algorithm given by the Greek
Mathematician named Eratosthenes, whose algorithm is known as Sieve of
Eratosthenes, File input and output operations. In Python Programming
CO4
Introduction, Importing Modules Abstract data types and ADT interface .In Python
Programming. Class definition and other operations in the classes, Special Methods
(such as in it, str, comparison methods and Arithmetic methods etc.),Class
Example, Inheritance, Inheritance and OOP.
UNIT – V Iterators & Recursion Contact Hours : 6
Recursive Fibonacci, Tower Of Hanoi Simple Search and Estimating Search Time,
Binary Search and Estimating Binary Search Time Selection Sort, Merge List, CO5
MergeSort, Higher Order Sort.
Lecture Hours : 20 Tutorials Hours – 10 Total : 30

Reference Books
1. Python Cookbook: Recipes for Mastering Python 3 (3rd Edition)
2. Python Crash course By Eric Matthews
3. Learning Python By Mark Lutz
Text Books:

1. Python in Nushell By Alex Martelli


2. Think Python By Allen Downey
Video Content :

1. https://youtu.be/7wnove7K-ZQ?si=P156wu3SJcrpWh6i
2. https://youtu.be/7wnove7K-ZQ?si=jbHkbuXv_kGF9vrS
3. https://youtu.be/7wnove7K-ZQ?si=Cf9TnYDaekqizKco
(Common to B.Tech-CSE & CSE-AIML)
Semester : II Course Category Code : PCCCS
Period / Week Credit
Course Code Course
L T P C
PCCCS104 OOPS WITH C++ 2 1 - 3

Prerequisite At the end of this course, the students will be able to: Bloom’s Level
Understand the Basic concept of Object Orientation, object identity and
CO1
Encapsulation.
K2,K3

CO2 Understand the Basic concept of Basic Structural Modeling. K3


Course
Outcome CO3 Know the knowledge of Object oriented design, Object design. K2
CO4 Know the knowledge of C++ Basics. K3
CO5 Understand the Basics of object and class in C++. K2,K3
UNIT – I Introduction to Object Oriented Programming Contact Hours : 6
Overview of structured programming approach, Object oriented programming approach,
Characteristics of object oriented languages, C++ Program Structure, Character Set and
Tokens, Data Type, Type Conversion, Preprocessor Directives, Namespace, Input/Output
Streams and Manipulators, Dynamic Memory Allocation with new and delete, Control
Statements. CO1
Functions: Function Overloading, Inline Functions, Default Argument, Pass by
Reference, Return by Reference, Scope and Storage Class.
Pointers: Pointer variables declaration & initialization, Operators in pointers, Pointers and
Arrays, Pointer and Function.
UNIT – II Classes & Objects Contact Hours : 6
Structures and Classes, A Simple Class and Object, Accessing members of class,
Initialization of class objects: (Constructor, Destructor), Default Constructor,
Parameterized Constructor, Copy Constructor, Constructor Overloading,Objects as CO2
Function Arguments, Returning Objects from Functions, Memory allocation for Objects,
Static members, Member functions defined outside the class.
UNIT – III Polymorphism & Inheritance Contact Hours : 6
Fundamental of operator overloading, Restriction on operator overloading, Operator
functions as a class members, Overloading unary and binary operator, Data Conversion
(basic to basic, basic to user-defined, user-defined to basic), Introduction to inheritance,
CO3
Derived Class and Base Class, Access Specifiers (private, protected, and public), Types of
inheritance, Public and Private Inheritance, Constructor and Destructor in derived classes,
Aggregation.

UNIT – IV Abstract Class, Virtual Function, & Exception Handling Contact Hours : 6

Concept of Virtual functions, Late Binding, Abstract class and pure virtual functions,
Virtual Destructors, Virtual base class, Friend function and Static function, Friend
Class,this pointer, Polymorphism and its roles.Function templates, Function templates with CO4
multiple arguments, Exceptional Handling (Try, throw and catch), Use of exception
handling.
UNIT – V File handling Contact Hours : 6
Stream Class Hierarchy for Console Input /Output, Unformatted Input /Output, Formatted
Input/Output with ios Member functions, Formatting with Manipulators, Stream , File
Input/output with Streams, Opening and Closing files, Read/Write from File, File Access CO5
Pointers and their Manipulators, Sequential and Random Access to File.

Lecture Hours : 20 Tutorial Hours – 10 Total : 30

Reference Books :
1. Object Oriented Design by Rumbaugh (Pearson publication).
2. Object-oriented programming in Turbo C++ By Robert Lafore, Galgotia Publication.
3. The Compete Reference C++, Herbert Schlitz, TMH.

Text Books:
1. Object-oriented programming with C++ byE.Ba1agurusamy, 2nd Edition, TMH.
2. C++ and Object Oriented Programming Paradigm, PHI.

Video Contents:

1. https://youtu.be/nGJTWaaFdjc?si=8j7w0MrK2hY_tSFy
2. https://youtu.be/j8nAHeVKL08?si=ca1NEfADGakB_lUJ
3. https://youtu.be/z9bZufPHFLU?si=taCwhDXzTvhSM3WY
Department: Computer Science and Engineering Programme: B.Tech

Semester: II Course Category Code: PCCCS

Period/Week Credit
Course Code Course
L T P C

PCCCS106 Introduction To Cybersecurity 2 0 - 2

Prerequisite At the end of this course student will be able to: Bloom’s
Level
CO1 Understand cybersecurity concepts and threat types. K1,K2

CO2 Apply network/system security principles. K1,K2


CO3 Identify and assess threats/vulnerabilities. K2
K1,K3
Course CO4 Perform basic incident response and risk analysis.
Outcome
CO5 Demonstrate ethical hacking awareness and legal compliance. K2,K3

UNIT–I Cybersecurity Basics & Landscape Period:6

Introduction to cybersecurity, CIA triad, Cyber threats: malware, phishing, DoS,


ransomware, Threat actors & motivations, Overview of NASSCOM job roles (Security
Analyst, SOC Analyst), Recent attack case studies CO1

UNIT–II Network and System Security Period:6


Network layers and security tools (Firewall, IDS/IPS, VPN), System hardening & endpoint
CO2
protection, Access control, authentication, password policies, Securing cloud systems and
web servers

UNIT–III Threats & Vulnerability Assessment Period:6

Types of vulnerabilities (software, network, human), Vulnerability scanners (Nessus/ Open


VAS demo), Basics of OWASP Top 10, Malware types & behavior analysis
CO3
Risk Management & Incident Response
UNIT–IV
Risk assessment and impact analysis, Security policies and mitigation plans, Introduction to
incident response lifecycle, SOC roles and escalation process, Hands-on case: response to a
ransomware attack CO4
UNIT–V Ethical Hacking & Cyber Law

Phases of ethical hacking, Tool overview: Nmap, Wireshark, Burp Suite,Cyber law basics: IT
Act 2000, GDPR, ISO 27001,Ethical and legal practices in cybersecurity, Real-world
examples of cybercrime prosecution. CO5
(Common to B.Tech-CSE & CSE-AIML)
Course Code HSMC 104 L T P Credit
Course Title Design Thinking 1 0 0 1
Course Outcomes: At the end the course, students will be able to Duration: 15 Hours
CO 1 Understand the need for Creative Thinking and Innovation K1
CO 2 Understand the process involved in innovation and creativity. K1
CO 3 Analyze the available design thinking solutions in products and services K3
CO 4 Apply design thinking to your real-life problems/situations to evolve innovative and
workable solutions K2

CO 5 Understand the need for reverse engineering to solve business problems K1


Pre-requisites:
Course Contents / Syllabus
UNIT-I CREATIVITY 3 Hours

Design Thinking with Application, Creativity, Way to Improve Creative Thinking Skills, Dynamics of
Creative Thinking, Component of Creativity, Types of Creativity, Creativity- Training & Learning for
Development, Creative Industries, Six Thinking Hats, Case Study.

UNIT-II INNOVATION & INVENTION- IDEA GENERATION 3 Hours


Innovation, Invention, Need for Innovation, Meaning & Differences between Innovation and Creativity,
Technological Innovation, Sustainable & Disruptive Innovation, Service Innovation, Improvisation, Co-
Creation and Open Innovation, Sources of Innovation, Case Study.
UNIT-III APPLICATION OF DESIGN THINKING, BUSINESS MODEL 3 Hours

Industry 4.0, Startup, Large Firm, Design Thinking in Various Sectors (Health Sector, Finance, Education,
Infrastructure) Design thinking case studies in Retail, Banking.

UNIT-IV PROCESS OF DESIGN THINKING 3 Hours


Process of Design Thinking, Implementing the process in driving innovation, Desing-Led Innovation,
Innovation Environment, Benefit of Design Thinking in Industries, Creative Destruction, Prototypes, Case
Study.
UNIT-V WORKSHOP AND SEMINAR ON DESIGN THINKING 3 Hours

Students Workshop on Manufacturing and Service Industry (Infrastructure, Hospitality, Retail, E-


Commerce, Finance & Banking, Automobile, Organic Farming and Education.

Textbooks
1. Jeanne Liedtka and Tim Ogilvie Designing for Growth: A Design Thinking Tool Kit for Managers (Columbia
University Press, 2011)

2. Tom Kelly, The Art of Innovation: Lessons in Creativity From IDEO, America’s Leading Design Firm (Profile
Books, 2002)
(Common to B.Tech-CSE & CSE-AIML)
Semester : II Course Category Code PCCCS
Period / Week Credit
Course Code Course L T P C
PCCCS152 Basics of Python Programming Lab 0 0 4 2
Prerequisite At the end of this course, the students will be able to:
CO1 Understood the program editing and compilation environment.
Able to write simple Python programs using most frequently used
CO2 control structures.
Course
CO3 Apply the methods problems using String, tuple and functions.
Outcome
CO4 Learnt to handl Input Output operation and ADT.
CO5 Binary Search Tree, bubble sort, merge sort.
Programming Using Python
1. Study of Compilation and execution of simple python programs
2. Basic python Programs
• Arithmetic Operations CO1
• Area and Circumference of a circle
• Swapping with and without Temporary Variables
3. Programs using Branching statements
 To check the number as Odd or Even
 Greatest of Three Numbers
4. Programs using Control Structures
CO2
 Computing Factorial of a number
 Fibonacci Series generation
 Prime Number Checking
 Computing Sum of Digit
5. Programs using list ,tuple
a. Sum of two list.
b. Show a name ,age with tuple
6. Programs using Functions CO3
a. Factorial using Recursion
b. Call by Value and Call by Reference
c. Adding two number with the help of function

7. Programs using String Operations


a. Palindrome Checking
8. Programs using class
CO4
a. Show the area of rectangle with class.
b. Using inheritance make a program

9. Programs using sorting


a. Make a program with selection sort. CO5
10. Programs using Recursive Fibonacci.
(Common to B.Tech-CSE & CSE-AIML)
Department : Computer Science and Engineering Programme : B.Tech

Semester : II Course Category Code : PCCCS


Period / Week Credit
Course Code Course
L T P C
PCCCS154 OOPS with C++ LAB 0 0 4 2
Prerequisite At the end of this course, the students will be able to:
Able to differentiate structure oriented programming and object oriented
CO1
programming

Course CO2 Able to understand and apply various object oriented features
Outcome
Able to know concepts in operator overloading, function overloading &
CO3
polymorphism.

CO4 Design programs involving constructors, destructors.

CO5 To implement the concept of files, templates and exceptions.

List of experiment
EXERCISE-1 (BASICS)
 Write a CPP Program to demonstrate the structure of a C++ program.
 Write a CPP Program to display the names of header files, definitions and list of functions
supported.
 Write a program to show the base of a numeric value of a variable using Hex, Oct and
Decmanipulator functions.
1  Write a CPP Program to use of the standard manipulators normally used in the stream
classes.
 Write a CPP Program to demonstrate the usage of bit fields.
 Write a CPP Program to define constant pointer and pointer to constant and perform
possible operations.
 Write a CPP Program access a variable in different scopes by using scope resolution
operat or and the use of comma operator.
E EXERCISE-2 (CLASSES & OBJECTS)
 Write a CPP Program to swap two numbers using call by value, call by address, call by
reference and return by reference.
 Write a CPP Program to calculate square and cube of a number using inline functions and
macros. (Demonstrate the use of inline functions compared to macros).
 Write a CPP Program to find the area of a rectangle, a triangle and surface area of a
sphere using function overloading.
2  Write a CPP Program to declare all members of a class as public, Access the members
using objects. (Use public, protected, private).
 Write a CPP Program to access the member functions inside and outside a class.
 Write a CPP Program to access private data using non-member functions. (Use friend
function).
 Write a CPP Program to pass objects to functions by pass by value method.
EXERCISE-3 (CONSTRUCTORS AND OPERATOR OVER LOADING)
 Write a CPP Program to show that “for each object constructors is called separately” and
read the values through keyboard (Use Constructor).
 Write a CPP Program to create constructor with arguments and pass the arguments to
constructor.
3  Write a CPP Program to create object and release them using destructor.
 Write a CPP Program to perform addition, subtraction, multiplication of two objects using
operator keyword.
 Write a CPP Program to overload unary and binary operator overloading with friend
function.

EXERCISE-4 (INHERITANCE AND POLYMORPHISM)


 Write a CPP Program to derive a class publicly from base class. Declare base class
members under public, private and protected.
 Write a CPP Program to derive single and multiple inheritances.
4  Write a CPP Program to declare virtual base class. Derive a class using two virtual
classes.
 Write a CPP Program to implementation of Virtual Function.
 Write a CPP Program to Implementation of Pure Virtual Function.
EXERCISE- 5 (FILES, TEMPLATES AND EXCEPTION HANDLING)
 Write a CPP Program to write and read text in a file. Use ofstream and ifstream classes.
 Write a CPP Program to open a file for writing and reading purpose. Use open () function.
 Write a CPP Program write text in a file. Read the text from the file from EOF. Display
the
5 contents in reverse order.
 Write a CPP Program to demonstrate that the data is read from file using ASCII format.
 Write a CPP Program to find the factorial of a number. Throw multiple exceptions and
define multiple catch statements to handle exceptions.
 Write a C++ Program to illustrate template class.
 Write C++ program to demonstrate Overloading new and delete operator
 Write C++ program to compare two Strings using Operator Overloading
 Write C++ Program to concatenate two strings using Operator Overloading
 Write a C++ Program to Find the Number of Vowels, Consonants,Digits and White
Spaces in a String
 Write a C++ Program to remove all Characters in a String except Alphabets.
 Write a C++ Program to Find the Frequency of Characters in a String
 Write C++ Program for remove all duplicates from the input string. Print all the duplicates
6
in the input string.
 Write C++ Program for remove characters from the first string which is present in the
second string
 Write C++ Program to check if strings are rotations of each other or not
 Write C++ Program to read a string .Add the same string in the reverse order to the end of
the same string.
 Write C++ program to declare string objects .Perform assignment and concatenation with
the string objects.

You might also like