NOIDA INSTITUTE OF ENGINEERING & TECHNOLOGY, GREATER NOIDA, GAUTAM BUDDH NAGAR

(AN AUTONOMOUS INSTITUTE)

Affiliated to

DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY, LUCKNOW

Evaluation Scheme & Syllabus

For

Bachelor of Technology
Computer Science & Engineering
Second Year
(Effective from the Session: 2024-25)
NOIDA INSTITUTE OF ENGINEERING & TECHNOLOGY, GREATER NOIDA, GAUTAM BUDDH NAGAR
(AN AUTONOMOUS INSTITUTE)

Bachelor of Technology
Computer Science & Engineering
Evaluation Scheme
SEMESTER-III
End
Sl. Subject Types of Periods Evaluation Schemes Total Credit
Subject Semester
No. Codes Subjects
L T P CT TA TOTAL PS TE PE
3 WEEKS COMPULSORY INDUCTION PROGRAM
1 BAS0301A Engineering Mathematics-III Mandatory 3 1 0 30 20 50 100 150 4
2 BCSE0306 Discrete Structures Mandatory 3 1 0 30 20 50 100 150 4
3 BCSE0304 Digital Logic and IoT Systems Mandatory 3 0 0 30 20 50 100 150 3
4 BCSE0301 Data Structures and Algorithms – I Mandatory 3 0 0 30 20 50 100 150 3
Computer Organization and
5 BCSE0305 Mandatory 3 0 0 30 20 50 100 150 3
Architecture
6 BCSE0352 Object Oriented Techniques using Java Mandatory 0 0 6 50 100 150 3
Data Structures and Algorithms - I
7 BCSE0351 Mandatory 0 0 4 50 50 100 2
Lab
Digital Logic and IoT Systems
8 BCSE0354 Mandatory 0 0 2 25 25 50 1
Lab
9 BCSE0359 Internship Assessment -I Mandatory 0 0 2 50 50 1
BNC0301/ Artificial Intelligence & Cyber Ethics/ Compulsory
10 2 0 0 30 20 50 50 100 NA
BNC0302 Environmental Science Audit
*Massive Open Online Courses
*MOOCs
(For B.Tech. Hons. Degree)
TOTAL 1100 24
 * List of MOOCs Based Recommended Courses for Second year (Semester-III) B. Tech Students
Subject University / Industry Partner
Sr. No. Course Name No of Hours Credits
Code Name
Infosys Wingspan (Infosys
1 BMC0012 Data Structures and Algorithms using Python - Part 1 29h 27m 2
Springboard)
Infosys Wingspan (Infosys
2 BMC0008 Object Oriented Programming Using Python 46h 13m 3.5
Springboard)

PLEASE NOTE: -

 A 3-4 weeks Internship shall be conducted during summer break after semester-II and will be assessed during semester-III
 Compulsory Audit (CA) Courses (Non-Credit - BNC0301/BNC0302)
 All Compulsory Audit Courses (a qualifying exam) do not require any credit.
 The total and obtained marks are not added in the grand total.

Abbreviation Used:

L: Lecture, T: Tutorial, P: Practical, CT: Class Test, TA: Teacher Assessment, PS: Practical Sessional, TE: Theory End Semester Exam.,
CE: Core Elective,OE:Open Elective, DE: Departmental Elective, PE: Practical End Semester Exam, CA: Compulsory Audit,
MOOCs: Massive Open Online Courses.
 NOIDA INSTITUTE OF ENGINEERING & TECHNOLOGY, GREATER NOIDA, GAUTAM BUDDH NAGAR
(AN AUTONOMOUS INSTITUTE)

Bachelor of Technology
Computer Science & Engineering
Evaluation Scheme
SEMESTER-IV
End
Sl. Subject Types of Periods Evaluation Schemes
Subject Subjects
Semester Total Credit
No. Codes
L T P CT TA TOTAL PS TE PE
1 BAS0402 Engineering Mathematics-IV Mandatory 3 1 0 30 20 50 100 150 4
2 BASL0401 Technical Communication Mandatory 2 1 0 30 20 50 50 100 3
Theory of Automata and Formal
3 BCSE0404 Mandatory 3 0 0 30 20 50 100 150 3
Languages
4 BCSE0401 Data Structures and Algorithms - II Mandatory 3 0 0 30 20 50 100 150 3
5 BCSE0403A Operating Systems Mandatory 2 0 0 30 20 50 50 100 2
6 BCSE0452 Database Management Systems Mandatory 0 0 6 50 100 150 3
Data Structures and Algorithms – II
7 BCSE0451 Mandatory 0 0 4 50 50 100 2
Lab
8 BCSE0453A Operating Systems Lab Mandatory 0 0 4 50 50 100 2
9 BASL0451 Technical Communication Lab Mandatory 0 0 2 25 25 50 1
10 BCSE0459 Mini Project Mandatory 0 0 2 50 50 1
BNC0402/ Environmental Science/
Compulsory
11 Artificial Intelligence & 2 0 0 30 20 50 50 100 NA
BNC0401 Audit
Cyber Ethics
*Massive Open Online Courses
*MOOCs
(For B.Tech. Hons. Degree)
TOTAL 1100 24
 * List of MOOCs Based Recommended Courses for Second year (Semester-IV) B. Tech Students

. No. Subject Code Course Name University / Industry Partner Name No of Hours Credits

1 BMC0018 Data Structures and Algorithms using Python - Part 2 Infosys Wingspan (Infosys Springboard) 37 h 41 m 3

2 BMC0019 Data Structures and Algorithms using Java Infosys Wingspan (Infosys Springboard) 49 h 52 m 4

PLEASE NOTE: -

 A 3-4 weeks Internship shall be conducted during summer break after semester-IV and will be assessed during Semester-V
 Compulsory Audit (CA) Courses (Non-Credit - BNC0401/BNC0402)
 All Compulsory Audit Courses (a qualifying exam) do not require any credit.
 The Total and obtained marks are not added in the Grand Total.

Abbreviation Used:
L: Lecture, T: Tutorial, P: Practical, CT: Class Test, TA: Teacher Assessment, PS: Practical Sessional, TE: Theory End Semester Exam.,
CE: Core Elective,OE:Open Elective, DE: Departmental Elective, PE: Practical End Semester Exam, CA: Compulsory Audit,
MOOCs: Massive Open Online Courses.
 NOIDA INSTITUTE OF ENGINEERING & TECHNOLOGY, GREATER NOIDA, GAUTAM BUDDH NAGAR
(AN AUTONOMOUS INSTITUTE)

A student will be eligible to get Under Graduate degree with Honours only, if he/she completes the additional MOOCs courses such as Coursera
certifications, or any other online courses recommended by the Institute (Equivalent to 20 credits). During Complete B.Tech. Program Guidelines for
credit calculations are as follows.
1. For 6 to 12 Hours =0.5 Credit
2. For 13 to18 =1 Credit
3. For 19 to 24 =1.5 Credit
4. For 25 to 30 =2 Credit
5. For 31 to 35 =2.5 Credit
6. For 36 to 41 =3 Credit
7. For 42 to 47 =3.5 Credit
8. For 48 and above =4 Credit
For registration to MOOCs Courses, the students shall follow Coursera registration details as per the assigned login and password by the Institute
these courses may be cleared during the B. Tech degree program (as per the list provided). After successful completion of these MOOCs courses, the
students shall provide their successful completion status/certificates to the Controller of Examination (COE) of the Institute through their
coordinators/Mentors only.
The students shall be awarded Honours Degree as per following criterion.
i. If he / she secures 7.50 as above CGPA.
ii. Passed each subject of that degree program in the single attempt without any grace.
iii. Successful completion of MOOCs based 20 credits
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Engineering Mathematics-III L-T-P [3-1-0]

Subject Code: BAS0301A Applicable in Department: All Branches

Pre-requisites of the Subject: Knowledge of Mathematics I and II of B. Tech or equivalent

Course Objective-The objective of this course is to familiarize the engineers with concept of function of complex variables, Partial differential
equations & their applications, Numerical techniques for various mathematical tasks and numerical aptitude. It aims to show case the students with
standard concepts and tools from B. Tech to deal with advanced level of mathematics and applications that would be essential for their disciplines.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
Apply the concept of partial differential equation to solve partial differential eequations and problems concerned with partial K3
CO 1 differential equations.

Apply the concept of numerical techniques to evaluate the zeroes of the Equation, concept of interpolation and numerical K3
CO2 methods for various mathematical operations and tasks, such as integration, the solution of linear system of equations.

Apply the working methods of complex functions for finding analytic functions. K3
CO3
Apply the concepts of complex functions for finding Taylor’s series, Laurent’s series and evaluation of definite integrals. K3
CO4
 Solve the problems of Number System, Permutation & Combination, Probability, Set theory, Function, Data Interpretation, K3
CO5
Syllogism.

Syllabus

Unit Module Lecture Practical/ CO

No Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
1 Introduction of partial differential equations, Second order linear
Partial Module 1.1: partial differential equations with constant coefficients.
Differen Classification of second order partial differential equations,
Partial Method of separation of variables for solving partial differential Class room
tial equations, Solution of one dimension wave and heat equation. Teaching,
Differential
Equatio Smart 8 Assignment 1.1 CO1
Equation and
n and its Board, PPT,
its M- tutor.
Applicat
Applications
ions

Error analysis, Zeroes of transcendental and polynomial equations

using Bisection method, Regula-Falsi method and Newton-Raphson
2 Class room
Numeri Module 2.1: method, Interpolation: Lagrange’s and Newton’s divided difference Teaching, Assignment-2.1
cal Numerical formula. Smart 8 CO2
Techniq Techniques Board, PPT,
ues Solution of system of linear equations, Gauss Elimination method, M- tutor.
Gauss- Seidel method. Numerical integration, Trapezoidal rule,
Simpson’s one third and three-eight rules.
Module 3.1: Limit, Continuity and differentiability, Functions of complex
3 variable, Analytic functions, Cauchy- Riemann equations (Cartesian Class room
Comple Complex
x and Polar form), Harmonic function, Method to find Analytic Teaching,
Variable – Smart 8 Assignment-3.1 CO3
Variable functions, Mobius transformation and their properties.
Differentiatio Board, PPT,
Differen
M- tutor.
tiation n

4 Complex integrals, Contour integrals, Cauchy- Goursat theorem Class room

Comple (Statement), Cauchy integral formula (Statement), Taylor’s series, Teaching,
Module 4.1: Laurent’s series, Liouvilles’s theorem (Statement), Singularities,
x Smart 8 Assignment-4.1 CO4
Variable Classification of Singularities, zeros of analytic functions, Residues, Board, PPT,
Integrat Methods of finding residues, Cauchy Residue theorem, Evaluation M- tutor.
 2𝜋 ∞
ion Complex of real integrals of the type ∫0 𝑓(sin 𝜃, cos 𝜃)𝑑𝜃 and ∫−∞ 𝑓(𝑥)𝑑𝑥
Variable –
Integration

Module 5.1: Number System, Permutation & Combination, Probability, Set Class room
5 theory, Function, Non Verbal Reasoning, Data Interpretation, Teaching,
Aptitud Aptitude-III Syllogism. Smart 8 Assignment-5.1 CO5
e Board, PPT,
M- tutor.
Total 40

Textbooks

Sr No Book Details

1. B. V. Ramana, Higher Engineering Mathematics, Tata McGraw-Hill Publishing Company Ltd., 2008.

2. B. S. Grewal, Higher Engineering Mathematics, Khanna Publisher, 2005.

3. R K. Jain & S R K. Iyenger , Advance Engineering Mathematics, Narosa Publishing House 2002.

4. E. Kreyszig, Advance Engineering Mathematics, John Wiley & Sons, 2005.

Reference Books

Sr No Book Details

1. Peter V. O’Neil, Advance Engineering Mathematics, Thomson (Cengage) Learning, 2007.

 2. Ray Wylie C and Louis C Barret, Advanced Engineering Mathematics, Tata Mc-Graw-Hill; Sixth Edition.

Links

Unit 1 https://archive.nptel.ac.in/courses/111/101/111101153/

Unit 2 https://archive.nptel.ac.in/courses/111/107/111107105/

Unit 3 https://archive.nptel.ac.in/courses/111/107/111107056/

Unit 4 https://archive.nptel.ac.in/courses/111/103/111103070/

https://nptel.ac.in/courses/111107058
Unit 5
https://archive.nptel.ac.in/courses/127/106/127106227/

https://archive.nptel.ac.in/courses/111/102/111102111/
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Discrete Structures L-T-P [3-1-0]

Subject Code: BCSE0306 Applicable in Department: All Branches

Pre-requisite of Subject: Some basic knowledge of algebra and logic is usually sufficient to begin studying discrete mathematics for computer
science. Familiarity with sets, functions, and basic Boolean algebra is also helpful.

Course Objective: The objective of discrete structure is to enable students to formulate problems precisely, solve the problems, apply formal
proofs techniques and hence enhance one’s logical thinking and problem-solving skills.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
Apply the basic principles of sets, relations & functions and mathematical induction in computer science & engineering K3
CO 1
related problems.
Describe the algebraic structures and it’s properties to solve complex problems. K2
CO2
CO3 Describe lattices and it’s type to simplify digital circuits. K2
CO4 Infer the validity of statements and construct proofs using predicate logic formulas. K4
Implement and use non-linear data structure like graphs to solve real world problems. K3
CO5

Syllabus
 Lecture Practical/
Unit No Module
Name Topic covered Pedagogy Required Assignme
nt/
CO
Mapping
(L+P)
Lab Nos
Set Theory: Definition of sets, countable and uncountable sets, Set Lecture 8 Hours theory NA
Module 1.1:
operations, Partition of set, Cardinality, Venn Diagrams, proofs of Notes, PPT,
1 some general identities on sets, Applications of set Theory Online
Set Theory Videos & R2
Set Theory
CO1
& Relation: Definition, types of relation, composition of relations, Lecture
Relations Module 1.2: Equivalence relation, Partial ordering relation, Applications of Notes, PPT,
Relations Relations Online
Videos & R2
2 Module 2.1: Definition, Properties, types: Semi Groups, Monoid, Groups, Lecture 8 Hours theory NA
Algebraic Algebraic Abelian group, Properties of groups, Subgroup, cyclic group, Notes, PPT,
CO2
Structures Structures Permutation group, Cosets, Normal subgroup, Homomorphism and Online
isomorphism of Groups, Applications of Algebraic Structure Videos & R2
3 Module 3.1: Introduction, ordered set, Hasse diagrams of partially ordered set, Lecture 8 Hours theory NA
Posets, Posets, Hasse isomorphic ordered set, well ordered set, properties of lattices, Notes, PPT,
Hasse Diagram and types of lattices, Applications of Lattice Online
CO3
Diagram Lattices: Videos & R2
and
Lattices
Module 4.1: Propositions and compound Propositions, Basic logical operations, Lecture 8 Hours theory NA
Propositional truth tables, tautologies, Contradictions, CNF, DNF Algebra of Notes, PPT,
Logic Proposition, logical implications, logical equivalence, predicates Online
4 and quantifiers, Rules of Inference, Application of Propositional Videos & R1
Propositio Logics.
nal &
Predicate CO4
Module 4.2: First order predicate, Well-formed formula of Predicate, Lecture
Logic
Predicate Quantifiers, Inference Theory of Predicate Logic, Application of Notes, PPT,
Logic Predicate Logics. Online
Videos & R2
Definition and terminology, Representation of Graphs, Paths Lecture 8 Hours Theory NA
Module 5.1: connectivity, Walks, Paths, Cycles, Bipartite, Regular, Planar and Notes, PPT,
5 Graphs Online CO5
connected graphs, Components, Euler graphs, Euler's theorem,
Graphs Hamiltonian path and circuits, Graph coloring, chromatic number, Videos & R2
 isomorphism and homomorphism of graphs, Application of
Graphs

Total 40 Hours

Textbooks

Sr. No. Book Details

1. Swapan Kumar Sarkar, “A Textbook of Discrete Mathematics”, S. Chand Publication, 9 th Edition, 2021

2. T Veerarajan, “Discrete Mathematics, with Graph Theroy and Combinatorics” TMH Publication, 4 th Edition, 2021

Reference Books

Sr. No. Book Details

1. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, Prentice Hall, 6th Edition, 2020.

2. Liptschutz, Seymour, “Discrete Mathematics”, TMH, 4th Edition, 2021.

3. Kenneth H. Rosen, Kamala Krithivasan, “Discrete Mathematics and its Applications”, TMH, 8th Edition, 2021

Links

Unit 1 https://www.youtube.com/watch?v=hGtOLG3SsjI&list=PLwdnzlV3ogoVxVxCTlI45pDVM1aoYoMHf&index=9

https://www.youtube.com/watch?v=rGcTcGFx9_s&list=PLwdnzlV3ogoVxVxCTlI45pDVM1aoYoMHf&index=10
 https://www.youtube.com/watch?v=_BIKq9Xo_5A&list=PL0862D1A947252D20&index=13

Unit 2 https://www.youtube.com/watch?v=dQ4wU0k7JKI&list=PL0862D1A947252D20&index=35

https://www.youtube.com/watch?v=CjmWE-f3vEc&list=PLwdnzlV3ogoVxVxCTlI45pDVM1aoYoMHf&index=41

Unit 3 https://www.youtube.com/watch?v=qPtGlrb_sXg&list=PL0862D1A947252D20&index=40

Unit 4 https://www.youtube.com/watch?v=xlUFkMKSB3Y&list=PL0862D1A947252D20&index=1

https://www.youtube.com/watch?v=DmCltf8ypks&list=PL0862D1A947252D20&index=3

Unit 5 https://www.youtube.com/watch?v=E40r8DWgG40&list=PLEAYkSg4uSQ2fXcfrTGZdPuTmv98bnFY5
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Digital Logic and IoT Systems L-T-P [3-0-0]

Subj Subject Code: BCSE0304 Applicable in Department: CSE/IT

Pre-requisite of Subject: Fundamental knowledge of Basic Electronics & Characteristics of Semiconductors.

Course Objective: The objective of the course is to equip students with the necessary theoretical knowledge, practical skills, and critical thinking
abilities to understand, design, and implement digital logic circuits and IoT systems effectively.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO 1 Understand the fundamentals of digital logic design, including Boolean algebra, logic gates, and truth tables. K2

CO2 Analyze and Design combinational logic circuits using basic logic gates, multiplexers, and decoders K4
CO3 Analyze and Design sequential logic circuits using flip-flops, registers, and counters K4
CO4 Understand the fundamental concepts, principles, and architecture of the Internet of Things (IoT). K2

CO5 Analyze IoT devices and systems with microcontrollers, sensors, and connectivity modules. K4

Syllabus
 Lecture Practical/ CO
Unit No Module Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
Module1.1:
Computer Number System and its arithmetic, signed binary numbers,
Arithmetic compliments, Binary codes, Cyclic codes, , Hamming Code

1 PPTs/
Module1.2:
Introduction of Simplification of Boolean Expression: K-map method up to Lecture Concepts of
Simplification of
Digital System Notes digital ICs, CO1
Boolean five variables, SOP and POS Simplification Don’t Care 8T+4P
and Binary /Smart specifications
expression Conditions
Numbers Board

Module1.3: NAND and NOR Gate Application (washing machines,

Logic Gates dishwashers, or refrigerators)

Module 2.1:
Combinational Analysis Procedure, Design Procedure PPTs/
2 By using logic
Circuits Analysis Lecture
Introduction of gates
Code Converter, Binary Adder-Subtractor, Decimal Adder, Notes 8 T+4P CO2
Combinational combinational
Module 2.2: Binary Multiplier, Magnitude Comparator, Decoders, /Smart
logic Circuit circuit is verified.
Combinational Encoders, Multiplexers, Demultiplexers Application Board
Circuits Example (telecommunication, Automation))
Module 3.1: Latches & Flip Flops, Characteristic Equations of Flip Flops,
sequential Circuit Excitation Table of Flip Flops, Flip Flop Conversion
Flip flop
(Flip-Flop & PPTs/
3 verification using
Latches) Lecture
Introduction of universal gate,
Notes 8T+4P C03
Sequential synchronous
Module 3.2: /Smart
Circuit counter
sequential Circuit Registers, Shift Registers, Synchronous and Asynchronous Board
verification
(Register and Counters, Other Counters: Johnson &Ring Counter
Counter) Application (microcontrollers, microwave oven.)
Module 4.1: Microcontroller for IoT; application, working and types,
PPTs/ Architecture of
Fundamental of Characteristics of IoT, Components of the IoT, Conceptual &
4 Lecture Arduino UNO,
IoT Architectural Framework of IoT,
Introduction of Notes 8T + 6P Node MCU C04
IoT /Smart Board, Various
Board types of Sensors
Overview of IoT programming Boards such as Arduino UNO,
 Module 4.2: IOT NANO, Node MCU. Application (web servers, and
program Board surveillance.)

Module 5.1:
Introduction to Sensors & different types of Sensors,
Fundamental of
Transducer, Actuators, Radio Frequency Identification Interfacing
Sensor in IOT PPTs/
5 (RFID) Technology. Arduino with I/O
Lecture
Arduino Devices,
Notes 8T + 6P CO5
platform boards Connecting
Module 5.2: /Smart
anatomy Interfacing of Sensor using Arduino board with LED, Push NODE MCU with
Interfacing of Board
Button, LCD, Ultrasonic Sensor, Humidity Sensor and LDR Internet
Sensor in the
Sensor Application (solar panels, Smart Door)
Arduino
Total 40T + 24P

Textbooks
Sr. No. Book Details

1. Michael Miller, “The Internet of Things” Pearson, 1st Edition March 2015

2. A. Anand Kumar, “Fundamentals of Digital Circuits”, PHI Learning Pvt. Ltd, 4th edition, 2016.

3. Arshdeep Bahga and Vijay Madisetti, "Internet of Things: A Hands-On Approach", Orient Blackswan Private Limited, 1st New Delhi, 2015.

Reference Books

Sr. No. Book Details

1. D.P. Kothari, J.S. Dhillon, "Digital Circuits & Design", Pearson Education India, 1st Edition, 2015.

2. Michael Miller, "The Internet of Things", Pearson Education, 1st Edition, 2015.
3. M. Morris R. Mano and Michael D. Ciletti, "Digital Design", Pearson Education, Global Edition, 2018

Links

Unit 1 https://www.youtube.com/playlist?list=PLbRMhDVUMngfV8C6ElNAUaQQz06wEhFM5

Unit 2 https://www.youtube.com/playlist?list=PL803563859BF7ED8C

Unit 3 https://www.youtube.com/playlist?list=PLbRMhDVUMnge4gDT0vBWjCb3Lz0HnYKkX

Unit 4 https://www.youtube.com/channel/UC6ZY_csXZc7YZZm2W8HcQ6A/video

Unit 5 https://www.youtube.com/channel/UC6ZY_csXZc7YZZm2W8HcQ6A/video
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Data Structures and Algorithms-I L-T-P [3-0-0]

Subject Code: BCSE0301 Applicable in Department: CSE/IT/CS/AI/AIML/IOT/ DS/CYS

Pre-requisite of Subject: C, Python

Course Objective: The objective of the course is to learn the basic concepts of algorithm analysis, along with implementation of linear data
structures.
Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO 1 Understand the concept of algorithm analysis and its importance for problem solving. K2

CO2 Implementation of Arrays for searching, sorting and hashing to foster critical thinking. K3
CO3 Compare and contrast linked list with arrays and implementation of linked list with its applications. K4
Understand static and dynamic implementation of stacks, while mastering principle of recursion for effective problem-
CO4 K3
solving.
Implementation and analysis of divide & conquer algorithms and greedy approach for efficient problem-solving across
CO5 K3
diverse contexts.

Syllabus
Unit Module Topic covered Pedagogy Lecture Practical/ CO
No Name Required Assignment/ Mapping
 (L+P) Lab Nos

1 Module 1.1: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Lectures, Program to CO1
Introdu Foundation of Amortized Analysis, Growth of Functions, Methods of solving Problem compare the time
ction to Algorithms Solving,
Recurrences, Performance Measurements Collaborativ complexities of
Data Analysis and 8T+6P
Structur Design Time and Space Complexity of an algorithm, Asymptotic e Learning, various algorithms
e and notations (Big Oh, Big Theta and Big Omega), Abstract Data Types Assessments by plotting the
Algorith (ADT). graph
ms
Data types: Primitive and non-primitive, Introduction to Data
Module 1.2: structure, Types of Data Structures- Linear & Non-Linear Data
Fundamentals Structures.
of D.S.

2 Module 2.1: Arrays: Definition, Single and Multidimensional Arrays, Lectures, Implementation
Design Arrays Representation of Arrays: Row Major Order, and Column Major Code of Arrays, Row
and Order, Derivation of Index Formulae for 1-D,2-D,3-D and n-D Array Walkthroug Major Order, and CO2
Analysis Application of Arrays: Sparse Matrices and their Representations. hs, Hand-on Column Major
of Programmin Order,
Algorith Module 2.2: Searching algorithm with analysis: Linear search, Binary search. g, Problem Representation of
Searching and Sorting algorithm with analysis: Bubble sort, Insertion sort, Solving, 8T+12P sparse matrix,
ms:
Arrays , Sorting Selection sort, Shell Sort, Sorting in Linear Time- Counting Sort. Collaborativ Linear search,
searchi e Learning, Binary search.
ng and competitive
sorting, Module 2.3: Hashing: The symbol table, Hashing Functions, Collision- coding,
Hashing Hashing Resolution Techniques, hashing for direct files. Assessments
 3 Module 3.1: Comparison of Array, List and Linked list Lectures, Operations on a
Design Linked List Code Linked List:
and Types of linked list: Singly Linked List, Doubly Linked List, Circular Walkthroug Insertion,
Analysis Linked List hs, Hand-on 8T+12P Deletion,
of CO3
Polynomial Representation and Addition of Polynomials Programmin Traversal,
Algorith g, Problem Reversal,
ms:
Solving, Searching
Linked
lists Collaborativ
Data e Learning,
Structur competitive
e coding,
Projects,
Assessments
.

4 Module 4.1: Primitive Stack operations: Push & Pop, Array and Linked List Lectures, Operations on
Design Stacks Implementation of Stack, Application of stack: Infix, Prefix, Code stacks and
and Postfix Expressions and their mutual conversion, Evaluation of Walkthroug question.
Analysis postfix expression. hs, Hand-on Recursion
of Programmin 8T+12P Application CO4
Algorith g, Problem
Principles of recursion, Tail recursion, Removal of recursion,
ms Solving,
Problem solving using iteration and recursion with examples such Collaborativ
based: Module 4.2:
Stacks Recursion as binary search, Fibonacci series, and Tower of Hanoi, Trade-offs e Learning,
and between iteration and recursion. Projects,
queues Merge sort and Quick sort algorithms with analysis. Assessments
.
Array and linked List implementation of queues, Operations on
Queue: Create, Insert, Delete, Full and Empty, Circular queues,
Module 4.3: Dequeue and Priority Queue algorithms with analysis
Queue
 Module 5.1: Divide and Conquer concepts with Examples Such as Quick sort, Lectures, Divide and CO5
5 Divide and Merge sort, Convex Hull. Code conquer methods
Conquer and Greedy Methods with Examples Such as Activity Selection, Task Walkthroug 8T+6P and greedy
Design hs, Hand-on methods
and
Greedy Scheduling, Fractional Knapsack Problem.
Programmin
Analysis Methods g, Problem
of Solving,
Algorith Collaborativ
ms: e Learning,
Divide Projects,
and Assessments
Conque .
r and
Greedy
Method
s

Total No. of Lecture + Practical Labs (40L+48P) = 88

Textbooks

Sr. No. Book Details

1. Michael T. Goodrich, Roberto Tamassia, "Data Structures and Algorithms in Python: An Indian Adaptation", 1st Edition, 2021.

1.
2. Horowitz and Sahani, “Fundamentals of Data Structures”, Computer Science Press, 1st Edition, 1993.

1.
3. Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd, 2nd Edition, 2017

Reference Books
Sr. No. Book Details

1.1. Reema Thareja, “Data Structure Using C”, Oxford University Press, 2nd Edition, 2014.

2.
2. AK Sharma, “Data Structure Using C”, Pearson Education India, 2nd Edition,2011.

3.
3. P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication, 1st Edition, 2004.

Links

Unit 1 https://youtu.be/u5AXxR4GnRY

Unit 2 https://www.youtube.com/watch?v=LQx9E2--p5c&pp=ygUMYXJyYXlzIG5wdGVs

Unit 3 https://www.youtube.com/watch?v=K7VIKlUdo20&pp=ygUPbGluayBsaXN0IG5wdGVs

https://www.youtube.com/watch?v=g1USSZVWDsY&list=PLB3CD0BBB95C1BF09&index=2&pp=iAQB
Unit 4
https://www.youtube.com/watch?v=THMyk2_p530&pp=ygUccXVldWUgZGF0YSBzdHJ1Y3R1cmUgICBucHRlbA%3D%3D

https://www.youtube.com/watch?v=_VV9v41FIq0&pp=ygUZZGl2aWRlIGFuZCBjb25xdWVyICBucHRlbA%3D%3D
Unit 5
https://www.youtube.com/watch?v=ARvQcqJ_-NY&list=PLfFeAJ-vQopt_S5XlayyvDFL_mi2pGJE3
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Computer Organization and Architecture L-T-P [3-0-0]

Subject Code: BCSE0305 Applicable in Department: CSE/IT

Pre-requisites of the Subject: Computer Fundamentals

Course Objective- To understand the types of organizations, structures and functions of computer, design of arithmetic and logic unit and float
point arithmetic. To understand the concepts of memory system, communication with I/O devices and interfaces.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
K2
CO1 Understand the basic structure and operation of a digital computer system.
Analyze the design of arithmetic & logic unit and understand the fixed point and floating-point arithmetic operations. K4
CO2
Implement control unit techniques and the concept of Pipelining K3
CO3
Evaluate the hierarchical memory system, cache memories and virtual memory. K5
CO4

CO5 Understand different ways of communicating with I/O devices and standard I/O interfaces. K2
 Syllabus

Unit Module Lecture Practical/

No Name Topic covered Pedagogy Required Assignment/ CO Mapping
(L+P) Lab Nos
1 Module 1.1:Computer Organization and Architecture, Functional units of Lecture 8 Hours Assignment on
digital system and their interconnections, buses, busNotes, PPT, theory CPU
Introduc Introduction architecture, types of buses and bus arbitration and its types.Online organization,
tion Register, bus and memory transfer. Processor organization, Videos & R2 bus CO1
general registers organization, stack organization and addressing architecture,
modes. addressing
modes
Module 2.1: Arithmetic and logic unit: Lookahead carry-adder. Multiplication:Lecture 8 Hours Assignment on
ALU Unit Signed operand multiplication, Booth’s algorithm and arrayNotes, PPT, theory floating point
2
multiplier. Division and logic operations. Floating pointOnline number
ALU CO2
arithmetic operation, Arithmetic &logic unit design. IEEE Standard Videos & R2 representation,
Unit
for Floating Point Numbers. Booth
algorithm
Module 3.1: Control Unit: Instruction types, formats, instruction cycles and Lecture 8 Hours Assignment on
sub cycles (fetch and execute etc.), micro- operations, execution Notes, PPT, theory instruction
3 Control Unit Online cycle,
of a complete instruction. Program Control, Reduced Instruction Videos & R2 instruction
Control
Set Computer, Complex Instruction Set Computer, Pipelining. format, types CO3
unit
Hardwire and microprogrammed control, Concept of horizontal of control unit
and vertical microprogramming, Flynn's classification.

Module 4.1: Memory: Basic concept and hierarchy, semiconductor RAM Lecture 8 Hours Assignment on
Memory Unit memories, 2D & 2 1/2D memory organization. ROM memories. Notes, PPT, theory memory
4
Cache memories: concept and design issues & performance, Online mapping and
Memor
address mapping and replacement Auxiliary memories: magnetic Videos & R1 replacement CO4
y Unit
disk, magnetic tape and optical disks Virtual memory: concept policies
implementation, Memory Latency, Memory Bandwidth, Memory
Seek Time.
5 Module 5.1: Peripheral devices, I/O interface, I/O ports, Interrupts: interrupt Lecture 8 Hours Assignment on
Input/Output hardware, types of interrupts and exceptions. Modes of Data Notes, PPT, theory modes of data
Input/ Transfer: Programmed I/O, interrupt initiated I/O and Direct Online transfer CO5
Output Memory Access, I/O channels and processors. Serial Videos & R2
Communication: Synchronous & asynchronous communication.
 Total 40

Textbooks

Sr No Book Details

1 M. Mano, “Computer System Architecture”, 3rd Edition, Pearson Publication, 2007.

2 John P. Hayes, Computer Architecture and Organization, Tata McGraw Hill, Third Edition, 1998.

3 William Stallings, Computer Organization and Architecture-Designing for Performance, Pearson Education, Seventhedition,2006.

Reference Books

Sr No Book Details

1 Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, McGraw-Hill, Fifth Edition, Reprint2012

2 Ray A K, Bhurchandi K M, “Advanced Microprocessors and Peripherals”, TM.

Links

Unit 1 https://www.youtube.com/watch?v=L9X7XXfHYdU&list=PLxCzCOWd7aiHMonh3G6QNKq53C6oNXGrX

Unit 2 https://www.youtube.com/watch?v=WLgXUPOjKEc

Unit 3 https://www.youtube.com/watch?v=BPhWlFIU1rc
Unit 4 https://www.youtube.com/watch?v=6R7JDkpG1Wk&list=PLrjkTql3jnm8HbdMwBYIMAd3UdstWChFH

Unit 5 https://www.youtube.com/watch?v=nxryfWg5Hm4
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Object Oriented Techniques using Java L-T-P [0-0-6]

Subject Code: BCSE0352 Applicable in Department: CSE/IT/AI/AIML/DS/CYS/CS

Pre-requisites of the Subject: 1. Student must know at least the basics of computer skills, and should be able to start a command line shell.
2. Knowledge of basic programming concepts.

Course Objective- The objective of this course is to understand the object-oriented methodology, and its techniques to design stand alone and
GUI applications using hands-on engaging activities.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
K2
CO 1 Understand the concepts of object-oriented programming and relationships among them needed in modeling.
Demonstrate the Java programs using OOP principles and also implement the concepts of lambda expressions. K3
CO2
Analyze packages with different protection level resolving namespace collision and implement the error handling concepts for K4
CO3 uninterrupted execution of Java program.

Implement Concurrency control, I/O Streams and Annotations concepts by using Java program. K3
CO4
Design and develop the GUI based application, Generics and Collections in Java programming language to solve the real- K6
CO5 world problem.
 Syllabus
Unit Module Lecture Practical/ CO
No. Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
Introduction and Pillars of OOP with real life example, jvm Setting class path
Module 1.1: architecture and its components variables,
Compilation of
Object java file and
3 (1+2)
Oriented execute its byte
Programming code.

1 Module 1.2:Introduction, Class Diagram and Object Diagram, UML concepts: 3(1+2) Designing object
Association, Composition, aggregation, realization, and T1, R1, and class diagram
Generalization. Smart with UML
Basics of Modelling
Board/PPT/ concepts.
Java Concepts CO 1
Online
Progra
Module 1.3: Decision Making, Looping and Branching, Argument Passing Programs 4(1+3) Implementation
mming Mechanism: Command Line Argument, Console Input. of java programs
Control on control
Statements statements.

Module 1.4: Object Reference, Constructor, Abstraction: Abstract Class, 8 (2+6) Implementation
Interface and its uses, Defining Methods, Use of “this” and “super” of Java Basics,
Class and keyword, Garbage Collection and finalize () Method etc. Class, Object,
Object abstract class
interface, garbage
collection.
Module 2.1: Overview and Types of Inheritance in Java, Access Modifiers, T1, R1, 4 (1+3) Implementation of
2 Inheritance Constructors and super constructor in Inheritance. Smart inheritance
OOPs
features Board/PPT/ concept.
, arrays Online
Programs CO2
and Module 2.2: Introduction and Types of Polymorphism, Overloading and 4 (1+3) Implementation
lambda Polymorphis of polymorphism
expressi m Overriding
concept.
ons
 Module 2.3: Introduction and Working with Lambda Variables. 2(1+1) Programs based
Lambda on Lambda
expression expression.

Module 2.4: Introduction to Arrays and its Types. 4(1+3) Programs based
Arrays on array concept.

Module 3.1: Introduction to Packages and its Types, Access Protection in T1, R1, 3 (1+2) Implementation of
Packages, Import and Execution of Packages. Smart java package,
Packages Board/PPT/ Exception
Online handling,
3 Module 3.2: Exceptions vs. Errors, Handling of Exception. Finally, Throws and Programs Assertion,
Package Throw keyword, Multiple Catch Block, Nested Try and Finally Block, Localization and
s, Exception
Tokenizer. Assertions and Localizations Concepts and its working. String handling
Excepti Handling,
on 5 (2+3)
Assertions CO3
Handlin
g and and
String Localizations
Handlin
g Module 3.3: String Types, Operations, Immutable String, Method of String class,
String Buffer and String Builder class.
String 5 (2+3)
Handling

Module 4.1: Overview of Threads, Creating Threads, Thread Life-Cycle, Thread T2, R2, 4(2+2) Implementation of
Threads Priorities, Daemon Thread,Runnable Class, Synchronizing Threads Smart Multi-threading,
4 etc. Board/PPT/ Annotation,
Concurr Module 4.2: Common I/O Stream Operations, Interaction with I/O Streams Online 3(1+2)
ency in I/O Stream Classes. Character and
Programs Byte Stream CO4
Java
Module 4.3: Introduction, Custom Annotations and Applying Annotations. 3(1+2) classes java.io
and I/O
Annotations package.
Stream

5 Module 5.1: Swing, AWT, Components and Containers, Layout Managers and T2, R2, R3 4(2+2)
Implementation of
GUI User-Defined Layout and Event Handling. Smart CO5
GUI AWT & Swing
Programming Board/PPT/
Progra Module 5.2: Introduction to Generic Classes, Initializing a Generic Object, Online 5(1+4) components,
mming, Generics Generic Cell Driver Class, Generic Methods, Use enumerated type. Programs Layout Manager
Generic Module 5.3: Introduction to Collections, Using Method References, Using 6(2+4) classes, Generic &
s and Collections Wrapper Class, Using Lists, Sets,Maps and Queues, Collection using Collection, and
Collecti Generics, Iterators Wrapper classes
ons

70
Total
(23T+47P)

List of Practicals
CO
Sr. No. Program Title
Mapping
1 Understanding Text Editors to Write Programs, Compile and run first java file and Byte Code and class file CO1

2 Sketch a class and object diagram by describing the sales order system of a restaurant. CO1
3 Sketch a class diagram by describing the circle and rectangle class. CO1
Sketch a class diagram for a college platform including, classroom, playground, chair, table, smart board, teaching CO1
4 staff etc.

5 Sketch a class diagram containing class called Employee, which models an employee with an ID, name and salary. CO1
Add method raisesalary(percent) that increases the salary by the given percentage.
6 Program to display the default value of all Primitive data types CO1
Implement the code using main() method to calculate and print the Total and Average Marks scored by a student CO1
7 from the input given through the command line arguments and assume that four command line arguments name,
marks1, marks2, marks3 will be passed to the main() method in the below class with name TotalAndAvgMarks.

Write code which uses if-then-else statement to check if a given account balance is greater or lesser than the CO1
8 minimum balance. Write a class BalanceCheck with public method checkBalance that takes one parameter balance of
type double. Use if-then-else statement and print Balance is low if balance is less than 1000. Otherwise, print
Sufficient balance.
 A class NumberPalindrome with a public method isNumberPalindrome that takes one parameter number of type int. CO1
9 Write a code to check whether the given number is palindrome or not.
For example Cmd Args : 333
333 is a palindrome
10 Write a class FibonacciSeries with a main method. The method receives one command line argument. Write a CO1
program to display fibonacci series i.e. 0 1 1 2 3 5 8 13 21
11 Write a Java Program to find the Factorial of a given number. CO1
12 Java Program to create a class, methods and invoke them inside main method. CO1

 Write a Java program to illustrate the abstract class concept. Create an abstract class Shape, which contains an CO1
empty method numberofSides().
 Define three classes named Trapezoid, Triangle and Hexagon extends the class Shape, such that each one of the
13 classes contains only the method numberofSides(), that contains the number of sides in the given geometrical
figure.
 Write a class AbstractExample with the main() method, declare an object to the class Shape, create instances of
each class and call numberofSides() methods of each class.
14 Java program to illustrate the static field in the class. CO1
15 Java Program to illustrate static class. CO1
16 Write a java program to access the class members using super keyword CO1
17 Java program to access the class members using this keyword CO1
Implement an interface named MountainParts that has a constant named TERRAIN that will store the String value CO1
18 “off_road”. The interface will define two methods that accept a String argument name newValue and two that will
return the current value of an instance field. The methods are to be named: getSuspension, setSuspension, getType
, setType.
19 Java program to demonstrate nested interface inside a interface. CO1

Java program to demonstrate nested interface inside a class. CO1

20

21 Java program to explicit implementation of garbage collection by using finalize() method CO1
22 JAVA program to implement Single Inheritance CO2
23 JAVA program to implement multi-level Inheritance CO2
24 JAVA program to implement constructor and constructor overloading. CO2
25 JAVA program implement method overloading. CO2
JAVA program to implement method overriding. CO2
26

27 Java program to implement lambda expression without parameter. CO2

28 Java program to implement lambda expression with single parameter. CO2
29 Java program to implement lambda expression with multi parameter. CO2
30 Java program to implement lambda expression that iterate list of objects CO2
31 Java program to define lambda expressions as method parameters CO2
Write a class CountofTwoNumbers with a public method compareCountof that takes three parameters one is arr of CO2
type int[] and other two are arg1 and arg2 are of type int and returns true if count of arg1 is greater than arg2 in arr.
The return type of compareCountof should be boolean.
32 Assummptions:

 arr is never null

 arg1 and arg2 may be same

33 JAVA program to show the multiplication of two matrices using arrays. CO2

34 Java Program to search an element using Linear Search CO2

35 Java program to search an element using Binary Search CO2
36 Java Program to sort element using Insertion Sort CO2
37 Java Program to sort element using Selection Sort – Largest element Method CO2
38 java program to Sort elements using Bubble Sort CO2
39 Java program to create user defined package. CO3
40 Java Program to create a sub- classing of package CO3
 Implement the following: CO3

41  Import package.*;
 import package.classname;
 Using fully qualified name.
42 Implement and demonstrate package names collision in java CO3

43 Java program to handle and Arithmetic Exception Divided by zero CO3

44 Java Program to implement User Defined Exception in Java CO3
45 Java program to illustrate finally block CO3
46 Java program to illustrate Multiple catch blocks CO3
47 Java program for creation of illustrating throw in exception handling. CO3
48 Implement the concept of Assertion in Java Programming Language CO3
49 Implement the concept of Localization in Java Programming Language. CO3

50 Java program to print the output by appending all the capital letters in the input string. CO3

51 Java program that prints the duplicate characters from the string with its count. CO3

52 Java program to check if two strings are anagrams of each other CO3

53 Java Program to count the total number of characters in a string CO3

54 Java Program to count the total number of punctuation characters exists in a String CO3
55 Java Program to count the total number of vowels and consonants in a string CO3
56 Java Program to show .equals method and == in java CO3
Given a string, return a new string made of n copies of the first 2 chars of the original string where n is the length of CO3
57 the string. The string may be any length. If there are fewer than 2 chars, use whatever is there. If input is "Wipped"
then output should be "WiWiWiWiWi".
Given two strings, a and b, create a bigger string made of the first char of a, the first char of b, the second char of a, CO3
58 the second char of b, and so on. Any leftover chars go at the end of the result. If the inputs are "Hello" and "World",
then the output is "HWeolrllod".
59 JAVA program to show the usage of string builder. CO3
60 JAVA program to show the usage of string buffer. CO3
61 Creating and Running a Thread CO4
62 Implementing Runnable Interface CO4
63 Synchronizing Threads with lock CO4

64 Synchronizing Threads without lock CO4

65 JAVA program to implement even and odd threads by using Thread class . CO4
66 JAVA program to implement even and odd threads by using Runnable interface. CO4
67 JAVA program to synchronize the threads by using Synchronize statements and Synchronize block. CO4

68 Demonstrate the concept of type annotations in the JAVA programming language. CO4

69 Demonstrate the concept of user-defined annotations in the JAVA programming language. CO4

70 JAVA program to implement that read a character stream from input file and print it into output file. CO4
71 JAVA program to implement that merge the content of two files (file1.txt, file2.txt) into file3.txt. CO4
72 Write a Java program that reads the contents of one file and copies them to another file. CO4
73 Write a Java program that reads a text file and counts the number of words in it. CO4
74 Write a Java program that reads a text file and counts the frequency of each word in it. CO4
Write a Java program that reads a text file and adds line numbers to each line. The program should create a new file CO4
75
with the line numbers added to the beginning of each line.

76 Write a Java program that reads two binary files and compares them byte by byte to determine if they are identical. CO4
Display a message indicating whether the files are the same or different.
77 Program to create a frame with three button in AWT and swing CO5
78 Program to display message with radio buttons in swing CO5
79 Program to display "All The Best" in 5 different colors on screen. (Using AWT/Swing) CO5
80 Program to implement event handling in a button “OK” CO5
81 Java Program to implement BorderLayout CO5
82 Java Program to implement GridLayout CO5
83 Java Program to implement BoxLayout CO5

84 Java Program to implement CardLayout CO5

85 Java program to implement Generic class CO5

86 Java program to illustrate Generic methods CO5
87 Java program to implement wildcard in generics CO5
88 Java program to implement of methods of HashSet CO5
89 Java Program to implement methods available in HashMap class CO5
90 Program to add, retrieve, and remove element from ArrayList CO5
Create a method which can accept a collection of country names and add it to ArrayList with generic defined as String CO5
91 and return the List.

Create a method which can create a HashSet containing CO5

92
values 1-10. The Set should be declared with the generic type Integer. The method should return the Set.

93 Java program to implement autoboxing CO5

94 Java program to implement unboxing CO5
Develop a java class with a method storeEvenNumbers(int N) using ArrayList to store even numbers from 2 to N, CO5
95 where N is a integer which is passed as a parameter to the method storeEvenNumbers(). The method should return
the ArrayList (A1) created.
96 Create a method that accepts the names of five countries and loads them to an array list and returns the list. CO5

97 Create a method which can accept a collection of country names and add it to ArrayList with generic defined as String CO5
and return the List.
Textbooks
Sr. No. Book Details

1 Herbert Schildt,” Java: A Beginner’s Guide”, McGraw-Hill Education 2nd edition

2 E Balagurusamy, “Programming with Java A Primer”, TMH, 4th edition.

Reference Books

Sr. No. Book Details

1 Cay S. Horstmann, “Core Java Volume I – Fundamentals”, Prentice Hall

2 Joshua Bloch,” Effective Java”, Addison Wesley

3 Herbert Schildt,” Java - The Complete Reference”, McGraw Hill Education 12th edition

Links

Unit 1 https://www.youtube.com/watch?v=r59xYe3Vyks&list=PLS1QulWo1RIbfTjQvTdj8Y6yyq4R7g-Al

Unit 2 https://www.youtube.com/watch?v=ZHLdVRXIuC8&list=PLS1QulWo1RIbfTjQvTdj8Y6yyq4R7g-Al&index=18

Unit 3 https://www.youtube.com/watch?v=hBh_CC5y8-s

Unit 4 https://www.youtube.com/watch?v=qQVqfvs3p48

Unit 5 https://www.youtube.com/watch?v=2qWPpgALJyw
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Data Structures and Algorithms-I Lab L-T-P [0-0-4]

Subject Code: BCSE0351 Applicable in Department: CSE/IT/CS/AI/AIML/IOT/ DS/CYS

Pre-requisite of Subject: C, Python

Lab Experiments

Course Objective: Learn to implement linear data structures.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO1 Implementing Single and Multi-dimensional array with their applications like searching and Sorting techniques. K3
CO2 Implement Link list, Stack and Queues with their applications. K3
CO3 Implementation and analysis of various Divide and Conquer, Greedy Algorithms. K4

List of Practical
CO
Sr. No Program Title
Mapping
1 Construct a program to compare the time complexities of selection, bubble and insertion sort by plotting the graph CO1
2 Construct a program to compare the time complexities of various algorithms by varying size “n”. CO1
3 Construct a Code to find the maximum element in an array. CO1
4 Construct a Code to calculate the sum of all elements in an array. CO1
5 Construct a Code to reverse the elements of an array. CO1
6 Construct a Code to check if an array is sorted in ascending order. CO1
7 Construct a Code to count the occurrence of a specific element in an array. CO1
8 Construct a Code creation and traversal of 2D Array in row major and column major order. CO1
9 Construct a code to print the transpose of a given matrix using function CO1
10 Program to find if a given matrix is Sparse or Not and print Sparse Matrix CO1
11 Construct a code to represent a sparse matrix in triplet form. CO1
12 Construct a code to Implement Linear Search CO1
13 Construct a code to implement Binary Search CO1
14 Construct a program to Implement Selection Sort CO1
15 Construct a program to Implement Bubble Sort CO1
16 Construct a program to Implement Insertion Sort CO1
17 Construct a program to Implement Shell Sort CO1
18 Construct a program to Implement Counting Sort CO1
19 Create a single linked list and perform basic operations (insertion, deletion, traversal). CO2
20 Create a double linked list and perform basic operations (insertion, deletion, traversal). CO2
21 Create a circular linked list and perform basic operations (insertion, deletion, traversal). CO2
22 Create a circular double linked list and perform basic operations (insertion, deletion, traversal). CO2
23 Reverse a single linked list. CO2
24 Check if a linked list is palindrome. CO2
25 Reverse a double linked list. CO2
26 Find the middle element of a single linked list. CO2
27 Find the middle element of a double linked list. CO2
28 Merge two sorted single linked lists. CO2
29 Detect and remove a loop in a circular linked list. CO2

30 Construct a code to add two polynomials using linked list CO2

31 Construct a program to Implement stack using array CO2

32 Construct a program to Implement stack using a linked list CO2

33 Construct a code to Infix to postfix conversion using a stack CO2

34 Construct a code for Balanced parentheses checker using a stack CO2

35 Implement Reverse a string using a stack. CO2

36 Implement Binary Search using Recursion. CO2

37 Construct a python program to print Fibonacci Series using Recursion. CO2

38 Construct a code to implement Tower of Hanoi. CO2

39 Construct a program to Implement queue using array. CO2

40 Construct a code for Implementing a circular queue. CO2

41 Construct a program to Implement queue using stack CO2

42 Construct a program to Implement priority queue CO2

43 Construct a program to Implement double ended queue CO2

44 Construct a program to Implement Merge Sort with recursion CO3

45 Construct a program to Implement Quick Sort with recursion CO3

 46 Construct a program to Implement Merge Sort using iteration CO3

47 Construct a program to Implement Quick Sort using iteration CO3

48 Construct a program to Implement fractional knapsack CO3

49 Construct a program to Implement Activity selection problem CO3

50 Construct a program to Implement Job scheduling problem CO3

*Competitive coding list will be shared with the students.

 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Digital Logic and IoT Systems Lab L-T-P [0-0-2]

Subject Code: BCSE0354 Applicable in Department: CSE/IT

Pre-requisite of Subject: Fundamental knowledge of Basic Electronics & Characteristics of Semiconductors.

Lab Experiments

Course Objective: The lab practical component of the course aims to provide students with hands-on experience in designing, simulating,
prototyping, and testing digital logic circuits and IoT systems. Through lab sessions, students should develop practical skills in using hardware and
software tools for circuit design, simulation, and programming.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s Knowledge
Level(KL)
CO 1 Understanding Digital Binary System and design data selector circuits with logic Gates K3
CO2 Design the Sequential circuits with the help of combinational circuits and feedback element. K3

CO3 The operation and installation of different IoT development boards and their Interfacing with various sensors. K3

List of Practical
Sr. No. Program Title CO
 Mapping
Introduction to digital electronics lab- nomenclature of digital ICs, specifications, study of the data sheet,
1 CO1
Concept of Vcc and ground, verification of the truth tables of logic gates using TTL ICs.
2 Implementation of the given Boolean function using logic gates in both SOP and POS forms. CO1
3 Implementation of 4-bit parallel adder using 7483 IC. CO1
4 Implementation and verification of Decoder using logic gates. CO1
5 Implementation and verification of Encoder using logic gates CO1
6 Implementation of 4:1 multiplexer using logic gates. CO1
7 Implementation of 1:4 demultiplexer using logic gates. CO1
8 Design a half adder and full adder CO1
9 Design and Implementation of a magnitude comparator CO1
10 Design and implementation of the binary to decimal convertor CO1
11 Design and implementation of the binary to hexadecimal convertor CO1
12 Design and implementation of the binary to excess-3 code convertor CO1
13 Designing 4-bit binary-to-gray convertor CO1
14 Design and implement a of Binary to BCD Converter CO1
15 Design and implement a digital circuit of 3×8 decoder and 8×3 encoder CO2
16 Design and implement a digital a 4X16 encoder CO2
17 Design a ring counter CO2
Describing hardware in IoT: Hardware Architecture of Arduino UNO Board, Types of Arduino Board, Hardware
18 CO3
Architecture of Node MCU, Introduction Various types of Sensors

Fundamentals of Arduino Programming: Installation of Arduino IDE, Working with structures, Variables, Flow CO3
19
control, Digital i/o f. Analog i/o, Time, Math, Random, Serial
20 Interfacing Arduino with I/O Devices: Push button, LED, Ultrasonic Sensor Temperature, Sensor, LDR Sensor CO3
Connecting NODE MCU with Internet: Connecting Node MCU with Wifi Hotspots, Sending Data to Thing speak CO3
21
Server using Node MCU
Develop real-time projects with Arduino: Develop real-time projects with Arduino and Node MCU using the CO3
22
various Sensors
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Artificial Intelligence and Cyber Ethics L-T-P [2-0-0]

Subject Code: BNC0301 Applicable in Department: All Branches

Pre-requisite of Subject: Basic understanding of computer systems and ethics.

Course Objective: The course aims to foster critical thinking about ethical issues, promote responsible use of technology, and
ensure students can identify, analyze, and address ethical dilemmas in AI and cyber domains.
Course Outcomes (CO)

Bloom’s
Course outcome: After completion of this course students will be able to: Knowledge
Level(KL)
K2
CO 1 Learn key principles of AI ethics, summarizing ethical considerations and applications in AI development
and deployment.
CO2 Apply policies and framework for Fairness in AI and Machine Learning. K3

K3
CO3 Apply privacy and security concepts, risk management and regulatory compliance in the field of AI and
Cyber Security.
Understand the nature of cybercrimes, the principles of intellectual property rights (IPR), and the legal measures K2
CO4 necessary to address and prevent these issues.

K2
CO5 Describe the impact of AI in Society, employment and workforce
 Syllabus
Lecture
Unit Modul Required CO
No e Topics covered Pedagogy (L+P) Mapping
Name
Definition of AI. Ethical principles in AI. Sources of AI data.Legal
1 Module 1.1: implications of AI security breaches, Privacy and AI regulations. Key
An overviewto
An AI Ethics Principles of responsible AI, transparency andaccountability, Dual-
overvie use dilemma, Human-centric design. Introduction to Cyber Laws Lecture and CO1
wto AI Case studies 5
and Ethics, Historical development of cyber laws, Legal frameworks
Ethics
2 Introduction to Fairness and Bias in AI, Types of Fairness andBias.
Fairness Module 2.1: Impact of Bias and Fairness in AI, techniques for measuring Fairness
and Fairness and and Bias. Techniques for mitigating bias.Current policies and
Favoritis Favoritism in
Machine frameworks for fairness in AI. Bias in data collection, Fairness in data Lecture and
m in Case Studies 6 CO2
Learning processing. Generative AI, Types of Bias in Generative AI.
Machine
Learning

3 Importance of privacy and security in AI, AI specific security tools and

Module 3.1:
AI Ethics software, privacy-preserving machine learning (PPML) and privacy-
and AI Ethics and preserving data mining (PPDM)
Cyberse Cybersecurity Lecture and 8 CO3
curity Principles Ethical considerations in phases of AI development life cycle, Case Studies
Principl Risk management: Risk assessment and incident response
es & Regulatory compliance: GDPR, HIPAA
Case
Studies
 Module 3.2: Case studies: Implementation of AI ethics guidelines and best
Case Studies practices in engineering projects, Ethical decision- making
processes and tools for engineers working with AI technologies
4 Module 4.1: Types of cybercrimes and their impact, Legal measures for
Cyber Cybercrimes,
IPR and Legal cybercrime prevention and prosecution.
crimes Measures Lecture and 5 CO4
IPR: Copyrights, trademarks, patents, and trade secrets, Case Studies
,IPR
Ethical implications of intellectual property, Cyber securityand
and privacy issues
Legal
Measu
res
Positive and negative political impacts of AI, Role of AI in social
5 Module 5.1: media and communication platforms, AI-generatedcontent and
AI’s AI’s deepfakes, Applications of AI in addressing global challenges, Key
Contribu Contribution
to Social technical stakeholders in AI deployment: developers, researchers, Lecture and
tionto
Social Evolution policymakers, Technical Impacts on Employment and Workforce: Case Studies 6 CO5
Evolution Automation technologies: robotic process automation (RPA),
autonomous systems

Total 30
 Textbooks

Sr. No. Book Details

1. Introduction to Information Security and Cyber Laws, Simplified Chinese Edition by Surya Prakash Tripathi, RitendraGoel, 1 January ,2014

2. AI ETHICS: Paving the Path for Responsible Machine Learning, Shivanand Kumar, 2014

Reference Books

Sr. No. Book Details

1 AI ETHICS (The MIT Press Essential Knowledge series), by Mark Coeckelbergh, 2018

2 Computers, Internet and New Technology Laws by Karnika Seth – by Karnika

Links

Unit 1 https://www.youtube.com/watch?v=VqFqWIqOB1g
Unit 2 https://www.youtube.com/watch?v=hVJqHgqF59A
Unit 3 https://www.youtube.com/watch?v=O5RX_T4Tg24
Unit 4 https://www.youtube.com/watch?v=RJZ0pxcZsSQ
Unit 5 https://www.youtube.com/watch?v=I9FOswjTSGg
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Engineering Mathematics -IV L-T-P [3-1-0]

Subject Code: BAS0402 Applicable in Department: All Branches

Pre-requisites of the Subject: Knowledge of Mathematics I and II of B. Tech or equivalent.

Course Objective- The objective of this course is to familiarize the students with 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.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO 1 Understand the concept of correlation, moments, skewness and kurtosis and curve fitting. K2

CO 2 Apply the concept of hypothesis testing and statistical quality control to create control charts. K3

CO 3 Remember the concept of probability to evaluate probability distributions. K1

CO 4 Understand the concept of Mathematical Expectations and Probability Distribution. K2

CO 5 Solve the problems of Time & Work, Pipe & Cistern, Time, Speed & Distance, Boat & Stream, Analogy. K3

Syllabus
 Unit Module Lecture Practical/ CO
No Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
1 Introduction: Measures of central tendency: Mean, Median, Mode,
Statistic Module 1.1: Moment, Skewness, Kurtosis, Curve Fitting, Method of least Class room
al squares, Fitting of straight lines, Fitting of second degree parabola, Teaching,
Statistical Exponential curves, Correlation and Rank correlation, Linear Smart
Techniq 8 Assignment 1.1 CO1
Techniques-I regression, nonlinear regression and multiple linear regression Board, PPT,
ues-I
M- tutor.

Testing a Hypothesis, Null hypothesis, Alternative hypothesis,

2
Statistic Module 2.1:Level of significance, Confidence limits, Test of significance of
Class room
al difference of means, Z-test, t-test and Chi-square test, F-test, One Teaching, Assignment-2.1
Statistical
Techniq way ANOVA. Smart 8 CO2
Techniques-II Board, PPT,
ues-II
Statistical Quality Control (SQC), Control Charts, Control Charts for M- tutor.
variables (Mean and Range Charts), Control Charts for Variables (p,
np and C charts).
Random Variable: Definition of a Random Variable, Discrete
3
Module 3.1: Random Variable, Continuous Random Variable, Probability mass
Probabil function, Probability Density Function, Distribution functions. Class room
Probability Teaching,
ity and
and Random Multiple Random Variables: Joint density and distribution Smart 8 Assignment-3.1 CO3
Random
Variable Function, Properties of Joint Distribution function, Marginal density Board, PPT,
Variable
Functions, Conditional Distribution and Density, Statistical M- tutor.
Independence, Central Limit Theorem (Proof not expected).

4 Module 4.1: Operation on One Random Variable – Expectations: Introduction,

Expecta Expected Value of a Random Variable, Mean, Variance, Moment Class room
Expectations Generating Function, Binomial, Poisson, Normal, Exponential Teaching,
tions distribution.
and Smart 8 Assignment-4.1 CO4
and
Probability Board, PPT,
Probabil M- tutor.
Distribution
ity
Distribu
tion

5 Module 5.1: Time & Work, Pipe & Cistern, Time, Speed & Distance, Boat & Class room
Aptitud Stream, Sitting arrangement, Analogy. Teaching,
e-IV Aptitude-IV Smart 8 Assignment-5.1 CO5
Board, PPT,
M- tutor.

Total 40

Textbooks

Sr. No. Book Details

1. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability Theory, Universal Book Stall, 2003(Reprint).

2. S. Ross: A First Course in Probability, 6th Ed., Pearson Education India, 2002.

3. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd Ed., Wiley, 1968.

4. Haitao Guo, Ramesh A. Gopinath, C.S. Burrus, IVAN W AUTOR SELESNICK, JAN E AUTOR ODEGARD, Sidny Burrus.

Reference Books

Sr No Book Details

1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2000.
 2. T. Veerarajan : Engineering Mathematics (for semester III), Tata McGraw-Hill, New Delhi.

3. R.K. Jain and S.R.K. Iyenger: Advance Engineering Mathematics; Narosa Publishing House, New Delhi.

4. J.N. Kapur: Mathematical Statistics; S. Chand & Sons Company Limited, New Delhi.

5. D.N.Elhance,V. Elhance& B.M. Aggarwal: Fundamentals of Statistics; Kitab Mahal Distributers, New Delhi.

Links

https://archive.nptel.ac.in/courses/111/105/111105042/
Unit 1
https://archive.nptel.ac.in/courses/110/107/110107114/

Unit 2 https://archive.nptel.ac.in/courses/103/106/103106120/

Unit 3 https://archive.nptel.ac.in/courses/117/105/117105085/

Unit 4 https://archive.nptel.ac.in/courses/111/104/111104032/

https://www.youtube.com/watch?v=KZ_M5RWaP6A

https://www.youtube.com/watch?v=WP4jsNRgfa4
Unit 5
https://www.youtube.com/watch?v=jPaQDKbahU8

https://www.youtube.com/watch?v=FwiWJLicakg
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Technical Communication L-T-P [2-1-0]

Subject Code: BASL0401 Applicable in Department: All Branches

Pre-requisite of Subject: B2 (CEFR level) in the Core Skills test; B1/B2 in the Speaking and Writing tests

Course Objective: To develop communication and critical thinking skills necessary for succeeding in the diverse and ever-changing workplace of
the twenty first century and help the students communicate effectively, creatively, accurately, and appropriately.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO 1 Comprehend the principles and functions of technical communication. K2
Write for a specific audience and purpose to fulfil the provided brief. K5
CO2
CO3 Identify and produce different kinds of technical documents. K2, K3
CO4 Apply effective speaking skills to efficiently carry out official discourses. K3
Demonstrate understanding of communication through digital media. K5
CO5

Syllabus
 Unit Lecture Practical/ CO
No Module Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
5
 Definition, Process, Types, Levels, Flow and Barriers
to Technical Communication with emphasis on
1 cultural differences and gender sensitivity. Gender-
Introdu
Module 1.1: neutral language. Interactive
ction to Assignment 1 CO1
Introduction to & Flipped
Technic
al
Technical  Need for and Importance of Technical classroom
Communication Communication - Significance of audience in method
Commu
nication technical communication

 Tone- Formality and Informality

10
 Technical writing and technical vocabulary

2  Business letters/emails
Technic Module 2.1: Assignment 2 CO2
a) Types and format, Content Organization
al Interactive
b) Cultural Variety, Tone, and Intention
& Flipped
Writing Technical Writing 1 c) Bad news message, good news message classroom
1 d) Advertisements, Editorial press releases method

 Notices, agenda, and minutes of meeting

 Job application, CV, and Resume’

3 5
Technic Module 3.1:  Technical reports – types & formats
al Assignment 3 CO3
PPT,
Writing Technical Writing 2  Structure of a report (short & long)
Activities
2
 Ethical Writing – Copy Editing, Referencing and
Plagiarism
  Technical Proposal - structure and types
 Technical/ Scientific paper writing
8
4  Components of effective speaking
Public Module 4.1: Interactive
sessions, CO4
Speakin Public Speaking  Seminar and conference presentation Assignment 4
activities,
g mock
 Conducting/ participating in meetings interviews

 Appearing for a job interview

8
 Understanding remote work – using different online
platforms

 Virtual etiquette- email ids, usernames

5
Virtual/ Module 5.1:  Developing online written correspondence- blogs,
WhatsApp, LinkedIn. What not to write on social Interactive Assignment 5
Remote Virtual/Remote CO5
media. sessions,
Commu Communication
activities
nication
 Participating in online
Conferences/seminars/meetings

 Mobile Etiquette

Total 36
 Textbooks

Sr. No. Book Details

Technical Communication – Principles and Practices by Meenakshi Raman & Sangeeta Sharma, 4th Edition, Oxford University Press,
1.
2023, New Delhi.

Reference Books

Sr. No. Book Details

1 Technical Communication: A Practical Guide by William S. Pfeiffer and Kaye A. Adkins, Pearson, 2020, UK.

2 The Essentials of Technical Communication by Elizabeth Tebeaux and Sam Dragga, Oxford University Press, 2021, UK.

3 Technical Communication Today by Richard Johnson-Sheehan, Pearson, 2020, UK

4 Strategic Communication in Technical Professions" by Susan K. Miller-Cochran and Jason Tham, Routledge, 2020, UK.

5 Technical Writing for Engineers & Scientists by Michelle V. Z. Holmes, McGraw Hill, 2020, US.

6 Speaking: Second Language Acquisition, from Theory to Practice by William Littlewood, Cambridge University Press, 2022, UK.

7 The Writing Revolution: A Guide to Advancing Thinking Through Writing in All Subjects and Grades by Judith C. Hochman and Natalie
Wexler, Jossey-Bass, 2022, USA.
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Theory of Automata and Formal Languages L-T-P [3-0-0]

Subject Code: BCSE0404 Applicable in Department: CSE/IT/CS/AI/AIML/IOT/DS/CYS

Pre-requisite of Subject:
 Mathematical Foundations
 Fundamental of Computer System

Course Objective: The Theory of Automata and formal Languages is a comprehensive study of both foundational principles and practical
application in Computer Science. It aims to cover formal methods of computation, exploring theoretical frameworks like formal languages and the
classification of machines based on language recognition capabilities.
Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO1 Understand the concepts of Finite State Machines for modeling and their power to recognize the languages.
K2
K2
CO2 Understand and identify the equivalence between the Regular Expression and Finite Automata.
CO3 Define Grammar for Context Free Languages and use Pumping Lemma to disprove a Formal Language being Context- Free. K3
Implement Pushdown Automata (PDA) for Context Free Languages and Transform the PDA to Context Free Grammar and K3
CO4
vice-versa.
CO5 Implement and analyze Turing Machine for Recursive and Recursive Enumerable Languages. K4
 Syllabus

Unit Module Lecture Practical/ CO

No Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
Role of Automata and Formal languages, Alphabet, String,
Grammar, Language, Chomsky Hierarchy of languages.
1 Introduction to Finite State Machine, Deterministic Finite Practice
Lectures,
Introdu Module 1.1: Automaton (DFA) and Non-Deterministic Finite Automaton (NFA), Questions Based
PPTs, Notes
ction to Introduction Equivalence of NFA and DFA, NFA with ∊-Transition, Equivalence of on Finite
and Smart 12 CO1
Finite to Finite Automata,
Automa Automata NFA’s with and without ∊-Transition, Minimization of Finite Interactive Equivalence of
ta: Automata, Limitations and Applications of Finite Automata, Panel Finite Automata
Concepts of Moore and Mealy Machine’s, Equivalence of Moore
and Mealy Machine.
Regular Expressions, Regular Sets, Properties of Regular Expression,
2 Identity Rules, Finite Automata and Regular Expression, Arden’s Practice
Regular Module 2.1: Lectures,
theorem, Regular Grammars-Right Linear and Left Linear grammars, Questions Based
Languag Regular PPTs, Notes
on Regular
e and Language and Conversion of FA into Regular grammar and Regular grammar into and Smart 9 CO2
Expression and
Finite Finite FA, Regular and Non-Regular Languages- Closure properties and Interactive Applications of
Automa Automata Decision properties of Regular Languages, Pumping Lemma, Panel Pumping Lemma
ta
Application of Pumping Lemma.
3
Practice
Context Context Free Grammar (CFG)-Definition, Derivations, Derivation Lectures,
Module 3.1: Questions Based
Free PPTs, Notes
Context Free Trees and Ambiguity, Simplification of CFG, Normal Forms- Chomsky on the Context
Languag and Smart 8 CO3
Language and Normal Form (CNF), Greibach Normal Form (GNF), Pumping Lemma Free Grammar
e and Interactive
Grammar for CFL, Closure properties of CFL, Decision Properties of CFL. and Context Free
Gramm Panel
Language
ar
4 Introduction to Pushdown Automata, Representation, Lectures, Practice
Pushdo Module 4.1: Deterministic and Non-Deterministic Pushdown Automata, The PPTs, Notes Questions Based
wn Pushdown and Smart 8 on Designing of CO4
Language of PDA: Acceptance by Final State and Acceptance by Interactive
Automa Automata PDA ,CFG to PDA
ta Empty Stack, Design of Pushdown Automata, Equivalence of Panel and Vice Versa
 Context Free Grammars and Pushdown Automata, Applications of
Push Down Automata, Two Stack Pushdown Automata.
Basic Concept of Turing Machine, Model, Representation of Turing
Machines, Techniques for Turing Machine Construction, Variants of
Turing Machine, Universal Turing machine, Linear Bounded Lectures, Practice
5
Module 5.1: Automata, Church’s Thesis, Recursive and Recursively Enumerable PPTs, Notes Questions Based
Turing
Turing and Smart 8 on Construction CO5
Machin language, Closure Properties of Recursive and Recursively Interactive
Machine of Turing Machine
e Enumerable Languages, Introduction to Undecidability, Halting Panel and Decidability
Problem, Post’s Correspondence Problem (PCP), Modified Post
Correspondence Problem(MPCP), Applications of Turing Machine.

Total 45

Textbooks

Sr. No. Book Details

1. K.L.P. Mishra, and N. Chandrasekharan,”Theory of Computer Science-Automata, Languages and Computation”,PHI , 3rd Edition,
2006.
2. Adesh K. Pandey and Manisha Sharma,” Automata Theory and Formal Languages”, S K Kataria and Sons, 1st Edition, 2019.

Reference Books

Sr. No. Book Details

1. A. M. Padma Reddy, “Finite Automata and Formal Languages- A simple Approach”, Cengage Learning India Private Limited, 2019.

2. A.A. Puntambekar,” Formal Languages and Automata Theory”, Vikas Publishing House,2nd Edition, 2008

3. J Martin, “Introduction to languages and the theory of computation”, Tata McGraw Hill ,3rd Edition, 2002.
 Links

Unit 1 https://onlinecourses.nptel.ac.in/noc24_cs71/preview

Unit 2 https://www.youtube.com/watch?v=VOaAuHAwHT4&list=PL_obO5Qb5QTEihQ35PgzjZSh7PveVt-iF

Unit 3 https://www.youtube.com/watch?v=9kuynHcM3UA&list=PLmXKhU9FNesSdCsn6YQqu9DmXRMsYdZ2T

Unit 4 https://www.youtube.com/watch?v=eqCkkC9A0Q4&list=PLEbnTDJUr_IdM___FmDFBJBz0zCsOFxfK

Unit 5 https://www.youtube.com/watch?v=XslI8h7cGDs&list=PLxCzCOWd7aiFM9Lj5G9G_76adtyb4ef7i
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Data Structures and Algorithms-II L-T-P [3-0-0]

Subject Code: BCSE0401 Applicable in Department: CSE/IT/CS/AI/AIML/IOT/DS/CYS

Pre-requisite of Subject: C, Python

Course Objective: The objective of the course is to learn the basic concepts of algorithm analysis, along with the implementation of non-linear data
structures.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO 1 Apply tree structures effectively demonstrating proficiency in tree operations and algorithms. K3
Analyse the graph data structure and implement various operations for problem solving. K4
CO2
CO3 Implementation and analysis of dynamic programming for efficient problem-solving across diverse contexts. K4
CO4 Apply efficient backtracking and branch &bound techniques across diverse problem-solving scenarios. K3
Understand advanced data structures, their implementation and application for efficient data manipulation and retrieval. K2
CO5

Syllabus
Unit Module Topics Covered Pedagogy Lecture Practical/Assi CO
Required gnment/Lab Mapping
L=T+P
Module 1.1: Trees Trees: Terminology used Lectures, .
1 with Trees, Binary Tree, Code
Memory representation of Walkthrough
Design s, hands-on
and Tree, Traversal Algorithms:
programmin
Analysi In-order, Pre-order, and g, Problem
s of post-order. Constructing Solving,
Algorit Binary Tree from given Tree Collaborative
hms: Learning,
Traversal, Operation of 8T+10P CO1
Trees competitive
Insertion, Deletion,
Searching & Modification of coding
Projects, and
data in Binary Search tree,
Assessments.
Binary Heaps, Threaded
Binary trees, Traversing
Threaded Binary trees, AVL
Tree.

Module 1.2: Application of Trees Priority Queue, Heap Sort,

Huffman codes.
 Module 2.1: Terminology used with Lectures, Depth First
2 Graphs Graph, Data Structure for Code Search and
Graph Representations: Walkthrough Breadth First
Design Adjacency matrices, s, hands-on Search.
and 8T+10P CO2
Adjacency List. programmin Connected
Analysi Graph Traversal: Depth First g, Problem Component,
s of Search and Breadth First Solving, Spanning Trees,
Algorit Search. Connected Collaborative Minimum Cost
hms: Component, Spanning Trees, Learning, Spanning Trees:
Graphs competitive Prim’s and
coding, Kruskal’s
Module 2.2: Minimum Cost Spanning Projects, and algorithm.
Algorithms on Graphs Trees: Prim’ s and Kruskal’s Assessments. Directed- Acyclic
algorithm. Directed- Acyclic Graph, Transitive
Graph, Transitive Closure and Closure, and
Shortest Path algorithms: Shortest Path
Dijkstra Algorithm, Bellman algorithms:
Ford Algorithm, Floyd Dijkstra
Warshall’s Algorithm.

Module 3.1: Dynamic Programming Lectures,

3 concepts 0/1 Knapsack, Code
Dynamic Programming Longest Common Sub Walkthrough
Dynam Sequence, Matrix Chain s, hands-on
ic Multiplication, Resource programmin
Progra Allocation Problem. g, Problem 8T+8P CO3
mming Solving,
Collaborative
Learning,
competitive
coding,
Projects, and
Assessments.
 Backtracking, Branch, and Lectures,
4 Bound with Examples Such as Code
Travelling Salesman Problem, Walkthrough
Backtra Graph Colouring, n-Queen s, hands-on
cking, Problem, Hamiltonian Cycles, programmin
Branch Module 4.1: Backtracking and Sum of Subsets. g, Problem 8T+10P CO4
and Solving,
Bound Collaborative
Learning,
Projects,
Assessments.

Module 5.1: Red-Black Trees, B – Trees, B+ Lectures,

5 Trees, Binomial Heaps, Code
Advanced-Data Structures Fibonacci Heaps, Trees. Walkthrough
Advanc s, hands-on
ed- programmin
Data g, Problem 8T+10P CO5
Structu Solving,
res Collaborative
Learning,
Projects,
Assessments.

Total No. of Lecture + Practical Labs (40L+48P) = 88

Textbooks
Sr. No. Book Details
Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, “Data Structures and Algorithms in Python (An Indian Adaptation)”,
1
Wiley Publication, 1st Edition, 2021.

2 Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd, 2nd Edition, 2017
3 Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of India, 4th Edition, 2022

Reference Books
Sr. No. Book Details
1 Reema Thareja, “Data Structure Using C”, Oxford University Press, 2nd Edition, 2014.

2 AK Sharma, “Data Structure Using C”, Pearson Education India, 2nd Edition,2011.

3 P. S. Deshpandey, “C and Data structure”, Wiley Dreamtech Publication, 1st Edition, 2004.

Links
Unit 1 https://www.youtube.com/watch?v=tORLeHHtazM&pp=ygUMdHJlZXMgIG5wdGVs

Unit 2 https://www.youtube.com/watch?v=9zpSs845wf8&pp=ygUcZ3JhcGggIGRhdGEgc3RydWN0dXJlICBucHRlbA%3D%3D

Unit 3 https://www.youtube.com/watch?v=5dRGRueKU3M&pp=ygUUZHluYW1pYyBwcm9ncmFtbWluZyA%3D

https://www.youtube.com/watch?v=DKCbsiDBN6c&list=PL-Y5_GYVx275I87vW3LUzEJ-g7TDgn0Ts
Unit 4 https://www.youtube.com/watch?v=3RBNPc0_Q6g&pp=ygUuYmFja3RyYWNraW5nIGFuZCBicmFuY2ggYW5kIGJvdW5kIHByb2dyYW1taW5nIA%3D
%3D

Unit 5 https://www.youtube.com/watch?v=8h80p_rYv1Y&list=PLv9sD0fPjvSHqIOLTIvHJWjkdH0IdzmXT
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Operating Systems L-T-P [2-0-0]

Subject Code: BCSE0403 Applicable in Department: CSE/IT/CS/AI/AIML/DS/CYS/IOT

Pre-requisite of Subject: Basic knowledge of computer fundamentals, C programming, Data structure and Computer organization.

Course Objective: The objective of this course is to provide an understanding of the basic and modern concepts of operating system and deliver
the skills needed to develop and customize Linux shell programming

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
Understand various operating systems architecture with utilizing the command line interface (CLI) within a Linux
CO 1 K2
environment.
CO2 Understand and implement the various CPU scheduling algorithms. K4
CO3 Analyse deadlock, concurrency, and synchronization into the system architecture. K4
CO4 Identify and implement the memory management techniques and algorithms. K3
Analyse file management system and implement distributed and virtual machine configurations on modern operating
CO5 K4
systems.

Syllabus
Unit Module Lecture Practical/ CO
No Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
Module 1.1:

Fundamentals
of Operating Overview of Operating Systems, Operating system architecture,
Systems
Types of Operating System: Batch OS, Multiprogramming OS,
Multitasking OS, Multiprocessor OS, Real time OS, System call and
1
Funda kernel, Lectures,
mental PPTs, Notes Experiment/
s& and Smart 4+8 Program CO1
Shell Interactive 1.1 to 1.4
scripti Panel
ng Module 1.2: Introduction to Linux Operating System, Basic Command Line
Interface (CLI) Operations in Linux, Shell Scripting Basics:
Shell Scripting
in Linux Variables, Control Structures, Functions.

Process Performance Criteria, Process Transition Diagram,

Process Control Block (PCB), Types of Schedulers: Long Term, Mid
Term, Short Term Scheduler,
2 Module 2.1: CPU Scheduling- Pre-emptive and Non-Pre-emptive Algorithm Lectures,
Proces PPTs, Notes Experiment/
Process (FCFS, SJF, SRTF, Non-Pre-emptive Priority, Pre-emptive Priority,
s and Smart 8 + 12 Program CO2
Manag Manageme Round Robin, Multilevel Queue Scheduling and Multilevel Interactive 1.1 to 1.4
ement nt Feedback Queue Scheduling), Panel
Processes and Threads,
Linux Process Management: ps, top, kill, nice
 3
Concurrency: Race Condition, Critical Section, Inter Process
Conc
Communication, Classical problem: Producer consumer, Dinning
urre Module 3.1:
Philosopher, Reader writer, Sleeping barber,
ncy Lectures,
Concurrenc
and Process Synchronization: Lock variable, Peterson’s Solution, Strict PPTs, Notes Experiment/
y and
Dead alternation, Lamport Bakery Solution, Test and set lock, and and Smart 8 +8 Program CO3
Deadlock Interactive 1.1 to 1.4
lock semaphore- counting, binary and monitor,
Manageme Panel
Man
nt Deadlock: Deadlock characterization, Prevention, Deadlock
age
Avoidance: Bankers Algorithms, Deadlock detection, Recovery
ment from Deadlock

Memory Management function, Loading and linking Address

Binding, Memory management techniques, Contiguous
4 technique- Fixed Partitions, variable partitions, Memory Lectures,
Module 4.1:
Memo Allocation: Allocation Strategies (First Fit, Best Fit, and Worst PPTs, Notes Experiment/
ry Fit), Non-contiguous, Paging, Segmentation, Segmented paging, and Smart 8+10 Program CO4
Memory
Manag Virtual Memory Concepts, Demand Paging, Performance of Interactive 1.1 to 1.4
Management
ement Demand Paging, Page Replacement Algorithms: FIFO, LRU, Panel
Optimal and LFU, Belady’s Anomaly, Thrashing

5 Module 5.1:
File File Management: Access Mechanism, File Allocation Method,
File
Manag
ement Manageme Free Space Management: -Bit Vector, Linked List, Lectures,
& nt PPTs, Notes Experiment/
Moder DISK: Disk Architecture, HDD vs SDD, Disk Scheduling and Smart 4+10 Program CO5
n Interactive 1.1 to 1.4
Operat Panel
ing Module 5.2: Modern Operating System: -Overview of modern operating
Syste Modern
system, Shared Memory concepts, Distributed system, Parallel
m Operating
System
 system & its architecture, Virtual machines – hyperviser,
Introduction to GPUs

Case Study: Large File Storage in a Distributed Manner

Total 32(T) + 48(P)

Textbooks

Sr No Book Details

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne” Operating System Concepts Essentials” , Willey Publication,8 th Edition,2017.

Marks G. Sobell “A practical guide to Linux: Commands, Editors and Shell Programming”, CreateSpace Independent Publishing
2.
Platform, 4th Edition,2017.

3. Jason Cannon “LINUX for beginners”, 1stEdtion,2014

Reference Books

Sr. No. Book Details

1. William Stallings “Operating Systems: Internals and Design Principles”, Pearson Education , 9th Edition, 2019.

2. Charles Patrick Crowley, “Operating System: A Design-oriented Approach” , McGraw Hill Education ,2017,
 3. Ganesh Naik “Learning Linux Shell Scripting”, Packt Publishing ,2nd Edition 2018.

Links
Unit 1 CS162 Lecture 1: What is an Operating System? (youtube.com)

Operating System #01 Introduction to OS, its Roles & Types (youtube.com)

Operating System #14 What is an Interrupt? Types of Interrupts - YouTube

https://www.youtube.com/watch?v=akU1Ji8Vzdk&list=PLbMVogVj5nJRa3VKt_eyZdJ_DitCz1cvQ

https://www.youtube.com/watch?v=rRGCGZ6OHw8&list=PLbMVogVj5nJRa3VKt_eyZdJ_DitCz1cvQ&index=2
Unit 2 Operating System #03 Programs & Processes, System Calls, OS Structure (youtube.com)

Operating System #18 CPU Scheduling: FCFS, SJF, SRTF, Round Robin - YouTube

Operating System #19 Priority Scheduling Algorithms, Multilevel Queues - YouTube

Operating System #20 Multi Processor Scheduling (youtube.com)

Operating System #33 Threads: Thread Model, Thread vs Process, pthread library (youtube.com)

Operating System #34 Threads: User level & Kernel level thread, Threading issues (youtube.com)

https://www.youtube.com/watch?v=3eG27YUbzyM&list=PLbMVogVj5nJRa3VKt_eyZdJ_DitCz1cvQ&index=3
Unit 3 CS162: Lecture 6: Synchronization 1: Concurrency and Mutual Exclusion (youtube.com)

CS162: Lecture 6.5: Concurrency and Mutual Exclusion (Supplemental) (youtube.com)

Operating System #04 CPU Sharing, Race Conditions, Synchronization, CPU Scheduling (youtube.com)

Operating System #26 Bakery Algorithm - YouTube

Operating System #27 Hardware Locks: Spinlock & its Usage (youtube.com)

Operating System #31 Deadlocks: Deadlock Detection & Recovery (youtube.com)

 Operating System #32 Dealing with Deadlocks | Deadlock Avoidance & Prevention (youtube.com)

Unit 4 Operating System #05 Memory Management: Process, Fragmentation, Deallocation, (youtube.com)

Operating System #06 Virtual Memory & Demand Paging in Operating Systems (youtube.com)

Operating System #07 MMU Mapping | How Virtual Memory Works? - YouTube
Unit 5 https://www.youtube.com/watch?v=qbQCQ0U6H0o

https://www.youtube.com/watch?v=SnKgEuUfV4k

https://www.youtube.com/watch?v=cVFyK1f5lDw

https://www.youtube.com/watch?v=Z0Vkrn9faoM&list=PLbMVogVj5nJRa3VKt_eyZdJ_DitCz1cvQ&index=4

https://www.youtube.com/watch?v=_BtDcroOTSA
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Database Management Systems L-T-P [0-0-6]

Subject Code: BCSE0452 Applicable in Department: CSE/IT/CS/AI/AIML/ IOT/DS/CYS

Pre-requisite of Subject: - It is recommended to have fundamental computer knowledge that includes concepts of computer architecture,
storage and hardware. Knowledge of data structures and algorithms and programming will be an added benefit.

Course Objective: - The objective of the course is to introduce about database management systems, with an emphasis on how to organize,
maintain and retrieve - efficiently, and effectively - information in relational & non-relational databases.
Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO 1 Understand and Apply ER model for conceptual design of the database. K3

CO2 Execute SQL and apply the normalization to improve the database design. K3
CO3 Implement and justify the complex queries in database with different applications. K5
CO4 Understand and execute the concept of PL/SQL, transaction and concurrency control. K3

CO5 Evaluate and implement Relational and Non-Relational database on different tools for real-world applications. K5

Syllabus
 Module Lecture Practical/ CO
Unit No Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
1 Module 1.1: Basic Concept: - Introduction of SDLC, Data, Information,
Introduction Database, DBMS, History of Database,
about the Database system Vs File system, Data models & Types of Data
Introduction DBMS Models
of Database Relational Database term: - Relation, Tuple, Attribute and
Domain, Codd Rules
&

Conceptual Module1.2: Data Modelling using the Entity Relationship Model: ER model
Designing Design & concepts, Degree of relationship, Notation for ER diagram,
Implement mapping constraints reduction of an ER diagrams to tables.
the ER Extended Entity Relationship Diagram & reduction of EER Chalk &
Diagram Duster/

Lectures,
Experiment/
PPTs, Notes
Module 1.3: Introduction on SQL & Types of SQL commands: -DDL, DML, DCL, and Smart 8+8 Program CO1
1.1 to 1.8
Introduction TCL Interactive
on SQL, Panel
Implement
the DDL,
DML, DCL &
TCL

Module 1.4: Basic of Relation Algebra & Operations, Query Optimization

Introduction
on Relational
Algebra
 Module2.1: Keys & Types of Keys: - Super key, Candidate Key, Primary Key,
Alternative Key Composite Primary key, Foreign Key, unique and
2 Implementati Composite Unique key
on the Keys

Basic of SQL

Module 2.2:
& Implementati
Data Constraint: -Null, Not Null, Default and check Constraint
Normalizati on of Data
on Constraint

Chalk &
Duster/
Module 2.3: Use of Aggregate Function
Implementati Uses of String Functions in SQL Lectures,
Experiment/
on of Uses of mathematical functions in SQL PPTs, Notes
7+10 Program CO2
Aggregate Uses of Advanced Functions in SQL and Smart 2.1 to 2.11
function & Use of Clause: Where, Group by, Having and Order by Interactive
clause Panel

Module 2.4:
Understand Functional Dependencies, Normalization & Types of
& implement Normalization, Candidate Key, Minimal Cover of FD’s
the
normalizatio
n and
different
types of
functions in
SQL.
 Operator & Predicates: - Like, Between, Aliases, distinct, limit,

3 Module3.1: Implementation of Logical operator: - And, Or, Not

Operator &
Introduction Predicates
of Complex
Queries

Module3.2: Set Theory Operator: - Union, Intersect, Minus.

Set Theory
Operator
Chalk &
Duster/
Module3.3: Binary Operator: - Cartesian Product, Join:-Inner Join: - Natural
Lectures,
Join, Equi Join & Non Equi Join 7+10 Experiment/
Binary PPTs, Notes
Outer Join:- Left Outer Join, Right Outer Join and Full Outer Join, Program CO3
Operator and Smart 3.1 to 3.9
Division Operator Interactive
Panel

Module 3.4: Nested Query or Sub Query: -IN, NOT IN, Exists, Not Exists, All
Nested and Any
Query

Module 3.5: Database connectivity with Java/Python and other

Programming Languages
Understand&
Implementati
on the
database
connectivity
 4 Module 4.1: Managing Indexes, Synonyms and Sequences, Managing Views,
Implementati Managing Data in Different Time Zones, Array Function &
on index, Operators,
Introduction Views and
of PL/SQL Array
and
Transaction

&
Chalk &
Concurrenc Module 4.2: Introduction of PL/SQL Duster/
y control Implementati
concept Lectures,
on of PL/SQL Implementation of PL/SQL Function, Procedure, Trigger, Cursor PPTs, Notes Experiment/
6+8 Program CO4
and Smart 4.1 to 4.10
Interactive
Panel

Module 4.3: Transaction system: - Life cycle of transaction, ACID Properties

Schedule & Types of Schedule, Recoverability
Implementati
on of Concurrency Control Techniques: Concurrency Control, Locking
Transition Techniques for concurrency control, 2-phase Locking protocol
management
& Transaction & Data Control: -Grant, Revoke, commit & Rollback
concurrency
control
 5 Module 5.1: Introduction of NoSQL Data Models,

Understand Overview of NoSQL Databases With their Types, Uses &

NoSQL Features of NoSQL Document Databases, CAP theorem, BASE Vs
Introduction Concept and ACID
of implement
NoSQL With the CRUD
MongoDB operations Comparison of relational databases to NoSQL stores, uses and
deployment; - MongoDB, Cassandra, HBASE, Neo4j and Riak

Module 5.2: Introduction and Features of MongoDB, MongoDB Operators, Chalk &
Duster/
Implement MongoDB Collection & Document, CRUD operations, MongoDB
the Shell & their commands, Lectures,
Experiment/
MongoDB PPTs, Notes
8+12 Program CO5
Cursor, and Smart 5.1 to 5.10
relation and Interactive
Aggregation Panel
in MongoDB.

Module 5.3: Introduction of Cloud Database.

Understand MongoDB Cloud product : Stitch, Atlas & Cloud Manager.

the concept
of cloud
database.

Total 36L+48P
 List of Practicals

List of Practicals

Lab No. Program Logic Building CO Mapping

1 Understand and implement the different ER diagram notation with their relationship and Cardinalities.

2 Creating ER Diagram for company Database. Company database have entities like employee, departments, CO1
projects and dependents also implement the relationship and cardinalities between the entities with their
relevant attribute.

3 Design an ER diagram for a travel agency that includes entities such as travellers, bookings, destinations, and CO1
itineraries. also implement the relationship and cardinalities between the entities with their relevant attribute.

4 Converting Company & Travel Agency ER Model to Relational Model (Represent entities and relationships in CO1
tabular form, represent attributes as columns, identifying keys).

5 Each students create at least one ER & EER diagram from real world problem and convert in tabular from with CO1
all needed constraint.

6 Implement DDL and DML commands CO1

7 Implement DCL & TCL commands CO1

8 i. Create Database, Rename Database, Delete Database in relational database tool. CO1
ii. Create table employee with attributes
Emp_no<datatype><size>
E_name<datatype><size>
JOB <datatype><size>
Address <datatype><size>
Salary<datatype><Size>
 iii. Insert data into the table
iv. Implementation of select command
v. Implementation of update command
vi. Implementation of alter command
vii. Implementation of delete command
viii. Implementation of rename command.
ix. Implementation of rollback command
x. Implementation of commit Command
xi. Implementation of Truncate Command
xii. Implementation of Drop Command

9 Implementation of I/O Constraint: Primary Key, composite primary key, Foreign Key with on delete set null and CO2
on delete set null constraint

10 Implementation of constraint: Unique Key and Composite unique key and uses Unique key as foreign key. CO2

11 Implementation of Business Constraint: Null, Not Null, Default, Check. CO2

12 Implement and apply the different form of normalization approach on company /Travel Agency Database . CO3

13 CO2
Reduction & Implementation in SQL for ER Diagram of Company Database: -
i. Create table for EMPLOYEE, DEPARTMET, PROJECT, DEPENDENTS and WORK_ON with all
needed keys and other constraints.
ii. Populated all table with atleast Ten records in each table as per as applied constraints.
14 Practicing Queries using Like, Between, Aliases, distinct Operator & Predicate. CO2

15 Implementation of Aggregate Functions. CO2

16 Implementation of Scalar, Mathematical and Advanced functions. CO2

17 Implementation of Queries using Where, Group by, Having and Order by Clause. CO2

18 Implementation and uses of clause and operators on Company/ Travel Agency or other database. CO2
 i. Find the name of employee whose name start with A.
ii. Find the name of employee where ‘hi’ in any position.
iii. Find the name of employee whose ‘r’ have in second position.
iv. Find the details of employee whose salary is less than 70000.
v. Find the name of employee whose name start with V and end with l.
vi. Find the average salary of each department
vii. Find the max salary of each department
viii. Find the sum of salary of department that have more than three employees in ascending order.
ix. Find the empid of Employee who work in more than 3 project.
x. Find the empid who have more than one dependent.
xi. K. Implement the concept of rollback and commit on Employee Table

19 Create a table EMPLOYEE with following schema:-(Emp_no, E_name, E_address, E_ph_no, Dept_no,
Dept_name,Job_id, Designation, Salary)

Write SQL statements for the following query.

i. List the E_no, E name, Salary of all employees working for MANAGER.
ii. Display all the details of the employee whose salary is more than the Sal of any IT PROFF.
iii. List the employees in the ascending order of Designations of those joined after 1981.
iv. List the employees along with their Experience and Daily Salary.
v. List the employees who are either ‘CLERK’ or ‘ANALYST’ .
vi. List the employees who joined on 1-MAY-81, 3-DEC-81, 17-DEC-81,19-JAN-80 .
vii. List the employees who are working for the Deptno 10 or 20.
viii. List the E-names those are starting with ‘S’ .
ix. Display the name as well as the first five characters of name(s) starting with ‘H’
x. List all the emps except ‘PRESIDENT’ & ‘MGR” in asc order of Salaries.
xi. Display total salary spent for each job category.
xii. Display lowest paid employee details under each manager.
xiii. Display number of employees working in each department and their department name.
xiv. Display the details of employees sorting the salary in increasing order.
xv. Show the record of employee earning salary greater than 16000 in each department.
xvi. Add constraints to check, while entering the empno value (i.e) empno > 100.
 xvii. Define the field DEPTNO as unique.
xviii. Create a primary key constraint for the column (EMPNO).

20 Implementation of Queries using set theory operators UNION, INTERSECT, MINUS. CO3

21 Implementation of Queries using Inner Join:- Natural Join , Equi Join & Non Equi Join CO3

22 Implementation of Queries using Outer Join :- Left Outer Join, Right Outer Join and Full Outer Join CO3

23 Implementation of Queries nested Queries or Sub Queries: - IN, NOT IN, Exists, Not Exists, All and Any. CO3

24 Apply the set theory operators, join’s and nested queries on company database (Case Study-1)

Write the SQL Queries for the following statement

i. Retrieve the names of employees in department 5 who work more than 10 hours per week on the
'ProductX'project.
ii. List the names of employees who have a dependent with the same first name as themselves.
iii. Find the names of employees that are directly supervised by 'Franklin Wong'.
iv. For each project, list the project name and the total hours per week (by all employees) spent on that
project.
CO3
v. Retrieve the names of all employees who work on every project controlled by department 5.
vi. Retrieve the names of all employees who do not work on any project. (f’) Retrieve the names of all
employees who do not work on every project
vii. For each department, retrieve the department name, and the average salary of employees working in
that department.
viii. Retrieve the average salary of all female employees.
ix. Find the names and addresses of all employees who work on at least one project located in Houston
but whose department has no location in Houston.
x. List the last names of department managers who have no dependents.
xi. Retrieve the names of all employees who work in the department that has the employee with the
highest
xii. salary among all employees.
 xiii. Retrieve the names of all employees whose supervisor’s supervisor has '888665555' for Ssn.
xiv. For each department that has more than 5 employees retrieve the dno and no. of its employees who
are making more than 6,00,000
xv. Find the sum of salaries of all employees of ‘ACCOUNTS’ department as well as the MAX(SAL),
MIN(SAL),AVG(SAL) in this department
xvi. Show the resulting salary for employee working on IOT project is given a 10% raise

25 Requirement: A college consists of number of employees working in different departments. In this context,
create two tables’ employee and department. Employee consists of columns empno, empname, basic, hra, da,
deductions, gross, net, date-of-birth. The calculation of hra, da are as per the rules of the college. Initially only
empno, empname, basic have valid values. Other values are to be computed and updated later. Department
containsdeptno, deptname, and description columns. Deptno is the primary key in department table and
referential integrity constraint exists between employee and department tables. Perform the following
operations on the database:

i. Create tables department and employee with required constraints.

ii. Initially only the few columns (essential) are to be added. Add the remaining columns separately by
using appropriate SQL command 3. Basic column should not be null.
iii. The default value for date-of-birth is 1 Jan, 1990.
iv. When the employees called daily-wagers are to be added the constraint that salary should be greater CO3
than or equal to 5000 should be dropped.
v. Display the information of the employees and departments with description of the fields.
vi. Display the average salary of all the departments.
vii. Display the average salary department wise. 9. Display the maximum salary of each department and
also all departments put together.
viii. Commit the changes whenever required and rollback if necessary.
ix. Find the employees whose salary is between 5000 and 10000 but not exactly 7500.
x. Find the employees whose name contains ‘en’.
xi. 12.Create alias for columns and use them in queries.
xii. 13. List the employees according to ascending order of salary.
xiii. 14. List the employees according to ascending order of salary in each department.
xiv. Find the employees who are born on Feb 29.
xv. Find the departments where the salary of at-least one employee is more than 20000.
 xvi. Find the departments where the salary of all the employees is less than 20000.
xvii. Add the column dept_location in department table.

Understand & implement the Database Connectivity with Java/Python etc. programming language CO3

26 Implementation and apply all the set theory operators, join and nested queries concept on Case study –1.

i. Make a list of all project members for projects that involve an employee whose name is SCOTT either
as a worker or as a manager of the department that controls the project.
ii. To retrieve the Social Security numbers of all employees who either work in department 5 or directly
supervise an employee who works in department 5.
iii. To retrieve the SSN of all employee who work as a supervisor not a manager.
iv. D To retrieve the SSN of all employee who work as a supervisor and also manage the department. CO3
v. We want to retrieve a list of names of each female employee’s dependents
vi. We want a list of all employee names as well as the name of the departments they manage if they
happen to manage a department; if they do not manage one, we can indicate it with a NULL value.
vii. Retrieve the names of employees who have no dependents.
viii. List the names of all employees with two or more dependents.
ix. List the names of managers who have at least one dependent.
x. Retrieve the names of all employees who do not have supervisors.
xi. Retrieve the name of each employee who has a dependent with the same first name and is the same
sex as the employee.

27 Create Desktop/Web application using the database connectivity. CO3

28 Implementation of Array Function CO4

29 Implementation of Array Operators CO4

30 Implementation of Indexing, Views and sequence CO4

31 i. Write a PL/SQL Program t3o Add Two Numbers

 ii. Write PL/SQL Program for Fibonacci Series CO4
iii. Write PL/SQL Program to Find Greatest of Three Numbers

32 Write a Pl/SQL code block to calculate the area of a circle for a value of radius varying from 3 to 7. Store the
radius and the corresponding values of calculated area in an empty table named Areas, consisting of two CO4
columns Radius and Area.

33 Write a PL/SQL code block that will accept an account number from the user, check if the users balance is less
CO4
than the minimum balance, only then deduct Rs.100/- from the balance.

34 Create a row level trigger for the customers table that would fire for INSERT or UPDATE or DELETE operations
performed on the CUSTOMERS table. This trigger will display the salary difference between the old values and CO4
new values:

35 Implementation of commit and rollback statement with amount transfer example. CO4

36 Implementation array, indexing, transaction concept on Case study 1.

i. Implementation of Array Functions & Operators

ii. Implementation of Sequence

-Creating Sequences

-Modifying a Sequence Definition

CO4
-Removing Sequences

iii. Implementation of Views

-Creating Simple and Complex Views

-Modifying Views

-Removing Views
 iv. Implementation of Indexes

-Manual and Automatic Indexes

-Creating Indexes

- Removing Indexes

37 i. Write a PL/SQL block to calculate the incentive of an employee whose ID is 110.

ii. Grant and revoke DCL command used on Employee table

-GRANT SELECT ON Employee TO emp_name;

-Granting multiple privileges on Employee table

-Granting all privileges on Employee table;

-Granting privilege to a role in Employee table

-Granting the WITH GRANT OPTION on Employee table.

-Revoke all the permission applied on Employee table. CO5

iii. Create the CUSTOMERS table having the following attributes:

- (ID, NAME, AGE, ADDRESS, SALARY)

- Insert ten records in customer table.

-In Customer table delete those records which have age = 25 and then COMMIT the changes in the database.

-In Customer table delete those records which have age = 30 and then Rollback the changes in the database.

- Create three savepoint for customer table in that the three deletions have taken place.

- Apply the savepoint 2 with rollback on customer table and display the table record.
 - Apply the SET Transaction command.

38 Study of Open Source NOSQL Database and installation of MongoDB CO5

39 Create, drop, rename the database in MongoDB CO5

40 Implementation the MongoDB Operators. CO5

41 Implementation the CRUD Operation in MongoDB CO5

42 Implementation of the MongoDB Shell commands CO5

43 Implementation of MongoDB Cursor and their methods CO5

44 Implementation of relation in MongoDB CO5

45 Implementation of Aggregate in MongoDB CO5

46 Deployment the data on different tools like HBASE, Riak and Cassandra CO5

47 Implementation of all CRUD operation, Cursor and aggregate etc. on real world problem. CO5

Connect to MongoDB (by using mongo shell)

i. Create database with name (ems) - use ems;

ii. Create collection with following fields:

{"name", age", gender","exp, subjects, "type"" qualification"},

iii. Insert the Ten documents into "faculty" collection (Use insertMany())

Write the following queries:

i. Get the details of all the faculty.

ii. Get the count of all faculty members.
iii. Get all the faculty members whose qualification is “Ph.D”.
 iv. Get all the faculty members whose experience is between 8 to 12 years.
v. Get all the faculty members who teach “MATHS” or “NETWORKING”.
vi. Get all the faculty members who teach “MATHS” and whose age is more than 30 years and
qualification must be “Ph.D”.
vii. Get all the faculty members who are working part-time or who teach “JAVA”.
viii. Add the following new faculty members:
{"name":"Ankita ", "age":34,"gender":"F","exp":25, subjects: ["MATHS","DE"],"type":"Full Time",
"qualification":"Ph.D"}

ix. Update the data of all faculty members by incrementing their age and exp by one year.
x. Update the faculty “Sivani” with the following data: update qualification to “Ph.D” and type to “Full
Time”.
xi. Update all faculty members who are teaching “DBMS” such that they should now also teach “Java
Programming”.
xii. Delete all faculty members whose age is more than 55 years.
xiii. Get only the name and qualification of all faculty members.
xiv. Get the name, qualification and exp of all faculty members and display the same in ascending order of
exp.
xv. Sort the faculty details by their age (descending order) and get the details of the first five faculty
members only.
48 Implementation of case Study on different domain CO1, CO2, CO3,
CO4, CO5
i. E-commerce Platform
ii. Inventory Management
iii. Railway System
iv. Hospital Data Management
v. Voice-based Transport Enquiry System
vi. SMS-based Remote Server Monitor system
vii. Banking System
viii. AI based
 Textbooks

Sr. No. Book Details

1. Abraham Silberschatz, Henry F. Korth, and S. Sudarshan,” Database Concepts”, McGraw Hill ,7th Edition, 2020.

2. Elmasri, Navathe, “Fundamentals of Database Systems”, Addision Wesley ,7th Edition, 2016.

3 Ivan Bayross, “SQL, PL/SQL – The Programming Language of Oracle”, BPB Publication 5th Edition ,2023.

4. Dan Sullivan, “NoSQL for Mere Mortals”, Addison-Wesley Professional ,1st edition. 2015.

Reference Books

Sr. No. Book Details

Thomas Cannolly and Carolyn Begg, “Database Systems: A Practical Approach to Design, Implementation and Management”,
1
Pearson Education,3rd Edition, 2007.

2 Raghu Ramakrishan and Johannes Gehrke “Database Management Systems”, McGraw-Hill, 3rdEdition, 2014.

3 NoSQL and SQL Data Modeling: Bringing Together Data, Semantics, and Software, Ted Hills, 1st Edition,2016.

4 Brad Dayley “NoSQL with MongoDB in 24 Hours”, Sams Publisher, 1st Edition, 2014.

Links
Unit-1 DBMS L1 Inauguration & Introduction (youtube.com)

DBMS L2 Introduction to Relational Model (youtube.com)

DBMS L3 Introduction to SQL (youtube.com)

DBMS L8C Entity Relationship Model (youtube.com)

DBMS L8D Entity Relationship Model (Problem Solving and Discussion) (youtube.com)

Unit-2 DBMS L4A Joins, Set Operations and Aggregate Functions (youtube.com)

DBMS L9A Relational Database Design - YouTube

DBMS L9B Relational Database Design (youtube.com)

DBMS L9C Relational Database Design (youtube.com)

DBMS L9D Discussion on Normalization (youtube.com)

DBMS L14A Query Optimization (youtube.com)

Relational Data Model and Notion of Keys - YouTube

Introduction to Relational Algebra (youtube.com)

Operators in Relational Model - YouTube

Unit-3 DBMS L4B Joins, Set Operations and Aggregate Functions (youtube.com)

DBMS L5A Nested Subqueris (youtube.com)

DBMS L6A Intermediate SQL (youtube.com)

DBMS L7 Advanced SQL (youtube.com)

DBMS L12A Indexing and Hashing (youtube.com)

Unit-4 DBMS L15 Transactions - YouTube

 DBMS L16A Concurrency Control - YouTube

DBMS L16B Concurrency Control (youtube.com)

DBMS L16C Concurrency Control (youtube.com)

DBMS L17A Recovery System - YouTube

Unit-5 DBMS L10A Application Design and Development - YouTube

DBMS L10B Application Design and Development (youtube.com)

DBMS L19 Distributed Data Stores and NoSQL Databases (youtube.com)

DBMS L18B Map Reduce and Hadoop - YouTube

NoSQL Databases #1 (Data Models, CAP Theorem, BASE Property) - YouTube

https://youtu.be/ekuQjQUnj20?si=_aL4T12EkHBZsvEK
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Data Structures and Algorithms -II Lab L-T-P [0-0-4]

Subject Code: BCSE0451 Applicable in Department: CSE/IT/CS/AI/AIML/IOT/DS/CYS

Pre-requisite of Subject: C, Python

Lab Experiments

Course Objective: Learn to implement non-linear data structures.

Course Outcomes (CO)

Course Outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO1 Implementation of tree data structures for basic operations like insertion, deletion, searching and traversal K3
CO2 Implementation of algorithms based on graph data structures for solving real world problems. K3
CO3 Implementing Dynamic Programming, Backtracking, Branch and Bound algorithms to solve complex data efficiently and K3
effectively.

List of Practicals
Sr. No. Program Title CO
 Mapping
1 Write a program to implement an in-order traversal of a binary tree and print the nodes. CO1
2 Write a program to implement a pre-order traversal of a binary tree and print the nodes. CO1
3 Write a program to implement a post-order traversal of a binary tree and print the nodes. CO1
4 Write a program to count number of nodes in a binary tree CO1
5 Write a program to find the height of the tree CO1
6 Write a program to check if the Binary tree is balanced or not. CO1
7 Write a Program to search a number in Binary Search Tree (BST) CO1
8 Write a program to insert a node in a Binary Search Tree (BST). CO1
9 Write a program to delete a node from a Binary Search Tree (BST). CO1
10 Write a program to implement a max-heap and perform heap sort on an array of integers. CO1
11 Write a Program to implement human coding algorithm CO1
12 Write a program to implement priority queue using max heap. CO1
13 Write a program to create a graph using an adjacency matrix. CO2
14 Write a program to create a graph using an adjacency list. CO2
15 Write a program to perform Depth-First Search (DFS) on a graph. CO2
16 Write a program to perform Breadth-First Search (BFS) on a graph. CO2
17 Write a program to check if there is a path between two nodes in a graph using DFS. CO2
18 Write a program to find all the vertices reachable from a given vertex in a graph using BFS. CO2
19 Write a program to detect a cycle in an undirected graph using DFS. CO2
20 Write a program to detect a cycle in a directed graph using DFS. CO2
21 Write a program to find the degree of each vertex in an undirected graph. CO2
22 Write a program to count the number of connected components in an undirected graph. CO2
23 Write a program to implement Dijkstra Algorithm. CO2
24 Write a program to implement Prims Algorithm. CO2
25 Write a program to implement Kruskal Algorithm. CO2
26 Write a program to implement Floyd Warshall’s all pair shortest path algorithm. CO3
27 Write a program to implement Bellman ford Algorithm. CO3
28 Write a program to implement Longest common subsequence (LCS). CO3
29 Write a program to implement sum of subset problem using backtracking. CO3
30 Write a program to implement insertion and search operations in a Tree. CO3
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Operating Systems Lab L-T-P [0-0-4]

Subject Code: BCSE0453 Applicable in Department: CSE/IT/CS/AI/AIML/DS/CYS/IOT

Pre-requisite of Subject: Basic knowledge of computer fundamentals, C programming, Data structure and Computer organization.

Lab Experiments

Course Objective: 1. This course gives an ability to Hands-on and practical experience with usage of the Linux OS and basics of Shell
Programming.

2. The OS Lab aims to provide an experience to implement and analyze algorithms related to process management, CPU scheduling, memory
management, file systems, and concurrency control and simulate modern operating systems.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
CO1 Execute the Linux file system using basic shell commands. K3
CO2 Implement CPU Scheduling Algorithms, Process Synchronization and deadlock handling techniques. K3
Simulate memory allocation concepts, as well as distributed and virtual machine configurations, on modern
CO3 K3
operating systems.
 List of Practical’s
CO
Sr. No. Program Title
Mapping
Variables and Control Structures: CO1
1 Write a shell script to determine the Area and Perimeter of a Rectangle. CO1
2 Write a shell script to count the words, characters, and lines in the file. CO1
3 Write a shell script that calculates the sum and average of an array of numbers CO1
4 Write a shell script to calculate the Fibonacci sequence. CO1
5 Write a shell script that finds prime numbers inside a user-specified range. CO1
6 Write a shell script to determine whether a given string is palindrome. CO1
File Manipulation:
7 Write shell script that allows users to create, delete, and list files in a directory. CO1
8 Write a shell script that Count Lines in Each File in a Directory. CO1
9 Write a shell script that find and Replace Text in Files. CO1
10 Write a shell script that find Files Modified in the Last N Days. CO1
Directory Navigation:
11 Write a shell script to list contents of a directory. CO1
12 Write a shell script to change directory (cd) based on user input. CO1
13 Write a shell script to navigate to the directory that contains a specific file. CO1
Process Management:
14 Write a shell Script to display running processes and their details. CO1
15 Write a shell Script to kill processes based on name or ID. CO1
16 Write a shell Script to automatically Restart a Process if it Crashes CO1
User/Group Management:
17 Write a shell Script to create, modify, and delete user accounts. CO1
18 Write a shell Script to add or remove users from groups. CO1
Toolkit of Shell Scripts Demonstrating Shell Scripting of Functions:
19 Write a shell script to file Backup Script with Custom Retention Policy CO1
20 Write a shell script for database Backup and Restore Script. CO1
21 Write a shell script for Network Configuration Script with Error Handling
Intercepting System Calls Using Dynamic Tracing Tools: CO1
22 Write a shell Script to intercept system calls using strace and log process ID, system call name, arguments, and return CO1
values.
23 Write a shell Script to intercept library calls using ltrace and capture similar information. CO1
24 Write a shell script to monitor process forks using “ps” CO1
Collecting and Analyzing Network Statistics:
25 Write a shell script to collect packet counts using tools like tcpdump or tshark. CO1
26 Write a shell script to measure bandwidth usage using iftop or nload. CO1
27 Write a shell script to analyze latency using ping or traceroute. CO1
28 Write a shell script to check connection status using netstat or ss. CO1
29 Write a shell script to visualize network data using gnuplot or matplotlib for graphs and charts. CO1
Miscellaneous Commands:
30 Print Current Date and Time: Write a shell script to Display the current date and time using date command. CO1
31 Generate Random Password: Write a shell script to Use openssl rand to generate a random password. CO1
View System Information: CO1
32 Write a shell script to show system information like kernel version, CPU info, etc., using uname, lscpu, etc. CO1
33 Display System Uptime: Write a shell script to show system uptime using uptime command. CO1
34 View Disk Usage: Write a shell script to Display disk space usage of files and directories using du and df commands. CO1
35 Check System Load: Write a shell script to monitor system load averages using w or top commands. CO1
36 Display Calendar: Write a shell script to show the calendar for a specific month using cal. CO1
37 Search Text in Files: Write a shell script to Use grep to search for specific text within files. CO1
38 Count Lines in a File: Write a shell script to Use wc -l to count the number of lines in a file. CO1
39 Check System Users: Write a shell script to Display currently logged-in users using who or w commands. CO1
40 Implement FCFS CPU Scheduling algorithm. CO2
41 Implement the given CPU Scheduling algorithm a) SJF b) Priority Based CO2
42 Implement Multi-level Queue CPU Scheduling algorithm. CO2
43 Implement PRIORITY CPU Scheduling Algorithm (For both Pre-emptive and non-pre-emptive). CO2
44 Implement Round-Robin CPU Scheduling Algorithm CO2
45 Implement Multilevel Queue CPU Scheduling Algorithm. CO2
46 Execute the RACE Condition of Process Synchronization. CO2
47 Implement the Producer–consumer problem using semaphores. CO2
48 Design a code and implement the Dinning Philosopher problem CO2
49 Execute an algorithm for deadlock detection. CO2
50 Implement Banker’s algorithm of Deadlock Avoidance CO2
51 Implement Contiguous memory fixed size partition scheme. CO3
52 Implement Contiguous memory variable size partition scheme. CO3
53 Simulate the First-Fit contiguous memory allocation technique. CO3
54 Simulate the Best-Fit contiguous memory allocation technique. CO3
55 Simulate the Worst-Fit contiguous memory allocation technique. CO3
56 Implement the Non-contiguous CO3
57 Memory Allocation by using Paging. CO3
58 Write a Program to simulate the FIFO page replacement algorithm. CO3
59 Write a Program to simulate the LRU page replacement Algorithm. CO3
60 Write a Program to simulate the Optimal page replacement Algorithm. CO3
61 Write a program to simulate FCFS Disk Scheduling Algorithm CO3
62 Program to simulate the SSTF Disk Scheduling Algorithm CO3
63 Connects to VMware vCenter and lists all virtual machines along with their power state. CO3
64 Creates a new virtual machine with specified configurations in Azure. CO3
65 Demonstrate how to set up and deploy a simple distributed function using Azure Functions. The function should be CO3
able to handle HTTP requests and run in a distributed manner across Azure's infrastructure.
66 Write a shell script for the mount command, which is used to attach file systems to the file system hierarchy at a CO1
mount point.
67 Write a shell script for the umount command, which is used to detach a mounted file system. CO1
68 Write a shell script for Automate backups using cron with the tar command. CO1
Variables and Control Structures: CO1
69 Write a shell script to determine the Area and Perimeter of a Rectangle. CO1
70 Write a shell script to count the words, characters, and lines in the file. CO1
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Technical Communication Lab L-T-P [0-0-2]

Subject Code: BASL0451 Applicable in Department: All Branches

Pre-requisite of Subject: B2 (CEFR level) in the Core Skills test; B1/B2 in the Speaking and Writing tests

Lab Experiments

Course Objective: To develop communication and critical thinking skills necessary for succeeding in the diverse and ever-changing workplace of
the twenty first century and help the students communicate effectively, creatively, accurately, and appropriately.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge Level
(KL)
CO 1 Comprehend the principles and functions of technical communication. K2
CO2 Write for a specific audience and purpose to fulfil the provided brief. K5

CO3 Identify and produce different kinds of technical documents. K2, K3

CO4 Apply effective speaking skills to efficiently carry out official discourses. K3

CO5 Demonstrate understanding of communication through digital media. K5

 List of Practical
CO
Sr. No. Program Title
Mapping
1 Case Study Analysis: The students will be able to develop their critical thinking and analytical skills. CO1
Email Role Reversal: Writing and responding to emails in peer groups- The students will practice writing and
2 CO2
responding to professional emails.
Infographics – Data Analysis and Interpretation Task: The students will develop their ability to decipher important
3 CO3
information from charts, graphs, tables, and diagrams.
Document Redesign Challenge: Redesigning existing technical documents to improve readability - The students
4 CO3
will develop their ability to write and edit professional documents.
Abstract Formulation and Referencing: The students will be able to write research papers with proper source
5 CO3
citations.
Case Study presentations: The students will improve their analytical skills and by presenting improve their
6 CO4
speaking skills.
7 Presentation on Project Report: The students will develop professional speaking skills. CO4
8 Ted talk simulation – summarising a Ted Talk: The students improve their ability to condense speeches. CO4
9 Mock Interviews: The students will practice and enhance their interview skills. CO4
Webinar Presentations/Online Interviews: The students will improve their ability to make presentations in
10 CO5
professional scenarios and perform well in online interviews.
 NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY
GREATER NOIDA-201306
(An Autonomous Institute)
School of Computer Science & Information Technology

Subject Name: Environmental Science L-T-P [2-0-0]

Subject Code: BNC0402 Applicable in Department: All Branches

Pre-requisite of Subject: Basic knowledge of nature.

Course Objective: People working in industries or elsewhere essentially require the knowledge of environmental science to enable them to
work and produce the most efficient, economical and eco-friendly finished products.

To help the students in realizing the inter-relationship between man and environment and help the students in acquiring basic knowledge about
environment and develop the capability of using skills to fulfil the required aims, to realize and solve environmental problems through social,
political, cultural and educational processes.

Course Outcomes (CO)

Course outcome: After completion of this course students will be able to: Bloom’s
Knowledge
Level(KL)
Understand the basic principles of ecology and environment. Ecosystem: Basic concepts, components of ecosystem,
CO 1 K1
food chains and food webs. Ecological pyramids
Understand the different types of natural recourses like food, forest, Minerals and energy and their conservation
CO2 K2
Understand the importance of biodiversity, Threats of biodiversity and different methods of biodiversity
CO3 conservation.
K2
CO4 Understand the different types of pollution, pollutants, their sources, effects and their control methods. K2
 Understand the basic concepts of sustainable development, Environmental Impact Assessment (EIA) and different
CO5 acts related to environment K2

Syllabus

Module Lecture Practical/ CO

Unit No Name Topic covered Pedagogy Required Assignment/ Mapping
(L+P) Lab Nos
1 Module 1.1: Definition, Scope and basic principles of ecology and Smart 4 NA CO1
Basic Principle Basic Principle environment. Ecosystem: Basic concepts, components of board,
of Ecology of Ecology ecosystem. Food chains and food webs. Ecological pyramids,
Energy flow in ecological systems, Characteristics of different PPTS,
ecosystems. Biogeochemical Cycles: Importance, gaseous and
Reference
sedimentary cycles. Carbon, Nitrogen, Phosphorus and book and
Sulphur Cycles. Basic concepts of sustainable development, Text book
SDGs, Ecosystem services, UN Decade for Eco restoration

2 Module 2.1: Natural resources and associated problems. Forest resources: Smart 4 NA CO2
Natural Natural Use and over-exploitation, deforestation. Timber extraction, board,
Resources and Resources mining, dams and their effects on forest and tribal people.
Associated and
Mineral resources: Use and exploitation, environmental effects PPTS,
Problems Associated
Problems of extracting and using mineral resources. Food resources:
Reference
World food problems, changes caused by agriculture and over- book and
grazing, effects of modern agriculture, fertilizer-pesticide Text book
problems, water logging, salinity.

Land resources: Land as a resource, land degradation, man

induced landslides. Equitable use of resources for sustainable
lifestyles.

Non-Renewable Energy Resources: Fossil fuels and their

reserves, Nuclear energy, types, uses and effects, Renewable
Energy Resources: hydropower, Solar energy, geothermal, tidal
and wind energy, Biomass energy, biogas and its advantages.
 3 Module 3.1: Biodiversity and their importance, Threats to biodiversity, Smart 4 NA CO3
Biodiversity Biodiversity major causes, extinction’s, vulnerability of species to board,
Succession and Succession
and Non- extinction, IUCN threat categories, Red data book. Strategies
Non- PPTS,
Renewable Renewable for biodiversity conservation, principles of biodiversity
Energy Energy conservation in-situ and ex-situ conservation strategies Mega Reference
Resources Resources diversity zones and Hot spots, concepts, distribution and book and
importance. Succession: Concepts of succession, Types of Text book
Succession. Trends in succession. Climax and stability.

4 Module 4.1: Air pollution: sources of air pollution, Primary and secondary Smart 4 NA CO4
Pollution and Pollution and air pollutants. Origin and effects of SOX, NOX, Cox,CFC, board,
Solid Waste Solid Waste
Management Management Hydrocarbon, control of air pollution. Water pollution: PPTS,
sources and types of water pollution, Effects of water
pollution, Eutrophication, Soil pollution: Causes of soil Reference
pollution, Effects of soil pollution, Major sources of and book and
effects of noise pollution on health, Radioactive and thermal Text book
pollution sources and their effects on surrounding
environment. Solid waste disposal and its effects on
surrounding environment, Climate change, global warming,
acid rain, ozone layer depletion.

5 Module 5.1: Role of community, women and NGOs in environmental Smart 4 NA CO5
Role of Role of protection, Bio indicators and their role, Natural hazards, board,
Community Community
Chemical accidents and disasters risk management,
and and PPTS,
Environmental Environmental Environmental Impact Assessment (EIA), Salient features of
Protection Acts Protection following Acts: a. Environmental Protection Act, 1986, Wildlife Reference
Acts (Protection) Act, 1972.b. Water (Prevention and control of book and
pollution) Act, 1974.c. Air (Prevention and control of Text book
pollution) Act, 1981. Forest (Conservation) Act, 1980.d.
Wetlands (Conservation and Management) Rules, 2017; e.
 Chemical safety and Disaster Management law. f. District
Environmental Action Plan. Climate action plans.

Total 20 Hours

Textbooks

Sr. No. Book Details

1 Brady, N.C. 1990. The nature and properties of Soils, Tenth Edition. Mac Millan Publishing Co., New York.

2 Botkin, D.B and Kodler E.A., 2000, Environmental Studies: The earth as a living planet. John Wiley and Sons Inc.
.
3 Rao M.N. and H.V.N. Rao, 1989: Air Pollution, Tata McGraw Hill Publishing Co. Ltd., New Delhi

4 Singh J.S., Singh S.P. and Gupta S.R., 2006, Ecology Environment and Resource Conservation, Anamaya Publishers, New Delhi.

5 Environmental Studies -Benny Joseph-Tata McgrawHill-2005

6 Environmental Studies- Dr. D.L. Manjunath, Pearson Education-2006.

7 Environmental studies- R, Rajagopalan -Oxford Pubtiotion2005.

Reference Books
Sr. No. Book Details

1 Sodhi G.S. 2005, Fundamentals of Environmental Chemistry: Narosa Publishing House, New Delhi.2.Dash, M.C. (1994)

2
Fundamentals of Ecology, Tata Mc Graw Hill, New Delhi.

3
Sharma P. D. (1996). Environmental Biology, Rastogi Publications, Meerut.

4
Verma P.S. and V.K. Agarwal. (1985). Principles of Ecology. S. Chand and Company (Pub.), New Delhi.

5
Principles of Environmental Sciences and Engineering -P. Venugoplan Rao, Prenitice Hall of India.

6 Environmental Science and Engineering Meenakshi, Prentice Hall India.

Links

https://www.youtube.com/watch?v=T21OO0sBBfc,
Unit 1 https://www.youtube.com/watch? v=qt8AMjKKPDo
https://www.youtube.com/watch?v=yAKm91Nxrs
https://www.youtube.com/watch?v=ha_O-1uOWkk
https://www.youtube.com/watch?v=brF0RWJyx9w
Unit 2 https://www.youtube.com/watch?v=mOwyPENHhbc,
https://www.youtube.com/watch?v=yqev1G2iy20,
https://www.youtube.com/watch?v=_74S3z3IO_I,
https://www.youtube.com/watch?v=jXVw6M6m2g0
Unit 3 https://www.youtube.com/watch?v=GK_vRtHJZu4,
https://www.youtube.com/watch?v=b6Ua_zWDH6U,
https://www.youtube.com/watch?v=7tgNamjTRkk,
https://www.youtube.com/watch?v=ErATB1aMiSU,
https://www.khanacademy.org/science/high-school-biology/hs-ecology/hs-human-impact-on-ecosystems/v/
https://www.youtube.com/watch?v=7qkaz8ChelI,
Unit 4 https://www.youtube.com/watch?v=NuQE5fKmfME,
https://www.youtube.com/watch?v=9CpAjOVLHII,
https://www.youtube.com/watch?v=yEci6iDkXYw,
https://www.youtube.com/watch?v=yEci6iDkXYw
https://www.youtube.com/watch?v=ad9KhgGw5iA,
Unit 5 https://www.youtube.com/watch?v=nW5g83NSH9M,
https://www.youtube.com/watch?v=xqSZL4Ka8xo,
https://www.youtube.com/watch?v=WAI-hPRoBqs,
https://www.youtube.com/watch?v=o-WpeyGlV9Y,
https://www.youtube.com/watch?v=EDmtawhADnY