Resources » Articles/Knowledge Sharing » Syllabus

Bput 4th and 5th semester syllabus(CSE)


Last Updated:   Category: Syllabus    
Author: Member Level: Silver    Points: 2


This is the syllabus of 3rd year of computer sc. & eng. branch in Biju patnaik university and technology.



COURSE STRUCTURE
THIRD YEAR B.TECH PROGRAMME
COMPUTER SCIENCE AND ENGINEERING
5th Semester 6th Semester
Theory ContactHrs. Credit
L-T-P
HSSM 4301 Optimization 3-0-0 3 in Engineering BCSE 3301 Design & Analysis 3-0-0 3 of Algorithms BCSE 3308 Automata Theory 3-0-0 3
BCSE 3309 Computer Architecture 3-0-0 3 & Organization – I
BSCM 3301 Discrete 3-1-0 4 Mathematical Structures
Total 16
Practicals/Sessionals Contact Hrs. Credit
BCSE 9301 Optimization Lab. 0-0-3 2
BCSE 9302 Design & Analysis of Algorithms Lab. 0-0-3 2
BCSE 9303 Computer 0-0-3 2 & Organization Lab.
6
Total 22 Theory ContactHrs. Credit
L-T-P
HSSM 4302 Production 3-0-0 3 & Operation Mgmt.
BCSE 3305 Operating Systems 3-0-0 3
BCSE 3306 Computer Networks 3-0-0 3
BCSE 3307 Computer Arcitecture 3-1-0 4
& Organization - II
CPEC 5302 Digital Signal 3-1-0 4 Processing
Electives (Any one) 3-0-0 3
PECS 3301 Artificial Intelligence
CPEC 5308 Communication Engineering
PEBT 8301 Bioinformatics
Total 20
Practicals/Sessionals ContactHrs .Credit
BCSE 9304 Operating Systems 0-0-3 2 Lab.
CPEC 9306 DSP Lab. 0-0-3 2
BCSE 9305 Project 0-0-3 2
6
Total 26

L-Lecture T-Tutorial P-Practical

28
5th Semester
HSSM 4301 OPTIMIZATION IN ENGINEERING (3-0-0)
Course Objective : The course aims at acquainting the students to mathematical modeling of engineering design, operation and maintenance problems and their optimization algorithms.
Module – I (10 hours)
Formulation of engineering optimization problems : Decision variables, objective function and constraints. Example of typical design, operation and maintenance problems in engineering : Design of a water tank, design of a truss, design of a network (electrical, communication sewerage and water supply networks), product mix problem, transportation and assignment problems, shift scheduling of employees, design of reliable devices, design of reactors, shortest route problem, set covering problem, traveling salesman problems. Only physical problems and their mathematical models to be discussed.
Linear Programming Problem : Formulation, Graphical solution, Simplex method, Duality theory, Dual simplex method, Formulation and solution of engineering problems of planning and scheduling.
Module – II (10 hours)
Sensitivity Analysis, Transportation Problem, Assignment Problem, Network Models : Minimal Spanning Tree Problem, Maximal Flow Problem, Shortest Route Problem, Minimum Cost Flow Problem. Algorithms and applications to be covered.
Module – III (10 hours)
Integer Linear Programming Problem. Branch and Bound and Cutting Plane Methods. Zero-one Programming Problem, Knapsack Problem, Set covering Problem, Set Partitioning Problem, Traveling Salesman Problem. Deterministic Dynamic Programming Problems. Applications and algorithms to be discussed.
Module – IV (12 hours)
Queueing theory, Game theory, Simulation, Decission theory & Sequencing Problem
References :
1. H. A. Taha – Operations Research, Prentice Hall of India, 2004.
2. D. T. Phillips, A Ravindran and J.J. Solaberg, Principles of Operation Research, John Wiley and Sons
3. S. Kalavathi, Operations research, Vikash Publication.
4. B.E Gillett, Introduction to operations research, TMH
BCSE 3301 DESIGN & ANALYSIS OF ALGORITHMS (3-0-0)
Module – I
Introduction to design and analysis of algorithms, Growth of Functions (Asymptotic notations, standard notations and common functions), Recurrences, solution of recurrences by substitution, recursion tree and Master methods, worst case analysis of Merge sort, Quick sort and Binary search, Design & Analysis of Divide and conquer algorithms.
Heapsort :
Heaps, Building a heap, The heapsort algorithm, Priority Queue, Lower bounds for sorting.
Module – II
Dynamic programming algorithms (Matrix-chain multiplication, Elements of dynamic programming, Longest common subsequence)
Greedy Algorithms – (Achivity- selection Problem, Elements of Greedy strategy, Fractional knapsac problem, Huffman codes).
Module – III
Data structure for disjoint sets :- Disjoint set operations, Linked list representation, Disjoint set forests.
Graph Algorithms: Breadth first and depth-first search, Minimum Spanning Trees, Kruskal and Prim's algorithms, single – source shortest paths (Bellman-ford and dijkstra's algorithms).

29
Module – IV
Fast Fourier Transform, string matching (Rabin-Karp algorithm), NP – Completeness (Polynomial time, Polynomial time verification, NP – Completeness and reducibility, NP-Camplete problems (without Proofs), Approximation algorithms (Traveling Salesman Problem).
Text Book
T.H. Cormen, C.E. Leiserson, R.L. Rivest,
C.Stein : Introduction to algorithms –2nd edition, PHI,2002.
Chapters : 1,2,3,4 (excluding 4.4), 6,7,(7.4.1), 8(8.1)15(15.2,15.3,15.4), 16 (16.1,16.2,16.3), 21 (21.1,21.2,21.3), 22(22.2,22.3), 23,24(24.1,24.2,24.3) 30,31(31.1,31.2) 34,35(35.2)
BCSE 3308 AUTOMATA THEORY (3-0-0)
Module – I
Automata & Language; Context-free grammars,
Module – II
Pushdown automata, noncontext free languages Turing machines.
Module – III
Decidability, reducibility
Module – IV
Time complexity class P, class NP, NP completeness.
Text Book
Michael Sipser : Introduction to the theory of computation (Thomson)
Chapters : 1,2,3,4,5,7
Reference Books
Theory of computer Science (Automata Language & computations) K.L. Mishra N. Chandrashekhar PHI
BCSE 3309 COMPUTER ARCHITECTURE AND ORGANIZATION– I (3-0-0)
Module –I
Basic structures of Computers: Functional units, operational concepts, Bus structures, Software, Performance, Multiprocessors and multicomputers. Machine Instruction and Programms: Memory location and addresses, Memory Operations, Instructions and instruction Sequencing, Addressing modes, Assembly Language, Basic Input/Output operations, subroutine, additional Instructions.
Module – II
8085 Microprocessor Architecture: Instruction Sets, Addressing modes, Memory Interfacing, Assembly Language Programming.
Module – III
Arithmetic : Addition and subtraction of signed Numbers, Design of Fast Adders, Multiplication of positive Numbers, Signed-operand multiplication , Fast multiplication, Integer Division, Floating- point Numbers, (IEEE754 s…) and operations.
Module – IV
Basic Processing units: Fundamental concepts, execution of complete Instructions, Multibus organization, Hardwired control, Micro programmed control
Memory System: Basic Concepts, cache Memory, performance consideration, Virtual memories, Memory Management requirement, secondary storage.
Text Book
1. Computer Organization Carl Hamacher, Zvonkovranesic, Safwat Zaky, Mc Graw Hill.
2. Microprocessor Architecture, Programming and application with 8085, R.S. Gaonkar

30
Reference Book :
1. Computer Organization and Design Hardware/ Software Interface: David
A. Patterson, John L. Hennessy ELSEVIER.
2. Computer Architecture and Organisations, Design principles and Application. B. Govinda Rajalu, Tata McGraw-Hill Publishing company Ltd.
3. Computer system Architecture: Morris M. Mano PHI NewDelhi.
4. Computer Architecture and Organization. John P. Hayes Mc Graw Hill introduction.
5. Structured Computer Organisation A.S. Tanenbum, PHI
BSCM 3301 DISCRETE MATHEMATICAL STRUCTURES (3-1-0)
Module – I
Logic, Prepositional Equivalences, Predicates and quantifiers, Nested quantifiers, methods of proof, proof strategies, sequences and summations. Mathematical induction, recursive definition and structural induction, Program corrections.
Module – II
Basics of counting, the pigeonhole principle, generalized permutations and combinations, recurrence relations, solution of recurrence relations, generating functions, Inclusion - Exclusion, Applications of Inclusion-Exclusion, Relations and their properties, many relations representation & closures of relation, Equivalence relations, partial orderings.
Module – III
Introduction to graphs, graph terminology, representing graphs and graph isomorphism, connectivity, Erlong and Hamiltonian Paths, Planar graphs, graph coloring. Introduction to trees, Application of trees,
Module – IV
Semi groups, Monoids, Groups, Subgroups, Cosels and Lagrange's theorem, Permutation groups, group codes, Isomorphisms, Homomorphism and normal subgroups, Rings, Integral domains and fields.
Lattices and algebraic systems, principle of duality, Basic Proportion, Distributive & complemented lation boolean lattices and Boolean algebras, Boolean function and Boolean expression, proposional calculus.
Text Books
1. K.E. Rosen :Discrete Mathematics and its application 5th Edition Tata McGraw Hill, 2003 Chapters: 1(1.1-1.5), 3(3.1-3.4,3.6), 4(4.1-4.3,4.5),6(6.1,6.2,6.4-6.6), 7,8(8.1-8.5, 8.7,8.8), 9(9.1,9.2)
2. C.L. Liu – Elements of Discrete Mathematics –2nd Edition TMH 2000. CHAPTERS: 11(11.1-11.10),12(12.1-12.8)
3. Thomas Koshy – Discrete Mathematics and Application, ELSEVIER.
PRACTICALS
BCSE 9301 OPTIMIZATION LABORATORY (0-0-3)
1. Solving linear programming problems using a package (formulation, solution, sensitivity analysis etc)
2 writing small programmes to implement Hook and Jeeves algorithm, Nelder and Nead (Geometric Simplex Algorithm etc. in C, C ++ , Mat lab or any other programming language.

31
3. Solution of a simultaneous set of non-linear equations using minimization
4. Introduction to simulated annealing and genetic algorithm
5. Formulation of some real life engineering problems as optimization problems
BCSE 9302 DESIGN AND ANALYSIS OF ALGORITHM LAB. (0-0-3)
All the problems have to be implemented either writing C programs or writing C++ programs
Elementary Problems : (8 is compulsory and any four among the rest)
1. Using a stack of characters, convert an infix string to a postfix string.
2. implement polynomial addition using a single linked list
3. Implement insertion, deletion, searching of a BST, Also write a routine to draw the BST horizontally.
4. implement insertion routine in an AVL tree using rotation.
5. Implement binary search and linear search in a program
6. Implement heap sort using a max heap.
7. Implement DFS/ BFS routine in a connected graph
8. Implement Dijkstra's shortest path algorithm using BFS
Greedy Algorithm (Any Two)
1. Given a set of weights, form a Huffman tree from the weight and also find oot the code corresponding to each weight.
2. Take a weighted graph as an input, find out one MST using Kruskal/ prim's algorithm
3. Given a set of weight and an upper bound M – Find out a solution to the Knapsack problem
Divide and Conquer Algorithm (any Two)
1. Write a quick sort routine, run it for a different input sizes and calculate the time of running. Plot in graph paper input size verses time.
2. Implement two way merge sort and calculate the time of sorting
3. Implement Strasseem's matrix multiplication algorithm for matrices whose order is a power of two.
Dynamic programming (Any one)
1. Find out a solution for 0/1 knapsack problem
2. given two sequences of character, find out their longest common subsequence using dynamic programming
NP Complete and NP Hard problems (Any two)
1. Find out a solution to graph colorability problem of an input graph
2. Find out a solution to the N-Queen Problem
3. Find out a solution to sum of subset problems

32
Backtracking Algorithm (All two)
1. Rat in a Maze
2. Game Trees
BCSE 9303 COMPUTER & ORGANIZATION LAB. (0-0-3)
1. Simulation of fast multiplication and division algorithms in Matlab or C programs
2. Some experiments using hardware trainer kits for floppy drive, CD drive, dot matrix printers etc.
3. Dismantling and assembling a PC along with study of connectors , ports, chipsets, SMPS etc. Draw a block diagram of mother board and other board
A study project on some hardware technologies (Memory, Serial Bus, Parallel Bus, USB Standard, Hard Disk Technology etc)

33
6th Semester
HSSM 4302 PRODUCTION AND OPERATION MANAGEMENT (3-0-0)
Objective : This course aims at acquainting all engineering graduates irrespective of their specializations, the basic issues and tools of managing production and operation functions of an organization.
Module I
1. Operation Function in an Organization, Manufacturing Vrs Service Operation, System view of Operations, Strategic Role of Operations, Operations Strategies for Competitive Advantages, Operations Quality and Productivity Focus, Meeting Global Challenges of Production and Operations Imperatives.
(3 hours)
2. Designing Products, Services and Processes New Product Design : Product Life Cycle, Product Development Process, Product Quality and Reliability Design, Process Technology : Project , Jobshop, Batch, Assembly Line, Continuous Manufacturing, Process Technology Life Cycle, Process Technology Trends; FMS, CIM, CAD, CAM, GT, Design for Services, Services Process Technology, Services Automation. Value Engineering, Standardization, Make or buy Decision.
(4 hours)
3. Job Design and Work Measurement, Method Study : Techniques of Analysis, recording, improvement and standardization. Work Measurement : Work Measurement Principles using Stopwatch Time Study, Predetermined Motion Time Standards and Work Sampling, Standard Time Estimation.
(4 hours)
Module II
4. Location and Layout Planning : Factor Influencing Plant and Warehouse Locations, Impact of Location on cost and revenues. Facility Location Procedure and Models : Qualitative Models, Breakeven Analysis, Single Facility, Location Model, Multi-facility Location Model, Mini max Location, Total and Partial Covering Model.
Layout Planning : Layout Types : Process Layout, Product Layout, Fixed Position Layout Planning, Systematic Layout Planning, CRAFT.
Group Technology and Cell Formation, Rank Order Clustering Method for Machine –Component Assignment,. Line Balancing : Basic concepts, General Procedure, Rank Positional Weight Method.
(7 hours)
Forecasting : Principles and Method, Moving Average, Double Moving Average, Exponential Smoothing, Double Exponential Smoothing, Winter's Method for Seasonal Demand, Forecasting Error Analysis.
(4 hours).
Module III
6. Manufacturing Planning and Control : The Framework and Components : Aggregate Planning, Master Production Scheduling, Rough-cut-Capacity Planning, Material Requirements Planning, Capacity Requirements Planning, Shop Order System and Purchase Order System. Transportation Method for Aggregate Production Planning, Material Requirement Planning, Scheduling and Dispatching Functions, Progress Monitoring and Control.
(4 hours)
7. Sequencing and Scheduling : Single Machine Sequencing : Basics and Performance Evaluation Criteria, Methods for Minimizing Mean Flow Time, Parallel Machines : Minimization of Makespan, Flowshop sequencing : 2 and 3 machine cases : Johnson's Rule and CDS heuristic. Jobshop Scheduling : Priority dispatching Rules.

34
8. Inventory Control : Relevant Costs, Basic EOQ Model, Model with Quantity discount, Economic Batch Quantity, Periodic and Continuous Review Systems for Stochastic Systems, Safety Stock, Reorder Point and Order Quantity Calculations. ABC Analysis.
(4 hours)
Module – IV
9. Project Management : Project Management through PERT / CPM. Network Construction, CPM, Network Calculation, Crashing of Project Network, Project Scheduling with Limited Resources. Line of Balance.
(5 hours)
10. Modern Trends in Manufacturing : Just in Time (JIT) System; Shop Floor Control By Kanbans, Total Quality Management, Total Productive Maintenance, ISO 9000, Quality Circle, Kaizen, Poke Yoke, Supply Chain Management
(6 hours)
Reference :
1. J. L. Riggs : Production Systems : Planning Analysis and Control, John Wiley.
2. E. E Adam and R. J. Ebert " Production and Operation Management", Prentice Hall of India, 2004.
3. S.N. Chary, " Production and Operations Management", Tata McGraw Hill.
4. R. Paneerselvam, "Production and Operation Management, Prentice Hall of India, 2005.
BCSE 3305 OPERATING SYSTEMS (3-0-0)
Module – I
Introduction : What is an Operating System.
Simple Batch Systems, Multiprogramming and Time Sharing systems. Personal Computer Systems, Parallel Systems, Distributed Systems and Real time Systems.
Operating system structures: system components, protection system, O.S. Services, system calls
Process Management: Process concept, Process Scheduling, Operation on Processes, Cooperting Processes. Interprocess communication. Threads CPU Scheduling : Basic concepts, scheduling criteria, scheduling algorithms.
Module – II
Deadlocks: System model, Deadlock Characterization Methods for Handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock Detection, recovery from Deadlock.
Memory management: Background, Logical versus Physical Address space, swapping, contiguous Allocation. Paging, Segmentation.
Virtual Memory: Background, Demand paging, performance of Demand paging, Page Replacement, Page Replacement Algorithms. Allocation of frames, Thrashing, Demand Segmentation.
Module – III
File-system Interface: File concept, Access Methods Directory implementation, Recovery.
Module – IV
I/O systems: Overview, I/O Hardware, Application of I/O interface, Kernel I/O - subsystem Transforming I/O requests to Hardware Operations. Secondary storage Structure: Disk Structure, Disk Scheduling, Disk Management, Swap space Management, Disk Reliability, Case Studies LINUX, WINDOW NT.
Text Book
Operating System Concepts : Abraham Silberschatz and Peter Bear Galvin, Addison wesley.
Chapter-1, Chapter-3 (3.1,3.2,3.3) , Chapter-4, Chapter-5(5.1,5.2,5.3) Chapter-7 (7.1-7.7), Chapter-8, Chapter-9, Chapter-10, Chapter-11, , Chapter-12(12.1-12.5), , Chapter-13(13.1-1.35)
Reference Book :
1. Operating System, McGraw Hill, Madnik & Donovan,
2. Operating Systems and system Programming, SCITECH, P. Blkeiahn Prasad.
3. Moswen O.S. – PHI, Andrew, S. Tannenbaum.

35
BCSE 3306 COMPUTER NETWORKS (3-0-0)
Module – I
Overview of Data Communications and Networking .
Physical Layer : Analog and Digital, Analog Signals, Digital Signals, Analog versus Digital, Data Rate Limits, Transmission Impairment, More about signals.
Digital Transmission : Line coding, Block coding, Sampling, Transmission mode.
Analog Transmission: Modulation of Digital Data; Telephone modems, modulation of Analog signals.
Multiplexing : FDM 150, WDM 155, TDM 157,
Transmission Media : Guided Media, Unguided media (wireless)
Circuit switching and Telephone Network : Circuit switching, Telephone network.
Module –II
Data Link Layer
Error Detection and correction : Types of Errors, Detection, Error Correction
Data Link Control and Protocols:
Flow and error Control, Stop-and-wait ARQ. Go-Back-N ARQ, Selective Repeat ARQ, HDLC.
Point-to –Point Access : PPP
Point –to- Point Protocol, PPP Stack,
Multiple Access
Random Access, Controlled Access, Channelization.
Local area Network : Ethernet.
Traditional Ethernet, Fast Ethernet, Gigabit Ethernet.
Wireless LANs: IEEE 802.11, Bluetooth virtual circuits: Frame Relay and ATM.
Module – III
Network Layer : Host to Host Delivery: Internetworking, addressing and Routing
Network Layer Protocols: ARP, IPV4, ICMP, IPV6 ad ICMPV6
Transport Layer : Process to Process Delivery : UDP; TCP congestion control and Quality of service.
Module –IV
Application Layer :
Client Server Model, Socket Interface, Domain Name System (DNS):
Electronic Mail (SMTP) and file transfer (FTP) HTTP and WWW.
Security
Cryptography, Message security, User Authentication.
Text Book
Data Communications and Networking : Third Edition. Behrouz A. Forouzan
Tata McGraw-Hill Publishing company Limited.
Reference Book :
1. Computer Networks : Third Edition, A system Approach, Larry L/ Peterson and Bruce S. Davie ELSEVIER
2. Computer Networks, A. S. Tannenbum PHI.
BCSE 3307 COMPUTER ARCHITECTURE & ORGANIZATION -II (3-1-0)
Module-1 (8 hours)
Input-output organization: Accessing I/O devices, Programmed I/O, Interrupt driven I/O, DMA, Buses, Interface circuits, standard I/O interfaces (PCI,SCSI,USB)

36
Module-2 (10 hours)
Architectural classification of parallel processing (FLYNN'S), Pipelining: Basic concepts, Instruction and arithmetic pipelining, Data Hazards, Instruction Hazards, Influence on Instruction sets, Data path and control considerations, superscalar operations, Ultra SPARC II example, performance considerations, pipeline reservation tables and scheduling.
Module-3 (10 hours)
Array processors: SIMD Array processors, SIMD Interconnection networks.
SIMD Computers and performance Enhancement: The space of SIMD Computers, The Illiac-IV and the BSP systems, The massively parallel processor, Performance Enhancement methods.
Module-4 (12 hours)
Multiprocessor: Functional structures, Interconnection networks, Parallel memory organizations, some example of multiprocessor: C.mmp, S-1, HEP, Mainframe multiprocessor systems, Cray X-mp.
Text Book:
1) Computer Organization by Carl Hamacher, Zvonko Vranesic, Safwat Zaky, INTERNATIONAL EDITION
2) Computer Architecture and parallel processing by Kai Hwang & Faye A. Briggs, McGraw Hill International Edition
CPES 5302 DIGITAL SIGNAL PROCESSING (3-0-0)
Module – I (10 hours)
Discrete Time Signals and System
Discrete Time Signals (Elementary examples, classification : periodic and a periodic Signals energy and Power signals, Even and Odd Signals) .
Discrete Time System :
Block diagram representation of discrete time systems, classification of discrete time systems –static and dynamic, time variant and time – invariant, linear and non-linear, casual and anti-casual, stable and unstable.
Analysis and response (convolution sum ) of discrete - time linear LTI system, Recursive and Non-recursive discrete time system. Constant coefficient differences equations and their solutions, impulse response of LTI system , structures of LTI systems Recursive and Non-recursive realization of FIR system. Correlation of dispute time Signal.
Selected portions from Chapter 2 (2.1, 2.2,2.3,2.4,2.5, 2.6.1) of Textbook – I
Chapter 1 of Textbook- 2.
Module – II (10 hours)
The Z transform
The Z-transform and one-sided Z-transform, properties of Z-transform , inverse of the Z-transform , Solution of difference equations.
Selected portions from Chapters 3 (3.1, 3.2,3.5) of Textbook – I
Selected portion of chapter 4 of Textbook - 2
The Discrete Fourier Transform
The DFT and IDFT, relationship , DFT with Z- transform , the DFT as a linear transformation Relationship of DFT with Z-transform , properties of DFT: periodicity, linearity, summery and time reversal of a sequence.

37
Circular convolution, circular correlation, circular correction by convolution, method linear convolution by overlap save methods and by overlap add method, Circular convolution and correlation by DFT method, Overlap add and save filtering by DFT method.
Selected portion from Chapter – 5 (5.1.2,5.1.3,5.1.4,5.2,5.2.1,5.2.2, 5.2.3, 5.3.2) of textbook – 1.
Selected portion of chapter 6 of textbook - 2.
Module- III (10 hours)
Fast Fourier Transform :
Operation counts by direct copulation of DFT, Radix – 2 FFT algorithm- Decimation –in-time (DIT) and Decimation – in frequency (DIF) algorithm, Efficient computation DFT of Two real sequences , Efficient Computation of DFT of a 2 N-pt real sequences.
Selected portions from chapter 6 (6.1.1,6.1.3, 6.2.1, 6.2.2) of Text book –I
Selected portions from chapter 7 and 8 of Text book – 2.
Design and Digital Filters:
Casually and its implication, Design of linear phase FIR filters using different windows. Design of IIR filters – Impulse Invariance Method and Bilinear transformation method.
Selected portions from chapter 8 (8.1.1, 8.2.1, 8.2.2., 8.3.2,8.3.3.) of Text book – I
Module – IV (10 hours)
Estimation of spectra from finite duration signals, Non-parametric method of power spectrum estimations.
The Bartleff method and the Blackman and Tukey method.
Selected portion from chapter 12 of Text book - 1: 12.1,12.1.1,12.1.2,12.1.3,12.2.1, 12.2.3.
Selected portion from chapter 12 of Text book – 2
Implementation of Discrete Time System structure of FIR systems – Direct form, cascaded form.
Structure IIR Systems - Direct form I & II realizations
Selected portions from chapter 7 (7.2, 7.2.1, 7.2.2, 7.3, 7.3.1 ) of Text book –I
Selected portions from chapter 9 of Text book – 2.
Text Books
1. Digital Signal Processing – Principles, Algorithms and Applications by J. G. Proakis and D. G. Manolakis, 3rd Edition, Pearson.
2. Digital Signal Processing by S. Salivahanan, TMH
Reference Book :
1. Introduction of Digital Signal Processing – J. R. Johnson, PHI.
PECS 3301 ARTIFICIAL INTELLIGENCE (3-0-0)
Module – I 10 hours
Introduction to Artificial Intelligence : The Foundations of Artificial Intelligence, The History of Artificial Intelligence, and The State Of The Art.
Intelligent Agents : Introduction, How Agents should Act, Structure of Intelligent Agents, Environments.
Solving Problems by Searching : problem-Solving Agents, Formulating problems, Example problems, and Searching for Solutions, Search Strategies, Avoiding Repeated States, and Constraint Satisfaction Search.

38
Informed Search Methods ; Best-First Search, Heuristic Functions, Memory Bounded Search, and Iterative Improvement Algorithms.
Module – II 10 hours
Agents That Reason Logically ; A Knowledge-Based Agent, The Wumpus World Environment, Representation, Reasoning & Logic prepositional Logic : A very simple Logic, An agent for The Wumpus World.
First-Order Logic ; Syntax and Semantics, Extensions and National, Variations, using First Order Logic, Logical Agents for The Wumpus World, A Simple Reflex Agent, Representing Charge in the World, Deducing Hidden Properties of the World, Preferences Among Actions, Toward A Goal-Based Agent.
Building a Knowledge Base ; Properties of Good and Bad Knowledge Bases, Knowledge Engineering. The Electronic Circuits Domain, General Outology, The Grocery Shopping World.
Inference in First-Order Logic : Inference Rules Involving Quantifiers, An Example Proof. Generalized Modus Ponens, Forward and Backward, Chaining & Completeness, Resolution : A complete Inference Procedure, Completeness of Resolution.
Module – III 10 hours
Planning : A Simple Planning Agent Form Problem Solving to Planning. Planning in Situation Calculus. Basic Representations for Planning. A Partial-Order planning Example, A partial Order planning Algorithm, Planning With partially Instantiated Operators, Knowledge Engineering for Planning.
Making Simple Decision : Combining Beliefs and desires under uncertainty. The Basis of Utility Theory, Utility Functions. Multi attribute utility Functions, Decision Networks. The Value of Information. Decision - Theoretic Expert Systems.
Learning in Neural and Belief Networks' How the Brain Works, Neural Networks, perceptions, Multi-layered Feed Forward Networks Applications Back propagation algorithm Applications of Neural Networks.
Module – IV 10 hours
Knowledge in Learning ; Knowledge in Learning, Explanation-based Learning, Learning Using Relevance Information, Inductive Logic programming.
Agents That Communicate ; Communication as action, Types of Communicating Agents, A Formal Grammar for A subset of English Syntactic Analysis (Parsing), Definite Clause Grammar (DCG), Augmenting A Grammar. Semantic Interpretation. Ambiguity and Disambiguation. A Communicating Agent.
Practical Natural Language processing Practical applications. Efficient Parsing Scaling up the lexicon. Scaling up the Grammar Ambiguity. Discourse Understanding.
Text book :
Russell S J & Norvig P, Artificial Intelligence ; A modern Approach (ISBN 0- 131-038-052) Prentice-Hall Inc, 2002.

39
Reference Book :
1. Winston P H, Artificial intelligence (3rd Edition) (ISBN 0-201 - 533 - 744) Addison Wesley 1992.
2. Rich E Knight K, Artificial Intelligence (2nd Edition) (ISBN 0-070-522-634) McGraw Hill 1991.
CPEC 5308 COMMUNICATION ENGINEERING (3-0-0)
Module - I (12 hours)
Elements of Communication System – Analogue System, Digital System, Distinguishing features. Electromagnetic Spectrum. Bandwidth. Comparision between Analogue & Digital Communication Systems. Baseband Signals
Analogue Signal, Digital Signal. Converting an analogue signal to Digital Signal: Sampling, Nyquist Criteria. Information and Sampled value. Quantization and Binary Coding of sampled values . Transformation of Base band signal from Time domain to Frequency domain and Vice-versa. F . T. of few simple baseband signals.
Time Division Multiplexing (TDM), Frequency Division Multiplexing (FDM). Inter Symbol Interference and Crosstalk. Digital Baseband Signal Formats – Unipolar, Bipolar, NRZ and RZ. Pulse Code Modulation, Quantization error. Companding –Pre-emphasis and De-emphasis. TDM of 8-bit PCM Signal. Digital Baseband Reception. Conceptual definition of Matched Filter. Binary Matched Filter Detector.
Module - II (12 hours)
Modulation Techniques :
Need for Modulation, Analogue Modulation Techniques : Amplitude Modulation (AM), Depth of Modulation, Modulated Waveform, Powers in Carrier, and Sidebands. Generation of DSBC and SSB, Balanced Modulator, AM Demodulators. Frequency Modulation (FM) – Frequency Deviation , Frequency Modulated Waveform, Spectrum. Narrow Band FM and Wideband FM. Generation of FM; Narrow Band FM Modulator, Wideband FM Modulator, FM Discriminator.
Digital Modulation Techniques
Phase Shift Keying (PSK), Frequency Shift Keying (FSK) – their Basic Principle, Waveform , Generation and Detection. Ideal low pass, Bandpass and Band rejection filters – their impulse response (no mathematical derivation).
Module – III (11 hours)
Noises in Communication Systems : Sources of Noise, White noise, Narrow Band Noise. Spectral Density Function of Noise (no derivation explaining its utility in noise performance evaluation of a Communication System). Performance of Communication Systems in the Presence of noise: SNR of AM, FM. PSK-PCM- Simple derivation and or Interpretation of Standard SNR expressions in each case.
Noise bandwidth, Available Power, Noise temperature Two port noise Bandwidth, Input Noise Temperature , Noise Figure, Equivalent noise temperature of a cascade. An example of a receiving system.
Antennas and Propagation of Radio Waves :
Dipole Antenna and Parabolic Reflector Antenna- their Principle of Operation, Radiation Pattern and Gain Propagation of Radio wave over ground and through ionosphere . Line of Sight Propagation of Microwave Signal.

40
Module – IV (10 hours)
Modern Communication Systems:
Brief description of fiber optic communication System : Block Diagram, Range of operating Wavelength , Optical Fiber, Optical Sources - LEO & LASER, Optical detectors; Concept of GH2 - km Bandwidth . Advantages of fiber optic system,
Brief description of Satellite Communication Systems : Block diagram. Frequency bands of operation, uplink and down link frequencies, Transponder , earth stations, Types of Antenn mounted on satellites. Services available through satellite.
Mobile Communication
Cellular Communication System : Block Schamic description , Cellular frequency bands, digital Technology , Cellular Concept, Capacities, Roaming facilities . Received Signal, Fading concept of diversity reception. Multiple access facilities.
Text Books :
1. Analog and Digital Communication Systems 5th Edition by Martin S. Roden. SPD Publisher Selected portion from Ch. 1,2, 3,4 and 5.
2. Principle of Communication System by H. Tanb and D. L. Shilling .
3. Communication Systems by R.P. Singh and S. D. Sapre. TMH.
Additional Reading :
1. Communication Electronics - Principles and Applications, 3rd Edition by Louis E. Freuzel. (For topics 6,7, and 8)
PEBT 8301 BIO INFORMATICS (3-0-0)
Module I 12 hours
Introduction to Genomic data and Data Organization : Sequence Data Banks - introduction to sequence data banks - protein sequence data bank. NBFR-PIR. SWISSPORT. Signal peptide data bank, Nucleic acid sequence data bank -GenBank, EMBL nucleotide sequence data bank. AIDS virus sequence data bank. PRNA data bank, structural data banks - protein Data Bank (PDB). The Cambridge Structural Database (CSD) : Genome data bank - Metabolic pathway data ; Microbial and Cellular Data Bank.
Module II 12 hours
Introduction to MSDN (Microbial Strain Data Network) : Numerical Coding Systems of Microbes, Hibridoma Data Bank Structure, Virus Information System Cell line information system ; other important Data banks in the area of biotechnology/life sciences/biodiversity.
Sequence analysis : Analysis Tools for Sequence Data Banks : Pair wise alignment - NEEDLEMAN and Wunsch algorithm, Smith Waterman, BLAST, FASTA algorithms to analyze sequence data ; Sequence patterns motifs and profiles.
Module III 10 hours
Secondary Structure Predictions ; prediction algorithms; Chao-Fasman algorithm. Hidden-Markov model, Neural Networking.

41
Tertiary Structure predictions ; predication algorithms ; Chao-Fasman algorithm. Hidden-Markov model, Neural Networking.
Module IV 10 hours
Applications in Biotechnology : Protein classifications, Fold libraries, Protein structure prediction : Fold recognitions (threading), protein structure predictions : Comparative modeling (Homology), Advanced topics : Protein folding, Protein-ligand interactions, Molecular Modeling & Dynamics, Drug Designing.
Books
1. Lesk, Introduction to Bio Informatics, OUP
2. Introduction to Bio-informatics, Atwood, Pearson Education
3. Developing Bio-informatics Computer Skills, Cynthia Gibas and Per Jambeck.2001 SPD
4. Statistical Methods in Bio-informatics, Springer India
5. Beginning Perl for Bio-informatics, Tisdall. SPD
6. Biocomputing ; Informatics and Genome Project, Smith, D.W. 1994, Academic Press, NY
7. Bioinformatics ; A practical Guide to the Analysis of Genes and proteins. Baxevains. A.D. Quellette, B.F.F., John Wiely & Sons.
8. Murty CSV, Bioinformatics, Himalaya
PRACTICALS
BCSE 9304 OPERATING SYSTEM LAB. (0-0-3)
1. Study of UNIX Command
2. Introduction to LINUX (Any distribution can be used)
3. Shell scripting for UNIX/ LINUX systems
4. Study of Windows NT/ 2000 features
5. Study of File systems : UNIX/ FAT/ NTFS
6. Introduction to the Windows Registry
7. A study project on any one aspect of modern operating systems
CPEC 9306 DIGITAL SIGNAL PROCESSING LAB. (0-0-3)
1. Simulation of Various DSP fundamental in Mat Lab or C
2. Design of Filters in MAT Lab or C
3. Some experiments on DSP on trainer Kits on any brand ( TI, Analog Etc) involving study of the processor commands and processor architecture. The student should understand how the DSP Chip Architecture is different from the Architecture of a general purpose processor


Did you like this resource? Share it with your friends and show your love!




Responses to "Bput 4th and 5th semester syllabus(CSE)"

No responses found. Be the first to respond...

Feedbacks      

Post Comment:




  • Do not include your name, "with regards" etc in the comment. Write detailed comment, relevant to the topic.
  • No HTML formatting and links to other web sites are allowed.
  • This is a strictly moderated site. Absolutely no spam allowed.
  • Name:   Sign In to fill automatically.
    Email: (Will not be published, but required to validate comment)



    Type the numbers and letters shown on the left.


    Submit Article     Return to Article Index

    Awards & Gifts
    Active Members
    TodayLast 7 Daysmore...

    ISC Technologies, Kochi - India. Copyright © All Rights Reserved.