Rajasthan Technical University, Kota Detailed Syllabus for B.Tech.

(Information Technology) Session 2009-10 (Main Examination) Name of Subject : SYSTEM SOFTWARE ( 5 IT 1) Unit Contents I Overview: Comparison of machine language, assembly language and high level languages, External and internal representation of instructions and data. Data a llocation structures, search structures and addressing modes. Activities and system softwa re for program generation, translation and execution. Editors for source code and objec t code/executable code files. II Assemblers: Assembly language specification. Machine dependent and independent features of assembler. Classification of assemblers. Pass structure of assembler s (problem and associated for IBM-PC. III Loader and Linkers: Functions and classification. Machine dependent and independ ent features of loaders, Design of bootstrap, absolute and relocatable loaders, Desi gn of linker. Case study of MS-DOS linker. IV Macro processors: Macro definition, call and expansion. Macro processor algorith m and data structure. Machine independent features (parameters, unique labels, conditi onal expansion, nesting and recursion).Pass structure and design of microprocessor an d macro assembler, Case study of MASM macro processor. V High level language processor: HLL specification: Grammars and parse trees, expr ession and precedence. Lexical analysis: Classification of tokens, scanning methods, ch aracter recognition, lexical ambiguity. Syntactic analysis: Operator precedence parsing, recursive descent parsing. Symbol Table Management: Data structure for symbol table, basin g functions for symbols, overflow technique, block structure in symbol table.

Rajasthan Technical University, Kota Detailed Syllabus for B.Tech. (Information Technology) Session 2009-10 (Main Examination) Name of Subject: E-Commerce ( 5 IT 2) Unit Contents I Introduction: Motivation, Forces behind E-Commerce Industry Framework, Brief history of Ecommerce, Inter Organizational E-Commerce Intra Organizational ECommerce, and Consumer to Business Electronic Commerce, Architectural framework, Network Infrastructure for E-Commerce Network Infrastructure for ECommerce, Market forces behind I Way, Component of I way Access Equipment, Global Information Distribution Network, Broad band Telecommunication. II Mobile Commerce: Introduction to Mobile Commerce, Mobile Computing Application, Wireless Application Protocols, WAP Technology, Mobile Information Devices, Web Security, Introduction to Web security, Firewalls & Transaction Security, Client Server Network, Emerging Client Server Security Threats, firewalls & Network Security. III Encryption: World Wide Web & Security, Encryption, Transaction security, Secret Key Encryption, Public Key Encryption, Virtual Private Network (VPM), Implementation Management Issues. IV Electronic Payments: Overview of Electronics payments, Digital Token based Electronics payment System, Smart Cards, Credit Card I Debit Card based EPS, Emerging financial Instruments, Home Banking, Online Banking. V Net Commerce: EDA, EDI Application in Business, Legal requirement in E Commerce, Introduction to supply Chain Management, CRM, issues in Customer Relationship Management.

Rajasthan Technical University, Kota Detailed Syllabus for B.Tech. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : DATABASE MANAGEMENT SYSTEMS (5 IT 3) Unit Contents I INTRODUCTION TO DATABASE SYSTEMS: Overview and History of DBMS. File System v/s DBMS .Advantage of DBMS Describing and Storing Data in a DBMS. Queries in DBMS. Transaction management and Structure of a DBMS. II ENTITY RELATIONSHIP MODEL: Overview of Data Design Entities, Attributes and Entity Sets, Relationship and Relationship Sets. Features of the ER ModelKey Constraints, Participation Constraints, Weak Entities, Class Hierarchies, Aggregation, Conceptual Data Base, Design with ER Model-Entity vs Attribute, Entity vs Relationship Binary vs Ternary Relationship and Aggregation vs ternary Relationship Conceptual Design for a Large Enterprise. III RELATIONSHIP ALGEBRA AND CALCULUS: Relationship Algebra Selection and Projection, Set Operations, Renaming, Joints, Division, Relation Calculus, Expressive Power of Algebra and Calculus. IV SQL QUERIES PROGRAMMING AND TRIGGERS: The Forms of a Basic SQL Query, Union, Intersection and Except, Nested Queries ,Correlated Nested Queries, Set-Comparison Operations, Aggregate Operators, Null Values and Embedded SQL, Dynamic SQL, ODBC and JDBC, Triggers and Active Databases. V SCHEMA REFINEMENT AND NORMAL FORMS: Introductions to Schema Refinement, Functional Dependencies, Boyce-Codd Normal Forms, Third Normal Form, Normalization-Decomposition into BCNF Decomposition into 3-NF.

Rajasthan Technical University, Kota Detailed Syllabus for B.Tech. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : COMPUTER ARCHITECTURE ( 5 IT 4) Unit Contents I REGISTER TRANSFER LANGUAGE: Data movement around registers. Data movement from/to memory, arithmetic and logic micro operations. Concept of bus a nd timing in register transfer. II CPU ORGANISATION: Addressing Modes, Instruction Format. CPU organization with large registers, stacks and handling of interrupts & subroutines Instructio n pipelining III ARITHMETIC ALGORITHM: Array multiplier, Booth's algorithm. Addition subtraction for signed unsigned numbers and 2's complement numbers. IV MICROPROGRAMMED CONTROL UNIT : Basic organization of microprogrammed controller, Horizontal & Vertical formats, Address sequencer V MEMORY ORGANISATION: Concept of RAM/ROM, basic cell of RAM, Associative memory, Cache memory organization, Vertical memory organization. I/O ORGANISATION: Introduction to Peripherals & their interfacing. Strobe based and handshake-based communication, DMA based data transfer, I/O processor.

Rajasthan Technical University, Kota Detailed Syllabus for B.Tech. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : Advanced Software Engineering (5 IT 5) Unit Contents I SOFTWARE CONFIGURATION MANAGEMENT: SCM Process, Objects in Software configuration, Version control, Change control, Configuration audit, St atus reporting, SCM standards .SOFTWARE QUALITY ASSURANCE: Quality Concepts, Quality Movement, SQA Activities and Formal Approaches to SQA. II SOFTWARE TESTING AND DEBUGGING: Software Testing Fundamentals .Text Case Design ,White -Box Testing, Basis Path testing, Control Structure Testing, Black Box Testing and Testing for Specialized Environments, Architectures and Applications. Program Error, Debugging Process (Information Gathering, Fault Isolation, Fault Confirmation, Documentation, Fixing fault, Testing) Debugging Example. III MANAGING TEAM: Understanding behavior and selecting right person for the job, Motivation, working in groups, decision making, leadership and organizational structures. INTERNATIONAL STANDARDS: Importance and defining software quality, ISO 9126, BS 6079 planning steps, ISO 12207 approach to software lifecycle data. IV WEB ENGINEERING: Attributes of Web-Based Applications. Process, Modeling activity, Analysis modeling for WebApps, Design-functional, information & interaction, testing WebApps-content, navigation, configuration, and performance testing. V PROJECT MANAGEMENT FOR SPECIAL CLASSES OF SOFTWARE PROJECTS: Using CASE tools, CBSE, Re-engineering, forward engineering, client/server software engineering, outsourcing, Software project management standards. Change and Content Management of Web Engineering.

zero-one principle. Amortization analysis and Potential Function of Fibonacci Heap Implementing Fibonacci Heap. 2-3 Trees and Red-Black Trees. Fundamental Circuits. Modular arithmetic. Kota Detailed Syllabus for B. Cut-Vertices Planer and Dual graphs. .1) Unit Contents I ADVANCED TREES: Definitions Operations on Weight Balanced Trees (Huffman Trees). Finding all Spanning Trees in a Weighted Graph and Planarity Testing.Rajasthan Technical University. Binomial Trees Implementing Binomial Heaps and its Operations. SORTING NETWORK: Comparison network. 2-3-4. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : ADVANCED DATA STRUCTURES (5 IT 6. Strongly Connected Components and Articulation Point. Chinese remainder theorem. Trees and 2-3-4 Heaps. II MERGEABLE HEAPS: Mergeable Heap Operations. Topological Sort. bitonic sorting and merging network sorter. FordFulkerson Max Flow Algorithms V NUMBER THEORITIC ALGORITHM: Number theoretic notation. Priority Queues and Concatenable Queues using 2-3 Trees. IV GRAPH THEORY ALGORITHMS: Algorithms for Connectedness. RSA public key Crypto system. primality Testing and Integer Factorization. Kuratovski s two Graphs. Division theorem. Solving Linear equation. III GRAPH THEORY DEFINITIONS: Definitions of Isomorphic Components. Circuits. Spanning Trees.Tech. Single Min-Cut Max-Flow theorem of Network Flows. power of an element. GCD recursion. Dictionaries. Breadth First and Depth First Search. Operations on Disjoi nt sets and its union-find problem Implementing Sets. Cut-sets. Augmenting Red-Black Trees to Dynamic Order Statistics and Interval Tree Applications.

object-oriented simulation.Tech. Discrete system simulation. generalization of growth models.Rajasthan Technical University. application-oriented simulation packages. IV System Dynamics. critical path simulation. . simulation of pure-pursuit problem single-server queuing system and an inventory problem. System modeling. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : SIMULATION AND MODELING (5 IT 6. Simulation software. generation of random numbers. types of models. expression based languages. exponential decay models. real time simulation. exponential growth models. CSMP-III and MODSIM-III. Cobweb model. simulation of servo system. feedback in socio-economic systems and world models. Distributed Lag models. stochastic simulation. Stochastic activities. continuous and discrete simulation languages. Monte-Carlo computation vs. types of system simulation.2) Unit Contents I System definition and components. basic nature of simulation. static and dynamic physical models. test of randomness. logistic curves. comparison of simulation and analytical methods. simulation languages. full corporate model. III Simulation of continuous systems. analog vs. modified exponential growth models. sys tem dynamics diagrams. simulation of an autopilot. types of system study. V Simulation of PERT networks. continuous and discrete systems. hybrid simulation. fixed time-step vs. static and dynamic mathematical models. simulation of w ater reservoir system. event-to-event model. uncertainties in activity duration. technique of simulation. Monte-Carlo simulation. Kota Detailed Syllabus for B. generalization of non-uniformly distributed random numbers. why to simulate and when to simulate. resource allocation and consideration. general-purpose vs. digital simulation. II System simulation.

3) Unit Contents I Overview of Biometrics. Biometric Identification. Distortion Techniques.Tech. Copy Right Enforcement. Applications of Transformation in Steganography. Linguistic Steganography. Security of Steganography System. Matching Biometric Samples. IV Watermarking and Copyright Protection: Basic Watermarking. Positive a nd Negative of Biometrics. Definition of FAR and FRR. Cover Generation Techniques. Kota Detailed Syllabus for B. II Introduction to Information Hiding: Technical Steganography. Wavelets. Active and Malicious Attackers. Steganalysis: Looking for Signatures: -Extracting hidden Information. Verification by humans. . Speaker Recognition. V Transform Methods: Fourier Transformation. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : IT FOR FORENSIC SCIENCES (5 IT 6. Evaluation and Benchmarking of Watermarking system. Adaptive versus non-Adaptive Algorithms. Information Hiding in Noisy Data . Fast Fourier Transformation. Authentication and Biometrics: Secure Authentication Protocols. Watermarking Applications. Access Control Security Services. Error Rate of Match Engines. Split Images in Perceptual Bands. Signature Verification. Authentication Protocols. Statistical Steganography. System Security. Matching: Two kinds of errors. Common biometrics: Finger Print Recognition. Information hiding in Written Text. Estimating Errors from Data. Authentication Methods. Requirements and Algorithmic Design Issues. Mellin-Fourier Transformation. Score distribution. III A Survey of Steganographic Techniques: Substitution systems and Bit Plane Tools. Discrete Cosine Transformation. Biometric. Transform Domain Techniques: -Spread Spectrum and Information hiding. Biometric Verification. Biomet ric Enrollment. Face Recognition. Disabling Hidden Information. Wisdom from Cryptography Principles of Steganography: Framework for Secret Communication. Iris Recognition. Hand Geometry.Rajasthan Technical University.

Write a program to create a symbol table. loop. All programs have to be written in C++ 1. sub2=85.e.). Kota Detailed Syllabus for B.) 6.e. Write a program which can parse a given C file and store all variables and fu nctions in symbol table. MULTIPLY. Write a class for file handling. SUB. Int main () { int sub1=72. (Information Technology) Session 2009-10 (Main Examination) 5 IT 7.g. float per. (Macro value 100 can be an expression also. Develop a program which takes input a file of C language (a) Print Lines of Codes and print signature of all function (including main) (b) Print number of variables in every function (with type) (c) Generate a new file without the comments.) OR mathematical expression (sub1 = sub2 -sub3 . 7. 2 -5. MOVE. jump etc. (c) System has 16 registers (R1 to R16) (d) RTL opcode available are: ADD. LOAD. (/* */ and //) (d) Process all #define (i. having functions to open/ read/ write/ close / reset.Tech. per=(sub1+sub2+sub3)/(100+100+100). either variable declaration statements (int sub1=23.Rajasthan Technical University. (b) Only two type of statements. #define MAX 100. sub3=63.) expression is there in input code e. 8 -10. Assumption (a) Input C file will have only main function. than replace every occurrence of MAX with 100). SYSTEM SOFTWARE LAB In this lab we will practice how source code is processed by compiler/ assembler / pre-processor. } . Write a program to convert given C program into RTL code. if-else. DIVIDE (e) No control-flow (i.

Overview of Lab & Project. 7. (Information Technology) Session 2009-10 (Main Examination) 5 IT 8. E-COMMERCE LAB 1. 4. 6. Creation of the ODBC connectivity. Selection of data using Record sets. 5.Tech. Kota Detailed Syllabus for B. Exercises using MS FrontPage. .Rajasthan Technical University. Insertion/ modification of data with ASP. 3. DHTML. 2. Creation of the SQL server Database. ASP and ASP data Connectivity. Exercises using ASP/SQL 8. Mini Project in E-Commerce: Developing a small E-Commerce product catalog using ASP/MS SQL. Basics of HTML.

name. having two tables t1 (id. (b) Re-write program 1. father name ) of a class using file handling. using any DBMS and any compatible language. which ask user to enter a valid SQL query and display the re sult of that query. create two tables of these names in above databas e. (b) Write a query to display average age of all students. (Use C++ and File handling). Create a database of sa me name. Write a program.(C++/MySQL) ( VB and MS-Access) 2. DATABASE LAB Student can use MySql (preferred open source DBMS) or any other Commercial DBMS tool (MSAccess / ORACLE) at backend and C++ (preferred) VB/JAVA at front end. Design a Video Library Management System for managing issue and return of Video tapes/CD and manage customer's queries. su bject. Create a database db1. name. which ask user to enter database name and table name to del ete. Design a Loan Approval and Repayment System to handle Customer's Applicati on for Loan and handle loan repayments by depositing installments and reducing balances.Rajasthan Technical University. 7 -8. Write a program in C++ to parse the user entered query and check the validity of query. table creation/ deletion. Database creation/ deletion. (Only SELECT query with WHERE clause) 5 -6. 3. Kota Detailed Syllabus for B. marks). (a) Write a query to display name and age of given id (id should be asked as inp ut). (b) Write a program. Now ask user to input two more string. (Information Technology) Session 2009-10 (Main Examination) 5 IT 9. 9 -10. (c) Write a query to display mark-sheet of any student (whose id is given as inp ut).Tech. (a) Write a program to take a string as input from user. 1. (d) Display list of all students sorted by the total marks in all subjects. . If database exist and table exist then delete that table. 4. age) and t2 (id. (a) Write a C++ program to store students records (roll no.

Deployment Diagram . Collaboration Diagram 5. Activity Diagram 7 -8. State Chart Diagram 6. Kota Detailed Syllabus for B.Tech. (Information Technology) Session 2009-10 (Main Examination) 5 IT 10. Sequence Diagram 4. Component Diagram 9 -10.Rajasthan Technical University. Use case static structure diagram 2. Object and Class diagram 3. Following diagrams should be prepared: 1. UML LAB Students are required to prepare various UML diagrams for any case study like Mi crowave Oven operation.

deadlock detection. Security threads protection intruders-Viruses-trusted system. inter-process communication. deadlock avoidance. deadlock prevention. Kota Detailed Syllabus for B. . threads. recovery from deadlock. Basic concepts of CPU scheduling. segmentation. page replacement algorithms. allocation of frames.Rajasthan Technical University. operations on processes. multiple processor scheduling. introduction to distributed systems and parallel processing case study.Tech. III Concepts of memory management. algorithm evaluation. contiguous and non-contiguous allocation. demand segmentation. Deadlock problem. II Process concept. IV Concepts of virtual memory. thrashing. file concepts. semaphores. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : OPERATING SYSTEMS (6 IT 1) Unit Contents I Introduction to Operating Systems. critical section problem. I/0 devices organization. directo ry systems. Methods for deadlock handling. swapping. multiprocessor system. file access methods. I/0 devices organization. I/0 buffering. classical problems of synchronization. multiprogramming. process scheduling. Operating system services. Scheduling criteria. allocation methods. Scheduling algorithms. demand paging. file protection. and paging combined with segmentation. real time scheduling I/0 devices organization. V Disk scheduling. paging. precedence graphs. deadlock characterization. system calls. time-sharing system. storage structures. logical and physical address space.

Mail Message Formats and MIME and Mail Access Protocols DNS The internet s directory service DNS records and Message. Link State routing Algorithm. section layer. connectionless Transport. Kota Detailed Syllabus for B. NAP s and ISPs. II Application Layer: Protocol and Service Provided by application layer. PPP Layers-Physical Layer and Data Link Layer . Secti on overhead. Link Control Protocols. Line overhead and path overhead. SMTP. Point To Point Protocol (PPP). Authentication PAP and CHAP. (Information Technology) Session 2009-10 (Main Examination) Name of Subject COMPUTER NETWORKS (6 IT 2) Unit Contents I Network. Internet Backbones. LCP Packets and options. Router Components. User Server Interaction and Web caches. Network Control Protocol (NCP). line layer. IPV6 Packet format. Electronic Mail. Principles of Reliable Data Transfer-Go back to N and Selective Repeat. Sonnet Frame format. V Sonet/SDH:Synchronous Transport Signals. transport protocols. Sequence Numbers and acknowledgement numbers. Edge.Rajasthan Technical University. HTTP. Routing principles. path layer and device layer relationship. Connection Oriented Transport TCP Connection and Segment Structure. Protocol Layers and their services models. Multiplexing and Demultiplexing applications. Message formats. Sections. Lines and Paths. A distant Vector routing & OSPF algorithm. Telnet. III Transport Layer: Transport Layer Service and Principles. Physical configuration-SONET Devices. Input Prot. Round trip time and timeout. . IV Network Layer and Routing: Network service model. TCP connection management. UDP Segment structure and UDP Checksum. Access Networks and Physical Media. transition States. Network Protocols. Switching fabric and output port. The world wide web. Virtual Tributaries and types of VTs. SONET Layers-Photonic Layer. FTP commands and replies.Tech.

GREEDY METHOD: Knapsack Problem. . Las Vegas algorithms. KMP Matcher and Boyer Moore Algorithms. DIVIDE AND CONQUER METHOD: Binary Search. NP-Hard and NP-Complete Problems. Flow shop scheduling and Network capacity assignment problems. Backtracking Algorithms and queens problem. Job Sequencing. Problem definition of Multicommodity flow.Tech. ASSIGNMENT PROBLEMS: Formulation of Assignment and Quadratic Assignment Problem. V PROBLEM CLASSES NP. Monte Carlo algorithms. Kota Detailed Syllabus for B. Merge Sort. III PATTERN MATCHING ALGORITHMS: Naïve and Rabin Karp string matching algorithms. Optimal Merge Patterns and Minimal Spanning Trees. Longest Common Subsequence and 0/1 Knapsack Problem. Decision Problems. Cook's Theorem. (Information Technology) Session 2009-10 (Main Examination) Name of Subject: DESIGN & ANALYSIS OF ALGORITHMS ( 6 IT 3) Unit Contents I BACKGROUND: Review of Algorithm Complexity and Order Notations and Sorting Methods. IV RANDOMIZED ALGORITHMS. Approximation Algorithms for Vertex Cover and Set Cover Problem. Proving NP-Complete Problems -Satisfiability problem and Vertex Cover Problem. randomized algorithm for 2-SAT. randomized algorithm for Min-Cut. NP-HARD AND NP-COMPLETE: Definitions of P. II DYNAMIC PROGRAMMING: Matrix Chain Multiplication. BRANCH AND BOUND: Traveling Salesman Problem and Lower Bound Theory. Quick sort and strassen's matrix multiplication algorithms.Rajasthan Technical University.

. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : WEB TECHNOLOGY (6 IT 4) Unit Contents I Introduction and Web Development Strategies History of Web. JSP processing. Declaring variables and methods. CSS Document type definition. Conditional Processing. XML schemes. Tables. Studying Javax. Servlet API. Tomcat Server. Planning and Process Development. Object in Java Script.Tech. IV Introduction to JSP. Lifecycle. Frames. Protocols governing Web. Servlet Packa ges: HTTP package. Images. Sharing data between JSP pages-Sharing Session and Application Data. Object Models. Application-specific Database Action. Advantage. Cyber Laws Web Applications. Using XML Processors: DOM and SAX Introduction to Java Script. Target Users.sql.*package. Web Team. V Database Connectivity Database Programming using JDBC. Kota Detailed Syllabus for B. accessing a database from a JSP page. Identification of Objects. JSP Application Design. Working with Http request and response. Creating Websites for individual and Corporate World. III Java Beans and Web Servers Introduction to Java Beans. II HTML. Dynamic HTML with Java Script. Error Hand ling and Debugging.Rajasthan Technical University. Introduction to EJB. Developing Java Beans in a JSP page. JSDK. introduction to Struts framework. Java Beans API Introduction to Servelets. Security Issues. Writing Web Projects. BD K. Properties. XML and Scripting List. Presenting XML. Impl icit JSP objects. Forms.

Signal distortion in o ptical wave guides. II Optical sources. Dispersion flattened. wavelength division multiplexing. Avalanche multiplication noise. Pulse broadening in Graded index fibers. I ntermodal distortion. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : OPTICAL COMMUNICATION (6 IT 5) Unit Contents I Introduction to optical communication principles of light transmission optical f iber modes and configurations. PIN. Advanc e fiber designs: dispersion shifted. SON-ET. EDFA. III Signal degradation in optical fibers. Modulation techniques for Homodyne and Heterodyne systems. . optical connectors. Optical filter link design. fiber splicing. fiber mater ials. FDDI. LASER diodes. Long haul systems bit error rate. V Advance system and techniques. Photo-detect ors. Mode field diameter. Star architectures.Rajasthan Technical University. Gain band width. optical amplifi ers semiconductor amplifier. NRZ. line coding. Block Codes eye pattern. Avalanche detector. Model reflection noise. Material dispersion. V-number. Response time. LED S. Rise time budget and link power budget. Mode theory for circular wave-guides. RZ. Numerical aperture.Tech. population inversion. Kota Detailed Syllabus for B. Dispersion compensating fibers. Attenuation losses. Ring topology. Comparison between semiconductor and optical amplifier. Multimode fibers. IV Coherent optical fiber communication. Design optimization of single mode fibers. Single-mode fibe rs. Fiber fabrication techniques. Optical fiber bus. Chromatic dispersion. Mode coupling. Photonic switching. Optical Networks. Power launching and coupling. Wave guide dispersion.

Events and notifications. Java RMI c ase study. Consensus problem. Agreement Protocols: Introduction. performanc e metric for distributed mutual exclusion algorithms. Solution to Byzantine Agreement problem. Case studies: Needham Schroeder. Token based and non token based algorithms.Tech. re quirement of mutual exclusion theorem. Byzantine agreement problem. S SL & Millicent. absence of global clock. shared memory. path pushing algorithms. global state. resource Vs communication deadlocks. III DISTRIBUTED OBJECTS AND REMOTE INVOCATION: Communication between distributed objects. Atomic Commi t protocols. Comparison of methods for concurrency control. Timestamp ordering. II DISTRIBUTED DEADLOCK DETECTION: system model. termination d etection. Application of Agreement problem. DISTRIBUTED FILE SYSTEMS: File service architecture. centralized d ead lock detection. Digital signatures Cryptography pragmatics. Cryptographic algorithms. Replication: System model and group communication. Causal ordering of messages.Rajasthan Technical University. distributed dead lock detection. classification of Agreement Pr oblem. Optimistic Concurrency control. Sun Network File System. Logical clocks. Interactive consistency Problem. Fault -tolerant ser vices. highly . IV TRANSACTIONS AND CONCURRENCY CONTROL: Transactions. Atomi c Commit in Distributed Database system. Locks. SECURITY: Overview of security techniques. Remote procedure call. DISTRIBUTED TRANSACTIONS: Flat and nested distributed transactions. Distributed deadlock s. Kerberos. Fundamental Models Theoretical Foundation for Distributed System: Limita tion of Distributed system. Recent advances. edge chasin g algorithms. avoidance.1) Unit Contents I CHARACTERIZATION OF DISTRIBUTED SYSTEMS: Introduction. Concurrency control in distributed transactions. System models. Th e Andrew File System. Examples of distributed Systems. Transaction recovery. Resource sharing and the Web Challenges. System Models: Arc hitectural models. deadlock prevention. Kota Detailed Syllabus for B. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : DISTRIBUTED PROCESSING (6 IT 6. Distributed Mutual Exclusion: Classification of distributed mutual exclusion. Nested transactions. Lamp ort s & vectors logical clocks. detection & resolution.

Ele ction algorithm. Transactions with replicated data. Destination based routing. Routing algorithms. . Introduction to Wave & traversal algorithms. Balanced sliding window protocol. APP prob lem. CORBA CASE STUDY: CORBA RMI. Deadlock free Packet switching. CORBA services. V DISTRIBUTED ALGORITHMS: Introduction to communication protocols.available services.

Rajasthan Technical University. Flynn s & Feng s Classification. V Developing Parallel Computing Applications: OpenMP Implementation in C : Execution Model. Matrix Multiplication: Row Column Oriented Algorithms. Data Parallel Pipelined and Systolic Architectures. Hyper Quick sort. Internal Control Variables. Associative and Neural Architecture. Simultaneous Execution of Threads. Preorder Tree Traversal. IV Parallel Algorithms: PRAM Algorithms: Parallel Reduction. Exploiting ILP. Fine Grained and Coarse Grained SIMD Architecture. Prefix Sums. P arallel Construct. SIMD Architecture. Simple Examples in C . Super Scalar and Super Pipeline Design. Parallel Quicksort. Limits on ILP. Block Oriented Algorithms. Directives: Conditional Compilation. Clustering. Shared Memory MIMD Architecture. Parallel Algorithm Design Strategies. Instruction Se t Principle. Work Sharing Constructs. Cache Coherence and Synchronization Mechanisms. Parallel Computer Model. Thread Synchronization using Semaphore and Mutex. Kota Detailed Syllabus for B. . Parallel Architectural Classification Schemes. Vector Archite ctures. Canceling the Threads. ILP: Basics. Merging two Sorted lists. Speedup Performance Laws: Multiprocessor System and Interconnection Networks. Combined Parallel Work-Sharing Constructs. Multithreaded Architectures. Run-Time Library Routines: Execution Environment Rou tines. Performance Metrics and Measures. Jacobi Algorithm. Memory Model. Basics of MPI. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : ADVANCED COMPUTER ARCHITECTURES (6 IT 6. Program and Network Properties. Memory Technology and Optimization. Memory Hierarchy Design: Advanced Optimi zation of Cache Performance. II PIPELINING AND MEMORY HIERARCHY: Basic and Intermediate Concepts. Solving Linear System s: Gaussian Elimination. Instruction Level Data Parallel Architectu re. Linear and Nonlinear Pipe line Processors.Tech. Lock Routines. Timing Routines.2) Unit Contents I INTRODUCTION: Parallel Computing. III THREAD AND PROCESS LEVEL PARALLEL ARCHITECTURE: Introduction to MIMD Architecture. IEEE POSIX Threads: Creating and Exiting Threads. Distributed Memory MIMD Architectures . M aster and Synchronization Constructs.

Rajasthan Technical University. Intrusion detection. firewall. Hierarchical space management. Models. Exist Processes. Introduction to Storage. V STORAGE AND SECURITY MANAGEMENT: Introduction Security. Determining customer s Requirements.Tech. Value of Systems management for business. Kota Detailed Syllabus for B. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : IT INFRASTRUCTURE MANAGEMENT (6 IT 6. Disaster Recovery. Basics of network security. Identity management. Archive & Retrieve. Information Technology Infrastructure Library (ITIL). Problem management. Release management. security information management. Access Management. IV SERVICE SUPPORT PROCESSES: Configuration Management. Capacity management. growth of internet. LDAP fundamentals. Identifying System Components to manage. Service desk. Database & Application protection. Change management. applications. Patterns for IT systems management. SAN & NAS. complexity of today s computing environment. Availability management. Evolutions of Systems since 1960s (Mainframes-toMidrangeto-PCs-to-Client-server computing-to-New age systems) and their management. Total cost of complexity issues. . Single sign-on. Infrastructure management activities. Tools and their integration. Introduction to the design process for information systems. current business demands and IT systems issues. Bare machine recovery. III SERVICE DELIVERY PROCESSES: Service-level management. Data retention. Data. II PREPARING FOR INFRASTRUCTURE MANAGEMENT: Factors to consider in designing IT organizations and IT infrastructure. financial management and costing. Space Management. Backup & Restore. Incident management. IT services continuity management.3) Unit Contents I INFRASTRUCTURE MANAGEMENT OVERVIEW: Definitions.

Tech. Write a shell script to count the lines. set-unset. *) . Writing a simple shell script to echo who is logged in. ls. Words and characters in its input (Note : Don't use wc). Write a shell script to print end of a glossary file in reverse order using arra y. Practice commands: cp. who. Practice commands: xargs. >>). 4. Practice commands: head. paste. (Information Technology) Session 2009-10 (Main Examination) 6 IT 7. Write a shell script to display only executable files in a given directory. mkdir. (Hint: use awk tail). 7. uniq. Nov. 6. job. 8. echo. 9. ps. >. $cal Oct. alias. Write a shell script to check whether Ram logged in. continue checking every 60 seconds until success.g. . rm. kill. export. 5. cut. Write a shell script to sort a list of file either in alphabetic order or larges t file first according to user response. mv. ln. setenv-unsetenv. sed. rmdir. pipelines ( ) 2. cat. 3.Rajasthan Technical University. tail. find . Modify cal command to accept more than one month (e. sort. )(Hint : u se alias too) 10. Kota Detailed Syllabus for B. locate. source. chmod. Wildcards ( ?. I/O redirection (<. SHELL PROGRAMMING LAB 1. grep.

(use Net:FTP) 5. . (use Net:mail) 6. convert it to A SCII text (by stripping html tags) and display it. Write a program to fetch content of a URL from a perl script. Write a program to compute the number of lines in a file. A Hello World Program b. The programs should monitor system resources li ke disk space and notify admin by mail when disk space becomes dangerously low. Kota Detailed Syllabus for B. b. Write a program to add to 10 numbers. 10. TCP Client and create a sample code to show se rver-client communication over TCP. To understand advance constructs of Perl a. Write few basic programs of Perl. Perl works on all platf orms (including windows) 1. (do not store duplicate numbers) c. which have changed since yesterday. Find out who owns a domain (use Net:whois . 9. NETWORK LAB The lab is to be conducted in Perl programming language. Machine can be specified using IP address or domain name of machine. Write a program of reading input from the keyboard and displaying them on mon itor. Fetch mail from a POP3 server (use Net:pop3) 7. a.Tech. 4. Write program for TCP Server. Write a program to create a list of your course (all theory courses in curren t semester) using array and print them. c. Automate the one-time transfer of many files to download the file everyday. Find the IP address of a host or turn an IP address into a name.Rajasthan Technical University. Write a program to accept ten number. store it into a hash table (Perl have i tself) and when asked by user tell him that number exists or not. Whois is a service provided by do main name registration authorities to identify owners of domain names) 8. 3. Connect to an FTP server and get or put files. d. Test whether a machine is alive. Write a program to take two strings as input and compare them 2. Write a program to send mail. (Information Technology) Session 2009-10 (Main Examination) 6 IT 8.

Kth smallest element . Heap sort. Hamiltonian cycles). Back tracking (n-queens problem. 0/1 knapsack. Greedy method (knapsack problem. Kota Detailed Syllabus for B. Bubble sort Searching : Sequential and Binary Search Selection : Minimum/ Maximum.Tech. OBST. merge sort. Dynamic programming (multistage graphs. Strassen s matrix multiplicatio n). traveling salesperso n problem).Rajasthan Technical University. optimal merge patterns. DESIGN AND ANALYSIS OF ALGORITHMS LABORATORY WORK (TCS-553) Programming assignments on each algorithmic strategy: Divide and conquer method (quick sort. Sorting : Insertion sort. graph coloring problem. (Information Technology) Session 2009-10 (Main Examination) 6 IT 9. job sequencing. minimal spanning trees).

Creation of a simple Bean with a label which is a count of number of clicks. T he Item . User profile page .aking the students information from the XML document. Installation of TOMCAT web server. After that integrate the two bea ns to make it work as a calculator.Rajasthan Technical University. total and percentage and save this XML document at the s erver. Creation of a JavaBean which gives the converted value of Temperature (in degree celcius) into equivalent Fahrenheit. Home page . Do the assignment 7 using JSP by converting the static web pages of assignment 2 into dynamic web pages. Payment by credit card . Add validations to the above static pages of registration. total and percentage by t. Items catalog . Registration and user login . 7. 1 Development of static pages using HTML of an online Departmental Store. 8. 3. Kota Detailed Syllabus for B. mar ks obtained in 5 subjects. The we bsite should be user friendly and should have the following pages: . Convert the static web pages of assignments 2 into dynamic web pages using servlets and cookies. 4. Then create a BeanInfo class such that only the count is visible in the Property Window. Shopping cart . 6. user prof ile and payment by credit card using Java Script. Create database with User Information and Item information. Order confirmation 2. (Information Technology) Session 2009-10 (Main Examination) 6 IT 10. Creation of two Beans a) Keypad b) Display pad. Creation of a XML document of 20 students of III IT. Write a program that takes students roll number as an input and returns the stude nts marks. user login.Tech. Add their roll numbers. 5. WEB TECHNOLOGY LAB 1.

9.catalog should be dynamically loaded from the database. Implementation of Hello World! program using JSP Struts Framework .

Multimedia Broadcast Services. sound. Communication devices. Kota Detailed Syllabus for B. Digital Audio. Compression. Adaptive Coding. image capturing. MHEG Standard Video Streaming on net. recent development in Multimedia . authoring tools. image file formatic animations Images standards. Loss less compression of sound. LZW compression. V Images: Multiple monitors. lossy graphic compression. Sound MIDI. MPEG standards. Sampling Variables. Vector drawing. tools for object generations. Colors. Dictionary based Compression. audio file formats. Multimedia Database. Huffman Algorithms. II Multimedia Building Blocks Text. Communication and Entertainment products and Stages of Multimedia Projects. Zig Zag Coding. Multimedia software s. Content based retrieval for text and images. Video Compression. Memory & storage devices. Video: Video representation. Multimedia in business and work. MIDI under windows environment Audio & Video Capture. Convergence of Computer. Video Conferencing. presentation tools. Multimedia hardware. Indexing and retrieval of Video Database. LZ77. Multimedia Objects. III Data Compression Huffman Coding. loss compression & silence compression. bitmaps. video. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : MULTIMEDIA SYSTEMS (7 IT 1) Unit Contents I Introduction to Multimedia. Compression ratio loss less & lossy compression.Tech. Arithmetic Coding Higher Order Modeling. Finite Context Modeling.Rajasthan Technical University. IV Speech Compression & Synthesis Digital Audio concepts. Sliding Window Compression. card and page based authoring tools. JPEG Compression. Multimedia Information. Shannon Fano Algorithm.

Authoring tools. Rotation. Introduct ion to Hidden Surface elimination. Kota Detailed Syllabus for B. diffuse reflection. mouse scanner. working principle of dot matrix. MCI. . JPEG. position ing techniques. Multimedia Hardware. display processors resolution.Rajasthan Technical University. Basic illumination model. Beizier Method. Multimedia data and file formats. IV Point Clipping. symmetric DDA. inkjet laser printers.Tech. phong shading. Polygon Clipping algorithms. MPEG. line drawing. Multimedia Tools. Composite transformation. tablets and joysticks. color models like RGB. Bresenham s Algorithm. presentation. II Scan conversion techniques. working principles of keyboard. Scaling. curves. spe cular reflection. rubber band techniques. IDE. dragging etc. CMY. graphical input techniques. DIB. parallel and perspective projection. parametric function. flickin g. simple DDA. Storage tube displays. V Multimedia components. Reflection Inverse transformation. track ball . TIFF. MIDI. B-sp-line Method. di gitizing camera. Translation. color monitors. interlacing. image representation. Line Clipping Algorithms. SCSI. HSV etc. refreshing. Circle drawing. Presentation tools. Y IQ. III 2D & 3D Co-ordinate system. Gourand shading ray tracing. RTF. screen coordi nate system. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : COMPUTER GRAPHICS (7 IT 2) Unit Contents I Introduction to Raster scan displays. general method. Bresenham s Algorithm. Representation of 3D object on 2D s creen. world coordinate system.

Logic Minimization. II Hardware Modeling: Introduction to Hardware Modeling Language. . Signal Assignment and Wait Statements. Microelectronic Design. State Diagrams. Satisfiability an d cover problems. Area and performance estimation-Resource Dominated circuits and General Circuits .Tech. III Scheduling Algorithms: Model for Scheduling Problems. Vertex Cover. Clique covering and partitioning Algorithms Boolean Algebra and Representation of Boolean Functions. and Testability Propert ies Operations on Two level logic Cover-positional Cube Notation. binary Decision diagrams. Coloring. Identifi er. Fo rce Directed Scheduling. Scheduling without Resourc e. Assertion Loop. if. four phases in creating Microelectronics chips computer Aided Synthesis and Optimization.Rajasthan Technical University. Circuits Specifications for Architectural Synthesis Resources and constraints. Constrained Scheduling. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : ELECTRONIC DESIGN AUTOMATION (7 IT 3) Unit Contents I Introduction to VLSI. Graph. Styl es. Fundamental Architectural Synthesis Problems Temporal Domain Scheduling Spatial Domain Binding Hierarchical Models and Synchronization Proble m. Compilation and Behavioral Optimization Techniques. Basic Language Elements. Algorithms Review of Graph Definitions and Notations Decision and Optimization Problems. Heuristic. Architecture and package Declarations. ALAP scheduling. circuits Asics and Moore s Law. Data flow and Sequencing Graphs. V Introduction to VHDL: VHDL History and capabilities program Structure of VHDL Entity. Heuristic Scheduling Algorithms (List Scheduling). Shortest and Longest Path Problems. Constraints-Unconstrained Scheduling ASAP Scheduling Algorithms Latency. Nand Gate Models. Comparator and Test Bench Modeling. Multiprocessor Scheduling. Under Timing Constraints and Relative Scheduling with Resource Constraints Integer Linear Programming Model. case and next Statement Block and concurrent Assertion statements structural specificatio ns of Hardware-inverter. IV Two Level Combination Logic Optimization: Logic Optimization Principles-Definiti ons. Data objects. Functions with Multivolume inputs and list oriented manipulation. Data Types and Operator Behavioral Modeling-process variable Assignment. Exact Logic Minimization. Algorithms for logic minimiza tion. Kota Detailed Syllabus for B.

Bluetooth-User scenarios. Physical layer. . information bases and networking. III Satellite Systems: Application Basics-GEO. IV Broad Cast Systems: Overview. First generation analog Second generation TDMA and Third generation systems. Security and Link Management. Principles of Cellular networks. HIPER LAN-protocol architecture. 11-System architecture. Physical laye r. Wireless local loop and IEEE 802. LEO and MEO Introduction to Mobil e Satcom. Routing. 16 Fixed Broadband Wireless Access standards. Cyclic repetition of data. Networking. Digital video broadcasting. Mobile IP. IEEE 802. Localization and Handover. MAC Layer. V Wireless LAN: Infrared vs radio transmission. Digital audio broadcasting-mobile object transfer protocol.Tech. Kota Detailed Syllabus for B.Rajasthan Technical University. protocol architecture. Wireless Application Protocol. Internet Control Message Protocol and Message Authentication. II Cordless Systems And Wireless Local Loops: Cordless systems. Global Cellular Network. Infrastructure and ad hoc networks. Medium access control layer and MAC management. Broad band and tro ubles with wireless. physical layer channel access control sub layer. (Information Technology) Session 2009-10 (Main Examination) Name of Subject: WIRELESS COMMUNICATION ( 7 IT 4) Unit Contents I Introduction: Cellular revolution.

Euclid s Algorithm. IV Authentication Applications: Kerberos and X. discrete logarithms. key distribution. combining security associations. Kota Detailed Syllabus for B. classical encryption techniques-substitution ciphers and transposition ciphers. Secure hash algorithm(SHA). message authentication code. primality testing. Elganel encryption. cryptanalysis. S/MIME. key management. Digital Signatures: Digital Signatures. Encapsulating security payload s. MD5 message digest algorithm. digital signat ure standards (DSS). firewall design principals. introduction to crypto graphy. Chine se Remainder theorem. strength of DES. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : INFORMATION PROTECTION AND SECURITY (7 IT 5) Unit Contents I Introduction to security attacks. III Message Authentication and Hash Function: Authentication requirements. block cipher mod es of operations. Diffle-Hellman key exchange algorith m. Secure Electronic Transaction (SET). key management. triple DES. birthday attacks. modular arithmetic. V IP Security: Architecture. traffic confidentiality. confid entiality using conventional encryption. Modern Block Ciphers: Block ciphers principals. Conventional Encryption: Conventional encryption model. introductory idea of Elliptic curve cryptography. prime and relative prime numbers. Authentication header. System Securi ty: Intruders. differential and linear crypt analysis of DES. proof of digital signature algorithm. . authentic ation functions. IDEA encryption and decryption. electronic mail security-pretty good privacy (PGP). Web Security: Secure socket lay er and transport layer security. services and mechanism.Tech. hash functions. Principals of public key crypto systems. Shanno n s theory of confusion and diffusion. random number generation. ring and field. Viruses and related threads. strength of IDEA. II Introduction to graph. stereo graphy. Fermat s and Euler s theorem. fiestal structure. stream and block ciphers. authentication protocols.Rajasthan Technical University.509. security of RSA. securi ty of hash functions and MACS. directory authentication servic e. RSA algorithm. data encryption standard(D ES). trusted syst ems.

SOA Enterpr ise Software models. Business Value of SOA. critical success factors.1) Unit Contents I SOA Fundamentals: Defining SOA. ESB.Rajasthan Technical University. WSPolicy. runtime qualiti es. Enterprise solution assets(ESA) . Enterprise Service Bus (ESB). Capture and assess business and IT issues and drivers. de signing service integration environment (e. operational management challenges. misperceptions about SOA. services enablement. WS-Security and the Web services security specifications. Service modeling. implementation of integration patterns.. articulate architecture. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : WEB SERVICES (7 IT 6. WS-Coordin ation and WS-Transaction. choosing appropria te standards. SOA g overnance (SLA. WS-Reliable Messaging. registry). Business Process Execution Language for Web Services (BPEL4W S). roles and responsibilities.Tech. SOA characteristics. and matric es). SOAP. WS-Attachments. Evolution of SOA. concept of a service in SOA. WSDL.. II Web services Technologies: XML technologies XML. non-runtime qualities).g. XQuery. service models for legacy application integration and enterprise integration. role of ESB in SOA governance. policies. . XSLT. technical constraints. business centric SOA and its benefits. Basic modeling building blocks. XSD. serviceoriented analysis. business constraints. design activitie s. DTD. infrastructure services. IBM On Demand operating environment. Tools available for appro priate designing. QoS compliance in SOA governance. security implementation. quality assurance. V Managing SOA Environment: Distributing service management and monitoring concept s. XPath Web services technologies -Web services and SOA. implementing SOA. SOA Delivery Strategies. III SOA Planning and Analysis: Stages of the SOA lifecycle. mapping business processes to technology. determ ining nonfunctional requirements (e. Kota Detailed Syllabus for B. IV SOA Design and implementation: service-oriented design process. Service-level agreement considerations.g. Basic SO A architecture. impact of changes t o services in the SOA lifecycle. UDDI WS Standards (WS-*) -Web services and Service-oriented enterprise (SOE). determine services and tasks based on business process model.


and Timing Constraints. An Overview of Real Time Operating Systems.Tech. Release Times. Typical Real Time Applications: Digital Control.2) Unit Contents I Introduction: Definition. . Temporal Parameters of Real Time Workload. Scheduling Algorithms for End-to-End Periodic Tasks. Medium Access Control Protocols for Broadcast Networks. Weighted Round Robin Approach. Basic Priority-Inheritance and Priority-Ceiling Protocols. V Real Time Communication: Model of Real Time Communication. Internet and Resource Reservation Protocols. Preemption Ceiling Protocol. Optimality of Effective-Deadline-First (EDF) and Least-Slack-Tim e-First (LST) Algorithms. Access Control in Multiple-Unit Resources. IV Multiprocessor System Environment: Multiprocessor and Distributed System Model. Kota Detailed Syllabus for B. Scheduling Aperiodic and Spo radic jobs in Priority Driven and Clock Driven Systems. St ack Based Priority-Ceiling Protocol.Rajasthan Technical University. Non-pre-emptive Critical Sections. Reference Models for Real Time Systems: Processors and Resour ces. Controlling Concurrent Accesses to Data Objects.. Offline Versus Online Scheduling. Multiprocessor Priority-Ceiling Protocol. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : REAL TIME SYSTEMS (7 IT 6. Priority Driven Approach. III Resources Access Control: Effect of Resource Contention and Resource Access Cont rol (RAC). End-to-End Tasks in Heterogeneous Syst ems. Real Time Proto cols. Signal Processing etc. Priority-Based Servic e and Weighted RoundRobin Service Disciplines for Switched Networks. Predictability and Validation of Dynamic Multiprocessor Systems. Use of Priority-Ceiling Protocol in Dynamic Priority Systems. Scheduling of T asks with Temporal Distance Constraints. Schedulability of Fixed-Priority End-to-End Periodic Tasks. Precedence Const raints and Data Dependency. Hard Real Time Systems a nd Soft Real Time Systems. High Level Controls. II Real Time Scheduling: Common Approaches to Real Time Scheduling: Clock Driven Approach. Communication in Multicomputer System. Dynamic Versu s Static Systems. Deadlines. Periodic Task Model.


CORBA. macromolecular structures. Analyzing DNA. Protein structure. finding new type of data online. . Linux Operating System. Introduction to biostatics.3) Unit Contents I INTRODUCTION: Bioinformatics objectives and overviews.Tech. and controlled vocabularies. Genomic sequencing. application t o biological data warehouses. Structure of DNA. Tertiary and Quaternary str ucture. Kota Detailed Syllabus for B. Perl applications for bioinformatics-Bioperl. Genes-the functional elements in DNA.DNA sequencing. expressed sequence tags. problems in molecular approach and the bioinformatic s approach. Protein folding and function. regular expressions. Proteins: Amino acids. Secondary. gene expression. II THE INFORMATION MOLECULES AND INFORMATION FLOW: Basic chemistry of nucleic acids. Structure of RNA. DNA Replication. Overview of the bioinformatics applications. Metadata: Summary & reference systems. Interdisciplinary nature of Bioinformatics. Java clients. Major Bioinformatics databases and tools. generic variability and its conne ction to clinical data. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : BIO-INFORMATICS (7 IT 6. fuzzy search and neighboring. Central dogma of molecular biology.Rajasthan Technical University. hierarchies and graphical models. Data integration. transcription factor binding sites and single nucleotide polymorphism. Translation. -Transcripti on. IV NUCLEOTIDE SEQUENCE DATA: Genome. Data analysis. chemical compounds. MOLECULAR BIOLOGY AND BIOINFORMATICS: Systems approach in biology. Computational representations of molecular biological data storage techniques: d atabases (flat. Understanding and Using Biological Databases. general dat a retrieval techniques: indices. relational and object oriented). Representation of patterns and relationships: alignments. III PERL: Perl Basics. V BIOLOGICAL DATA TYPES AND THEIR SPECIAL REQUIREMENTS: sequences. Boolean search. Nucleic acid-Protein interaction.

division . Present a Video file on 2 independent systems communicating through network w ithout participation of server system of the network 5. Program a presentation of circle and rectangle with audio description i.Rajasthan Technical University. si ze. That can be played with depressing th e notes by mouse click. 10 nos) ask to perform addition. 3. An animation sequence is mixed with audio words. Make a spelling checker in which PC speaks a word user enters this word throu gh keyboard . Transfer the f ile to other system through floppy. 4. 7. On wrong spelling it asks to retype the wor k.Compress it in some format .(Note : A bat can be displayed as hit/miss s equence of ball played).On correct answer PC applauses else it asks to retry . MULTIMEDIA LAB 1. These files are played on a single system after sound robin mixing digit s. One is having English spoken digits and another having Hindi spoken digits. 2. 6. Kota Detailed Syllabus for B. To analyze a file having diagram .On correct spelling PC gives applause .e. after 8-failures PC shows correct spelling 8. played synchronously one after another.Tech. Play two audio files. User perform said operation and enters result through keyboard . Make a math driller for primary school in which PC presents two or more numbe rs (Max. color of boundary and interior etc. subtraction . searching max or minimum etc. Every action is synchronized with pronunciation of the current action. (Information Technology) Session 2009-10 (Main Examination) 7 IT 7. multiplication . Make musical notes displayed on screen. Decompress and display the original diagram: (Note: -Use bitmap format).One by one.After 8 failure PC gives correct answer .

Rotation. Implementation of Polygon Clipping using Sutherland-Hodgman algorithm. Scalind and rota tion. Implementation of circle generation using Mid-point method and Bresenham s algo rithm. 3. DDA and Bresenham s algor ithms. Implementation of 3D geometric transformations: Translation. 7. COMPUTER GRAPHICS LAB 1. 5. 9. Implementation of polygon filling using Flood-fill.Rajasthan Technical University. Implementation of Line Clipping using Cohen-Sutherland algorithm and Bisectio n Method. Implementation of Curve generation using Interpolation methods. Implementation of 2D transformation: Translation. Kota Detailed Syllabus for B. Painter s algorithm.Tech. Boundary-fill and Scan-li ne algorithms. Scaling. Implementation of ellipse generation using Mid-point method. Implementation of any one of Back face removal algorithms such as Depth-Buff er algorithm. Warnock s algorithm. Implementation of Curve generation using B-spline and Bezier curves. 4. Scan-line algorithm) . 10. (Information Technology) Session 2009-10 (Main Examination) 7 IT 8. Mirror R eflection and Shearing (write a menu driven program). Implementation of line generation using slope s method. 8. 2. 11. 6.

Write a program to count 4-input lookup table in a simple circuit (up to 10 g ates specified as Blif or Boolean equation). . Kota Detailed Syllabus for B.Rajasthan Technical University. Write a program that estimate area of circuit (specified as Blif or Boolean e quation) using library binding technique of simple circuit (up to 10 gates). 8. 6. Write VHDL Codes for all gates with all Modeling. Write a program to convert Blif format into Boolean equation. Write a program which reads simple digital circuit (of size up to 10 gates) i n blif / Boolean equation and display schematic in graphics format. 2.Tech. Write a program to obtain sequencing graph for a given set of arithmetic expr ession (up to 10 nodes) 7. Write VHDL Codes & Test bench for half adder and full adder. 3. 5. 4. ELECTRONIC DESIGN AUTOMATION LAB 1. Write a program to implement state machine up to 5 states. (Information Technology) Session 2009-10 (Main Examination) 7 IT 9.

Discretization and Concept hierarchy generation. Clustering. OPTICS. Data Mining interface. Hierarchical Clustering-CURE and Chameleon. Density Based Methods-DBSCAN. Neural Network approach. MOLAP.Rajasthan Technical University. Kota Detailed Syllabus for B. II Concept Description: Definition. HOLAP. Association rule mining. III What is Classification & Prediction. Regression. Genetic Algorithm. mining Single-Dimensional Boolean Association rules fro m Transactional Databases Apriori Algorithm. Back propagation Algorithm. Data Marting. Graph Displ ays of Basic Statistical class Description. Definition. Measuring Central Tendency. Data Generalization. Model Based Method Statistical Approach. Difference between Database System and Data Warehouse. Mining Class comparisons. Issues regarding Classification and predict ion. Mult ilayer feed-forward Neural Network. Security. OL AP Servers. Dimensionality reduction. Process Architecture . Analytical Characterizatio n. Cluster Analysis: Data types i n cluster analysis. Form of Data Preprocessing. CLIQUE. Outlier Analysis IV Data Warehousing: Overview.Data Mining-Definition & Functionalities. Computer and Human inspection). Historical information.Tech. Snow Flakes. Concept hierarchy. Categories of clustering methods. V Aggregation. 3 Tier Architecture. Data Compression. Data Reduction:-Data Cube Aggregation . Query Facility. Grid Based MethodsSTING. Inconsist ent Data. Data Cubes. Classification by Back propagation. ROLAP. . Fact Constellations. Motivation(for Data Mining). Data Processing. Stars. Analysis of attribute relevance. Delivery Process. Data Cleaning: Missing Values. Statistical measures in large Databases. Testing Data Warehouse. Backup and Recovery. Mining Association Rules in Large Databa ses. Bayesian Classification. Classification methods Knearest neighbor classifiers. Data Integration and Transformation. Measuring Dispersion of Data. Partitioning methods. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : DATA MININIG AND WAREHOUSING (8 IT 1) Unit Contents I Overview. Numerosity Reduction. Tuning Data Warehouse. Clustering. Mining Multilevel Association rules fr om Transaction Databases and Mining Multi-Dimensional Association rules from Relati onal Databases.(Binning. Noisy Data. OLAP function and Tools. Decision tree. Multi Dimensional Data Model.


Gap analysis.Tech. ERP and Internet. Identification of suitable platforms. ERP Module. pre evaluation screening. Options of various paradigms. Role of SDLC/SSAD. Critical success and failure fac tors. Critical Factors guiding selection and evaluation. LAP.Rajasthan Technical University. Data ware Housing. Object oriented architecture. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : ERP SYSTEMS (8 IT 2) Unit Contents I ERP Overview. Human Resource IV ERP & E-Commerce. Impediments and initiatives to achieve success. ERP Market. Business Process Reengineering. Future Directives-in ERP. ERP implementation life cycle. Data Mining. package evaluation. project planning phase. Benefit. Vendors. V Using ERP tool: either SAP or ORACLE format to case study with example in any system. Kota Detailed Syllabus for B. II ERP A Manufacturing Perspective. Consultant Employee s. Strategies for successful implementation. Integrating ERP into organizational culture. Hidden costs. III ERP Implementation: introduction. Supply chain Management. .

Data center requirements and evolution to accommodate storage needs. DAS. Storage and Regulations. FCIP. Component architecture of intelligent disk subsystems. Kota Detailed Syllabus for B. Content Addressabl e Storage (CAS): elements. connectivity protocols ( NFS. and management principles. SAN. Data categorization within an enterprise. & management principles. mapping. standards (SCSI. properties. Front end to host storage provisioning.Rajasthan Technical University. Information Lifecycle Managemen t concept. CIM). The five pillars of technology. Remote business continuity techniq ues. V Managing & Monitoring: Management philosophies (holistic vs. and back end management. Fibre Channel principles. performance). and management princip les. Physical vs. IP SAN elements. security. II Storage Systems Architecture: Intelligent disk subsystems overview. Front end connectivity and queuing properties . capacity. ftp). standards. availability. performance. Overview of st orage infrastructure components.Tech. SMI-S. Industry management standards (SNMP. Standard framework applications. security. modular arrays. Overview of basic stora ge management skills and activities. Local business continuity techniques. Sources of data and states of data creation. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : STORAGE AND INFORMATION MANAGEMENT (8 IT 3) Unit Contents I Introduction to Storage Technology: Data proliferation and the varying value of data with time & usage. connectivity. RAID & parity algorithms. Disaster Recovery principles & techniques. and specifications. system & component). and operation. NAS. Contrast of integrated vs. protection. connectivity options. SAN management principles. Hybrid Storage solutions overview including technologies like virtualization & a ppliances. Metric analysis methodologies & trend analysis . CIFS. Arr ay caching properties and algorithms. Network Attached Storage (NAS): elements. Direct Attached Storage (DAS) environments: elements. FCP ). III Introduction to Networked Storage: JBOD. Evolution of storage. & network management principles. Disk physical structure components. & management . connectivity principles. Interaction of f ile systems with storage. hot spa ring. Key management metrics (thresholds. logical disk organization. Storage Area Networks (SAN): elements & connectivity. & CAS evolution. Logical partitioning of disks. IV Introduction to Information Availability: Business Continuity and Disaster Recov ery Basics. connectivity options. Storage system connectivity protocols. standards.

Provisioning & configuration change planning. . Problem reporting.. prioritization. Management tools overview. Reactive and pro-active management best practices. and handling techniques.

Wireless applications. da ta broadcasting. channel allocation in cellular systems. Wireless multiple access protocols.Tech. MAC issues. applications. adaptive clusteri ng for mobile wireless networks.1) Unit Contents I Introduction. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : MOBILE COMPUTING (8 IT 4. Mobile IP. overview of wireless telephony: cellul ar concept. issues in mobile computing. channel structure. File system. Kota Detailed Syllabus for B. Destination sequenced distance vector routing (DSDV). Temporary ordered routin g algorithm (TORA). transaction processing in mobile computing environment. Disconnected operations. handoffs. hierarchical. IEEE 802. data replication for mobile computers. location management: HLR-VLR. II Wireless Networking. Routing protocols. GSM: air-interface. global state routi ng (GSR). V Ad Hoc networks. security and fault tolerance. TCP over wireless. applications. Ad Hoc on demand distance vector routing (AODV).Rajasthan Technical University. IV Mobile Agents computing. Blue Tooth. GPRS. QoS in Ad Hoc Networks. WAP: Architecture. III Data management issues. CDMA.11. localization. Wireless LAN Overview: MAC issues. protocol stack. . Dynamic source rout ing (DSR). application environm ent.

CIDR. III Advanced Sockets: Introduction to IPV6.2) Unit Contents I Introduction TCP/IP:. DHCP. OSPF. Inte rnet protocol (Datagram delivery. socket options. VPN. POSIX IPC & System V IPC. Daemon processes and intend.Tech. UDP client and servers. NFS II Socket Programming: Socket Fundamentals. internetworking concepts and architecture. IV X/OPEN Transport Interface (XTI): TCP client and servers name and address functi ons. Private Networks. BOOTP. Threads and IP options. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : NETWORK PROGRAMMING (8 IT 4. V Advanced Topics: Inter-process communication-Introduction. IPV4 AND IPV6 interoperability Advanced name and address conversion. Elementary TCP & UDP sockets. . RARP. Broadcasting. Introduction to pipes & FIFOS. Doors and Sun RPC (Introduction only). routing. introduction of UDP and TCP. (ICMP). elementary name and address conversion. NAT. HELLO. client server model. streams and virtual. RIP. BGP. EGP. Advanced I/O and non blocki ng I/O. ARP. Kota Detailed Syllabus for B.Rajasthan Technical University. I/O multiplexing.

planning. (Information Technology) Session 2009-10 (Main Examination) Name of Subject : ARTIFICIAL INTELLIGENCE (8 IT 4. semantic networks scripts schemas. AO* algorithms etc. Study of the block world problem in robotics. Introduction to understanding and natural languages processing. other Search Techniques like hi ll Climbing. common sense.Tech. monotonic and nonmonotonic reasoning. Problems in representing knowledge. introduction to neural networks. frames. Characteristics of production systems. Study and comparison of breadth first search and depth first search.Rajasthan Technical University. theorem proving. V Introduction to learning. and various types of control strategies. forward and backward reasoning. Baye's theorem. reasoning. alpha-beta cut-offs etc. comparison of propositio nal and predicate logic. deduction.3) Unit Contents I Meaning and definition of artificial intelligence. . Resolution. II Knowledge Representation. Various techniques used in learning. Techniques. knowledge representation using propositional and predicate logic. Best first Search. some example of expert systems. A* algorithm. IV Game playing techniques like minimax procedure. refutation. Various types of production systems. applications of neural networks. inferencing. conceptual dependency and fuzzy logic. III Probabilistic reasoning. Kota Detailed Syllabus for B.

7. Import metadata from specific business intelligence tools and populate a meta data repository. Gain insight for running pre-defined decision trees and explore results using MS OLAP Analytics. 6. 3. Publish metadata stored in the repository. . Using Teradata Warehouse Miner Create mining models that are executed in SQL. Kota Detailed Syllabus for B. 2. ( Portal work : The objective of this lab exercises is to integrate pre-built repo rts into a portal application ) 4. Metadata & ETL Lab: The objective of this lab exercises is to implement metadata import agents to pull metadata from leading business intelligence tools and populate a metadata r epository.Tech. DATA MINING AND WAREHOUSING LAB The objective of the lab exercises is to use data mining techniques to use stand ard databases available to understand DM processes using any DM tool) 1. Load data from heterogeneous sources including text files into a pre-defined warehouse schema. Using IBM OLAP Miner Understand the use of data mining for evaluating the con tent of multidimensional cubes. Design and build a Data Warehouse using bottom up approach titled 'Citizen Information System'. Design a data mart from scratch to store the credit history of customers of a ba nk. Publish and analyze a business intelligence portal. Case study 1. (Information Technology) Session 2009-10 (Main Examination) 8 IT 5. Use this credit profiling to process future loan applications. 2. To understand ETL processes 5.Rajasthan Technical University.

Money and Banking: Functions of Money. Human Behavior: Factors of Individual Behavior. Taylor and Fayol.. Commercial and central bank ing. Price Effect. . 2. 5. Management: 4. Business fluctuations. Introduction: Definition. Kota Detailed Syllabus for B. INDUSTRIAL ECONOMICS AND MANAGEMENT LAB Industrial Economics: 1. Engin eering and Technology and their relationship with economic development. Meaning of Science. Interpersonal Relationship and Group Behavior. Learning and Pers onality Development.Tech. viz.Rajasthan Technical University. Perception. Inflation and measures to control it. Evaluation of Management thought.. Income Effect and Substitution Effect . Indifference Curve Analysis. Introduction: Nature and significance of Economics. Value of Money. Elasticity of Demand and Sup ply. Nature and Significance of Management. Basic Concept: The concept of demand and supply. (Information Technology) Session 2009-10 (Main Examination) 8 IT 6. Contributions of Max Weber. 3. Brief idea of functions of banking system.

Tech. 5. Create login form and validate it username/password stored in database. 4. Create web pages to learn how to navigate between web pages and servers. Programming to learn data binding. . 3. A web application display product names and price in tabular formats. 6. navigation between records. Create web pages to understand and use to validate user inputs. Create student record and perform following operations: Add record. (Information Technology) Session 2009-10 (Main Examination) 8 IT 7 WEB PROGRAMMING LAB 1. 2. 7. search record. delete. and edit. Kota Detailed Syllabus for B.Rajasthan Technical University. Each row c ontaining product detail should display Know More button. Create web pages to understand the various server controls. When the button is clicked the d escription for the selected item should be displayed.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer: Get 4 months of Scribd and The New York Times for just $1.87 per week!

Master Your Semester with a Special Offer from Scribd & The New York Times