Final 21.07.

2010
RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.Tech. (Comp. Engg.) VII & VIII Sem. 2011-12 onwards

7CS1 SOFTWARE PROJECT MANAGEMENT (Common to Comp. Engg. & Info. Tech) Class: VII Sem. B.Tech. Branch: Computer Engg. Schedule per Week Lectures: 3 Units Contents of the subject Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)]

Project Management: The management spectrum, the people, the product, the process, the project, the W5HH principle, critical practices I Metrics for Process and Project: Metrics in the process and project Domains, software measurements, metrics for software quality, integrating metrics within software process, metrics for small organizations, establishing a software metrics program. Estimation: Observations, Project planning Process, software scope and feasibility, resources, software project estimation, decomposition techniques, empirical estimation II models, estimation for object oriented projects, estimation for Agile development and web engineering projects, the make/buy decision. Project Scheduling: Basic concepts, project scheduling, defining a task set and task network, scheduling, earned value analysis. Risk Management: Reactive V/S proactive Risk Strategies, software risks, Risk identification, Risk projection, risk refinement, risk mitigation, monitoring and III management, the RMMM plan Quality Planning: Quality Concepts, Procedural Approach to Quality Management, Quantitative Approaches to Quality Management, Quantitative Quality Management Planning, Setting the Quality Goal, Estimating Defects for Other Stages, Quality Process Planning, Defect Prevention Planning. Quality Management: Quality Concepts, Software Quality assurances, software reviews, formal technical reviews, Formal approaches to SQA, Statistical Software Quality IV assurances, Change Management: software Configuration Management, The SCM repository, SCM Process, Configuration Management for Web Engineering Project Execution And Closure: Reviews. The Review Process, Planning, Overview and Preparation, Group Review Meeting, Rework and Follow-up, One-Person Review, Guidelines for Reviews in Projects, Data Collection, Analysis and Control Guidelines, Introduction of Reviews and the NAH Syndrome. V Project Monitoring and Control: Project Tracking, Activities Tracking, Defect Tracking, Issues Tracking, Status Reports, Milestone Analysis, Actual Versus Estimated Analysis of Effort and Schedule, Monitoring Quality, Risk-Related Monitoring. Project Closure: Project Closure Analysis, The Role of Closure Analysis, Performing Closure Analysis. Text/References: 1. R. S. Pressman, Software Engineering, TMH, 7th ed. 2. Pankaj Jalote, Software project management in practice, Addison-Wesley 3. B. Hughes & M. Cotterell, Software Project Management, TMH

Final 21.07.2010
RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.Tech. (Comp. Engg.) VII & VIII Sem. 2011-12 onwards

7CS2 WIRELESS COMMUNICATION & NETWORKS (Common to Comp. Engg. & Info. Tech.) Class: VIII Sem. B.Tech. Branch: Computer Engg. Schedule per Week Lectures: 3 Units Contents of the subject Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)]

I

Communication Introduction to Wireless Communication Systems: Evolution of mobile Radio Communications, Applications of mobile communication, Mobile Radio Systems Around the World, Example of Wireless Communication Systems, Second Generation(2G) Cellular Networks, Third Generation(3G) Wireless Networks, Frequency Reuse, Channel Assignment Strategies, Handoff Strategies, Interference and System Capacity, Improving Coverage and Capacity in Cellular Systems [3].Frequencies for radio transmission & regulations [1]. Introduction to signals, analog & digital data transmission, transmission impairments, effect of multipath propagation, type of fading & error compensation [2]. Medium access control: need for specialized MAC, hidden and exposed terminal, near and far terminals, MAC schemes: Fixed TDMA, Aloha, CSMA, DAMA, PRMA, reservation TDMA, MACA, polling, ISMA, CDMA- SAMA, comparisons [1]. Telecommunication systems: GSM: mobile services, system architecture, radio interface, protocols, localization and calling, handover, security, new data services-HSCSD, introduction to GPRS [1,3]. Wireless LAN: advantages, disadvantages and design goals, infra red v/s radio transmission, infrastructure and ad-hoc network, IEEE 802.11: System architecture, protocol architecture, physical layer, medium access control layer, MAC management and functions, brief idea of 802.11b, 802.11a, newer developments [1]. HIPERLAN: HIPERLAN 1, Bluetooth: user scenarios, architecture, radio layer, base band layer, link manager protocol, L2CAP, security, SDP, profiles, IEEE 802.15 [1]. Mobile network layer: mobile IP - Goals, assumptions and requirements, entities and terminology, IP packets delivery, agent discovery, registration, tunneling and encapsulation, optimizations, reverse tunneling, DHCP. Mobile Ad hoc network – usage & routing- global state routing (GSR), Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc on demand distance vector routing (AODV), Temporary ordered routing algorithm (TORA) [1]. Mobile transport layer: Implications of mobility in Traditional TCP, classical TCP improvements: indirect TCP, snooping TCP, mobile TCP, fast retransmit/fast recovery, transmission/time-out freezing, selective retransmission, transaction-oriented TCP [1]. Support for mobility: File systems - Introduction to coda, little work, Ficus, MIo-NFS, rover. World wide web - hypertext transfer protocol, hypertext language, system architecture. Wireless Application Protocol - architecture, wireless datagram protocol, wireless transport layer security, wireless transaction protocol, wireless session protocol, wireless application environment, wireless markup language, WML Script, wireless telephony application, push architecture, push/pull services, example stacks with WAP1.x [1].

II

III

IV

V

References ferences: Text Books & References: 1. 2. 3. Mobile Communications, Schiller, 2nd Ed., Pearson. Wireless Communications, Theodore S. Rappaport, 2nd Ed., PHI. Wireless Communications, William Stallings, Prentice Hall in Networking

4. WIRELESS COMMUNICATIONS & NETWORKING, Vijay Garg, The Morgan Kaufmann Series

Code generation from DAG. Strategies. Top down translation.) Class: VII Sem. Peephole optimization. . Review of CFG Ambiguity of grammars. Idea about LEX: A lexical analyzer generator. Data structures used in symbol tables. Engg. Symbol table organization. Bootstrapping.) VII & VIII Sem. Advantages of DAG. PHI. 2. A simple code generator. Schedule per Week Lectures: 3 Units Contents of the subject Compiler. Storage organization. Intermediate code forms using postfix notation and three address code. Input. Branch: Computer Engg. Aho. parsing with ambiguous grammar. Construction of SLR. Accessing local and non local names in a block structured language. Issues in design of code generator. Addison Wesley. Translation of assignment statement. Boolean e xpression and control structures. Syntax directed definitions. Bottom up parsing Top down parsing techniques. buffering. Operator precedence parsing. Shift reduce parsing. LL grammars & passers error handling of LL parser. Specification of a type checker. Phase of compiler introduction to one pass & Multipass compilers. Parameters passing. Recursive descent parsing predictive parsers. L-attributed definitions. Introduction of automatic parser generator: YACC error handling in LR parsers. Activation records. Ullman and Sethi: Compilers. Idea about global data flow analysis.Tech. Interpreter definition. LR parsers. Representing TAC using triples and quadruples. Introduction to parsing. Holub.Tech. Review of Finite automata lexical analyzer. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV V Text/References: 1. Conical LR & LALR parsing tables. Storage allocation. Compiler Design in C. Sources of optimization. Loop optimization. (Comp. DAG representation of basic block. B. Loop invariant computation. Construction of syntax trees. Definition of basic block control flow graphs. Engg. Recognition of tokens. 2011-12 onwards 7CS3 COMPILER CONSTRUCTION (Comp. Translator.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Error handling.07.Final 21.

relative scheduling. Sait and H. Hardware abstract models – structures and logic networks. Placement algorithms. Application-Specific Integrated Circuits. Left-edge algorithm. Iterative improvement algorithms. State diagram. Youssef. Physical Design. TMH. Schedule per Week Lectures: 3 Units Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Contents of the subject Complexity in microelectronic circuit design and Moore’s Law. G. Via minimization. Field Programmable Gate Arrays.Tech. Clock Planning. III IV V Text Books: 1. Branch: Computer Engg. ROBDD and Bryant’s reduction algorithm and ITE algorithm. Channel definition. derivatives. Resource Sharing & Binding in sequencing graphs for resource dominated circuits. Two-level logic optimization principles – definitions and exact logic minimizations. Clock routing. Engg. tabular representations and Binary Decision Diagram (BDD).fie-conference. Addison-Wesley. Simulated Annealing. power routing.Final 21. I II Boolean functions and its representations – co-factor. Placement – goals and objectives. (Comp. Design Stages. hierarchical sequencing graphs. Scheduling in pipelined circuits. Architectural Synthesis – Circuit description and problem definition.) VII & VIII Sem. sharing of registers and busses. list scheduling heuristic. Micheli.) 2.) 3. Compilation and behavioral optimizations.ASAP and ALAP scheduling algorithms. http://www. Positional cube notations. Global routing methods. design flow and related problems.H. (Low-priced edition is available. Floor planning – goals and objectives. Detailed Routing – goals and objectives. binding variables to registers. Programmable Logic Devices. Michael John Sebastian Smith. synchronization problem. consensus and smoothing. I/O and power planning. References: References 1.Tech. functions with multi-valued logic. unite. Computer-Aided Synthesis and Optimizations.D. scheduling under constraints. Timingdriven global routing. OBDD. Constraints and routing graphs. S. Timing-driven Placement. design styles -Fullcustom design.pdf 2. Global routing – goals and objectives. VLSI Physical Design Automation: Theory and Practice. 2011-12 onwards 7CS4 COMPUTER AIDED DESIGN FOR VLSI (Comp. B. (Indian edition available. Channel routing algorithms. circuit extraction and Design Rule Checking. data-flow and sequencing graphs. standard-cell design. S.07. Algorithms VLSI Design Automation. Wiley India. .org/fie98/papers/1002. List-oriented manipulations. Engg.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. temporal and spatial domain scheduling. Gerez. Synthesis and optimization of digital circuits.) Class: VII Sem. Scheduling algorithms .

refreshing. N.Principles and Practice. Area based algorithms. Prabhat Andleigh and Thakkar. Surfaces: Hidden Lines & Surfaces Image and Object space.K. Storage tube displays. Computer Graphics: Picture analysis.) Class: VII Sem. Schedule per Week Lectures: 3 Units Contents of the subject Introduction: Introduction to Raster scan displays. Reflection. Polygon Representation. circle. line. Hearn and Baker: Computer Graphics. Architectural considerations. Introduction to Interactive. resolution. B. Splines: Curves and Splines Parametric and Non parametric Representations.) VII & VIII Sem. Flood Filling. Point Clipping. Hughes: Computer Graphics.Final 21. J. BSpline Curves. S. Translation.Tech. Bezier curve. specular reflection. Scan line algorithm. Tech. Overview of programmer’s model of interactive graphics. display processors. Multimedia Input/Output Technologies: Storage and retrieval technologies. Composite transformation. Boundary filling. Gourand shading. Foley. Aliasing. J. color monitors. Cohen-Sutherland Line Clipping Algorithm. Scan Conversion: point. Pearson 2. HSV Multimedia: Multimedia components. Animation: Introduction.Sharda. Multimedia Systems Design. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV V . Hidden Facets removal. PHI. A. and introduction to Anti Aliasing (No anti aliasing algorithm)..2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. color models like RGB. file formats. Engg. Branch: Computer Engg.07. Text/References: 1. flicking. Feiner. Multimedia Information Networking. PHI 3. Fundamental problems in geometry. Rotation. Polygon Clipping algorithms. CMY. phong shading. problems and Animation techniques. Engg. interlacing. diffuse reflection. 2011-12 onwards 7CS5 COMPUTER GRAPHICS & MULTIMEDIA TECHNIQUES (Common to Comp. Van Dam. ellipse polygon. Depth Buffer Methods. & Info. (Comp. ray tracing. Rendering: Rendering: Basic illumination model. YIQ. Inverse transformation. PHI.Tech. Rules. Cosystem: 2D & 3D Co-ordinate system: Homogeneous Co-ordinates. 4. Scaling.

Branch: Computer Engg. Parallel Query Optimization. Introduction to Distributed Transactions. [2] Object Database Systems: Motivating Examples. Updating Distributed Data. System Catalog in a Relational DBMS. Estimating the Cost of a Plan. Simon AR. & Info. 2. Encapsulation and ADT's. Queries into Algebra. Storing Data in a Distributed DBMS.Multilevel Relations and Polyinstantiation. Schedule per Week Lectures: 3 Units Contents of the subject and Optimization mization: Query Processing and Optimization Overview of Relational Query Optimization.07. 2nd Edition. XML applications. Operations Object Systems On Structured Data. A. Comparing RDBMS. Parallelizing Individual Operations. [2] POSTGES: POSTGES POSTGRES user interfaces. Distributed III Catalog Management. OODBMS. Additional Issues Related to Security. Distributed Recovery. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II Databases: Parallel and Distributed Databases Architectures for Parallel.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Distributed DBMS Architectures. Covert Channels. Database Systems. Korth and S.Grant and Revoke on Views and Integrity IV Constraints. DoD Security Levels.Final 21. ORDBMS Implementation Challenges. Ceri Pelagatti . Inheritance. Query processing and optimizations. 2011-12 onwards 7CS6.Tech. Discretionary Access Control. Morgan Kaufmann. Querying and Transformation.Tech. sql variations and extensions. Sudarsan: Database Cocepts 5th edition.1 ADVANCE DATABASE MANGEMENT SYSTEMS (Common to Comp. Structured Data Types.) Class: VII Sem. Distributed Database: Principles and System .Role of the Database Administrator. 1995 5. Access Control. B. Addison Wesley. Structure of XML data. . Distributed Query Processing. XML Document Schema. System Architectures. 1999 3. Elmasri R and Navathe SB. Storage of XML Data. Begg C and Strachan A. [2] Authorization: Database Security and Authorization Introduction to Database Security. Objects. [2] Text/References 1.2000. Silversatz. Databases. Strategic Database Technology: Management for the Year 2000. Security in Statistical Databases. H. 3rd Edition. V XML: Motivation. Alternative Plans. Addison Wesley. Engg. Database Design for an ORDBMS. Parallel Query Evaluation. Transaction Management. Mandatory Access Control. Tech. (Comp. Mc-Graw Hills 2005. OIDs and Reference Types. Storage and Indexing. Engg. Translating SQL. and ORDBMS. Enumeration of Alternative Plans. Relational Algebra Equivalences. Distributed Concurrency Control. Fundamentals of Database Systems.(McGraw Hill) 4. Application Program Interface to XML. Encryption. ORDBMS. Connolly T.) VII & VIII Sem.

Analysis of attribute relevance. Concept hierarchy. Form of Data Preprocessing. Clustering.Tech.) VII & VIII Sem. Process Architecture. B. Density Based Methods-DBSCAN. Numerosity Reduction. Motivation(for Data Mining). Data Reduction:-Data Cube Aggregation.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Aggregation.Data Mining-Definition & Functionalities. OPTICS. Historical information. Pearson Education. Inconsistent Data.07. Graph Displays of Basic Statistical class Description. Branch: Computer Engg. Neural Network approach. Engg. Delivery Process. Stars. Hierarchical Clustering. . Schedule per Week Lectures: 3 Units Contents of the subject Overview.2 DATA MINING & WARE HOUSING (Comp. Mining Class comparisons. Data Processing. Data Integration and Transformation. Difference between Database System and Data Warehouse. (Comp. Back propagation Algorithm. Bayesian Classification. mining Single-Dimensional Boolean Association rules from Transactional Databases– Apriori Algorithm.Dimensional Association rules from Relational Databases. OLAP Servers. Regression. Mining Multilevel Association rules from Transaction Databases and Mining Multi. Fact Constellations. Backup and Recovery. MOLAP.STING. Engg. Computer and Human inspection). Measuring Central Tendency. Grid Based Methods. Data Compression. What is Classification & Prediction. Building the Data Warehouse – WH Inmon.Final 21. Dimensionality reduction. Genetic Algorithm. Definition. Data Mining. Classification methods K-nearest neighbour classifiers. Discretization and Concept hierarchy generation. ROLAP. Data Mining – Concepts and Techniques – Jiawai Han and Micheline Kamber. Measuring Dispersion of Data. Concept Description: Definition. Outlier Analysis Data Warehousing: Overview. (Binning. Tuning Data Warehouse. Testing Data Warehouse. Partitioning methods. Data Cubes. Data Mining interface.) Class: VII Sem. 3. OLAP function and Tools. Noisy Data. 3 Tier Architecture. Wiley. Issues regarding Classification and prediction. Query Facility.CURE and Chameleon. 2011-12 onwards 7CS6. Mining Association Rules in Large Databases. Association rule mining. Statistical measures in large Databases. Cluster Analysis: Data types in cluster analysis. Clustering. Analytical Characterization. Decision tree. Snow Flakes. Data Generalization. CLIQUE. Multi Dimensional Data Model. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV V References: Text Books & References 1. Classification by Back propagation. Security. Data Cleaning: Missing Values. Data Warehousing in the Real World – Anahory and Murray. Model Based Method –Statistical Approach. Categories of clustering methods. HOLAP. Multilayer feed-forward Neural Network. 2.Tech.

. DCT. (Comp. lossy. 2011-12 onwards 7CS6. B. Schedule per Week Lectures: 3 Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Units Contents of the subject Compression Techniques: Lossless. probability and linear system models. adaptive coding. DWHT. IV Sampling in frequency and time domain. Lossless compression: Derivation of average information.) VII & VIII Sem. Scalar quantization: The quantization problem. Basic algorithm. quantization and coding of transform coefficient. rate distortion theory. V Wavelet based compression: Introduction. G.722.Tech.4 and T. advantages. Basic algorithm. Rice codes. modeling & coding. minimum variance Huffman codes. Sayood K: Introduction to Data Compression: ELSEVIER 2005. LZ78. Dictionary Techniques: LZ77. uniform quantizer. differential entropy. Filters. conditional entropy. Forward adaptive III quantization. wavelets multi-resolution analysis and the scaling function implementation using filters. Sub band coding: Introduction. z-transform. The Linde-Ruzo-Grey algorithm. DST. Differential encoding – Introduction. Kraft-Mc Millan inequality. References: Text Books & References 1. prefix codes.07. speech and image coding using delta modulation.Final 21. LZW II Predictive coding: Burrows-Wheeler Transform and move-to-front coding. lattice vector quantization.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.) Class: VII Sem. JPEG-LS Facsimile Encoding: Run length. Adaptive DPCM.Tech. Arithmetic coding with application to lossless compression. Engg. T. uniquely I decodable codes with tests. average mutual information. optimality. measure of performance. Design of Filter banks. Huffman coding: Algorithms. companded Quantization quantization: Vector quantization: Introduction. data models.6 codingLossy coding Mathematical preliminaries: Distortion criteria. Delta modulation.3 Data Compression Techniques (Comp. length extended codes. Engg. MPEG. Branch: Computer Engg. non-uniform quantization-Formal adopting quantization. using Huffman codes for lossless image compression.

Compilers & Libraries: Microsoft Platform. Programs to produce a single pixel produce a pre specified pattern with features like changing background color. the students can choose any platform either Microsoft Windows or Linux. Tech) Class: VII Sem. lines of all slopes must be drawn. the students should have clearly understood and implemented the following: 1. drawing lines thicker than one pixel. circle and rectangle with audio description i. Use the line drawing & circle drawing programs to draw composite objects containing only circle & lines. Indicative List of Experiments: 1. Engg.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. repositioning of window: 3. car etc.Net. 4.Final 21. 2. Programs to demonstrate clipping algorithms eg. The program must be independent of the slope i. Programs to demonstrate filling algorithms eg. 5. use appropriate methods for filling and filling convex & concave polygons. 3. Programs to draw composite objects containing circles & lines. simple fonts. 7. clipping lines.07.g. circles against a rectangular clip area. resizing of window. 6. Simple fonts. & Info. Implement circle drawing as a special case of ellipse. Examination Time = Four (4) Hours Schedule per Week Maximum Marks = 50 Practical Hrs. No library function except the one required to put a single pixel on the screen. resizing of window. Evaluation Branch: Computer Engg. To produce a single pixel and pre specified pattern on screen: 2. To Implement Clipping (various algorithms).e. To implement mid point algorithm to draw circle and ellipse: 4. 3. and scalable fonts. 7.: 2 [Sessional /Mid-term (30) & End-term (20)] Objectives: At the end of the semester. Use Mid Point algorithm to draw ellipse. played synchronously one after another. 8. For this lab.Tech.g. Use Mid Point algorithm to draw line between two points. The program must be able to (i) input a polynomial by drawing lines (ii) determine whether convex or concave (iii) use appropriate methods for filling. scalable fonts. 2.Tech. color of boundary and interior etc. Programs to demonstrate text generation e. filling convex & concave polynomials. repositioning of window must be demonstrated. To implement features like changing background color. graphical fonts. (Comp. program to clip a (i) line and (ii) polygon using Cohen-Sutherland Clipping algorithm(s).) VII & VIII Sem. Input a polygon by drawing lines. You can take shapes like a cart. B. graphical fonts. 5. . foreground color. Linux – Xlib/OpenGL. you can take shapes like a cart. Extend this to draw arcs between points. 6. No turbo C/C++. 2011-12 onwards 7CS7 COMPUTER GRAPHICS & MULTIMEDIA LAB (Common to Comp. car etc. size.e. Engg. foreground color. Programs to demonstrate presentation of geometrical objects e. Suggested Platform/Tools: 1.Visual Studio.

Tech. a pure geometric point of view ignores the electrical (both digital and analog) aspect of the physical design problem. physical design algorithms tend to be very intuitive in nature. and have significant overlap with graph algorithms and combinatorial optimization algorithms.) VII & VIII Sem. the students shall be assigned exercises on route optimization. many consider physical design automation the study of graph theoretic and combinatorial algorithms for manipulation of geometric objects in two and three dimensions. Evaluation Branch: Computer Engg. but also permit designers to make iterative improvements to the layouts. Algorithms for physical design must also ensure that the layout generated abides by all the rules required by the fabrication process. B.Tech. However. Sherwani). The objective is to investigate optimal arrangements of devices on a plane (or in three dimensions) and efficient interconnection schemes between these devices to obtain the desired functionality and performance. At a later stage.) Class: VII Sem.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. (Comp. In a VLSI circuit. Examination Time = Four (4) Hours Schedule per Week Maximum Marks = 75 Practical Hrs : 3 [Sessional/Mid-term (45) & End-term (30)] VLSI Physical Design Automation is essentially the research. it is necessary to keep the electrical aspects of the geometric objects in perspective while developing algorithms for VLSI physical design automation. which provides very small features and allows dramatic increases in the clock frequency. Small circuits may be taken & algorithms implemented. Therefore. which exhibit a very complex behavior and depend on a host of variables. the effect of electrical parameters on physical design will play a more dominant role in the design and development of new algorithms. placement & floor planning. to begin.07. the students may use tools and design more complex circuits. Fabrication rules establish the tolerance limits of the fabrication process. algorithms must be efficient and should be able to handle very large designs.Final 21. development and productization of algorithms and data structures related to the physical design process. 2011-12 onwards 7CS8 VLSI PHYSICAL DESIGN LAB (Comp. Since space on a wafer is very expensive real estate. Automation tools such as Synopsis/ Cadence are available in the area. However. the arrangement of devices plays a key role in determining the performance of a chip. As a result. The exercise should be such that the above objectives are met. Engg. (Source: Algorithms For VLSI Physical Design Automation. In addition. Efficient algorithms not only lead to fast turn-around time. With the introduction of Very Deep Sub-Micron (VDSM). such as polygons and lines. algorithms must use the space very efficiently to lower costs and improve yield. In view of this observation. The VLSI physical design process manipulates very simple geometric objects. by Naveed A. polygons and lines have inter-related electrical properties. Finally. . Engg.

2011-12 onwards 7CS9 COMPILER DESIGN LAB (Comp. literal table. Engg. comments. 2. the students should have clearly understood and implemented the following: 1.V Das.Final 21.Tech. pool table 3. Develop an in depth understanding of system programming concept. Engg. 5. PHI . Develop an Understanding about Language processor development tools: LEX. Language processing activities (Program generation and execution) It is expected that each laboratory assignments to given to the students with an aim to In order to achieve the above objectives Indicative List of exercises: 1. Polish notation (Postfix strings) 4. YACC. B. Develop an Understanding of Scanning by using concept of Finite state automaton. Language specification and processing 2. Heaps 5. Write grammar for a fictitious language and create a lexical analyzer for the same. Top down parsing (recursive decent parsing. Parse tree and syntax tree. Lexical analysis.) Class: VII Sem. semantics analysis. code optimization.) 3. Write a program to simulate Heap storage allocation strategy 9. Develop on LL (1) parser (Construct parse table also). Develop an operator precedence parser (Construct parse table also) 6. code generation. Develop a lexical analyzer to recognize a few patterns in PASCAL and C (ex: identifiers. LL (1) parser) Bottom up parsing (operator precedence parsing) . Develop an Understanding of Allocation data structure. Write a program to parse using Brute force technique of Top down parsing 4. Compiler Design using FLEX and YACC. (Comp. Write a program for generating for various intermediate code forms i) Three address code ii) Polish notation 8. constants. Generate YACC specification for a few syntactic categories 11.) VII & VIII Sem.Tech. opcode table. Develop an Understanding of Intermediate code form: Three address code. Given any intermediate code form implement code optimization techniques Reference V. operators etc. Develop a recursive descent parser 7.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Branch: Computer Engg. syntax analysis. Schedule per Week Practical Hrs : 3 Evaluation Examination Time = Four (4) Hours Maximum Marks = 100 [Sessional/Mid-term (60) & End-term (40)] Objectives: At the end of the semester.07. Generate Lexical analyzer using LEX 10.Managing symbol table.

application to DBMS.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Jini. IrDA-Architecture & protocol stacks. Golden Richard III. Data dissemination. Mobility management: mobility management. security. Service Discovery Middleware: Service Discovery & standardization Methods (Universally Unique Identifiers. mobile agent computing.) VII & VIII Sem. adaptability issues (transparency. Fundamentals of Mobile and Pervasive Computing.11 wireless networks Matthew S. computing: Pervasive computing: Introduction. Principles of mobile computing Hansmann & Merk. bandwidth allocation for publishing. Universal Plug and Play. Springer 3. Smart Label. unicast Discovery. Environmental Constraints. B. Smart Tokens. Web Services for Remote Portals. mobile cache maintenance schemes. broadcast disk scheduling. III IV V Text/References: 1. Limitations. Multicast Discovery & advertisement. technologies. Reliable Agent Transfer. Network Security Testing Using Mobile Agents. SOAP. Frank Adelstein. Type – B2E Portals. model. Pearson 4. Energy efficient network protocols. IMT-2000. Smart Identification – Smart Card. Pervasive Information Technology. . 2. Mobile Agent Security and Fault Tolerance using Distributed Transactions. WSDL. Standards: DECT. Mobile Agents. Network Security Testing Using Mobile Agents. Web Service Security. Architecture of a Secure Agent System. Loren Schwiebert. location management principle and techniques. Engg.Final 21. Connectivity. UMTS. TMH. Engg. Middleware for application development: adaptation. Branch: Computer Engg. TETRA. Characteristics. Simplicity. Web Service Architecture. UDDI. Smart Home. O’REILLY.Tech. Mobile Devices – Classification. PCS location management Scheme. mechanisms for adaptation and incorporating adaptations. Garbage Collection. Sandeep Gupta. 802. service catalogs. Principles–Decentralization. Energy efficient indexing on air and algorithm. Salutation. Internet Portals – Functional Overview. II Introduction to mobile middleware.Tech.. Schedule per Week Lectures: 3 I Mobile computing: Definitions. Smart Sensors and Actuators. Web Services. Eventing. Mobile communications Jochen Schiller . Mobile Web Caching. Diversification.07. (Comp.introduction. 2011-12 onwards 8CS1 MOBILE COMPUTING (Comp. application aware adaptation).) Units Contents of the subject Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Class: VIII Sem.Gast. Textual Description & using interfaces). Data dissemination and management: challenges. Portal Infrastructure.

Key Equivocation & Unicity Distance. Galois Field Elements of Information Theory: Entropy. Introduction to Hash & MAC algorithms. Security Mechanisms. Rule based detection. Mono-alphabetic. 4. SSL (Protocols Only) Intrusion Detection: Audit Reports. Symmetric Cipher Model. DES modes of operations. Exponentiation in Modular Arithmetic. Undeniable Signatures. Transposition. Lucifer Algorithm. Distribution of Secret keys using Public Key Cryptosystems. X. RSA Algorithm. Schedule per Week Lectures: 3 Units Contents of the subject Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Elements of Number Theory: Divisibility and Euclid Algorithm. Fiestel Cipher. Key Distribution in Symmetric Encryption Public Key Cryptosystems: Principles of Public Key Cryptosystems. Basic functions of Message Authentication and Hashing. Computing Inverse in Congruences. Impersonation. Pearson Education. S-box design. X. ElGamal Signatures. 3. Prime Number Theorem. Congruences. Differential & Linear Cryptanalysis (Introduction Only). Security Services.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Trappe & Washington. AH & ESP in Transport and Tunnel mode with multiple security V associations (Key Management not Included). Springer-Verlag.. redundancy of language. E-Mail Security: PGP including management of keys in PGP. Bent functions. ring.509 Version 3. testing for primes. Tech) Class: VIII Sem.07. S/MIME. Fermat’s Little theorems. S-box design criteria. two-way public key. Concept of II ‘Confusion’ and “Diffusion’ in block ciphers. Types of attacks on Encrypted messages. III Key Management in Public Key Cryptosystems: Distribution of Public Keys. & Info. Statistical Anomaly Detection. DES Algorithm. Engg. cyclic group. Stalling Williams: Cryptography and Network Security: Principles and Practices. One way Authentication. division algorithm. B. Fundamentals of Computer Security. Primes and the Sieve of Eratosthenes. Propagation and nonlinearity. Branch: Computer Engg.509 Authentication Service: Certificates. Polyalphabetic Ciphers Private Key Cryptosystems: Block Cipher Principles.) VII & VIII Sem. Link Vis End-to-End Encryption. Legendre and Jacobi Symbols.Final 21. properties and Elementary Operations Only): Groups. 2. one-way public key. IDEA. subgroup. Product Ciphers. construction of balanced functions. 2nd Ed. Kaufman Charlie et. equivocation of a simple cryptographic system Security Attacks: Active V/S Passive.Tech. honeypots. Password Protection: Lamport Hash. .Tech. Authentication Procedure. Network Security: IPSec. intrusion detection exchange formats. Authentication: Model of Authentication Systems. Pearson. 2008.al. Authentication schemes for mutual authentication based on shared secret. Affine. field. Substitution and spoofing games.al. polynomial over a field. 4th Edition. PHI/Pearson. Text/References: 1. Factorization. EKE Protocol. security analysis of RSA. 2011-12 onwards 8CS2 INFORMATION SYSTEM SECURITY (Common to Comp. Engg. Message Authentication & Hashing: Birthday Paradox and General case of Duplications. Discrete Logarithms. I Algebraic Structures in Computing (Definitions. IV Digital Signatures: RSA Based. Chinese Remainder Theorem. 2006. Euler’s. (Comp. Network Security: Private Communication in a Public World. Introduction to Cryptography. 2nd Ed. Mediated Authentication. Pieprzyk Josef and et. Classical Cipher Techniques: Caeser. Diffie-Hellman Key Exchange. order of group. S-box theory: Boolean Function.

Network Operating Systems.[1] CORBA case study: Introduction. Modeling a Distributed Computation. Distributed Snapshots. recording the state of distributed systems. Byzantine Agreement. states and events in a distributed system. Database Techniques. Graph Models for Process Representation.concepts and Design.[1.Final 21. failure and recovery. Distributed Process Implementation. Multiprocessor Cache Systems. Pearson . Types of Operating systems: Centralized Operating System. Distributed Computing Environment (DCE).2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. clocks and event precedence. Johnson. Request/Reply and Transaction Communication. Architecture Models. Dollimore J.07. Distributed Mutual Exclusion. Transparency. and Update Propagation. Name and Directory services. Time Services. Dynamic Load Sharing and Balancing. Distributed Operating Systems and Cooperative Autonomous Systems. Engg.Tech.[1. (Comp. design issues in distributed operating systems. CORBA RMI. Coulouris G. Language Mechanisms for Synchronization. Object Model Resource Servers.[1] Systems: Distributed File Systems: Transparencies and Characteristics of DFS. Distributed termination detection. [1] Agreement: Distributed Agreement: Concept of Faults. Adversaries. B. Schedule per Week Lectures: 3 Units Contents of the subject Distributed Systems: Features of distributed systems. Atomic Multicast. Operating Systems A concept based approach by DM Dhamdhere.) VII & VIII Sem. Memory Consistency Models.[1] InterInter-process Communication and Coordination: Message Passing. Characteristics of Concurrent Programming Languages (Language not included). Branch: Computer Engg. Distributed computation paradigms. RPC and RMI case studies. Distributed Deadlock handling.) Class: VIII Sem.. Causality.[3] Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III IV Text Books: 1. Byzantine Faults. Engg.2] Theoretical issues in distributed systems: Notions of time and state. Architecture. Services.[1] Distributed Process Scheduling: A System Performance Model. DFS Design and implementation. CORBA Services. Client/Server Model. Distributed Shared Memory. Static Process Scheduling with Communication.[1] Computation: Models of Distributed Computation: Preliminaries.. Implementation of DSM systems.[1] V Replicated Data Management: concepts and issues. General Parallel file System and Window’s file systems.Tech. Pearson 2. Failures in a Distributed System. Election. Systems Concepts and Architectures: Goals.2] Case studies: Sun network file systems. TMH 3.3] Distributed Shared Memory: Non-Uniform Memory Access Architectures. nodes of a distributed system. Model of distributed systems. Distributed operating systems and algorithm analysis by Randy Chow and T. Transaction Service and Concurrency Control. Andrew and Coda File Systems [2. Data and File Replication. 2011-12 onwards 8CS3 DISTRIBUTED SYSTEMS (Comp.[2] Concurrent Processes and Programming: Processes and Threads. and Kindberg T. Impossibility of Consensus and Randomized Distributed Agreement. time. Distributed Systems.

or HDL descriptions. How are physical defects modeled as faults. Testing Economics. b) Recap of VLSI Design Flow and where testing fits in the flow. a) Design Representation for the purpose of testing – Representation in the form of mathematical equations. STUMPS. Functional and deterministic ATPG for sequential circuits and the associated challenges. Mani Krishna.) VII & VIII Sem.1 Hardware Testing and Fault Tolerance (Comp. Functional tests for memories. Defects. test pattern generation and fault coverage. Scan Testing. Fault-Tolerant Systems. Scan Architectures. Partitioning for Testability. A. pseudo-random testing. Motivation for Design for Testability.Tech. BILBO. Design for Test. M. Principles of Electronic Systems. Cost of Scan Testing. Relation between VLSI Design and Testing. Netlists. (Indian Edition Available. Reliability and Testing. Critical Path Tracking. Wiley Student Editon. Elsevier. IV b) Testing of Memories – Fault models. . a) Built-in Self Test. Concepts of fault models. Information Redundancy – parity codes. Engg. and Friedman. Abramovici. Response Compaction. bridging faults. Mean Time to Failure. IEEE press (Indian edition available through Jayco Publishing house). Random pattern-resistant faults. Different kinds of redundancy schemes for fault-tolerance (Space. delay faults. Branch: Computer Engg. transient faults. Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] I II III V Text Book: 1. M. Digital systems testing and testable design. graphs. Boundary-scan Architecture and various modes of operation. Byzantine Failures. Samiha Mourad and Yervant Zorian. B. c) Testing of microprocessors. Testing sequential circuits. tabular format. Schedule per Week Lectures: 3 Units Contents of the subject Overview of hardware testing.) Text/References: 1. RAID architectures for disk storage systems. D. Fault-tolerant routing techniques. 2001. Board-level testing. Importance of Simulation and Fault Simulation.) Class: VIII Sem. Binary Decision Diagrams. Stuck-at faults. Test Points. PODEM algorithm for test generation. Time. Memory BIST. 2.Final 21.Tech. [Available in Indian Edition]. Fault tolerance in interconnection networks. Failures and Faults. and deterministic testing. D-algorithm. Types of tests – exhaustive testing. pseudo-exhaustive testing. Failure Rate. Reliability. Difference between Verification and Testing. (Comp. Using fault simulation to estimate fault coverage and building a fault dictionary Combinational Test Pattern Generation. m-of-n codes. Compiled and event-driven simulation. Pseudo-random test generation. Watch Dog Processors. Parallel and deductive fault simulation.. 2011-12 onwards 8CS4. and Information Redundancy). checksums. Breuer. Koren and C. A. Nmodular Redundancy. Test Application. Boundary Scan Testing.07. BIST architectures – Circular BIST.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Single stuck-at-faults multiple stuck-at faults. Engg. Hardware fault tolerance.

.Final 21.) VII & VIII Sem.07. (Comp. Engg. 2011-12 onwards 2. Springer. Essentials of Electronic Testing for Digital.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. 2000.Tech. Memory and Mixed-Signal VLSI Circuits by Bushnell and Agrawal.

Periodic and Aperiodic Task Model. I II III Priority Driven Scheduling. Non-preemptive Critical Sections. execution time. (Comp.Real time systems. Shim. Dynamic Versus Static systems. notations and assumption. IV V Text & References: 1. Resources Access Control: Assumptions on Resources and their usage. server based and non-server based fixed priority scheduling algorithms – polling server.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Stack Based Priority-Ceiling Protocol. types of tasks and real time systems. scheduler concepts. B.) VII & VIII Sem. Functional Parameters. Typical Real Time Applications. simple sporadic server.Tech.M. Deadlines.Tech.Laurence. and Timing Constraints etc. RTS requirements. general scheduling structure.2 REAL TIME SYSTEMS (Comp.S. Periodic tasks scheduling: Clock Driven Scheduling – definition. Branch: Computer Engg. priority inversion problem. extended priority exchange. Optimality of the RM and DM algorithms. Access Control in MultipleUnit Resources. performance metrics. Schedule per Week Lectures: 3 Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Units Contents of the subject Introduction: Definition. J. block diagram of RTS.Final 21. scheduling criteria. Use of Priority. fixed priority scheduling algorithms (RM and DM) and their schedulability analysis.W.) Class: VIII Sem. An 3. slack stealing. schedulability analysis. period. and tasks parameters -Release Times. Pearson Education Asia 2. Krisna & K. P. McGraw Hill Microcomputer System Design.07. 2011-12 onwards 8CS4. C. Real Time Scheduling: classification of Real Time Scheduling. Engg. Aperiodic task scheduling. Preemption Ceiling Protocol. Engg. practical factors.Mauch: Real-time Introduction.Liu: Real-Time Systems. Controlling Concurrent Accesses to Data Objects. Introduction to Clock Driven scheduling. Reference Models for Real Time Systems: processors and Resources. Precedence Constrains and Data Dependency. K. deferrable server . assumption and approaches. concept of schedulability tests – Inexact and exact schedulability tests for RM and DM. priority exchange. imprecise computation model and firm deadline model. cyclic executives.TMH . Basic Priority-Inheritance and Priority-Ceiling Protocols. need of new resource synchronization primitives/protocols for RTS. Other Types of Dependencies. Introduction to scheduling of flexible computations –flexible applications. fixed priority verses dynamic priority.D. Offline Versus Online Scheduling. Effect of Resource Contention and Resource Access Control (RAC). G. notations and assumption. Temporal Parameters of Real-Time Workload. Resource Parameters. Weighted Round Robin Approach and Priority Driven Approach. concept of tasks.Ceiling Protocol in Dynamic Priority Systems.

Schedule per Week Lectures: 3 Units Contents of the subject Evaluation Examination Time = Three (3) Hours Maximum Marks = 100 [Mid-term (20) & End-term (80)] Image Representation. General Image Restoration Models. Texture Definition. Statistical Estimation Spatial Image Restoration. Image Segmentation . Generalized Two-Dimensional Linear Operator. B. Los Altos. photometry. Inc. Image Quantization. Branch: Computer Engg. IMAGE IMPROVEMENT: Image Enhancement. Sampled Image Superposition and Convolution.Tech. Haar. Contrast Manipulation. Binary Image Connectivity. Second-Order Derivative Edge Detection. Superposition and Convolution Operator III Relationships. Edge. Discrete Image Mathematical Representation.Tech. Sine. Two-Dimensional Systems. WILLIAM K. Psychophysical Vision Properties. Image Probability Density Models. Cosine. Visual Phenomena. Minification. Magnification. Morphological Image Processing. and Hartley Transforms. Clustering Segmentation Methods. Optical Systems Models. First-Order Derivative Edge Detection. Monochrome Image Quantization. Superposition and Convolution: Finite-Area Superposition and Convolution.07. Text/References 1. Image Sampling Systems. Translation. Monochrome Vision Model. Edge Detection. Vector-Space Image Representation. DIGITAL IMAGE PROCESSING: PIKS Inside. Eye Physiology.) VII & VIII Sem. PRATT. Discrete Image Restoration Models. Engg. Histogram Modification. Image Statistical II Characterization. Image Sampling and Reconstruction Concepts. Image Feature V Extraction: Image Feature Evaluation.. 6 Gray Scale Image Morphological Operations. Tech) Class: VII Sem.3 DIGITAL IMAGE PROCESSING (Common to Comp. Photographic Process Models. Amplitude Segmentation Methods. Processing Quantized Variables. Region Segmentation Methods. and Rotation. General Unitary Transforms. Fourier Transform. California. Gonzalez Woods: Image Processing . Scalar Quantization. Line. 2011-12 onwards 8CS4. Linear Operator Statistical Representation. & Info. Image Stochastic Characterization. (Comp. Linear Processing Techniques. Transform Domain Processing. Point and Spatial Image Restoration Techniques. Hadamard. Two-Dimensional Fourier Transform. Amplitude Features. Image Restoration Models. Light I Perception. IV Sensor and Display Point Nonlinearity Correction. Geometrical Image Modification. Image Reconstruction Systems. Color Vision Model. Engg. and Spot Models.Final 21. Perspective Transformation. Transform Domain Superposition. Transform Coefficient Features. Camera Imaging Model. PixelSoft. 8 Unitary Transforms. ISBN: 9780471374077 2. Boundary Detection. Noise Cleaning. 3. Third Edition. Continuous Image Spatial Filtering Restoration. Anil Jain: Digital Image Processing. Edge Crispening.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B.

: 3 Objectives: Evaluation Examination Time = Four (4) Hours Maximum Marks = 100 [Sessional/Mid-term (60) & End-term (40)] At the end of course. (Comp.) Class: VIII Sem. Engg. POSIX etc. The server should be such that it can accept multiple connections at any given time. Suggested Exercises S.Final 21.Tech. Engg. Understand IPV4 & IPV6 interoperability issues Use fork( ) system call. Virtual environment cygwin will also be required). Repeat Exercise 2 with multiplexed I/O operations Simulate Bellman-Ford Routing algorithm in NS2 3. Repeat Exercises 1 & 2 for UDP. and prints it to the screen.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Write client/server applications involving unix sockets involving TCP or UDP involving iterative or concurrent server. List of Experiments Write two programs in C: hello_client and hello_server • The server listens for.) VII & VIII Sem. Schedule per Week Practical Hrs. 1.isi. 2011-12 onwards 8CS5 UNIX NETWORK PROGRAMMING & SIMULATION LAB (Comp.Tech. then it closes the connection • The client connects to the server. Understand the network simulator NS2 and Simulate routing algorithm on NS2 (Available on http://www. a single TCP connection. BSD. B. 5.07. For NS2 Any of Microsoft Windows or Linux (In case of Microsoft. Vol-I . Write an Echo_Client and Echo_server using TCP to estimate the round trip time from client to the server. Unix Network Programming. Suggested Platform: For Socket Programming. sends the string “Hello.No. Branch: Computer Engg. it reads all the data it can from that connection. then closes the connection 2. and accepts. 4.Linux. the students should be able to • • • • • Understand various distributions of Unix viz.edu/nsnam/ns/). References: • Stevens. world!”.

Periodic Signals and harmonics.) Class: VIII Sem.Final 21. Branch: Computer Engg. Engg. Simple Detection Algorithm. B. and Quantization. Decimation. No. OFDM Speech Processing: Prediction Algorithms. List of Experiments Evaluation Examination Time = Four (4) Hours Maximum Marks = 100 [Sessional/Mid-term (60) & End-term (40)] 1. Equalization.Tech. FIR and IIR Filters. pure FPGA and Hybrid DSP/FPGA platforms Digital Communications: On-Off. Least Mean Square (LMS) algorithm (2 weeks) Wireless Communications: Channel coding/decoding. Interpolation. Spectral Analysis. 2011-12 onwards 8CS6 FPGA LAB.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Speech Classification and Synthesis 3. and time/spectrum representations.Keying (OOK).) VII & VIII Sem. Fundamental Theory Introduction to DSP architectures and programming Sampling Theory. (Comp. Design (Simulation) using MATLAB/ Simulink Simulate the lab exercises using MATLAB/Simulink Implementation using pure DSP. Simple Moving Average. . Convolution. and a simple transceiver design Adaptive Filtering: Echo/Noise Cancellation. Engg. Analog-to-Digital Converter (ADC). Fourier Transform (DFT/FFT).07. 2. BPSK modulation. Digital-toAnalog Converter (DAC). Schedule per Week Practical Hrs : 3 S. (Comp.Tech.

every student is required to deliver a seminar on a case study involving cyber crimes/ Intellectual Property. 2.”. and enforcement of the applicable acts. evidences.Final 21.Tech. (Comp. Copyright acts. rights of the creator of the property and legal framework dealing with these rights. Study the acts dealing with the cyber crimes in different countries viz.) VII & VIII Sem. the approved algorithms etc. European Union. Students are expected to prepare reports on: • • • • • • Various acts dealing with cyber crimes in the countries. Engg. Similarly on Copyright acts.07. what constitutes a cyber crime in the country ? Definitions of electronic documents.Tech. The seminar shall focus on the “methodology and tools used in the investigation. Study the Copyright acts with reference to publishing the material on the web. B. Evaluation Examination Time = Four (2) Hours Maximum Marks = 50 [Sessional/Mid-term (30) & End-term (20)] Further. Intellectual Property. USA. Schedule per Week Practical Hrs : 2 Course Objectives: 1. The corresponding acts are the reference material. botnet etc. Engg. & Info. Tech) Class: VIII Sem. The seminar may also be presented on new ways of committing cyber crimes particularly Phishing.. .2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. India. 2011-12 onwards 8CS7 Seminar on Information Technology Acts (Common to Comp. Branch: Computer Engg. Investigation methods. Study the Intellectual Property Rights and the acts dealing with these rights. 3.

Sign up to vote on this title
UsefulNot useful