B Tech - CS-Sylb

Syllabus (B. Tech.
Computer Science) 3 CS 1: MATHEMATICS III

3L+1T
UNIT-I Differential Equations: Ordinary Differential Equations of Second Order With Variable Coefficients-Homogeneous Form, Exact Form, Solution When a Part of C.F. is Known, Change of Dependent Variable, Change of Independent Variable. Variation of Parameters, Solution In Series (Without Particular Integral). UNIT-II Partial differential equations of first order: Lagrange's method and standard forms, Charpit's method. Method of Separation of variables-Application to the solution of wave equation in one dimension, Laplace's equation in two dimensions, Diffusion equation in one dimension. UNIT-III Laplace Transform: - Laplace transform of elementary function, Shifting theorem, Transform of derivatives, Differentiation and Integration of transform, Heavisides unit step and Dirac Delta function, Solution of ordinary linear differential equation. UNIT-IV Fourier Transform: Fourier transform, Fourier sine and cosine transform, Fourier integral formula. Solution of partial differential equations with constant coefficients. UNIT-V Statistics: - Axiomatic definition, Mathematical expectation, Moments, Moment generating functions, Binominal, Poisson and Normal distribution, Correlation and Regression. Books Recommended: 1. Higher Engineering Mathematics Y.N. Gaur, C.L. Koul JPH 2. Higher Engineering Mathematics B.S. Grewal 3. Higher Engineering Mathematics N. P. Bali 4. Mathematical Methods- Potter, M C; Goldberg Jack, PHI 5. Probability and Statistics Schaums Series Mc Graw Hill.
MM: 100
Ex. Hrs. 3
Jaipur National University, Jaipur - 1/90
Syllabus (B. Tech. Computer Science) 3 CS 2: DATA STRUCTURE AND ALGORITHMS THROUGH C
3L+1T
UNIT-I Introduction: Basic Terminology, Elementary Data organization, Structure operations, Basic definition of Algorithm Complexity (Theta, Big O, Big Omega)and Time-Space trade-off. Arrays: Array Definition, Representation and Analysis, Single and Multidimensional Arrays, address calculation (row major and column major), Application of arrays, Character String in C, Character string operation, Array as Parameters, ordered List, Introducing Sparse Matrices and Vectors. Recursion: Recursive definition and processes, recursion in C, example of recursion, Tower of Hanoi Problem, simulating recursion, Backtracking, recursive algorithms, principles of recursion, Tail recursion, Removal of recursion. UNIT-II Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List, Traversing and Searching of Linked List, Overflow and Underflow, insertion and deletion to/from Linked Lists, insertion and deletion Algorithms, Doubly linked list, Linked List in Array, Polynomial representation and addition, Generalized linked list, Garbage Collection and Compaction. Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push & Pop, Array Representation of Stack, Linked Representation of Stack, Operations Associated with Stacks, and Application of stack: Conversion of infix to prefix and Postfix Expressions, Evaluation of postfix expression using stack. Queues: Array and linked representation and implementation of queues, Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, D-queues and Priority Queues. UNIT-III Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, Traversing Threaded Binary trees, Huffman algorithm. Searching and Hashing: Sequential search, binary search, comparison and analysis, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science)

UNIT-IV Sorting: Insertion Sort, Bubble Sort, Quick Sort, Two-Way-Merge Sort, Heap Sort, Sorting on Different Keys, Practical consideration for internal Sorting. Binary Search Trees: Binary Search Tree (BST), insertion and Deletion in BST, Complexity of Search Algorithm, Path Length, introduction to AVL Trees and B-Tree. UNIT-V Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees. File Structures: Physical Storage Media File organization, organization of records into Blocks, Sequential Files, indexing and Hashing, Primary indices, Secondary indices, B+ Tree index Files, B Tree index Files, indexing and Hashing Comparisons.
Books Recommended: 1. Fundamentals of data Structures: Horowitz and Sahani; Galgotia Publication 2. Data Structures and Program Design in C: R. Kruse etal; Pearson Education Asia 3. Data Structures using C & C++: a. M. Tenenbaum; Prentice-Hall 4. Mastering Algorithms with C: K Loudon; Shroff Publisher & Distributors Pvt. Ltd. 5. Data Structure and Algorithm Using C: R. S. Salaria; Khanna Book Publisher 6. Schaum's Outline of Theory and Problems of Data Structures: Seymour Lipschutz; McGraw-Hill
Syllabus (B. Tech. Computer Science) 3 CS 3: DISCRETE MATHEMATICAL STRUCTURE

3L
UNIT-I Set Theory: Definition of Sets, Countable and Uncountable Sets, Venn Diagrams, Proofs of Some General Identities on Sets. Relation: Definition, Types of Relation, Composition of Relations, Pictorial Representation of Relation, Equivalence Relation, Partial ordering Relation. UNIT-II Function: Definition, Type of Functions, One To One, Into and Onto Function, Inverse Function, Composition of Functions, Recursively Defined Functions. Theorem Proving Techniques: Mathematical induction (Simple and Strong), Pigeonhole Principle, Proof by Contradiction. Combinatorics: Basic Counting Principles, Permutations and Combinatorics, Inclusion and Exclusion Principles, Recurrence Relations, Generating Functions, Applications. UNIT-III Algebraic Structures: Definition, Properties, Types: Semi Groups, Monoid, Groups, Abelian Group, Subgroup, Cyclic Groups, Cosets, Permutation Groups, Normal Subgroup, Lagranges Theorem. Application: Finite State Machines, Grammars and Languages, Error Correcting Codes. UNIT-IV Propositional Logic: Proposition, First order Logic, Basic Logical Operation, Truth Tables, Tautologies, Contradictions, Algebra of Proposition, Logical Implications, Logical Equivalence, Predicate Calculus, Universal and Existential Quantifiers. PoSets and Lattices: introduction, ordered Set, Hasse Diagram of Partially, ordered Set, Well ordered Set, Properties of Lattices, Semi- Lattice, Distributive and Complemented Lattices, Boolean Algebra, Switching Algebra. UNIT-V Graphs: Directed and Undirected Graphs, Euler Graph, Hamitonian Graph, Trees, Chromatic Number, Connectivity and Other Graphical Parameters. Applications Polya's Theory of Enumeration and Its Applications. Tree: Definition, Rooted Tree, Properties of Trees, Theorems(with proof), Directed Tree, ordered Tree, Polish Notation.
MM: 100
Ex. Hrs. 3

Books Recommended: 1. Discrete Mathematics: Liptschutz, Seymour; Schaums series, McGraw Hill. 2. Discrete Mathematical Structure with Application to Computer Science: Trembley, J.P & R. Manohar; McGraw Hill. 3. Discrete Mathematics and its applications: Kenneth H. Rosen, ; McGraw Hill. 4. Graph Theory with application to Engineering and Computer Science: Deo, Narsingh; PHI. 5. Combinatorics Theory & Application: Krishnamurthy; East-West Press Pvt. Ltd., New Delhi.
Syllabus (B. Tech. Computer Science) 3 CS 4: PRINCIPLES OF PROGRAMMING LANGUAGES

3L MM: 100 Exam: 3 Hrs.
UNIT-I
Introduction: Characteristics of Programming Languages, Factors Influencing the Evolution of Programming Language, Developments in Programming Methodologies, Desirable Features and Design Issues. Programming Language Processors: Structure and Operations of Translators, Software Simulated Computer, Syntax, Semantics, Structure, Virtual Computers, Binding and Binding Time.
UNIT-II
Elementary and Structured Data Types: Data Object Variables, Constants, Data Types, Elementary Data Types, Declaration, Assignment and Initialization, Enumeration, Characters, Strings. Structured Data Type and Objects: Specification of Data Structured Types, Vectors and Arrays, Records, Variable Size Data Structure, Pointers and Programmer Constructed Data Structure, Sets Files. Sub Program and Programmer Defined Data Types: Evolution of Data Types, Abstractions, Encapsulations, Information Hiding, Sub Programmes, Abstract Data Types.
UNIT-III
Sequence Control: Implicit and Explicit Sequence Control, Sequence Control Within Expression and Statements, Recursive Sub Programmes, Exception Handling, Co Routines, Scheduled Sub Programmes, Concurrent Execution. Data Control Referencing Environments, Static and Dynamic Scope, Local Data Local Data Referencing Environment, Shared Data: Explicit Common Environment Dynamic Scope Parameter Passing Mechanism.
UNIT-IV
Storage Management: Major Run Time Requirements, Storage Management Phases, Static Storage Management, Stack Based, Heap Based Storage Management. Syntax and Translation: General Syntactic Criteria, Syntactic Element of a Language, Stages in Translation, Formal Syntax and Semantics.
UNIT-V
Operating and Programming Environment: Batch Processing Environments, Embedded System Requirements, Data Flow Language and Object Oriented Language, Comparison in Various General and Special Purpose Programming Languages e.g. Fortran, C, Pascal etc.

Books Recommended: 1. Programming Languages: Design and Implementation: Terrance W Pratt; PHI 2. Concept of Programming Language: Sebesta; Addison Wesley 3. Programming Languages: E Horowitz; 2nd Edition, Addison Wesley 4. Fundamentals of Programming Languages: Galgotia.
Syllabus (B. Tech. Computer Science) 3 CS 5: ELECTRONICS DEVICES AND CIRCUIT

3L
UNIT I Transistor Characteristics: The Junction Transistor, Transistor Current Component, The Transistor As An Amplifier, Transistor Construction, The Common Base Configuration, The Common Emitter Configuration, The CE Cut of Region, The CE Saturation Region, Typical Transistor Junction Voltage Values, Common-Emitter Current Gain, The Common Collector Configuration. UNIT II Transistor Biasing & Thermal Stabilization: The Operating Point, Bias Stability, Self-Bias or Emitter Bias, Stabilization Against Variation in ICO, VBE, and , Bias Compensation, Biasing Techniques for Linear integrated Circuits, Thermistor and Sensitor Compensation, Thermal Runway, Thermal Stability. Unit III The Transistor At Low Frequencies: Graphical Analysis of The CE Configuration, Two-Port Devices and The Hybrid Model, Transistor Hybrid Model, The H-Parameter, Conversion Formulas For The Parameters of The Three Transistor Configuration, Analysis of a Transistor Amplifier Circuit Using H- Parameters, The Emitter Follower, Comparison of Transistor Amplifier Configuration. Simplified Calculations For Common-Collector Configuration, Common-Emitter Amplifier With An Emitter Resistance, High input Resistance Transistor Circuits. High Frequency Model of Bjt Amplifiers. Unit IV Introduction To Switching Devices: Positive and Negative Logic Gates and Circuits, Field Effect Transistors: The Junction Field Effect Transistor, The Pinch-off Voltage, The Jeft Volt-Ampere Characteristics, The FET Small Signal Model, The Metal-OxideSemiconductor FET (Mosfet), The Low Frequency Common Source and Common Drain Amplifiers, The FET as a Voltage Variable Resistors (VVR).
MM: 100
Exam: 3 Hrs.

Unit V Feedback Amplifiers and Oscillators: Concepts of Feedback. Various Topologies for Amplifiers. Positive Feedback, Various Oscillator Circuits. Multivibrators: Astable, Bistable and Monostable Multivibrators.
Recommended Books : 1. Integrated Electronics, Millman Halkias, TMH. 2. Solid state Electronics Devices, Streetman, PHI. 3. Microelectronic Circuits, Sedra Smith, Oxford Press, India.
Syllabus (B. Tech. Computer Science) 3 CS 6: SWITCHING THEORY AND LOGIC SYSTEM DESIGN
3L
UNIT-I Introduction: Number system: Direct conversion between bases, Negative numbers, BCD and their Arithmetics, Excess-3 Codes, Boolean algebra, Minimization of Boolean Functions: Map & Tabular method up to 6 variable and Multiple Output Circuits, Error detecting & correcting codes, Hamming & Cyclic codes Logic Gates: Basic Gates, Operations, Representation, Truth Tables, Representation of Boolean Logics. Universal Gates. UNIT-II Combinational Logic Circuits: Design Procedure, Adders, subtractors & code conversion, Multiplexers/De-multiplexers, encoder/decoders, decimal adders & magnitude comparators, ROM as decoder, PLA & PAL. Sequential Logic Circuits: Flip Flops; R-S, J-K, D and T Flip Flops & their characteristics, Operation and Conversions. Analysis and synthesis of synchronous sequential circuit, excitation table, state table & state diagram. Design of synchronous counters, shift registers and their applications. UNIT-III Algorithm State Machine: ASM chart, Timing considerations, Control Implementation Design with Multiplexers, PLA control Asynchronous Sequential Circuits: Analysis Procedure Reduction of state & flow table, Race Free State assignment. UNIT-IV Logic Families: Diode, BJT & MOS as a switching element concept of transfer characteristics, input characteristics and output characteristics of logic gates, Fan-in, Fan-out, Noise margin, circuit concept and comparison of various logic families: TTL, IIL, ECL, NMOS, CMOS Tristate logic, open collector output, interfacing between logic families, packing density, power consumption & gate delay.
MM: 100
Exam: 3 Hrs.

UNIT-V Hazard and Fault Detection: Static and dynamic Hazard, Gate delay, Generation of spikes, Determination of hazard in combinational circuits, Fault detection methods: Fault Table & Path sensitizing methods Memories: Sequential, Random Access, NMOS & CMOS Static and Dynamic Memory Elements, one and multi-dimensional selection arrangement, Read-only memories, Formation of memory banks.
Books Recommended: 1. Digital Design: M. Moris Mano; PHI 2. Digital Logic and Computer Design: M. Moris Mano; PHI 3. introduction to Digital Microelectronic Circuits: Gopalan; TMH 4. Switching Theory and Logic Design: Hill & Peterson; John Wiley 5. Digital integrated Electronics: H, Taub, D.Schilling; McGraw Hill 6. Practical Digital Logic Design & Testing: Parag K. Lala; Prentice Hall of india. 7. Modern Digital Design: Sandiege; McGraw Hill. 8. Digital Circuit & Logic Design: Holsworth
Syllabus (B. Tech. Computer Science) 3 CS 7 DATA STRUCTURE LAB

4P MM: 100
1. Simple Array and Pointer utilization scheme. 2. Sorting: linear sort, bubble sort, insertion sort, selection sort. 3. Link list: singly link list implementation, doubly link list implementation and operation like; insert node, delete node, update node, free list node, traversal, searching, and printing. 4. Addition, Multiplication and Transpose of sparse matrices represented in linked list form. 5. Polynomial expression evaluation: addition, multiplication (8th degree polynomials). 6. Stack: implementation using array and link list and operations like push and pop. 7. Queue: implementation using link list and operations like; insert node, delete node, update node, free list node, traversal, searching, and printing. 8. Implementation of circular queue using linked list. 9. Implementation of dequeue using linked list. 10. Infix to postfix/prefix conversion. 11. Binary tree implementation, operation like insert, update, delete, traversal. 12. Searching and sorting revisited: Quick sort, Merge sort, Bucket sort, and searching algorithms; linear search, binary search. 13. Implementation of minimum spanning trees for a given graph using Breath first search and Depth first search algorithms.
Exam: 3 Hrs.
14.Symbol table organization (Hash Table).
Syllabus (B. Tech. Computer Science) 3 CS 8: ELECTRONICS DEVICES & CIRCUITS LAB
4P
1. Study the following: a. Analog CRO measurement of time period, amplitude, frequency and phase angle using Lissajous figures. b. Digital CRO and store a transient on it. 2. Application of diode as clipper and clamper. 3. Plot V-I characteristic of zener diode & study zener diode as voltage regulator, reverse Saturation current and static & dynamic resistances. 4. Plot input and output characteristics of BJT in CB, CC and CE configurations 5. Plot frequency response curve for audio amplifier and to determine gain bandwidth product. 6. Plot gain: frequency characteristic of two stages RC coupled amplifier and calculate its bandwidth and compare it with theoretical value. 7. Study the characteristics of small signal amplifier using FET. 8. Study Wein bridge oscillator and observe the effect of variation in R & C on oscillator frequency. 9. Study the transistor phase shift oscillator and observe the effect of variation in R & C on oscillator and observe the variation of on oscillator frequency 10. Study the collpits oscillator and observe the effect of variation of C on oscillator frequency 11. Study op-amp in inverting and non-inverting models & Use op-amp as scalar, summer and voltage follower. 12. Use of OP-amp as differentiator and integrator. 13. Study OP-amp characteristics and get data for input bias current measure the output offset voltage and reduce it to zero and calculate slew rate.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 3 CS 9 -- DIGITAL ELECTRONICS LAB.

3P MM: 75
1. Experimental study of characteristics of CMOS integrated circuits. 2. Interfacing of CMOS to TTL and CMOS. 3. Study of various combinatorial circuits based on: AND/NAND Logic blocks and OR/NOR Logic blocks. 4. Study of following combinational circuits: Multiplexer; de-multiplexer, Encoder and Decoder. Verify truth tables of various logic functions. 5. To study various waveforms at different points of transistor bi-stable multivibrator and its frequency variation with different parameters. 6. To study transistor a-stable multivibrator. 7. To design a frequency driver using IC-555/timer. 8. To study Schmit-trigger circuit. 9. To study OP-AMP as Current to voltage and voltage to current converter comparator. 10. BCD to binary conversion on digital/IC trainer. 11. Study various Flip flops and construct Parallel-in-Serial out register. 12. Testing of digital IC by automatic digital IC trainer.
Exam: 2 Hrs.
Syllabus (B. Tech. Computer Science) 3 CS 10: WEB DESIGN LAB USING HTML/DHTML
3P

MM: 75
Exam: 2 Hrs.
Basic introduction to HTML/DHTML. Use of various basic tags to format text and web-page.
Experiments: 1. Create a biodata of self using HTML with a photograph on the page and containing marks in a table. 2. Develop your web page with link to separate HTML file for academics, sports and other interests. 3. Enhance your Web page using style sheets, frames and setup a hyper link to your friends page. 4. Make a form for submission of Querying about the interest rates of bank (use Text fields of HTML) and submit buttons of HTML. 5. Make a local query form, which takes in the input the range of marks through Text fields and display the list of students having marks in that range in another window. 6. Use 2 Photographs that are displayed over one another, which can flip on mouse over. 7. Using scripting make an animation of the text input in a text box. 8. Make a user data entry form and validate the contents using scripting.
Syllabus (B. Tech. Computer Science) 4 CS 1: OBJECT ORIENTED PROGRAMMING USING C++
3L+1T
UNIT-I Object Oriented Paradigm: Elements of object-oriented programming, objects, classes, multiple views of the same object, encapsulation and data abstraction, Inheritance, and delegation object composition, polymorphism, and software reuse. UNIT-II Introduction to Programming in C++: Data types, Operators and Expression, Type conversion, Array and Strings, Streams based I/O, modular programming with functions, storage classes, command line arguments, pointers, inline function, function overloading, introduction to function templates, runtime memory management; Structures, Unions, and Enumerated types, Classes and Objects: INTRODUCTION, class specification, class objects, accessing class members, friend functions and friend classes, constant parameters and member functions, static data and member functions, and memory resource. Object initialization and cleanup, Dynamic objects, Operator overloading, data conversion UNIT-III Inheritance: Introduction, Type of inheritance, Inheritance and member accessibility, order of construction and destruction, function overriding, virtual base classes. Virtual Functions: Introduction, need for virtual functions, Runtime Polymorphism, Pure Virtual Functions, Abstract Classes, Virtual destructors. UNIT-IV Working with I/O Streams: Predefined console streams, hierarchy of console stream classes, unformatted I/O operations, formatted console I/O operations, manipulators, custom/userdefined manipulators, stream operator with user-defined classes. Working with File Streams: Introduction, Hierarchy of file stream classes, opening and closing of files, testing for errors, file pointers and their descriptors /manipulators, sequential access to a file, object retrieval, random access to a file.
MM: 100
Exam: 3 Hrs.

UNIT-V Generic Programming with Templates: Introduction, function templates revisited, overloaded function templates, user defined template arguments. Class templates, inheritance of class template, class template containership, class template with overloaded operators. Exception Handling: Introduction, Error handling, exception handling model, Exception handling constructs, List of pre-defined exceptions, catch all handler, Exceptions in constructors and destructors, Handling uncaught exceptions, Exceptions in overloaded operators and functions.
Books Recommended: 1. Mastering C++: K.R Venugopal, Rajkumar, T. Ravishankar; Tata McGraw Hill 2. Object oriented Modeling and Design: Rumbaugh et. al.; PHI 3. An Introduction to Object oriented Programming: Timothy a Budd; Addison Wesley Longman 4. C++ Primer: S. Lippman, J. Lajoie and B. Moo; Addison Wesley 5. Programming in C++: Maria litvin , Gary litvin; Vikas 6. Object oriented with C++: E. Balaguruswami; Tata McGraw Hill 7. Object oriented Programming in C++ and Java: D Samantha; Prentice Hall india
Syllabus (B. Tech. Computer Science) 4 CS 2: SOFTWARE ENGINEERING

3L
UNIT-I Introduction: Defining Software Engineering, Software Components, Software
MM: 100
Exam: 3 Hrs.
Characteristics, Software Crisis, Software Engineering Processes, Similarity and Differences from Conventional Engineering Processes, Software Quality Attributes. Software Development Life Cycle (SDLC) Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary Development Models, Iterative Enhancement Models UNIT-II: Software Requirement Specifications (SRS): Requirement Engineering Process: Elicitation, Analysis, Documentation, Review and Management of User Needs, Feasibility Study, information Modeling, Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables, SRS Document, IEEE Standards for SRS. Software Quality Assurance (SQA): Verification and Validation, SQA Plans, Software Quality Frameworks, ISO 9000 Models, SEI-CMM Model. UNIT-III Software Design: Basic Concept of Software Design, Architectural Design, Low Level Design: Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design Strategies: Function oriented Design, Object oriented Design, Top-Down and Bottom-Up Design. Software Measurement and Metrics: Various Size oriented Measures: Halesteads Software Science, Function Point (FP) Based Measures, and Cyclomatic Complexity Measures: Control Flow Graphs. UNIT-IV Software Testing: Testing Objectives, Unit Testing, integration Testing, Acceptance Testing, Regression Testing, Testing for Functionality and Testing for Performance, Top-Down and Bottom-Up Testing Strategies: Test Drivers and Test Stubs, Structural Testing (White Box Testing), Functional Testing (Black Box Testing), Test Data Suit Preparation, Alpha and Beta Testing of Products. Static Testing Strategies: Formal Technical Reviews (Peer Reviews), Walk Through, Code inspection, Compliance with Design and Coding Standards.

UNIT-V Software Maintenance and Software Project Management: Software as an Evolutionary Entity, Need for Maintenance, Categories of Maintenance: Preventive, Corrective and Perfective Maintenance, Cost of Maintenance, Software Re-Engineering, Reverse Engineering. Software Configuration Management Activities, Change Control Process, Software Version Control, An Overview of CASE Tools. Estimation of Various Parameters such as Cost, Efforts, Schedule / Duration, Constructive Cost Models (COCOMO), Resource Allocation Models, Risk Analysis and Management.
Books Recommended: 1. Software Engineering: A Practitioners Approach: R. S. Pressman; McGraw Hill. 2. Fundamentals of Software Engineering: Rajib Mall; PHI Publication. 3. Fundamentals of Software Engineering: Carlo Ghezzi, M. Jarayeri, D. Manodrioli; PHI Publication. 4. Software Engineering: Ian Sommerville; Addison Wesley. 5. Software Engineering: Pankaj Jalote; Narosa Publication 6. Software Engineering: K. K. Aggarwal and Yogesh Singh; New Age international Publishers. 7. Software Engineering: P. Fleeger; Macmillan Publication.
Syllabus (B. Tech. Computer Science) 4 CS 3: MICROPROCESSOR AND INTERFACE (8085)

UNIT-I
The 8085 Microprocessor: Block Diagram, Pins and Their Description, Demultiplexing of Buses, Control Signal and Flags. Introduction to 8085 Based Microcomputer System.
UNIT-II
Instruction and Timing: Instruction Classification, Instruction Formats, Addressing Modes, Instruction Timings and Status, Interrupts.
UNIT-III
Programming The 8085: 8085 Instruction Set, Data Transfer Instruction, Arithmetic Logic & Branch Operations: Rotate and Compare. Instruction Related to Stack Operations.
UNIT-IV
Programming Techniques: Looping, Counting, Indexing, Counters and Time Delays, Subroutines. Interfacing Concepts: Basic Interfacing Concepts, Memory Mapped and Peripheral Mapped Input/Output. Interfacing Peripherals: Descriptions, Programming and Interfacing of 8255, 8253, 8259A with 8085. Description of Simple Systems Using Above Chips.
UNIT-V
Direct Memory Access: Basic Concepts of DMA Techniques, Description, Programming and Interfacing of DMA Controller 8257. Serial I/O: Basic Concept of Serial I/O, Software Controlled Serial I/O. Basic Idea of Following Bus Standard: RS232C, IEEE-4888.
Books Recommended: 1. Douglas V. Hall : Microprocessors and Interfacing, Mcgraw Hill 2. Gaonkar : 8085 Programming, Penram Press
Syllabus (B. Tech. Computer Science) 4 CS 4: DATABASE MANAGEMENT SYSTEM

UNIT-I
Introduction: Overview, Database System vs Files System, Characteristics of Database Approach, Advantages and Disadvantages. Database System Concepts and Architecture, Data Models Schema and Instances, Data Independence and Data Base Language and Interfaces, Data Definition and Data Manipulation Constructs DDL, DML, DCL. Overall Database Structure, Classification of DBMS. Data Modeling Using The Entity Relationship Model: Entity Types, Entity Sets, Attributes, Keys, Concepts of Super Key, Candidate Key, Primary Key, Relationships, Relationship Types, Roles, and Structural Constrains, Weak Entity Types , E-R Model Concepts, Notation For ER Diagram, Naming Conventions, Mapping Constraints, and Design Issues
Generalization, Aggregation, Reduction of an ER Diagrams to Tables, Extended ER Model, Relationships of Higher Degree.
Unit-II
Relational Data Model and Language: Relational Data Model Concepts and Relational Database Schema, Integrity Constraints: Entity Integrity, Referential Integrity, Keys Constraints, Domain Constraints, Relational Constraints, Update Operations and Dealing With Constraint Violations, Relational Algebra Operations, Relational Calculus, Example of Queries In Relational Algebra, Tupple and Domain Calculus. Introduction To SQL: Characteristics of SQL. Advantage, Data Types and Literals. Types of SQL Commands. SQL Operators and Their Procedure. Tables, Views and Indexes. Queries and Sub Queries. Aggregate Functions. Insert, Update and Delete Operations. Joins, Unions, Intersection, Minus, Cursors In SQL.
Unit-III
Data Base Design & Normalization: Informal Design Guidelines For Relation Schemas, Functional Dependencies, Normal Forms, First, Second, Third Normal Forms, Bcnf, Inclusion Dependences, Loss Less Join Decompositions, Normalization Using Fd, Mvd, and Jds, Alternative Approaches To Database Design.
Syllabus (B. Tech. Computer Science) Unit-IV

Transaction Processing Concepts: Introduction to Transaction Processing, Transaction System Concepts, Desirable Properties of Transactions, Testing of Serializability, Serializability of Schedules, Conflict & View Serializable Schedule, Recoverability, Recovery From Transaction Failures, Log Based Recovery, Checkpoints, Deadlock Handling. Concurrency Control Techniques: Concurrency Control, Locking Techniques for Concurrency Control, Time Stamping Protocols for Concurrency Control, Validation Based Protocol, Multiple Granularity, Multi Version Schemes, Recovery with Concurrent Transaction.
Unit-V
Database Recovery Techniques: Recovery Concepts, Recovery Techniques Based on Deferred Update, Recovery Techniques Based on Immediate Update, Shadow Paging. Database Security and Authorization: Introduction to Database Security Issues, Discretionary Access Control Based on Granting/Revoking of Privileges, Introduction to Statistical Database Security.
Books Recommended: 1. Database Concepts: Korth, Silbertz, Sudarshan; McGraw Hill 2. An Introduction to Database System: Date C J; Addision Wesley 3. Fundamentals of Database Systems: Elmasri, Navathe; Addision Wesley 4. An Introduction to Database Systems: Bipin C. Desai; Galgotia Publication 5. Database Management System: Majumdar & Bhattacharya, Tata McGraw Hill 6. Database Management System: Ramakrishnan, Gehrke; Tata McGraw Hill 7. Database Processing: Fundamentals, Design and Implementation: Kroenke; Pearson Education 8. SQL, PL/SQL: The Programming Language of Oracle: Ivan Bayross; BPB Publication
Syllabus (B. Tech. Computer Science) 4 CS 5: COMMUNICATION FUNDAMENTALS

3L
UNIT-I Transmission Media: Primary and Secondary Line Constant, Telephone Lines and Cables, Electronic Public Switch Telephone Network. Twisted Pair, Coaxial Cable. Introduction and Principles of Light Communication in Fibers, Losses in Optical Fiber, Dispersion, Light Sources and Photo Detectors, Connectors. Type of Internet Connection: Dial-Up, Leased Line, DSL, ADSL, Broadband, Satellite Communication. UNIT-II Modulation of Analog Signals: Introduction to Bit Rate and Baud Rate, Principles of Analog Modulation Techniques AM, FM, PM Generation and Detection, Multiplexing Principles TDM, FDM. UNIT-III Digital Communication: Digital Representation of Information, Characterization of Communication Channels: Time and Frequency Domain. Fundamental Limits of Digital Transmission: Nyquist Signaling Rate and Shannon Channel Capacity. UNIT-IV Modulation of Digital Signals: Introduction to ASK, PSK, FSK, Pulse Transmission over Band-Limited Signals, Sampling Theory PAM, QAM, PCM and Delta Modulation, Differential PCM of above Systems on the basis of Performance Criterion such as Bit Transmission, Signaling Rate, Error Probability, S/N Ratio, Bandwidth Requirements. UNIT-V Networking Technologies: Introduction to Wireless Networks Wi-Fi, Wi-MAX, Bluetooth, GSM, CDMA, GPRS Books Recommended: 1. Data and Computer Communications: William Stallings; PHI, 5th Ed. 2. Telecommunication and The Computer: James Martin; PHI, 3rd Ed. 3. Computer Networks: A.S. Tanenbaum; PHI, 3rd Ed. 4. Data Communications and Networking: Behrouz A. Forouzan, Sophia Chung Fegan; Mc- graw Hill
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 4 CS 6: OPTIMIZATION TECHNIQUES

3L+1T
UNIT-I Introduction: Statement and Classification of Optimization Problem, Single Variable and Multivariable Optimization without and with Constraints (Eqality Constraints: Method of Lagrange Multipliers; Inequality Constraints: Kuhn Tuckers Conditions). UNIT-II Linear Programming Problems (LPP): Formulation, Solution using Graphical Method and Simplex Method, Two-Phase and Big-M Method, Special Cases in LPP: Alternate Optimum Solution, Unbounded Solution, Infeasible Solution. Duality in LPP, Dual Simplex Method. UNIT-III Transportation Problems and Its Variants : Definition, Methods for Finding Initial Basic Feasible Solutions-North West Corner Rule, Least Cost Cell Entry Method, Vogels Approximation Method, Methods for Finding Optimal Solution , MODI Method. Assignment Problems: Definition and Concept, Solution of an Assignment Problem for Optimum Solution Hungarian Method. UNIT-IV Game Theory: Solution of Game with Saddle Point, 2x2 games without saddle point, Principle of Dominance, Graphical Method for (2xn) and (mx2) games. Job Sequencing: Processing n Jobs on 2 Machines, Processing n Jobs on 3 Machines, Processing n Jobs on m Machines, Processing 2 Jobs on m Machines (Graphical Method) UNIT-V Project Management: Historical Development of CPM/PERT, Rules for Drawing Network, CPM: Time estimation and Critical Path in Network, PERT, Probability to complete a Project. Dynamic Programming: Introduction, Principle of Optimality and Computational Procedure of Dynamic Programming Problems. Traveling Salesman's Problems. Applications to Transportation Problem and Linear Programming Problems.
MM: 100
Exam: 3 Hrs.

Books Recommended: 1. 2. 3. 4. 5. 6. Engineering Optimization: Theory and Practice; Singiresu S. Rao. Operation Research: S. D. Sharma; Kedar Nath R.& Com' Meerut' Optimization Technique: Jain K.C., Rawat M. L., CBC Optimization Technique: Mehta D.M. Operation Research 5th Ed.: Kapoor V. K.; Sultan Chand & sons. Introduction to Operation Research-A Computer Oriented Algorithmic Approach: Gillet B. E.; Tata McGraw-Hill 7. Operation Research-An Introduction 5th Ed.: Taha H. A. : PHI
Syllabus (B. Tech. Computer Science) 4 CS 7: OBJECT ORIENTED PROGRAMMING LAB

4P
1. 2. 3.
MM: 100
Design an object oriented modeling for an automobile system.
Exam: 3 Hrs.
Design a UML Diagram for the various entities in Online Examination System. Migrating from C to C++:
a. Differences in input/Output use of cout and cin basic arithmetic operations b. Difference between function call by value, call by address, and call by reference (reference variables) swap function c. Benefits of having default arguments computation of simple & compound interest having one compulsory argument for principal sum and two default arguments for interest rate & period d. Benefits of function overloading arithmetic operations on integer & floating point types using same function name. Caveat in overloading: ambiguity and problems with default arguments interest computation problem revisited with default arguments and overloading both e. Similarities & differences in usage of loop structures, decision structures, operators, etc. printing a calendar f. Similarities in command line arguments usage passing initial values to print a calendar g. Similarities & differences in enumerated data types Using colour codes to refer to colour types in a program h. Defining named constants and macros using #define: i. Single line macros for finding maximum, minimum, cube, etc. ii. Multi-line macros for printing a pattern using loops within. i. Differences in structure data types; the OO concept in structures: encapsulation, data hiding, etc.- making a Student record structure with associate methods j. Making use of constructors and inheritance - making a person structure with basic functionalities and deriving employee and manager structures with associate methods 4. How a friend has access to the hidden parts of an object (structure variables) Making a friend function to compare two objects of type Student and Employee; if their Names, DOB and addresses match then they are equal.

5. How operator overloading can make programs look neat and how it can make operations / expressions simpler to understand 6. Defining a friend function (overload == operator) to compare two objects of type Student and Employee as in previous assignment. 7. Overload insertion (<<) & operator (>>) operators to input and output Person, Student, and Employee objects respectively 8. Differences in new operator of C++ and malloc() / calloc() of C Creating runtime 1D arrays and applying following on them: a. insertion sort to arrange in a particular order (Hint: make use of a default argument to check for sort order) b. Recursive Binary Search to locate an elements position (Hint: make use of a global variable to check for sort order) c. Later de-allocate memory using delete operator (do not use free() function) 9. Differences in new operator of C++ and malloc() / calloc() of C Creating runtime 2D arrays (Matrix) and applying following on them: a. Addition, Multiplication and Transpose of 2 matrices. 10. How inheritance can help in reusability of code Making a class Vehicle with private data members {regNo, engineCC, weight, noofWheels}. Derive classes TwoWheeler and FourWheeler with data members {engineType}. Derive classes GoodsCarrier and PublicCarrier from class FourWheeler with data members
{noofSeats/loadCapacity, permitType}. Make public methods {constructors, input, and output} for each of the classes and use them in a program 11. Use of virtual function, defining the run time object linking. 12. Use of Templates. Designing template class STACK and provide the basic operations on it. 13. Create a student class and perform the following: a. Create a file name record.txt. b. Store the values of student record in record.txt c. Read the values from the record.txt d. Delete, Update the record
Syllabus (B. Tech. Computer Science) 4 CS 8: SOFTWARE ENGINEERING LAB

3P
a. Online Banking System b. Online railway Reservation System c. Hotel Room Management System d. Online Assignment / Assessment and Report generation System e. Automobile System 2. Carry out the analysis phase of SDLC 3. Design Software Requirement Specification for the following: 4. Carry out the design phase of SDLC. a. Draw Data Flow Diagram. b. Draw ER-Diagram. 5. Write down various test plans. 6. Introduction to different software testing tools: Rational Rose etc.
MM: 75
Exam: 2Hrs.
1. Perform the following tasks for the following projects:
Syllabus (B. Tech. Computer Science) 4 CS 9: DBMS (MySQL) LAB

4P
MM: 100
Exam: 3 Hrs.
Design a complete data base system that includes various database table and procedures to access the data in them. Specify an ER-Diagram for each project listed and steps of normalization used. Design the front end using FoxPro programs or MS-Access forms:
1. Design a Hotel Management System. System provides facility for room reservation (for different category rooms), and Catering service billing. Customer's order for various food items are recorded during his stay at Hotel and Complete Bill (including Room Rent and Food consumed) is generated when customer checkouts. 2. Design a Computer Terminal Booking System for booking of 5 named computer terminals for 12-hour duration each day. User may book Terminals after entering their User ID and passward and they can book a terminal for maximum 5 hour/day (in continuous slot or fragmented slots). Terminal booking chart is generated for each day for each terminal. 3. Design a Loan Approval and Repayment System to handle Customer's Application for Loan and handle loan repayments by depositing installments and reducing balances. 4. Design a Video Library Management System for managing issue and return of Video tapes/CD and manage customer's queries. 5. Design a Time Management System for an office with 10-executives who record their daily appointments in the system. When Manager wants to conduct a meeting of Executives on a particular day System finds a free time slot to conduct the meeting.
6. Design an Outdoor-Management System for a Hospital where several experts sit in outdoor
room and system registers patients and sends them to appropriate expert. Each Expert can handle a limited number of patients a day.
Syllabus (B. Tech. Computer Science) 4 CS 10: OPTIMIZATION TECHNIQUES SIMULATION LAB.
3P

MM: 75
What is Optimization problem solving.
Exam: 2 Hrs.
Development and use of optimization models suitable for computer representation, solution, graphical display and animation. Introduction to MatLab
1. Optimization problem-solving techniques 2. Exchanging data between MatLab and EXCEL Programming 3. Simulation models in EXCEL and MatLab (Simulink) 4. Curve fitting using EXCEL and MatLab 5. Graphical Problem Solving, MatLab and EXCEL
Aim and Objective: 4 CS 10 is a first course in using computer applications as tools for Optimization Problem Solving To develop facility in structuring and solving problems drawn from technical areas To learn selected features of EXCEL and MatLab and to demonstrate ability to apply these tools in problem settings to gain experience and confidence in learning new features of EXCEL and MatLab To learn and apply principles of technical group work by productive participation in class group-work teams. Refrences: McGraw-Hill Higher Education BEST series: 1. Introduction to MatLab 6 for Engineers, William Palm III, 2. Spreadsheet Tools for Engineers, B. Gottfriedm, 3. Project Management and Teamwork, K. Smith 4. Introduction to Engineering Ethics, R. Schinzinger and M. Martin 5. Introduction to Engineering Design and Problem Solving, M. David Burghardt,
Syllabus (B. Tech. Computer Science) 4CS10: SYSTEM DESIGN LAB

3P MM: 75 Exam: 2 Hrs.
Each of the experiment is designed for two labs/classes. Experiment 1-4 can be carried in any latest CASE tools. Remaining Systems can be designed in C++/Java/FoxPro/DOTNET. 1-2 Perform system modeling using any latest CASE tools for A CD Library Management System. System Handles user enquiry about available CDs and manages inventory. Billing for customers, and reorder placement for CDs. 3-4 Perform system modeling using any latest CASE Tool for Library Management System, which handless issue and return of books, imposes fine for late return of books, and handles inquiries about book availability. 5-6 7-8 Design of complete system for Book Store Management mentioned in 1-2. Design complete system for Library Management System which only deals with issue and return of books. 9-10 Design a System for Electricity Billing System.
11-12 Design a Bus Reservation System for making reservation in five 40-seated 2x2 buses for live different routes.(Customers can opt for window seats and front seats.)
4CS10: DESIGN AND ANALYSIS OF ALGORITHMS LAB

Programming assignments on each of the following algorithmic strategy: 1. 2. Divide and Conquer method (Quick sort, Merge sort, Strassens matrix multiplication), Greedy method (Knapsack Problem, Job Sequencing, Optimal Merge Patterns, Minimal Spanning Trees). 3. Dynamic programming (Multistage Graphs, OBST, 0/1 Knapsack, Traveling Salesperson Problem). 4. 5. 6. 7. Back tracking (n-Queens Problem, Graph Coloring Problem, Hamiltonian Cycles). Sorting : Insertion sort, Heap sort, Bubble sort Searching : Sequential and Binary Search Selection : Minimum/ Maximum, Kth Smallest Element
Syllabus (B. Tech. Computer Science) 5 CS 1: COMPUTER GRAPHICS

3L
UNIT-I Introduction: Interactive computer graphic, Display device, Primitive devices, picture analysis, overview of programmer's model of interactive graphics. Fundamental problems in geometry. UNIT-II Basic Raster Graphics: Scan conversion- Points, Line conversion- Floating Point Algorithms, DDA Method, Bresenhems Method, Circle conversion, ellipse conversion Filling-Rectangle, Polygon, ellipse arc filling. Clipping: Line clipping-Cohen-Sutherland, Liang-Barsky, circle clipping Polygon clipping- Sutherland-Hodgman, Weiler-Atherton. Text Generation & Thickening. UNIT-III Geometric manipulation: Transformation- Matrices, Translation, Scaling, Rotation, and Homogeneous coordinates. Plane projections, vanishing points, specification of 3-D view. UNIT-IV Visibility: Image and object precision, z-buffer algorithms, area based algorithms, floating horizon. UNIT-V Curves and Surfaces: Parametric Representation, Bezier and B-Spline curves Rendering: Ray tracing, antialiasing, Gaurand and Phong Shading
MM: 100
Exam: 3 Hrs.
Books Recommended: 7. J. Foley, a. Van dam, S. Feiner, J. Hughes: Computer Graphics Principles and Practice. Addison Wesley. 8. D. Hearn and Baker: Computer Graphics PHI. 9. Rogers, Procedural elements of Computer Graphics McGraw hill.
Syllabus (B. Tech. Computer Science) 5 CS 2: THEORY OF COMPUTATION

3L
UNIT-I Mathematical Notations and Techniques: Sets, Logic, Function, Relations and Languages. Inductive Proofs and Recursive Definitions. Propositions: Fully parenthesized propositions, Evaluation of constant propositions, Evaluation of proposition in a state. Precedence rules for operators, Tautologies, Propositions a sets of states and Transforming English to propositional form. UNIT-II Regular Languages and Finite Automata: Regular Languages and Regular Expressions, Finite Automata, Kleen's Theorem, Properties of Regular Languages, Pumping Lemma, NonDeterminism Finite Automata with Output and Decision Problems. UNIT-III Context-Free Languages: Context-Free Grammars, Union, Concatenation of CFG. Derivation Trees, Ambiguity, Simplified and Normal Forms: CNF and GNF. UNIT-IV Pushdown Automata: Pushdown Automata, Deterministic PDA, PDA for given CFG and CFG for given PDA Pumping Lemma for Context Free Languages and Decision Problems moving Context-Free Language. UNIT-V Turning Machines: Definition, Turing Machines as Languages Acceptor, Combining Turing Machines, Variations of Turing Machines Nondeterministic Turing Machines. Universal Turing Machines Recursively Enumerable and Recursive languages. Unrestricted Grammars and Turing Machines. Context-Sensitive Grammars and Linear-Bounded Automata. The Chomasky Hierarchy. Books Recommended: 1. K. L. P. Mishra, Theory of Computer Science; TMH 2. John E. Hopcroft, Rajeev Motwani and J.D. Ulman, Introduction to Automata theory Languages and Computation, Pearson Education Asia. 3. John C. Martin, Introduction to Languages and the Theory of Computation, TMH. 4. Cohen, Introduction to Computer Theory, Pearson Education Asia.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 5 CS 3: PROGRAMMING IN JAVA

3L+1T
UNIT-I Introduction to Java: Introduction, Bytecode and JVM, Features and differences with C++, Advantages and Limitations. Java Applications and Applets, Data Types, Identifiers and Variables, Operators and Expressions, Type Conversion, Control flow, arrays, Constants, Methods. Using Class Libraries: java.lang, java.io, java.math, java.text and java.util package. UNIT-II Classes and Objects: Access specifier, Data members, Constructors, finalize, this keyword, Static data members and methods, inner Class. inheritance in Java: The Object class, Simple inheritance, Method overriding, super, Dynamic binding. Multithreading support in Java. Creating and controlling threads, managing thread pools with thread groups, distributing work in multiple threads for faster execution, distributing work in multiple threads related to I/O. UNIT-III Interfaces: Declaring and implementing, Abstract classes, Preventing inheritance, final methods, final classes. Packages: Defining, Adding classes, Importing classes, Package scope, Defining classpath. Exception Handling: Errors and Exceptions, Exception Handling Mechanism, caught and uncaught exceptions, Exception class hierarchy, handling exceptions with try, catch, finally block, defining custom exception. UNIT-IV File I/O and Basic network programming. Using the java.io and java .nio packages. Making use of the classes to open and close files and read/write data to them. Sequential and random access files. Persistent objects and serialization. Applet and Graphics Programming: Using the appletviewer, Executing Applets, Displaying various geometric shapes using 2D Graphics. Multimedia: working with images, creating animations with images, image maps, audio and video data. UNIT-V UI components using AWT and Swings. Using various UI components, Differences between AWT and Swing packages, Making Windows, Frames, Panels, and Forms. Working with Command buttons, text fields, labels, list boxes, layout manager, menus, tabbed panes, etc. Event Handling: Event Handling, Delegation Model, Event Classes, Event Listener interfaces, Adapter Classes.
MM: 100
Exam: 3 Hrs.

Books Recommended: 1. 2. 3. 4. 5. Core Java Fundamentals Volume I and II; Cay Horstmann, Gary Cornell; Pearson Education. Java: How to Program; Deitel and Deitel; PHI Java: The Complete Reference; Herbert Schildt; McGraw Hill Java2 Black Book: Steven Holzner ; O Reilly Media Programming in Java: E. Balagurusamy; TMH
Syllabus (B. Tech. Computer Science) 5 CS 4: OBJECT ORIENTED MODELING AND DESIGN
3L+1T
UNIT-I
Introduction to UML: UML MetaModel. Extensibility mechanisms like stereotypes, tagged values, constraints and profiles. OCL Overview of all diagrams in UML 2.0.
MM: 100
Exam: 3 Hrs.
UNIT-II
Object diagrams: CRC method, Review of OO concepts. Class diagrams, Classes and Relationships, interfaces and ports, Templates, Active Objects, Advanced relationships generalization, association, aggregation, collaborations. dependencies. Composite structure diagrams including composite structures,
UNIT-III
Interaction Diagrams: interaction Overview diagrams including interactions, signals, exceptions, regions, partitions, Sequence diagrams, Communication diagrams.
UNIT-IV
State Machine diagrams: States, encapsulation of states, transitions, submachine, state generalization. Timing diagrams, Activity diagrams, Activities, sub activities, signals, exceptions, partitions, and regions.
UNIT-V
Architecture UML: Package diagrams, Component diagrams, Deployment diagrams. Applications of UML in embedded systems, Web applications, commercial applications.
Books Recommended:
1. Object oriented Modeling and Design: J. Rumbaugh, M. Blaha W. Premerlani, F. Eddy et al; PHI 2. Object oriented Modeling and Design with UML 2nd Ed.: J. Rumbaugh, M. Blaha W. Premerlani, F. Eddy; PHI 3. Object oriented Modeling and Design with Appliactions: Grady Booch, Benjamin; Cummings Pub. Co. 4. UML Distilled: a Brief Guide to the Standard Object Modeling Language: Martin Fowler (Paperback); Addison Wesley
Syllabus (B. Tech. Computer Science) 5 CS 5: COMPUTER ARCHITECTURE

3L
UNIT-I Introduction to Computer Architecture: Overview and history - The cost factor; Performance metrics and evaluating computer designs, Memory hierarchy, Memory addressing, Assembly / machine language; Von Neumann machine cycle; Microprogramming / firmware, Classifying instruction set architectures - RISC versus CISC, Processor vs. memory speed, Introduction and Classification of Parallel Computers. UNIT-II Addressing techniques: Addressing techniques-Direct, immediate addressing; Paged, relative, indirect and indexed addressing. Registers: Register Transfer Language, Bus and Memory Transfers, Bus Architecture, Bus Arbitration, , Memory buffer register; accumulators, Registers-indexed, Arithmetic Logic, Shift Micro operation, Arithmetic Logic Shift Unit, Design of Fast address, Arithmetic Algorithms (addition, subtraction, Booth Multiplication), IEEE standard for Floating point numbers. UNIT-III Control Design: Hardwired & Micro Programmed (Control Unit), instruction execution, Multiple-Bus organization, Microinstruction, Micro program sequencing, Wide-Branch addressing, Microinstruction with Next-address field, Perfecting Microinstruction. Processor Design: Processor organization, General register organization, Stack organization, Addressing mode, instruction format, Data transfer & manipulations, Program Control, Reduced instruction Set Computer. UNIT-IV Input-Output organization: I/O devices (Video terminals and Printers), Programmed and interrupt control mechanism, I/O controllers, Computer Buses, interfacing buses, bus format & bandwidths. I/O interface, Modes of transfer, interrupts & interrupt handling, Direct Memory access, input-Output processor, Serial Communication.
MM: 100
Exam: 3 Hrs.

UNIT-V Memory Organization: Memory Hierarchy, Main Memory - RAM, static and Dynamic; ROM, EPROM, EAROM, EEPROM, Cache and Virtual memory, Auxiliary storage devices hard disk, floppy disk, magnetic tape, cassettes, cartridges and compact disks. Virtual Memory, Memory management hardware. Books Recommended: 1. Hawang, K., Briggs, F. a.: Computer Architecture and Parallel Processing, McGraw Hill 2. Hawang, K.: Advance computer Architecture -Parallelism, Scalability and
Programming, McGraw-Hill international Ed 3. Mano Moris M: Computer System Architecture, PHI. 4. Tanenbaum a.S.: Structured Computer organization 5. William Stallings, Computer organization and Architecture
Syllabus (B. Tech. Computer Science) 5 CS 6.1: IC TECHNOLOGY

3L
UNIT-I Introduction To Technologies: Semiconductor Substrate-Crystal defects. Electronic Grade Silicon. Czochraslski growth float, Zone Growth. Characterization & Evaluation of Crystals: Wafer Preparation-Silicon Shaping Etching and Polishing Chemical cleaning. UNIT-II Diffusion & Ion Implantation: Ficks Diffusion Equation in One Dimension Atomic model, Analytical solution of Ficks law, Correction to simple theory, Diffusion in SiO2Ion Implantation and Ion Implantation Systems, Growth mechanism and Deal-Grove Model of Oxidation, Linear and Parabolic Rate Coefficient, the structure of SiO2 Oxidation techniques and system, Oxide Properties. UNIT-III Chemical Vapour Deposition and Layer Growth: CVD for deposition of dielectric and polysilicon - a simple CVD system chemical equilibrium and the law of mass action, Introduction to atmospheric CVD of dielectric, low pressure CVD of dielectric and semiconductor, Epitaxy-Vapor Phase epitaxy, Defects in Epitaxial growth, Metal organic Chemical Vapor Phase, Defects in Epitaxial growth, Metal organic Chemical Vapor Deposition, Molecular beam epitaxy. UNIT-IV Pattern Transfer: Introduction to photo/optical lithography, contact/proximity printers, projection printers, mask generation, Photoresists. Wet etching, Plasma etching Reaction ion etching. UNIT-V VLSI Process integration: Junction and Oxide Isolation, LOCOS methods, Trench Isolation, SOI; Metallization, Planarization. Fundamental consideration for IC Processing NMOS IC Technology, COMOS IC Technology, Bipolar IC Technology. Books Recommended: 1. VLSI Technology: S. M. Sze; Tata Mc-Graw Hill. 2. Principles of Microelectronic Technology: D. Nagchoudhary; Wheeler Publishing. 3. The Science and Engineering of Microelectronic Fabrication: Stephen a. Campbell; Oxford University Press. 4. Introduction to Semiconductor Manufacturing: Hong Xiao; Prentice Hall.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 5 CS 6.2: LOGICAL AND FUNCTIONAL PROGRAMMING
3L
UNIT-I Propositions: Fully parenthesized. Evaluation of constant propositions, Evaluation of proposition in a state, Precedence rules for operators, Tautologies, Propositions a set of states and Transforming English to propositional form. Reasoning using Equivalence
MM: 100
Exam: 3 Hrs.
Transformations: The laws of equivalence, rules of substitution of transitivity, formal system of axioms and inference rules. UNIT-II Natural Deduction System: Introduction to deductive proofs, inference rules, proofs and sub proofs, adding flexibility to the natural deduction system and developing natural deduction system proofs. UNIT-III Predicates: Extending the range of a state, Quantification, Free and Bound identifiers Textual substitution, Quantification over other ranges and some theorems about textual substitution and states. UNIT-IV Logic Programming: Introduction to propositional and predicate calculus. First order Predicate calculus, Formal logical systems, Prolog Programming-Facts, Rules and queries, implementations, Applications, Strengths and Weaknesses. UNIT-V Functional Programming: Introduction to lambda calculus-Syntax and semantics, Computability and correctness, features of Functional Languages-composition of Functions, Functions as first class Objects, no side effects and clean semantics, LISP Programming Data types and structures, Scheme dialect, primitive functions, functions for constructing functions and functional forms. Applications of functional languages and comparison of functional and imperative languages.
Books Recommended: 1. Programming Languages: Appleby; Tata Mc-Graw Hill. 2. Concept Programming Languages: Sebesta; Pearson Education. 3. The Science of Programming: David Gries; Narosa Publication House.
Syllabus (B. Tech. Computer Science) 5 CS 6.3: INFORMATION THEORY AND CODING
3L
UNIT-I Elements of information Theory: Measure of information, Average information, Entropy, information rate. Communication channel, Discrete and continuous channel Shannon-Hartley theorem and its implications. Channel capacity, Gaussian channel, Bandwidth-S/N tradeoff. UNIT-II Introduction of Coding: Types of errors, Types of codes, Error control coding, Methods of controlling errors. Linear Block and Binary Cyclic Codes: Matrix decryption of linear block codes, Error detection and error correction capabilities of linear block codes. Hamming codes, structure of cyclic codes, encoding using an (n-k) bit shift register syndrome calculation, its error detection & correction, Special classes of cyclic codes BCH. UNIT-III Burst and Convolution Codes: Burst and random error correcting codes, Encoders for convolution codes. Decoders for convolution codes, Performance of convolution codes, performance of block codes in error correction & detection. Comparison of error rates in coded and uncoded transmission. UNIT-IV Importance of System Security and factors affecting it. Conventional Encryption: Classical Techniques, Modern Techniques, AES, Introduction to Finite Fields, Contemporary Symmetric Ciphers, Confidentiality Using Conventional Encryption UNIT-V Public-Key Encryption and Hash Functions: Introduction to Number Theory, Public-Key Cryptography, Key Management, Message Authentication and Hash Functions, Hash and Mac Algorithms, Digital Signatures and Authentication Protocols.
MM: 100
Exam: 3 Hrs.
Books Recommended: 1. Digital and Analog Communication System: K. Sam Shanmugam; John Wiley Sons. 2. Principal of Communication System: Herport Taub, Donald L. Schilling; Tata McGraw Hill. 3. Cryptography and Network Security-Principles and Practice: William Stallings: 3rd Ed. PHI
Syllabus (B. Tech. Computer Science) 5 CS 6.4: SYSTEM ANALYSIS AND DESIGN
3L
UNIT-I Introduction: System definition and concepts, characteristics and types of System, Real-life Business Subsystems, Systems Models, System Boundaries; Real-time and Distributed Systems, Basic principles of successful System. UNIT-II Overview of system analysis and design: feasibility analysis, design, implementation, testing and evaluation- Introduction to Systems Development Life Cycle and its phases. Project Selection: Sources of projects requests, managing project; review and selection, preliminary investigation. UNIT-III Feasibility Study: Technical and economical feasibility, cost and benefit analysis. System requirement specification and analysis: Fact finding techniques, data flow diagrams, data dictionaries, process organization and interactions, Decision trees and tables. UNIT-IV Detailed design: Modularization, Module specification, file design, system development involving database. System control and Quality Assurance: Design objectives; reliability and maintenance, software design and documentation tools, top-down, bottom-up and variants. UNIT-V Units and integration testing: Testing practices and plans. System Controls, Audit trails and Security. System Administration and Training, Conversion and operation plans. Hardware and Software Selection, Hardware acquisition, memory, processes, peripherals, benchmarking, vendor selection, software selection - Operating system languages, language processes, performance and acceptance criteria. Books Recommended: 1. Analysis of Design of information Systems: James, a. S.; Tata McGra-Hill 2. System Analysis and Design: Awad Elias M.; Prentice Hall 3. information System Development-a Systematic Approach: J. Ludeberg, M. Glkuhi G. & Hilsson, a.; Prentice Hall international 4. introducing System Analysis and Design Vol. 1& 2: Lee, B.S.; Manchester United Kingdom, National Computer Centre 5. System Analysis and design: Davis W. S.; Addison - Wesley 6. Practical System Design: Daniel; Galgotia Pub. Pvt. Ltd.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 5 CS 7: COMPUTER GRAPHICS LAB(C/C++).

1. Write a C/C++ program to implement the following: 2. mid point line scan conversion. a. mid point ellipse scan conversion. b. mid point circle scan conversion. 3. Draw simple geometric figures (ellipse, rectangle, triangle) and implement the following: a. Boundary fill, Flood fill algorithm. b. Translation about a line for origin. c. Resizing operations. 4. Write a C/C++ program to implement a thick line using different line style, pen style and pattern. 5. Write a C/C++ program to implement following: a. Cohen-Southerland line clipping algorithm. b. Southerland-Hodgeman polygon clipping algorithm. 6. Write a program to perform 2D incremental rotation with/without shear of a geometrical object, at desired speed. 7. Program a 3D clipping algorithm for parallel and perspective projection (say of a house). 8. Write a program to accept an arbitrary geometry matrix, basis metric and list of control points, and to draw the corresponding curve. 9. Implement a procedure to draw text centered in an opaque rectangle with thin boarder. Let the user specify color (text, boarders, and back ground), Type (Font, letter size and screen position) and text string. If can't fit in one line, break it at appropriate places to make multi-line text, implement both the multi-line text and multi-scan text. 10. Write an interactive program allowing user to create, manipulate and refine piecewise continuous cubic curve represented as BSpline and Hermite Bezier. 11. Write a program to display on a grey background distinct squares colored as orange, red, green, blue, cyan, magenta & yellow. Each square has NxN pixels. Where N is an input, find out value of N to unambiguously identify each square: a. from a distance of 24 inch. b. from a distance of 48 inch. c. study the effect of changing background color on above. 12. Implement a ray tracer for spheres and polygons. 13. Write a program to interpolate linearly between two colors in RGB, HSV and HSL schemes.

14. Write a program to draw a robot capable of moving in a room and animate it to pick an object from one point and place at other.
Syllabus (B. Tech. Computer Science) 5 CS 8: MICROPROCESSOR LAB.

1.Study the hardware functions memory structure and operation of 8085 microprocessor kit. 2.Perform the following integer operations: i. 8-bit by 8-bit (division) ii. 16-bit by 8-bit (division) iii. 8-bit by 8-bit (multiplication) 3.Transfer of a block data in memory to another place in memory in the forward and reverse order. 4.Searching a number in an array and finding its parity. 5.Sorting the array in: i. Ascending order. ii. Descending order. 6.Perform following conversion: i. BCD to ASCII ii. BCD to Hexadecimal. 7.Programme to generate and sum 15 Fibonacci numbers. 8.Programme for rolling display of message "INDIAN". 9.To insert a number at correct place in a sorted array. 10. Serial and Parallel data transfer on output port 8155 & 8255 & designing of disco light, running light, and sequential lights on off by above hardware. 11. Generation of different waveform on 8253/8254 programmable timer. 12. Write a program to add interest on the amounts deposited in a bank. The amount is stores as an array. The computed amount should be stores in another array. An amount above 4000 is entitled for 8% interest ad remaining is for 4%. 13. Write a program, which inputs a password and should an alarm if the password in incorrect. 14. Compute the transmission message if the original message and generator polynomial is given. Use CRC-12 as a generator. (Note: - Refer to computer Networks by Tanenbaum). 15. Write a program to compute factorial of a single digit. Write a program to convert BCD numbers to binary, Hex and Octal. 16. Use registers to pass parameters to the procedure. 17. Use memory locations to pass parameters to the procedure. 18. Use pointers to pass parameters to the procedure. 19. Write a program which uses macro for addition of corresponding elements of 2 arrays.
Syllabus (B. Tech. Computer Science) 5 CS 9: JAVA PROGRAMMING LAB

1. Object-oriented Design. Beginning coding. Narrating interactions. Diagrams of relationships. Generalization and encapsulation. Determine potential objects and classes for an Othello simulation. Refining your descriptions. Narrating interactions. Generalization. 2. An Introduction to Java. a hello world program. Compilation. Reading input. Concatenating strings. Variables. Numeric input and output. 3. Primitive Types. Representing integers, reals. Coercion and casting. Representing characters. Precedence. Converting cases. Rounding or truncation? Big integers and big reals. 4. Objects and Methods. Objects. Creating objects. Building your own methods. Creating your own classes. Return values. Static methods. Detour: The main method. Assigning objects. 5. Building Your Own Classes. Object state. Constructors. Overloading. Creating a bordered square class.
Boolean Expressions and Conditionals. Boolean expressions. Operations on Booleans. Conditionals. The switch statement. 6. Control Structures for Repetition. Repetition while loops. Detour: Overloading revisited for loops. Detour: Arithmetic shorthand Loops. 7. Arrays and Hash Tables. Counting scores. Arrays. Counting words. Hash tables. 8. Recursion. Mathematics and recursion. Fibonacci numbers. a guessing game. Exponentiation. Searching. Sequences. Detour: Random sequences. Sequential search. Detour: The number game, revisited. Binary search. Problems with binary search. Finding the smaller elements of a sequence. Iterative binary search. Searching through names. Finding the first occurrence. 9. Inheritance. Reuse. Inheritance. Overriding methods. From rectangles to squares. Multiple inheritances. Building a new point class. a simple extension of the Point class. Adding functionality to Extended Points. Overriding methods. Overriding the toString method. Putting Points on a grid. Validating Squares. a hierarchy of shapes.

10. Interfaces and Polymorphism. Polymorphism. interfaces. Generalized methods. Generality through inheritance. Building generalized methods with Java's interfaces. Object Cloning. Abstract classes. interfaces vs. inheritance. 11. Exception Handling. Understanding Exceptions. The exception hierarchy. Errors v/s.
Exceptions. Using the try..catch statements. Raising exceptions with throw. Alerting users with throws. Making custom exceptions and raising them. The finally code block. 12. Input, Output, Files. Output and System.out. Output files. Closing files. input. input and System.in. Converting strings to other types. 13. Network Programming. Using the socket class and transferring data. Creating time clients and servers. Transporting objects between clients and server. 14. Graphics and Applets. Applets. Painting pictures. a circle applet. Colors. Pixels vs. coordinates. Applet dimensions. Repainting. Applet parameters. Fonts and graphics for applets. 15. Java's Abstract Windowing Toolkit. Components. Events and control flow. The actionPerformed event. Adding a Quit button. Adding more buttons. Separate listeners. Creating multiple windows. Building separate listeners. a customizable alert. Multiple frames. Layout managers. Introduction to Swings. Using swing components for GUI. 16. Java's Abstract Windowing Toolkit Continued. Getting user input. Getting numeric input. String manipulation. a simple calculator. Supporting real numbers. Capitalization. Passwords. Setting the size of text fields. Beginning a real calculator.
Syllabus (B. Tech. Computer Science) 6 CS 1: COMPUTER NETWORKS

UNIT-I Introduction: Introduction about computer networks, its uses, defining internet, intranet, Extranet. Application of computer network, network protocols, network edge. Access Networks and Physical Media. Protocol Layers and their service models, internet Backbones, NAPs and ISPs. Network Hardware/Software, Reference Models (OSI, TCP/IP) UNIT-II Application Layer: Protocols and Services provided by Application Layer; Domain name Systems DNS, World Wide Web (HTTP) architectural overview, Electronic Mail (SMTP, POP, IMAP etc.). UNIT-III Transport Layer: Transport-Layer Services and Principles, Elements of Transport Protocols Addressing, Connection Establishment and Release, Flow Control and Buffering, Multiplexing and De-Multiplexing and Crash Recovery, Connectionless Internet Transport Protocol UDP, TCP. UNIT-IV Network Layer and Routing: Design Issues, Network Service Model, Routing Principles: Flooding, Link State Routing Algorithm, Distant Vector Etc. Algorithm. Router Components: Input Port, Switching Fabric and Output Port. Congestion Control Algorithms, Internetworking. UNIT-V Link Layer: Introduction, Design Issues, Error Detection and Correction, Link Layer Protocols Simplex Protocols, Stop and Wait, Sliding Window, Go-Back N, Selective Repeat. HDLC. Medium Access Control: ISDN, FDDI, ALOHA, Ethernet, Wireless LAN, Virtual LAN, Networking Devices. Books Recommended: 1. Computer Networks 4th Ed.: andrew S. Tanenbaum; Pearson Education 2. Computer Networking: J. F. Kurose and K. W .Ross; Pearson Education Asia. 3. Data Communications and Networking: B. a. Forouzan; Tata Mc-Graw Hill. 4. Communication Networks: Garcia and Widjaja; Tata Mc-Graw Hill.
Syllabus (B. Tech. Computer Science) 6 CS 2: OPERATING SYSTEM

3L
UNIT-I Introduction: What is Operating System? Operating-System Structure, Types and Role of Operating System. Virtual Machines and System Boot-sequence, Special Purpose Operation System: Introduction to Distributed System, Embedded System, Real time System, Multimedia System. UNIT-II Processes Managements: Process Concept, Scheduling, Operations on Processes, interprocess Communication, Examples of IPC Systems, Communication in Client-Server Systems, Threads: Introduction, Multithreading Models, Threading Issues, CPU Scheduling: Introduction, Scheduling Criteria, Scheduling Algorithms, Process Synchronization: Overview, The Critical-Section Problem, Petersons Solution, Synchronization Hardware, Semaphores, Classic Problems of Synchronization, Monitors, Deadlocks: System Model, Deadlock Characterization, Deadlocks Handling, Prevention, Avoidance, Detection, Recovery from Deadlock UNIT-III Memory Management: Swapping, Contiguous Memory Allocation, Paging, Page Table, Segmentation, Virtual Memory: Demand Paging, Page Replacement, Allocation of Frames, Thrashing, Memory-Mapped Files, Secondary Memory: File-System concepts, Access Methods, Directory Structure, File-System Mounting, File Sharing, Protection, File-System Implementation: Structure, Implementation, Directory Implementation, Allocation Methods, Free-Space Management, Efficiency and Performance, Recovery, LogStructured File Systems, NFS. UNIT-IV I/O Management: Device drivers, disk scheduling, Introduction to loaders, linkers and relocating loaders, Security: Security Problem, Program Threats, System and Network Threats, Cryptography as a Security Tool, User Authentication, and Implementing Security Defenses, Firewalling to Protect Systems and Networks, Computer-Security Classifications.
MM: 100
Exam: 3 Hrs.

UNIT-V Case Study: The LINUX System-History, Design Principles, Kernel Modules, Process Management, Scheduling, Memory Management, File Systems, input and Output, Interprocess Communication, Network Structure. Books Recommended: 1. 2. 3. 4. 5. Operating System Concepts Seventh Edition: Avi Silberchatz, Peter Baer Galvin, Greg Gagne; John Wiley & Sons Inc. Modern Operating Systems, S. Tanenbaum: Pearson Education Asia. Operating Systems-a Concept based approach, M. Dhamdhere: Tata Mc-Graw Hills. Operating Systems, Achyut Godble: Tata Mc-Graw Hills. Operating System, Stallings, Pearson.
Syllabus (B. Tech. Computer Science) 6 CS 3: RELATIONAL DATABASE MANAGEMENT SYSTEM

UNIT-I
Introduction to Database: Database, Database Management System, DBMS Architecture, Entity, Attribute, Relationship, Database Model, data independence, storage structures, data representation, indexing, relational data structure, attributes, keys, embedded SQL, Relational Algebra, Query, relational calculus, normalization & normal forms, functional dependence, overview of security, integrity, recovery, backup. Introducing RDBMS.
UNIT-II
SQL: Introduction, Types of SQL Dynamic, Static, Embedded; SQL Commands DDL< DML, DCL. interactive SQL Commands, Data Definition Language (Managing Database and Queries: Creating, defining and modifying Table structure, Truncate, and Drop), Data Manipulation Language (Select, Update, insert, Delete), Special SQL commands pattern matching, ordering, aggregate functions & grouping, union, intersection, minus, exists. Nested queries, views, index. Data Control Language, SQL function.
UNIT-III
Oracle 9i: SQL*Plus console, connecting to oracle server, substitution variables, formatting output, concatenating columns, PL/SQL: PL/SQL Architecture, PL/SQL Block Structure, PL/SQL Datatype, Control structure: Sequential Control, Conditional Control and Iteration Control, cursor, triggers and stored procedures, Function, Exception Handling, Packages,. in/out parameters, sequence.
UNIT-IV
Microsoft SQL Server: User Interfaces, Differences Between SQL Syntax From Oracle and SQL Server, Using Wizards to Create Tables and Other Database Objects. Transact-SQL: Data Types, Built-In Functions, Using SQL to Define Database Objects, Altering Database Objects, DML, Complex DML Queries, Stored Procedures, Triggers and Functions, Security.
UNIT-V
Database Performance Measures and Tuning: Database Design, Table Structures, Normalization v/s. Efficiency Trade-Off, Availability of Index and Keys, Query Optimization, Use of Data Dictionary for Performance Tuning. Backup and Recovery: Taking Full Backups, Taking Incremental Backups, Creating Check Points, Mirroring Techniques, Recovery Mechanism, Restoring From Log Files.

Books Recommended: 1. Database System Concepts: Korth and Silberschatz Abraham, Mcgraw Hill 2. An Introduction To Database Systems, Vol.-1: C. J. Date (Addison Wesley) 3. PL/SQL: The Programming Language Of ORACLE, Ivan Bayross, BPB 4. Oracle PL\SQL Programming Urman - Tech Media 5. Mastering Oracle Sybex - Oracle Press 6. Oracle 9i: The Complete Reference; 7. Microsoft SQL Server 2000 DBA Survival Guide; Mark Spenik, Orryn Sledge; Sams 8. Microsoft SQL Server Black Book; Patrick Dalton; Coriolis Group Books 9. Sams Teach Yourself Microsoft SQL Server 2000 In 21 Days; Richard Waymire, Rick Sawtell; Sams
Syllabus (B. Tech. Computer Science) 6 CS 4: APPLICATION DEVELOPMENT USING JAVA

3L+1T MM: 100 Exam: 3 Hrs.
UNIT-I
GUI Programming revised. Networking and Object serialization revisited. Generic Programming: Why generic programming, using the built generic method/classes, defining your own generic classes and methods.
UNIT-II
Collections Framework: Collections, Vectors, Hash table Key/value pairs, Enumeration, Type casting, ArrayList, Hash Maps, Iterators, Properties. Reflection Mechanism and Concurrency control: Reflection mechanism in java, Using Java lang reflect package to get information about classes and objects at runtime, Concurrency package Java.util.concurrent, Object synchronization.
UNIT-III
JDBC: Importance of databases in applications and web programming, Overview of relational DBMS, JDBC API, Connecting a simple console application to MS-Access database, Using the result set and row set, Accessing and using the meta data, Connecting a GUI application to MS-Access, Using MySQL and Oracle DBMS packages as back ends, Executing stored procedures.
UNIT-IV
J2EE Architecture: Java EE Overview, Web Core Technologies: Servlet and JSP; Web Application Structure; Session Tracking; JSP 1.2 Custom Tags; JSP 2.0 Custom Tags; JSTL; JDBC, SQL, ANT, JUnit, Version Control; Web-tier Security ; SSL; Overview of Struts; Struts Tags; Struts Validation Framework; Tiles Framework; Struts and Databases. Redistributable Components: Java beans, Design patterns for properties, events, methods, Beaninfo interface, persistent bean objects. EJB 1.2 and d2.0
Syllabus (B. Tech. Computer Science) UNIT-V

Web Application Development: Introduction to Servlets and JSP, Compiling and packaging, Creating deployment descriptors, Deploying an individual servlet and JSP on web server (Tomcat and Web logic using Ant), Naming and Mapping Servlets, Precompiling and Mapping JSP, Dynamic contents and external resources, Web-form data, File uploads, Exception Handling, Cookies, Session Management, Integrating Javascript with Servlets and JSP, Sending Non-HTML (Pdf, Doc, Xml, Audio) Content, Client Authentication and SSL.
Books Recommended: 1. Core Java Fundamentals Volume I and II; Cay Horstmann, Gary Cornell; Pearson Education. 2. 3. 4. 5. The J2EE Tutorial; Stephanie Bodoff, Dale Green, et al.; Addison-Wesley Java Servlet and JSP Cookbook; Bruce W. Perry; OReilly Java Server Pages; Hans Bergsten; OReilly Expert One-on-One J2EE Design and Development; Rod Johnson; Wiley
Syllabus (B. Tech. Computer Science) 6 CS 5: SIMULATION AND MODELING

3L+1T
UNIT-I The Nature of Simulation: Simulation Model - Static, Dynamic, Deterministic Stochastic Continuous, Discrete Models. UNIT-II Generation of Random Numbers and their Applications: Pseudo random numbers and algorithm for generating them-middle-square method, linear congruently method, Testing and validating pseudo random sequences, Non-uniform variants-inverse-transform method, Generation of normal random numbers (binomially, exponentially)-Monte Carlo (MC) integration - integration, (hit or miss MC method error analysis, Sample mean MC method, efficiency of MC method. UNIT-III Discrete System, Simulation and Model Validation: Simulation terminology, Time management methods, Object generation, Events and event synchronization, Queue management and list processing, Collecting and recording simulation data, Evaluation of the simulation model. UNIT-IV Simulation Software: Modeling of Complex Systems, Use of a Simulation Language such as GPSS, SIMSCRIPT, SLAM, GASP, and SIMULA. UNIT-V Evaluation of Simulation Output: Random Variables and their properties Estimation Methods, Goodness of Fit, Confidence intervals, Variance Reduction Techniques, Validation of Simulation Models. Books Recommended: 1. Simulation Modeling and Analysis, 2nd Ed.: Kelton W.D. and Law a.M; McGraw Hill. 2. Interactive Dynamic System Simulation: G. A. Korn; McGraw Hill. 3. Discrete Event Simulation-A Practical Approach: Pooch Udo w., James A, Wall; CRC Press 4. Introduction to System Dynamics Modelling: Mohapatra P. K. J., MandaI P., Bora M. C.; Universities Press (india) Ltd 5. Simulation and The Monte Carlo Method: Rubinstein R. Y.; John Wiley , & Sons 6. Simulation Modeling and Analysis-2nd Ed.: Law a. M., Kelton W. D.; McGraw Hill.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 6 CS 6.1: FUZZY SYSTEMS

3L
UNIT-I Introduction: The case for imprecision, An historical perspective, The utility of fuzzy systems, Limitations of fuzzy systems, The Allusion: statistics and random processes, Uncertainty and information, Fuzzy sets and membership, Chance versus fuzziness, Sets as points in Hypercube UNIT-II Classical Sets and Fuzzy Sets: Classical Sets: Operations on Classical Sets, Properties of Classical (crisp) sets, Mapping of classical Sets to functions Fuzzy sets : Fuzzy set Operations , Properties of Fuzzy sets, Non-interactive Fuzzy Sets, Alternative Fuzzy Set Operations UNIT-III Classical Relation and Fuzzy Relation: Cartesian product Crisp Relations: Cardinality of Crisp Relations, Operation on Crisp Relations, Properties of Crisp Relations, Composition Fuzzy Relation: Cardinality of Fuzzy Relations, Operation on Fuzzy Relations, Properties of Fuzzy Relations, Fuzzy Cartesian product and Composition Tolerance and Equivalence Relations: Crisp Equivalence Relation, Crisp Tolerance Relation, Fuzzy Tolerance and Equivalence Relations Value Assignments: Cosine Amplitude, Max-Min method, Other similarity method UNIT-IV Properties of Membership Functions, Fuzzification and Defuzzification: Features of the Membership Function, Various Forms, Fuzzification, Defuzzification to Crisp Sets, cut for Fuzzy Relations, Defuzzification to Scalars.
MM: 100
Exam: 3 Hrs.

UNIT-V Logic and Fuzzy Systems: Logic: Classical Logic, Tautologies, Contradictions, Equivalence, Exclusive Or and Exclusive Nor, Logical Proofs, Deductive Inferences Fuzzy Logic: Approximate Reasoning, Other Forms of the implication Operation Fuzzy Systems: Natural Language, Linguistic Hedges, Fuzzy (Rule-Based) System Graphical Techniques of inference
Books Recommended: 1. 2. 3. Fuzzy Logic with application to Engineering, T. J. Ross, 2nd Edition Fuzzy Sets, Uncertainty & information, G. J. Klir & T.A. Folyger, PHI, 1988. Fuzzy sets & Fuzzy logic, G. J. Klir & B.Yuan, PHI, 1995.
Syllabus (B. Tech. Computer Science) 6 CS 6.2: ORGANIZATIONAL BEHAVIOUR

3L
UNIT-I Organizational Behaviour: Definition, assumptions, significance, Historical Background, Fundamental concepts of OB, Research foundation, Trends, Impact of globalization, Learning organization and Knowledge management. UNIT-II Individual Behaviour and Managing diversity: individual Behaviour, main reasons, impact, trends and layers of diversity, demographic differences, barriers and challenges, competitive advantages, diversity initiatives. Personality Development: Meaning, theories of Personality development, managerial consideration for further developing of personality development of employee. Perception: Meaning and definition, Perceptual process, Managerial implications of perception in business situations, schemas, perceptual errors. UNIT-III Motivation: Nature and Importance, Basic process, Need, Theories of motivation: Concept of Needs, Maslows Hierarchy of Needs Theory, Alderfers ERG Theory, McClellands Achievement Motivation Theory, Cognitive and Behavioral Theories- Expectancy, Equity, Goal-Setting Theories. UNIT-IV Communication: Meaning, Importance, Process, Types, Effective and Efficient Communication, Barriers in communication. Group Behaviour: Group formation: Formal and Informal group, Stages of group development, Group decision making, Group effectiveness and self managed teams. UNIT-V Conflict and Stress Management: Meaning, Process, Functional and Dysfunctional Conflict, Conflict Handling, Nature, causes and consequences of stress. Management of change: Concept, Lewins Stages of change, Forces of change, Resistance to change,Managing planned change. Books Recommended: 1. Organizational Behavior: Stephen P. Robbins, James V. Dupree; PHI 2. Organization Behaviour: Mrityunjay Banerjee; Allied Publishers Limited. 3. Organizational Behaviour and Design: Barry Cushway, Derek Lodge, Price water house Coopers (Firm); Kogan Page.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 6 CS 6.3: E-COMMERCE

Unit-I Introduction: Scope of Electronic Commerce, Trade Cycle, Electronic Markets, Electronic Data Interchange, Internet Commerce and E-Commerce in Perspective. Business Strategy In An Electronic Age: Value Chain - Supply Chains, Porter's Value Chain Model and Inter - Organizational Value Chains. Competitive Advantage - Competitive Strategy, Porter's Model, First Mover Advantage and Competitive Advantage using ECommerce Business Strategy-Introduction To Business Strategy, Strategic Implications of It of It Technology, E-Commerce Implementation and Evaluation. Unit-II Case Study: E-Commerce in Passenger Air Transport, Choices, Airline Booking Systems, Competition and Customer Loyalty, Web Booking Systems and Competitive Outcomes. Business To Business Electronic Commerce: Inter Organizational Transactions, The Credit Transaction Trade Cycle. A Variety of Transactions, Electronic Markets - Markets and Electronic Markets, Usage of Electronic Markets, Advantages and Disadvantages of Electronic Markets. Unit-III Electronic Data Interchange (EDI) Definition and Benefits of EDI. EDI Technology, Standards, Communications, Implementation, Agreements and Securities. EDI Trading Patterns and Transactions. Unit-IV Building An E-Commerce Site: Introduction to Object Behaviour, Components, Active Scripting. Object Models, Infrastructure Objects, Service Objects and Data Objects, Choosing Objects. Building a Scalable Application, Adding Configure Method, Connecting to Database. Accessing and Versioning Database. Building Catalog Object with Example. Creating Shopping Basket-Holding State, Creating Tables for a Shopping Basket, Modifying Object Model and Making Basket Accessible. Unit-V J2ee Architecture Overview: Enterprise Components. Information Technology In The Enterprises. Introduction to Enterprise Objects and Enterprise Component Model. The J2ee Model Features J2ee Components - Container Architecture. Enterprises Java and J2ee Architecture.

Books Recommended: 1. E-Commerce Strategy: Technology and Application: David Whitely; TMH. 2. Beginning E-commerce with Visual Basic ASP, SQL Server 7.0 and MTS: Mathew Reynolds; Shroff Publishers & Distributors Pvt. Ltd. 3. Building Java Enterprises System with J2EE: Perrone & Chaganti; TechMedia. 4. Frontiers of Electronic Commerce: Kalakota; Pearson Education.
Syllabus (B. Tech. Computer Science) 6 CS 6.4: ADVANCE COMPUTER ARCHITECTURE

3L
UNIT-I Parallel Processing: Generation of computer systems, Trends towards parallel processing, parallelism in uniprocessor system, Multiprogramming and time sharing parallel computers structures-pipeline, Array and multiprocessor systems, Data flow and new concepts, Architectural classification, schemes, applications. UNIT-II Pipelining and Vector Processing: Principle of linear pipelining, classification, reservation tables, interleaved memory organization, instruction and arithmetic pipelines, Principles of designing pipelined processors, vector processing requirements. UNIT-III Structures and Algorithms for Array Processors: SIMD interconnection networks, parallel algorithms for array processors, associative array processing. UNIT-IV Multiprocessors concepts: Multiprocessors and its characteristics, Memory organization for multiprocessors systems, synchronization and models of memory consistency, Issues of
MM: 100
Exam: 3 Hrs.
deadlock and scheduling in multiprocessor systems, Cache in multiprocessor systems and related problems, Cache coherence protocols, Parallelism algorithm for multiprocessor systems. UNIT-V Data Flow Computer: Data driven computing and languages, data flow computer architectures, Introduction to VLSI computing structures.
Books Recommended: 1. Computer Architecture & Parallel Processing: Hawang & Briggs; Mc Graw Hill. 2. Advanced Computer Architecture Tutorial: Dharam P. Agarwal; IEEE order
Syllabus (B. Tech. Computer Science) 6 CS 7: UNIX Shell Scripting and TCP/IP LAB
3P MM: 75
1. Introduction to various Shell commands. 2. Commands defining the use of tar files, searching and word count. 3. Introduction to vi editor. 4. Introduction to Linux file system. 5. Writing shell script to perform following 1. echo 2. basic calculation (addition, subtraction, multiplication and division) 3. date and calendar (in different formats) 4. use of if-fi, if-else-elfi and loops 6. Implement socket program and perform loop-back test on daytime port. 7. Implement a socket program to communicate between two machines. 8. Extend the above program to implement talk between two users. 9. Implement a simple file transfer service to transfer text files. 10. Write an 'echo client and server' software using socket. 11. Write Program to decide TCP segment header. 12. Write TCP/IP packet analyzer. 13. Implement an IP routing table. 14. Implement sliding windows protocols for flow control.
Exam: 2 Hrs.
Syllabus (B. Tech. Computer Science) 6 CS 8: RDBMS LAB (SQL Server/oracle)

1. Produce an E-R diagram, which documents the entities and relationships involved in the Assets Management System of an organization. Create a relational schema to hold the necessary information. Identify the tables, perform normalization to the tables and fully implement the code with necessary validations using oracle / MS SQL Server or any other similar package. 2. Let us suppose that XYZ Universitys Administration office needs a database to handle students transcript data. The following are the requirements: The database keeps track of each students name, enrollment no. (E. No.), communication address and phone no., permanent address and phone no., date of birth, sex, class, department, college, major subjects (a 4-char code). Some applications needs to refer individually to the city, state (2-char abbreviation) and zip code (some use 5-digit, come use 9) of the students address: Some applications need to refer to students first and lat names separately. Enrollment no. should be unique number for each student. Each department has a name, a 3-char code, location (main building and room number), office phone, college, and a list of instructors. Many colleges are affiliated to the University. Department names and code are unique, within the university. Each instructor has his/her enrolment no., first name and last name. The course catalog contains the list of courses that XYZ University offers. Each course has a number (e.g. 543), name, description, credit hours and department. Course numbers are unique within a department, but not unique across the university (so taken together, they are unique). Not every course is offered every semester. Each section has a single instructor (first and last names no team-taught class), semester (1-4) year (2-digit), course number and section number. a grade report contains the students name, E. No. course number and section, letter grade (a, B, C, D, E). Note: If the above user requirements leave out any important detail, assume that it is handled the way XYZ does things in the real world. Answer the following questions based on the above requirements and specifications: Draw an E-R diagram of the above. List all the accompanying attributes / domains (including constraints)

Convert your E-R diagram to a relational schema: Use naming as specified in the E-R diagram Use the format as shown below, including : o Table name in caps o List of attributes with primary key underlined o Foreign key specified with table/attribute it references (with... cascade, it appropriate) Design a database in oracle /SQL Server with all the constraints applied. Provide for necessary views for the users so that they dont need to write complex queries again and again to retrieve the data. 3. Create an E R diagram and relational schema to hold information about the following situation in the University: Many teachers of different disciplines are teaching and many students enrolled in many courses offered by the University to the students through departments. One of the teacher is also head of the department. Use concept of keys, aggregation, generalisation, cardinality etc. in proper way. Say the schema of respective entities is Teacher( T#, Tname, Tqual, Tsubject, Tcourse, Programme, Dept) Student(Roll#., Sname, Sage, Saddress, Scourse, Programme, Smarks) Teaches(T#, Roll# , Scourse, Programme, University) Performa following queries in SQL using the given schema: Find if the above design provides sufficient details about the system described. If some information is missing then point it out and place in the appropriate relation. Find, in which normal form the above relations are? Is that normal form appropriate? If not, then normalize/de-normalize the design as per your assumptions. Input sample data for some students, departments, teachers, and courses using SQL scripts. Find details of Teachers who taught DBMS Find details of students who did opted for RDBMS course in any programme. Find details of students who did opted for RDBMS course in only BE(CSE) and BE(IT) programmes.
Find courses taught by T# 5078 Find addresses of students whose marks are less than 50.

4. in the assignment number 3, alter the table structures to apply the following: The marks data has to be put in a separate table called examination with fields exam title, exam#, programme, roll# and maximum, minimum pass and obtained marks of students. Add a field to the students table to have a field aggregate percentage. Make a trigger to update the value of this field whenever an entry is done to the examinations table for a student. 5. Consider a hospital where the doctors treat patients in a single ward. Usually each patient will be assigned a single doctor, but in rare cases they will have two. Healthcare assistants also attend to the patients; a number of these are associated with each ward. initially the system will be concerned solely with drug treatment. Each patient is required to take a variety of drugs a certain number of times per day and for varying lengths of time. The system must record details concerning patient treatment and staff payment. Some staff is paid part time and doctors and care assistants work varying amounts of overtime at varying rates (subject to grade). The system will also need to track what treatments are required for which patients and when and it should be capable of calculating the cost of treatment per week for each patient (though it is currently unclear to what use this information will be put). Now perform following tasks: Transform the Diagram created by you in to respective relations for patients, doctors, other staff, admission and discharge registers, consultation time allotted to a patient by a doctor, medicare time provided to patient by the staff, bed charges, billing, etc. Create functional dependency set by considering the attributes used in ER Diagram. Analyze the relation and functional dependency set generated by you and suggest which normal form they support. Say the relations developed by you are not in 2NF then how will you do bring them in 2NF. Suggest any technique to achieve 2NF. How will you check that the relation status after normalisation is Loss less and Dependency preserving. Enter sample data using a SQL script for various tables and perform following operations: Make a view that takes a patients unique registration number as input and finds the total number of days he was admitted to care of hospital. Define a function that computes a patients total bill amount as calculated: daily rent of bed + 120% of doctors variable rate as consultation fee + 110% of other staffs variable rate as medicare charges + 20% of intermediate cost as administrative charges. Define a view that will display the final bill of the patient.
Syllabus (B. Tech. Computer Science) 6 CS 9: JAVA APPLICATION LAB

1. Creating a tabbed pane for displaying information in logical units. Make a university system that has students, faculty members, departments and courses as entities. Allow the user to input different information on different panes. 2. Reading and writing objects to files and network streams. Allow the user to read and write objects to a file, through a menu-based GUI application. 3. Define a generic class and its generic methods to sort and search for any object (of any type) given its key. Use this class to sort and search various objects of type Students, faculty, etc. generated in above assignment. 4. Using the built-in collections classes make a dictionary that uses a GUI to provide various capabilities to the user like searching the meaning of a term; categorizing the terms into abbreviations, acronyms, etc.; adding new words to the dictionary, and so on. The contents of the dictionary are stored on a disk file in non-human readable format. 5. Extend the assignment 4 to provide multiple users to simultaneously open a shared dictionary over network connections and perform various operations concurrently. 6. Modify the assignment 1 to use database in place of flat files to manage the data on a University system. Prepare a proper ER diagram and database design, to make a good database design. 7. Analyze the Meta data of the sample oracle database of an organization to find out various attributes of the database objects and the user. 8. Make a database application to store information on customers and inventories of retails store and provide views, stored procedures and triggers to access the data and modify it. Make use these views, procedures, and triggers in your Java application. 9. Define a java bean to display a wall clock. 10. Define a java bean that emulates the behaviour of the message dialog boxes of the JOptionPane class. 11. Using the database created for assignment 8, make a JSP web application to display the data and modify it. 12. Using the database created for assignment 8, make a Servlets based web application to display the data and modify it.
Syllabus (B. Tech. Computer Science) 7 CS 1: DESIGN AND ANALYSIS OF ALGORITHM

3L+1T
UNIT-I Background: Review of Algorithm, Analysis of Algorithms, Growth of Functions, Master's Theorem, Designing of Algorithms. Sorting and Order Statistics: Heap sort, Quick sort, Sorting in Linear time, Medians and Order Statistics. UNIT-II Advanced Data Structure: Red-Black Trees, Augmenting Data Structure. B-Trees, Binomial Heaps, Fibonacci Heaps, Data Structure for Disjoint Sets. UNIT-III Advanced Design and Analysis Techniques: Dynamic Programming, Greedy Algorithms, Amortized Analysis, Back Tracking. UNIT-IV Graph Algorithms: Elementary Graphs Algorithms, Minimum Spanning Trees, Single-source Shortest Paths, All-Pairs Shortest Paths, Maximum Flow, Traveling Salesman Problem. UNIT-V Selected Topics: Randomized Algorithms, String Matching, NP Completeness, Approximation Algorithms. Books Recommended: 1. Design and Analysis of Algorithms: Aho A. V., J. E. Hopcroft, J. D. Ullman; Pearson Education. 2. Introduction to Algorithms: Rivest and Comer; Prentice Hall of India. 3. Computer Algorithms: Baase; Pearson Education. 4. Algorithmic: Brassard; Prentice Hall. 5. Linear Programming & Network Flows: Bazaraa; John Wiley & Sons. 6. Fundamental of Computer Algorithm, Horowitz & Sahani, Galgotia.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 7 CS 2: IMAGE PROCESSING AND PATTERN RECOGNITION
3L
UNIT-I Introduction: Imaging in ultraviolet and visible band. Fundamental steps in image processing, Components in image processing. UNIT-II Digital Image Fundaments: Image perception in eye, Light and electromagnetic spectrum, Image sensing and acquisition using sensor array. Image sampling and quantizationRepresenting digital images, Spatial and gray-level resolution, Aliasing and Moire patterns, Zooming and Shrinking digital images. Relationship between pixels. UNIT-III Image Enhancement in Spatial Domain: Gray-level transformation-image negatives, log transformation, power-low transformation, Histogram equalization and matching. Smoothing spatial and sharpening filters. UNIT-IV Image Restoration: Image restoration model, Noise Models-Spatial and frequency properties of noise, noise probability density functions. Noise-only spatial filter-Mean filter, orderstatistics filter and adaptive filters. Frequency domain filters-Band reject filters, Band pass filters and Notch filters. UNIT-V Image Compression: Compression Fundamentals-Coding Redundancy, inter pixel
MM: 100
Exam: 3 Hrs.
redundancy, Psycho visual redundancy and Fidelity criteria. Image Compression modeledSource encoder and decoder, Channel encoder and decoder, Lossy compression and compression standards. Books Recommended: 1. Digital Image Processing, Refael C.Gonzalez - Pearson Education Asia. 2. Digital Image Processing, Kenneth R. Castleman - Pearson Education Asia. 3. Digital Image Processing, Nick Effard - Pearson Education Asia. 4. Digital Image Processing, Jain 0 - PHI.
Syllabus (B. Tech. Computer Science) 7 CS 3: CLIENT SERVER ARCHITECTURE

3L
UNIT-I Client/Server Computing: Evolution of Client / Server concept, Definition, History, Need and motivation for Client/Server approach, Client/ Server environments, characterization of Client / Server computing, C/S Types and Examples, Functions of clients and functions of servers. Architecture: Components of client-server architecture, application partitioning, the two-layer and three-layer architectures, Communication between clients and servers, use of APIs in client/server computing, middleware technology in client/ server computing, NOS and its services. UNIT-II Client-Server Applications Development: Client application development environments, Development tools, Developing Applications on RDBMS, GUI design concepts, evaluation of database servers. UNIT-III Webservers: Components, URL, HTML, HTTP, Web-based Forms, tables, CGI-Sever side of the web, web security and S-HTTP, Firewalls, web client and JAVA, VB clients. Distributed Databases: Developing client applications of real-life on RDBMS like, ingress, oracle or Sybase Using the client application developer tools like Power builder, Delphi or Developer 2000. UNIT-IV Transaction Servers: Transaction Processing (TP) Monitors, Groupware for collaborative human activities (components, work flows, Scheduling), object brokers (components). Distributed and remote Object: ORB architecture, distributable components, RMI, Remote RPC, CORBA, COM/DCOM, Object transportation. UNIT-V Emerging Computing Trends: Client-server databases, GUI based client applications, Managing client-server applications, active databases, Multi-media databases, Deductive databases concepts of next generation databases and Data warehouses.
MM: 100
Exam: 3 Hrs.

Books Recommended: 1. Client/server Survival Guide; Robert orfali, Dan Harkey, Jeri Edwards; John Wiley & Sons 2. Enterprise System Architecture: Building Client/Server and Web-based Systems; Mark Goodyear, Hugh W. Ryan, et al; CRC Press 3. Client/server Architecture; Alex Berson; McGraw Hill 4. Distributed Databases, Cooperative Processing, and Networking; Shaku Atre; McGraw Hill 5. Introduction to Client/server Systems: a Practical Guide for Systems; Paul E. Renaud; Wiley 6. Beyond LANs: Client/server Computing; Dimitris N. Chorafas; McGraw Hill 7. Designing Enterprise Client/Server Systems; Beth Gold Bernstein and David Marca; PHI 8. Client Server Architecture; Benson; McGraw Hill
Syllabus (B. Tech. Computer Science) 7 CS 4: PROGRAMMING WITH VB.Net and ASP.Net
UNIT-I
The .Net Framework: Introduction, why use .Net. Introduction to ASP.Net: Why use ASP.Net, differences between ASP 3.0 and ASP.Net. Formatting instructions, jumping in and out of ASP.net
UNIT-II
Introduction to VB.Net: variables, data types, type conversions, constants, expressions, Strings, operators, control flow statements loops and decision making, arrays, subroutines, functions.
UNIT-III
ASP.Net Object Model: The document object model (DOM), how DOM of ASP and ASP.Net are different, how DOM of HTML and ASP.Net are different, the ASP.Net DOM, ASP.Net objects Request, Response, Randomize, Browser, ArrayList, HashTable, Page, etc.
UNIT-IV
User interface: Web server controls, Managing form controls properties from server, using web server controls textbox, textfield, check box, button, checkbox list, radiobuttons, radiobutton lists, combo box, drop down lists, calendar, adrotator. Data input validation using new validator controls. User interaction: Handling simple form data, handling long strings, handling hyperlinks, handling file uploads, cookies.
UNIT-V
Database Connectivity: Introduction to ADO.Net, importing, using ADO.Net objects connection command dataadaptor, dataset. Using datagrid control, using data manipulation techniques, accessing the meta data and issuing DCL commands to db-server. Making web applications that modify databases.

Books Recommended: 1. Essential ASP.NET Fast: With Examples in VB.NET; Simon Stobart; Springer 2. ASP.Net and VB.NET Web Programming; Matt J. Crouch; Addison-Wesley 3. Beginning Object-oriented Asp.net 2.0 with VB.NET: From Novice to Professional; Brian R. Myers; Apress 4. Beginning ASP.NET 1.1 with VB.NET 2003; Chris Ullman, John Kauffman, Chris Hart; John Wiley
Syllabus (B. Tech. Computer Science) 7 CS 5.1: REAL TIME SYSTEMS

3L
UNIT-I Introduction to Real-Time Applications Digital Control: Sample data systems, complex control - law computations, High level control - control hierarchy, guidance and control, real time command and control, Signal processing - Processing Bandwidth demands, Radar System Real time data bases and Multimedia application. UNIT-II Hard Versus Soft Real Time Systems: Jobs and processors. Release times, deadlines and timing constraints, Hard and soft timing constraints - Hard timings constraints and temporal Quality-of-Service guarantees. Hard real-time systems - reasons for timing guarantee requirement and examples of hard timing constraints, soft real-time systems. UNIT-III Reference Model of Real-Time Systems: Processors and Resources, Temporal parameters of real-time workload-fixed, jittered, sporadic release times and execution time, Periodic task Model - Periods, Execution Times and Phases of Periodic Tasks, Aperiodic and Sporadic Tasks, Precedence graph and Data Dependency, Temporal Dependency, AND/OR precedence constraints, Conditional Branches and Pipeline Relationship , UNIT-IV Functional Parameters: Pre-emptivity and criticality of jobs, optional execution, laxity type and laxity function, Resource parameters of jobs and parameters of resources- pre-emptivity of resources and resource graph. Scheduling hierarchy - Scheduler and schedules: Feasibility optimality and performance measures, interaction among schedulers. UNIT-V Commonly Used Approaches to Real-Time Scheduling: Clock Driven approach, Weighted round - robin approach, priority driven approach, Dynamic versus static systems. Effective release time and deadline. Optimality of EDF and LST algorithms. Non optimality of EDF and LST algorithms. Challenges in validating timing constraints and their performance. off line versus on-line scheduling. Books Recommended: 1. Real Time Systems: W. S. Liu; Pearson Education Asia.
MM: 100
Exam: 3 Hrs.
2. Introduction to Real Time Systems: Raymond a. Buhr; Pearson Education Asia. 3. Real Time Systems and Programming Languages: Alan Burns; Pearson Education. Jaipur National University, Jaipur - 74/90
Syllabus (B. Tech. Computer Science) 7 CS 5.2: MULTIMEDIA SYSTEMS

3L
UNIT-I Media and Data Streams: Medium, Properties of Multimedia, Data stream characteristics of continuous media, information units. UNIT-II Music and Graphics: Audio formats, MIDI, Speech, and Image formats, Graphics formats, Computer Image Processing. UNIT-III Video and Animation: Basic concepts, Computer-based Animation, JPEG, MPEG, H 261, DVI, CD - ROM Technology, Compact disk digital audio. UNIT-IV Multimedia Operating Systems: Real time, Process management, Rate monotonic algorithm, earliest deadline first algorithm and Multimedia file systems. Documents: Hypertext, Hypermedia, MHEG. UNIT-V Synchronization: intra and inter object synchronization, Live and Synthetic synchronization, Lip synchronization requirements, pointer synchronization requirements, Elementary media synchronization.
MM: 100
Exam: 3 Hrs.
Books Recommended: 1. Multimedia - computing, Communication & Applications: Ralf Steinmetz & Klara Nahrstedt; Pearson Education Asia. 2. Multimedia System Design: Prabhat K.andleigh, Kiran Thaukrar; Prentice Hall
Syllabus (B. Tech. Computer Science) 7 CS 5.3: VLSI TOOLS AND TECHNIQUES
3L
UNIT-I Introduction: Why design ICs? Technology and Economics for IC manufacturing. COMOS technology - circuit techniques, Power consumption, Design and testability. IC Design Techniques - Hierarchical design, Data abstraction and computer aided design. UNIT-II Transistors and Layout: Fabrication process overview and Fabrication steps. Transistors Structure, Model and Parasitic, Tub Ties and latch up, Advanced Transistor characteristics, leakage and sub threshold current, advanced transistor structure and spice models. Wires and Vias - Wire parasitic and skin effect in copper interconnect. Design Rules-Fabrication Errors, Scalable design rules, SCMOS design rules and typical process parameters. Layout Design and Tools - Layout for Circuits, Stick Diagrams, Hierarchical Stick Diagrams, Layout Design and Analysis Tools and Automated Layout. UNIT-III Sequential Machines: Latches and Flip Flops - Categories of memory elements, Sequential Systems and clocking disciplines - One phase systems for Flip-Flops, Two-phase systems for Latches, Advanced clocking analysis and clock generation. Sequential system Design structural specification, State Transition Graph, Tables and State assignment. Power optimization. Design validation and sequential testing. UNIT-IV Subsystem Design: Subsystem Design Principles - Pipelining and Data paths. Combinational shifter, Adders ALUs and Multipliers. High Density Memory-ROM, Static RAM, Three Transistor DRAM and one transistor DRAM. UNIT-V Chip Design: Design Methodologies, Kitchen Timer chip - Timer specification and Architecture, Architecture Design, Logic design, layout design and Design Validation.
MM: 100
Exam: 3 Hrs.
Books Recommended: 1. Modern VLSI Design 3rd Ed.: Wayne Wolf; Pearson Education Asia. 2. CMOS/Bi-CCMOS VLSI: Kiat-Sent Yeo; Pearson Education Asia. 3. Principles of CMOS VLSI Design: Neil H.E. Weste; Pearson Education Asia.
Syllabus (B. Tech. Computer Science) 7 CS 5.4: OPEN SOURCE SYSTEMS

3L
UNIT-I Introduction: Open Source, Free Software, Free Software vs. Open Source software, Public Domain Software, FOSS does not mean any cost. History: BSD, the Free Software Foundation and the GNU Project, Open Source History, initiatives, Principle and Methodologies. UNIT-II Philosophy: Software Freedom, Open Source Development Model Licenses and Patents: What Is License? Important FOSS Licenses (Apache, BSD, GPL, LGPL), copyrights and copy thefts, Patents Economics of FOSS: Zero Marginal Cost, Income-Generation Opportunities, Problems with traditional commercial software, Internationalization UNIT-III Case Studies: Apache, BSD, Linux, Mozilla (Firefox), Wikipedia, Joomla, GCC, Open office. UNIT-IV Starting and Maintaining an Open Source Project, Open Source Hardware, Open Source Design, Open source Teaching. Open source media. UNIT-V Open source vs. closed source Open source government, Open source ethics. Social and Financial impacts of open source technology, Shared software, Shared source
MM: 100
Exam: 3 Hrs.
Books Recommended: 1. Complete Reference: LINUX: Richard Petersen; Tata McGraw Hill 2. Linux Bible 2007 Edition: Christopher Negus; John Wiley & Sons 3. Unix Shell Programming: Yashawant Kanetkar; BPB
Syllabus (B. Tech. Computer Science) 7 CS 7: WEB BASED APPLICATION LAB.

The web-application will make use of the JDBC, JSP, Servlets, EJB, Struts, and XML and back-end packages like RDBMS or file system. The applications need to be deployed on a Web-server preferably an Apache Tomcat or Weblogic.
1. Design a guestbook web-application that asks the user to enter into the guest book for his comments and takes information as his name, email address, comment, and any other thing you deem fit. Ask the user to rate the website on a score of 1 to 10 on various aspects of the website like content, presentation, navigation, style, etc. Store this rating and sow a collective average rating to each user who visits the site. The home page should display the number of visitors and number of registered guests.
2. Make a product catalogue with the following features: There should be a control panel to perform the following activities by the owner of the company: Add/update new items with a description, small photograph (thumbnail view) an a large photograph (full view); The description will include item code, name, price, delivery period required, and other relevant details; Delete any existing products on display; Provide for announcement of any special offers; Change the placement of the items on display; View the list of registered users. The view of the site will display a home page with areas for user login and a display of a few items in bigger image. It will also have a search box that will allow searching an item. The inner pages must display only 6 items per page and there should be dynamic links for the next and previous pages. Any newly added items shall come in the first pages. When the user will click a thumbnail image a pop-up window shall display the full view of the item clicked.

There will be a registration form for visitors to capture their personal information, address and a query about our products. Use scripting to check if the data entered is valid, legal and complete so that no runtime errors are encountered in processing them at server side.
3. Modify the above shopping cart to include product categories and sub-categories. The system also has related categories and related items. These categories allow for efficient search and better targeting of the customer. The related items shall get listed below the main item in its full view. Allow the owner of the company to take backup of the data in independent format, i. e., XML and provide facility to add records form XML.
4. Make distributable components that can be downloaded by clients as java plug-ins. These plug-ins will always connect to your music store and will display the latest offerings you have to make to your clients. The user can now choose the particular file or music album and will be played a demo for only limited period (say 30 to 45 seconds). This period must be updatable by the webmaster and is passed as a parameter along with the file name. for improving the efficiency you can make a temporary cache of the clips on the local system of the user that are deleted once the session expires.
5. Make a web based result system that can display result of a candidate in various formats. Make use of the popular site www.indiaresults.com as the reference and suggest any improvements in its design while incorporating the same in your own system.
Syllabus (B. Tech. Computer Science) 7 CS 8: VB.NET/ASP.NET APPLICATION DEVELOPMENT LAB

1) Make a simple web page that has a web form for input of user\s name and password. Using ASP.Net, at server, access the pages data for printing it to another web page. 2) Using VB.Net, make a simple application to read and write a students data personal, academic and other to a disk file. Give the user a menu driven application to access the various options like adding/updating/removing student records, copying the data file, appending two data files. 3) Using the Randomize and HashTable objects of ASP.Net, generate random numeric values within a range and store them in a HashTable. Use these values to randomly display different images on the web page of the user. 4) Make a tidy and attractive user interface for a colleges internal website. The website has various options to display results, search its contents, user login, administrator and faculty login, guest pages, etc. The website has sections for its courses, placement and training cell, research activities, cultural activities, examinations, etc. with static contents. 5) Extend the website made in previous assignment to make it use ful for showing dynamic contents for all sections. 6) Allow the faculty members and students of your college to exchange assignments, their submission and class notes through the login section of your colleges website. Each user must be able to view only his data and faculty must be able to choose from a list of students to whom the assignments/notes are to be sent.
Syllabus (B. Tech. Computer Science) 8 CS 1: COMPILER CONSTRUCTION

3L+1T
UNIT-I Introduction: Compilation process and Analysis of the source program, Phases of a compiler, Syntax Definition and Syntax-directed translation. Parsing and Translation of Simple Expression. UNIT-II Lexical Analysis and Parsing: Role of lexical analyzer, input buffering, Specification and recognition of tokens. The Parser function, Context-Free Grammar. Writing a Grammar and Top-Down Parsing. UNIT-III Syntax-Directed Translation and Type Checking: Syntax-directed definition and construction of syntax trees. Bottom-up evaluation of S-attributed and L-attributed definitions and Top-down translation. Type systems and specification of type checker. UNIT-IV Run Time Environment: Source Language Issues, Storage organization and Allocation strategies. Symbol tables. UNIT-V Code Generation and Optimization: Intermediate language. Declaration and assignment statements. Issue in the design of a code generator. The target machine. Run-time storage management, Basic blocks and flow graphs. Principal source of code optimization.
MM: 100
Exam: 3 Hrs.
Books Recommended: 1. Compilers: Principles, Techniques and Tools- A.V. Aho, Pearson Education Asia. 2. N.Wirth-Compiler Construction,Pearson Education Asia. 3. Charles N.Fischer-Crafting a Computer in C, Pearson Education Asia.
Syllabus (B. Tech. Computer Science) 8 CS 2: DISTRIBUTED SYSTEMS

3L+1T
UNIT-I Characterization of Distributed Systems: Introduction and examples of distributed systemsinternet, internet, mobile, Ubiquitous computing; Resource sharing and world wide web challenges-Heterogeneity, Openness, Security, Scalability failure handling, Concurrency and transparency. UNIT-II System Models: Introduction to Architecture models Software layers, System architecture, variations on client-server model, Interfaces and objects, Design Requirement for distributed architectures. Fundamental models-interaction models, Failure model and Security model. UNIT-III Distributed Object and Remote invocation: Introduction to remote method invocation (RMI) and interfaces in distributed systems. Communication between distributed objects object model, Distributed objects, Distributed objects model and Design issues for RMI, implementation of RMI and distributed garbage collection, Remote procedures call and sun RPC case study. Events and notifications-participants in event notification and JINI distributed event specification. Java RMI case study building client and server programs. Design and Implementation of Java RMI. UNIT-IV Time and Global States: Introduction to clocks, Events and process states. Synchronizing Physical clocks-synchronizing in a synchronous system, Christians method for synchronizing clocks, Berkeley algorithm and Network time protocol. Global states and consistent cuts. UNIT-V Distributed-Shared Memory: Introduction to distributed-shared Memory (DSM)-message passing versus DSM, Implementation approaches to DSM. Design and implementation issuesstructure and synchronization model. Books Recommended: 1. Distributed Systems-Concepts and Design 3rd Ed: George Coulouris; Pearson Education Asia. 2. Distributed Systems Principles and Paradigms: A.S. Tanenbaum; Prentice Hall of india. 3. Developing Distributed and E-Commerce Applications: Darrel ince; Addition Wesley.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 8 CS 3: DATA MINING AND WAREHOUSING

3L+1T MM: 100 Exam: 3 Hrs.
UNIT-I Introduction: Concept of Data Mining and Warehousing, Web Warehousing Future Systems Profiles, Web Warehousing for Business Application and Consumers. Introduction to Knowledge Management, Databases. Data Warehouses and Knowledge Bases. Traditional Warehousing: Theory of Data Warehousing, Barriers to Successful Data Warehousing. Really Bad Data Warehousing Approaches. Data Warehouse (Mart) Functional Model, layers of Warehouse Environment. UNIT-II Web-Based Query and Reporting: Delivering information over the Web. Query and Reporting Tools and Business Value. Architectural Approaches to Delivering Query Capabilities over the Web. Case study approach. Due diligence in the development of solutions. UNIT-III Web Based Statistical Analysis and Data Mining: Analytical Tools, Business value from Analytical Tools, Example of Analytical Tools in Action-Humble spread sheet. Determining the Business value that Analytical Tools will deliver. Statistical Products overview-Statistical Analysis Applications-Correlation Analysis. Factor Analysis, Regression Analysis. Data Discovery Tools Overview, Data Discovery Application. Comparison of the Products Architectural Approaches for Statistical and Data Discovery Tools intelligent Miner for Relationship Marketing Product. UNIT-IV Search Engines and Facilities: Search Engines and the Web. Search Engine Architecture, Variations in the way that Search Facilities Work, Variations in indexing Schemes Example Excalibur Retrieval ware product (Product organization, Search Templates. Query Building Approach), Search Approach index Building and Synchronization. UNIT-V Web Components and Communications: Introduction to web architecture HTML as the Universal Document Display language. Hypertext Paradigm, using HTML to Point to Text and Non-Text Objects (Picture, Sound), MIME Format Stateless Web Communication, Browser Server Communication Methods (GET, PUT, POST, HEAD, DELETE Methods). Books Recommended: 1. Rob Mattison-Web Warehousing and Knowledge Management, Tata Mc-Graw Hill. 2. Shelley Powers-Dynamic Web Publishing, Techmedia. 3. Anahory-Data Warehousing in the Real World, Pearson Education Asia.
Syllabus (B. Tech. Computer Science) 8 CS 4.1: CYBER LAW AND IPR
3L
UNIT-I Introduction: Legal issues, challenges and opportunities emerging with use of the internet and E-commerce. privileged information, ways to protect privacy, basic intellectual property issues (copyright, trademark, trade name, domain name, and patent law), legal jurisdiction related to cyber commerce, government regulation in cyberspace, sales tax issues, measures that individuals and companies can use to regulate email and internet access in the workplace, legal enforceability of contractual obligations, statutory individual rights, implication of employment law in the electronic workplace, criminal liability and ethical implications throughout. UNIT-II Basic Concepts of intellectual Property: Introduction to intellectual property rights, intellectual property laws and the internet, Trade Related Aspects of intellectual Property Rights. Patents: Introduction to patent law and conditions for patentability, Procedure for obtaining patents, Rights of a patentee, Patent infringements, Biotechnology patents and patents on computer programs, Patents from an international perspective. UNIT-III Trademark and Geographical indications: Statutory authorities and registration procedure, Rights conferred by registration, Licensing, assignment and transfer of trademark rights, Trademark infringement, Geographical indication of Goods & Appellations of origin. UNIT-IV Copyright: Registration procedure and copyright authorities, Assignment and transfer of copyright, copyright infringement and exceptions to infringement, Software copyright. UNIT-V Designs: Introduction to the law on industrial Designs, Registration and piracy, international perspective, Introduction to the law on semiconductor layout design, Registration, commercial exploitation and infringement.
MM: 100
Exam: 3 Hrs.

Books Recommended: 1. Cyber Laws Demystified: Naavi 2. THE INFORMATION TECHNOLOGY ACT, 2000 (No. 21 of 2000) [9th June, 2000] 3. Intellectual Property Right under WTO tasks before india: Ramappa, T.; Wheeler Publishing 4. Intellectual property-Patents, Copyright, Trade marks and Allied rights 3rd Ed.: Cornish, W.R.; Universal Law Publishing.
Syllabus (B. Tech. Computer Science) 8 CS 4.2: ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS
3L
UNIT-I Introduction: Problem definition, Space search, Production systems, Control strategies, Search techniques, Production system Characteristics, Heuristic search techniques. UNIT-II Representation: Knowledge representation and mapping, Predicate logic resolution, propositional logic, Procedural and declarative knowledge, Forward and backward reasoning, symbolic reasoning. UNIT-III Application: Game playing, Mini-Max search, alpha-beta cutoffs, Iterative deepening, Planning system components, Non-linear and hierarchical planning, Reactive systems. UNIT-IV Language Processing: Natural language processing, syntactic processing and semantic analysis. Problem Solving: Learning in problem solving, Learning from example, Formal learning theory, Explanation based learning. UNIT-V Expert systems: Structure, Development tools, Uncertainty considerations, Domain
MM: 100
Exam: 3 Hrs.
exploration, Meta knowledge, Expertise transfer, Existing systems ( DENDRAL, MYCIN ), Self explaining systems.
Books Recommended: 1. Artificial intelligence: E. Rich, K Knight; Tata McGraw Hills. 2. Artificial intelligence-a Modern Approach: S. Russell, P. Norving; Pearson Education, Asia. 3. Artificial intelligence-Theory & Practice: Thomas Dean; Pearson Education, Asia. 4. The Essence of Artificial intelligence: Alison Caursey; Pearson Education, Asia. 5. Expert Systems: Peter Jackson; Pearson Education Asia.
Syllabus (B. Tech. Computer Science) 8 CS 4.3: MOBILE COMPUTING

3L
UNIT-I Introduction: Introduction to mobile computing: principles, classification & overview of devices, operating systems, Cellular Telephony, Personal Communication System/Networks. UNIT-II Challenges: The Challenge of Mobile Computing (BPR in Mobile Computing), Wireless transmission: brief overview, Multipath propagation, Hidden & exposed terminals. UNIT-III Medium access control & protocols: SDMA, FDMA, TDMA, DAMA, FAMA, PRMA, Reservation TDMA, polling, CSMA/CA, CDMA etc. UNIT-IV Architecture: Wireless Architecture for mobile computing, Wireless LANs, End User Devices, MAC protocols, IEEE 802.11, Wireless Hand off, HIPERLAN, Ad-Hoc Networks: Unicast and Multicast Communication. UNIT-V Mobile network layer: Mobile IP, DHCP, infrastructure & Ad-hoc routing. Mobile transport layer: indirect TCP, snooping TCP, mobile TCP etc. mobile support, WWW & mobility, WAP.
MM: 100
Exam: 3 Hrs.
Books Recommended: 1. Principles of mobile computing Hansmann & Merk., Springer 2. Mobile communications Jochen Schiller , Pearson3. 802.11 wireless networks Matthew S.Gast, OREILLY. 3. Wireless LANs: Davis & McGuffin, McGraw Hill 4. Mobile Communications Handbook by Jerry D. Gybson 5. Mobile Communications Handbook by Raymond Steel 6. Chander Dhawan, Mobile Computing- a System integrators Approach, McGraw-Hill
7.
Wireless Computing Primer by Veronica Williams, M&T Books
Syllabus (B. Tech. Computer Science) 8 CS 4.4: INFORMATION SECURITY AND CRYPTOGRAPHY
3L
UNIT-I Introduction: Need of security, attributes of security, authentication, access control, confidentiality, authorization, integrity, non-reproduction and cryptography, Vulnerabilities in OSI model, layers, Types of attacks, DOS, IP spoofing, man-in-the-middle, attack, replay, DNS poisoning, information security lifecycle, multilevel model of security, Worms, viruses, Trojans, one time passwords, single sign on, use of Bioinformatics in security. UNIT-II Public Key Cryptography: Principles, RSA, ECC, DSA, key management, Kerberos, Elliptical curve Cryptography, X.509, Diffie-Hellman, key exchange, attacks, message authentication and hash functions, Hash algorithms, digital signatures. UNIT-III Secret Key Cryptography: DES, triple DES, AES, IDEA, key distribution, attacks. Virtual Private Network: Need, types of VPN, VPN supported systems, tunneling and tunneling protocols, PPTP, L2TP, 1PSEC protocol suite, IKE, ESP, AH. UNIT-IV Network Periphery Security: Router and security, firewalls, packet filters, DMZ, application level gateways, IPS, types, OS hardening, VLAN, wireless LAN, WEP, Honey pot. UNIT-V Web and Email Security: Security services, web security considerations, SSL and TLS, SET, PEM and S/!'v1IME, PGP smart cards, application security using smart cards, Kerberos, electronic commerce attacks, micro payments, un smart cards, E-cache. Books Recommended: 1. William Stallings "Cryptography and network security, principles and practices", Pearson 2. Charlie Kaufman, Radia Perlman and mike speciner "Network security, private communication in a public world" 3. Christopher M. King, Curtis patton and RSA press "Security architecture, design deployment and operations" 4. Stephen northcatt, leny zeltser, et al "INSIDE NETWORK Perimeter Security" Pearson Education Asia 5. Robert Bragge, Mark Rhodes, Heith straggberg "Network Security. the complete reference", Tata McGraw Hill Publication
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 8 CS 6: X-WINDOWS PROGRAMMING LAB.

6P
line argument.
MM: 150
Exam: 4 Hrs.
1. To understand x-windows, x-lib, x-toolkit and x network protocol and learn its commend
Programs in C/C++ language.
2. Write a program to establish connection with x server and get the sender and protocol information. 3. Using X library of the server, write a program to create a new window for the following given fields: 1. Size 2. Title 3. Border 4. Foreground color 5. Background colors. 4. To implement keyboard event handling/marking using x library. 5. To implement mouse event handling/marking using x library and interface with windows managers and drawing applications. 6. To implement a multiple windows application. 7. To implement various drag and drop based GUI components in Visual Basic. 8. To implement various drag and drop based GUI components in Motif and Lesstif.
Syllabus (B. Tech. Computer Science) 8 CS 7: COMPILER CONSTRUCTION LAB.

4P
Program Writing in C/C++ 1,2. Write a program to identify data storage statements in an 8086 assembly language program and estimate the size of data segment. 3. Write a program to identify macro definitions in an assembly language program. 4,5. Extend the above program to implement simple and recursive macro expansion. 6. Write a program to process 'include' and 'define' macros in C language. 7,8. Write a program to parse source code strings of C-language and identify tokens in terms of keywords and identifiers. 9. Construct parse tree of arithmetic statements in C language program.
MM: 100
Exam: 3 Hrs.
10. Write a program to optimize the source program for 'operator strength reduction', 'dead code elimination' and frequency reduction' transformation. 11,12. Design a simple high level language containing arithmetic and logic operations pointers, branch and loop instructions. Write its lexical analyser using lex.

B Tech - CS-Sylb

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

B Tech - CS-Sylb

Uploaded by

Copyright:

Available Formats

Syllabus (B. Tech.

Computer Science) 3 CS 1: MATHEMATICS III

Jaipur National University, Jaipur - 1/90

Jaipur National University, Jaipur - 2/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 3/90

Syllabus (B. Tech. Computer Science) 3 CS 3: DISCRETE MATHEMATICAL STRUCTURE

Jaipur National University, Jaipur - 4/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 5/90

Syllabus (B. Tech. Computer Science) 3 CS 4: PRINCIPLES OF PROGRAMMING LANGUAGES

Jaipur National University, Jaipur - 6/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 7/90

Syllabus (B. Tech. Computer Science) 3 CS 5: ELECTRONICS DEVICES AND CIRCUIT

Jaipur National University, Jaipur - 8/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 9/90

Jaipur National University, Jaipur - 10/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 11/90

Syllabus (B. Tech. Computer Science) 3 CS 7 DATA STRUCTURE LAB

14.Symbol table organization (Hash Table).

Jaipur National University, Jaipur - 12/90

Jaipur National University, Jaipur - 13/90

Syllabus (B. Tech. Computer Science) 3 CS 9 -- DIGITAL ELECTRONICS LAB.

Jaipur National University, Jaipur - 14/90

Jaipur National University, Jaipur - 15/90

Jaipur National University, Jaipur - 16/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 17/90

Syllabus (B. Tech. Computer Science) 4 CS 2: SOFTWARE ENGINEERING

Jaipur National University, Jaipur - 18/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 19/90

Syllabus (B. Tech. Computer Science) 4 CS 3: MICROPROCESSOR AND INTERFACE (8085)

Jaipur National University, Jaipur - 20/90

Syllabus (B. Tech. Computer Science) 4 CS 4: DATABASE MANAGEMENT SYSTEM

Jaipur National University, Jaipur - 21/90

Syllabus (B. Tech. Computer Science) Unit-IV

Jaipur National University, Jaipur - 22/90

Syllabus (B. Tech. Computer Science) 4 CS 5: COMMUNICATION FUNDAMENTALS

Jaipur National University, Jaipur - 23/90

Syllabus (B. Tech. Computer Science) 4 CS 6: OPTIMIZATION TECHNIQUES

Jaipur National University, Jaipur - 24/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 25/90

Syllabus (B. Tech. Computer Science) 4 CS 7: OBJECT ORIENTED PROGRAMMING LAB

Jaipur National University, Jaipur - 26/90

Syllabus (B. Tech. Computer Science)

Jaipur National University, Jaipur - 27/90

Syllabus (B. Tech. Computer Science) 4 CS 8: SOFTWARE ENGINEERING LAB

1. Perform the following tasks for the following projects:

Jaipur National University, Jaipur - 28/90

Syllabus (B. Tech. Computer Science) 4 CS 9: DBMS (MySQL) LAB

Jaipur National University, Jaipur - 29/90

Jaipur National University, Jaipur - 30/90

Syllabus (B. Tech. Computer Science) 4CS10: SYSTEM DESIGN LAB

Jaipur National University, Jaipur - 31/90

Syllabus (B. Tech. Computer Science)

4CS10: DESIGN AND ANALYSIS OF ALGORITHMS LAB

Jaipur National University, Jaipur - 32/90