B. Tech CSE Syllabus
B. Tech CSE Syllabus
PO-2: Problem Analysis: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
PO-5: Modern tool usage: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to
complex engineering activities with an understanding of the limitations.
PO-6: The engineer and society: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering practice.
1 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PO-8: Ethics: Apply ethical principles and commit to professional ethics and
responsibilities and norms of the engineering practice.
PO-12: Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of
technological change.
PEO-1: To provide students with a strong foundation in applied science and Computer
Science & Engineering fundamentals necessary to analyze the requirements of the
software, understand the technical specifications, design and create innovative
computing products and solutions for real life problems.
PEO-3: To prepare the students for a successful professional career as engineer, scientist,
teacher, technocrat, administrator or an entrepreneur and work with values &
social concern bridging the digital divide and meeting the requirements of Indian
and multinational companies.
2 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PSO-2: Problem Solving Skills: Ability to design and develop computer programs and
computer based systems of moderate complexity in the areas pertaining to
database, networking, web-design, artificial intelligence and information security.
PSO-3: Professional Skills: Ability to apply standard practices and methods in software
project management and software development using suitable programming
environments to deliver quality product for the industry.
3 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Curriculum Structure for B. Tech in Computer Science and Engineering
Semester III
Sl. Type of course Code Course Title Hours per week
No. Credits
L T P
Theory
1 Engineering ESC 301 Digital Logic Design 3 0 0 3
Science Course
2 Professional Core PCC-CS301 Data Structure & 3 0 0 3
Courses Algorithms
3 Professional Core PCC-CS302 Formal Language & 3 0 0 3
Courses Automata Theory
4 Basic Science course BSC 301 Mathematics-III 3 0 0 3
(Probability and
Statistics)
5 Humanities & HSMC 301 Economics for 3 0 0 3
Social Sciences Engineers (Humanities-
including II)
Management
courses
Practical
6 Engineering ESC 391 Digital Logic Design 0 0 4 2
Science Course Lab
7 Professional Core PCC-CS391 Data Structure & 0 0 4 2
Courses Algorithms Lab
4 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Curriculum Structure for B. Tech in Computer Science and Engineering
Semester IV
Sl. Type of course Code Course Title Hours per week
No. Credits
L T P
Theory
1 Professional Core PCC- CS401 Discrete Mathematics 3 1 0 4
Courses
2 Professional Core PCC-CS 402 Computer Organization 3 0 0 3
Courses & Architecture
5 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Curriculum Structure for B. Tech in Computer Science and Engineering
Semester V
Sl. Type of course Code Course Title Hours per week
No. L T P Credits
Theory
1 Engineering ESC 501 Compiler design 3 0 0 3
Science
Course
2 Professional Core PCC- CS 501 Database Management 3 0 0 3
Courses Systems
3 Professional Core PCC- CS502 Operating Systems 3 0 0 3
Courses
4 Professional Core PCC- CS503 Microprocessor & 3 0 0 3
Courses Microcontroller
5 Humanities & HSMC-501 Introduction to 3 0 0 3
Social Sciences Industrial Management
including (Humanities III)
Management
courses
6 Professional PEC-CS 501 (Elective-I) 3 0 0 3
Elective courses A/B/C Artificial Intelligence/
Advanced
Computer
Architecture/
Computer Graphics
7 Mandatory Courses MC- CS501 Constitution of India/ 2 - - 0
Essence of Indian
Knowledge Tradition
Practical
8 Professional Core PCC- CS591 Database Management 0 4 2
Courses Systems Lab
9 Professional Core PCC- CS592 Operating Systems Lab 0 4 2
Courses
10 Professional Core PCC- CS593 Microprocessor & 0 4 2
Courses Microcontroller Lab
6 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Curriculum Structure for B. Tech in Computer Science and Engineering
Semester VI
Sl. Type of course Code Course Title Hours per week
No. L T P Credits
Theory
1 Professional Core PCC- CS601 Software Engineering 3 0 0 3
Courses
7 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Curriculum Structure for B. Tech in Computer Science and Engineering
Semester VII
Sl. Type of course Code Course Title Hours per week
No. L T P Credits
Theory
1 Professional PEC- CS701A/B/ (Elective-IV) Quantum 3 0 0 3
Elective courses C/D/E/F Computing/ Cloud
Computing/
Neural Networks and
Deep Learning/ Soft
Computing/ Ad-Hoc
and Sensor
Networks/Information
Theory and Coding
2 Open Elective OEC- (Open Elective-II) 3 0 0 3
courses CS701A/B/ C Operations
Research/Multimedia
Systems/ Introduction
to Philosophical
Thoughts
3 Humanities & 2 1 0 3
Social Sciences HSMC 701 Project Management
including and
Management Entrepreneurship
courses
4 Industrial 0 0 0 3
Internship/Training TR-CS 771 Industry Internship
5 Project PROJ- CS781 Project-I 0 0 12 6
8 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Curriculum Structure for B. Tech in Computer Science and Engineering
Semester VIII
Sl. Type of course Code Course Title Hours per week
No. L T P Credits
Theory
1 Professional PEC- CS801A/ (Elective-VI) 3 0 0 3
Elective B/C/D/E Signals and
courses Networks/Cryptograph
y & Network Security/
Speech and Natural
Language Processing/
Web and Internet
Technology/Internet
of Things
2 Open OEC- CS Open Elective-III 3 0 0 3
Elective 801A/B/ Big Data
courses C/D/E Analysis/Cyber Law
and Ethics/ Mobile
Computing/Robotics/S
oft Skill &
Interpersonal
Communication
3 Industrial 0 0 0 3
Internship/Training TR-CS 871 Industry Internship
4 Project PROJ- CS881 Project-II 0 0 12 6
Total credit of the Semester 15
9 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Detailed Syllabus for B. Tech in Computer Science & Engineering
Objective:
1. To familiar with the digital signal, positive and negative logic, Boolean algebra, logic
gates, logical variables, and number systems.
2. To acquire the basic knowledge of digital logic levels and application of knowledge
to understand digital electronics circuits.
3. To prepare students to perform the analysis and design of various digital electronic
circuits
Pre-Requisite:
1. Basic Electronics Parts I & II learned in the First year, semesters 1 & 2. Basic BJTs
2. Basic concept of the working of P-N diodes, Schottky diodes,
3. Basic FETs and OPAMP as a basic circuit component. Concept of Feedback
10 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Course Outcome:
On completion of the course students will be able to
ESC 301.1 Explain the fundamental Analog circuits such as Amplifiers, Wein Bridge
Oscillator, multivibrators, Schimtt Trigger, and 555 timers.
ESC 301.2 Illustrate binary arithmetic, code conversion; and solve Boolean logic
minimization.
ESC 301.3 Design the fundamental combinational and sequential logic circuits; and
counters and registers.
ESC 301.4 Discuss the basic concepts of logic families and elementary A/D and D/A
conversion techniques.
ESC 301.5 Improve the combinational and sequential circuit design and minimization
techniques.
ESC 301.6 Formulate the circuit design theory for model development of logic circuits.
Objective:
1. To learn the basics of abstract data types.
2. To learn the principles of linear and nonlinear data structures.
3. To build an application using sorting and searching.
Pre-Requisite:
1. CS 201 (Basic Computation and Principles of C)
11 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
2. M101 & M201 (Mathematics), basics of set theory
12 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Courses Outcomes:
On completion of the course student will be able to
PCC-CS301.1 Define and understanding introductory concepts of data structure, time
and space analysis of algorithms using different asymptotic notations.
PCC-CS301.2 Understanding linear data structures with its applications and
operations on different Linked lists.
PCC-CS301.3 Illustrate the concept and implementation of stack, queue, dequeue,
circular queue, and applications of stack using recursion.
PCC-CS301.4 Understanding and build non-linear data structure such as trees, its
traversal, insertion, deletion, height-balanced and B-trees.
PCC-CS301.5 Analyze and evaluate various searching and sorting algorithms, problem
analysis and representation of graphs such as BFS and DFS.
PCC-CS301.6 Analyze and evaluate the importance of data structure and be able to
correlate future programming structure, and its market issues specific
to complex engineering problems.
Objective:
1. Be able to construct finite state machines and the equivalent regular expressions.
2. Be able to prove the equivalence of languages described by finite state machines
and regular expressions
3. Be able to construct pushdown automata and the equivalent context free grammars.
And Be able to prove the equivalence of languages described by pushdown
automata and context free grammars.
4. Be able to construct Turing machines and Post machines. Be able to prove the
equivalence of languages described by Turing machines and Post machines
Pre-Requisite:
1. Basic set theory
13 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
grammars (CFG) and languages (CFL), Chomsky and Greibach
normal forms, nondeterministic pushdown automata (PDA) and
equivalence with CFG, parse trees, ambiguity in CFG, pumping
lemma for context-free languages, deterministic push down
automata, closure properties of CFLs.
4. Context-sensitive languages: Context-sensitive grammars (CSG) 4
and languages, linear bounded automata and equivalence with CSG.
5. Turing machines: The basic model for Turing machines (TM), 8
Turing recognizable(recursively enumerable) and Turing-
decidable (recursive) languages and their closure properties,
variants of Turing machines, nondeterministic TMs and
equivalence with deterministic TMs, unrestricted grammars and
equivalence with Turing machines, TMsas enumerators.
6. Undecidability: Church-Turing thesis, universal Turing machine, 4
the universal and diagonalization languages, reduction between
languages and Rice s theorem, undecidable problems about
languages
Course Outcomes:
On completion of the course students will be able to
PCC-CS302.1 Define automata theory as the basis of all computer languages and recall
set, graph, tree, principle of mathematical induction.
PCC-CS302.2 Explain Finite State Machine, its behaviour and how to minimize the
machine.
PCC-CS302.3 Demonstrate Finite Automata, regular expression and check equivalence
between regular grammar and FA.
PCC-CS302.4 Examine context free grammar (CFG), minimize CFG and check
equivalence of CFL and PDA.
PCC-CS302.5 Apply pumping lemma to disprove the language is regular language or
context free language.
PCC-CS302.6 Design Turing machines for languages and realize limitations in
computing.
14 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Mathematics III (Probability & Statistics)
Course: BSC 301
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
15 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
McGraw-Hill, New Delhi, 2010.
7. Spiegel M R., Schiller J.J. and Srinivasan R.A. : Probability and Statistics (Schaum's
Outline Series), TMH.
Course Outcomes:
On completion of the course students will be able to
BSC 301.1 Recite concept of permutation and combination, concept of statistics.
BSC 301.2 Discuss the concept probability distribution, statistical inference and
hypothesis testing.
BSC 301.3 Demonstrate computational modelling of biological phenomena and
applies techniques from areas such as artificial intelligence, data base,
software engineering, machine learning, image processing.
BSC 301.4 Illustrate physical scenario and classify them to recognize the best fit
physical and logical models.
BSC 301.5 Compare different mathematical results during the process of problem
analysis.
BSC 301.6 Design models to demonstrate industrial problem for emerging trend in
information technology.
Objective:
1. Understand the role and scope of Engineering Economics and the process of
economic decision making
2. Understand the different concepts of cost and different cost estimation techniques
3. Familiarization with the concepts of cash flow, time value of money and different
interest formulas
4. Appreciation of the role of uncertainty in future events and using different concepts
from probability to deal with uncertainty
5. Understand the concepts of Depreciation and Replacement analysis along with their
methods of calculation
6. Familiarization with the phenomenon of inflation and the use of price indices in
engineering Economics
7. Introduction to basic concepts of Accounting and Financial Management
Pre-Requisite:
1. Mathematics
16 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Marginal & Average Costs, Sunk Costs, Opportunity Costs,
Recurring And Nonrecurring Costs, Incremental Costs, Cash Costs
vs Book Costs, Life-Cycle Costs; Types Of Estimate, Estimating
Models - Per-Unit Model, Segmenting Model, Cost Indexes, Power-
Sizing Model, Improvement & Learning Curve, Benefits.
2. Cash Flow, Interest and Equivalence: Cash Flow –Diagrams, 9
Categories & Computation, Time Value of Money, Debt repayment,
Nominal& Effective Interest.
Cash Flow & Rate of Return Analysis –Calculations, Treatment of
Salvage Value, Annual
Cash Flow Analysis, Analysis Periods; Internal Rate of Return,
Calculating Rate of Return, Incremental Analysis; Best Alternative
Choosing an Analysis Method, Future Worth Analysis, Benefit-Cost
Ratio Analysis, Sensitivity and Breakeven Analysis. Economic
Analysis In The Public Sector -Quantifying And Valuing Benefits &
drawbacks.
3. Inflation and Price Change – Definition, Effects, 9
Causes, Price Change with Indexes, Types of Index, Composite vs
Commodity Indexes, Use of Price Indexes In Engineering Economic
Analysis, Cash Flows that inflate at different Rates.
Present Worth Analysis: End-Of-Year Convention,
Viewpoint Of Economic Analysis Studies, Borrowed Money
Viewpoint, Effect Of Inflation & Deflation, Taxes, Economic Criteria,
Applying Present Worth Techniques, Multiple Alternatives.
Uncertainty In Future Events - Estimates and Their Use in
Economic Analysis, Range Of Estimates,
Probability, Joint Probability Distributions, Expected Value,
Economic Decision Trees, Risk, Risk vs Return, Simulation, Real
Options.
4. Depreciation - Basic Aspects, Deterioration & Obsolescence, 9
Depreciation And Expenses, Types Of Property, Depreciation
Calculation Fundamentals, Depreciation And Capital Allowance
Methods, Straight-Line Depreciation Declining Balance
Depreciation, Common Elements Of Tax RegulationsFor
Depreciation And Capital Allowances.
Replacement Analysis - Replacement AnalysisDecision Map,
Minimum Cost Life of a New Asset,
Marginal Cost, Minimum Cost Life Problems.
Accounting – Function, Balance Sheet, IncomeStatement, Financial
Ratios Capital Transactions,Cost Accounting, Direct and Indirect
Costs, Indirect
Cost Allocation.
17 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
3. John A. White, Kenneth E.Case,DavidB.Pratt : Principle of Engineering Economic
Analysis, John Wiley
4. Sullivan and Wicks: Engineering Economy, Pearson
5. R. PaneerSeelvan: Engineering Economics, PHI
6. Michael R Lindeburg : Engineering Economics Analysis, Professional Pub
Course Outcome:
On completion of the course students will be able to
HSMC-301.1 Make different economic decisions and estimate engineering costs by
applying different cost estimation models.
HSMC-301.2 Create cash flow diagrams for different situations and use different
interest formulae to solve associated problems.
HSMC-301.3 Take decisions regarding different engineering projects by using various
criteria like rate of return analysis, present worth analysis, cost-benefit
analysis etc.
HSMC-301.4 Incorporate the effect of uncertainty in economic analysis by using
various concepts like expected value, estimates and simulation. They will
also understand the process of inflation and use different price indices to
adjust for its effect.
HSMC-301.5 Understand the concepts of depreciation and replacement analysis and
solve associated problems.
HSMC-301.6 Apply the various concepts of Accounting like balance sheet and ratio
analysis. Also they will understand the scope of Finance and the role of
financial planning and management.
Pre-Requisite:
1. Pre-requisites as in ESC-301
Laboratory Experiments:
1 Design a Full Adder using basic gates and verify its output / Design a Full
Subtractor circuit using basic gates and verify its output.
2 Construction of simple Decoder & Multiplexer circuits
3 Design BCD Adder circuit
4 Design CPA circuit
5 Design CLS and CSA circuit
6 Realization of RS / JK / D flip flops using logic gates
7 Design of Shift Register using J-K / D Flip Flop
8 Realization of Synchronous Up/Down counter
9 Design of MOD- N Counter
18 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
10 Study of DAC
Course Outcome:
On completion of the course students will be able to
ESC-391.1 Extend the knowledge to implement the basic analog and digital circuits.
ESC-391.2 Experiment with the ICs to solve problems related to Digital logic
circuits.
ESC-391.3 Design and test the combinational circuits, and code conversion
methods.
ESC-391.4 Compare various synchronous and asynchronous sequential circuits.
ESC-391.5 Modify and minimize the logic circuits to improve design skill-set.
ESC-391.6 Develop models for real-life applications related to life-long learning.
Pre-Requisite:
1. Pre-requisites as in PCC-CS301
Laboratory Experiments:
Linear Data Structure
1 Implementation of array operations.
2 Stacks and Queues: adding, deleting elements Circular Queue: Adding & deleting
Elements.
3 Merging Problem: Evaluation of expressions operations on Multiple stacks &
queues:
4 Implementation of linked lists: inserting, deleting and inverting a linked list.
Implementation of stacks & queues using linked lists.
5 Polynomial addition, Polynomial multiplication.
Non Linear Data Structure
6 Recursive and Non-recursive traversal of Trees.
7 Threaded binary tree traversal. AVL tree implementation.
8 Application of Trees. Application of sorting and searching algorithms.
9 Hash tables implementation: searching, inserting and deleting, searching &
Sorting techniques.
Course Outcome:
On completion of the course students will be able to
PCC-CS391.1 Define different operations on data structure such as insertion, deletion,
merging using arrays.
19 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PCC-CS391.2 Demonstrate implementation of stacks and queues: insertion, deletion of
elements, circular queue: insertion, deletion of elements using array.
PCC-CS391.3 Solve expressions operations using multiple stacks & queues.
PCC-CS391.4 Construction and implementation of linked lists: inserting, deleting, and
inverting a linked list. Analyze implementation of stacks & queues using
linked lists, polynomial addition, polynomial multiplication, sparse
matrices multiplication, addition using linked list.
PCC-CS391.5 Evaluate recursive and non-recursive traversal of trees and
implementation of recursive binary tree traversal and AVL tree.
PCC-CS391.6 Design and implement of different searching and sorting algorithms.
Course Objective:
1. To master an understanding of scripting & the contributions of scripting languages.
2. Design real life problems and think creatively about solutions.
3. Apply a solution in a program using R/Matlab/Python.
4. To be exposed to advanced applications of mathematics, engineering and natural
sciences to program real life problems.
Pre-Requisite:
1. Knowledge of Programming Logic
2. Experience with a high level language (C/C++,) is suggested.
3. Prior knowledge of a scripting language and Object-Oriented concepts is helpful but
not mandatory.
Practical Syllabus
Programming in R
20 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Functions – Customizing Graphs, Saving Graphs to Files, Pie chart, Bar Chart,
Histogram.
Programming in Matlab
Introduction
Why MATLAB? History, Its strengths, Competitors, Starting MATLAB, Using MATLAB as
a calculator, Quitting MATLAB
Basics
Familiar with MATLAB windows, Basic Operations, MATLAB-Data types, Rules about
variable names, Predefined variables
Programming-I
Vector, Matrix, Array Addressing, Built-in functions, Mathematical Operations, Dealing
with strings (Array of characters), Array of array (cell) concept
Programming-II
Script file, Input commands, Output commands, Structure of function file, Inline
functions, Feval command, Comparison between script file and function file
Conditional statements and Loop
Relational and Logical Operators, If-else statements, Switch-case statements, Forloop,
While loop, Special commands (Break and continue), Import data from large database,
Export data to own file or database
2D Plotting
In-built functions for plotting, Multiple plotting with special graphics, Curve fitting,
Interpolation, Basic fitting interface
3D Plotting
Use of meshgrid function, Mesh plot, Surface plot, Plots with special graphics
21 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Defining a function, calling a function, Types of functions, Function Arguments,
Anonymous functions, Global and local variables
Modules
Importing module, Math module, Random module, Packages, Composition, Input-Output
Printing on screen, Reading data from keyboard, Opening and closing file, Reading and
Writing files, Functions
Exception Handling
Exception, Exception Handling, except clause, Try? Finally clause, User Defined
Exceptions.
Laboratory Experiments:
1. Practical Assignments related with implementation of PCC-CS393
Course Outcome:
On completion of the course students will be able to
Course Code : Course Name : IT Workshop (Sci Lab/MATLAB/Python/R)
PCC-CS392
PCC-CS392.1 To master an understanding of scripting & the contributions of
scripting languages.
PCC-CS392.2 Design real life problems and think creatively about solutions.
PCC-CS392.3 To identify the usages of methods and classes to meet different
scientific objectives
PCC-CS392.4 To identify the usages of plot functions to represent data in better form
PCC-CS392.5 Apply a solution in a program using R/Matlab/Python.
PCC-CS392.6 To be exposed to advanced applications of mathematics, engineering
and natural sciences to program real life problems.
22 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
CSE
Second Year - Fourth Semester
(Semester IV)
Discrete Mathematics
Code: PCC-CS401
Contacts: 3L+1T
Theory: 4 hrs. / Week
Credit points: 4
Objective:
1. Use mathematically correct terminology and notation.
2. Construct correct direct and indirect proofs.
3. To know Syntax, Semantics, Validity and Satisfiability, Graphs and Trees.
4. Use counterexamples. Apply logical reasoning to solve a variety of problems.
Pre-Requisite:
1. Some concepts from basic math – algebra, geometry
24 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Course Outcomes:
On completion of the course students will be able to
PCC-CS401.1 Express a logic sentence in terms of predicates, quantifiers, and logical
connectives.Upon completion of the course, the student will be able to
use logical notation.
PCC-CS401.2 Derive the solution for a given problem using deductive logic and
prove the solution based on logical inference.Apply recursive functions
and solve recurrence relations.
PCC-CS401.3 Classify its algebraic structure for a given a mathematical
problem.Describe useful standard library functions, create functions,
and declare parameters.
PCC-CS401.4 Evaluate Boolean functions and simplify expressions using the
properties of Boolean algebra.Design and evaluate Euler and Hamilton
circuits. Able to apply algorithms to problems including searching
algorithms, base conversion algorithms and the Euclidean algorithm.
PCC-CS401.5 Develop the given problem as graph networks and solve with
techniques of graph theory.And calculate discrete probabilities.
Students will be able to apply Recursion and advanced counting
technique problem solution.
PCC-CS401.6 Use graphs and trees.Apply basic and advanced principles of counting.
Simplify and evaluate basic logic statements including compound
statements, implications,
Inverses, converses, and contra-positives using truth tables and the
properties of logic.
Objective:
1 To study how a digital computer works.
2 To understand how a computer can be designed.
3 To explain an instruction can be executed by a computer.
Pre-Requisite:
1 Number systems
2 Basic programming skills
3 Basics of Digital Electronics
25 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Unit Content Hrs./Unit
1 Von-Neumann Computer. Data Types, Fixed-Point and Floating- 9
Point Representation. IEEE Standard for Floating-Point Numbers.
Arithmetic Operations on Floating-point Numbers, Overflow.
Multiplication – Booth multiplier. Register and its types, RTL. Bus
Transfer, Construction of a common bus using MUXs, Construction
of a common bus using tri-state buffers. Shifter Unit. Arithmetic
unit, Logic unit, Simple ALU Design.
2 Computer Instruction Set Design: Introduction, Instruction 9
Formats.CPU classification: Single accumulator organization,
General register organization, Stack organization. 0-,1-,2-,3-
Address computers and examples. Instruction Cycle. Addressing
modes. RISC Vs CISC.
3 Memory Organization: Memory Parameters, Memory Hierarchy. 9
Main Memory, Large Memory Construction Using Small Chips.
Internal Organization of Main Memory Chips, Memory Cell (SRAM,
DRAM & ROM). Secondary Memory (Magnetic Tape, Magnetic Disk,
Optical Disc). Cache Memory, Performance of Cache Memory. Cache
Mappings.
Input-output subsystems, I/O device interface, I/O transfers –
program controlled, interrupt driven and DMA.
4 Flynn’s Classification of computers. Pipelining: Introduction, 9
Definition, Space time diagram, Clock period. Performance
measurement: Speed-up, Efficiency and Throughput, Example;
Classification of pipelined processors. Design of arithmetic
pipelines: Floating point adder pipeline, Multiplier pipeline. Issues
in pipeline design: Pipeline hazards. Multiple issue processors:
Super-pipelining, Super-scalar and VLIW. Vector processing:
Introduction, Characteristics. SIMD array processor: Introduction,
Classification. Multiprocessor: Introduction, Classification.
26 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Course Outcomes:
On completion of the course students will be able to
PCC-CS402.1 Demonstrate sufficient knowledge and understanding of data
representation, and experiment with basic arithmetic operations.
PCC-CS402.2 Analyze and model various functional units of CPU such as ALU, control
unit and register file.
PCC-CS402.3 Organize the memory hierarchy and design a memory of any type.
PCC-CS402.4 Explain the instruction set architecture, instruction formats and
instruction cycle.
PCC-CS402.5 Outline various modes of I/O operations and summarize working
principles of I/O interface circuits.
PCC-CS402.6 Explain the pipelining technique and its related issues.
Objective:
1. Introduce the principles of object-oriented programming in a higher-level
programming language.
2. Analyze a problem statement to develop a mental model of objects necessary to
create software architecture.
3. Utilize object-oriented programming to frame software architectures, with care
towards separation of concerns and abstraction.
4. Gain skills in designing, and programming software for reuse of code.
5. Establish development methods in object-oriented programming to qualify
students for teaching the language in other settings.
Pre-Requisite:
Programming Fundamentals
27 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
4. Basic String handling in Java (All relevant methods from String
class and StringBuffer class) Concept of mutable and immutable
5
string, command line arguments, Basic I/O operations using
BufferedReader and Scanner class.
5. Reusability Properties and Packages
Inheritance (Simple, multilevel, hierarchical) concept, Static and
Dynamic polymorphism, creation of abstract class and interface.
6
Creation of package, detailed discussion on access specifiers.
Defining packages, Member access, Importing packages. Creation
of packages etc.
6. Exception Handling and Multithreading
Exception handling basics, different types of Exception classes, use
of try & catch with throw, throws & finally, creation of user defined
exception classes.
4
Basics of multithreading, main thread, thread life cycle, creation of
multiple threads, thread priorities, thread synchronization, inter
thread communication, deadlocks for threads, suspending &
resuming threads.
7. AWT and Layout Managers
AWT classes, Frame Windows, Graphics, Working with color and
font labels, Buttons, boxes, List, Text field, Understanding Layout 4
managers, Border layout, Grid Layout.
8. Event Handling
Event Delegation Model,Window Event, Mouse Event, Key Event 2
etc.
9. Collections Java Collection Framework
Interfaces SET, LIST, Queue etc., Classes ArrayList, Vector,
3
LinkedList, PriorityQueue, HashSet, LinkedHastSet etc.The
software development process, Model-view-controller pattern.
Course Outcomes:
On completion of the course students will be able to
PCC-CS403.1 Explain the principal of Object Oriented Programming (OOP) using
programming syntaxes of JAVA programming language.
PCC-CS403.2 Identify the requirements to the solution of complex engineering
28 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
problems by proper analysis of classes with their relationships and
interpretation of data/objects.
PCC-CS403.3 Construct algorithms with computer programs to implement the major
OOP concepts related to Data Encapsulation, Polymorphism, Code
Reusability, Robustness, Multi-processing (Thread), etc.
PCC-CS403.4 Design different system components like Graphical User Interfaces with
Applet & Swing and small applications using object oriented design
approach.
PCC-CS403.5 Develop OOP based applications using modern tools following the
professional OOP based engineering solutions, ethics and management
techniques.
PCC-CS403.6 Assess the need and utility for different OOP components and their role-
play to produce huge distributed data driven software to contribute to
lifelong learning.
Objectives:
1. The aim of this module is to learn how to develop efficient algorithms for simple
computational tasks and reasoning about the correctness of them
2. Through the complexity measures, different range of behaviours of algorithms and
the notion of tractable and intractable problems will be understood
Pre-Requisite:
1. To know data-structure and basic programming ability
29 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
theorem (Statement and Illustration)
Course Outcomes:
On completion of the course students will be able to
PCC-CS 404.1 For a given algorithms analyse worst-case running times of algorithms
based on asymptotic analysis and justify the correctness of algorithms.
And for a given model engineering problem model it using graph and
write the corresponding algorithm to solve the problems.
PCC-CS 404.2 Describe the greedy paradigm and explain when an algorithmic design
situation calls for it. For a given problem develop the greedy algorithms.
PCC-CS 404.3 Describe the divide-and-conquer paradigm and explain when an
algorithmic design situation calls for it. Synthesize divide-and-conquer
algorithms. Derive and solve recurrence relation.
PCC-CS 404.4 Describe the dynamic-programming paradigm and explain when an
algorithmic design situation calls for it. Also, develop the dynamic
programming algorithms, and analyze it to determine its computational
complexity.
PCC-CS 404.5 Explain the ways to analyze randomized algorithms (expected running
time, probability of error).
PCC-CS 404.6 Explain what an approximation algorithm is. Compute the
approximation factor of an approximation algorithm (PTAS and FPTAS).
Biology
Code: BSC 401
Contacts: 2L+1T
Theory: 3 hrs./ Week
Credit Points: 3
Objective:
1. Bring out the fundamental differences between science and engineering.
30 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
2. Discuss how biological observations of 18th Century that lead to major discoveries.
Pre-Requisite:
1. Basic knowledge of Physics ,Chemistry and mathematics
31 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
existed on earth Enzymology: How to monitor enzyme catalysed
reactions. How does an enzyme catalyse reactions? Enzyme
classification. Mechanism of enzyme action. Discuss at least two
examples. Enzyme kinetics and kinetic parameters. Why should we
know these parameters to understand biology? RNA catalysis.
6 Information Transfer:The molecular basis of coding and decoding 4
genetic information is universal
Molecular basis of information transfer. DNA as a genetic material.
Hierarchy of DNA structure- from single stranded to double helix
to nucleosomes. Concept of genetic code. Universality and
degeneracy of genetic code. Define gene in terms of
complementation and recombination
7 Macromolecular analysis: How to analyse biological processes at 5
the reductionist level Proteins- structure and function. Hierarch in
protein structure. Primary secondary, tertiary and quaternary
structure. Proteins as enzymes, transporters, receptors and
structural elements.
8 Metabolism: The fundamental principles of energy transactions are 4
the same in physical and biological world. Thermodynamics as
applied to biological systems. Exothermic and endothermic versus
endergonic and exergoinc reactions. Concept of Keqand its relation
to standard free energy. Spontaneity. ATP as an energy currency.
This should include the breakdown of glucose to CO2 + H2O
(Glycolysis and Krebs cycle) and synthesis of glucose from CO2 and
H2O (Photosynthesis). Energy yielding and energy consuming
reactions. Concept of Energy charge
9 Microbiology Concept of single celled organisms. Concept of 3
species and strains. Identification and classification of
microorganisms. Microscopy.
Ecological aspects of single celled organisms. Sterilization and
media compositions. Growth kinetics.
32 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
BSC 401.4 Discuss different aspects of molecular biology including DNA Replication,
Transcription and RNA Translation
BSC 401.5 Identify and classify microorganisms
BSC 401.6 Integrate biological principles for developing next generation technologies
Environmental Sciences
Code: MC-401
Contacts: 1L
Theory: 1hrs. /week
Objective:
1. Be able to understand the natural environment and its relationships with human
activities.
2. Be able to apply the fundamental knowledge of science and engineering to assess
environmental and health risk.
3. Be able to understand environmental laws and regulations to develop guidelines
and procedures for health and safety issues.
4. Be able to solve scientific problem-solving related to air, water, noise & land
pollution.
Pre-Requisite:
1. Basic knowledge of Environmental science
33 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Greenhouse effects: Definition, impact of greenhouse gases on the
global climate and consequently on sea water level, agriculture and
marine food. Global warming and its consequence, Control of
Global warming. Lapse rate: Ambient lapse rate Adiabatic lapse
rate, atmospheric stability, temperature inversion (radiation
inversion). Atmospheric dispersion: Maximum mixing depth,
ventilation coefficient, effective stack height, smokestack plumes.
Definition of pollutants and contaminants, Photochemical smog
and London smog. Depletion Ozone layer: CFC, destruction of
ozone layer by CFC, impact of other green-house gases, effect of
ozone modification. Control measure (ESP. cyclone separator, bag
house, catalytic converter, scrubber (ventury), Statement with brief
reference).
3. Hydrosphere, Hydrological cycle and Natural water. Pollutants of 4
water, their origin and effects: Oxygen demanding wastes,
pathogens, nutrients, Salts, thermal application, heavy metals,
pesticides, volatile organic compounds. River/Lake/ground water
pollution: River: DO, 5-day BOD test, Seeded BOD test, BOD
reaction rate constants, Effect of oxygen demanding wastes on
river [deoxygenation, reaeration], COD, Oil, Greases, ph. Lake:
Eutrophication [Definition, source and effect]. Ground water:
Aquifers, hydraulic gradient, ground water flow (Definition only)
Standard and control: Waste water standard [BOD, COD, Oil,
Grease], Water Treatment system [coagulation and flocculation,
sedimentation and filtration, disinfection, hardness and alkalinity,
softening] Waste water treatment system, primary and secondary
treatments [Trickling filters, rotating biological contractor,
Activated sludge, sludge treatment, oxidation ponds] tertiary
treatment definition. Water pollution due to the toxic elements and
their biochemical effects: Lead, Mercury, Cadmium, and Arsenic.
4. Lithosphere; Internal structure of earth, rock and soil. Solid Waste: 3
Municipal, industrial, commercial, agricultural, domestic,
pathological and biomedical waste, hazardous solid wastes;
Recovery and disposal method.
Definition of noise, effect of noise pollution, noise classification
[Transport noise, occupational noise, neighborhood noise].
Definition of noise frequency, noise pressure, noise intensity, noise
threshold limit value, equivalent noise level, L10 (18hr Index) ,n
Ld. Noise pollution control.
Course Outcomes:
34 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
On completion of the course students will be able to
MC-401.1 Understand the concept of environment and elaborate the organization of
ecosystem & its components
MC-401.2 Analyze the impact of population growth on environment and interpret the
overall problems, prevention and sustainable development
MC-401.3 Identify, understand, and distinguish the different environmental pollution
associated to environmental degradation
MC-401.4 Design, formulate and develop different control mechanisms, devices to
minimize the environmental pollution
MC-401.5 Identify, analyze the industrial activities on environmental pollution and its
control mechanism
MC-401.6 Adapt, illustrate the general idea about the laws, rules and regulations
concerning environmental issues
Pre-Requisite:
1 Digital Design concepts - Boolean algebra, Logic Gates, Combinational and
Sequential Circuits etc.
2 Foundation of Computer system design
Laboratory Experiments
1. Implement the logic gates (AND, OR, XOR, NOT, NAND, NOR, XNOR) in VHDL using
Data Flow Architecture.
2. Implement the logic gates (AND, OR, XOR, NOT, NAND, NOR, XNOR) in VHDL using
Behavioural Architecture.
3. Design and implement the Half Adder circuit in VHDL using Data Flow and
Behavioural Architecture.
4. Design and implement Full Adder circuit in VHDL using Data Flow and
Behavioural Architecture.
5. Design and implement the Half Subtractor & Full Subtractor circuit in VHDL using
Data Flow and Behavioural Architecture.
35 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
11. Design and implement an ALU (8 bit) using Data Flow architecture
12. Design and implement a full adder using half adder using structural architecture
13. Design and implement 4 bit parity generator using XOR Gate using structural
architecture.
14. Design and implement 8:1 MUX using 4:1 MUX using structural architecture
Course Outcomes:
On completion of the course students will be able to
PCC-CS492.1 Apply the knowledge of all basic logic gates and implement various basic
logic circuits such as multiplexer, decoder, encoder and comparator. To
demonstrate the results of logic and timing simulations and to use these
simulation results to debug digital systems.
PCC-CS492.2 Illustrate minimization techniques to solve adder, subtractor, and
composite unit and extend various logic gates to design arithmetic logic
circuits.
PCC-CS492.3 Demonstrate parallel adder, CLA (Carry Look-Ahead Adder) and test CLA
which is relevant to the professional engineering practice.
PCC-CS492.4 Select multiplexer unit to design composite ALU and make use of ALU for
modern engineering and IT tools and estimate decoder and encoder
design practice.
PCC-CS492.5 To develop skills, techniques and learn state-of-the art engineering tools
(such as VHDL, Altera Max Plus II, Xilinx ISE simulator etc) to design,
implement and test modern day digital systems on FPGAs.
PCC-CS492.6 To explain Xilinx Foundation tools and Hardware Description Language
(VHDL). To Understand through hands-on experimentation the Xilinx
tools for FPGA design as well as the basics of VHDL design and simulate
digital systems.
Pre-Requisite:
1. Programming Fundamentals
Laboratory Experiments:
1. Assignments on basic programming. Decision control, Loop Control, Array.
2. Assignments on class, constructor, overloading, inheritance, overriding.
3. Assignments on Strings.
4. Assignments on developing abstract class interfaces- multiple inheritance,
36 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
extending interfaces
5. Assignments on creating and accessing packages
6. Assignments on multithreaded programming, Exception handling programming.
7. Assignments on AWT and Event handling programming
Note: Use Java for programming
Course Outcomes:
On completion of the course students will be able to
PCC-CS493.1 Interpret the principal of Object Oriented Programming (OOP) using
programming syntaxes of JAVA programming language by analyzing the
problems.
PCC-CS493.2 Identify the requirements to the solution of complex engineering
problems by proper analysis of classes with their relationships and
interpretation of data/objects.
PCC-CS493.3 Construct computer programs to implement the major OOP concepts
related to Class & Object, Polymorphism, Inheritance, Interface,
Exception Handling, Multi-processing (Thread), etc using JAVA coding
ethics by making use of modern tools like Notepad++, Netbeans or
Eclipse IDE.
PCC-CS493.4 Develop Graphical User Interfaces using Applet, Swing, Layout manager,
Jbutton class with action listeners, etc.
PCC-CS493.5 Build small OOP based applications working individually or in a team
with proper documentations following the professional OOP based
engineering solution techniques.
PCC-CS493.6 Determine the need for different OOP components hands-on to produce
huge distributed data driven software from the implementation point of
view to contribute to lifelong learning.
Pre-Requisite:
1. Pre-requisites as in PCC-CS301
Laboratory Experiments:
Divide and Conquer:
1. Implement Binary Search using Divide and Conquer approach Implement Merge
Sort using Divide and Conquer approach
2. Implement Quick Sort using Divide and Conquer approach Find Maximum and
Minimum element from an array of integer using Divide and Conquer approach
37 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
3. Find the minimum number of scalar multiplication needed for chain of matrix
4. Implement all pair of Shortest path for a graph (Floyed- Warshall Algorithm)
Implement Traveling Salesman Problem
5. Implement Single Source shortest Path for a graph ( Dijkstra , Bellman Ford
Algorithm
Brunch and Bound:
6. Implement 15 Puzzle Problem
Backtracking:
7. Implement 8 Queen problem
8. Graph Coloring Problem
Hamiltonian Problem
Greedy method:
9. Knapsack Problem
Job sequencing with deadlines
10. Minimum Cost Spanning Tree by Prim's Algorithm
Minimum Cost Spanning Tree by Kruskal's Algorithm
Graph Traversal Algorithm:
11. Implement Breadth First Search (BFS)
Implement Depth First Search (DFS)
Course Outcomes:
On completion of the course students will be able to
PCC-CS 494.1 Recall and solve asymptotic notation, Time complexity of iterative and
recursive algorithm.
PCC-CS 494.2 Explain divide and conquer method to implement binary search, merge
sort, quick sort.
PCC-CS 494.3 Demonstrate principal of optimality and implement chain matrix
multiplication, all pair shortest path, Prim’s algorithm, Kruskal’s
algorithm, Dijkstra algorithm to minimize output.
PCC-CS 494.4 Implement knapsack algorithm, job sequencing with deadline to
maximize output.
PCC-CS 494.5 Apply backtracking method to solve n-queens and n-coloring problems.
PCC-CS 494.6 Design and Develop algorithms for different complex problems such as
NP problems, and design and develop CDP, VC problem.
38 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
CSE
Third Year - Fifth Semester
(Semester V)
Compiler Design
Code: ESC 501
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To understand and list the different stages in the process of compilation.
2. Identify different methods of lexical analysis
3. Design top-down and bottom-up parsers
4. Identify synthesized and inherited attributes
5. Develop syntax directed translation schemes
6. Develop algorithms to generate code for a target machine
Pre-Requisite:
1. Knowledge of automata theory, context free Languages
2. Computer architecture
3. Data structures and simple graph algorithms, logic or algebra
39 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
4. Syntax directed translation: Syntax director definitions, 4
Construction of syntax trees, Bottom-up evaluation of S attributed
definitions, L attributed definitions, Bottom-up evaluation of
inherited attributes.
5. Type checking: Type systems, Specification of a simple type 4
checker, Equivalence of type expressions, Type conversions.
6. Run time environments: Source language issues (Activation trees, 5
Control stack, scope of declaration, Binding of names), Storage
organization (Subdivision of run-time memory, Activation
records), Storage allocation strategies, Parameter passing (call by
value, call by reference, copy restore, call by name), Symbol tables,
dynamic storage allocation techniques.
7. Intermediate code generation: Intermediate languages, 4
Graphical representation, Three-address code, Implementation of
three address statements (Quadruples, Triples, Indirect triples).
8. Code optimization: Introduction, Basic blocks & flow graphs, 5
Transformation of basic blocks, Dag representation of basic blocks,
The principle sources of optimization, Loops in flow graph,
Peephole optimization.
9. Code generations: Issues in the design of code generator, a simple 4
code generator, Register allocation & assignment.
Course Outcomes:
On completion of the course students will be able to
ESC 501.1 Remember the fundamentals of Automata Theory and explain various
phases of a compiler.
ESC 501.2 Analyse the roll of the lexical analyser and design token recognizer using
modern tools (LEX).
ESC 501.3 Compare Top-down and Bottom-up parsing Techniques and construct
parser using YACC.
ESC 501.4 Determine intermediate code and then optimize the code.
ESC 501.5 Discuss design issues of a simple code generator, register allocation and
assignment.
ESC 501.6 Design and develop a simple Compiler.
Objective:
1. To understand the different issues involved in the design and implementation of a
database system.
40 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
2. To study the physical and logical database designs, database modelling, relational,
hierarchical, and network models.
3. To understand and use data manipulation language to query, update, and manage a
database
4. To develop an understanding of essential DBMS concepts such as: database
security, integrity, concurrency, distributed database, and intelligent database,
Client/Server (Database Server), Data Warehousing.
5. To design and build a simple database system and demonstrate competence with
the fundamental tasks involved with modelling, designing, and implementing a
DBMS.
6. To understand the different issues involved in the design and implementation of a
database system.
Pre-Requisite:
1. Proper understanding of data structures and algorithms
2. Understanding of set theory
3. Basic programming knowledge
41 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
7. Transaction processing: Concurrency control, ACID property, 7
Serializability of scheduling (conflict and view), Locking (2PL)and
timestamp-based schedulers, Multiversion and optimistic
Concurrency Control schemes, Database recovery techniques.
Course Outcomes:
On completion of the course students will be able to
PCC- CS 501.1 Define and understand the fundamentals of Data base management
System and traditional file system.
PCC- CS 501.2 Understand and explain the concepts of relational database
management system.
PCC- CS 501.3 Make use ofthe tools to implement Entity Relationship diagrams.
PCC- CS 501.4 Utilize andtake part inthenormalization of the real world database to
remove redundancies and able to apply the conversion of one Normal
Form to Higher Normal Form.
PCC- CS 501.5 Elaborate the importance and rule on database management system
concepts to minimize conflict in concurrent transactions.
PCC- CS 501.6 Discussthe importance of Database management system for storage of
data in various formats and able to judge the environmental, societal
and market issues specific to software development.
Operating Systems
Code: PCC-CS502
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To learn the mechanisms of OS to handle processes and threads and their
communication.
2. To learn the mechanisms involved in memory management in contemporary OS.
3. To gain knowledge on distributed operating system concepts that includes
architecture, Mutual exclusion algorithms, deadlock detection algorithms and
agreement protocols.
4. To know the components and management aspects of concurrency management.
42 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Pre-Requisite:
1. Computer Organization &Architecture
43 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
6. I/O Hardware: I/O devices, Device controllers, Direct memory 6
access Principles of I/O Software: Goals of Interrupt handlers,
Device drivers, Device independent I/O software, Secondary-
Storage Structure: Disk structure, Disk scheduling algorithms.
File Management: Concept of File, Access methods, File types, File
operation, Directory structure, File System structure, Allocation
methods (contiguous, linked, indexed), Free-space management
(bit vector, linked list, grouping), directory implementation (linear
list, hash table), efficiency and performance.
Disk Management: Disk structure, Disk scheduling - FCFS, SSTF,
SCAN, C-SCAN, Disk reliability, Disk formatting, Boot-block, Bad
blocks
Course Outcomes:
On completion of the course students will be able to
PCC- CS502.1 Illustrate the resource-management by the Operating System and
describe the basic principles used in the design of modern Operating
Systems.
PCC- CS502.2 Apply various CPU scheduling algorithms for any given problem and
outline the needs and applications of process synchronization.
PCC- CS502.3 Identify the issues in deadlock in terms of avoiding, preventing and
recovering the same.
PCC- CS502.4 Elaborate the different schemes used in memory management including
paging and segmentation.
PCC- CS502.5 Analyze various file and disk management strategies.
PCC- CS502.6 Justify the issues in I/O management and security.
44 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Theory:3 hrs./ Week
Credit Points: 3
Objective:
1. To provide solid foundation on the fundamentals of microprocessors and
applications
2. To know the Assembly language programming
3. To gain knowledge about interfacing the external devices to the processor
according to the user requirements thus, enabling to create novel products and
solutions for real time problems
4. To understand the architecture of 8085 and 8051
Pre-Requisite:
1. basic digital integrated circuits - AND/OR/NOT gates, latches, demultiplexor.
2. basic structure of a processor - arithmetic registers, address registers, basic
addressing modes.
45 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
9. 8086 Microprocessor –K Ayala (Cengage learning)
10. The 8085 Microprocessor, Architecture, Programming and Interfacing- K Uday
Kumar, B .S Umashankar (Pearson)
11. The X-86 PC Assembly language, Design and Interfacing - Mazidi, Mazidi and
Causey (PEARSON)
12. The 8051 microcontroller and Embedded systems - Mazidi, Mazidi and McKinley
(PEARSON)
13. Microprocessors – The 8086/8088, 80186/80386/80486 and the Pentium
family – N. B. Bahadure (PHI). 6. The 8051 microcontrollers – Uma Rao and
Andhe Pallavi (PEARSON).
Course Outcomes:
On completion of the course students will be able to
PCC- CS503.1 Demonstrate architectures of 8085 and 8086 microprocessors.
PCC- CS503.2 Explain and illustrate the instruction set of 8085 microprocessor.
PCC- CS503.3 List and solve some application programs using 8085 assembler.
PCC- CS503.4 Discuss the interrupt structure of 8085 and 8086.
PCC- CS503.5 Explain 8255 PPI, 8251 USART, 8237 DMA controller and 8259
Programmable Interrupt Controller.
PCC- CS503.6 Demonstrate the basic knowledge of 8051 microcontroller.
Objective:
1. To make the students understand the fundamental principles and practices of
management, its function, behavior, hierarchy and importance in an organization.
2. To emphasize the different functional areas of management: finance, production,
marketing, and human resource.
3. To address the student the role of information technology in management
46 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
1. Introduction System- concept, definition, types, parameters, 6
variables and behavior. Management – definition and functions.
Organization structure:
i. Definition.
ii. Goals.
iii. Factors considered in formulating structure.
iv. Types.
v. Advantages and disadvantages.
vi. Applications.
Concept, meaning and importance of division of labor, scalar &
functional processes, span of control, delegation of authority,
centralization and decentralization in industrial management.
Organizational culture and climate – meaning, differences and
factors affecting them.
Moral-factors affecting moral. Relationship between moral and
productivity.
Job satisfaction- factors influencing job satisfaction.
Important provisions of factory act and labor laws.
2. Critical Path Method (CPM) and Programme Evaluation 8
Review Technique (PERT):
47 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
3. Materials Management: 6
Material management-definition, functions, importance,
relationship with other departments.
Purchase - objectives, purchasing systems, purchase procedure,
terms and forms used in purchase department.
Storekeeping- functions, classification of stores as centralized and
decentralized with their advantages, disadvantages and
application in actual practice.
Functions of store, types of records maintained by store, various
types and applications of storage equipment, need and general
methods for codification of stores.
Inventory control:
i. Definition.
ii. Objectives.
iii. Derivation for expression for Economic Order Quantity
(EOQ) and numeric examples.
iv. ABC analysis and other modern methods of analysis.
v. Various types of inventory models such as Wilson’s
inventory model, replenishment model and two bin
model. (Only sketch and understanding, no derivation.).
3.6 Material Requirement Planning (MRP) - concept,
applications and brief details about software packages
available in market.
4. Production planning and Control (PPC): Types and examples of 8
production.
i. Need and importance.
ii. Functions.
iii. Forms used and their importance.
iv. General approach for each type of production.
Scheduling- meaning and need for productivity and utilisation.
Gantt chart- Format and method to prepare.
Critical ratio scheduling-method and numeric examples.
Scheduling using Gantt Chart (for at least 5-7 components having
5-6 machining operations, with processes, setting and operation
time for each component and process, resources available,
quantity and other necessary data), At least two examples. 4.7
Bottlenecking- meaning, effect and ways to reduce.
5. Value Analysis (VA) and Cost Control: 5.1 VA-definition, terms 4
used, process and importance. 5.2 VA flow diagram. DARSIRI
method of VA. Case study of VA-at least two. Waste-types, sources
and ways to reduce them. Cost control-methods and important
guide lines.
6. Recent Trends in IM: ERP (Enterprise resource planning) - 4
concept, features and applications. Important features of MS
Project. Logistics- concept, need and benefits. Just in Time (JIT)-
concept and benefits. Supply chain management-concept and
benefits.
48 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Text book and Reference books:
1. L.S. Srinath– “CPM & PERT principles and Applications”.
2. Buffa – “Modern Production Management”.
3. N. Nair – “Materials Management”.
4. O. P. Khanna – “Industrial Engineering & Management”.
5. Mikes – “Value Analysis”.
6. S.C. Sharma, “Engineering Management – Industrial Engineering & Management”,
Khanna Book Publishing Company, New Delhi
Course Outcomes:
On completion of the course students will be able to
HSMC-501.1 Interpret given organization structure, culture, climate and major
provisions of factory acts and laws.
HSMC-501.2 Explain material requirement planning and store keeping procedure.
HSMC-501.3 Plot and analyse inventory control models and techniques.
HSMC-501.4 Prepare and analyse CPM and PERT for given activities.
HSMC-501.5 List and explain PPC functions.
HSMC-501.6 Understand the concept of Value Analysis and cost control by application
of JIT and ERP
Artificial Intelligence
Code: PEC-CS501A
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To provide a strong foundation of fundamental concepts in Artificial Intelligence
2. To provide a basic exposition to the goals and methods of Artificial Intelligence
3. To enable the student to apply these techniques in applications which involve
perception, reasoning and learning
Pre-Requisite:
1. Discrete Mathematics
2. Understanding of Probability
3. Basic understanding of Programming Languages
49 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
1. Introduction [2] 6
Overview of Artificial intelligence- Problems of AI, AI technique, Tic
- Tac - Toe problem.
Intelligent Agents [2]
Agents & environment, nature of environment, structure of agents,
goal based agents, utility based agents, learning agents.
Problem Solving [2]
Problems, Problem Space & search: Defining the problem as state
space search, production system, problem characteristics, issues in
the design of search programs.
2. Search techniques [5] 13
Solving problems by searching: problem solving agents, searching
for solutions; uniform search strategies: breadth first search, depth
first search, depth limited search, bidirectional search, comparing
uniform search strategies.
Heuristic search strategies [5]
Greedy best-first search, A* search, memory bounded heuristic
search: local search algorithms & optimization problems: Hill
climbing search, simulated annealing search, local beam search,
genetic algorithms; constraint satisfaction problems, local search
for constraint satisfaction problems.
Adversarial search [3]
Games, optimal decisions & strategies in games, the minimax
search procedure, alpha-beta pruning, additional refinements,
iterative deepening.
3. Knowledge & reasoning [3] 3
Knowledge representation issues, representation & mapping,
approaches to knowledge representation, issues in knowledge
representation.
4. Using predicate logic [2] 6
Representing simple fact in logic, representing instant & ISA
relationship, computable functions & predicates, resolution,
natural deduction.
Probabilistic reasoning [4]
Representing knowledge in an uncertain domain, the semantics of
Bayesian networks, Dempster-Shafer theory, Fuzzy sets & fuzzy
logics.
5. Natural Language processing [2] 6
Introduction, Syntactic processing, semantic analysis, discourse &
pragmatic processing.
Learning [2]
Forms of learning, inductive learning, learning decision trees,
explanation based learning, learning using relevance information,
neural net learning & genetic learning.
Expert Systems [2]
Representing and using domain knowledge, expert system shells,
and knowledge acquisition.
50 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Text book and Reference books:
1. Artificial Intelligence, Ritch & Knight, TMH
2. Artificial Intelligence A Modern Approach, Stuart Russel Peter Norvig Pearson
3. Introduction to Artificial Intelligence & Expert Systems, Patterson, PHI
4. Poole, Computational Intelligence, OUP
5. Logic & Prolog Programming, Saroj Kaushik, New Age International
6. Expert Systems, Giarranto, VIKAS
Course Outcomes:
On completion of the course students will be able to
PEC-CS 501A.1 Explain the modern tools of Artificial Intelligence (AI) and knowledge
representation models.
PEC-CS 501A.2 Determine the domain-specific problems solving methods using AI
based algorithms and techniques.
PEC-CS 501A.3 Evaluateknowledge based representation and learning methods for
broad areas of state-of-the-art technological growth.
PEC-CS 501A.4 Formulate the solution requirements of complex engineering problems
in multidisciplinary application fields.
PEC-CS 501A.5 Develop and access some current applications of AI in the fields of
Expert Systems, Robotics, Machine Learning and others.
PEC-CS 501A.6 Design the efficient solutions using different AI based schemes, and
relate with technological advancement for future learning.
Objective:
1. To make students know about the Parallelism concepts in Programming
2. To introduce the advanced processor architectures to the students.
3. To study about data flow computer architectures
4. To make the students know about the importance of multiprocessor and
multicomputers.
Pre-Requisite:
1. Basic understanding of digital Electronics
2. A basic understanding of Computer Organisation and Architecture or
Microprocessors
51 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
1. Computer Architecture and Organization-Review, Fundamentals 6
of Computer Design, Technology Trends Cost Performance
Analysis
Parallel Processing Architectures- Taxonomy- SISD, MISD,
SIMD,MIMD, PRAM models
2. Data and Resource Dependencies, Program Partitioning and 10
Scheduling, Control Flow vs. Data Flow
Network topologies-Static, Dynamic, Types of Networks
RISC vs. CISC, Memory Hierarchy, Virtual Memory
3. Concepts of Pipelining, Instruction Pipelining, dynamic 12
pipelining, arithmetic pipelines.
Multiprocessors- Multistage Networks, Cache Coherence,
Synchronization, Message- passing
Vector Processing Principles- Instruction types, Compound,
Vector Loops, Chaining
4. Array Processors- Structure, Algorithms 11
Data Flow Architecture- Graphs. Petri Nets, Static and Dynamic
DFA, VLSI Computations
Parallel Programming Models, Languages, Compilers
Course Outcomes:
On completion of the course students will be able to
PEC-CS 501B.1 Choose the attributes of computer architecture and elaborate the
performance of a computer using various parameters.
PEC-CS 501B.2 Explain different parallel processing architectures.
PEC-CS 501B.3 Compare control flow vs. data flow, data dependencies vs. resource
dependencies, RISC vs. CISC, static vs. dynamic network topologies, etc.
PEC-CS 501B.4 Demonstrate the pipelining technique and its related issues.
PEC-CS 501B.5 Discuss basic knowledge related to the vector processing, array
processors and multiprocessors.
PEC-CS 501B.6 Demonstrate the data flow architecture and propose parallel
programming models.
Computer Graphics
Code: PEC-CS501C
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
52 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Objective:
1. The main objective of the course is to introduce students with fundamental
concepts and theory of computer graphics.
2. It presents the important drawing algorithm, polygon fitting, clipping and 2D
transformation curves and an introduction to 3D transformation.
3. To make the students know about various curve and surface representation
methods
4. To make the students understand about various hidden surface removal
algorithms, and lighting and shading models.
Pre-Requisite:
1. Knowledge of data structures and algorithm is preferable
2. Knowledge of Linear Algebra
53 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
5. Curves [3L]: Curve representation, surfaces, designs, Bezier 6
curves, B-spline curves, end conditions for periodic B-spline
curves, rational B-spline curves.
Hidden surfaces [3L]: Depth comparison, Z-buffer algorithm, Back
face detection, BSP tree method, the Painter’s algorithm, scan-line
algorithm; Hidden line elimination, wire frame methods , fractal -
geometry.
Colour & shading models [2L]: Light & colour model;
interpolative shading model; Texture.
Introduction to Ray-tracing [3L]: Human vision and colour,
Lighting, Reflection and transmission models.
Course Outcomes:
On completion of the course students will be able to
PEC-CS 501C.1 Outline computer graphics system, display devices and various
application areas of graphics.
PEC-CS 501C.2 Develop scan conversion algorithms for line, circle and ellipse with
examples.
PEC-CS 501C.3 Demonstrate and illustrate 2D and 3D transformation operations such
as translation, rotation, scaling, etc.
PEC-CS 501C.4 Analyse and model any kind of 3D objects using viewing, clipping and
projection techniques.
PEC-CS 501C.5 Apply various curve and surface representation methods such as B-
Spline, Bezier, etc.
PEC-CS 501C.6 Demonstrate and discuss various hidden surface removal algorithms,
and lighting and shading models.
Constitution of India
Code: MC-CS501
Contacts: 2L
Theory: 1 hrs. / Week
Credit Points: 0
Objective:
1. The main objective of the course is to introduces students to the Constitution of
India
2. To make the students understand about the preamble and the basic structures of
the Constitution, the fundamental rights, duties and the directive principles of state
policies
54 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Course Outcomes:
On completion of the course students will be able to
MC- CS501.1 Know the importance of Indian Constitution and fundamental rights and
duties of citizens of India
MC- CS501.2 Know about the administration and modus operandi of Central
Government
MC- CS501.3 Know about the administration and modus operandi of State
Governments
MC- CS501.4 Know about the administration and modus operandi of local district
administrators.
MC- CS501.5 Know about the administration and modus operandi of Election
Commission of India
MC- CS501.6 Know about the various Socio-Political Activities and various
functionaries involved in the system.
55 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Objective:
1. To facilitate the students with the concepts of Indian traditional knowledge and to
make them understand the Importance of roots of knowledge system.
2. To make the students understand the traditional knowledge and analyse it and
apply it to their day to day life.
56 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Course Outcomes:
On completion of the course students will be able to
MC- CS501.1 Know the importance of essence of Indian knowledge tradition of
citizens of India.
MC- CS501.2 Identify the concept of Traditional knowledge and its importance.
MC- CS501.3 Explain the need and importance of protecting traditional knowledge.
MC- CS501.4 Illustrate the various enactments related to the protection of traditional
knowledge.
MC- CS501.5 Interpret the concepts of Intellectual property to protect the traditional
knowledge.
MC- CS501.6 Explain the importance of Traditional knowledge in Agriculture and
Medicine.
Laboratory Experiments:
Structured Query Language
1. Creating Database
Creating a Database
Creating a Table
Specifying Relational Data Types
Specifying Constraints
Creating Indexes
2. Table and Record Handling
INSERT statement
Using SELECT and INSERT together
DELETE, UPDATE, TRUNCATE statements
DROP, ALTER statements
3. Retrieving Data from a Database
The SELECT statement
Using the WHERE clause
Using Logical Operators in the WHERE clause
Using IN, BETWEEN, LIKE , ORDER BY, GROUP BY and HAVING
Clause
5. Using Aggregate Functions
Combining Tables Using JOINS
7. Subqueries
57 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
4. Database Management
Creating Views
Creating Column Aliases
Creating Database Users
Using GRANT and REVOKE
Cursors in Oracle PL / SQL
Writing Oracle PL / SQL Stored Procedures
Course Outcomes:
On completion of the course students will be able to
PCC- CS591.1 Outline the underlying concepts of database technologies.
PCC- CS591.2 Define and demonstrate DBMS architecture, schema, instance, DDL,
DML.
PCC- CS591.3 Experiment with SQL to construct and apply to execute database query
using SQL DML/DDL commands.
PCC- CS591.4 List and test theintegrity constraints on a database using a RDBMS and
discover relationships.
PCC- CS591.5 Explain Programming in PL/SQL with stored procedures, cursors,
packages..
PCC- CS591.6 Compose andimprove/solve the need of DBMS tool for the use of
modern software development.
58 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
4. Semaphore: programming with semaphores (use functions semctl, semget,
semop, set_semvalue, del_semvalue, semaphore_p, semaphore_v).
5. POSIX Threads :programming with pthread functions (viz. pthread_create,
pthread_join, pthread_exit, pthread_attr_init, pthread_cancel)
6. Inter-process communication: Pipes (use functions pipe, popen, pclose),
named pipes (FIFOs, accessing FIFO), message passing & shared memory (IPC
version V).
Course Outcomes:
On completion of the course students will be able to
PCC- CS592.1 Execute the Linux commands to perform the basic operations related
to process and system.
PCC- CS592.2 Examine shell programs and other programs related to pipes, message
queue etc.
PCC- CS592.3 Demonstrate the execution of the programs like creating new process,
creating orphan process and zombie process based on child-parent
relationship.
PCC- CS592.4 Analyze process synchronization, applying the knowledge of
semaphore and thread.
PCC- CS592.5 Adapt the concept of signals and their uses in process executions.
PCC- CS592.6 Apply the algorithms of CPU scheduling, process synchronization and
process-deadlock, in various fields of research and higher studies.
Pre-Requisite:
Pre-requisites as in ESC-301
Laboratory Experiments:
1 Study of Prewritten programs on 8085 trainer kit using the basic instruction set
(data transfer, Load/Store, Arithmetic, Logical).
Or,
Familiarization with 8085 simulator on PC. Programs using basic instruction set
(data transfer, Load/Store, Arithmetic, Logical) on the simulator.
59 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
2 Table look up
Copying a block of memory
Shifting a block of memory
Packing and unpacking of BCD numbers
Addition of BCD numbers
Binary to ASCII conversion and vice-versa (Using Subroutine Call)
BCD to Binary Conversion and vice-versa
String Matching, Multiplication
3 Program using IN/OUT instructions and 8255 PPI on the trainer kit e.g. subroutine
for delay,
Glowing all the LEDs one by one with particular delay
Reading switch state and glowing LEDs accordingly.
4 Serial communication between two trainer kits
5 Study of Prewritten programs on 8051 Microcontroller Kit using the basic
instruction set (data transfer, Load/Store, Arithmetic, Logical).
Or,
Familiarization with 8051 Simulator on PC. Study of prewritten programs using
basic instruction set (data transfer, Load/Store, Arithmetic, Logical).
Course Outcomes:
On completion of the course students will be able to
PCC- CS593.1 Demonstrate instruction set architecture and assembly language
programming of the 8085 microprocessor.
PCC- CS593.2 Make use of various instructions of 8085 microprocessor and solve some
standard problems using 8085 simulator kits.
PCC- CS593.3 Develop different real-life mini-projects using assembly language
programming.
PCC- CS593.4 Demonstrate modern simulator/kit/programming related to the 8085
microprocessor, 8255 PPI and 8051 microcontroller.
PCC- CS593.5 Explain and design the interfacing of 8085 microprocessor with the
8051 microcontroller.
PCC- CS593.6 Justify prewritten programs on 8051 microcontroller simulator using
the basic instruction set.
60 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Syllabus for B. Tech in Computer Science & Engineering
CSE
Third Year - Sixth Semester
(Semester VI)
Software Engineering
Code: PCC-CS 601
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. This course introduces the concepts and methods required for the construction of
large software intensive systems. It aims to develop a broad understanding of the
discipline of software engineering.
2. It seeks to complement this with a detailed knowledge of techniques for the
analysis and design of complex software intensive systems. It aims to set these
techniques in an appropriate engineering and management context.
Pre-Requisite:
1. C Programming, Java or C++ programming
Course Outcomes:
On completion of the course students will be able to
PCC- CS601.1 Explain the principles of software engineering in the context of social,
ethical, legal, economic and environmental concerns by building
applicable solutions.
PCC- CS601.2 Identify and classify the customer requirements to the solution of
complex engineering problems by proper analysis and interpretation of
data and processes.
PCC- CS601.3 Estimate software matrices like size, effort and cost, software reliability
and quality, etc and apply project management techniques to maximize
the productivity.
PCC- CS601.4 Design various components of software using DFD, ERD,
Modularization, Use-case diagram, Class diagram, Sequence diagram,
etc. following the professional software design guidelines.
PCC- CS601.5 Develop and Test software products following standard coding and
testing guidelines.
PCC- CS601.6 Asses the utility of various components of software development
process and to combine them to produce different types of software to
adapt in the software industries in future.
Computer Networks
Code: PCC-CS602
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To develop an understanding of modern network architectures from a design
and performance perspective.
2. To introduce the student to the major concepts involved in wide-area networks
(WANs), local area networks (LANs) and Wireless LANs (WLANs).
3. To provide an opportunity to do network programming.
4. To provide a WLAN measurement ideas.
62 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Pre-Requisite:
1. Basic mathematics principal
2. Basic understanding of computer fundamentals
Course Outcomes:
On completion of the course students will be able to
PCC- CS602.1 Explain data communication system, components and the purpose of
layered architecture.
PCC- CS602.2 Illustrate the functionalities of each layer of OSI and TCP/IP reference
model including their associated protocols.
PCC- CS602.3 Apply the thoughts toward building the networks, secure devices in
virtue of analyzing data.
63 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PCC- CS602.4 Support the growing demand of skilled people in the field of network
and system administration.
PCC- CS602.5 Justify today’s market of digital economy which is very much
dependent on computer network skill to provide services in the field of
finance, education, transportation, manufacturing, healthcare, retail
and so on.
PCC- CS602.6 Analyzethe requirements of enterprises or global corporations to be
placed there.
Machine Learning
Code: PCC-CS603
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Pre-Requisite:
1. Basic understanding of Linear algebra, Trigonometry, Statistics, probability
2. Python Programming
Objective:
1. To learn the concept of how to learn patterns and concepts from data without
being explicitly programmed
2. To design and analyses various machine learning algorithms and techniques with
a modern outlook focusing on recent advances.
3. Explore supervised and unsupervised learning paradigms of machine learning.
4. To explore Deep learning technique and various feature extraction strategies.
64 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
2. Unsupervised Learning 6
Clustering: K-means/Kernel K-means
Dimensionality Reduction: PCA and kernel PCA
Matrix Factorization and Matrix Completion
Generative Models (mixture models and latent factor
models)
3. Unit 3 5
Evaluating Machine Learning algorithms and Model Selection,
Introduction to Statistical Learning Theory, Ensemble Methods
(Boosting, Bagging, Random Forests)
4. Unit 4 8
Sparse Modeling and Estimation, Modeling Sequence/Time-
Series Data, Deep Learning and Feature Representation Learning.
5. Unit 5 8
Scalable Machine Learning (Online and Distributed Learning) A
selection from some other advanced topics, e.g., Semi-supervised
Learning, Active Learning, Reinforcement Learning, Inference in
Graphical Models, Introduction to Bayesian Learning and
Inference.
6. Unit 6: Recent trends in various learning techniques of machine 4
learning and classification methods.
References:
1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical
Learning, Springer 2009 (freely available online)
3. Christopher Bishop, Pattern Recognition and Machine Learning, Springer, 2007
4. Dr. Rajiv Chopra, Machine Learning, Khanna Publishing House, 2018
Advanced Algorithms
Code: PEC-CS601 A
Contact: 3L
65 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. Introduce students to the advanced methods of designing and analysing
algorithms.
2. The student should be able to choose appropriate algorithms and use it for a
specific problem.
3. To familiarize students with basic paradigms and data structures used to solve
advanced algorithmic problems.
4. Students should be able to understand different classes of problems concerning
their computation difficulties.
5. To introduce the students to recent developments in the area of algorithmic
design.
Pre-Requisite:
1. Algorithm Design and Analysis
66 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
4. Shortest Path in Graphs: Floyd-Warshall algorithm and 8
introduction to dynamic programming paradigm. More examples
of dynamic programming.
Modulo Representation of integers/polynomials: Chinese
Remainder Theorem, Conversion between base-representation
and modulo-representation. Extension to polynomials.
Application: Interpolation problem.
Discrete Fourier Transform (DFT): In complex field, DFT in
modulo ring. Fast Fourier Transform algorithm. Schonhage-
Strassen Integer Multiplication algorithm
5. Linear Programming: Geometry of the feasibility region and 8
Simplex algorithm.
NP-completeness: Examples, proof of NP-hardness and NP-
completeness.
One or more of the following topics based on time and
interest Approximation algorithms, Randomized Algorithms,
Interior Point Method, Advanced Number Theoretic Algorithm
6. Recent Trands in problem solving paradigms using recent 5
searching and sorting techniques by applying recently proposed
data structures.
Course Outcomes:
On completion of the course students will be able to
PEC- CS601A.1 Analyze the asymptotic performance of algorithms.
PEC- CS601A.2 Write rigorous correctness proofs for algorithms.
PEC- CS601A.3 Demonstrate a familiarity with major algorithms and data structures.
PEC- CS601A.4 Apply important algorithmic design paradigms and methods of
analysis.
PEC- CS601A.5 Synthesize efficient algorithms in common engineering design
situations.
PEC- CS601A.6 Understand on a wide range of advanced algorithmic problems, their
relations and variants, and application to real-world problems.
Distributed Systems
Code: PEC-CS601B
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
67 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
1. To introduce the fundamental concepts and issues of managing large volume of
shared data in a parallel and distributed environment, and to provide insight into
related research problems.
Pre-Requisite:
1. Database Management Systems
Course Outcomes:
On completion of the course students will be able to
PEC- CS601B.1 Learn the principles, architectures, algorithms and programming
models used in distributed systems.
68 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PEC- CS601B.2 Apply knowledge of distributed systems techniques and
methodologies.
PEC- CS601B.3 Explain the design and development of distributed systems and
distributed systems applications.
PEC- CS601B.4 Use the application of fundamental Computer Science methods and
algorithms in the development of distributed systems and distributed
systems applications.
PEC- CS601B.5 Discuss the design and testing of a large software system, and to be
able to communicate that design to others.
PEC- CS601B.6 Design and implement sample distributed systems.
Pre-Requisite:
1. Understanding of mathematics: Sequence and series, algebra of complex numbers,
basic trigonometry.
2. Understanding of Differential and Integral calculus (single variable)
3. Knowledge of Analysis of continuous and discrete signals and systems in the
natural/time domain, convolution, Continuous time Fourier analysis - the continuous
Fourier Series and Fourier transform.
4. Basic circuit analysis - ohm's law, KVL, KCL
69 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
3. Fourier, Laplace and z- Transforms Fourier series representation of 10
periodic signals, Waveform Symmetries, Calculation of Fourier
Coefficients. Fourier Transform, convolution/multiplication and
their effect in the frequency domain, magnitude and phase
response, Fourier domain duality. The Discrete- Time Fourier
Transform (DTFT) and the Discrete Fourier Transform (DFT).
Parseval's Theorem. Review of the Laplace Transform for
continuous time signals and systems, system functions, poles and
zeros of system functions and signals, Laplace domain analysis,
solution to differential equations and system behavior. The z-
Transform for discrete time signals and systems, system functions,
poles and zeros of systems and sequences, z-domain analysis.
4. The Sampling Theorem and its implications. Spectra of sampled 9
signals. Reconstruction: ideal interpolator, zero order hold, first-
order hold. Aliasing and its effects. Relation between continuous
and discrete time systems. Introduction to the applications of signal
and system theory: modulation for communication, filtering,
feedback control systems.
Course Outcomes:
On completion of the course students will be able to
PEC- CS601C.1 Apply the knowledge of linear algebra topics like vector space, basis,
dimension, inner product, norm and orthogonal basis to signals.
PEC- CS601C.2 Analyze the spectral characteristics of continuous-time periodic and a
periodic signals using Fourier analysis.
PEC- CS601C.3 Classify systems based on their properties and determine the response
of LSI system using convolution.
PEC- CS601C.4 Analyze system properties based on impulse response and Fourier
analysis.
PEC- CS601C.5 Apply the Laplace transform and Z- transform for analyze of
continuous-time and discrete-time signals and systems.
70 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PEC- CS601C.6 Understand the process of sampling and the effects of under sampling.
Image Processing
Code: PEC-CS601D
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To introduce the concepts of image processing and basic analytical methods to be
used in image processing.
2. To familiarize students with image enhancement and restoration techniques.
3. To explain different image compression techniques.
4. To introduce segmentation and morphological processing techniques.
Pre-Requisite:
1. Concepts of Digital Signal Processing
71 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
6. Image Segmentation: 6
Point Detection, Line Detection, Edge detection, Combined
detection, Edge Linking & Boundary Detection - Local Processing,
Global Processing via The Hough Transform; Thresholding -
Foundation, Simple Global Thresholding, Optimal Thresholding;
Region Oriented Segmentation - Basic Formulation, Region
Growing by Pixel Aggregation, Region Splitting & Merging.
Course Outcomes:
On completion of the course students will be able to
PEC- CS601D.1 Review the fundamental concepts of a digital image processing
system.
PEC- CS601D.2 Analyze images in the frequency domain using various transforms.
PEC- CS601D.3 Evaluate the techniques for image enhancement and image
restoration.
PEC- CS601D.4 Categorize various compression techniques.
PEC- CS601D.5 Interpret Image compression standards.
PEC- CS601D.6 Interpret image segmentation and representation techniques.
Objective:
1. To learn parallel and distributed algorithms development techniques for shared
memory and message passing models.
2. To study the main classes of parallel algorithms
3. To to study the complexity and correctness models for parallel algorithms.
Pre-Requisite:
1. Basic understandings of distributed systems
2. Knowledge of sequential algorithms and their analysis.
3. Basic knowledge of formal models of computation
72 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
1. UNIT-I: Basic Techniques, Parallel Computers for increase 6
Computation speed and Parallel & Cluster Computing.
2. UNIT-II: Message Passing Technique- Evaluating Parallel 6
programs and debugging, Portioning and Divide and Conquer
strategies examples.
3. UNIT-III: Pipelining- Techniques computing platform, pipeline 8
programs examples.
4. UNIT-IV: Synchronous Computations, load balancing, distributed 10
termination examples, programming with shared memory,
shared memory multiprocessor constructs for specifying
parallelist sharing data parallel programming languages and
constructs, open MP.
5. UNIT-V: Distributed shared memory systems and programming 8
achieving constant memory distributed shared memory
programming primitives, algorithms – sorting and numerical
algorithms.
Course Outcomes:
On completion of the course students will be able to
PEC- CS602A.1 Develop and apply knowledge of parallel and distributed computing
techniques and methodologies.
PEC- CS602A.2 Apply design, development, and performance analysis of parallel and
distributed applications.
PEC- CS602A.3 Use the application of fundamental Computer Science methods and
algorithms in the development of parallel applications.
PEC- CS602A.4 Explain the design, testing, and performance analysis of a software
system, and to be able to communicate that design to others.
PEC- CS602A.5 Analyze modeling and performance of parallel programs.
PEC- CS602A.6 Analyze complex problems with shared memory programming with
OpenMP.
Data Mining
Code: PEC-CS602B
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To introduce students to to the field of data mining (also known as knowledge
discovery from data, or KDD for short).
73 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
2. To study fundamental data mining concepts and techniques for discovering
interesting patterns from data in various applications.
3. To to study techniques for developing effective, efficient, and scalable data
mining tools.
Pre-Requisite:
1. Basic database concepts such as schema, ER model, Structured Query language
Course Outcomes:
After completion of course, students would be:
74 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PEC- CS602 B.1 Define the knowledge of mathematics and science on data warehouse,
building blocks, Data Mart and recall in independent and life-long
learning of data warehouse.
PEC- CS602 B.2 Classify Data warehouse Architecture in the areas of Data acquisition,
Data storage and Information delivery and illustrate the engineering
principles.
PEC- CS602 B.3 Utilize the architecture and infrastructure of Database Software and
model appropriate tools for database software by applying the
knowledge of software development by individual or team.
PEC- CS602 B.4 Analyze Metadata types by functional areas and assume effective
reports on Business metadata by understanding of the engineering
principles of metadata.
PEC- CS602 B.5 Justify effective reports on Data acquisition, Data storage, and
Information delivery and evaluate the ability for life-long learning on
data storage.
PEC- CS602 B.6 Discuss Data mining and Knowledge Discovery Process, based on the
knowledge of mathematics and engineering fundamentals for
developing applications in societal, health, safety, legal and cultural
issues.
Objective:
1. Learn the foundations of Human Computer Interaction.
2. Be familiar with the design technologies for individuals and persons with
disabilities.
3. Be aware of mobile Human Computer interaction.
4. Learn the guidelines for user interface.
Pre-Requisite:
1. Computer Organization & Architecture
Course Outcomes:
On completion of the course students will be able to
PEC- CS602 C.1 Provide an overview of the concepts relating to the design of human-
computer interfaces
in ways making computer-based systems comprehensive, friendly and
usable.
PEC- CS602 C.2 Understand the theoretical dimensions of human factors involved in
the acceptance of
computer interfaces.
PEC- CS602 C.3 Understand the important aspects of implementation of human-
computer interfaces.
PEC- CS602 C.4 Identify the various tools and techniques for interface analysis, design,
and evaluation.
PEC- CS602 C.5 Identify the impact of usable interfaces in the acceptance and
performance utilization of
information systems.
PEC- CS602 C.6 Identify the importance of working in teams and the role of each
member within an interfacedevelopment phase.
Pattern Recognition
Code: PEC-CS602D
Contact: 3L
76 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. Study the fundamental algorithms for pattern recognition
2. To instigate the various classification techniques
3. To originate the various structural pattern recognition and feature extraction
techniques.
Pre-Requisite:
1. Statistics and Probability Theory
2. Differential Equations, ordinary and partial
3. Analytical Geometry and Linear Algebra
4. Differential and Integral Calculus
Course Outcomes:
77 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
On completion of the course students will be able to
PEC- CS602 D.1 Explain and define concepts of pattern recognition.
PEC- CS602 D.2 Explain and distinguishprocedures, methods and algorithms related
to pattern recognition.
PEC- CS602 D.3 Apply methods from the pattern recognition for new complex
applications.
PEC- CS602 D.4 Analyze and breakdown problem related to the complex pattern
recognition system.
PEC- CS602 D.5 Design and develop a pattern recognition system for the specific
application.
PEC- CS602 D.6 Evaluate quality of solution of the pattern recognition system.
Numerical Methods
Code: OEC-CS601A
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Pre-Requisite:
1. Basic knowledge of ordinary differential equations
Course Outcomes:
On completion of the course students will be able to
OEC- CS601A.1 Recalling the basic mathematical tools such as, derivative, real
integration, solution of equations, existence of solution of system of
linear equations and differential equation.
OEC- CS601A.2 Describe the concept of error, operators and interpolation. Numerical
approach of solving missing term, finding of polynomials, integrated
value, solution of algebraic equations, system of linear equations and
differential equation.
OEC- CS601A.3 Use interpolation, integration for data analysis and finding of volume
of rough surface. Apply different numerical techniques to solve
algebraic equations, system of linear equations in iterative way. Solve
boundary value wave and heat equations using differential equations.
OEC- CS601A.4 Analyze different real time problems and categorize them during the
process of solving, by numerical technique mentioned.
OEC- CS601A.5 Justify and make gradation of above mentioned numerical tools and
determine the right approach to find the optimal solution for
multidisciplinary engineering problems.
OEC- CS601A.6 Design a working model and build a path by which a new approach
can be generated to create a new problem appreciated by academics,
research & emerging direction in industry.
79 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
3. Group Behaviour: Characteristics of Group, Types of Groups, 4
Stages of Group Development, Group Decision Making. [2]
Communication: Communication Process, Direction of
Communication, Barriers to Effective Communication. [2]
Leadership: Definition, Importance, Theories of Leadership Styles.
4. Organizational Politics: Definition, Factors contributing to 8
Political Behaviour. [2] Conflict Management: Traditional vis-a-vis
Modern View of Conflict, Functional and Dysfunctional Conflict,
Conflict Process, Negotiation – Bargaining Strategies, Negotiation
Process. [2] Organizational Design: Various Organizational
Structures and their Effects on Human Behaviour, Concepts of
Organizational Climate and Organizational Culture.
Course Outcomes:
On completion of the course students will be able to
OEC- CS601B.1 Interpret given organization structure, culture, climate
OEC- CS601B.2 Interpret how to behave in a group through proper communication
OEC- CS601B.3 Interpret how to participate in a group decision making process
OEC- CS601B.4 Know about various leadership qualities required keeping in mind
Various Organizational Structures and their Effects on Human
Behaviour
OEC- CS601B.5 Learn the art of motivating employees by studying various theories and
by their application for smooth functioning of the organisation.
OEC- CS601B.6 Learn about different types of Conflicts which are common in an
organisation and how to handle those conflicting situations and will
also Learn the art of negotiation and bargaining.
Laboratory Experiments:
1. Problem Analysis and Project Planning -Thorough study of the problem – Identify
Project scope, Objectives and Infrastructure.
80 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
2. Software Requirement Analysis – Describe the individual Phases/modules of the
project and Identify deliverables. Identify functional and non-functional
requirements.
3. Data Modeling – Use work products, DFD models (level-0 and level-1), data
dictionary.
4. Software Designing - Develop use case diagrams and activity diagrams, build class
diagrams, sequence diagrams and add interface to class diagrams.
5. Prototype model – Develop the prototype of the products.
The SRS and prototype model should be submitted for end semester examination.
Course Outcomes:
On completion of the course students will be able to
PCC- CS691.1 Identify and classify the customer requirements for the solution of
complex engineering problems by proper analysis and interpretation of
data and processes supported by standard documentation.
PCC- CS691.2 Analyzethe software processes by mapping requirements in to Use case
diagrams/ Data Flow Diagrams and Entity Relationship Diagrams for
given case studies.
PCC- CS691.3 Experiment with modern tools like Rational rose++, Smartdraw,
Erdraw, etc. to design dynamic behaviour of software with modular
programming, class diagrams, sequence diagrams, etc. following
standard guidelines.
PCC- CS691.4 Estimate software matrices like size, effort and cost , software reliability
and quality, etc and plan development schedule using PART and GNATT
charts.
PCC- CS691.5 Design the Test cases and the Test suits for the given case studies using
Black box and White box techniques.
PCC- CS691.6 Determine and evaluate the various components of software
development process practically and to combine them to produce
different types of software to adapt in the software industries in future.
Laboratory Experiments:
1. NIC Installation & Configuration (Windows/Linux)
2. Understanding IP address, subnet etc. Familiarization with
Networking cables (CAT5, UTP)
Connectors (RJ45, T-connector)
Hubs, Switches
81 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
3. DHCP configuration
Message queue
TCP/UDP Socket Programming
Simple, TCP based, UDP based
Multicast & Broadcast Sockets
4. Implementation of
Data Link Layer Flow Control Mechanism (Stop & Wait, Sliding Window)
Data Link Layer Error Detection Mechanism (Cyclic Redundancy Check)
5. Server Setup/Configuration FTP, Telnet, NFS, DNS, Firewall;
Course Outcomes:
On completion of the course students will be able to
PCC- CS692.1 Discuss the hardware, related to computer network.
PCC- CS692.2 Analyze the performance of network protocols such as message queue,
stop-and-wait, CRC etc.
PCC- CS692.3 Examine UNIX socket programs efficiently, based on the knowledge of
client server paradigm.
PCC- CS692.4 Justify the network traffic in terms of congestion control mechanism.
PCC- CS692.5 Test the datagram forwarding and routing mechanisms compatible with
UNIX platform.
PCC- CS692.6 Design networks in small scale by configuring devices with the help of
knowledge in network addressing.
82 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
CSE
Fourth Year - Seventh Semester
(Semester VII)
Quantum Computing
Code: PEC-CS701A
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. The course will provide an insight of basic of quantum physics from a computer
scientist’s perspective, and how it describes reality and understand the
philosophical implications of quantum computing.
Pre-Requisite:
1. Linear Algebra, Theory of Computation
83 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Density Operator, Density Operator & Bloch Vector.
5. Quantum Measurement Theory: Distinguishing Quantum states & 8
Measures, Projective Measurements, and Measurement on
Composite systems, Generalized Measurements, Positive
Operator- Valued Measures.
6. Recent trends in Quantum Computing Research, Quantum 6
Computing Applications of Genetic Programming.
Course Outcome:
On completion of the course students will be able to
PEC- CS701A.1 To understand the foundations of post-quantum and implications of
quantum computing.
PEC- CS701A.2 To understand the quantum computing paradigm. Understand
Matrices & Operators in Quantum computing.
PEC- CS701A.3 To understand the power and limitation of quantum computers and
the underlying power of quantum mechanics for computation.
PEC- CS701A.4 To design and analyse quantum algorithms. Grasp the notions of
Tensor Products and Density Operator.
PEC- CS701A.5 To evaluate the principles of Quantum Measurement Theory.
Distinguishing Quantum states & Measures.
PEC- CS701A.6 To understand recent trends in Quantum Computing and to know
Quantum Computing Applications of Genetic Programming.
Cloud Computing
Code: PEC-CS701B
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To understand the concepts of Cloud Computing.
2. To learn Taxonomy of Virtualization Techniques.
3. To learn Cloud Computing Architecture.
4. To acquire knowledge on Aneka Cloud Application Platform.
5. To learn Industry Cloud Platforms.
Pre-Requisite:
1. Prerequisites: Discrete Mathematics, Computer Networks
84 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Course Outcome:
On completion of the course students will be able to
PEC- CS701B.1 To interpret the main concepts, key technologies, strengths, and
limitations of cloud computing and the possible applications for state-
of-the-art cloud computing,
PEC- CS701B.2 To illustrate various problems and evaluate related cloud computing
solutions
PEC- CS701B.3 To apply the architecture and infrastructure of cloud computing,
including SaaS, PaaS, IaaS, public cloud, private cloud and hybrid cloud
to different problems
85 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PEC- CS701B.4 To analyze cloud provider for a defined environment and to a specific
platform in a cost effective way.
PEC- CS701B.5 To analyze case studies to derive the best practice model to apply
when developing and deploying cloud based applications
PEC- CS701B.6 To understand recent trends and applications in the Cloud computing.
Objective:
1. Understanding Human learning aspects.
2. Acquaintance with primitives in the learning process by computer.
3. Understanding the nature of problems solved with Deep Learning.
Pre-Requisite:
1. Statistics, Linear Algebra, Probability.
Course Outcome:
On completion of the course students will be able to
PEC- CS701C.1 To provide an introduction to the field of artificial neural networks and
deep learning.
PEC- CS701C.2 Understand motivation and functioning of the most common types of
deep neural networks.
PEC- CS701C.3 To analyze and evaluate model performance and interpret results
PEC- CS701C.4 To analyze how to solve practical problems via artificial neural networks
and deep learning techniques.
PEC- CS701C.5 Apply Artificial Neural Networks and Deep Neural Networks in solving
complex real world problems
PEC- CS701C.6 To promote further independent learning on the topics of artificial neural
networks and machine learning.
Soft Computing
Code: PEC-CS701D
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. Motivation and historical background of Soft Computing.
2. Application of Fuzzy logic.
3. Biologically inspired algorithm such as neural networks, genetic algorithms, ant
colony optimization, and bee colony optimization.
4. Hybrid systems of neural network, genetic algorithms and fuzzy systems.
87 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Applications of Fuzzy Logic: How Fuzzy Logic is applied in Home
Appliances, General Fuzzy Logic controllers, Basic Medical
Diagnostic systems and Weather forecasting.
3. Introduction to Neural Networks: Advent of Modern 8
Neuroscience, Classical AI and Neural Networks, Biological
Neurons and Artificial neural network; model of artificial neuron.
Learning Methods: Hebbian, competitive, Boltzman etc.,
Neural Network models: Perceptron, Adaline and Madaline
networks; single layer network; Backpropagation and multi-layer
networks.
Competitive learning networks: Kohonen self-organizing
networks, Hebbian learning; Hopfield Networks. Neuo-Fuzzy
modelling: Applications of Neural Networks: Pattern Recognition
and classification
4. Genetic Algorithms: Simple GA, crossover and mutation, Multi- 8
objective Genetic Algorithm (MOGA).
Applications of Genetic Algorithm: genetic algorithms in search
and optimization, GA based clustering Algorithm, Image
processing and pattern Recognition
5. PSO: Other Soft Computing techniques: Simulated Annealing, 4
Tabu search, Ant colony optimization (ACO), Particle Swarm
Optimization (PSO).
Course Outcome:
On completion of the course students will be able to
PEC- CS701D.1 To interpret the main concepts, key technologies, strengths, and
limitations of soft computing methods.
PEC- CS701D.2 To understand supervised learning methods for neural network
models
PEC- CS701D.3 To demonstrate the use of back propagation algorithm to develop
multi layer feed forward neural networks
PEC- CS701D.4 To understand Genetic Algorithms and applications of Genetic
88 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Algorithm.
PEC- CS701D.5 To understanding fuzzy logic to handle uncertainty.
PEC- CS701D.6 To identify an appropriate soft computing technique to build an
Intelligent Machine.
Objective:
1. Provide an overview about sensor networks and emerging technologies
2. To study about the node and network architecture of sensor nodes and its
execution environment.
3. To understand the concepts of communication, MAC, routing protocols and also
study about the naming and addressing in WSN
4. To learn about topology control and clustering in networks with timing
synchronization for localization services with sensor tasking and control
5. To study about sensor node hardware and software platforms and understand the
simulation and programming techniques.
Pre-Requisite:
1. Computer networking concepts.
89 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
routing, unicast protocols, multipath routing, data-centric
routing, data aggregation, SPIN, LEACH, Directed Diffusion,
geographic routing.
4. Infrastructure Establishment: Topology control, flat network 8
topologies, hierarchical networks by clustering, time
synchronization, properties, protocols based on sender-receiver
and receiver-receiver synchronization, LTS, TPSN, RBS, HRTS,
localization and positioning, properties and approaches, single-
hop localization, positioning in multi-hop environment, range
based localization algorithms – location services, sensor tasking
and control
5. Sensor Network Platforms and Tools :Sensor node hardware, 9
Berkeley motes, programming challenges, node level software
platforms, node-level simulators, state-centric programming,
Tiny OS, nesC components, NS2 simulator, TOSSIM.
REFERENCES
1. KazemSohraby, Daniel Minoli, &TaiebZnati, “Wireless Sensor Networks-
Technology, Protocols, and Applications”, John Wiley, 2007.
2. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003.
3. Thomas Haenselmann, "Sensor Networks", available online for free, 2008.
Course Outcome:
On completion of the course students will be able to
PEC- CS701E.1 Provide an overview about sensor networks and emerging
technologies
PEC- CS701E.2 To study about the node and network architecture of sensor nodes
and its execution environment.
PEC- CS701E.3 To understand the concepts of communication, MAC, routing protocols
and also study about the naming and addressing in WSN
PEC- CS701E.4 To learn about topology control and clustering in networks with
timing synchronization for localization services with sensor tasking
and control
PEC- CS701E.5 To study about sensor node hardware and software platforms and
understand the simulation and programming techniques.
PEC- CS701E.6 To promote further independent learning on the topics of ad hoc and
wireless sensor networks.
90 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To develop an understanding of modern network architectures from a design and
performance perspective.
2. To introduce the student to the major concepts involved in wide-area networks
(WANs), local area networks (LANs) and Wireless LANs (WLANs).
3. To provide an opportunity to do network programming
4. To provide a WLAN measurement ideas.
Pre-Requisite:
1. Probability Theory.
2. Analog and Digital Communication Engineering.
91 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Course Outcome:
On completion of the course students will be able to
PEC- CS701F.1 To define and apply the basic concepts of information theory (entropy,
channel capacity etc.)
PEC- CS701F.2 To learn the principles and applications of information theory in
communication systems.
PEC- CS701F.3 To study various data compression methods and describe the most
common such methods.
PEC- CS701F.4 To understand the theoretical framework upon which error-control
codes are built.
PEC- CS701F.5 To apply convolution codes for performance analysis & cyclic codes
for error detection and correction.
PEC- CS701F.6 To design BCH codes for Channel performance improvement
Operation Research
Code: OEC-CS 701A
Contact: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To understand and apply the methodology of Operations Research to investigate
and tackle your operational problems.
2. To formulate and apply the techniques of Linear Programming and the extended
topics to solve certain optimization problems
Pre-Requisite:
1. Knowledge of probability distributions and statistics, and preferably basic calculus,
for learning Simulation.
Course Outcome:
On completion of the course students will be able to
OEC-CS 701A.1 Students should be proficient in the application of the laws of logic to
mathematical statements.
OEC-CS 701A.2 Select appropriate OR methods like Simplex, TP, TS, TSP, Network
Analysis to apply to various types of problems in engineering and
science inconsideration of the mathematical operations involved,
accuracy requirements, and available computational resources.
OEC-CS 701A.3 Prepare students for realization of journal papers outcomes, and
expose them to the world of research. Illustrate the current research
works and publications of the subjects in different fields adopted by
the students as per course curriculum in various journals and
literature.
OEC-CS 701A.4 To explore and enhance research potential explain how the ideas
those are adopted can be implemented through projects and
demonstrate various models, recent project proposals executing the
knowledge adopted from the course.
OEC-CS 701A.5 An ability to function on multi-disciplinary teams. Lighten on the
latest and modern developments in the fields.
OEC-CS 701A.6 An understanding of professional, ethical, legal, security and social
issues and responsibilities. An ability to analyze the local and global
impact of computing on individuals, organizations, and society.
Multimedia Systems
Code: OEC-CS701B
Contacts: 3L
Theory: 3 hrs. / Week
Objective:
93 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
1. To understand various components of the multimedia systems
2. To introduce how multimedia can be used in various application areas.
3. To provide a solid foundation to the students so that they can identify the proper
applications of multimedia, evaluate the appropriate multimedia systems and
develop effective multimedia applications.
Pre-Requisite:
1. Knowledge in Data Structure, Computer Network and Operating System.
94 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
3. Fred Halsall, Multimedia Communications, Pearson Ed.
4. Koegel Buford, Multimedia Systems, Pearson Ed.
5. Fred Hoffstetter, Multimedia Literacy, McGraw Hill.
6. Ralf Steinmetz and Klara Nahrstedt, Multimedia Fundamentals: Vol. 1- Media Coding
and Content Processing, PHI.
7. J. Jeffcoate, Multimedia in Practice: Technology and Application, PHI.
8. V.K. Jain, Multimedia and Animation, Khanna Publishing House, New Delhi (AICTE
Recommended Textbook – 2018)
Course Outcome:
On completion of the course students will be able to
OEC-CS 701B.1 To identify a range of concepts, techniques and tools for creating and
editing the interactive multimedia applications
OEC-CS 701 B.2 To understand the hardware and software needed to create projects
using creativity and organization to create them.
OEC-CS 701 B.3 To understand the concepts of Synchronization, Storage models and
Access Techniques.
OEC-CS 701 B.4 To incorporate approaches for Image and Video Database, Document
Architecture and Content Management.
OEC-CS 701 B.5 To understand recent trends and applications of Multimedia
Systems.
OEC-CS 701 B.6 To develop multimedia skills understanding the principal players of
individual players in multimedia teams in developing projects.
95 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Course Outcome:
On completion of the course students will be able to
OEC-CS701C.1 Understand clearly various aspects of Vedas and Upanishadic views:
Atman, Jagrata etc.
OEC-CS701C.2 Interpret the thoughts related to Carvaka schooland its epistemology,
metaphysics and ethics. Mukti etc.
OEC-CS701C.3 Learn the philosophical thoughts associated with Jainism.
OEC-CS701C.4 Learn the philosophical thoughts associated with Buddhism and will
be able to interpret various theories in School of Buddhism.
OEC-CS701C.5 Understand the width and depth of Indian Philosophical Concepts
which will help them to chose the right path in the journey of life.
OEC-CS701C.6 Gain the power of self-realisation. Also will Gain the power of
understanding the Existence of Super Power i.e God Almighty.
96 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Achievement motivation theory of entrepreneurship – Theory of
McClelland, Harvesting Strategies.
5. Information: Government incentives for entrepreneurship, 4
Incubation, acceleration. Funding new ventures – bootstrapping,
crowd sourcing, angel investors, Government of India’s efforts at
promoting entrepreneurship and innovation – SISI, KVIC, DGFT,
SIDBI, Defense and Railways.
6. Closing the Window: Sustaining Competitiveness, Maintaining 2
Competitive Advantage, the Changing Role of the Entrepreneur.
7. Applications and Project Reports Preparation 4
8. Project Management: Definitions of Project and Project 4
Management, Issues and Problems in Project Management,
Project Life Cycle - Initiation / Conceptualization Phase,
Planning Phase, Implementation / Execution Phase, Closure /
Termination Phase.
9. Project Feasibility Studies – Pre-Feasibility and Feasibility 2
Studies, Preparation of Detailed Project Report, Technical
Appraisal, Economic/Commercial/Financial Appraisal including
Capital Budgeting Process, Social Cost Benefit Analysis.
10. Project Planning – Importance of Project Planning, Steps of 2
Project Planning, Project Scope, Work Breakdown Structure
(WBS) and Organization Breakdown Structure (OBS), Phased
Project Planning.
11. Project Scheduling and Costing – Gantt chart, CPM and PERT 6
Analysis, Identification of the Critical Path and its Significance,
Calculation of Floats and Slacks, Crashing, Time Cost Trade-off
Analysis, Project Cost Reduction Methods.
12. Project Monitoring and Control – Role of Project Manager, MIS in 2
Project Monitoring, Project Audit.
13. Case Studies with Hands-on Training on MS-Project 4
Course Outcome:
On completion of the course students will be able to
HSMC 701.1 Learn about what entrepreneurship is and how to be motivated for
emerging as a budding entrepreneur
HSMC 701.2 Learn the idea of incubation and its application and various
Government Schemes available for the budding entrepreneurs.
97 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
HSMC 701.3 Learn about various National and International level Venture
Capitalists and their project funding procedures
HSMC 701.4 Learn about Project Feasibility Studies, Preparation of Detailed Project
Report, Technical Appraisal, Economic/Commercial/Financial
Appraisal including Capital Budgeting Process, Social Cost Benefit
Analysis etc.
HSMC 701.5 Learn how to plan a project considering Work Breakdown Structure
(WBS) and Organization Breakdown Structure (OBS). Will also learn
about Phased Project Planning, Project Scheduling and Costing through
different cost analysis techniques
HSMC 701.6 Learn how to monitor a project continuously and ensure proper control
on the progress of the project for its timely completion, cost
effectiveness etc.
Industry Internship
Code: TR CS 771
Contact:
Credit Points: 3
Industry Internship
OBJECTIVES
Internships are educational and career development opportunities, providing practical
experience in a field or discipline. They are structured, short-term, supervised placements
often focused around particular tasks or projects with defined timescales. An internship
may be compensated, non-compensated or some time may be paid. The internship has to be
meaningful and mutually beneficial to the intern and the organization. It is important that
the objectives and the activities of the internship program are clearly defined and
understood. Following are the intended objectives of internship training:
98 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
the working environment of industrial organizations
Understand the psychology of the workers and their habits, attitudes and approach
to problem solving.
INTERNSHIP GUIDELINES:
The T&P cell will arrange internship for students in industries/organization after second,
fourth and six/seventh semester(s) or as per AICTE/ affiliating University guidelines. The
general procedure for arranging internship is given below:
Step 1: Request Letter/ Email from the office of Training & Placement cell of the
college should go to industry to allot various slots of 4-6 weeks during summer
vacation as internship periods for the students. Students request letter/profile/
interest areas may be submitted to industries for their willingness for providing the
training. (Sample attached)
Step 2: Industry will confirm the training slots and the number of seats allocated for
internships via Confirmation Letter/ Email. In case the students arrange the training
themselves the confirmation letter will be submitted by the students in the office of
Training & Placement through concerned department. Based on the number of slots
agreed to by the Industry, TPO will allocate the students to the Industry. In addition,
the internship slots may be conveyed through Telephonic or Written
Communication (by Fax, Email, etc.) by the TPO or other members of the T&P cell /
Faculty members who are particularly looking after the Final/Summer Internship of
the students.
Step 7: List of students who have completed their internship successfully will be
issued by Training and Placement Cell.
Course Outcomes:
On completion of the course students will be able to
99 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
TR-CS 771.1 Student is able to construct the company profile by compiling the brief history,
management structure, products / services offered, key achievements and market
performance for his / her organization of internship.
TR-CS 771.2 For his / her organization of internship, the student is able to assess its Strengths,
Weaknesses, Opportunities and Threats (SWOT).
TR-CS 771.3 Student is able to determine the challenges and future potential for his / her
internship organization in particular and the sector in general.
TR-CS 771.4 Student is able to test the theoretical learning in practical situations by
accomplishing the tasks assigned during the internship period.
TR-CS 771.5 Student is able to apply various soft skills such as time management, positive
attitude and communication skills during performance of the tasks assigned in
internship organization.
TR-CS 771.6 Student is able to analyze the functioning of internship organization and recommend
changes for improvement in processes.
Project-I
Code: PROJ-CS781
Contact: 12P
Credit Points: 6
Project Work I
The object of Project Work I is to enable the student to take up investigative study in the
broad field of Computer Science & Engineering, either fully theoretical/practical or
involving both theoretical and practical work to be assigned by the Department on an
individual basis or two/three students in a group, under the guidance of a Supervisor.
This is expected to provide a good initiation for the student(s) in R&D work. The
assignment to normally include:
Course Outcome:
On completion of the course students will be able to
PROJ- CS781.1 To survey the literature; Identify and classify the requirements for the
solution of complex engineering problems.
PROJ- CS781.2 To define the requirements of the project by proper analysis and
interpretation of data and processes supported by standard
documentation.
PROJ- CS781.3 To analyze the processes by mapping requirements in to Use case
diagram(s)/ Data Flow Diagram(s)/ Algorithm(s)/ User-Interface
design/ Entity Relationship Diagram(s) etc.
PROJ- CS781.4 To design behaviour of the application with modular programming
and program flowchart/ class diagrams and sequence diagrams, etc.,
following standard guidelines.
PROJ- CS781.5 To estimate project metrics like size, effort and cost , reliability and
quality, etc and plan project development schedule using PART and
GNATT charts.
PROJ- CS781.6 To justify the project work with technical documentation,
presentation, and discussions as a group to share knowledge.
100 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
CSE
Fourth Year - Eighth Semester
(Semester VIII)
Objective:
1. To understand the fundamental characteristics of signals and systems.
2. To understand signals and systems in terms of both the time and transform
domains, taking advantage of the complementary insights and tools that these
different perspectives provide.
101 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Sallen Key, frequency transformation and scaling
Course Outcome:
On completion of the course students will be able to
PEC-CS801A.1 To understand the objective and overview of signal and system
networks.
PEC-CS801A.2 To understanding the fundamental characteristics of signals and
systems.
PEC-CS801A.3 To apply the concepts of Periodic signal analysis with Fourier series
and properties.
PEC-CS801A.4 To understanding signals and systems in terms of elements of
electrical network.
PEC-CS801A.5 To analyze One and two port network parameters and functions.
PEC-CS801A.6 To development of the mathematical skills to solve problems.
Objective:
1. To understand basics of Cryptography and Network Security.
2. To be able to secure a message over insecure channel by various means.
3. To learn about how to maintain the Confidentiality, Integrity and Availability of a
data.
4. To understand various protocols for network security to protect against the
threats in the networks.
Pre-Requisite:
1. Computer Network and Telecommunication.
102 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Cipher text, Substitution Techniques, Transposition Techniques,
Encryption & Decryption, Symmetric & Asymmetric key
Cryptography, Key Range & Key Size
3. Symmetric Key Algorithm - Introduction, Algorithm types & 8
Modes, Overview of Symmetric Key Cryptography, DES(Data
Encryption Standard) algorithm, IDEA(International Data
Encryption Algorithm) algorithm, RC5 (Rivest Cipher 5)
algorithm.
4. Asymmetric Key Algorithm, Digital Signature and RSA - 5
Introduction, Overview of Asymmetric key Cryptography, RSA
algorithm, Symmetric & Asymmetric key Cryptography together,
Digital Signature, Basic concepts of Message Digest and Hash
Function (Algorithms on Message Digest and Hash function not
required).
5. Internet Security Protocols, User Authentication - Basic Concepts, 6
SSL protocol, Authentication Basics, Password, Authentication
Token, and Certificate based Authentication, Biometric
Authentication.
6. Electronic Mail Security - Basics of mail security, Pretty Good 4
Privacy, S/MIME.
7. Firewall - Introduction, Types of firewall, Firewall 3
Configurations, DMZ Network
Course Outcome:
On completion of the course students will be able to
PEC-CS801B.1 To define complex problems describing the basic Mathematics on
Number theory, probability theory and their application in Security
PEC-CS801B.2 To analyze the problems and solutions of Cryptographic algorithms
and its applicability in network security and describe the concepts of
principles of security, types of attacks, symmetric key cryptography
and asymmetric key cryptography and their differences.
PEC-CS801B.3 To use modern tools to implement the techniques like, DES, IDEA, RC4,
RC5, DSA, Elgamal and SSL protocol etc
103 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
PEC-CS801B.4 To justify the applications of the aforesaid techniques in network
security.
PEC-CS801B.5 To develop the systems this can withstand against the different types
of attacks.
PEC-CS801B.6 To elaborate the importance of communications in terms of
confidentiality and integrity to serve the society in a better way.
Objective:
1. Provide the student with knowledge of various levels of analysis involved in
Speech and Natural Language Processing.
2. Understand the applications of Speech and Natural Language Processing
3. Gain knowledge in automated Natural Language Generation and Machine
Translation
Pre-Requisite:
1. Concepts of Automata Theory.
104 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
parsing, Probabilistic Context Free Grammar, Dependency
Parsing.
4. Computational Lexical Semantics Introduction to Lexical 9
Semantics – Homonymy, Polysemy, Synonymy, Thesaurus –
WordNet, Computational Lexical Semantics – Thesaurus based
and Distributional Word Similarity Information Retrieval Boolean
Retrieval, Term document incidence, The Inverted Index, Query
Optimization, Phrase Queries, Ranked Retrieval – Term Frequency
– Inverse Document Frequency based ranking, Zone Indexing,
Query term proximity, Cosine ranking, Combining different
features for ranking, Search Engine Evaluation, Relevance
Feedback.
Course Outcome:
On completion of the course students will be able to
PEC-CS801C.1 To understand the fundamental concepts and techniques of natural
language processing (NLP).
PEC-CS801C.2 To analyze the diffract approaches to discourse, generation, dialogue
and summarization within NLP
PEC-CS801C.3 To understand current methods for statistical approaches to machine
translation.
PEC-CS801C.4 To understand of the computational properties of natural languages
and the commonly used algorithms for processing linguistic
information
PEC-CS801C.5 To analyze NLP models and algorithms using both the traditional
symbolic and the more recent statistical approaches.
PEC-CS801C.6 To understand Computational Lexical Semantics Introduction to
Lexical Semantics.
Objective:
1. To provide the conceptual and technological developments in the field of Internet
and web designing with the emphasis on comprehensive knowledge of Internet
and its applications.
105 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Unit Content Hrs. / Unit
1. Introduction (1L): Overview, Network of Networks, Intranet, 6
Extranet and Internet.
World Wide Web (1L): Domain and Sub domain, Address
Resolution, DNS, Telnet, FTP, HTTP.
Review of TCP/IP (1L): Features, Segment, Three-Way
Handshaking, Flow Control, Error Control, Congestion control, IP
Datagram, IPv4 and IPv6.
IP Subnetting and addressing: Classful and Classless Addressing,
Subnetting. NAT, IP masquerading, IP tables.
Internet Routing Protocol: Routing -Intra and Inter Domain
Routing, Unicast and Multicast Routing, Broadcast.
Electronic Mail: POP3, SMTP.
2. HTML: Introduction, Editors, Elements, Attributes, Heading, 9
Paragraph. Formatting, Link, Head, Table, List, Block, Layout, CSS.
Form, Iframe, Colors, Colorname, Colorvalue.
Image Maps: map, area, attributes of image area.
Extensible Markup Language (XML): Introduction, Tree, Syntax,
Elements, Attributes, Validation, Viewing. XHTML in brief.
CGI Scripts: Introduction, Environment Variable, GET and POST
Methods.
3. PERL: Introduction, Variable, Condition, Loop, Array, 10
Implementing data structure, Hash, String, Regular Expression,
File handling, I/O handling.
JavaScript: Basics, Statements, comments, variable, comparison,
condition, switch, loop, break. Object – string, array, Boolean, reg-
ex. Function, Errors, Validation.
Cookies: Definition of cookies, Create and Store a cookie with
example.
Java Applets: Container Class, Components, Applet Life Cycle,
Update method; Parameter passing applet, Applications.
4. Client-Server programming In Java: 4
Java Socket, Java RMI. Threats: Malicious code-viruses, Trojan
horses, worms; eavesdropping, spoofing, modification, denial of
service attacks.
Network security techniques: Password and Authentication; VPN,
IP Security, security in electronic transaction, Secure Socket
Layer (SSL), Secure Shell (SSH).
Firewall: Introduction, Packet filtering, Stateful, Application
layer, Proxy.
5. Internet Telephony: Introduction, VoIP. Multimedia 5
Applications: Multimedia over IP: RSVP, RTP, RTCP and RTSP.
Streaming media, Codec and Plugins, IPTV.
Search Engine and Web Crawler: Definition, Meta data, Web
Crawler, Indexing, Page rank, overview of SEO.
106 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Text book and Reference books:
1. Web Technology: A Developer's Perspective, N.P. Gopalan and J. Akilandeswari, PHI
Learning, Delhi, 2013. (Chapters 1-5,7,8,9).
2. Internetworking Technologies, An Engineering Perspective, Rahul Banerjee, PHI
Learning, Delhi, 2011.
Course Outcome:
On completion of the course students will be able to
PEC-CS801D.1 To explain the principal of Internetworking, TCP/IP protocols, World
Wide Web, client-server architecture, IP addressing, routing etc.
PEC-CS801D.2 To examine and evaluate the need for secured web application
development with client-side, server-side scripting languages.
PEC-CS801D.3 To construct web programs using the web languages--HTML, XML,
JavaScript, Applet, Perl, etc.
PEC-CS801D.4 To design and develop small interactive websites using modern tools
following the professional web based engineering solutions, ethics and
management techniques.
PEC-CS801D.5 To determine and combine the advanced technologies like network
security, multimedia applications, search engine, web crawler, etc
with the websites.
PEC-CS801D.6 To assess the need and utility for different web components and their
role-play to produce huge distributed data driven web applications to
contribute to lifelong learning.
Internet of Things
Code: PEC-CS801E
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. Able to understand the application areas of IOT.
2. Able to realize the revolution of Internet in Mobile Devices, Cloud & Sensor
Networks.
3. Able to understand building blocks of Internet of Things and characteristics.
Pre-Requisite:
1. Wireless Networks.
References:
1. Yasuura, H., Kyung, C.-M., Liu, Y., Lin, Y.-L., Smart Sensors at the IoT Frontier, Springer
International Publishing
2. Kyung, C.-M., Yasuura, H., Liu, Y., Lin, Y.-L., Smart Sensors and Systems, Springer
International Publishing
3. Jeeva Jose, Internet of Things, Khanna Publishing House.
4. Internet of Things, ArsheepBahga and Vijay Madisetti
Course Outcomes:
On completion of the course the student should be able to
PEC-CS801E.1 To understand the application areas of IOT.
PEC-CS801E.2 To realize the revolution of Internet in Mobile Devices, Cloud & Sensor
Networks.
PEC-CS801E.3 To understand building blocks of Internet of Things and
characteristics.
PEC-CS801E.4 To analyze various M2M and IoT architecture.
PEC-CS80.E.6
To understand Recent trends in smart sensor for day to day life
108 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. Understand big data for business intelligence. Learn business case studies for big
data analytics. Understand no sql big data management. Perform map-reduce
analytics using Hadoop and related tools
Pre-Requisite:
1. Programming language to solve real world learning problems and extract
knowledge from real datasets.
References:
109 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
1. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big Analytics:
Emerging
2. V.K. Jain, Big Data and Hadoop, Khanna Publishing House, New Delhi (2017).
3. V.K. Jain, Data Analysis, Khanna Publishing House, New Delhi (2019).
4. Business Intelligence and Analytic Trends for Today's Businesses", Wiley, 2013.
5. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence", Addison-Wesley Professional, 2012.
6. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012.
7. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.
8. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilley, 2012.
9. Lars George, "HBase: The Definitive Guide", O'Reilley, 2011.
10. Eben Hewitt, "Cassandra: The Definitive Guide", O'Reilley, 2010.
11. Alan Gates, "Programming Pig", O'Reilley, 2011.
Course Outcomes:
After completion of course, students would be:
OEC- CS801A.1 To understand the Big Data Platform and its Use cases.
OEC- CS801A.2 To provide an overview of Apache Hadoop .
OEC- CS801A.3 To analyze HDFS Concepts and Interfacing with HDFS
OEC- CS801A.4 To evaluate and learn business case studies for big data analytics.
OEC- CS801A.5 To Understand no big data management
OEC- CS801A.6 To perform map -reduce analytics using Hadoop and related tools
Objective:
1. To introduce the cyber world and cyber law in general.
2. To explain about the various facets of cyber crimes.
3. To enhance the understanding of problems arising out of online transactions and
provoke them to find solutions.
4. To clarify the Intellectual Property issues in the cyber space and the growth and
development of the law in this regard.
110 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
3. Tools and Methods used in Cybercrime: Proxy servers, pan 8
word checking, Random checking, Trojan Horses and Backdoors;
DOS & DDOS attacks; SQL injection: buffer over flow.
4. Phishing & Identity Theft: Phishing methods, ID Theft; Online 8
identity method.
Cybercrime & Cybersecurity: Legal aspects, Indian laws, IT act,
Public key certificate.
Course Outcomes:
After completion of course, students would be:
OEC- CS801B.1 To understands the conceptual and technical foundation cyber
security.
OEC- CS801B.2 To exhibit knowledge to secure corrupted systems, protect personal
data, and secure computer networks in an Organization
OEC- CS801B.3 To identify and analyze statutory, regulatory, constitutional, and
organizational laws that affects the information technology
professional.
OEC- CS801B.4 To apply case law and common law to current legal dilemmas in the
technology field.
OEC- CS801B.5 To apply diverse viewpoints to ethical dilemmas in the information
technology field and recommend appropriate actions,
OEC- CS801B.6 To understand principles of web security and to guarantee a secure
network by monitoring and analyzing the nature of attacks through
cyber/computer forensics software/tools.
Mobile Computing
Code: OEC-CS801C
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To describe and analyse the network infrastructure requirements to support
mobile devices and users.
2. To illustrate the concepts, techniques, protocols and architecture employed in
wireless local area networks, cellular networks, and perform basic requirements
analysis
3. To apply techniques and current network technologies to the consideration of
next generation technologies
Pre-Requisite:
1. Understanding of computer networks.
111 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Unit Content Hrs. / Unit
1. Introduction to Personal Communications Services (PCS): PCS 5
Architecture, Mobility management, Networks signaling. Global
System for Mobile Communication (GSM) system overview:
GSM Architecture, Mobility management, Network signaling.
2. General Packet Radio Services (GPRS): GPRS Architecture, GPRS 5
Network Nodes. Mobile Data Communication: WLANs (Wireless
LANs) IEEE 802.11 standard, Mobile IP.
3. Wireless Application Protocol (WAP): The Mobile Internet 7
standard, WAP Gateway and Protocols, wireless markup
Languages (WML). Wireless Local Loop (WLL): Introduction to
WLL Architecture, wireless Local Loop Technologies.
4. Third Generation (3G) Mobile Services: Introduction to 7
International Mobile Telecommunications 2000 (IMT 2000)
vision, Wideband Code Division Multiple Access (W-CDMA),
and CDMA 2000, Quality of services in 3G
5. Global Mobile Satellite Systems; case studies of the IRIDIUM 7
and GLOBALSTAR systems. Wireless Enterprise Networks:
Introduction to Virtual Networks, Blue tooth technology, Blue
tooth Protocols.
6. Server-side programming in Java, Pervasive web application 8
architecture, Device independent example application
Course Outcomes:
After completion of course, students would be:
OEC- CS801C.1 To understands the conceptual and technical foundation cyber
security.
OEC- CS801C.2 To exhibit knowledge to secure corrupted systems, protect personal
data, and secure computer networks in an Organization
OEC- CS801C.3 To identify and analyze statutory, regulatory, constitutional, and
organizational laws that affect the information technology
professional.
OEC- CS801C.4 To apply case law and common law to current legal dilemmas in the
112 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
technology field.
OEC- CS801C.5 To apply diverse viewpoints to ethical dilemmas in the information
technology field and recommend appropriate actions,
OEC- CS801C.6 To understand principles of web security and to guarantee a secure
network by monitoring and analyzing the nature of attacks through
cyber/computer forensics software/tools.
Robotics
Code: OEC-CS801D
Contacts: 3L
Theory: 3 hrs. / Week
Credit Points: 3
Objective:
1. To introduce the concepts of Robotic system, its components and instrumentation
and control related to robotics.
113 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
angular velocity of links, Velocity propagation, Manipulator
Jacobians for serial and parallel manipulators, Velocity ellipse
and ellipsoids, Singularity analysis for serial and parallel
manipulators, Loss and gain of degree of freedom, Statics of
serial and parallel manipulators, Statics and force
transformation matrix of a Gough-Stewart platform, Singularity
analysis and statics.
6. Dynamics of serial and parallel manipulators Mass and 4
inertia of links, Lagrangian formulation for equations of motion
for serial and parallel manipulators, Generation of symbolic
equations of motion using a computer, Simulation (direct and
inverse) of dynamic equations of motion, Examples of a planar
2R and four-bar mechanism, Recursive dynamics, Commercially
available multi-body simulation software (ADAMS) and
Computer algebra software Maple.
7. Motion planning and control Joint and Cartesian space trajectory 6
planning and generation, Classical control concepts using the
example of control of a single link, Independent joint PID
control, Control of a multi-link manipulator, Non-linear model
based control schemes, Simulation and experimental case
studies on serial and parallel manipulators, Control of
constrained manipulators, Cartesian control, Force control and
hybrid position/force control, Advanced topics in nonlinear
control of manipulators.
8. Modeling and control of flexible robots Models of flexible links 4
and joints, Kinematic modeling of multilink flexible robots,
Dynamics and control of flexible link manipulators, Numerical
simulations results, Experiments with a planar two-link flexible
manipulator.
9. Modeling and analysis of wheeled mobile robots 3Introduction 3
and some well-known wheeled mobile robots (WMR), two and
three-wheeled WMR on flat surfaces, Slip and its modeling,
WMR on uneven terrain, Design of slip-free motion on uneven
terrain, Kinematics, dynamics and static stability of a three
wheeled WMR’s on uneven terrain, Simulations using Mat lab
and ADAMS.
10. Selected advanced topics in robotics Introduction to chaos, Non- 3
linear dynamics and chaos in robot equations, Simulations of
planar 2 DOF manipulators, Analytical criterion for unforced
motion. Gough Stewart platform and its singularities, use of near
singularity for fine motion for sensing, design of Gough-Stewart
platform based sensors. Over constrained mechanisms and
deployable structures, Algorithm to obtain redundant links and
joints, Kinematics and statics of deployable structures with
pantographs or scissor-like elements (SLE’s).
114 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
2. Saha, S.K., “Introduction to Robotics, 2nd Edition, McGraw-Hill Higher Education, New
Delhi, 2014
3. Ghosal, A., “Robotics”, Oxford, New Delhi, 2006.
Course Outcomes:
After completion of course, students would be:
OEC- CS801D.1 To understand the knowledge in robotics, robot structures and their
workspace.
OEC- CS801D.2 To develop skills in performing spatial transformations associated
with rigid body motions.
OEC- CS801D.3 To develop skills in perform kinematics analysis of robot systems.
OEC- CS801D.4 To analyze knowledge of the singularity issues associated with the
operation of robotic systems.
OEC- CS801D.5 To apply knowledge and analysis skills associated with trajectory
planning.
OEC- CS801D.6 To provide knowledge and skills associated with robot control.
Objective:
1. To improve the communication skills to enrich personality development,
Computing skills of the students.
2. To enhance the employability of the students. The courses will help to bridge the
gap between the skill requirements of the employer or industry and the
competency of the students.
115 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
Active Listening, Communication: Barriers To Active Listening,
Telephone Communication: Basic Telephone Skills , Telephone
Communication: Advanced Telephone Skills, Telephone
Communication: Essential Telephone Skills
5. Technology And Communication: Technological Personality, 5
Technology And Communication: Mobile Personality?, Topic:
Technology And Communication: E-Mail Principles, Technology
And Communication: How Not To Send E-Mails!, Technology
And Communication: Netiquette, Technology And
Communication: E-Mail Etiquette
6. Communication Skills: Effective Communication, Barriers To 5
Communication: Arising Out Of Sender/Receiver’s Personality,
Barriers To Communication: Interpersonal Transactions,
Barriers To Communication: Miscommunication, Non-Verbal
Communication: Pre-Thinking Assessment-1, Non-Verbal
Communication: Pre-Thinking Assessment-2
7. Nonverbal Communication: Introduction And Importance, Non- 5
Verbal Communication: Issues And Types, Non-Verbal
Communication: Basics And Universals, Nonverbal
Communication: Interpreting Nonverbal Cues, Body Language:
For Interviews, Body Language: For Group Discussions
8. Presentation Skills: Overcoming Fear, Presentation Skills: 5
Becoming A Professional, Presentation Skills: The Role Of Body
Language, Presentation Skills: Using Visuals, : Reading Skills:
Effective Reading, Human Relations: Developing Trust And
Integrity
Course Outcomes:
After completion of course, students would be:
OEC-CS 801E.1 Effectively communicate through verbal/oral communication and
improve the listening skills.
OEC-CS 801E.2 Write precise briefs or reports and technical documents.
OEC-CS 801E.3 Actively participate in group discussion / meetings / interviews and
prepare & deliver presentations.
OEC-CS 801E.4 Become more effective individual through goal/target setting, self
motivation and practicing creative thinking.
OEC-CS 801E.5 Function effectively in multi-disciplinary and heterogeneous fields of
116 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
education.
OEC-CS 801E.6 Function effectively in teams through the knowledge of team work,
Inter-personal relationships, conflict management and leadership
quality.
Industry Internship
Code: TR CS 871
Contact:
Credit Points: 3
Industry Internship
OBJECTIVES
Internships are educational and career development opportunities, providing practical
experience in a field or discipline. They are structured, short-term, supervised placements
often focused around particular tasks or projects with defined timescales. An internship
may be compensated, non-compensated or some time may be paid. The internship has to be
meaningful and mutually beneficial to the intern and the organization. It is important that
the objectives and the activities of the internship program are clearly defined and
understood. Following are the intended objectives of internship training:
INTERNSHIP GUIDELINES:
The T&P cell will arrange internship for students in industries/organization after second,
fourth and six/seventh semester(s) or as per AICTE/ affiliating University guidelines. The
117 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
general procedure for arranging internship is given below:
Step 1: Request Letter/ Email from the office of Training & Placement cell of the
college should go to industry to allot various slots of 4-6 weeks during summer
vacation as internship periods for the students. Students request letter/profile/
interest areas may be submitted to industries for their willingness for providing the
training. (Sample attached)
Step 2: Industry will confirm the training slots and the number of seats allocated for
internships via Confirmation Letter/ Email. In case the students arrange the training
themselves the confirmation letter will be submitted by the students in the office of
Training & Placement through concerned department. Based on the number of slots
agreed to by the Industry, TPO will allocate the students to the Industry. In addition,
the internship slots may be conveyed through Telephonic or Written
Communication (by Fax, Email, etc.) by the TPO or other members of the T&P cell /
Faculty members who are particularly looking after the Final/Summer Internship of
the students.
Step 7: List of students who have completed their internship successfully will be
issued by Training and Placement Cell.
Course Outcomes:
On completion of the course students will be able to
TR-CS 871.1 Student is able to construct the company profile by compiling the brief history,
management structure, products / services offered, key achievements and market
performance for his / her organization of internship.
TR-CS 871.2 For his / her organization of internship, the student is able to assess its Strengths,
Weaknesses, Opportunities and Threats (SWOT).
TR-CS 871.3 Student is able to determine the challenges and future potential for his / her
internship organization in particular and the sector in general.
TR-CS 871.4 Student is able to test the theoretical learning in practical situations by
accomplishing the tasks assigned during the internship period.
118 UG
Department of Computer Science and Engineering
Haldia Institute of Technology
An Autonomous Institution (An Institution of ICARE)
TR-CS 871.5 Student is able to apply various soft skills such as time management, positive
attitude and communication skills during performance of the tasks assigned in
internship organization.
TR-CS 871.6 Student is able to analyze the functioning of internship organization and recommend
changes for improvement in processes.
Project-II
Code: PROJ-CS 881
Contact: 12P
Credit Points: 6
Course Outcomes:
After completion of course, students would be:
PROJ- CS881.1 To determine the software and hardware requirements from
implementation perspective of Project-II
PROJ- CS881.2 To interpret the system design of project-I in to executable code(s) using
modern programming languages to Build the system.
PROJ- CS881.3 To test and validate the developed system following standards testing
techniques.
PROJ- CS881.4 To adapt the management techniques to handle a project as a whole.
PROJ- CS881.5 To justify the project work with technical documentation, presentation,
and discussions as a group to share knowledge.
PROJ- CS881.6 To determine all the system development phases towards the completion
of the Project and analyze/compare the result(s); evaluate and maximize
system performances which contribute to lifelong learning.
119 UG