B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus For 2019 - 20
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus For 2019 - 20
B. Tech. (CSE) 2 Year/ 3 Semester Course Structure and Syllabus For 2019 - 20
(CSE) 2nd Year/ 3rd Semester Course Structure and Syllabus for 2019 -20
3rd SEM
THEORY
SL. PAPER CODE PAPER NAME L T P CONTACT CREDIT
NO. HRS./WEEK
01 BS(CS/IT)307 Mathematics- 3 0 0 3 3
III
02 ES(CS/IT)307 Digital 3 0 0 3 3
Electronics
03 PC(CS/IT)301 Computer 3 1 0 4 4
Organization
04 PC(CS/IT)302 Data structure 3 0 0 3 3
&
Algorithms
05 HS(CS/IT)303 Economics for 3 0 0 3 3
Engineers
PRACTICAL
01 ESL(CS/IT)308 Digital 0 0 3 3 1.5
Electronics Lab
02 PCL(CS/IT)303 Computer 0 0 3 3 1.5
Organization
Lab
03 PCL(CS/IT)304 Data structure 0 0 3 3 1.5
&
Algorithms Lab
04 PCL(CS/IT)305 IT Workshop 0 0 3 3 1.5
(python/matlab)
SESSIONAL
01 CLA(CS)-3 Comprehensive 0 0 0 0 1
Laboratory
Assessment
TOTAL 15 1 12 28 23
B. Tech. (CSE) 2nd Year/ 3rd Semester Course Structure and Syllabus for 2019 -20
Mathematics-III
Paper Code: BS(CS/IT)307
Contacts: 40L
Credit: 3
Learning Resources:
Course Outcomes
CO 1: use the tools of power series to analyze engineering problems and apply the concept of
convergence of infinite series in many approximation techniques in engineering disciplines.
CO 2: apply the knowledge for addressing the real life problems which comprises of several variables
or attributes and identify extremum points in different surfaces of higher dimensions.
CO 3: evaluate multiple integrals and apply the techniques to different physical problems.
CO 4: solve first and second order ordinary differential equations by applying different techniques
and also will be able to formulate differential equations for model systems and problems of
engineering sciences.
CO 5: apply the basic concepts of graph theory to network analysis, data analytics and many other
branches of computer science.
Digital Electronics
Code: ES(CS/IT)307
Contacts: 36L
Credit: 3
Binary numbers & Boolean algebra , Logic gates, Truth Tables and function minimization using
algebraic method, Karnaugh map, , Signed binary number representation with 1’s and 2’s complement
methods, Maxterm, Minterm, Representation in SOP and POS forms ; Realization of Boolean
functions using NAND/NOR gates
Adder and Subtractor circuits (half & full adder & subtractor); Encoder, Decoder, Comparator,
Multiplexer, De-Multiplexer, Parity Generator and checker.
References:
Course Outcomes
CO 1: identify and understand the difference between analog and digital electronic systems.
CO 3: represent numbers in various number systems and successfully execute conversions between
different representations.
Computer Organization
Code: PC(CS/IT)301
Contacts: 40L (3L+1T)
Credits: 4
Module 1: Introduction [3 L]
History of computing, von Neumann machine, Instruction and data, fixed-point and floating point
numbers, errors, IEEE standards
Module 5: Peripherals [7 L]
Basic properties, bus architectures, interfacing of I/O devices, data transfer schemes –programmed
I/O, DMA, mass storage, RAID
Module 6: Pipelining [6 L]
Pipelining, data path and instructions, speed up, CPI, latency; linear / non-linear pipeline–reservation
table, MAL; super-pipelined and super-scalar processors.
Text Book:
Reference Book:
Course Outcomes
CO 2: clearly visualize machine's instruction set architecture (ISA) including basic instruction fetch
and execute cycles, instruction formats, control flow, and operand addressing modes.
CO 3: explain the design and functioning of a machines central processing unit (CPU), the data path
components (ALU, register file) and the control unit.
CO 4: explain organization of memory hierarchies including the basics of cache design and
performance of caches. Apply these ideas to solve numerical problems.
CO 5: explain basic input/output functioning including program controlled I/O and interrupt I/O.
Elementary Data Organizations, Data Structure Operations: insertion, deletion and traversal in arrays,
asymptotic Notations, Time-Space trade off, recursion, tail recursion, Tower of Hanoi, recursion tree
and master theorem method of complexity analysis, Linear Search and Binary Search Techniques and
their complexity analysis, finding min max in O(3n/2) time.
ADT Stack and its operations: Algorithms and their complexity analysis, Applications of Stacks:
Expression Conversion and evaluation – corresponding algorithms and complexity analysis. ADT
queue and types of Queue: Simple Queue, Circular Queue, Operations on each type of Queue:
Algorithms and their analysis.
Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary Tree, Binary
Search Tree, AVL Tree, binary heap, b-tree; operations on each of the trees and their algorithms with
complexity analysis. Tree traversal algorithms: recursive and iterative. Catalan Number and its
connection to binary trees and stack sortable permutations. Comparison of performance of Heap, array
and insertion priority queues.
Hashing: Chaining, probing, Universal hashing function and analysis of various hashing methods.
Text Books:
Reference Book:
1. Steven S Skiena, Miguel A. Revilla, Programming Challenges: The Programming Contest
Training Manual (Texts in Computer Science) Springer.
B. Tech. (CSE) 2nd Year/ 3rd Semester Course Structure and Syllabus for 2019 -20
Course outcomes
CO 2: decide based on nature of the search problem which search technique (Linear Search, Binary
Search, hashing) to use when.
CO 3: implement the Stacks, Queues and linked list data structure and apply the same to various
problems
CO 4: apply non linear data structures in searching, insertion and retrieval of data. Analyze the time
complexity of various balanced and unbalanced trees and to apply the data structure to relevant
problems.
Module 1: [6L]
Economic Decision Making – Overview, Role of Engineers in Economic Decision making, Problem
in Economic Decision Making, Decision Making Process.
Engineering Costs & Estimation – Fixed, Variable, Marginal & Average Costs, Step Cost, Product
and Period Cost, Direct and Indirect Cost, , Sunk Costs, Shutdown Cost, 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, Learning Curve Model, Benefits and difficulties in estimation.
Module 2: [12L]
Cash Flow, Interest and Equivalence: Cash Flow – Diagrams and Cash Flow Statement, Time Value
of Money, Real, Nominal & Effective Interest, Different Interest Formulae.
Cash Flow & Rate Of Return Analysis – Net Present Worth Analysis, Annual Worth Analysis,
Internal Rate Of Return, Future Worth Analysis, Benefit-Cost Ratio Analysis, Sensitivity And
Breakeven Analysis.
Module 3: [6L]
Inflation And Price Change – Definition, Effects, Causes, Price Change with Indexes, Types of
Index, Use of Price Indexes In Engineering Economic Analysis.
Uncertainty In Future Events - Risk, Risk vs. Return, Probability, Expected Value and Variance,
Economic Decision Trees, Simulation.
B. Tech. (CSE) 2nd Year/ 3rd Semester Course Structure and Syllabus for 2019 -20
Module 4: [6L]
Depreciation and Replacement Analysis - Basic Aspects, Deterioration & Obsolescence, Depreciation
Calculation Fundamentals, Depreciation and Capital Allowance Methods, Replacement Analysis
Decision Map, Minimum Cost Life of a New Asset.
Accounting – Function, Balance Sheet, Income Statement, Financial Ratios, Role and Functions of a
Financial Manager.
Readings:
1. H.L. Bhatia & S.N. Maheswari: Economics for Engineers, Vikas Publishing House Pvt. Ltd.
2. R. Paneer Seelvan: Engineering Economics, PHI.
3. James L. Riggs, David D. Bedworth, Sabah U. Randhawa : Economics for Engineers 4e , Tata
McGraw-Hill
4. Donald Newnan, Ted Eschembach, Jerome Lavelle : Engineering Economics Analysis, OUP
5. Sullivan and Wicks: Engineering Economy, Pearson.
6. Partha Chatterjee: Economics for Engineers, Vrinda Publications.
Course Outcome
CO 1: explain the role and scope of Engineering Economics and apply the process of economic
decision making.
CO 2: analyze the different concepts of cost and apply different cost estimation techniques.
CO 3: explain the concepts of cash flow, time value of money and different interest formulas and
create cash flow diagrams for different situations and apply different interest formulae to solve
associated problems.
CO 4: apply various analytical methods like net present worth analysis, internal rate of return
analysis, future worth analysis, benefit –cost ratio analysis, break-even analysis , sensitivity analysis
etc. to evaluate different engineering projects.
CO 5: explain the process of inflation and apply different price indices to quantify the effects of
inflation.
CO 6: state and explain the concepts of risk, return and uncertainty and incorporate the effect of
uncertainty in economic analysis by using various concepts like probability, expected value, variance,
decision trees and simulation.
CO 7: explain the concepts of depreciation and replacement analysis and solve associated problems of
depreciation.
CO 8: interpret and apply the various concepts of Accounting like balance sheet, income statement
and financial ratio analysis and understand the role and functions of a Financial Manager
B. Tech. (CSE) 2nd Year/ 3rd Semester Course Structure and Syllabus for 2019 -20
2. Incremental circuit.
9. (a) & (b) Cascade two RAM ICs for vertical and horizontal expansion.
B. Tech. (CSE) 2nd Year/ 3rd Semester Course Structure and Syllabus for 2019 -20
3. Application of binary search like divide and conquer technique in various array related O (log
n) problems.
IT Workshop
Code: PCL(CS/IT)305
Contacts: 3P
Credits: 1.5
1. Python Introduction
2. NumPy Introduction
7. Matrix Arithmetic
9. Matplotlib Introduction
10. Histograms
Study Material:
https://www.python-course.eu/numerical_programming_with_python.php
Course Outcome
4th SEMESTER
THEORY
SL. PAPER CODE PAPER NAME L T P CONTACT CREDIT
NO. HRS./WEEK
01 BS(CS/IT)408 Discrete 3 1 0 4 4
Mathematics
02 ES(CS/IT)409 Communication 3 0 0 3 3
Engineering
03 PC(CS/IT)406 Design & Analysis of 3 0 0 3 3
Algorithm
04 PC(CS/IT)407 Formal Language 3 1 0 4 4
and Automata
Theory
05 PC(CS/IT)408 Computer 3 1 0 4 4
Architecture
06 MC(CS/IT)401 Environmental 2 0 0 2 0 (non-
Sciences credit
according
to AICTE)
PRACTICAL
01 ESL(CS/IT)410 Communication 0 0 3 3 1.5
Engineering Lab
02 PCL(CS/IT)409 Algorithm Lab 0 0 3 3 1.5
03 PCL(CS/IT)410 Programming Lab 0 0 3 3 1.5
using C++
SESSIONAL
01 CLA(CS)-4 Comprehensive 0 0 0 0 1
Laboratory
Assessment
TOTAL 17 3 9 29 23.5
B. Tech. (CSE) 2nd Year/ 4th Semester Course Structure and Syllabus for 2019 -20
Discrete Mathematics
Code: BS(CS/IT)408
Contacts: 36L (3L+1T)
Credit: 4
Text Books
1. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer Oriented
Approach, 3rd Edition by, Tata McGraw – Hill.
2. N. Chandrasekaran and M. Umaparvathi, Discrete Mathematics, PHI.
3. J.K. Sharma, Discrete Mathematics, Macmillan.
References
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
2. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth Publishing
Co. Inc.
3. Douglas Brent West, Introduction to Graph Theory, Prentice Hall
4. Clark John, Holton Derek Allan, A First Look at Graph Theory, World Scientific
Course Outcomes
Communication Engineering
Code: ES(CS/IT)409
Contacts: 36
Credit: 3
Module 1: [12L]
Introduction to Communication Engineering, need of Modulation [2L]
Amplitude Modulation(AM): Concept of AM, Calculation of Modulation Index, Total
transmitted power of AM, DSB-SC modulation & SSB-SC modulation techniques, calculation of
Bandwidth and Savings of power ,Demodulation of AM, Superheterodyne receiver [10L]
Module 2: [5L]
Frequency Modulation(FM): Concept of FM, Direct & Indirect Method, Bandwidth calculation
of FM, Demodulation of FM. [3L]
Phase Modulation(PM) : Concept of PM , generation of PM from FM [2L]
B. Tech. (CSE) 2nd Year/ 4th Semester Course Structure and Syllabus for 2019 -20
Module 3: [12L]
Pulse & Digital Communication: Sampling Theorem, aliasing effect, natural and flat top
sampling, PAM, PWM,PPM, basic concept of Pulse Code Modulation (PCM) , concept of
quantization and quantization error, Companding, DPCM, Delta Modulation and Adaptive Delta
Modulation, signal to quantisation noise ratio in PCM system.[9L]
ASK, FSK, PSK, QPSK [3L]
Module 4: [7L]
Data Formatting: NRZ-Unipolar, NRZ-polar, NRZ-Bipolar, RZ-Bipolar, Manchester Coding
[2L]
Synchronous and Asynchronous Data Transmission [3L]
Concept of Satellite Communication [2L]
Text Books:
1. Modern Digital and Analog Communication Systems by B.P. Lathi, Published by Oxford
University Press.
2. An Introduction to Analog and Digital Communications by Simon Haykin (Wiley India)
3. Principles of Communication Engineering by Taub H. & Shilling D.L.- TMH
4. Introduction to Digital and Data Communication – Michael A. Miller, Jaico Publishing
House
Reference Books:
1. Communication Systems by A. B. Carlson, Published by McGraw-Hil
2. Principles and Analog and Digital Communication by Jerry D Gibson, Published by
MacMillan.
3. A Text Book of Analog and Digital Communication by A Kumar, Umesh Publication
Modern Electronic Communication, Principles and Practice- Sharma & Sinha,
Dhanpat Rai Publishing Company (p) Ltd.
Course Outcomes
Text Books:
1. T.H.Cormen, C.E. Leiserson, R.L.Rivest and C. Stein ,“Introduction to Algorithms”, PHI.
2. Ellis Horowitz, Sartaz R. Sahani, “Fundamentals of Computer Algorithms". Computer Science
Press.
3. A. Aho, J. Hopcroft and J. Ullman, “The Design and Analysis of algorithms”, Pearson
Education.
Reference:
1. D.E. Knuth: The Art of Computer Programming, Vol. 1, Vol. 2 and Vol. 3, Addison-Wesley.
2. G.Brassard, P.Bratley, Fundamentals of Algorithmics -, PHI.
3. S.Baase, Allen Ven Gelder“Computer Algorithms-Introduction to Design & Analysis"- 3rd
Edition, Pearson Education
Course Outcomes
Module 1: Introduction:[2L]
Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of
languages.
Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms,
nondeterministic pushdown automata (NPDA) and equivalence with CFG, parse trees, ambiguity
in CFG, pumping lemma for context-free languages, deterministic pushdown automata, closure
properties of CFLs(proof not required).
Text books:
John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata Theory,
Languages, and Computation, Pearson Education Asia.
Reference books:
1. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation,
Pearson Education Asia.
2. Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer Science,
Springer.
3. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing. 4. John Martin,
Introduction to Languages and The Theory of Computation, Tata McGraw Hill
Course Outcomes
Computer Architecture
Code : PC(CS/IT)408
Contacts: 38 (3L+1T)
Credits : 4
Module 1
Pipelining Architecture: [10L]
Introduction: Review of basic computer architecture (Revisited), Quantitative techniques in
computer design, measuring and reporting performance.
Pipelining: Basic concepts, instruction and arithmetic pipeline, data hazards, control hazards and
structural hazards, techniques for handling hazards. Exception handling. Pipeline optimization
techniques.
Module 2
Memory Module: [9L]
Hierarchical memory technology: Inclusion, Coherence and locality properties; Cache memory
organizations, Techniques for reducing cache misses; Virtual memory organization.
Module 3
Instruction-level parallelism: [9L]
Basic concepts, techniques for increasing ILP, RISC Architecture, superscalar, super pipelined
and VLIW processor architectures. Array and vector processors.
Module 4
Multiprocessor Architecture: [10L]
Multiprocessor architecture: taxonomy of parallel architectures; Centralized shared-memory
architecture: synchronization, memory consistency, interconnection networks. Distributed
shared-memory architecture, Cluster computers.
Non von Neumann architectures: data flow computers, reduction computer architectures, systolic
architectures
TEXT BOOKS:
1. Advanced Computer Architecture-Kai Hwang & Naresh Jotwani, McGraw Hill
2. Computer Architecture and Parallel Processing -Kai Hwang and A. Briggs, McGraw Hill
3. Computer Architecture: a quantitative approach - J. L. Hennessy and D. A. Patterson,,
Harcourt Asia, Singapore.
4.Computer Organization and Architecture - V. Rajaraman and T. Radhakrishnan PHI Learning
Pvt. Ltd.
B. Tech. (CSE) 2nd Year/ 4th Semester Course Structure and Syllabus for 2019 -20
REFERENCE BOOKS:
1.Computer Architecture and Parallel Processing - Hwang and Briggs, TMH.
2.Computer Architecture and Organization - Hayes, McGraw-Hill.
Course Outcome
ENVIRONMENTAL SCIENCES
Code: MC(CS/IT)401
Contacts: 27L
Credit: Non credit
Recommended Books:
1. Textbook of Environmental studies, Erach Bharucha, UGC
2. Fundamental concepts in Environmental Studies, D D Mishra, S Chand & Co Ltd
3. Environmental chemistry, A. K. Dey
4. Environmental studies, Anil Kumar Dey & Arnab Kumar Dey, New Age International (P) Ltd.
5. Perspectives in Environmental Studies, Anubha Kaushik & C.P. Kaushik, New Age
International (P) Ltd.
Course outcome
Course Outcomes
Algorithm Lab
Code: PCL(CS/IT)409
Contact Hrs./Week : 3P
Credit: 1.5
Course Outcomes
1. Introduction to the source code writing, compilation and execution process of C++
programme. Writing C++ Programme using I/O stream, command line arguments. basic
loop control, functions with CBV and CBR, identification of variables with scope
resolution operator. [3P]
2. Programme writing on classes, creation of objects, constructors and destructors,
accessing members, array of objects, accessing of static members [3P]
3. Programme writing on function overloading, constructor overloading and default
constructor, Object passing as function arguments and returning of objects from
functions. [3P]
4. Programme writing on friend functions, local classes., dynamic initialization of objects
[3P]
5. Programme writing on copy constructor, operator overloading – binary and unary
operators. operator overloading using friend functions [3P]
6. Programme writing on derived classes, implementation of single inheritance, multilevel
inheritance, hierarchical inheritance with constructor calling sequence. [3P]
7. Programme writing on multiple inheritances, constructor calling in derived classes,
virtual base classes. [3P]
8. Programme writing on abstract classes, pointer to objects, this pointer, pointers to derived
class. [3P]
B. Tech. (CSE) 2nd Year/ 4th Semester Course Structure and Syllabus for 2019 -20
Course Outcomes
Module I:
Introduction of O.S [2L]: Concept of OS. Operating system services, dual-mode operation,
Evaluation of O.S, Different types of O.S: batch, multi-programmed, timesharing, real-time,
distributed, network.
Introduction of Process [2L]: Concept of process, Process life cycle, Operations on processes,
IPC.
Module II:
System Structure [2L]: Computer system operation, Operating system structure, kernel:
microkernel, monolithic kernel, system calls.
Threads [2L]: Overview, Benefits of threads, User and kernel threads.
Module III:
CPU Scheduling [4L]: Scheduling criteria, Preemptive & non-preemptive scheduling,
Scheduling algorithms(FCFS,SJF/SRTF,RR,Priority), MLQ scheduling, Multi-processor
scheduling.
Process Synchronization [3L]: Race condition, Critical Section problem, Semaphore, Mutex,
Monitor.
Deadlocks [3L]: Deadlock criteria, Methods for handling deadlocks, Resource allocation graph,
Banker’s algorithm, Recovery from deadlock.
Module IV:
Memory Management [3L]: Background, Logical vs. physical address, Address binding,
Swapping, Contiguous memory allocation, Fragmentation, Segmentation, Paging.
Virtual Memory [3L]: Concept, Demand paging, Page replacement, Page replacement
algorithms (FCFS, LRU, Optimal).
File Systems [2L]: File attributes, File system structure, File access methods, File allocation
methods (contiguous, linked, indexed).
Module V:
Disk Management [3L]: Disk structure, Disk formatting, Boot block, Bad blocks, Disk
scheduling algorithms (FCFS, SSTF, SCAN, C-SCAN, LOOK,C-LOOK).
Module VI:
I/O Management [3L]: I/O hardware, Polling, Interrupts, DMA, Application I/O interface,
Kernel I/O subsystem, Spooling and device reservation.
Protection & Security [2L]:Goals of protection, Security problem, Authentication, Program
threats, System threats
Case Study [2L]: Windows family, Linux family, Mac and iOS, VMWare, XEN family,
Android.
Course Outcomes:
Transaction [6L]:
Overview of Database transaction concepts, ACID properties, Transaction state, Concurrent executions,
Conflicts in Transaction, Serializability, Conflict & View Serializability, Test for serializability
(Precedence Graph), Recoverability, Recoverable&Cascadeless& Strict schedules.
Reference
1.SQL, PL/SQL the Programming Language of Oracle,4th edition, Ivan Bayross
2.An Introduction to Database Systems, 8th edition, C.J. Date,
Course Outcomes:
Module I [2L]
Introduction to Object Oriented Programming Concepts
Object Oriented Programming language concepts & features, Comparison between Object Oriented
Programming language and conventional programming languages, Object Oriented Modelling concepts.
Module II [10L]
Introductory Concept of Java Programming
Advantages of Java, Data types & variables, Loops, Arrays, Operators, Control statements, constants,
methods, Compile time Polymorphism: Method Overloading, Keyboard input operations.
Packages in Java
Creation of packages, Importing packages, Member access rules in the aspect of packages.
Module IV [5L]
Exception handling in Java
Basic concept of exception handling in Java, Different types of exception classes, Concept of try and
catch block, Concept of nested try block and multiple catch blocks, throw and throws clause, Concept of
finally block, Creation of user defined exception classes.
Module V [6L]
Multithreading in Java
Basic concept of multithreading, Concept of main thread and child thread, Thread life cycle, Creation of
multiple threads, Thread priorities, Thread synchronization, Inter thread communication, Deadlocks,
Suspending & Resuming threads.
Module VI [3L]
Applet Programming in Java
Basics of applet programming, Applet life cycle, Differences between application & applet programming,
Parameter passing through applets, I/O operations in applets.
Textbooks:
1. Core Java Volume I — Fundamentals (9th Edition) by Cay S Horstmann and Gary Cornell
2. Object Oriented Modelling and Design by Rambaugh, James Michael, Blaha; Prentice Hall, India
3. Java: A Beginner’s Guide byHerbertSchildt, Oracle Press.
References:
1. Head First Java by Kathy Sierra and Bert Bates
2. Deitel and Deitel- “Java How to Program”, Pearson Education.
Course Outcomes:
Advanced Algorithms
Code: PEC(CS) 501 A
Contact:3L
Credits: 3
Allotted Hrs: 36L
Module 1: Probabilistic Analysis and Randomized algorithms [6L]
The hiring Problem, Indicator random variables, Randomized algorithms.
Text Books:
1.T.H.Cormen, C.E. Leiserson, R.L.Rivest and C. Stein ,“Introduction to Algorithms”, PHI
Reference:
1.Randomized •algorithms, Rajeev Motwani, PrabhakarRaghavan, Cambridge University Press
2. Computational Geometry Algorithms and Applications, Third Edition, Mark de Berg ,Otfried Cheong
Marc van Kreveld , Mark Overmars, Springer
3.Approximation Algorithms, Vazirani, Vijay V, 2003, Springer.
Course Outcomes
After completing the course the student will be able to-
CO 1: Analyze Randomized algorithms for a given problem.
CO 2: Efficiently implement FFT, primality testing and integer Factorization.
CO 3: Solve Modular Arithmetic Problems.
CO 4: Apply computational geometry algorithms to real life problems
CO 5: Design approximate algorithms for problems.
Soft Computing
Code: PEC (CS) 501B
Contacts: 36L
Credit: 3
Allotted Hrs: 36L
Module-I [2L]
Introduction to Soft Computing: Concept of computing systems, “Soft" computing versus "Hard"
computing, Characteristics of Soft computing, some applications of Soft computing techniques.
Module-II [12L]
Module-III [5L]
Fuzzy Logic:
Fuzzy Sets, Basic Definitions and Terminology, membership function Set-theoretic operation. Fuzzy
union, intersection and complement, various T-norm and T-conorm operators, Fuzzy Relations. Fuzzy
Logic, Approximate Reasoning, Compositional Rule of Inference.
Module-IV [10L]
Evolutionary Algorithms:
Genetic Algorithms: Simple GA, Encoding Techniques, Crossover, mutation, inversion and deletion,
genetic algorithms in search and optimization.
Ant Colony Optimization(ACO).
Particle Swarm Optimization(PSO).
Module-V [7L]
Hybrid Systems:
Hybrid Systems, GA based Fuzzy Systems and Neural Networks Training, Any other applications of soft
computing.
Text Books:
1. S. Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI
2. Neuro-Fuzzy and Soft computing, Jang, Sun, Mizutani, PHI
3. Neural Networks: A Classroom Approach,1/e by Kumar Satish, TMH,
4. Genetic Algorithms in search, Optimization & Machine Learning by David E. Goldberg, Pearson/PHI
5. Fuzzy logic with engineering applications, Timothy J. Ross, John Wiley and Sons.
Reference Books:
1. Fuzzy Sets and Fuzzy Logic: Theory and Applications, George J. Klir and Bo Yuan, Prentice Hall
2. Neural Networks: A Comprehensive Foundation (2nd Edition), Simon Haykin, Prentice Hall.
3. A beginners approach to Soft Computing, Samir Roy &Udit Chakraborty, Pearson
Course Outcomes
CO 1: Identify and select a suitable Soft Computing methodology to solve the problem
CO 2: Understand & define fuzzy sets and represent these sets by membership functions
CO 3: Describe the relation between real brains and simple artificial neural network models
CO 4: Design genetic algorithms for single and multiple objective optimization problem
CO 5: Analyze and design neuro fuzzy and other hybrid approaches of soft computing techniques for
problem solving
Embedded Systems
Code: PEC(CS) 501 C
Contact:3L
Credits: 3
Allotted Hrs: 36L
Module 1:Introduction[3 L]
Introduction to Embedded System, features of Embedded System, application of Embedded System.
Module 3: AVRAtmega8[11L]
Introduction to AVR Microcontroller.Description of AVR ATmega8 Microcontroller.Assembly Language
Programming for Arithmetic and Logic operations using AVR ATmega8 Microcontroller.Assembly
Language Programming for Input-Output Port for AVR ATmega8 Microcontroller.Interfacing of sensors
with AVR ATmega8 Microcontroller.Data uploading toAVR ATMega8 Microcontroller.
Text Books:
1. The 8051 Microcontroller and Embedded Systems Using Assembly and C by M.A. Mazidi, J. G.
Mazidi an R. D. McKinlay, published by Pearson.
2. The 8051 Microcontroller by Kenneth J. Ayala, published by Cenage Learning.
3. AVR Microcontroller and Embedded Systems: Using Assembly and C by M. A. Mazidi ,
published by Pearson.
4. Make: Getting Started with Arduino by Massimo Banzi and Michael Shiloh (Available at
Amazon).
Constitution of India
Code: MC(CS/IT)502[PC (CS/IT)-513]
Contact: 2L
Credit: 0
Allotted Hrs: 35L
Text books:
1. Indian polity, M, Laxmikanth, MC Graw Hill education, 5th Edition.
Reference books:
1. DD Basu, “ Introduction to the constitution of India”, 21st Edition, Lexis Nexis Books Publication ltd,
India.
Course Outcomes:
2. Process [3P]: starting new process, replacing a process image, duplicating a process image, waiting for
a process,zombie process.
3. Signal [3P]: signal handling, sending signals, signal interface, signal sets.
4. Semaphore [6P]: programming with semaphores (use functions semctl, semget, semop, set_semvalue,
del_semvalue, semaphore_p, semaphore_v).
5. POSIX Threads [6P]: programming with pthread functions (viz. pthread_create, pthread_join,
pthread_exit,pthread_attr_init, pthread_cancel)
4. Database Management[6P]
Creating Views, Creating Column Aliases, Creating Database Users, Using GRANT and REVOKE
1. Programming with java classes involving data members having various access protection, class
methods, constructors, overloading features, this and final keyword, static block, static variables and
methods. [3P]
2. Use of array of objects, passing of object in method and returning of object form method, use of string
handling functions– length (), equals (), charAt(), keyboard input operations, command line arguments.
[3P]
3. Program implementation for nested/inner classes, name conflict resolving for inner and outer classes.
[3P]
4. Programme implementation for abstract class, interface, inheriting multiple interfaces in a single class,
extending multiple interfaces within a single interface, combined inheritance of both abstract class and
interface. Use of dynamic method dispatch for abstract class and interface implementation. [6P]
5. Implementation of nested abstract class and interface combinations. Resolving name conflict scenarios
for the combined inheritance of abstract class and interface. [3P]
6. Designing programme modules with creation and accessing of packages. [3P]
7. Handling exception with try, catch and finally. Adoption of throw, throws and user defined exception.
[3P]
8. Programme writing for creation of multiple threads, thread synchronization, inter thread
communication. [6P]
9. Applet programme execution with I/O operation, use of repaint () method. [3P]
.
Course Outcome:
After completion of this course the students will be able to -
CO1: Implement java classes with incorporation of data protection, method overloading, string
operations, call by reference aspects and object independent access of the class members.
CO2: Design nested structuring of classes and resolve name conflict issues for the nested classes.
CO3: Implement abstract class, interface and their nested structuring along with dynamic method
dispatch.
CO4: Tackle java run time exceptions, and also design user defied exception classes.
CO5: Perform parallel processing with multithreading concept and implement their synchronization.
CO6: Execute applet programming for web applications with window based I/O operations.