Final 21.07.

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)]


Introduction to Wireless Communication 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].





Text Books & References References: ferences: 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

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

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

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

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

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

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

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

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

Given any intermediate code form implement code optimization techniques Reference V.V Das. Write grammar for a fictitious language and create a lexical analyzer for the same.Managing symbol table. Heaps 5. Parse tree and syntax tree.) Class: VII Sem. Develop an Understanding about Language processor development tools: LEX. Language specification and processing 2. 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.Tech. Develop a recursive descent parser 7. syntax analysis. operators etc. Develop an operator precedence parser (Construct parse table also) 6. Lexical analysis. literal table.07. LL (1) parser) Bottom up parsing (operator precedence parsing) . opcode table. Top down parsing (recursive decent parsing.2010 RAJASTHAN TECHNICAL UNIVERSITY Detailed Syllabus B. Write a program to simulate Heap storage allocation strategy 9. YACC. comments. Engg.Tech. code generation. Polish notation (Postfix strings) 4. Branch: Computer Engg. Write a program for generating for various intermediate code forms i) Three address code ii) Polish notation 8. Generate Lexical analyzer using LEX 10. Generate YACC specification for a few syntactic categories 11. 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. Develop an Understanding of Scanning by using concept of Finite state automaton. Engg. constants. the students should have clearly understood and implemented the following: 1. 5. Write a program to parse using Brute force technique of Top down parsing 4. (Comp.) 3. 2011-12 onwards 7CS9 COMPILER DESIGN LAB (Comp. Develop an Understanding of Allocation data structure.Final 21. code optimization. PHI . semantics analysis. Develop on LL (1) parser (Construct parse table also). Develop an Understanding of Intermediate code form: Three address code. Compiler Design using FLEX and YACC. Develop a lexical analyzer to recognize a few patterns in PASCAL and C (ex: identifiers. 2.) VII & VIII Sem. Develop an in depth understanding of system programming concept. pool table 3. B.

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful