Beruflich Dokumente
Kultur Dokumente
MM: 100
Ex. Hrs. 3
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.
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
MM: 100
Ex. Hrs. 3
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.
MM: 100
Exam: 3 Hrs.
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.
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
Exam: 3 Hrs.
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.
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.
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
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.
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.
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
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.
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
MM: 100
Exam: 3 Hrs.
MM: 100
Exam: 3 Hrs.
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.
{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
MM: 75
Exam: 2Hrs.
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,
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.)
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
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.
MM: 100
Exam: 3 Hrs.
MM: 100
Exam: 3 Hrs.
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
MM: 100
Exam: 3 Hrs.
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
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.
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.
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.
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.
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.
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.
MM: 100
Exam: 3 Hrs.
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.
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
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
MM: 100
Exam: 3 Hrs.
MM: 100
Exam: 3 Hrs.
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.
MM: 100
Exam: 3 Hrs.
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.
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)
Find courses taught by T# 5078 Find addresses of students whose marks are less than 50.
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.
MM: 100
Exam: 3 Hrs.
Syllabus (B. Tech. Computer Science) 7 CS 4: PROGRAMMING WITH VB.Net and ASP.Net
3L MM: 100 Exam: 3 Hrs.
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.
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
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.
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
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.
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.
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.
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.
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.
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.
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.
MM: 150
Exam: 4 Hrs.
1. To understand x-windows, x-lib, x-toolkit and x network protocol and learn its commend
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.
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.