Are you sure?
This action might not be possible to undo. Are you sure you want to continue?
E in IT
SECOND YEAR FIRST SEMESTER A. Theory Sl. Code No. 1 2 3 4 5 6 M 301 EE 301 M(CS ) 312 EC 311 EC 312 CS 302
Theory
Mathematics Circuit Theory & Networks Numerical Methods & Programming Electronic System Design Digital Electronics & Logic Design Data Structures & Algorithms Total Theory Digital Electronics & Logic design Lab Data Structure Lab Numerical Methods & Programming Lab
Contacts Periods/Week L T 3 1 3 1 3 0 3 3 3 0 1 1
Credits P Total 4 4 3 3 4 4 22 3 3 3
4 4 3 3 4 4 22 2 2 2
B. Practical 1. EC 382 2. 3. CS 392 M(CS ) 382 EE 391


3 3 3
4.
Circuits & Networks Lab Total Practical Total of Semester


3
3 12 34
2 8 30
1
West Bengal University of Technology BF142,Salt Lake City,Kolkata700064 Syllabus of B.Tech/B.E in IT
SECOND YEAR SECOND SEMESTER A.THEORY: A. Theory Sl. No. 1 2 3 Code Theory Contacts Periods/Week L T 3 1 3 0 3 0 Credits P 0 0 0 Total 4 3 3
M 401 IT 401 CS 404
Mathematics Analysis & Design of Information System Computer Organization & Architecture
4 3 3
4
EC 411
Principles of Communication Engineering
3
0
0
3
3
5
EE 411
Control System Total Theory
3
1
0
4 17
4 17
B.PRACTICAL: Sl. No. Code Practicals B. Practicals Contacts Periods/Week L 0 T 0 P 3 Total 3 Credits
1
EC 481
Communication Engineering laboratory Control Systems Lab Information System Design Lab Computer Organization & Architecture Lab Total of Practical
2
2 3 4
EE 481 IT 491 CS 494
0 0 0
0 0 0
3 3 3
3 3 3 12
2 2 2 8
C. SESSIONAL: HU 481 Technical Report writing & / Language Practice Lab TOTAL OF SESSIONAL TOTAL of Semester : 0 0 0 3 3 32 2 2 27
2
West Bengal University of Technology BF142,Salt Lake City,Kolkata700064 Syllabus of B.Tech/B.E in IT
THIRD YEAR FIRST SEMESTER A. THEORY
Sl. Code No. 12 CS 501 CS 511
THEORY
Contact Periods/Week L 3 3 T 0 1 P 
Total
Credits
Operating System Operation Research & Optimization Technique Formal Language & Automata Theory
3 4
3 4
3 CS 512
3 Object Technology & UML
1

4
4
4 IT 501 5 EI 502 TOTAL THEORY B. PRACTICAL Sl. Code No. 1 2 3 4 CS 591 CS 581 IT 591 EI 592 PRACTICAL Contact Periods/Week L 0 0 0 0 T 0 0 0 0 P 3 3 3 3 Total Credits 3 1 4 18 4 18 Microprocessor & Microcontrollers 3 0 3 3
Operating System Lab Operation Research Lab Object Technology Lab Microprocessor & Microcontrollers Lab TOTAL PRACTICAL SESSIONAL
3 3 3 3 12 Total
2 2 2 2 8 Credits 0 0
C. SESSIONAL Sl. Code No.
0 TOTAL OF SESSIONAL TOTAL OF SEMESTER
0
0
0 0 30 26
Sixth Semester A. THEORY Code 1. 2. 3. 4. 5. IT 601 IT 602 IT 603 IT 604 IT 605 Subjects Software Engineering & Project Management Management Information System Data Communication & Networking Database Management System Multimedia Technology & Applications Total of Theory 3 L 3 3 3 3 3 15 Contacts (periods/week) T P Total 1 0 4 0 1 1 1 4 0 0 0 0 0 3 4 4 4 19 Credit points 4 3 4 4 4 19
West Bengal University of Technology BF142,Salt Lake City,Kolkata700064 Syllabus of B.Tech/B.E in IT
B. PRACTICAL: B. PRACTICAL Code 1. 2. 3. IT 693 IT 694 IT 695 Subjects Data Communication & Networking Lab DBMS Lab Multimedia Technology & Applications Total of Practical L 0 0 0 Contacts (periods/week) T P Total 0 3 3 0 3 3 0 3 3 9 Credit points 2 2 2 6
C. SESSIONAL: C. SESSIONAL Code 1. IT 682 Subjects Gr. Discussion & Communication Skill Total of Sessional Total of 6th Semester L 0 Contacts (periods/week) T P Total 0 3 3 31 Credit points 2 27
Six Weeks Industrial Training During Summer Vacation SEVENTH SEMESTER Sl. No. 1. 2. 3. A. THEORY Code THEORY Contact Periods/Week L 3 3 3 3 T 1 1 0 0 P Total Credits
IT 701 IT702 HU 701
Internetworking Web Technology Financial Management & Accounts Elective I
4 4 3 3 14
4 4 3 3 14
4. IT 703 TOTAL THEORY
Sl. No. 1. 2. 3.
B. PRACTICAL Code
PRACTICAL
Contact Periods/Week L 0 0 0 T 0 0 0 P 3 3 6
Total
Credits
IT 791 IT 792 IT 795
Internetworking Lab Web Technology Lab Assigned Project
3 3 6 12
2 2 4 8
TOTAL PRACTICAL
Sl. No. 1. 2.
C. SESSIONAL Code SESSIONAL L 0 0 T 0 0 P 0 3
Total
Credits
Practical Training Evaluation Seminar on Assigned / Selected Topic TOTAL OF SESSIONAL TOTAL OF SEMESTER 4
IT 781 IT 782
0 3 3 29 26
2 2 4
Tech/B. 2. SESSIONAL Code 1. Hu 881 IT 882 IT 883 Subjects Gr. IT 801 IT 802 HU802 IT 803 Subjects ECommerce Elective. Discussion on Professionalism Grand Viva Voce Assigned Project Contacts (periods/week) L T P 0 0 3 0 0 0 0 0 0 3 12 9 Credit points Total 3 3 12 18 33 ELECTIVE III (any one) IT 803A Data Compression and Cryptography IT 803B Principles of Language Translation IT 803C Design and Analysis of Algorithms IT 803D Artificial Intelligence 2 2 8 12 26 Subjects ECommerce Lab Contacts (periods/week) L T P 0 0 3 Credit points Total 3 3 2 2 Total of Sessional Total of Eighth Semester ELECTIVE II (any one) IT 802A Data Warehousing and Data Mining IT 802B Business Information System IT 802C VLSI Design IT 802D Mobile Communications 5 .II Industrial Management ElectiveIII Total of Theory Contacts (periods/week) L T P 3 0 0 3 0 0 3 0 0 3 0 0 9 0 0 Credit points Total 3 3 3 3 12 3 3 3 3 12 B. 3. SEMESTER VIII A.Salt Lake City.E in IT ELECTIVE I IT 703A Computer Graphics IT 703B Image Processing & GIS IT 703C Soft Computing IT 703D Distributed Computing IT 703E Information Theory & Coding COURSE STRUCTURE IN INFORMATION TECHNOLOGY FOURTH YEAR SECOND SEMESTER.Kolkata700064 Syllabus of B. THEORY Code 1. PRACTICAL Code 1. 3. IT 891 Total of Practical C. 2. 3.West Bengal University of Technology BF142.
concept of tree branch. Cut set matrix and node pair potentials Two port networks. Estimation of parameters (consistent and unbiased). Correlation and Regression. Testing of Equality of Means. Type I and Type II Errors. t and χ2. Bayes’ theorem and related problems.West Bengal University of Technology B. Loop variable analysis and node variable analysis Graph of network. Counting techniques applied to probability problems. Interval estimation. χ2—Test of Goodness of Fit (application only). Random Events. Reproductive Property of Binomal. Sample. Transmission parameters. Formulation of network equations. Axiomatic definition of probability. Uniform. Statistic. Poisson and Normal Distribution (proof not required). Level of Significance. Normal. Distributions: Binomial. and simple problems. and their interrelations Indefinite admittance matrix. Incidence matrix. Sample space. Statistics: Population. NeymanPearson Theorem (proof not required). hybrid parameters. Transformation of random variables (One variable). Chebychev inequality (statement) and problems. Likelihood Ratio Test (proof not required). Fourier Series and Fourier Transform Network theorems and their applications in circuit analysis. Point estimate: Maximum likelihood estimate of statistical parameters (Binomial. Law of large numbers (Weak law). Linear and Nonlinear. Moment generating function. Probability of events. Lumped and distributed. Source transformations. Critical Region. Comparison of Binomial Populations. Random variables (discrete and continuous). Poisson and Normal distribution).their applications to the analysis of active network Active filter analysis and synthesis using operational amplifier 6 . Probability density function and distribution function. Transient analysis of different electrical circuits with and without initial conditions. Best Critical Region. General Multiplication Theorem. Conditional probability. Passive & Active Networks & Systems Laplace transform of impulse and sinusoidal steps waveforms for RL. Simple idea of Bivariate distribution. Sampling distribution of sample mean and sample variance (proof not required). Independent events. Frequency Definition of probability. Tieset matrix and loop currents. Open circuit Impedance and Short circuit Admittance parameters. tree link. Poisson. Exponential. Testing of Hypothesis: Simple and Composite hypothesis. Simple applications. Probability of Nondisjoint events (Theorems). Application to Normal Population. Central Limit Theorem (statement). RC. Total 10L 10L 6L 18L 4L 48L Circuit Theory & Networks Code: EE 301 Contact: 3L + IT Credit: 4 Different types of systems & networks: continuous & Discrete. Binomial approximation to Poisson distribution and Binomial approximation to Normal distribution (statement only). Fixed and Time varying.E/B. Expectation and Variance (t and χ2 excluded). Normal Populations. Finite sample spaces and equiprobable measure as special cases. Probability mass function.Tech in Information Technology Mathematics Code: Contact: Credit: M 301 3L + IT 4 Probability: Random Experiment. LC and RLC Circuits.
E/B. Numerical Solution of System of Linear Equations: Gauss elimination method. Filters & Transmission Lines 6.V.Wilsky: Signals & Systems. Error. Circuits. Sufficient Condition of Convergence. input and output Impedance. LU Factorization Method (Crout’s Method).Graw Hill Book Company 2.Sivandam. Chakravarty: Networks. sensitivity analysis.S. 3.A. Problems. Prentice Hall.EPH.Jalgaonkar.C. Simson’s 1/3rd formula (composite).Engg Circuit Analysis. Newton’s Divided Difference Formula. Matrix Inversion. voltage controlled components Text books : 1. Romberg Integration (statement only).Tech in Information Technology SPICE: How SPICE works.Rakshit: Electrical Circuits 7.C. 2L 4L 1L 2L 6L 4L 7 . Model statement. M.: Hayt 6/e Tata McgrawHill 5. and Seely S. Sudhakar:Circuits & Networks:Analysis & Synthesis 2/e TMH New Delhi 2.Electric Circuits Analysis.: Network Analysis & Synthasis. Mc.Chattopadhyay and P. Problems. 1. Secant Method. Propagation and control of round off errors. “Modern Network Analysis”. Numerical Solution of Algebraic and Transcendental Equations: Iteration Method: Bisection Method. “Network Analysis & Synthesis”. Kuo F.Engineering circuit analysis with PSPICE and probeRoger 4... Harmonic recomposition.. circuits analysis. capacitors and inductors in D. Approximation in numerical computation. RegulaFalsi Method. Pitfalls (hazards) in numerical computations (ill conditioned and well conditioned problems). Valkenburg M. Oppenheimer and A. New Age International Publishers. Newton’s forward & backward Interpolation Formula. harmonic decomposition (Fourier Series). plotting and printing. steady state and transient. Chopping and rounding off errors. Van. “Network Analysis”. 9.D. Extrapolation.West Bengal University of Technology B. Numerical Differentiation: Use of Newton’s forward and backward interpolation formula only. John Wiley & Sons. Reza F. F. Overflow and underflow. NewtonRaphson Method.C.A.Vikas References : 1. “Networks and Systems”. models for passive and active device. small signal analysis. E.Roy Choudhury D. Numerical Integration: Trapezoidal formula (composite). Truncation and round off errors. Operations Count. D. GaussJordan Method. Numerical Methods and Programming Code: M(CS) 312 Contacts: 3L Credits: 3 Computer Number Systems. D.V. PHI 8. GaussSeidel Method. Algorithmic Approach in C Language to all the Numerical Problems Discussed below must be followed: Interpolation: Lagrange’s Interpolation.R.C.
& Jain Numerical Methods In Computer Applications – P. RungeKutta Method (4th order). Log & anti log amplifiers.N.U.. precision rectifier. Function. Pointers. Temperature.Tech in Information Technology Numerical solution of Initial Value Problems of First Order Ordinary Differential Equations: Taylor’s Series Method. Random. differential & instrumentation amplifiers.Wayse.New Age International Numerical Methods for Scientific & Engg Computation – Jain M.Scarborough Numerical Methods (Problems and Solution) by Jain. 8 ..Rao.Dutta.B.S.S. pH etc) measurements Function Generators: sine. Pradeep Niyogi. first & second order high pass butterworth. divider. Universities Press Numerical Methods for Engineers – Gupta.. C Language and Numerical Methods by C. Indexed Sequential. New Age International Foundations of Discrete Mathematics – Joshi K. Array. New Age International Groups.B.K. 6L C Language Overview: Loop.Universities Press Electronic System Design Code: EC 311 Contact: 3L Credit: 3 Various components for electronic system design: Operational Amplifier: Inverting.New Age International Numerical Analysis – Rao G. multiplier. 1st ed. noninverting.Dutta. Structures and Unions.New Age International Discrete Mathematical Structures – Rao G. New Age International Numerical Solutions of Differential Equations – Jain M. triangular. Recursion.Franco S. Universities Press Computer Programming & Numerical Analysis – N. square. differentiator. M... and saw tooth waveform Comparators: inverting. Euler’s Method. Rings & Modules with Applications – Adhikari. and astable multivibrator V to F and F to V converter Linear voltage regulators: fixed and adjustable Text books: 1. integrator. voltage to current (both live and zero based) converter. TMH. Various types of File Access Methods: Sequential. band pass .E/B. Schmitt trigger and window comparator Active filters design: first & second order low pass butterworth.Xavier Introductory Numerical Analysis by Dutta & Jana Numerical Method:Balagurusamy Numerical Mathematical Analysis by J.S. band reject and all pass filter IC 555 Timer: monostable. Design with OP AMPs and Analog Ics. Modified Euler’s Method and AdamsMoulton Method. Iyengar .floating and grounded load current ( both live and zero based) to voltage converter.K. . noninverting. strain.R.. New Age International Applied Discrete Structures – Joshi. Text Books: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 11L 36L Numerical Analysis & Algorithms. Tata McGraw Hill Int.D.West Bengal University of Technology B. electronic analog computation System design for physical parameter (viz. Various types of Files in C and Various types of File Handling Statements in C Total Implementation above Numerical & Statistical Problems in C Language. Binary. EPH Computer Oreinted Numerical Method.Vikas Numerical Methods with Programs in Basic Fortran Pascal & C++ .
Hexadecimal.Shilling.F. Y. application. Jain :Modern digital Electronics TMH 6. subtractor. ISTE/EXCEL BOOKS 4.E/B.Marcovitz:Intro to Logic design McgrawHill 9. Linear linked lists. Doubly linked lists. Removal of recursion. OP AMPs and Linear Integrated Circuits. encoder.F. Venn diagram. Digital Circuits and Design. their operation.adder. Saroj Rangnekar.Arrays and Lists. State table and state transition diagram. When not to use recursion. Digital Electronics Dr. ASCII.A.ROM. Gray. Binary representation. multiplexer. EPROM. various types of Registers and counters and their design. sequential circuits design methodology Memory devices. PHI 4.PHI 5. Linear Data Structures . Linear Integrated Circuites & Applications. etc Different types of A/D and D/A conversion techniques Different Logic families. Digital Logic Design. Stacks. Mc. EEPROM.Morries Mano.Venkatramani. Link Representation. strings.Tobey & Graene. Octal. Operational Amplifier : Design and application. Linear Integrated Circuits. Tail Recursion. EBDIC. Mc Graw Hill 7. Salivan.H. decoder.Digital Circuits and Design.Digital Technology. OP AMPs and Linear Integrated Circuits.Taub & D. MOS and CMOS.: Tusar Jadav. Queues and Dequeues. Codes and their conversions: BCD.Order Notations. & Driscoll F. Malvino :Digital principles & Application 5. Linear Data Structures. ECL. logic gates and circuits.Virendra Kumar. Minimization of logic expressions by algebraic method. RAM.Gayakwad R. Recursion .Design of recursive algorithms. comparator.Vikas Digital Electronics & Logic Design Code : EC 312 Contacts : 3L + 1T Credits : 4 Data and number systems.West Bengal University of Technology B. New Age 8.Graw Hill 6.Flip Flops.Vikas Data Structures and Algorithms Code: CS 302 Contact: 3L + IT Credit: 4 Overview of C language Time and Space analysis of Algorithms . ISTE/EXCEL BOOKS 3. PHI 3. demultiplexer. Application.Digital Integrated Electronics.Coughlin R. Givone:Digital Principles &design Tata McGraw Hill 2. design and specifications Text books: 1. etc Design of combinational circuitsProgramming logic devices and gate arrays Sequential Circuits. Binary arithmetic Boolean algebra.TTL.Tech in Information Technology 2. 9 . Signed binary number representation with 1’s and 2’s complement methods.Sequential representations . Circularly linked lists.. Kmap method and Quine Mc Clauskey method Combinational circuits. Irregular counter. 6.EPH. parity generator.
Heightbalanced and weightbalanced trees. V. “Data Structures using ‘C’ ” Digital Electronics & Logic Design Lab Code: EC 382 Contact: 3P Credit: 2 List of Experiments: 1. Graphs .G. XNOR gates using universal gates 2. Hashed Files. UIlman Jeffrey D. Heap sort and Radix Sort File Structures . .Data Structures and Algorithms. A. JK. B+ trees. 2. Cybertech. Text book : 1. Realization of RS . A.Representations. Ajoy Agarwal. Digital to Analog conversion Data Structure Lab Code: CS 392 Contact: 3P Credit: 2 Experiments should include but not limited to: Implementation of array operations Stacks and Queues: adding. Multiindexed Files. Insertion and Deletion algorithms. Relative Files. Hashing . Merge Sort. deleting elements Circular Queue: Adding & deleting elements Merging Problem: Evaluation of expressions operations on Multiple stacks & queues : Implementation of linked lists: inserting. Galgotria Pub.B+ tree as index.. Lipschutz: Data Structures TMH References : 1.. Breadthfirst and Depthfirst Search. 4. Gray to Binary conversion & viceversa. Code conversion between BCD and EXCESS3 3. XOR. Deshpandey.. Adder/Subtractor circuits using FullAdder using IC and/ or logic gates. B.Srinivasan. Realization of Synchronous ModN counter 10. Polynomial multiplication 10 . “Algorithms. Sorting and Searching Algorithms .West Bengal University of Technology B.Binary Trees. AND. A.A. Insertion Sort. S. Addison Wesley 3. Binary Search Trees. 4bit comparator circuit 4. Data Structure Using C – M. B. Design of combinational circuits using multiplexer 6. Indexed Files .Bubble sort.Tech in Information Technology Nonlinear Data Structure: Trees . Kakde and U. ODD and even parity generation and checking. Quick sort. Vikas 1. Realization of Asynchronous up/down counter 9.E/B. and D flip flops using Universal logic gates 8.Sequential and Direct Access. B. Drozdek. and Problem Solving with C++”. 3. ISTE/EXCEL BOOKS 2.Hashing Functions.. ISTE/EXCEL BOOKS 2.: Data Structures Through C. Aho Alfred V. OR. “Fundamentals of Data Structures”.Heileman :Datastructure Algorithims &OOP 2.Weiss Mark Allen. Btrees. deleting. Application of trees.Realization of NOT. collision Resolution Techniques. and inverting linked list. “Data Structures and Algorithms”. Inverted Files. Horowitz Ellis & Sartaj Sahni. Hopperoft John E. Selection Sort.Radhakrishnan. Addison Wesley. Traversals and Threads. Data Structures and Algorithms. Implementation of stacks & queues using linked lists Polynomial addition. Tanenbaum A. BCD Adder circuit using IC and/ or logic gates 7. Design of combinational circuit to drive sevensegment display 5. Data Structures. O.
6. Lagrange. 2. 5. Damped sinusoidal. Recursive and Nonrecursive traversal of Trees Threaded binary tree traversal. RungeKutta (4th Order). Determination of Laplace transform and inverse Laplace transformation using MATLAB 10. Weddle’s Rule. Impulse. Representation of poles and zeros in zplane.West Bengal University of Technology B. RegulaFalsi. Mode. Assignments on Interpolation: Newton forward & backward. 6. Simson’s 1/3rd Rule. 2. Linear Correlation & Regression. Assignments on Statistical Problems: Mean. Application of Trees. AVL tree implementation. Assignments on Numerical Integration: Trapezoidal Rule. 5. Transient response in RL and RC Network: Simulation/hardware Transient response in RLC Series & Parallel circuits Network: Simulation/hardware Determination of Impedance (Z) and Admittance(Y) parameters of two port network Frequency response of LP and HP filters Frequency response of BP and BR filters Generation of Periodic. Assignments on Solution of Algebraic Equations: Bisection. inserting and deleting. Gauss Jordan.Tech in Information Technology Sparse Matrices: Multiplication. Euler’s Method. Application of sorting and searching algorithms Hash tables implementation: searching. Secant. Circuits & Networks Lab Code: EE 391 Contact: 3P Credit: 2 List of Experiments: 1. determination of partial fraction expansion in zdomain and cascade connection of second order system using MATLAB 9. NewtonRaphson Methods. Ramp signals using MATLAB in both discrete and analog form 7. Assignments on Numerical solution of a system of Linear Equations: Gauss elimination. Median.E/B. Step. 3. 4. Assignments on Ordinary Differential Equations: Taylor Series. Matrix Inversion. Exponential. searching & sorting techniques. Standard deviation (for simple & frequency type data). addition. 3. Discrete Fourier transform for periodic & nonperiodic signals and simulation of difference equations using MATLAB 8. Numerical Methods Lab Code: M(CS) 382 Contact: 3P Credit: 2 1. Sinusoidal. 4. Gauss Seidel. Spectrum analysis of different signals Note: An Institution/College may opt for some other software or hardware simulation wherever possible in place of MATLAB 11 . Evaluation of convolution integral.
Liu C. Robert B. “Graph Theory with Applications to Engineering and Computer Science”. “Discrete mathematical structures”. permutation groups.Balakrishnan—Graph Theory (Schaum). 1968 Reference: 1. 9 Fraleigh J. Structured programming. Tata McGraw Hill 6 Deo N. “Discrete mathematical structures with applications to computer science”. BFS. Dijkstra's Algorithm.. Morphisms.direct product. Flow Augmenting Path. P. M. “A first course in abstract algebra Narosa”. Physical and Logical Data Flow Diagrams. “Introduction to combinatorial mathematics”. Ash & Carol Ash. Planar and Dual Graphs. Digraphs. Metric Representation of Graphs. Morphisms. DFS. 2 Mott J. Boolean subalgebra. McGraw Hill. Planning for coding and Testing. and Baker T. Sequence and discrete function. “First Order Logic Springer Verlag”. Structured English. 3 Rosen—Discrete Mathematics. entity relationship diagram. morphism of rings.Prims Algorithm. Boolean Rings. FordFulkerson Algorithm for Maximum Flow. Generating functions and applications.. 12 . Boolean Algebra . Chief programmer Teams. evolutionary Design and Prototyping. Networks. L. L. Design of New Systems. Mapa—Higher Algebra (Abstract & Modern) 5 Robert J. Circuits. System implementation.E/B. 1990 10 Smullyan R. 3/ed. B. ideals and quotient rings. Subgroups and Cosets. 1996. Subrings.K. Semigroups and monoids. Decision tables. Text : 1. Transform and Transaction Analysis. Shortest Path Problem. McElice . 1986. “Discrete mathematics for Computer Scientists and Mathematicians”. 1975 8 Kolamn... PHI. Requirements Analysis. Cotrees and Fundamental Circuits. Graph Thoery :Graphs. Applications of Boolean algebra in logic circuits and switching functions. Cut Sets.. Properties of Trees.West Bengal University of Technology B. Fundamental Cut Sets and Cut Vertices. process specification. Isomorphism.Lipschutz—2000 Solved Problems in Discrete Mathematics.. Paths. Shortest Spanning Trees Kruskal's Algorithm.Tech in Information Technology Fourth Semester INFORMATION TECHNOLOGY Mathematics M 401 Contact: 3L + IT Credit: 4 Sets and functions : Groups. structure charts. Data Modeling. PHI. 1980 7 Tremblay and Manohar. Euclidean domains. PH. Normal subgroups. Integral domains and fields. 1968.Hararay—Graph Theory Analysis and Design of Information System IT 401 Contact: 3L Credit: 3 Information SystemSystems development life cycle. Elementary applications in coding theory. dihedral groups. Cyclic semigroups and submonoids. data dictionary. Trees. Busby and Ross. Congruence relations on Semigroups. Walks. McGraw Hill. Structured Systems Analysis and Design. Project review and walk through. Alternate Life cycles. 2/e. Coupling and Cohesion. Recursion and Recurrence Relation : Basic idea. “Introduction to discrete Mathematics”.TMH 4 S. TMH 2.MH 3. verification and validation. Structure of cyclic groups. Rings and Boolean Algebra : Rings. Kandel A. changeover phase. CASE tools.
VonNeumann concept . PHI Reference: 1. 4.TMH 2.. Sehong L. “Systems Analysis and Design”. implementation of high speed Address Carry Look Ahead & carry Save Address. Computer Organization & Architecture CS404 Contacts: 3L Credits: 3 Concepts & Terminology: Digital computer concepts. Hardware & Software and their nature . Examples of some pipeline in modern processors . Programmed & Interrupt I/O .Hamacher—Computer Organization. concept of virtual memory & paging. Concept of memory map .Mano M. Cache introduction . Associative memory organization .Chaudhury P... and Claggtt JR. Role of operating system. cost benefit analysis. Multiplication of signed binary numbersBooth’s algorithm . Murdic RG.SIMD . Text: 1. effect of bus widths . Divide algorithmsRestoring & NonRestoring .West Bengal University of Technology B. forms design. File design. A. Dahlgren G. Organization of RAM . Wigardes K. Codification and Classifications. Serial & Parallel Address. TMH 3. 3. control structures . inputoutput design. Hardwired & Micro programmed.3/e . “Information Systems for Planning and Control”. techniques to reduce cache misses . PHI. and Prince. address decoding ROM/PROM/EEPROM . Thomas R. Controlling arithmetic & logic instruction . Centralized & distributed architectures. Disk & tape units. speed up . 2. status flags. Integer representation .M—“Computer System Architecture” 4. Addressing modes. 5. “Structured Analysis and Design of Information Systems”.Hayes. Rajaraman V. security and control.Tech in Information Technology Feasibility Study . characteristics .E/B. Control Design – Timing diagrams.. Concept of Multiprocessor.. 1s and 2s complement arithmetic .. McGraw Hill P. Overflow detection . CISC & RISC characteristics. structure & functions of a computer system . Instruction word formats .Choice of instruction set . “Information Systems for Modern Management”.5/e. DMA. Dialogue design. Jalote—Software Engineering Naik Kishore—System Analysis & Design Rogers G Pressman—Software Engineering 13 . TStates . MH Senn J. Pipelininggeneral concept .. Pal—“ Computer Organization & Design” . References : 1. recording formats & methods . MIMD architecturesVector and Array processors & their comparison .Cost estimation. instruction & arithmetic pipeline.Computer Architecture & Organization.. Instruction Set Architecture. 5/e. Documentation. Svensson A. MISD . Input/output Organization : Introduction to Bus architecture . memory hierarchy .MH 2. “Analysis and Design of Information Systems”. Rose J. Text Book : 1. CPU Design: The ALU – ALU organization . Floating point number arithmetic. PHI 3. 4. Memory Unit : Memory classification .Whitten—System Analysios & Design Methods. pipeline hazards. Flynn’s classification –SISD .Carter—Computer Architecture (Schaum Series). Magnetic memories .
. Benjamin C.TMH Carlson R.Stallings W—“ Computer Organization & Architecture” . 3. Lathi B. “Control Systems Engineering”.. Poles and zeros. “Principles of Communication Systems”. Modeling Position Control and Velocity control systems. Ogata K. Data Transmission Synchronization.M. John Wiley. PWM. error detection and correlation. Modems. PAM. Signal flow Graph. Shannon’s sampling Theorem. PHI References : 1. MH Principles of Communication Engineering Code: EC 411 Contact: 3L Credit: 3 Amplitude and Frequency Modulation – their generation and detection Bandwidth requirements Low Power and High Modulators and Modulated amplifiers. 2nd Edn. Control Actions : P. Routh Hurwitz Criteria.. B. Z transforms and discrete data systems. J. Madan Gopal—Control Systems .M. S. 14 . Nyquist Criteria. “Automatic Control Systems”. Time Division Multiplexing and Demultiplexing. Error control and coding. Prentice Hall. “Modern Control Systems”. Potentiometer Characteristics. Frequency response. 2/e . Wiley Eastern. P. “Communication Systems . Open loop and close loop control Transfer function of simple electrical and electromechanical systems. and P. Bode & Nyquist Diagram. Englewood Cliffs. Tacho. “Communication Systems”. Gain margin & phase margin. 2/e. Text : 1. 4/e . Taub H. TMH Control System EE 411 Contact: 3L + IT Credit: 4 Elementary control concepts.TMH 2. L. Mc. J.Kennedy—Electronic Communication Systems. 3. PSK performance evaluation. Their generation and detection. Masson’s Gain formula .E/B... Case studies positional control systems: Servo Motor.West Bengal University of Technology B.4/e. Root Locus.Tech in Information Technology 2. D/A Converters. A/D. 4. Stability analysis. 7th Edn. Kuo.. Introduction to state variable modeling. New Age International (P) Ltd.Graw Hill Haykin S. and Shilling D. and Gopal M.Time Control Systems”. Text books : 1. “Discrete . PPM and PCM. Principles & Application . Prentice Hall. PI & PID Control. Signal to Noise ratio of A. transmission. Elements of Satellite Communication tracking and control. Data protection. Nagrath I.. PD. Ogata K. Englewood Cliffs. Superheterodyne detection. Reference: 1... Transient response of 1st and second order systems. FSK. 3rd Edn. N. 4. Digital Modulation : ASK. “An Introduction to Analog and Digital Communication Systems”. Channel capacity. 2.
Tech in Information Technology 2. Determination of PI. Study of Pulse Width Modulation (PWM). 15 . Patient information system. 4. 8. percentage peak overshoots. phase margin with addition of lead compensator & lag compensator in forward path transfer functions using MATLAB & PSPICE. Type1 & Type2 system with unity feedback using MATLAB & PSPICE. gain margin. 2. Study of Frequency Shift Keying (FSK). Tourist information system. 6. Study of Time Division Multiplexing (TDM) & Demultiplexing. Nyquist plot. PID controller action on 1st order simulated process.E/B. Evaluation of steadystate error. using MATLABControl system toolbox for a given 2nd order transfers function & determination of different control system specifications.. Study of Amplitude modulation & Demodulation technique. Library circulation management system. 7. Study of Single Side Band Suppressed Carrier (SSBSC) & Demodulation technique. Study of position control system using servomotor.West Bengal University of Technology B. 8. Inventory control system. University examination & grading system. setting time. 5. Study of Pulse Amplitude Modulation (PAM). Flight reservation system. 7. Time management software. 3. a) b) c) d) e) f) g) h) i) j) Payroll accounting system. Familiarization with MATLAB. Determination of step response for First order & Second order System with unity feedback on CRO & calculation of control system specifications for variation of system design. 2. for Type0 . PD. 4. Study of Double Side Band Suppressed Carrier (DSBSC) & Demodulation technique. Determination of approximate transfer function experimentally using from Bode Plot. Control System Lab EE 481 Contacts: 3 P Credits: 2 1.Control system tool box . 3. Bodeplot. 6. Simulation of step response & impulse response. ” Control Systems” Communication Engg. 9. Study of VCO (Voltage controlled oscillator) & PLL (Phase Locked Loop). MATLABSIMULINK tool box & PSPICE. Study of Frequency Modulation & Demodulation. Information System Design Lab IT 491 Contacts: 3 P Credit: 2 Case studies using any of the following items including relevant form design with the help of visual programming aids. Judiciary information system. Dasgupta S. Lab EC 481 Contacts: 3 P Credits:2 1. 5. Determination of rootlocus. Bookshop automation software. K.
They also have to face the question answer sessions at the end of their presentation (12 hours) Classes are also allotted to prepare the students for competitive examinations like the T. Review of the different logic design ckts. 5. They then have to face rigorous practices of mockinterviews. 16 .. 3. Strategies of such discussions are to teach to them. Design a BCD adder.The students are made to understand the difference between the language of conversion and group discussion.g. Design a carrylook ahead Adder.g. 6.O. There simulations of real life interview sessions where students have to face an interview panel(12 hours) Presentations: The secrets of an effective presentation are taught to the students. Design an Adder/Subtracter composite unit . e)ShiftRegister. After wards the class is divided into groups and the students have to discuss on given topics on current socioeconomicpoliticaleducational importance(12 hours) Interview sessionsstudents are taught the do’s and don’ts of facing a successful interview. Use ALU chip for multibit arithmetic operation. D. Multiplexer .G. Use wired OR tristate output interconnection. 7.D. The students are also made to listen to prerecorded cassettes produced by British Council and also by the Universities of Oxford and Cambridge (6 hours) Group Discussions:. 10. c) Encoder. JK.E/B. Design a keyboard Encoder unit in 2 Dimension. 6. f)adder Truth Table verification and clarification from Databook. e. 8. It is also helpful to use videocassettes produced by the U. T). e. 4.Tech in Information Technology Computer Organization & Architecture Lab CS 494 Contacts: 3 P Credit: 2 1.L. multiplexer.C. a) Flip/Flop(RS. Introductory lecture is to be given to the students so that they get a clear idea of the syllabus and understand the need for having such a practice lab in the first place(3 hours) Conversion practice is done on given situation topics. a. 2. on topics like groupdiscussion. Use a multiplexer unit to design a composite ALU . by making the students listen to specially produced C. d) Counter. TECHNICAL REPORT WRITING & / LANGUAGE PRACTICE LABORATORY Code: HU 481 Contact: 3 Credits: 2 Topics to be covered and number of hours required for it: 1. 11. 5. cassettes of such examinations (3 hours) 3. Design a multiplex display unit using counter.F.E. 4. 9. Test a RAM chip and cascade two chips for vertical and horizontal expansion. decoder etc. Then each and every student has to make lab presentations with the help of the Overhead projector/ using power point presentation and other audiovisual aids in the laboratory. 2. c)Tristate logic Gates Familiarity with state of art ICchips. Design a ripple counter and carrylook ahead counter and assess the complexity of both the ckts. b)Register.(4/8 bit Synchronized Data Transfer).West Bengal University of Technology B. b) Decoder.
network devices. directory structure. hash table). I/O structure. classical problems of synchronization. blocking and nonblocking I/O). contiguous memory allocation. deadlock detection. virtual machine). Different types of O. storage hierarchy. TMH Fifth Semester Operating System Code: CS 501 Contacts: 3L Credits: 3 Allotted Hrs: 47L Introduction [4L] Introduction to OS..West Bengal University of Technology B. multiprogrammed. storage structure. buffering. Operating system functions. thrashing. swapping. Deadlocks [4L]: system model. CPU scheduling [3L]: scheduling criteria. RR. deadlock characterization. kernel I/O subsystem (scheduling. user and kernel threads. LRU). demand paging. performance. linked. operations on processes. Process Management [17L] Processes [3L]: Concept of processes. different types of protections. distributed. operating system structure (simple. indexed). efficiency & performance. directory implementation (linear list. methods for handling deadlocks. I/O Management [4L]: I/O hardware. spooling and device reservation. file system structure.S. layered.E/B. Sharma—Business Correspondence & Report Writing. segmentation with paging. page replacement algorithms (FCFS. page replacement. interprocess communication. Process Synchronization [5L]: background. critical region. realtime. TMH Reference: 1. clocks and timers. grouping). Prasad—Group Discussion & Interview (With Audio Cassette) . system calls. cooperating processes. logical vs. benefits of threads. Text: 1. scheduling algorithms (FCFS. System Structure[3L] Computer system operation.S. multiprocessor scheduling. File Systems [4L]: file concept. freespace management (bit vector. TMH 2. SJF. parallel. semaphores. deadlock prevention. paging. algorithm evaluation. recovery from deadlock. caching. Storage Management [19L] Memory Management [5L]: background. access methods. critical section problem. DMA. application I/O interface (block and character devices. segmentation. deadlock avoidance. O/S services.Tech in Information Technology The overall aim of this course is to inculcate a sense of confidence in the students and help them to become good communicators in their social as well as professional lives. synchronization hardware. polling. interrupts. linked list.: batch. evaluation of O. Threads [2L]: overview. Sashi Kumar—Spoken English (with Cassette) . timesharing. process scheduling. priority). preemptive & nonpreemptive scheduling. performance. error handling). physical address space. allocation methods (contiguous. 17 . Virtual Memory [3L]: background. allocation of frames.
one time password. basic definitions and notations. boot block. V. SCAN.West Bengal University of Technology B. Text Books / References : 1. disk scheduling (FCFS. New Age International 8. Kapoor – “Operations Research” 3. encryption. Dhamdhere: Operating System TMH 5. system threats.. disk formatting. Replacement Game theory [4L] Introduction. “An Introduction to Operating Systems”. Hillier F. Mital: Optimization Methods. William. M/M/1 queues in series. Maxwell McMillan International Editions. Decisions under risk. “Operating System Concepts”. Hamdy A. “Introduction to Operations Research”. Hadley G. SSTF. Stalling. Optimization.CSCAN) . 1992. application Text Books : 1.Tech in Information Technology Disk Management [3L]: disk structure. Dietel H. Decisions under uncertainty Queuing Theory [7L] Introduction. formulation.. Mustafi: Operations Research. Duality theory (2L) • Revised Simplex. Various components of LP problem formulation Solving Linear Programming problem [17L] Solving LPP using • simultaneous equations and Graphical Method (2L) • Simplex Method and extensions. “Operating Systems”. domain of protection. Narosa Publishers. 2. Wiley. bad blocks. 1992. Tanenbaum A. 1974 7. 6. “Operating System Design & Implementation”. program threats. “Linear Programming”. axiomatic derivation of the arrival & departure distributions for Poission Queue. Macmillan Publishing Company. Addison Wesley.E/B. Kanti Swaroop – “Operations Research” 4. Holder Day Inc.... threat monitoring. Taha..S. 4. Poission Queuing Model. L.. Transportation and assignment problems. 2.K. 7/e (with CD). J. Milenkovie M. TMH 6. security problem. N. (6L) Network Analysis [7L] Shortest paths. “Operations Research”. Protection & Security [4L] Goals of protection. & Liebermann G. 3. 1987 5. disk reliability. (7L) • Sensitivity analysis . Operation Research and Optimization Techniques Code: CS 511 Contacts: 3L + 1T Credits: 4 Allotted Hrs: 45L Introduction [2L] Introduction to OR modeling approach and various real life situations Linear programming problems [2L] Basic LPP and applications. McGraw Hill. “Operation Research”. Practice Hall NJ. . solution and applications Dynamic programming [4L] Modeling. Maximal flow including PERTCPM Integer programming [2L] Basic concepts. authentication. “Operating System : Concept & Design”. Fifth edn. and Peterson J. J. New Age International 18 . Hillier F. & Liebermann G. Silbersehatz A.
PHI 3. regular expressions from DFA. MH Formal Language & Automata Theory Code: CS 512 Contacts: 3L + 1T Credits: 4 Allotted Hrs: 45L Finite State Machines [4L] Definition. capability & limitations of FSM. alphabets & languages. closure properties. CNF & GNF. language recognised by PDA. two way finite automata equivalence with one way. and Ullman JD. Closure Properties of Regular Sets [4L] Pumping lemma & its application.L. concept of sequential circuits. P. ogden’s lemma. Mahapatra: Introduction to System Dynamics Modelling. R. Mishra & N. simplification. Finite Automation [9L] Preliminaries (strings. Universities Press 11. Closure Properties of CFLs [4L] Pumping lemma & its applications. lattice of closed partitions.H. Pushdown Automata [5L] Definition. derivation trees.idea of grammar. concept of synchronous. H. 5. Moore versus Mealy m/c.. Ash & Ash – “Discrete Mathematics”.West Bengal University of Technology B. New Age International 10. “Introduction to Automata Theory.P.Tech in Information Technology 9. Shenoy: Operation Research for Management. equivalence of PDA and CFL. McGraw Hill. decision algorithms. Lewis H. acceptance by final state & empty stack. machine equivalence. graphs & trees. equivalence of Moore & Mealy machines. deterministic PDA.. definition. closure properties minimization of finite automata : minimization by distinguishable pair. 2. Languages & Computation”. regular sets & regular expressions : equivalence with finite automata. Narosa. Structure of Sequential Machines [3L] Concept of partitions. NFA. References : 19 . K. Regular language properties and their grammars. set & relations). Hopcroft JE. state table & state assignments. Finite memory. Rao: Engineering Optimization. NFA with emoves. merger graph & compatibility graph.I. recognition of a language by an automata . Martin: Introduction to Languages and Theory of Computation”.E/B. Context sensitive languages. information lossless & inverse machines : testing table & testing graph. New Age International References : 1. closed partitions. incompletely specified machines. applications of finite automata. definite. TMH 4. “Elements of the theory of Computation”. definition. and Papadimitrou C. NFA from regular expressions. state equivalence & minimization. myhillnerode theorem. DFA. Text Books : 1. merger table. Introduction to ZRL & CSL [2L] Introduction to Z. Schaum outline series – “Operations Research”. decomposition : serial & parallel. mathematical representation. instantaneous descriptions. Context Free Grammars [4L] Introduction. equivalence of DFA and NFA. asynchronous and liner sequential machines Finite State Models [10L] Basic definition. Chandrasekharan – “Theory of Computer Science”. moves.
Linz Peter. state chart diagram. relationships among objects.. addressing modes and their features. activity diagram. . difference between OOP and other conventional programmingadvantages and disadvantages. Blaha . Peripherals: 8279. 8259. 2nd Edn. 2. 8253. “An Introduction to Formal Languages and Automata”. relationships among classes. Basic concepts of object oriented programming using Java [15 L] Object. grouping constructs. 8. Pin description and features. James Michael.Prentice Hall India Patrick Naughton. Object Technology & UML Code: IT 501 Contacts: 3L Credits: 3 Allotted Hrs: 45L Introduction [6 L] Why object orientation. 8255. 6.Tata Mc graw Hill. 4. metaclass. UML extensibility. interaction diagram: collaboration diagram. links. using. Timing diagram. Herbert Schildt – “The complete referenceJava2” . class. peripheral chips (IO mapped IO & Memory mapped IO). 3. Fundamentals of Object Oriented design in UML [12 L] Static and dynamic models. message passing. Narosa “Introduction to Formal Languages”.West Bengal University of Technology B. 8251.association. Hardware Interfacing: Interfacing memory. Meiler . machine cycle.model constraints and comments.Tech in Information Technology 1. aggregation. concepts of object oriented programming language.“Object Oriented Modelling and Design” . Kohavi ZVI. Software instruction set and Assembly Language Programming. 3. Object oriented design [12 L] Major and minor elements.E/B. History and development of Object Oriented Programming language. Class. UML diagrams: Class diagram. Stereotype. Object. why modeling. A/D and D/A converters and interfacing of the same. aggregation. threading. implementation diagram. Ali Bahrami. “Switching & Finite Automata”.“Fundamentals of object oriented design in UML” Priestley: Practical Object Oriented Design using UML TMH Roff: UML: A Beginner’s Guide TMH Rajaram: Object Oriented Programming and C++. Note.“Object –Oriented System Development” . Instruction cycle. applet programming. 1983. Tata McGraw Hill. Universities Press Microprocessor and Microcontrollers Code: EI 502 Contacts: 3L + 1T Credits:4 Introduction to 8085A CPU architectureregister organization. encapsulation. Tata McGraw Hill. 7. 2. 8237. 5. polymorphism. Page Jones. instantiation.Mc Graw Hill. New Age International Mahapatra: Introduction to System Dynamic Modelling. Text Books / References : 1. 20 . Interrupts and DMA. aggregation. sequence diagram. Rambaugh.
Prentice Hall. semop. Signal [9P]: signal handling. semget. Process [6P]: starting new process. pthread_create. Hall. 8. Semaphore [6P]: programming with semaphores (use functions semctl. signal sets. 80286. pthread_attr_init. 6. 1992 Assembly Language Programming the IBM PC by Alan R. duplicating a process image. Shell programming [6P]: creating a script. 3. pthread_cancel) Interprocess communication [9P]: pipes(use functions pipe. 5. Halt state. 5. waiting for a process. zombie process. 4. Lock operation. 80186. replacing a process image. Duality. semaphore_p. pthread_join.Tech in Information Technology Typical applications of a microprocessor. named pipes(FIFOs. Brey. 2. Hold state. Wiley eastern Ltd. An introduction to micro computers Vol. 6800 Microprocessor). semaphore_v). interrupt processing. Operating System Lab Code: CS 591 Contacts: 3P Credits: 2 1. shell syntax (variables. conditions. Wiley inter science publications. programming and applications with 8085/8085A. making a script executable. 16 bit processors: 8086 and architecture. Microprocessor architecture. popen. 1989 by Ramesh S. 1994. 1987 The Intel Microprocessors: 8086/8088. commands). pthread_exit. del_semvalue. Microprocessor Book – Intel marketing communication. Software instruction set (including specific instructions like string instructions. segmented memory has cycles. 4. 1980. Microprocessors and Interfacing by Douglas V. signal interface. accessing FIFO) Operation Research Lab Code: CS 581 Contacts: 3P Credits: 2 Software based lab using C & FORTRAN For FORTRAN: 1) Familiarization with FORTRAN (3) 2) Linear Programming (Transportation. McGraw Hill International Ed. pclose). Subex Inc. POSIX Threads [9P]: programming with pthread functions(viz. repeat. Kane Advanced Microprocessors by Ray and Bhurchandi . India 1996. Simplex) For Clanguage: 1) Shortest Path (Dijkstra’s Floyd’s algorithm) 2) Maximal Flow 3) PERT/CPM 21 .West Bengal University of Technology B. read/write cycle in min/max mode. lock prefizers and their use) and Assembly Language programming with the same.E/B. 2. control structures. Reset operation. Miller. sending signals. Addressing modes and their features. Micro Controller Handbook – Intel Publications. Brief overview of some other microprocessors (eg. Assignment. Intel Corp: The 8085 / 8085A. 3. 2 – some real Microprocessor – Galgotia Book Source. New Delhi by Adam Osborne and J. segment override. 7. 80386 & 80486. Bary B. Gaonkar. wait state. 6. set_semvalue. functions. References: 1.TMH Intel Corp.
Tech in Information Technology 4) 5) Queuing Theory Integer Programming Problem (Branch & Bound Problem) N. Logical) on the simulator.Familiarization with any OR package Object Technology Lab Code: IT 591 Contacts: 3P Credits: 2 1. b) Assignments based on above Programming using kit/simulator for i) table look up ii) Copying a block of memory iii) Shifting a block of memory iv) Packing and unpacking of BCD numbers v) Addition of BCD numbers vi) Binary to ASCII conversion vii) String Matching viii) Multiplication using Booth’s Algorithm Program using subroutine calls and IN/OUT instructions using 8255 PPI on the trainer kit eg.West Bengal University of Technology B. of hours 3 2.E/B. Familiarization with 8085 simulator on PC. including the memory map. Name of the Experiments Familiarization with 8085 register level architecture and trainer kit components. Microprocessor and Microcontroller Lab Code: EI 592 Contacts: 3P Credits: 2 Sl. 3 6. Logical) b) Assignments based on above. Arithmetic. Load/Store. Study of prewritten programs using basic instruction set ( data transfer. handling errors and exceptions. extending interfaces Assignments on creating and accessing packages Assignments on multithreaded programming. 1. subroutine for delay. 3. 74LS373) with trainer kit as a peripheral mapped output port with absolute address decoding a) c) a) No. 3 22 . vectors.B:. Arithmetic. 2. inheritance.multiple inheritance. No. 5. overriding Assignments on wrapper class. overloading. reading switch state & glowing LEDs accordingly. Study of prewritten programs on trainer kit using the basic instruction set ( data transfer. Load/Store. constructor. 9 5. Familiarization with the process of storing and viewing the contents of memory as well as registers. arrays Assignments on developing interfaces. finding out the frequency of a pulse train etc Interfacing any 8bit Latch (eg. 3 3. 4. applet programming and graphics programming Note: Use Java for programming. 3 4. Assignments on class.
counting number of pulses within specified time period) Study of 8051 Micro controller kit and writing programs for the following tasks using the kit a) Table look up b) Basic arithmetic and logical operations c) Interfacing of Keyboard and stepper motor Familiarization with EPROM programming and Erasing 12 8. Software Project Complexity. Installation Testing. Pressman : Software Engineering. Reliability Models. 2. Formal Verification. Performance Testing. SomerVille : Software Engineering. Static and Dynamic Analysis. Scheduling Risk Management. Software Complexity. Project Scheduling. Interfacing with I/O modules: a) ADC b) Speed control of mini DC motor using DAC c) Keyboard d) Multidigit Display with multiplexing e) Stepper motor Writing programs for ‘Wait Loop (busy waiting)’ and ISR for vectored interrupts (eg. Ghezzi. Software Cost Estimation Techniques.E/B. PHI I. 3. Estimation of Residual Errors. Mutation Analysis. Software Management Structure. Theoretical Foundation of Testing. Software Engineering Fundamentals.West Bengal University of Technology B. Management Functions. Software Project Management Plan. Software Metrics – Basic Consideration. BOOKS : 1. Dialog Design. R. 3 Sixth Semester Software Engineering & Project Management Code : IT 601 Contact : 3L +1T Credit : 4 Alloted Hrs: 45L Software Quality [12L] Software Quality Assurance. Measuring Usability. Function Testing. How to Approach Usability. Pearson Education 23 . MTTF. Project Management [12L] Issues in Project Management. Methodology for Dialog Design. Mandrioli : Fundamentals of Software Engineering. User Interface [10L] Module Introduction. Whitebox and Blackbox Testing. Hazard. Guidelines for User Interface Design. Jazayeri and D. Algorithmic Cost Modeling. Repair and Availability. Size Oriented and Function Point Oriented. OUP C. 4. Symbolic Equation. SSADM. Software Metrics. Integration Testing.G.Tech in Information Technology 7. Acceptance Testing. Unit Testing.TMH Behforooz. The COCOMO Model. M. Designing with Usability in mind. Halstead’s Metrics. Test tools. Dynamic Testing. Software Project Planning. Bottomup and Topdown Testing. Personnel Productivity. Objectives of Usability. 3 9. Cyclomatic Complexity. Software Reliability [10L] Reliability. Software Validation. 6 10. System Testing. User Interface Elements. Test Case Generation. SteadyState Availability. Prototyping Tools.
7. Data Link Layer [9L] Error Detection and Correction. Point to Point Access :PPP. Connecting Lans. Backbone Networks. Digital Transmission. Data Link Control and Protocol. 6. Network Layer Protocols : ARP. ICMP. Network Layer [8L] HosttoHost Delivery :Internetworking. John Wiley Humphrey : Managing the Software Process. Uma. TMH.Tech in Information Technology 5. Multimedia. Circuit Switching and Telephone Network. User Authentication. Transport Layer [5L] ProcesstoProcess Delivery : UDP and TCP. HTTP and WWW. James. Transmission Media. Multiple Access. Electronic Mail (SMTP). Cellular Telephone and Satellite Networks.An Engineering Approach. Congestion Control and Quality of Service.West Bengal University of Technology B. 8. IPv4. Virtual Lans. 2004 3. and File Transfer (FTP). PHI/Pearson Database Management Systems Code: IT 604 Contacts: 3L + 1T Credits: 4 Allotted Hrs: 45L Introduction [3L] File & Data Base Concept . Unicast and Multicast Routing : Routing Protocols. and Key Management. Wireless Lans.Essentials of Software Engineering. and ICMPv6. Application Layer [9L] ClientServer Model : Socket Interface.A S Tanenbaum : Computer Networks. Jaico Royce : Software Project Management. Pedrycz and Witold : Software Engineering. Virtual Circuit Switching. Database Users. IPv6.B A Forouzan : Data Communications and Networking. Message Security. Pearson Education P. Data Independence 24 . Addressing and Routing. Overview of DBMS.E/B. BOOKS : 1. Data Models. PHI. Schema. Domain Name System (DNS). Pearson Education DATA COMMUNICATIONS AND NETWORKING Code : IT 603 Contact : 3L + 1T Credit : 4 Alloted Hrs: 45L Overview of Data Communications and Networking [2L] Introduction. Security [4L] Cryptography. Analog Transmission. Local Area Networks : Ethernet. Database Administrator. Network Models Physical Layer [8L] Signals. 2003 2. Security Protocols in the Internet.W Stallings : Data and Computer Communications . Multiplexing.
Pritimay Bhattacharya. Canonical Cover. Henry F. DKNF . Overview of ClientServer Architecture and Its relationship to Distributed Databases. Extended Relational Algebra Operations. III. 4NF. Conflict & View serializabilty. Transaction logs. “Fundamentals of Database Systems”. Null Values. Indexedbased scan. 3. Cost Based Optimization. Functional Dependencies and Normalization [7L] Functional Dependency. Modifications Of the Database. B tree and B+ tree . BCNF. 2. Korth and Silberschatz Abraham. 4.Majumdar. Specialization. Merge join. Data Fragmentation. Types of Distributed Database Systems. “Database Management Systems”. Referential Integrity Constraints. EntityRelationship Diagram. Strong & Weak Entity Sets. Prime & Non Prime attribute . Company. PHI Alexis Leon & Mathews Leon . Keys. purpose. Query Processing. Elmasri Ramez and Novathe Shamkant. 3NF. clustering). Test for Conflict serializability. Concurrency Control. Transaction & Concurrency Control [5L] Transaction concept. Recovery techniques. Full and Partial Functional dependencies.E/B. secondary.Graw Hill. J.. Introduction(2L) Definition of management. Relational Model [4L] Procedural & Non Procedural Languages. Storage Strategies [4L] SingleLevel Index (primary. Equivalence rules . Closure . Database Processing. Integrity Constraints & Introduction to RDBMS [3L] Domain Constraints. Generalization. Text Books: 1. Codd’s rule. Nested loop join . assertions. McGrawHill Kroenke. Arun K. Vol. 5NF. Benjamin Cummings Publishing. views. Views. I.West Bengal University of Technology B. “Introduction to Database Management”. Armstrong’s axioms. Mc. Reference: 1. Multilevel Indexes. 1NF. 5. Pearson Ramakrishnan: Database Management System . An Introduction to Database Systems . Aggregation. ACID properties. Relational Algebra. Heuristic Optimization . Distributed Databases [4L] Basic Concepts. Hashing Techniques. Query Optimization [4L] Full Table scan. Functions of managers. Cursors. 2NF. Aggregate Functions. Tata McGraw Hill Management Information Systems Code: IT 602 Contacts: 3L Credits: 3 Total Lectures: 45L 1. Bipin C Desai . SQL [5L] Basic Concepts. Leon Vikas . Cardinality ratios. Nested Subqueries. Two phase locking. 3. Dynamic Multilevel Indexes. “Database System Concepts”. Replication and Allocation Techniques. Causes of failures . Lock base protocols. Set operations.Database Management Systems .Tech in Information Technology EntityRelationship Model [3L] Basic concepts . Galgotia . its definition. 25 . Relational Calculus . Stored procedures and triggers. elements of science. Date C. patterns of management analysis. Multi valued Dependency . Backup & Recovery [3L] Physical & Logical Backup . II. 2.
(3L) Intelligence. 6. the MIS function in organization. Models: modeling systems general vs specific models. 9. types of reports. Managerial styles. environment.(2L) Effectiveness vs efficiency 7. computer operation personal. Organization:Organizational characteristics. types of models. Decision support system (DSS).Knowledge based systems . . (6L) System: components of a system. soln evaluation & choice. MIS personal.Decision support system. Executive decision making environment 11. Management reporting system. Decision making process. design. System & models. levels of models. Managerial decision making: characteristics of types of decision 5. Management & decision making (5L) Management: labels of management. People & organization. (3L) 26 . (3L) Component of DSS DSS development DSS products DSS development tools User interfaces Executive information system (EIS) Executive roles & decision making.Management reporting system .E/B. Strategic planning models.(2L) • nature • function • role of IT in transaction processing • processing cycles • Transaction processing subsystem. managerial role. 3. Transaction processing & management reporting systems.Tech in Information Technology 2. MIS management. MIS in the functional areas of business. (2L) Evaluation of management reporting system. intragroup dynamics.West Bengal University of Technology B. (6L) People: psychological factors. open Vs Closed systems. corporate culture.Transaction processing framework . power intergroup conflict. planning & control. worker’s skill & abilities. 10. Evaluating decision making. A general model of organization and its internal environment.Office systems 8. Organizational behavior. structuring report content.(5L) A management information systems frame work: . Transaction processing. 4. Models of organizational systems.
Computer Representation of Sound (Sampling Rate. Kelkar. TMH. TMH rles Parker. Character Set. MIS strategy & action (Management Info System) – McGrawHill. Managing the digital firm. Management Information Systems. Ways to Present Text. Audio Formats. MIDI Image and Video (8L) 27 .Okha. PHI.E/B. Supply chain management (1L) Introduction Definition of SCM Features of SCM SCM Stages 14. Dr. Laudon & Laudon. Leon. 5. Quantization). Enterprise resource planning (3L) Materials Requirement planning (MRP) Closed loop MRP Manufacturing Resource Planning (MRP – II) ENTERPRISE RESOURCE PLANNING Functional architecture of ERP Benefits of ERP Business Process Reengineering and ERP ERP implementation 13. Management Information Systems. Impact of Multimedia. Audio: Basic Sound Concepts. Aspects of Text Design. 2. Types of Sound. Everest Publishing House Multimedia Technology & Applications Code: IT605 Contacts: 3L + 1T Credits: 4 Allotted hours: 45L Introduction [2L] Multimedia today. Codes.Tech in Information Technology Financial information system. Sampling Size. Multimedia Systems. 4. Unicode. Components and Its Applications Text and Audio [6L] Text: Types of Text. Enterprise Resource Planning. Post & Anderson. Character. Reference: 1.A concise study. Thomas Cage. Encryption. 2.West Bengal University of Technology B. Audio tools. MIS. 3. Digitizing Sound. Davis. Management Information Systems. TMH. Management Information System. Milind M. Cases in MIS (2L) Case study method Analytical Case Issue Case Written Case Analysis Illustrations Text Books: 1. Marketing MIS Manufacturing MIS 12. PHI.
SOCKET PROGRAMMING: 1. Image Color Scheme. Prabhat K.WINS CONFIG. quad trees. Pearson Ed. DVD.NETWORK CONFIGURATION: 1.SUBNET MASK. Andleigh & Kiran Thakrar . Video: Analogue and Digital Video. Videoondemand.GATEWAY. file systems (traditional.S CONFIG(LINUX. quality of service Storage models and Access Techniques [(4L] Magnetic media. Nalin K. 3. CDROM. indexing. Rtrees.E/B. Case study of Applications Multimedia Applications [4L] Interactive television. Multimedia Communications .CONFIG DNS. MPEG.261) Transmission of Video Signals. similarity based retrieval. Multimedia Systems Design . Video Capture. synchronization accuracy specification factors. and Computer based Animation. Fred Hoffstetter . Fred Halsall . McGraw Hill. H. Pearson Ed. Industrial Applications. 5. media editors.QBIC.BASIC UNIX SYSTEM CALL RELATED WITH SOCKET 28 . video segmentation. Multimedia Systems . Case studies. 1. Scanner. Synchronization [4L] Temporal relationships.CASE STUDY ON ETHERNET 3.DNS. 8. 2. Pearson Ed. 4. Sharda .FTP(LINUX) 3.West Bengal University of Technology B. CCD Image and Video Database [8L] Image representation. Standard Generalized Markup Language (SGML). Multimedia: Computing.Media Coding and Content Processing . Educational Applications. Open Document Architecture (ODA). shape and texture.NETBIOS) 2. Virage. PHI. Books: 1. Multimedia and Hypermedia Coding Expert Group (MHEG). optical media. querying. Video Conferencing. Jeffcoate . PHI. Hypertext Markup Language (HTML) in Web Publishing. Multimedia Fundamentals: Vol. image retrieval by color. SHARING FILES IN LAN ON VARIOUS NODES IN LINUX/WIN ‘NT OR FROM NETWORKING NEIGHBOURHOOD OF WIN’ 98 4. Multimedia archives and digital libraries.UNDERSTANDING TCP/IP: (IP ADDRESS. Video Content. NETWORK O. PHI. Image Enhancement. Communications & Applications . Multimedia in Practice: Technology and Application . Multimedia Literacy . Recording Formats and Standards (JPEG. multimedia) Multimedia devices – Output devices.WINDOWS) 2. Data Communication Lab Code: IT 693 Contact: 3P Credits: 2 1. Multimedia Information System . Koegel Buford .Tech in Information Technology Image: Formats. General Design Principles Hypertext: Concept. indexing Document Architecture and Content Management [9L] Content Design and Development. J. Document Type Definition (DTD). 6. Ralf Steinmetz and Klara Nahrstedt . 7. PHI.kd trees. Ralf Steinmetz and Klara Nahrstedt . segmentation.
LIKE . Creating/editing motion video/animation clips (using tools like Flash / Adobe Premier) 4. link to other Image) 5. Introduction to PL/SQL .Retrieving data from a database using Equi .Calcutta. indexes and sequences.Use of scalar and aggregate functions. 4. Reference: 1. 9. 6.E/B. Sound capturing & editing using tools like SOUNDFORGE 2.ECHO CLIENT. Ivan Bayross .TIME SERVER 4. PL /SQL – The Programming Language of Oracle . Oracle Press . DHTML.RPC . Creating stylesheet using DHTML 6.HANDS OM ACTIVITY IN PHYSICAL LINKS DBMS Lab Code: IT 694 Contacts: 3P Credits: 2 SQL : 1. Outer and Self Join.Using subqueries . BETWEEN. table form. Exception handling – Oracle defined and User defined. 11.Oracle 9i – The Complete Reference . altering and dropping tables with integrity constraints. Use of trigger in data manipulation. Creating . 10.Tech in Information Technology 2.WHOIS CLIENT AND WHOIS SERVER(client will access user information from remote machine) 5. 5. 3. GROUP BY and HAVING clause . Retrieving and modifying data from a database . 6. SQL .PROCESS COMMUNICATION 5. 7. 2. BPB Press. Text Books: 1. Non Equi . Use of stored procedures & functions in data manipulation. Oracle PL/SQL Programming. Multimedia Technology & Applications Lab Code: IT 695 Contacts: 3P Credits: 2 1. 12. frame. Use of implicit & explicit cursors in data handling. Books 29 . 2. ORDER BY. PL/SQL: 8. Image editing using tools like Adobe Photoshop 3. Home Page creation using HTML.UNIX /LINUX NETWORK PROGRAMMING.ECHO SERVER 3. using output from server. Kevin Loney & George Koch . Shroff Publishers . Creation of Content using HTML (basic tags.West Bengal University of Technology B. Use of views .CHAT CLIENT AND SERVER 6. rowid and rownum for retrieving data. Retrieving data from database using IN. Steven Feuerstein .
Combining RIP. Communication skill for technical students. Dynamic HTML in Action. Original Internet Architecture and Cores. Interconnection through IP Gateways or routers.West Bengal University of Technology B. Adobe Photoshop 6. Internetworking Code: IT 701 Contacts: 3L +1T Credits: 4 Allotted Hrs: 45L An Overview on Internet [4L] The need for an Internet. PHI 3. The concept of unreliable delivery. Professional communication. Reliable stream transport. Routing direct and indirect delivery. 3. Protocol layering. and EGP. 30 . Flash in a Flash. Bootstrap protocol (BOOTP). Internet and Intranet. H M Prasad. Parvin S R Bhatia. Classless IP address.0: Classroom in a book Pearson Ed. Internetworking Concepts [6L] Architectural model introduction. Design. Internet Address [5L] Introduction. Castro. Routing with partial information. Orient Longman .Tech in Information Technology 1. TCP performance.E/B. Mapping internet addresses to physical addresses (ARP). 2. Vector distance (BellmanFord). Code: IT 682 Contacts: 3P Credits: 2 Sessions related to Group Discussion: Methodology. Spoken English. Application level interconnection.Web Development . Macromedia Flash5 fast and easy Web Development. Core Gateways.Sound & Video . Universal identifiers. Professional communication skills . HELLO. Connectionless delivery system. Interior Gateway Protocol (RIP. 2. Properties of the Internet. Multimedia. Interviews Communication Skills: Oral communication with respect to functions & situations. Review of Network technologies. Automatic route propagation. Adobe . A M sheikh. Autonomous system concept. The Internet Datagram. Internet Protocol [6L] Internet Architecture and Philosophy. S Chand & co. Network and Broadcast addresses. OSPF. PHI 4. Exterior Gateway Protocol (EGP). HELLO). TMH. Routing [7L] The origin of Gateway routing tables. The TCP/IP Internet. PHI 6. PHI Group Discussion & Communication Skills. Second Edition . Anushka Wirasinha . routing. T M Farhatullah . Group Discussion & interviews . Internet Architecture. Internet services. Multicast addressing. ARP protocol format. Table driven IP routing. Books: 1. Lozano. Pearson Ed. Gateway to Gateway Protocol (GGP). Three primary classes of IP addresses. Internet protocols and standardization. Transport Gateways and subnet addressing. HTML4 for the World Wide Web. Network level interconnection. 5. Schurman & Purdi . Routing Information Protocol (RIP). Performance evaluation.
comparing JSP and ASP program. comparing JSP and CGI program. TELNET. Cookies and Sessions. Frame relay technology and services. PHI. Java Script [3L] Data types. 7. JSP [15L] JSP architecture. http protocol (frame format). inserting applets and java beans into JSP. WWWBasic concepts. Configuration of firewall. sections.E/B. Active Web Pages [2L] Need of active web pages. EMail Firewall & Networking [6L] Introduction. PHI.Douglas E. Internetworking with TCP / IP . Java Servlet [4L] Servlet environment and role. JSP servers.William Stallings. methods in JSP. TMH. 4. listings.Comer. comparisons of Microsoft and java technologies. Computer Networks – Andrew S. 2. The Complete reference of Networking .Forouzan Behrouz A. Data and Computer Communication . Firewalls & SSL. inserting java expression in JSP. frameset. Servlet API.Tech in Information Technology Enterprise Networking [7L] Corporate networking.LeonGarciaWidjaja. Broadband at the Metropolitan area level. PE. variables. frame. using include and forward action. comparative studies of different technologies of dynamic page creation. 6. array object. conditional statements. prepared statement and callable statement. universal resource locator (url). Tanenbaum. java applet life cycle. web client and web server. HTMLdifferent tags.Craig Zacker. an overview of DHTML. 5. HTML support.West Bengal University of Technology B. TCP/IP protocol suite . image & pictures. tables. processing request from user and generating dynamic response for the user. 3. understanding the layout in JSP. date object. J2EE[7L] 31 . TMH. string object. JSP tags. Implementation of Firewall. FTP. Computer Networks and Internets . Dynamic Web Pages [2L] The need of dynamic web pages. Web Technology Code: IT 702 Contacts: 3L +1T Credits: 4 Allotted Hrs: 45L Static Web Pages [6L] Web Pages . ISDN. Creating ODBC data source name. DHCP Servers. Virtual private network concepts PPTP protocol. TMH. SSL implementation. introduction to JDBC. Books 1.types and issues. Internet Servers [4L] DNS. BISDN and ATM services. Bit implementation of SSL.Douglas E . cascading style sheet (css). PE. Activities of Firewall. tiers. operators. Communication Networks . High speed dedicated WAN services and switched WAN services. Comer. The servlet life cycle. form. Declaring variables. Use of SSL.
Advantages. elements and attributes. Books: 1. preparation of Balance Sheet and Profit and Loss Accounts. JNI. J2EE edition. ROR (Rate of Return) Method. Cost centers. important definitions. S. Budgeting Process Investment Criterion. Cost – Volume – Profit Analysis [8L] Classification of costs. Importance of Capital Budgeting. Uses. Capital Budgeting [7L] Nature of Investment decision. Objectives. Cost analysis for managerial decisions. Accounting. Controlling other departments by Financial Accounting (A practical Approach). Financial Planning and Capitalization. TMH. Master Budget and Report. Objectives. Functions. Classification. types of Accounting. Cash flow determination. uses. different types of transactions related to Financial Accounting. Financing and importance of working capital. double entry bookkeeping. Financial Decision. Discounting Cash flow method. XML [6L] Extensible Markup Language (XML). introduction to Journal Accounting. Payback period. Financial statements. Web Technologies .. apportionment and absorption. cost of capital.definitions. Meaning of Linear CVP analysis. Budgeting Control Technique [5L] Concepts of Budget. Limitations. basics of Enterprise Java Beans. Introduction to Accounting [8L] Basic accounting concepts. Allocation. Break – Even analysis.Tech in Information Technology An overview of J2EE web services. Java Beans.Xavier C. changing roles and functions. Net – present value method.E/B. advantages. different types of Vouchers. sequential and tree approach. Financial Control [7L] Posting of Ledgers and preparation of Trial Balance. 3. document type definition. XML parsers. 2. Financial Management & Accounts Code: HU 701 Contacts: 3L Credits: 3 Allotted Hrs: 45L Introduction [3L] Financial Management.. basics of RMI. basics of XML. Java Server Programming. The benefitCost Ratio method. Books: 32 . different costing systems. budgeting and budgetary control. Volume ratios margin of Safety. The Capital. (VOL I and VOL II). & Kahate A. New Age Publication. Web Technology & Design . limitations. determining the BreakEven point profit. capital budgeting methods. Investment analysis. IRR (Internal Rate of Return) method. Assumptions.West Bengal University of Technology B.Godbole A. EJB vs. Elements. Volume graph profit. Management of Working Capital [7L] Various concepts. objectives. WROX publishers.
Zbuffer algorithm. Transformation of points. end conditions for periodic Bspline curves. Matrix representations & homogeneous coordinates. 5. Khan & Jain.R. reflection through an arbitrary plane. Circle generation algorithm. 2D Transformation [8L] Basic transformations: translation. Financial Mgmt & Policy. Scan Conversion [6L] Points & lines. types of CG. Vikas 7. 2. Rotation about an arbitrary axis in space. clipping circles. polygons & ellipse. Computer graphics software. definitions of CG.Raster Scan Display. Hidden line elimination.West Bengal University of Technology B. Line drawing algorithms.. 3D viewing. K. Specular Reflection. Hidden Surfaces [4L] Depth comparison.P. Curves and Fractals [4L] Curve representation. Bezier curves. storage tubes displays. Himalaya Computer Graphics Code: IT 703 A Contacts: 3L Credits: 3 Allotted Hrs: 45L Introduction to Computer Graphics & Graphics Systems [4L] Overview of CG. scaling. lines. Pandey. surfaces. Financial Mgmt. Color Models . parallel lines. Gupta. Financial Mgmt. Window to Viewport coordinate transformation. reflection shear. Books: 33 . Financial Mgmt. Bspline curves. designs. Lambert’s Cosine Law. clipping. rotation. I. Ellipse generating algorithm.Kaplan & Atkinson. Modeling Light Intensities and Sources. clipping operations. BSP tree method. scanline algorithm. Halftoning. 3D Transformation & Viewing [10L] 3D transformations: translation. Jain. line clipping. OUP 9.E/B. scan line polygon. Kalyani Publishers. Management & Accounting: Principles and Practice .M. PE. Diffuse Reflection. rational Bspline curves.geometry. fill algorithm. Back face detection. Financial Mgmt . the Printer’s algorithm. Advanced Management Accounting . perspectives & Depth Cueing. flood fill algorithm.RGB Color. 4. Financial Mgmt Accounting. PHI 10. Color & Shading Models [5L] Introduction. Viewing [4L] Viewing pipeline. TMH 8. Bresenham’s line algorithm.Kulkarni & Satyaprasad. general parallel projection transformation.. Sharma & Shashi Kumar Gupta. Mcmenamin. Van Horne. boundary fill algorithm. scaling & other transformations. S. transformations between coordinate systems. Fundamentals of Financial Management – Van Home. Viewport clipping. point clipping. CRT technologies . PHI. fractal . CMY Color. 3.Pearson 6. intersecting lines. rotation. K. wire frame methods. 1.Tech in Information Technology Financial Management and Accounting . DDA algorithm. Chand & Co.
GPS surveying. Derivative Filtering. Concept of Data model. GPS data. Lowpass Filtering. Region Splitting & Merging. Fundamental steps in Image Processing. Feiner and Huges. Plastock. Visual Interpretation. Simple Global Thresholding. Thresholding . Properties of The Two Dimensional Fourier Transform. Smoothing . Computer Graphics –A programming Approach– Harrington. Equivalence & Transitive Closure. Electromagnetic Spectrum.. Elements of Digital Image Processing . Perspective Projection. Restoration by Homomorphic Filtering.Local Processing. An Overview of GIS [4L] Definition of GIS. 5. McGraw Hill Computer Graphics – principles and practice . Geometric Model. Xiang. Combined detection.Z. Remote Sensing. GPS error source. Fourier Transformation. Relations. Edge detection. Discrete Fourier Transform. Chattopadhyay. Digital Image Representation. Ltd Image Processing & GIS 1. Global Processing via The Hough Transform.E/B. Vikas Publishing House Pvt. GIS as an Information System. Enhancement in the frequency domain .Basic Formulation. Display. Discrete Cosine & Sine Transform. Features & Functions.Image Averaging.. Algebraic Approach to Restoration .Steven. Banker M. GIS data feeds. Differential GPS technique Techniques & Concepts.Tech in Information Technology Computer Graphics (C version 2nd Ed. Image Segmentation [6L] Point Detection. Sampling & Quantization . Histogram Processing. Line Detection. Contrast Enhancement –Linear & Nonlinear Stretching. Highboost Filtering. Discrete Formulation. Optimal Thresholding. Code: IT 703 B Contacts: 3L Credits: 3 Allotted Hrs: 45L Introduction [5L] Background.Image Acquisition. Database. TMH Introduction to Computer Graphics – A. Constrained Least Square Restoration. Historical development of GIS. 4. Image Sharpening. Raster Data Model. GIS & Cartography. 6. Region Growing by Pixel Aggregation. GIS Concepts & Spatial Data Model [5L] Automated Cartography versus GIS. GPS Satellite Signals.Unconstrained & Constrained. Mean Filter. Van Dam.Basic Transformation (Translation. 3. Scaling. Rotation). Pearson. Edge Linking & Boundary Detection . A. Image Restoration [6L] Degradation Model. Gray Level Interpolation.Low pass filtering. TIN Data Model Remote Sensing [6L] Concepts. Arithmetic/Logic Operations.Uniform & Non uniform.) – Hearn D. Connectivity. Homomorphic Filtering. Mathematical Preliminaries [4L] Neighbour of pixels. Mukhopadhyaya. Geometric Transformation . Distance Measures. 34 .Foundation. Processing. Indexing & Hierarchical Data Structure. High pass filtering.PHI Schaum’s outlines Computer Graphics(2nd Ed).Hearn D.West Bengal University of Technology B.P. R.Foley. Region Oriented Segmentation . Vector Data Model. Image Enhancement [6L] Spatial Domain Method. Pearson. RS Platforms. Frequency Domain Method. 2. Baker M P .Spatial Transformation. Computer Graphics (2nd Edition) . Storage. Communication. Highpass Filtering. Digital Image Formation [3L] A Simple Image Model.
role of GA in optimization. Hebb Net. 35 . T. PHI/ Pearson. 2nd Ed. Albert. Neural Networks. Fuzzy Rule based system. Typical architectures: single layer.Jain A. Hybrid Systems [10L] Hybrid systems. Unsupervised & reinforced.E/B. Fuzzy relations—Cartesian product. Pearson 5. Kohonen Self Organizing Maps. Feedback & recurrent N. Neural Networks. Application— Travelling Salesman Problem.N.Laurence Fausett. Takanori.Tech in Information Technology Books 1. Prentice Hall. Fundamentals of Neural Networks. basic operators. Cross over(different types). Neuron. Graph Coloring problem. Books: 1.Zimmermann H. Mutation. Evolutionary Computation.N. architectures. Rajasekaran & G. Zadeh.PHI. Simon Haykin. Perceptron ( with limitations & Perceptron learning rule Convergence theorem).. PE. Clustering. 3. application. Fuzzy Sets & Fuzzy Logic. Pearson Getting Started with GIS..Sanchez. Application). Allied Publishers Ltd. Common activation functions. Pattern Association.McCullohPitts. Properties of neural network. Goldberg David E. Feed forward. C. GA based BPNN(Weight determination. Digital Image Processing . Operations on relations. Basic concept of neural networks. World Scientific 4. Soft Computing Code: IT 703 C Contacts: 3L Credits: 3 Allotted Hrs: 45L Artificial Neural Network [3L] Basic concept of Soft Computing. kmeans & kmedoid based algorithm.Ekstrom M. Multiobjective & Multimodal optimization in GA. Klir & Yuan.Clarke Keith. Pearson 2. ADALINE. FAM. 5. Inference. Genetic Programming. PHI. MADALINE. Fuzzy Sets & Logic [8L] Fuzzy versus Crisp.A.West Bengal University of Technology B. Defuzzification methods. Academic Press Concepts & Techniques of GIS . ART1. J. Fundamentals Of Digital Image Processing . Models Of Neural Network [10L] Architecture.P. Application of N. Englewood Clifts. Simple Clustering algorithm. Fuzzy logic—Quantifiers. Yeung K.A. multilayer. Discrete Hopfield net. Genetic Algorithm & fuzzy Logic Systems . Maxnet . Inference.. Predicate logic—Interpretations. Inversion.& Woods R.C. 7. properties. Vijaylakshmi Pai.A Comprehensive foundation. Algorithm & Application of . Mathematical model. Different learning methods: Supervised. Schema theorem.E. PHI 3. Selection of initial population. Neuro Fuzzy Systems—Fuzzy BPNNfuzzy Neuron. Constraints Handling. 6. Crisp logic—Laws of propositional logic. 4. linguistic variable. Fuzzy Set Theory & Its Applications . Fitness function.Lo C. algorithms & applications .P. 2. BAM. Deletion. architecture.K. Genetic Algorithm [10L] Basic concept.. Fuzzy sets—membership function. Fuzzy Logic controlled G.ART2. learning.W.Gonzalez R. Digital Image Processing Techniques . Pattern Recognition [4L] Pattern Classification. competitive layer. Backpropagation NN. Inference. Genetic Algorithm. Fuzzy Logic & Genetic Algorithms – Synthesis & applications.S.
sharing Semantics & caching schemes. Failure handling.E/B. Synchronization.Models. RPC. Accessing models. Access Control. Models and Features. 2. Encoding & decoding techniques. 5th Edition. Group communication. Models. Pearson. Task assignment approach. Recovery. Human oriented names. Multi datagram messages. Features. Distributed Files Systems [8L] Introduction. Process migration. Concepts & design .West Bengal University of Technology B. replication.Tanenbaum Andrews S. Books 1. Cryptography. Process addressing. Information Theory & Coding Code: IT 703 E Contacts: 3L Credits: 3 Allotted Hrs: 45L Source Coding [7L] Uncertainty and information. Event handling. Message Passing [8L] Good message passing system. Distributed Shared Memory [4L] Architecture. information measures for continuous random variables. Security [4L] Potential attacks to computer system. Remote procedure calls (RPC) . Distributed Systems. Name caches. Fundamental Terminologies & concepts.Silberschatz Galvin. Concept of distributed operating system. System oriented names. Clock Synchronization. IPC. Lightweight RPC. Distributed operating Systems. Introduction to process management. – Pearson. average mutual information and entropy. Concepts & design . Issues in design of a distributed operating system. 3. 4. Communication protocols.. digital signatures. Threads. John Wiley. Dollimore Jean. 36 . Naming [5L] Introduction. Mutual Exclusion. Distributed Operating System . Authentication.Coulouris George. Features. PHI. Load balancing & load sharing approach. Synchronization [4L] Introduction. Atomic transactions.Tech in Information Technology Distributed Computing Code: IT 703 D Contacts: 3L Credits: 3 Allotted Hrs: 45L Fundamentals [4L] Introduction. Deadlock – Conditions. Buffering.Sinha Pradeep K. Granularity. Advantages. Resource & process Management [8L] Features of a good scheduling algorithm. Huffman codes. Operating System Concepts . Prevention. Avoidance. source coding theorem. Thrashing. Kindberg Tim. Fault Tolerance.
coding and cryptography . decoding of convolutional codes. The Complete reference of Networking . Flooding. Configuration of firewall. 3. 9. 2. Linkstate Routing etc. Implementation of protocols (eg. channel coding. The Shannon limit.West Bengal University of Technology B. TMH. equivalent codes. TMH. matrix representation of convolutional codes. Linear And Block Codes For Error Correction [8L] Matrix description of linear block codes.William Stallings. Sliding window. Golay codes. Configuration of DNS. Browser configuration. polynomial description of convolutional codes. Communication Networks . distance and performance bounds for convolutional codes. Control of access privilege in server.Craig Zacker. minimal polynomials. 4. division algorithm for polynomials. Prentice Hall. Turbo decoding. the generating function.LeonGarciaWidjaja. Convolutional Codes [8L] Tree codes. McGraw Hill. decoding of a linear block code. Data & Computer Communication .N Abramson. generator polynomials in terms of minimal polynomials.Douglas E . McGraw Hill. Pearson. Hamming codes. Implementation of Routing algorithms (eg.Tech in Information Technology Channel Capacity And Coding [7L] Channel models. 3.Comer. Pearson. Prentice Hall. 2. Distancevector Routing.Shu Lin and D J Costello Jr. information capacity theorem. a method for generating cyclic codes. 6. 7. 4. matrix description of cyclic codes. channel capacity.R B Ash. 8. Information and Coding . 3. Cyclic Codes [7L] Polynomials. BCH Codes [8L] Primitive elements. TMH. Information theory. 4. FTP.Ranjan Bose.M Mansurpur. Telnet connection and chatting between two clients. using rmi/ socket). Error Control Coding . Books 1. 5. perfect codes. Books 1. trellis codes. Web server configuration and Host (PWS/IIS4). examples of BCH codes. Web Technology Lab Code: IT 792 Contacts: 3P Credits: 2 37 .). distance notions for convolutional codes. 5. Introduction to Information Theory . DHCP. examples of convolutional codes. Implementation of firewall & proxy server (Winproxy)/ SQUID. Internetworking Lab Code : IT 791 Contacts : 3P Credit : 2 1. Internetworking with TCP / IP . parity check matrix. Information Theory . Turbo codes.E/B. 2. GobackN etc.
.E/B. Service provider liability. Web Technologies . University Press Industrial Management Code: HU 802 Contact: 3L Credits: 3 38 . Creating event handler that respond to mouse and keyboard event: Onload. & Kahate A. ECommerce and Trade Cycle. Enforceable online contract. (VOL I and VOL II). Electronic document. onresult. Legal issues [5L]: Risks: Paper Document vs. onfocus. ECommerce IT 801 Contact: 3L Credit: 3 Allotted Hrs: 39L Introduction to ECommerce [6L]: Definition. Communications. 5. InterOrganizational Ecommerce. Elements of ECommerce with VB. 6. onchange. 2. 2. Software supplies and support. SQL Server 7. Business to Business ECommerce [7L]: Electronic Markets. Case studies through internet. generating dynamic response for the user. onmouseout.0 & MTS by Mathew Reynolds. WROX publishers. positioning elements. Online Share Dealing. Laws. ASP. TMH ECommerce. Jurisdiction issues. 2. Internet Security. Page on the Web. Books:1. 3.inline styles.Godbole A. 4. JAVA Server Pages . Configuring apachetomcat server. processing request from user. inserting applet into jsp. 4. Authentication of Electronic document. 3. linking external style sheet. Protocols for secure messaging. user style sheet.BPB Beginning ECommerce with VB.The cutting edge of business by Kamlesh K. TMH ECommerce through ASP by W Clarke. Virtual Auctions..Theory and Case Studies by J. onmouseover. Christopher Westland and Theodore H. Internet. S. Legal issues for Internet Commerce: Trademarks and Domain names. Web Technology & Design . Technologies & Applications by David Whitley.Hans Bergstein – O’Reilly.Xavier C. onsubmit. form design. Electronic Data Interchange and Internet Commerce. Security. EDI and Business. onblur. Electronic Data Interchange (EDI): Technology. RSA. 3. Business to Consumer ECommerce [8L]: Consumer trade transaction. TMH. inserting java expression in jsp. Accessing database from jsp. Electronic Markets. SQL. Scope of ECommerce. onclick. ASP. Java Server Programming. Building simple jsp: Declaring variables and methods in jsp. Bajaj. Hardware requirements. New Age Publication. DHTML.West Bengal University of Technology B. 5. Internet Banking. linking image table. Security Issues [6L]: Security Solutions: Symmetric and Asymmetric Cryptosystems. Ebusiness [7L]: Internet bookshops. DES. Structuring data with xml. and Digital Signature. J2EE edition. creating style sheets with the style element. EDiversity. ECommerceStrategy. Wrox Publishers Global Electronic Commerce.Tech in Information Technology 1. K Clark. Gambling on the net. extensible style language (xsl). xml parser. customising markup language. Copyright. Secure Electronic Transaction (SET) Protocol. Electronic Newspapers. 4. Agreements. Basic use of html tag. Standards (UN/EDIFACT). Electronic cash over internet. frame. Implementations. Books: 1.
FSN analysis Books: 1. Performance appraisal. Importance. process. Theory of Bureaucracy. Total Quality Management: Concept. N. data model. Vol. Factors influencing perception. Productions Management: [5L Concept. 3. monitoring requirements and security in a data mart. Prentice Hall/Pearson Education. Types of Production( Mass. Micro Environment. Quality Management: Concept. Barriers to effective communication. Motivation: Concept. Different Inputs and Productivity Measures. external data. Industry Matrix. Different Theories (Maslow. types of data marts. Selective Inventory Control—ABC.the 4 P’s.TMH [6L [8L Data Warehousing and Data Mining IT 802A Contact: 3L Credit: 3 Allotted Hrs: 39L Introduction [2L] : Data warehousing – definitions and characteristics. Project). Chary. Elements of Marketing Mix.C. model with quantity discount. Cost of Quality. Relevant Environment. Materials Management: [6L Concept. software components. Perception: Process. BCG Matrix. EOQ Models. Phillip Kotler. Pearson Education Asia Organizational Behaviour. 6. Stereotyping. model with shortage. 2. Industrial Relations.West Bengal University of Technology B. Robbins. Marketing Environment: Mega Environment.Wilson model. 39 . Difference from Operations Management. Acceptance Sampling (single). Statistical Quality Control. nature of data. Projection. Quality Circles. loading a data mart. Dimensions for goods and services. maintenance. Collective Bargaining Organizational Behaviour: [8L Different Schools of Management Thought : Scientific Management. reference data. Guidelines to make communication effective. TMH Marketing Management. Simple Marketing Strategies: SWOT Analysis. model without shortage . 4. Batch.Tech in Information Technology Allotted Hrs: 39L Human Resource Management: Recruitment and selection. Difference between Selling and Marketing. Control Charts. Trade Union.E/B. Trade Unions & Labour Legislation .P. Functions. Marketing Management: [6L Basic Concepts of Marketing. Warehouse schema. Data Marts [4L] : Data marts. Shortcuts for judging people. S. Herzberg.Halo effect. S. performance issues. Six Sigma. Internal Environment. ) Communication: Purpose. Administrative Theory. Criticism. Effeciency and Effectiveness. Multidimensional data model. Prentice Hall Productions and Operations Management. Functions of Production Management. Joseph Monks. benefits. Productions and Operations Management. ERG. VED. Productivity: Concept. Industrial Management. metadata. 5. Jhamb. Human Relations Theory(Elton Mayo).Sinha. Measures to increase Productivity.1 L. EPH Industrial Relations. New Quality Tools: Kaizen.
Identification and Environment Division. OLAP tools. Sort & merge verbs. CACTUS. Working storage section. Filecontrol entries. File updating. IOCONTROL paragraph. Direct Access Files. Statements for sequential files. JOB statement. design considerations. Dynamic inset counting algorithm. Pujari. Prabhu. Data Warehousing –Concepts. RRDS.Relative files. WUM. An Overview of DB2 [6L]: Introduction. Same sort area clause. Structure of COBOL subroutines. Hardware configuration. Microstrategy DSS web. Data Warehousing.E/B. Books: 1. DB2 catalog & directory. InputOutput device. Environment. Defining & loading KSDS. Data Mining Techniques. LAP tools.File section. Table Handling. Developing a Data Warehousing [4L] : Building of a Data Warehousing. Decision Trees [4L] : Tree construction principle. Channels. A. Spooling. Data Mining and OLAP. InputOutput section. Indexed sequential files. Techniques. Applications of Data Warehousing & Data mining in Government. DBRM. CURE. VSAM [2L]: Introduction to VSAM. BIND. KDD(Knowledge Discovery database) versus Data Mining. Procedure Division. Temporal and Spatial Data Mining [5L] : Basic concepts of temporal data Mining. Characteristics of Mainframe Operating System: Batch processing. ROCK. SPIRIT. Decision tree construction with presorting. Perform. Categorical clustering. Pearson Education. data movement.Structure of procedure division. Mainframe configuration : Small Mainframe configuration . index table and indexing. 360/370 family: Processor. K. synchronized clause. Arbor Essbase web. Clustering Techniques [4L] : Clustering paradigm.Configuration section. Procedures & symbolic parameters. State of subroutines and CANCEL statement. Architectural strategies & organizational issues. Splitting criteria. ESDS.OCCURS clause and subscripting. DB2 internals: DB2 objects. IBM utility: IEBGENER. Web usage Mining. Major components of DB2. Data Modeling. sign clause. Tools for Data Warehousing Data Mining [4L] : Definitions. Text Mining. Sequential data set . Best split. CLARA. State of the market. multidimensional table. Compile – Link – Execute JCL. products. FP – tree growth algorithm. Brio Technology. The GSP algorithm. Index file . Data Division. Web Mining [4L] : Web content Mining. TMH. Data Mining Techniques. Partition algorithm. 5. sequence control. 3.Tech in Information Technology Online Analytical Processing [4L] : OLTP and OLAP systems. Search verbs. redefines clause. 3090 configuration COBOL Programming [10L]: Organization & Structure of COBOL program. Dunham. arithmetic. Set. star schema for multi dimensional view. STIRR. Business Information System IT 802B Contact: 3L Credit: 3 Allotted Hrs: 39L Introduction [6L]: Introduction to BIS and Mainframe Computer. Sequential files with variable length record. Web structure Mining. PHI. Splitting indices. Data Mining Introductory & Advanced Topic. Partition data Set . COBOL Files [8L]: Sequential file characteristics. snowflake schema. Anahory. Coding format. Structure of JCL . AMS. Memory size clause. Partition algorithms. 4. Issues and challenges. Timesharing. File description –Fixed length record. input output & conditional verbs. Data Warehousing in the real world. renames clause. SPADE. CLARANS. EXEC statement. Books: 40 . 2. Multiprogramming. Usage clause. PLANS. distribution of data. special features for magnetictape files. Job Control Language (JCL) [7L]: Introduction to JCL : Mainframe information representation & Storage . Calling Subroutines. justified clause. Hierarchical clustering. DD statement. Pearson Education. IEBCOMPR . data content. IEHPROGM. DBSCAN. IEBCOPY. Application. Multiprogramming. Features for unit record files. Creating reports. BIRCH. sorting a table.West Bengal University of Technology B. application. Generalized association rule. optimizers. Alex Berson and Stephen J Smith. Association Rules [4L] : A priori algorithm. Universities Press. Data locking. DBMS versus Data Mining. Virtual Storage.
Information Systems through COBOL.Problem formulation. Design. FPGA. TMH. LOOP. Pery. Radio Layer. Two layer. 4.WAIT.11: Architecture.TMH Mobile Communications IT 802D Contact: 3L Credit: 3 Allocated Hrs: 39L Introduction [6L]: A General Overview: History. Manufacturing test principles. VLSI Design IT 802C Contact: 3L Credit: 3 Allotted Hrs: 39L Introduction [3L] : VLSI technology. 41 . 3G. GPRS. VLSI Design: Sujata Pandey & Manoj Pandey. Ratio cut. Approximation of hypergraphs with graphs. Hierarchical approach. FPGA. Packaging. Detailed. Automatic test pattern generation. Describing Hardware in VHDL –Entity. 3. 5. COBOL programming. Advantages. 802. Physical. Multiplexer. TMH.Functionality & Manufacturing test. Lee & line probe algorithm.Problem formulation. 3. Placement [5L] : Cost function.E/B. Design styles. Generics. Observability. Transmission Medium.Wong. MemoryLatches & Register.Maze running. Constraint graph. Link Management Protocol. EXIT. Force directed methods. Design strategies for test. Data Types. Line searching. Dhanpati Rai & Co. Thomas Worth. Steiner trees. Architecture. Greedy algorithm. KerninghanLin & Fiduccia. Physical Layer. Bluetooth: Architecture. Wireless LANs [8L]: Characteristics. Structural Design.Tech in Information Technology 1. Floorplan sizing. Need. CASE. MAC Management. Routing [8L] : Global. Behavioral Modeling.Yoshimura & Kuh algorithm. Layout of basic devices. NAND. Compound gates.TMH. Design rules. Multicomodity Flow based technique.Functional.Array & Row based.West Bengal University of Technology B. short & open circuit. MAC Layer. Statistical fault analysis. Circuit. WATM. 6. IEEE 802.11a and 802. Partitioning placement. PE. ASSERT. controlability.Stuck At. Principles of CMOS VLSI Design: Weste & Esraghian. Simulated annealing. VHDL [4L] :Introduction to VHDL. Floorplanning [5L] : Problem formulation. TMH.D Ghosh dastidar.Inverter. Design methodologies.Mattheyses heuristic algorithm. 2. Hierarchical approach. IBM Mainframe and JCL. BRAN and HiperLAN2. Standard cell.IF.Full custom. IDDQ. Self test. AMPS. Phillipakis and Kazmier.K Roy. Floorplannig based on simulated annealing. Gate arrays & Sea of gates. Concurrent Signal Assignment. Disadvantages and Different Standards. A VHDL Primer: Bhasker. GSM. Single layer. Hierarchical approach. Algorithms For VLSI Physical Design Automation: Naved A. L2CAP and Security. VLSI Physical Design Automation [5L] :VLSI Design cycle: System specification. Channel routing & Switchbox routing. Rectangular dualization. 2. Randomized routing. MOS Transistor & Switches. Sherwani.Scan based.Left edge algorithm (Basic & Dogleg). Alex Leon. M. Testing [4L] : Need for testing. Partitioning [5L] : Problem formulation.General river routing algorithm. Baseband Layer. An Introduction to VLSI Physical Design: M Sarafzadeh&C. Fabrication. Kulwer Academic Publisher VHDL Programming by Example: Douglas L. VHDL Terms. Sequential Statements. Cobol for beginners. Sequential Behavior. Regular & linear placement. EEE. PE. Books: 1. HIPERLAN: History. 4. Fundamentals.11b. Resistive network. Logic. NOR.K. Fault coverage.
TMH Data Compression and Cryptography IT 803A Contact: 3L Credit: 3 Allotted Hrs: 39L Introduction [4L]: Need for data compression. BPB. Destination Sequence Distance Vector. Differential & Linear Cryptanalysis. Symmetric & Assymetric key together.Huffman. Arithmatic & LempelZiv coding.West Bengal University of Technology B. Cell Handoffs. Improving Cell Capacity and Coverage: Cell Splitting. Agent Discovery. IP spoofing attacks. Mobile IP: Introduction.PHI. Types of attacks. Cryptography & Network Security: Atul Kahate. Fractal compression. Communication model. 2003 2. Books: 1. Pearson Education. Zero/Blank encoding. Protocol Stack. Crytographic Techniques [5L]: Plaintext. RSA. Data Communications and Networking. System Capacity. Transform based coding : Discrete cosine transform & JPEG standards. Tunneling and Encapsulation. Symmetric & Assymetric Key Cryptography [8L]: Algorithm types & Modes. Addison –Wesley. Key range & Size. TMH. Run length encoding. Entropy encodingRepititive character encoding. Principles of Language Translation IT 803B Contact: 3L Credit: 3 Allotted Hrs: 39L 42 . Channel Allocation Management. Digital Image Processing. User Authenticattion Mechanism [4L]: Authentication basics. Optimizations and Reverse Tunneling. Compression ratio. Security approaches. Schiller. Dynamic Source Routing and Alternative Metrics.E/B. Principle and Practices 3. DES. Principles of security. Differential pulse code modulation.Tech in Information Technology Mobile Transport and Network Layer [12L]: Introduction. Wireless Application Protocol [4L]: Introduction (WAP). Nelson. Reqirements of data compression. Substitution & Transposition techniques. Source encoding. 2. Secure inter branch payment transactions. Snooping TCP. Classification. Adaptive differential pulse code modulation. Connections. IP Packet Delivery. Mobile Adhoc Networks: Routing. Traditional TCP: Congestion Control. Cellular Networks [9L]: Cellular Concept. 3. Books: 1. Interference: Cochannel and Adjacent Interference. Knapsack algorithm. Encryption & Decryption.Chanda & D. Slow Start. Location Management. 4. Fast Retransmit and Implications of Mobility. Introduction To Security [5L]: Need for security. Statistical encoding. Mobile TCP and Fast Retransmit. Fundamental concept of data compression & coding. IDEA. Wireless Communications. Differential encoding—Predictive coding. Classical TCP Improvements: Indirect TCP. T. J. Cipher text. Rapport. Types of attacks. Mobile Communications. Certificate based & Biometric authentication. Firewall . Sectoring. Digital signature. Authentication tokens. Digital Image Processing & Analysis : B. Frequency Reuse. Methods of Data Compression [8L]: Data compression. Registration.Lossless & Lossy. Delta modulation. The Data Compression Book. Repeaters and Microcell Zone Concept. S. Case Studies Of Cryptography [5L]: Deniel of service attacks. Gonzalez & Woods. Dutta Mazumdar. Passwords. Call Setup.Vector quantization(Simple vector quantization & with error term). Forouzan.
Travelling salesman problem. Dhamdhare. Time and Space Complexity. Union by rank.“Compiler Principles. Peephole optimization. Matrix Manipulation Algorithms [6L]: Strassen’s Matrixmultiplication algorithm and its applications in Solution of simultaneous linear equations using LUP decomposition. Basic statement formation. Code Optimization and Generation [7L]: Introduction.call by value. Basic concepts of Compilers. Simple code generator. Inversion of Matrix and Boolean Matrix multiplication. Set covering problem. Macro processor. Interpreter. Merge sort. D.Phases of the Compiler. Job sequencing with deadlines. All pair shortest paths. Operator precedence parsing. Syntax Analysis [8L]: Parsing techniques. Dataflow analysis using GEN and KILL. Error recovery strategies for different parsing techniques. M. Travelling Salesman problem.E/B. Lexical Analysis [5L]: Role of Lexical Analyzer.Loops in flow graph. Activation records. Aho. Binding of names. Ullman – “Compiler Principles and Design” – Narosa Publication 2. Dynamic storage allocation techniques. Storage organization Subdivision of runtime memory. Formation of FIRST and FOLLOW sets and checking for the LL(1) acceptance. CrossCompiler. Design of Lexical Analyzer generator.Pearson Education. NPhard class. Different rules for writing semantic actions and their applications. Types of optimization . Dynamic Programming [4L]: Basic method. Techniques and Tools” . Allocation of Registers required for the generation. call by reference. Syntax Directed Translation [5L]: Syntax Directed Translation Scheme SDTSDefinitions. Aho. call by name. Scope of declaration. Path compression. Threeaddress code. BottomUp evaluation of inherited attributes. Basic concepts of Handles. Construction of Syntax trees. Ullman .Activation trees. Matrixchain multiplication. Complexity analysis [8L]: Asymptotic notations. Boolean expressions. forming the IN and OUT of basic blocks. LALR. Transformation of basic blocks. Code generation from DAGs. Viable prefixes. Storage allocation strategies. Singlesource shortest path. Canonical LR(1). Parameter passing . Design & Analysis of Algorithm IT 803C Contact: 3L Credit: 3 Allotted Hrs: 39L Models of computation [4L]: Random Access Machine. Compiler. Graph Traversal Algorithms [5L]: BFS and DFS. Basic blocks & flow graphs. Quick sort and their complexity.West Bengal University of Technology B.Specifications & Recognition. Circuit Satisfiability problem. Recurrence for divide and conquer and its solution. Heap sort.Quadruples. Relationship between Turing Machine and RAM. 43 . Disjoint Set Manipulation [4L]: Set manipulation algorithm like UNIONFIND. Implementation of three address statements . Bootstrapping. 3. Greedy Method [5L]: Basic method.Top–Down and Bottom–Up parsing. Notion of NPcompleteness [5L]: P class. Sethi. Approximation Algorithms [4L]: Vertex cover problem. Programming language concepts. Graphical representation. Run Time Environments [4L]: Source language issues .SLR. Backpatching. DAG representation of basic blocks. Assembler.Tech in Information Technology Introduction [4L]: Types of translators – Preprocessor. Minimum spanning tree by Prim's and Kruskal's algorithms. LR parsers. BPB Publications. Definition of Abstract Translation Scheme (ATS) and its application. Backtracking and its use in solving Knapsack and Eight queens problem. Basic concepts of Leftrecursions and Left – factoring. Case statements. Intermediate Code generation [6L]: Intermediate languages. Indirect triples. NPcomplete class.their characteristics and applications. Input buffering. Tokens. Symbol tables. Compiler. Books: 1. “Compiler Construction”. copy restore. Knapsack problem.Writing tools. Control stack. Triples.
comparing search strategies in terms of complexity. 3. Minimax search. Nonproduction systems: decision tree architectures. depth first search.Games. Problems of AI. Problem Solving . J. Saroj Kaushik. Artificial Intelligence. Structured Knowledge [4L] Associative networks. Resolution. T Cormen.G. JSP.P. 44 . Symbolic Logic [5L] Syntax and semantics for propositional logic. TicTacToe problem. A. Books: 1. ASP. PHI Artificial Intelligence: A Modern Approach. Reasoning Under Inconsistencies and Uncertainties [3L] Nonmonotonic reasoning. SQL. Expert Systems [4L] Rule based systems. Fuzzy logic.Hopcroft and J. Patterson. Special Search Techniques [6L] : Heuristic Search.Problem space and search. Learning by induction: generalization. TMH Introduction to AI & Expert Systems. 4. 2. blackboard system architectures.Bratlay. Conceptual graphs. Representation of knowledge in uncertain domain. R. Artificial Intelligence IT 803D Contact: 3L Credit: 3 Allotted Hrs: 39L Introduction [2L] Overview of AI. depth limited search.West Bengal University of Technology B. Advertising in the Website. AI techniques. Constraint satisfaction problems. SQL or Creating ECommerce Site [3P]: Designing and maintaining WebPages. Russel and Norvig. specialization. DempsterShafer theory.Brassard. example of inductive learner. PE Logic & Prolog Programming. Semantics of Bayesian networks.greedy bestfirst search. AI languages [4L] Basic knowledge of programming languages like Prolog and Lisp. Unification. Problem characteristics. Clausal form. Basic Search Techniques [4L] Solving problems by searching. PHI. Hill climbing search. Probabilistic Reasoning [3L] Bayesian probabilistic inference.E/B. Genetic algorithms. C Leiserson and R Rivest “Introduction to Algorithms”. Optimal decisions and strategies in games. Horowitz Ellis. Properties of WFF. Predicate completion and circumscription. Portals and Vortals. 3. Defining the problem as state space search. neural network architectures. bidirectional search. • VB. Syntax and semantics of FOPL. Fundamentals of Algorithms. Truth maintenance systems. 4. Sahani Sartaz. PE. PHI.Tech in Information Technology Books: 1. Ritch & Knight. Frame structures. Default reasoning & closed world assumption. Alphabeta pruning. Uniform search strategies: breadth first search. A* search. Sanguthevar " Fundamentals of Computer Algorithms".Ullman “The Design and Analysis of algorithms”. general learning model. Simulated annealing search. Learning [4L] Types of learning. Adversarial search .Aho. New Age ECommerce Lab IT 891 Contact: 3P Credit: 2 Following ECommerce experiments are to be implemented using either JAVA. 2.
by John R. professional development in Industry. Exchanges Handling in B2B. Online Banking. Gr.E/B. 4.BPB 2. conflicts and practices. virtue. Moral and ego. Ethics and Engineering by Martin and Schinizger.Tech in Information Technology • • ECommerce Interaction [6P]: Comparison Shopping in B2C. • Values and Ethics in Profession: Value system.West Bengal University of Technology B. Privacy. expectations. PE.0 & MTS by Mathew Reynolds. 45 . ethics and justice. Issues and Ethics—by Correy G. Wrox Publishers 3. means and ends. Challenges to privacy. Ethics and Professionalism by John Kultgen Ethics and the conduct of business. SQL Server 7. HU881 • Professionalism: Professional characteristics.3 Edition By Allamaraju et al.ethical premises. Ethics. Beginning ECommerce with VB. utility and justice.Boatright. Ethics and morality. professional education. Credit Card Transaction Processing. ECommerce Applications [6P]: Online Store. Discussion on Professionalism HU881 Contact: 3S Credit: 2 Each class may be divided into two groups. Brooks & Cole Pub. 2.goodness. TMC.Correy . Professional Competence: Important technical topics covered in Semesters IIIVII as well as topics of current professional interest. Each group may meet once a week and discuss topics mentioned below under HU881 and IT881. • Books: 1. SPD. • Right. ASP. Interaction Examples: Virtual Shopping Carts. Professional Java Server Programming J2EE 1. Books: 1. Privacy on the Internet. ECommerce through ASP by W Clarke. in alternate weeks. 3.
This action might not be possible to undo. Are you sure you want to continue?
Use one of your book credits to continue reading from where you left off, or restart the preview.