BACHELOR OF TECHNOLOGY

FOR ADMISSION BATCH 2023-24

COMPUTER SCIENCE AND ENGINEERING / COMPUTER SCIENCE AND INFORMATION TECHNOLOGY / INFORMATION
TECHNOLOGY / COMPUTER SCIENCE AND TECHNOLOGY
SECOND YEAR (THIRD SEMESTER)
Contact
Sl. Course University Internal
Category Course Hrs. Credit
No. Code Marks Evaluation
L-T-P
Subject (Theory)
1 BS CSBS2001 Discrete Mathematics 3-0-0 3 100 50
2 PC EOPC2004 Digital Electronics 3-0-0 3 100 50
3 PC CSPC2002 Data Structures 3-0-0 3 100 50
4 PC CSPC2003 Object Oriented Programming 3-0-0 3 100 50
5 PC(ACC) PCAC2002 Data Science Foundation 3-0-0 2 100 50

6 HS HSHS2001 Engineering Economics 3-0-0 2 100 50

Subject (Sessional / Practical)

7 PC EOPC2204 Digital Electronics Lab. 0-0-3 1.5 - 100
8 PC CSPC2202 Data Structures Lab. 0-0-3 1.5 - 100
9 PC CSPC2203 Object Oriented Programming Lab. 0-0-3 1.5 - 100
10 PC(ACC) PCAC2202 Data Science Foundation Lab. 0-0-3 1.5 - 100
Total 18-0-12 22 600 700

Note: Click on respective course code to view/download the syllabus of the subject.
 CSBS2001 DISCRETE MATHEMATICS (3-0-0)

Course Objectives:

● To learn the mathematical foundations required for computer science.

● This course will help to provide mathematical concepts and build up strong mathematical
fundamentals to support many subjects of computer science engineering such as design and
analysis of algorithms, computability theory, software engineering, computer systems,
syntactical analysis, information organization and retrieval, switching theory, computer
representation of discrete structures and programming languages etc.

MODULE 1 (10 Hrs)

Logic and Proofs: Propositional logic, Propositional Equivalences, Predicates and Quantifiers, Nested
Quantifiers, Rules of Inference, Introduction to Proofs. Sets: Venn Diagrams, Subsets, The size of a
set, Power Sets, Cartesian Products, Set Operations, Functions: One-to-One and Onto Functions,
Inverse Functions and Compositions of Functions Partial Functions

MODULE 2 (10 Hrs)

Counting: The Basics of Counting, The Pigeonhole Principle, Permutations and Combinations, Binomial
Coefficients, Recurrence Relations.
Relations: Relations and their Properties, n-ary Relations and their Applications, Representing
Relations, Closure of Relations, Equivalence Relations, Partial Orderings.

MODULE 3 (10 Hrs)

Concept of binary operations, Algebraic structures, Semigroup, monoid, Group, Abelian group with
examples. Properties of groups, Cyclic groups and its generator, Sub group, cosets, Normal subgroup,
Lagrange’s Theorem, Homomorphism and Isomorphism, ring, field, Integral domain (Definition with
examples)

MODULE 4(10 Hrs)

Graphs: Graph Terminology and Special Types of Graphs, Bipartite Graphs, Representing Graphs:
Isomorphism of Graphs, Euler and Hamilton Paths, Shortest Path Problems: Dijkstra’s Algorithm,
Traveling Salesperson Problem, Planar Graphs, Graph Coloring. Trees: Tree Traversal, Minimum
Spanning Trees

Learning Outcomes:
Upon completion of this course, students will be able to:
• CO1 Understand the basic concepts of set theory, relations and functions, propositional logic and
apply the knowledge for modelling and solving various problems in computer sciences.
• CO2 Apply various methods of proofs and proof strategies.
• CO3 Model counting techniques using recurrence relations & generating functions for applications.
• CO4 Understand the concept of algebraic structuressuch as groups, semi group, subgroups and
Lagrange theorem. Gets the idea of homomorphism and isomorphism of groups, definition and
examples of ring, integral domain and field.
• CO5 Develop the concepts and applications of graphs in various computer science problems

Text Books:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Mc Graw Hills International
Seventh Edition.
2. C. L. Liu, “Elements of Discrete Mathematics”, McGraw Hills International Second Edition.
Reference Books:
1. Elements of Discrete Mathematics by C. L. Liu and D.P. Mohapatra, TMH, 2012
2. J. P Tremblay, R. Manohar, “Discrete Mathematical Structures with Applications to Computer
Science”, TMH, 1997.
 EOPC2004 DIGITAL ELECTRONICS (3-0-0)
Course Objective:
• Introduce the concept of digital and binary systems
• inculcate concepts of K-MAP to simplify a Boolean expression
• To facilitate students in designing combinational and sequential logic circuits.
Module 1 7 Hours
Introduction: Logic design, transistors as switches, CMOS gates, sequential
circuits,some examples.
Digital Systems: Representation of numbers, binary codes, Gray code, error-
detecting and error-correcting codes, registers, binary logic, basic logic
gates.
Boolean Algebra: Boolean operations, Boolean functions, algebraic
manipulations, minterms and maxterms, sum-of-products and product-of-
sum representations, two-input logic gates, functional completeness.
Module 2 7 Hours
Minimization of Boolean Functions: Karnaugh map, don't-care conditions,
prime implicants, Quine—McCluskey technique, Logic gates, NAND/NOR
gates, Universal gates.
Module 3 6 Hours
Combinational Circuits: Adder, subtractor, multiplier, comparator, decoders,
encoders, multiplexers, demultiplexers, MUX Realization of switching
functions, Parity bit generator, Code-converters, Hazards and hazard free
realizations.
Module 4 5 Hours
Synchronous Sequential Circuits: Finite-state machines, latches and flip-
flops (SR, D, JK, T), synthesis of clocked sequential circuits, Steps in
synchronous sequential circuit design. Design of modulo-N Ring & Shift
counters, Serial binary adder.
Module 5 5 Hours
Registers and Counters: Registers and shift registers, sequential adders,
binary and BCD ripple counters, synchronous counters
Algorithmic State Machines: Salient features of the ASM chart-Simple
examples-System design using data path and control subsystems-control
implementations-examples of Weighing machine and Binary multiplier.

Course Outcome:
At the end of the course, students will be able to:

CO1: Understand various types of number systems and their conversions

CO2: Identify the importance of canonical forms in the minimization of Boolean functions in
digital circuits.
CO3: Design and implement variety of logical devices using combinational circuits and
Sequential circuits.
CO4: Analyse sequential circuits like Registers and Counters using flip-flops
CO5: Design the finite state machine using algorithmic state machine charts
Text Books:
1. Digital Design — Morris Mano, PHI, 3rd Edition, 2006.
2. Digital Electronics by G.K. Kharate, Oxford University Press
3. Switching & Finite Automata theory — Z. Kohavi, TMH,2nd Edition.
4. An Engineering Approach To Digital Design — Fletcher, PHI.
5. Fundamentals of Logic Design — Charles H. Roth, Thomson Publications, 5th Edition, 2004.
6. Digital Logic Applications and Design — John M. Yarbrough, Thomson Publications, 2006
 CSPC2002 DATA STRUCTURES (3-0-0)

Module –I (12 hrs)

Introduction: Introduction to data structures, types, concept of Abstract Data Types, Data
Structure Operations: Insertion, deletion, traversal, merging, etc., Strings and Arrays,
Operations on Arrays and strings, Concept of Sparse Matrix, Address calculation and
Representation of Matrices in Row-Major and Column-Major Order, Searching: Linear
Search and Binary Search Techniques and their complexity analysis
Module –II (8 hrs)
Stacks and Queues: ADT Stack and its operations: Algorithms , Applications of Stacks:
Conversion from infix to prefix and infix to postfix expressions- corresponding algorithms
and their analysis, Recursion using Stack, Queues: Types: Simple Queue, Circular Queue,
Priority Queue; Insertion and Deletion algorithms Application of Queues, Array
Implementation of Stack and Queue
Module-III (8 hrs)
Linked Lists: Concept of Linked Lists, Advantages of Linked Lists over Arrays,
Representation in Memory, Types of Linked Lists: Single Linked-Lists, Double Linked-Lists,
Circular Linked Lists, Operations on Linked Lists: Insertion, Deletion, Merging, Updation,;
Linked Representation of Stack and Queue, Single Linked-Lists: Operations and algorithms;
Double Linked-Lists: Operations and algorithmic analysis, Circular Linked-Lists: Operations
and algorithmic analysis

Module-IV (10 hrs)

Trees: Terminologies, types of trees: Binary Trees, Threaded Binary Trees, Binary Search
Trees, AVL Trees, Operations on these trees: algorithms and their analysis, Applications of
Binary Trees, B-Trees, B+-Trees: Definitions, algorithms and analysis
Graphs: Terminologies and Representations, Types of graphs, Graph Search and Traversal
algorithms and their analysis, Shortest-path algorithms- Dikjstra, Warshall’s, Spanning Tree
algorithms-Kruskal, Prims
Module-V (7 hrs)
Sorting and Hashing: Objective and analysis of different sorting algorithms: Selection Sort,
Bubble Sort, Merge Sort, Heap Sort, Quick Sort, Radix Sort, Insertion Sort; Hashing
Techniques
Course Outcomes (COs):
CO1: Understand basic data structures such as arrays, strings, and linked lists.
CO2: Study linear data structures such as stacks and queues and understand their difference.
CO3: Describe the hash function and concepts of collision and its resolution methods.
CO4: Understand the concept of memory management.
CO5: Study tree, heap and graphs along with their basic operations.
CO6: Study different techniques for solving problems like sorting and searching

Text Books:
“Data Structures using C and C++”, Tenenbaum, PHI Publication
Reference Books:
“Data Structures using C”, Reema Thareja, Oxford Press
“Data Structures using C”, Amiya Kumar Rath and Alok Kumar Jagadev, ECT Publications
 CSPC2003 OBJECT ORIENTED PROGRAMMING (3-0-0)

Module-I(10 Hrs)

Chapter 1:An Introduction to Programming.

Different types of Programming languages, Differences between Compiler and Interpreter.

Advantages of Object Oriented Programming, Features of Object Oriented Programming.

Chapter 2 : Introduction to Java.

What is Java? Why Java? History behind Java. Different versions of Java. Difference
between C/C++ and Java. Features of Java, First Java Program, Prerequisites Before start
writing a java program, writing the program, Compiling the program, Executing the program,
JVM and its significance, Architecture of JVM.

Chapter 3 : Understanding First Java program, Java Tokens, Datatypes, Operators, Different
types of operators, Type casting, Control Structures and Arrays, different types of control
structures , Conditional Statements, Loops/Iterators, Jumping statements, Java Arrays,
Multidimensional Arrays , Taking input from keyboard , Command Line Arguments, Using
Scanner Class, Using Buffered Reader Class.

Module-II(08 Hrs)

Chapter 1: Introduction to Classes and Objects.

Classes, Methods, Objects, Description of Data Hiding and Data Encapsulation, Constructors,
use of Static keyword in Java, Use of This keyword in Java, Array of Objects, Concept of
Access Modifiers (Public, Private, Protected, Default).

Chapter 2: Inheritance

Understanding Inheritance, Types of Inheritance and Java Supported Inheritance,

Significance of Inheritance, Constructor call in inheritance, Use of Super keyword in Java,
Polymorphism, understanding polymorphism, Types of Polymorphism, Significance of
Polymorphism in Java, Method Overloading, Constructor overloading, Method overriding,
Dynamic Method Dispatching.

Chapter 3 : String Manipulations.

Introduction to different classes, String Class, String Buffer, String Builder, String Tokenizer,
Concept of Wrapper Classes, Introduction to Wrapper Classes, Different predefined wrapper
classes, predefined constructors for the wrapper classes , conversion of types from one
type(Object) to another type (Primitive) and vice versa, concept of Auto boxing and
Unboxing.

Module-III(09 Hrs)
Chapter 1: Data Abstraction

Basics of Data Abstraction, Understanding Abstract classes, Understanding Interfaces,

Multiple Inheritance using Interfaces, Packages, Introduction to Packages, Java API
Packages, User Defined Packages, Accessing Packages, Error and Exception Handling ,
Introduction to error and exception , Types of exceptions and difference between the types,
Run Time Stack Mechanism, Hierarchy of Exception Classes , Default Exception Handling in
Java, User defined/ Customized Exception Handling , Understanding different Keywords(
try,catch,finally,throw,throws), User defined exception classes, Commonly used Exceptions
and their details.

Chapter 2: Multithreading

Introduction to Multithreading / Multitasking, Ways to define a Thread in Java , Thread

naming and priorities, Thread execution prevention methods, (yield(),join(),sleep()), Concept
of Synchronisation, Linear Thread communication, Basics of Deadlock , Demon Thread,
Improvement in Multithreading, Inner Classes , Introduction, Member Inner Class, Static
Inner Class, Anonymous Inner Class.

Module-IV(10 Hrs)

Chapter 1: IO Streams (java.io package)

Introduction, Byte Stream and Character Stream, Files and Random Access files,
Serialization, Collection Frame work (java. util), Introduction, Util Package Interface, List,
Set, Map etc, List Interfaces and Classes, Setter Interface and its Classes.

Chapter 2: Applet

Introduction, Life Cycle of an Applet, GUI with an Applet, Abstract Window Toolkit(AWT),
Introduction to GUI, Description of Components and Containers, Components/Container
hierarchy, Understanding different Components /Container Classes and their Constructors,
Event Handling, Different mechanism of Event Handling, Listener Interface, Adapter
Classes.

Module-V(08 Hrs)

Chapter 1: Swing(JFC)

Introduction Difference b/w AWT and swing, Components Hierarchy, Panes, Individual
Swings, Components, JLabel, JButton, JTextField, JTextArea.

Chapter 2: JavaFX

Getting started with JavaFX, Graphics, User Interface Components, Effects, Animation, and
Media, Application Logic, Interoperability, JavaFX Scene Builder 2, Getting started with
Scene Builder.

Working with Scene Builder.

Course Outcomes (COs):

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

CO1: Understand the benefits of a well-structured program

CO2. Understand different computer programming paradigms

CO3. Understand underlying principles of Object-Oriented Programming in Java

CO4. Develop problem-solving and programming skills using OOP concepts

CO5. Develop the ability to solve real-world problems through software development in
high-level programming language like Java

Text Books: -

1. JAVA Complete Reference (9th Edition) Herbalt Schelidt

Reference Books:

1. Programming in Java, Second Edition, OXFORD HIGHER EDUCATION, (SACHIN

MALHOTRA, SAURAV CHOUDHARY)
2. CORE JAVA for Beginners (Rashmi Kanta Das), Vikas Publication
 PCAC2002 DATA SCIENCE FOUNDATIONS (3-0-0)

OVERALL COURSE OBJECTIVES: To enhance students' aptitude in implementing scalable data science
platforms, and understanding big data landscape with a focus on using statistical measures, data
visualization, advanced tools, and specific processes that aid in detecting data trends, minimizing
inconsistencies, and improving overall data analysis.

Module 1: Introduction to Data Science in Python [35 Hours]

This course will introduce the learner to the basics of the Python programming environment,
including fundamental Python programming techniques such as lambdas, reading and manipulating
csv files, and the numpy library. The course will introduce data manipulation and cleaning
techniques using the popular Python pandas data science library and introduce the abstraction of
the Series and DataFrame as the central data structures for data analysis, along with tutorials on
how to use functions such as group by, merge, and pivot tables effectively. By the end of this course,
students will be able to take tabular data, clean it, manipulate it, and run basic inferential statistical
analyses.

Sub-Topic
Fundamentals of Data Manipulation with Python
Data Processing with Pandas
Answering Questions with Messy Data

Formative Assessments:
4 quizzes and 9 coding/lab assignments.

Module 2: Introduction to Big Data [17 Hours]

This course provides an introduction to the Big Data landscape for beginners interested in data
science. It includes an overview of key concepts behind big data problems, applications, and
systems. The course offers familiarity with the Hadoop framework that simplifies big data analysis,
making it more accessible. It covers the characteristics of Big Data, the process of structuring
analysis, identification of big data problems, the architectural components, and programming
models for scalable big data analysis. It also explores the core Hadoop stack components including
the YARN resource and job management system, the HDFS file system, and the MapReduce
programming model. Installations and virtual machine operations are required for hands-on
assignments. Prior programming experience is not necessary.

Sub-Topic
Big Data: Why and Where
Characteristics of Big Data and Dimensions of Scalability
Data Science: Getting Value out of Big Data
Foundations for Big Data Systems and Programming
Systems: Getting Started with Hadoop

Formative Assessments:
6 quizzes and 1 peer-review assignment.

LEARNING OUTCOMES: On successful completion of the course the students shall be able to:

1. Understand and apply basic statistical measures to identify patterns within large sets of
data,
2. Develop proficiency in recognizing various data characteristics, patterns, trends, deviations
or inconsistencies, and potential outliers.

3. Employ techniques for dealing with big data like dimension reduction and feature selection
methods.

4. Leverage advanced tools and charting libraries to improve the efficiency of big data analysis
with partitioning and parallel analysis.

5. Visualize data using 2D and 3D formats achieving a better understanding and interpretation.

6. Get value out of Big Data following a specific 5-step process to structure your analysis.
 HSHS2001 ENGINEERING ECONOMICS (3-0-0)

Objectives:
To provide basic concept of micro and macro economics, engineering economics and their application in engineering
economy. Further, to develop the ability to account for time value of money using engineering economy factors and
formulas.

Module - I (05 hours)

Engineering Economics- Nature, Scope, Basic problems of an economy, Micro Economics and Macro Economics.
Demand - Meaning of demand, Demand function, Law of Demand and its exceptions, Determinants of demand,
Elasticity of demand & its measurement (Simple numerical problems to be solved ), Demand Forecasting Meaning
Supply-Meaning of supply, Law of supply and its exception, Determinants of supply, Elasticity of supply,
Determination of market equilibrium (Simple numerical problems to be solved).

Module - II (O8 hours)

Production - Production function, Laws of returns: Law of variable proportion, Law of returns to scale
Cost and Revenue Concepts - Total Costs, Fixed cost, Variable cost, Total revenue, Average revenue and
Marginal revenue, Cost-Output Relationships in the Short Run, and Cost-Output Relationships in the Long Run,
Analysis of cost minimization.

Module III (08 hours)

Market - Basic understanding of different market structures, Determination of equilibrium price under perfect
competition (Simple numerical problems to be solved), Break Even Analysis-linear approach (Simple numerical
problems to be solved).

Module - IV (12 hours)

Time Value of Money- Interest - Simple and compound, nominal and effective rate of interest, Cash flow diagrams,
Principles of economic equivalence.
Evaluation of Engineering Projects -Present worth method, Future worth method, Annual worth method, Internal
rate of return method, Cost benefit analysis for publicprojects.
Depreciation- Depreciation of capital assert, Causes of depreciation, Methods of calculating depreciation - Straight
line method, Declining balance method, SOYD method, After tax comparison of project

Module V (06 Hours)

Inflation-Meaning of inflation, types, causes, measures to control inflation.

National Income-Definition, Concepts of national income, Method of measuring national income.
Banking -Commercial bank. Functions of commercial bank, Central bank, Functions of Central Bank.

Books:
1. Principles of Economics by Deviga Vengedasalam and Karaunagaran Madhavan, Oxford
2. Riggs, Bedworth and Randhwa, "Engineering Economics", McGraw Hill Education India
3. C. S. Park, Contemporary Engineering Economics, 6th Edition, Pearson Education, 2015.
4. Engineering Economy by William G.Sullivan, Elin M.Wicks, C. Patric Koelling, Pearson
5. R.Paneer Seelvan, " Engineering Economics", PHI
6. Ahuja,H.L., "Principles of Micro Economics" , S.Chand & Company Ltd
7. Jhingan,M.L., "Macro Economic Theory"
8. Macro Economics by S.P.Gupta, TMH
Course Outcomes of Engineering Economics

At the end of the course the students will be able to

CO1 Remembering : Define the basic concept of micro and macro economics, engineering economics and their
application in engineering economy.
CO2 Understanding : Evaluate numerically the effects of changes in demand and supply on price determination
of products and services.
CO3 Analyze : the macroeconomic environment and financial systems of the country and its impact on business,
society and enterprise.
CO4 Develop : the ability to account for time value of money using engineering economy factors and formulas.
CO5 Apply: knowledge of mathematics, economics and engineering principles to solve engineering problems
and to analyze decision alternatives in engineering projects considering upon depreciation, taxes and
inflation.