Search here What you want.

Saturday, May 25

RGPV B.E Computer Science 7th Sem Syllabus

                                                            CS701 Compiler Design  


Unit-I 
Introduction to compiling & Lexical Analysis Introduction of Compiler, Major data Structure in compiler, BOOT Strapping & Porting, Compiler structure: analysis-synthesis model of compilation, various phases of a compiler, Lexical analysis: Input buffering , Specification & Recognition of Tokens, LEX.

Unit-II 
Syntax Analysis &Syntax Directed Translation Syntax analysis: CFGs, Top down parsing, Brute force approach, recursive descent parsing, transformation on the grammars, predictive parsing, bottom up parsing, operator precedence parsing, LR parsers (SLR,LALR, LR),Parser generation.Syntax directed definitions: Construction of Syntax trees, Bottom up evaluation of S-attributed definition, L-attribute definition, Top down translation, Bottom Up evaluation of inherited attributes Recursive  Evaluation, Analysis of Syntax directed definition.

Unit-III 
Type Checking & Run Time Environment Type checking: type system, specification of simple type checker, equivalence of expression, types, type conversion, overloading of functions and operations, polymorphic functions. Run time Environment: storage organization, Storage allocation strategies, parameter passing, dynamic storage allocation , Symbol table

Unit –IV 
Code Generation Intermediate code generation: Declarations, Assignment statements, Boolean expressions, Case statements, Back patching, Procedure calls Code Generation: Issues in the design of code generator, Basic block and flow graphs, Register allocation and assignment, DAG representation of basic blocks, peephole optimization, generating code from DAG.

Unit –V 
Code Optimization Introduction to Code optimization: sources of optimization of basic blocks, loops in flow graphs, dead code elimination, loop optimization, Introduction to global data flow analysis, Code Improving transformations ,Data flow analysis of structure flow graph Symbolic debugging of optimized code.

List of Experiments:

1.Develop a lexical analyzer to recognize a few patterns.
2.Write a programme to parse using Brute force technique of Topdown parsing.
3.Develop LL (1) parser (Construct parse table also).
4.Develop an operator precedence parser (Construct parse table also)
5.Develop a recursive descent parser
6.Write a program for generating for various intermediate code forms i) Three address code ii) Polish notation  Write a program to simulate Heap storage allocation strategy
7.Generate Lexical analyzer using LEX
8.Generate YACC specification for a few syntactic categories.
9.Given any intermediate code form implement code optimization techniques
Study of an Object Oriented  Compiler                    


                                      CS702 Distributed  System        


Unit-I
Introduction to distributed systems Architecture for Distributed System, Goals of Distributed system, Hardware and Software concepts, Distributed Computing Model, Advantages & Disadvantage distributed system, Issues in designing Distributed System,

Unit-II 
Distributed Share Memory And Distributed File System Basic Concept of Distributed Share Memory (DSM), DSM Architecture & its Types, Design & Implementations issues In DSM System, Structure of Share Memory Space, Consistency Model, and Thrashing. Desirable features of good Distributed File System, File Model, File Service Architecture, File Accessing Model, File Sharing Semantics, File Catching Scheme, File Application & Fault tolerance. Naming: - Features, System Oriented Names, Object Locating Mechanism, Human Oriented Name.

Unit-III 
Inter Process Communication And Synchronization API for Internet Protocol, Data Representation & Marshaling, Group Communication, Client Server Communication, RPC- Implementing RPC Mechanism, Stub Generation, RPC Messages. Synchronization: - Clock Synchronization, Mutual Exclusion, Election Algorithms:- Bully & Ring Algorithms.

Unit-IV
Distributed Scheduling And Deadlock Distributed Scheduling-Issues in Load Distributing, Components for Load Distributing Algorithms, Different Types of Load Distributing Algorithms, Task Migration and its issues. Deadlock-Issues in deadlock detection & Resolutions, Deadlock Handling Strategy, Distributed  Deadlock Algorithms,

Unit-V 
Distributed Multimedia & Database system Distributed Data Base Management System(DDBMS), Types of Distributed Database, Distributed Multimedia:- Characteristics of multimedia Data, Quality of Service Managements. Case Study of Distributed System:- Amoeba, Mach, Chorus   References:  Sinha, Distributed Operating System Concept & Design, PHI  Coulouris & Dollimore, Distributed System Concepts and Design, Pearson Pub  Singhal & Shivratari, Advance Concept in Operating System, McGraw Hill  Attiya & Welch, Distributed Computing, Wiley Pub.  



                   CS703 INFORMATION STORAGE AND MANAGEMENT  


Unit-I 
Introduction to Storage Technology: Data proliferation, evolution of various storage technologies,
Overview of storage infrastructure components, Information Lifecycle Management, Data
categorization.

Unit-II 
Storage Systems Architecture: Intelligent disk subsystems overview, Contrast of integrated vs.
modular arrays, Component architecture of intelligent disk subsystems, Disk physical structure
components, properties, performance, and specifications, RAID levels & parity algorithms, hot
sparing, Front end to host storage provisioning, mapping and operation.

Unit-III 
Introduction to Networked Storage: JBOD, DAS, NAS, SAN & CAS evolution and comparision.
Applications, Elements, connectivity, standards, management, security and limitations of DAS,
NAS, CAS & SAN.

Unit -IV
Hybrid Storage solutions; Virtualization: Memory, network, server, storage & appliances.
Data center concepts & requirements, Backup & Disaster Recovery: Principles
Managing & Monitoring:  Industry management standards (SNMP, SMI-S, CIM), standard
framework applications, Key management metrics (Thresholds, availability, capacity, security,
performance).

Unit-V 
Information storage  on cloud :Concept of Cloud, Cloud Computing, storage on Cloud, Cloud
Vocabulary,  Architectural Framework, Cloud benefits,  Cloud computing Evolution,
Applications & services on cloud, Cloud service providers and Models, Essential characteristics
of cloud computing, Cloud Security and integration.



                                          CS 7101 Network Management  


Unit-I 
Introduction to Network Managements, Network Management Framework, Network Based  Managements, Evolution of Network Management: SGMP, CMIP, SNMP. Network  Implementation and Management Strategies, Network Management Categories: Performance  Management, Fault Management, Configuration Management, Security Managements, Accounting  Managements. Network Management Configuration:  Centralized Configuration, Distributed  Configuration. Selected Management Strategy.

Unit –II 
Management Information Base (MIB), Structure of Management Information, NMS Presentation of the SMI, NMS Meter-ware Network View. Remote Monitoring (RMON), RMON Group. Desktop  Management: Desktop Management Interface(DMI), DMI Architecture, DMI Browser, DMI/SNMP Mapping, Desktop SNMP Extension Agents. Setting up LAN Access, SNMP Configuration.

Unit-III 
Introduction, layering, OSI Layering, TCP/IP Layering, Protocols & Standards, Internet standards, Internet administration, Internet Addresses, Internet protocol: introduction, IP header, IP routing, subnet addressing, subnet mask, special case of IP addresses,  Comparative Study of IPV4 & IPV6, port numbers Address Resolution Protocol, ARP packet format, Proxy ARP, ARP command, ARP Example, Reverse Address Resolution Protocol (RARP): Introduction, RARP Packet format, RARP Examples, RARP server design

Unit-IV 
Delivery and Routing of IP Packets, Routing Methods, Static versus Dynamic Routing, Routing table and Routing Module, Classless Addressing: CIDR. Internet Protocol (IP), Datagram, Fragmentation, Options, IP Package. Interior and Exterior Routing, Routing information protocol  (RIP), Open shortest path first protocol (OSPF), BGP, GGP. Private Networks. Virtual Private  Network (VPN), Network Address Translation (NAT).

Unit –V
Internet Control Message Protocols (ICMP):- Types of message, message format, error reporting, query, checksum, ICMP Package. IGMP, IGMP Message and its Operation, IGMP Package.Transmission control protocol, Process-to-Process Communication, TCP Services Flow Control, TCP Timers. TCP Operation, TCP Package.. Application layers protocol, Telnet Protocol, File Transfer Protocol (FTP), Simple Mail Transfer Protocol (SMTP), X-Window system protocol, Remote procedure call, and Network file system.


                                    CS 7102 Real Time Fault Tolerant Systems  


Unit-I 
Structure of Real Time System, Performance Measure for real time system, Task Assignments,Fault Tolerant Scheduling, Real Time Vs General purpose Data Bases, Data Bases for Hard Real Time System, Real Time Communication

Unit-II
Fault Tolerance, Fault-Error-Failure. Redundancy, Error Detection, Damage Confinement, Error Recovery, Fault Treatment, Fault Prevention, anticipated and unanticipated Faults. Error models: General coding scheme Error detection techniques: Watchdog processors, Heartbeats, consistency and capability checking, Data audits, Assertions, Control-flow checking, Error control coding. Application: DHCP

Unit-III 
Fault tolerance: Coding technique-fault tolerant self checking and fail safe circuits-fault tolerance in combinatorial and sequential circuits- synchronous and asynchronous fail safe circuits. Software fault tolerance: Process pairs, robust data structures, N version programming, Recovery blocks, Replica consistency & reintegration, multithreaded programs Application: VAX. Network fault tolerance: Reliable communication protocols, Agreement protocols, Database commit protocols -Application: Distributed SQL server Check pointing & Recovery - Application: Micro check pointing, IRIX Checkpoints

Unit-IV 
Experimental Evaluation: Modelling and simulation based, Fault injection based - Application: NFTAPE fault injector . Modelling for performance, dependability and perform ability: dependability-specific methods (fault trees, reliability block diagrams), queues, stochastic Petri nets and stochastic activity networks - Application: Ultra SAN

Unit-V
Practical Systems for Fault Tolerance: - Application: Ad-hoc wireless network - Application: NASA Remote Exploration & Experimentation System Architecture: Fault tolerant computers - general purpose commercial systems-fault tolerant multiprocessor and VLSI based communication architecture. Fault tolerant software: Design-N-version programming recovery block - acceptance tests-fault trees- validation of fault tolerant systems.  



                                        CS 7103  Embedded Computer Systems 


Unit – I
Introduction to Embedded systems Embedded Systems Vs General Computing Systems, Classification of Embedded Systems,  Major application areas of Embedded Systems, Purpose of Embedded systems ,Core of  the Embedded system, Memory, Sensors and Actuators, Communication Interface, Embedded firmware, PCB and Passive Components, Characteristics and Quality attributes of a Embedded System .

Unit – II 
Design of Embedded Systems with 8bit Microcontrollers-8051 Factors for considering in selecting a Controller ,Designing with 8051 microcontroller Different addressing modes supported by 8051 , Instruction set for 8051 microcontroller. Fundamental issues in Hardware Software Co-Design , Computational models in Embedded Design .

Unit – III 
Embedded Hardware & Firmware Design and Development Analog &Digital Electronic components, VLSI & Integrated circuit design, Electronic Design Automation tools , PCB layout Design and its fabrication .Embedded firmware design approaches , Embedded firmware Development Languages ,Programming in Embedded C . Integration and testing of Embedded Hardware and Firmware , Safe & robust Design, Reliability, Faults, errors & Failure, Functional Design, Architecture Design, Prototyping.

Unit -IV 
Embedded System Development Environment Integrated Development Environment (IDE) , Types of files Generated on Cross- Compilation , Disassembler / Decompiler, Simulators, Emulators and Debugging, Boundary Scan.

Unit – V 
Embedded Product Development Lifecycle(EDLC) and Trends in Embedded Industry What is EDLC ,Objectives of EDLC , Different phases of EDLC , EDLC Approaches-Linear  or waterfall model , Iterative Model , Prototyping/Evolutionary Model, Spiral Model . Processor trends in Industry , Embedded OS Trends , Development Language trends Open Standards, Frameworks and Alliances , Bottlenecks.



                                               CS 7201 Network & Web Security  


UNIT I 
Introduction to Network Security, Computer Securit y and Cyber Security. Security Terminologies and Principle, Security Threats, Types of attacks (Operating System, application level, Shrink Wrap code, Misconfiguration attacks etc.).  Introduction to Intrusion, Terminologies, Intrusion Detection System (IDS), Types of Intrusion  Detection Systems, System Integrity Verifiers (SIVS).Indication of Intrusion: System Indications, File System Indications Network Indications. Intrusion Detection Tools ,Post attack IDS Measures & Evading IDS Systems. Penetration Testing, Categories of security assessments, Vulnerability Assessment, Types of Penetration Testing. Risk Management.

UNIT II 
Cryptography, Classical Cryptographic Techniques, Encryption, Decryption, Code Breaking: Methodologies, Cryptanalysis, Cryptography Attacks, Brute-Force Attack, Use of Cryptography. Public key cryptography, Principles of Public key Cryptosystems, Cryptographic Algorithms RSA, Data Encryption Standard (DES), RC4, RC5, RC6, Blowfish, Key Management, Diffie-Hellman key exchange, elliptic curve cryptography.

UNIT III 
Hash Functions, One-way Hash Functions, SHA (Secure Hash Algorithm), Authentication  Requirements, Authentication Functions, Kerberos. Message Authentication codes ,Message Digest  Functions, MD5, SSL (Secure Sockets Layer), SSH (Secure Shell), Algorithms and Security, Disk  Encryption, Government Access to Keys (GAK)
Digital Signature: Analysis, Components, Method, Applications, Standard, Algorithm: Signature Generation/Verification, ECDSA, EIgamal Signature Scheme, Digital Certificates.

UNIT IV 
Trojans and Backdoors: Overt and Covert Channels, Working, Types (Remote Access Trojans, Data-Sending Trojans, Destructive Trojans, Trojans, Proxy Trojans, FTP Trojans, Security Software Disablers). Viruses and Worms: Characteristics, Working, Infection Phase, Attack Phase. Sniffers: Definition, spoofing, Sniffing, Vulnerable Protocols, Types. Phishing: Methods, Process, Attacks Types (Man-in-the-Middle Attacks, URL Obfuscation Attacks, Hidden Attacks, Client-side Vulnerabilities, Deceptive Phishing, Malware-Based Phishing, DNSBased Phishing, Content-Injection Phishing, Search Engine Phishing). Web Application Security- Secured authentication mechanism, secured session management, Cross-site Scripting, SQL Injection and other vulnerabilities
Denial-of Service Attacks: Types of Attacks (Smurf Attack, Buffer Overflow Attack, Ping of Death Attack, Teardrop Attack, SYN Attack, SYN Flooding), DDoS Attack(Distributed DoS Attack.), Session Hijacking, Spoofing v Hijacking, TCP/IP hijacking, CAPTCHA Protection

UNIT V 
IP Security, Web Security, Firewalls: Types, Operation, Design Principles, Trusted Systems. Computer Forensics, Need, Objectives,Stages & Steps of Forensic Investigation in Tracking Cyber Criminals, Incident Handling. Hacking, Classes of Hacker (Black hats, grey hats, white hats, suicide hackers), Footprinting, Scanning (Types-Port, Network, Vulnerability), E-Mail Spiders, Overview of System Hacking Cycle.
List of Experiments: 1. Footprinting using footprinting tools(Open Source & Free)(ex-nslookup, ARIN, Whois, Google Earth etc..) 2. Scanning for vulnerabilities using (Angry IP, HPing2, IPScanner, Global Network Inventory Scanner, Net Tools Suite Pack.) 3. NetBIOS Enumeration Using NetView Tool, Nbtstat Enumeration Tool (Open Source). 4. Steganography using tools: Tool: Merge Streams, Image Hide, Stealth Files, Blindside, STools, Steghide, Steganos, Pretty Good Envelop, Stegdetect,. 5. Steganalysis - Stego Watch- Stego Detection Tool, StegSpy. 6. How to Detect Trojans by using – Netstat, fPort, TCPView, CurrPorts Tool, Process Viewer. 7. Lan Scanner using look@LAN, wireshark. 8. Understanding DoS Attack Tools- Jolt2 , Bubonic.c, Land and LaTierra, Targa,   Nemesy Blast, Panther2, Crazy Pinger, Some Trouble, UDP Flood, FSMax.



                                                   CS 7202 Simulation and Modeling   


Unit-I
Introduction to Modeling and Simulation Nature of Simulation. Systems , Models and Simulation, Continuous and Discrete Systems, system modeling, concept of simulation, Components of a simulation study, Principles used in modeling  Static and Dynamic physical models, Static and Dynamic Mathematical models Introduction to Static and Dynamic System simulation , Advantages ,Disadvantages and pitfalls of Simulation.

Unit-II
System Simulation and Continuous System Simulation Types of System Simulation, Monte Carlo Method, Comparision of analytical and Simulation methods, Numerical Computation techniques for Continuous and Discrete Models, Distributed Lag Models, Cobweb Model. Continuous System models, Analog and Hybrid computers, Digital-Analog Simulators, Continuous system simulation languages ,Hybrid simulation ,Real Time simulations.

Unit –III 
System Dynamics & Probability concepts in Simulation Exponential growth and decay models, logistic curves ,Generalization of growth models , System dynamics diagrams, Multi segment models , Representation of Time Delays. Discrete and Continuous probability functions, Continuous Uniformly Distributed Random Numbers, Generation of a Random numbers, Generating Discrete distributions, Non-Uniform  Continuously Distributed Random Numbers, Rejection Method.

Unit-IV 
Simulation of Queueing Systems and Discrete System Simulation Poisson arrival patterns, Exponential distribution, Service times, Normal Distribution Queuing Disciplines, Simulation of single and two server queue. Application of queuing theory in computer system. Discrete Events ,Generation of arrival patterns, Simulation programming tasks, Gathering statistics, Measuring occupancy and Utilization, Recording Distributions and Transit times .

Unit-V   
Introduction to Simulation languages and Analysis of Simulation output GPSS: Action times, Succession of events, Choice of paths, Conditional transfers, program control statements . SIMSCRIPT: Organization of SIMSCRIPT Program, Names & Labels, SIMSCRIPT statements . Estimation methods , Relication of Runs, Batch Means , Regenerative techniques , Time Series Analysis , Spectral Analysis and Autoregressive Processes.                    

List of Experiments:-

1. Simulate CPU scheduling algorithm using queueing system a) FCFS b) SJF c) Priority Algo
2. Simulate multiplexer/concentrator using queuing system
3. Simulate congestion control algorithms.
4. Simulate disk scheduling algorithms.
5. Simulate a Manufacturing shop and write a program in GPSS.
6. Simulate Telephone system model and write a program in SIMSCRIPT.
                                   

                                       CS 7203 Data Mining & Knowledge Discovery  


Unit-I 
Introduction, to Data warehousing, needs for developing data Warehouse, Data warehouse  systems and its Components, Design of Data Warehouse, Dimension and Measures, Data Marts:-Dependent Data Marts, Independents Data Marts & Distributed Data Marts, Conceptual  Modeling of Data Warehouses:-Star Schema, Snowflake Schema, Fact Constellations. Multidimensional Data Model & Aggregates.

Unit-II 
OLAP, Characteristics of OLAP System, Motivation for using OLAP, Multidimensional View and  Data Cube, Data Cube Implementations, Data Cube Operations, Guidelines for OLAP Implementation, Difference between OLAP & OLTP, OLAP Servers:-ROLAP, MOLAP, HOLAP Queries.

UNIT-III
 Introduction to Data Mining, Knowledge Discovery, Data Mining Functionalities, Data Mining System categorization and its Issues. Data Processing :- Data Cleaning, Data Integration and  Transformation. Data Reduction, Data Mining Statistics. Guidelines for Successful Data Mining.

Unit-IV
Association Rule Mining:-Introduction, Basic, The Task and a Naïve Algorithm, Apriori Algorithms, Improving the efficiency of the Apriori Algorithm, Apriori-Tid, Direct Hasing and Pruning(DHP),Dynamic Itemset Counting (DIC), Mining Frequent Patterns without Candidate  Generation(FP-Growth),Performance Evaluation of Algorithms,.

Unit-V 
Classification:-Introduction, Decision Tree, The Tree Induction Algorithm, Split Algorithms Based on Information Theory, Split Algorithm Based on the Gini Index, Overfitting and Pruning, Decision  Trees Rules, Naïve Bayes Method. Cluster Analysis:- Introduction, Desired Features of Cluster Analysis, Types of Cluster Analysis  Methods:- Partitional Methods, Hierarchical Methods, Density- Based Methods, Dealing with Large Databases. Quality and Validity of Cluster Analysis Methods.



                                      

RGPV B.E Computer Science 5th Sem (Grading System) Syllabus


                                                CS-501 – Data Communication 



UNIT :- I 
Introduction to data communication: Components , data representation ,data flow and basic model ,data representation ,Serial & Parallel transmission , Modes of data transmission, Encoding:Unipolar,Polar ,Bipolar line & block codes ,Data compression ,Frequency dependant codes, Run length encoding ,Relative encoding ,LZ Compression ,Image and multimedia compression. Review of analog & digital transmission methods, Nyquist Theorem .

UNIT:-2 
Multiplexing: FDM, TDM, WDM, Synchronous & Statistical TDM, North American digital multiplexing hierarchy, European TDM, Spread spectrum: Frequency Hopping & Direct Sequence spread spectrum. Terminal handling & polling. Switched Communication Networks: Circuit, Message, Packet & Hybrid Switching, Softswitch Architecture with their comparative study, X.25, ISDN.

UNIT:-3 
Physical Layer: Introduction, Interface, Standards, EIA-232-D, RJ-45, RJ-11, BNC connector & EIA-449 digital Interface: Connection, specifications & configuration, X.21 Modem: Types, features, signal constellation, block schematic, limited distance, dial up, baseband,line driver, Group Band and Null modems etc., ITU-T V-series modem standards Connecting Devices: Active and Passive Hubs, Repeaters, Bridges, Two & Three layer switches & Gateway. Study of various types of topology and their comparative study and introduction to queing theory.

UNIT:-4 
Transmission Media: Transmission line characterestics, distortions, Crosstalk, Guided Media: Twisted Pair, Baseband & Broadband Coaxial.Optical Fibre : Physics and velocity of propagation of light , Advantages & Disadvantages ,Block diagram ,Nodes and classification ,Comparision,losses , light source and detectors , Construction, Unguided media : Electromagnetic polarization ,Rays and wavesfront ,electromagnetic spectrum and radiation ,spherical wavefront and inverse square law , wave attenuation and absorption, optical properties of Radio waves , Terestrial Propagation of electromagnetic waves , skip distance , free - space path loss ,Radio waves , Microwave , Infrared & Satellite Communication system . Telephone Network: Components, LATAs, signaling and Services, Digital Subscriber Line: ADSL, HDSL, SDSL, VDSL, Cable TV network for data transfer.

UNIT:-5 
Transmission Errors : Content Error , flow integrity error , methods of error control ,Error detection ,Error correction ,Bit error rate , Error detection methods: Parity checking ,
Checksum Error Detection ,Cyclic Redudancy Check ,Hamming code , Interleaved codes , Block Parity , Convolution code, Hardware Implementation, Checksum .

                   

                                             CS-502 – Operating System  



Unit I
Introduction to System Programs & Operating Systems, Evolution of Operating System (mainframe, desktop, multiprocessor, Distributed, Network Operating System, Clustered & Handheld System), Operating system services, Operating system structure, System Call & System Boots, Operating system design & Implementations, System protection, Buffering & Spooling . Types of Operating System: Bare machine, Batch Processing, Real Time, Multitasking & Multiprogramming, time-sharing system.

Unit II
File: concepts, access methods, free space managements, allocation methods, directory systems, protection, organization ,sharing & implementation issues, Disk & Drum Scheduling, I/0 devices organization, I/0 devices organization, I/0 buffering, I/O Hardware, Kernel I/O subsystem, Transforming I/O request to hardware operations. Device Driver: Path managements, Sub module, Procedure, Scheduler, Handler, Interrupt Service Routine. File system in Linux & Windows

Unit III 
Process: Concept, Process Control Blocks(PCB), Scheduling criteria Preemptive & non Preemptive process scheduling, Scheduling algorithms, algorithm evaluation, multiple processor scheduling, real time scheduling, operations on processes, threads, inter process communication, precedence graphs, critical section problem, semaphores, classical problems of synchronization. Deadlock: Characterization, Methods for deadlock handling, deadlock prevention, deadlock avoidance, deadlock detection, recovery from deadlock, Process Management in Linux.

Unit IV 
Memory Hierarchy, Concepts of memory management, MFT & MVT, logical and physical address space, swapping, contiguous and non-contiguous allocation, paging, segmentation, and paging combined with segmentation. Structure & implementation of Page table.Concepts of virtual memory, Cache Memory Organization, demand paging, page replacement algorithms, allocation of frames, thrashing, demand segmentation.

Unit V 
Distributed operating system:-Types, Design issues, File system, Remote file access, RPC, RMI, Distributed Shared Memory(DSM), Basic Concept of Parallel Processing & Concurent Programming Security & threats protection: Security violation through Parameter, Computer Worms & Virus, Security Design Principle, Authentications, Protection Mechanisms. introduction to Sensor network and parallel operating system. Case study of Unix, Linux & Windows,


List of Experiment 

1. Write a program to implement FCFS CPU scheduling algorithm.
2. Write a program to implement SJF CPU scheduling algorithm.
3. Write a program to implement Priority CPU Scheduling algorithm.
4. Write a program to implement Round Robin CPU scheduling algorithm.
5. Write a program to compare various CPU Scheduling Algorithms over different Scheduling Criteria.
6. Write a program to implement classical inter process communication problem(producer consumer).
7. Write a program to implement classical inter process communication problem(Reader Writers).
8. Write a program to implement classical inter process communication problem(Dining_Philosophers).
 9. Write a program to implement & Compare various page replacement algorithm.
10. Write a program to implement & Compare various Disk & Drum scheduling Algorithms
11. Write a program to implement Banker’s algorithms.
12. Write a program to implement Remote Proccedure Call(RPC).
13. Write a Devices Drivers for any Device or pheriperal.
       


                                          CS-503 – Database Management System   



Unit I 
DBMS Concepts and architecture Introduction, Database approach v/s Traditional file accessing approach, Advantages, of database systems, Data models, Schemas and instances, Data independence, Data Base Language and interfaces, Overall Database Structure, Functions of DBA and designer, ER data model:Entitles and attributes, Entity types, Defining the E-R diagram,Concept of Generalization, Aggregation and Specialization. transforming ER diagram into the tables. Various other data models object oriented data Model, Network data model, and Relational data model, Comparison between the three types of models.

Unit II 
Relational Data models: Domains, Tuples, Attributes, Relations, Characteristics of relations, Keys, Key attributes of relation, Relational database, Schemas, Integrity constraints. Referential integrity, Intension and Extension, Relational Query languages:SQL-DDL, DML, integrity constraints, Complex queries, various joins, indexing, triggers, ssertions,Relational algebra and relational calculus, Relational algebra operations like select, Project,Join, Division, outer union. Types of relational calculus i.e. Tuple oriented and domain oriented relational calculus and its operations.

Unit III
 Data Base Design: Introduction to normalization, Normal forms, Functional dependency, Decomposition, Dependency preservation and losless join, problems with null valued and dangling tuples, multivalued dependencies.Query Optimization: Introduction, steps of optimization, various algorithms to implement select, project and join operations of relational algebra, optimization methods: heuristic based, cost estimation based.

Unit IV 
Transaction Processing Concepts: - Transaction System, Testing of Serilizability, Serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures. Log based recovery. Checkpoints deadlock handling.Concurrency Control Techniques: - Concurrency Control, locking Techniques for concurrency control, time stamping protocols for concurrency control, validation based protocol, multiple granularity. Multi version schemes, Recovery with concurrent transaction. Introduction to Distributed databases, datamining, datawarehousing, Object Technology and DBMS, Comparative study of OODBMS Vs DBMS . Temporal, Deductive, Multimedia, Web & Mobile database .

Unit V 
Study of Relational Database Management Systems through Oracle/Postgres SQL/MySQL: Architecture, physical files, memory structures, background process. Concept of table
spaces, segments, extents and block. Dedicated server, multi threaded server. Distributed database, database links, and snapshot. Data dictionary, dynamic performance view.Security, role management, privilege management, profiles, invoker defined security model. SQL queries, Data extraction from single, multiple tables equi-join, non equi-join, self-join, outer join. Usage of like, any, all, exists, in Special operators. Hierarchical queries, inline queries, flashback queries. Introduction of ANSI SQL, anonymous block, nested anonymous block, branching and looping constructs in ANSI SQL. Cursor management: nested and parameterized cursors, Oracle exception handling mechanism. Stored procedures, in, out, in out type parameters,usage of parameters in procedures. User defined functions their limitations. Triggers, mutating errors, instead of triggers. Suggested list of experiments: -

Lab Assignments:

1. Delete duplicate row from the table.
2. Display the alternate row from table.
 3. Delete alternate row from table.
4. Update multiple rows in using single update statement.
5. Find the third highest paid and third lowest paid salary.
6. Display the 3rd, 4th, 9th rows from table.
7. Display the ename, which is start with j, k, l or m.
8. Show all employees who were hired the first half of the month.
9. Display the three record in the first row and two records in the second row and one record in the third row in a single sql statements.
10. Write a sql statements for rollback commit and save points.
11. Write a pl/sql for select, insert, update and delete statements.
12. Write a pl/sql block to delete a record. If delete operation is successful return 1 else return 0.
13. Display name, hire date of all employees using cursors.
14. Display details of first 5 highly paid employees using cursors.
15. Write a database trigger which fires if you try to insert, update, or delete after 7’o’ clock.
16. Write a data base trigger, which acts just like primary key and does not allow duplicate values.
17. Create a data base trigger, which performs the action of the on delete cascade.
18. Write a data base trigger, which should not delete from emp table if the day is Sunday.
19. In this subject the students are supposed to prepare a small database application in complete semester like financial accounting system, Railway reservation system, institute timetable management system. Student record system, library management system, hospital management system etc. in RDBMS as follows: Section A: Solving the case studies using ER datamodel (design of the database) Section B: Implement a miniproject for the problem taken in section A.



                                   CS-504 – Computer Graphics & Multimedia        



Unit-I 
Introduction to raster scan displays, Pixels, frame buffer, Vector & Character generation, random scan systems, Graphics Primitives, Display devices, Display file structure, ScanConversion techniques, line drawing: simple DDA, Bresenham’s Algorithm, Circle Drawing Algorithms. Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms

Unit-II 
2D transformation: Translation, Rotation, Scaling, Shearing, Reflection. Inverse Transformation, Homogenous coordinate system, Matrices Transformation, Composite Transformation. Windowing & Clipping: World Coordinate System, Screen Coordinate System, Viewing Transformation, Line Clipping, Cohen Sutherland, Midpoint Line clipping algorithms, Polygon Clipping: Sutherland –Hodgeman, Weiler-Atherton algorithms.

Unit-III 
3D transformations: translation, rotation, scaling. Parallel & Perspective Projection,Types of Parallel & Perspective Projection. Hidden Surface elimination: Depth comparison, Back face detection algorithm, Painters algorithm, Z-buffer algorithm. Curve generation, Bezier and B-spline methods.

Unit-IV
 Basic Illumination Model, Diffuse reflection, Specular reflection, Phong Shading Gourand shading, ray tracing, color models like RGB, YIQ, CMY, HSV.

Unit –V 
Multimedia System: An Introduction, Multimedia hardware, Multimedia System Architecture. Data & File Format standards. i.e RTF, TIFF, MIDI, JPEG, DIB, MPEG,Audio: digital audio, MIDI, processing sound, sampling, compression. Video: Avi, 3GP,MOV, MPEG , compression standards, compression through spatial and temporal redundancy. Multimedia Authoring .

LIST OF PRACTICAL

1. A BRIEF STUDY OF VARIOUS TYPES OF INPUT AND OUTPUT DEVICES.
2. PROGRAM TO IMPLEMENT A LINE USING SLOPE INTERCEPT FORMULA.
3. PROGRAM TO IMPLEMENT LINE USING DDA ALGORITHM.
4 .PROGRAM TO IMPLEMENT LINE USING BRESENHAM’S ALGORITHM.
5. PROGRAM TO IMPLEMENT CIRCLE USING MID POINT ALGORITHM.
6. PROGRAM TO IMPLEMENT TRANSLATION OF A LINE AND TRIANGLE
7. PROGRAM TO IMPLEMENT ROTATION OF A LINE AND TRIANGLE
8. PROGRAM TO IMPLEMENT SCALING TRANSFORMATION.
9. PROGRAM TO IMPLEMENT 3D ROTATION ABOUT AN ARBITRARY AXIS .
10. PROGRAM TO IMPLEMENT COHEN SUTHERLAND LINE CLIPPING .
11. PROGRAM TO IMPLEMENT SUTHERLAND HODGMAN POLYGON CLIPPING .
12. PROGRAM TO DRAW BEZIER CURVE. 13. PROGRAM TO DRAW B-SPLINE CURVE .                    



                                            CS-505 – Theory of Computation  



UNIT 1:
Automata: Basic machine, FSM , Transition graph, Transition matrix, Deterministic and nondeterministic FSM’S, Equivalence of DFA and NDFA, Mealy & Moore machines, minimization of finite automata, Two-way finite automata. Regular Sets and Regular Grammars: Alphabet, words, Operations, Regular sets, Finite automata and regular expression, Myhill- Nerode theorem Pumping lemma and regular sets, Application of pumping lemma, closure properties of regular sets.

UNIT 2:
Context –Free Grammars: Introduction to CFG, Regular Grammars, Derivation trees and Ambiguity, Simplification of Context free grammars, Normal Forms (Chomsky Normal Form and Greibach Normal forms).

UNIT 3:
 Pushdown Automata: Definition of PDA, Deterministic Pushdown Automata, PDA corresponding to given CFG, CFG corresponding to a given PDA. Context Free Languages: The pumping lemma for CFL’s, Closure properties of CFL’s, Decision problems involving CFL’s.

UNIT 4:
Turing Machines: Introduction, TM model, representation and languages acceptability of TM Design of TM,Universal TM & Other modification, Church’s hypothesis, composite & iterated TM. Turing machine as enumerators.Properties of recursive & recursively enumerable languages,Universal Turing machine

UNIT 5: 
Tractable and Untractable Problems: P, NP, NP complete and NP hard problems, examples of these problems like satisfy ability problems, vertex cover problem, Hamiltonian path problem, traveling sales man
problem, Partition problem etc.


                                    CS-506 – Computer Programming V (Unix/Linux-Lab.)



Overview of Unix/Linux: - Concepts, Unix/Linux Installation Process, Hardware Requirements for Unix/Linux ,Advantages of Unix/Linux, Reasons for Popularity and Success of Linux/Unix Operating System, Features of Linux/Unix Operating System, Kernel, Kernel Functions, The Shell Basic Commands, Shell Programming:-Shell Variables, Branching Control Structures, Loop-Control Structure, Continue and break Statements, Sleep Command, Debugging Script. Use of Linux as web-server, file server, directory server, application server, DNS server, SMTP server, Firewall, Proxy server.
File System: - Definition of File System, Defining Geometry, Disk Controller, Solaris File System, Disk Based File Systems, Network-Based File Systems, Virtual File systems, UFS File System, The Boot Block, The Super Block, The Inode, Tuning File System, Repairing File System.
Process Control: - Viewing a Process, Command to display Process, Process Attributes, Process States, Process Fields, PS Commands options, PGREP, PRSTAT, CDE Process Manager, Scheduling Process, Scheduling Priorities, Changing the Priority of a time-sharing process, Killing Process.
System Security: - Physical Security, Controlling System Access, Restricted Shells Controlling File Access, File Access Commands, Access Control List(ACLs), Setting ACL Entries, Modifying ACL entries on a file, Deleting ACL entries on a file, Restricting FTP, Securing Super User Access, Restricting Root Access, Monitoring super user Access, TCP Wrappers.
Dynamic Host Configuration Protocol: - Introduction, DHCP Leased Time, DHCP Scopes, DHCP IP Address, Allocation Types, Planning DHCP Deployment, DHCP Configuration files, Automatic Startup of DHCP Server, Configuration of DHCP Clients, Manually Configuring the DHCP.
Case Study: - Installation of Linux, Customization of Linux, Installation of SAMBA, APACHE, TOMCAT, Send MAIL, Postfix, Implementation of DNS, LDAP services, Firewall, Proxy server


List of Experiments:- 

1. To Study basic & User status Unix/Linux Commands.
2. Study & use of commands for performing arithmetic operations with Unix/Linux.
3. Create a file called wlcc.txt with some lines and display how many lines, words and characters are present in that file. 4. Append ten more simple lines to the wlcc.txt file created above and split the appended file into 3 parts. What will be the names of these split files? Display the contents of each of these files. How many lines will be there on the last file?
5. Given two files each of which contains names of students. Create a program to display only those names that are found on both the files.
6. Create a program to find out the inode number of any desired file.
7. Study & use of the Command for changing file permissions.
8. Write a pipeline of commands, which displays on the monitor as well as saves the information about the number of users using the system at present on a file called usere.ux.
9. Execute shell commands through vi editor.
10. Installation, Configuration & Customizations of Unix/Linux.
11. Write a shell script that accepts any number of arguments and prints them in the reverse order.
12. Write a shell script to find the smallest of three numbers that are read from the keyboard.
13. Write a shell script that reports the logging in of a specified user within one minute after he/she logs in. The script automatically terminates if the specified user does not login during a specified period of time.
14. Installation of SAMBA, APACHE, TOMCAT.
15. Implementation of DNS, LDAP services,
16. Study & installation of Firewall & Proxy server

RGPV B.E Computer Science 3rd Sem (Grading System) Syllabus

                                     B.E. 301 - ENGINEERING MATHEMATICS II 


Unit I 
 Fourier Series: Introduction of Fourier series , Fourier series for Discontinuous functions, Fourier series for even and odd function, Half range series   Fourier Transform: Definition and properties of Fourier transform, Sine and Cosine transform.

Unit II 
Laplace Transform: Introduction of Laplace Transform, Laplace Transform of elementary functions, properties of Laplace Transform, Change of scale property, second shifting property, Laplace transform of the derivative, Inverse Laplace transform & its properties, Convolution theorem, Applications of L.T. to solve the ordinary differential equations  

Unit III 
Second Order linear differential equation with variable coefficients : Methods one integral is known, removal of first derivative, changing of independent variable and variation of parameter, Solution by Series Method

Unit IV 
Linear  and Non Linear partial differential equation of first order: Formulation of  partial differential equations, solution of equation by direct integration, Lagrange’s Linear equation,  charpit’s method. Linear partial differential equation of second and higher order: Linear homogeneous and Non homogeneous partial diff. equation of nth order with constant coefficients. Separation of variable method for the solution of wave and heat equations

Unit V 
Vector Calculus: Differentiation of vectors, scalar and vector point function, geometrical meaning of Gradient, unit normal vector and directional derivative, physical interpretation of divergence and Curl. Line integral, surface integral and volume integral, Green’s, Stoke’s and Gauss divergence theorem
       
 

                                             CS- 302 Discrete Structures  


Unit-I
Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction.

Unit-II
Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results.

Unit-III
Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. Introduction to finite state machine Finite state machines as models of physical system equivalence machines, Finite state machines as language recognizers

Unit-IV
Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs.

Unit V
Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices. Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimonial Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence Relation and Recursive algorithms , Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions , Generating functions , Solution by method of generating functions,
   
 

                                          CS- 303 Digital Circuit & System  


Unit I 
Number systems & codes, Binary arithmetic , Boolean algebra and switching function. Minimization of switching function, Concept of prime implicant , Karnaugh map method, Quine & McCluskey's method, Cases with don't care terms, Multiple output switching function.

Unit II  
Introduction to logic gates, Universal gate, Half adder, Half subtractor, Full adder, Full subtractor circuits, Series & parallel addition , BCD adders, Look-ahead carry generator.

Unit III  
Linear wave shaping circuits, Bistable, Monostable & Astable multivibrator, Schmitt trigger circuits & Schmitt-Nand gates. Logic families : RTL, DTL, All types of TTL circuits , ECL, I2L , PMOS, NMOS & CMOS logic, Gated flip-flops and gated multivibrator , Interfacing between TTL to MOS.

Unit IV  
Decoders, Encoders, Multiplexers, Demultiplexers, Introduction to various semiconductor memories & designing with ROM and PLA. Introduction to Shift Registers, Counters, Synchronous & asynchronous counters, Designing of Combinational circuits like code converters.

Unit V  
Introduction of Analog to Digital & Digital to Analog converters, sample & hold circuits and   V-F converters.

List of experiment (Expandable)

1. To study and test of operation of all logic gates for various IC’s (IC#7400,IC#7403,IC# 7408,IC#74332,IC#7486).
2. Verification of Demorgan’s theorem.
3. To construct of half adder and full adder
4. To construct of half subtractor and full subtractor circuits
5. Verification of versatility of NAND gate.
6. Verification of versatility of NOR gate.
7. Designing and verification of property of full adder.
8. Design a BCD to excess-3 code converter.
9. Design a Multiplexer/ Demultiplexer.        
   

       
                                       CS- 304 Electronics Devices & Circuits  


Unit I  
Semiconductor device, theory of P-N junction, temperature dependence and break down characteristics, junction capacitances. Zener diode, Varactor diode, PIN diode, LED, Photo diode, Transistors BJT, FET, MOSFET, types, working principal, characteristics, and region of operation, load line biasing method. Transistor as an amplifier, gain, bandwidth, frequency response, h- parameters equivalent, type of amplifier.

Unit II 
 Feedback amplifier, negative feedback, voltage-series, voltage shunt, current series and current shunt feedback, Sinusoidal oscillators, L-C (Hartley-Colpitts) oscillators, RC phase shift, Wien bridge, and Crystal oscillators. Power amplifiers, class A, class B, class A B, C amplifiers, their efficiency and power Dissipation.

Unit III 
Switching characteristics of diode and transistor, turn ON, OFF time, reverse recovery time, transistor as switch, Multivibrators, Bistable, Monostable, Astable multivibarators. Cllipers and clampers, Differential amplifier, calculation of differential, common mode gain and CMRR using hparameters, Darlington pair, Boot strapping technique. Cascade and cascode amplifier.

Unit IV
Operational amplifier characteristics, slew rate, full power bandwidth, offset voltage, bias current, application ,inverting , non inverting amplifier , summer , averager , differentiator, integrator, differential amplifier , instrumentation amplifier , log and antilog amplifier , voltage to current and current to voltage converters , comparators Schmitt trigger , active filters, 555 timer and its application.

Unit V
Regulated power supplies., Series and shunt regulators, current limiting circuits, Introduction to IC voltage regulators, fixed and adjustable switching regulators, SMPS ,UPS

List of Experiments (Expandable):
1. Diode and Transistor characteristics
2. Transistor Applications (Amplifier and switching)
3. OP-Amp and its Applications
4. 555 timer and its Applications        
 

                                                    CS- 305 Data Structures   


Unit I  
Introduction: Basic Terminology, Data types and its classification, Algorithm complexity notations like big Oh,,. Array Definition, Representation and Analysis of Arrays, Single and Multidimensional Arrays, Address calculation, Array as Parameters, Ordered List and operations, Sparse Matrices, Storage pools, Garbage collection. Recursion-definition and processes, simulating recursion, Backtracking, Recursive algorithms, Tail recursion, Removal of recursion. Tower of Hanoi Problem.

UNIT II  
Stack, Array Implementation of stack, Linked Representation of Stack, Application of stack: Conversion of Infix to Prefix and Postfix Expressions and Expression evaluation, Queue, Array and linked implementation of queues, Circular queues, D-queues and Priority Queues. Linked list, Implementation of Singly Linked List, Two-way Header List, Doubly linked list, Linked List in Array. Generalized linked list, Application: Garbage collection and compaction, Polynomial Arithmetic.

UNIT III  
Trees: Basic terminology, Binary Trees, , algebraic Expressions, Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary trees, Traversing Binary trees, Threaded Binary trees, Binary Search Tree (BST ), AVL Trees, B-trees. Application: Algebraic Expression, Huffman coding Algorithm.

UNIT IV
Internal and External sorting ,Insertion Sort, Bubble Sort, selection sort Quick Sort, Merge Sort, Heap Sort, Radix sort, Searching & Hashing: Sequential search, binary search, Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table Implementation. Symbol Table, Static tree table, Dynamic Tree table.

Unit V
Graphs: Introduction, Sequential Representations of Graphs, Adjacency Matrices, Traversal, Connected Component and Spanning Trees, Minimum Cost Spanning Trees.

List of Experiments (expandable): Programs in C relating to different theory units.      
 


                                                          CS- 306 Java Technology   


UNIT-I
Basic Java Features - C++ Vs JAVA, JAVA virtual machine, Constant & Variables, Data Types, Class, Methods, Objects, Strings and Arrays, Type Casting, Operators, Precedence relations, Control Statements, Exception Handling, File and Streams, Visibility, Constructors, Operator and Methods Overloading, Static Members, Inheritance: Polymorphism, Abstract methods and Classes

UNIT–II  
Java Collective Frame Work - Data Structures: Introduction, Type-Wrapper Classes for Primitive Types, Dynamic Memory Allocation, Linked List, Stack, Queues, Trees, Generics: Introduction, Overloading Generic Methods, Generic Classes, Collections: Interface Collection and Class Collections, Lists, Array List and Iterator, Linked List, Vector. Collections Algorithms: Algorithm sorts, Algorithm shuffle, Algorithms reverse, fill, copy, max and min Algorithm binary Search, Algorithms add All, Stack Class of Package java. Util, Class Priority Queue and Interface Queue, Maps, Properties Class, Un-modifiable Collections.

UNIT–III
Advance Java Features - Multithreading: Thread States, Priorities and Thread Scheduling, Life Cycle of a Thread, Thread Synchronization, Creating and Executing Threads, Multithreading with GUI, Monitors and Monitor Locks. Networking: Manipulating URLs, Reading a file on a Web Server, Socket programming, Security and the Network, RMI, Networking, Accessing Databases with JDBC: Relational Database, SQL, MySQL, Oracle

UNIT–IV
Advance Java Technologies - Servlets: Overview and Architecture, Setting Up the Apache Tomcat Server, Handling HTTP get Requests, Deploying a web Application, Multitier Applications, Using JDBC from a Servlet, Java Server Pages (JSP): Overview, First JSP Example, Implicit Objects, Scripting, Standard Actions, Directives, Multimedia: Applets and Application: Loading, Displaying and Scaling Images, Animating a Series of Images, Loading and playing Audio clips

UNIT–V  
Advance Web/Internet Programming (Overview): J2ME, J2EE, EJB, XML.

List of Program to be perform (Expandable) 

1. Installation of J2SDK
2. Write a program to show Scope of Variables
3. Write a program to show Concept of CLASS in JAVA
4. Write a program to show Type Casting in JAVA
5. Write a program to show How Exception Handling is in JAVA
6. Write a Program to show Inheritance
7. Write a program to show Polymorphism
8. Write a program to show Access Specifiers (Public, Private, Protected) in JAVA
9. Write a program to show use and Advantages of CONTRUCTOR
10. Write a program to show Interfacing between two classes
11. Write a program to Add a Class to a Package
12. Write a program to show Life Cycle of a Thread
13. Write a program to demonstrate AWT.
14. Write a program to Hide a Class
15. Write a Program to show Data Base Connectivity Using JAVA
16. Write a Program to show “HELLO JAVA ” in Explorer using Applet
17. Write a Program to show Connectivity using JDBC
18. Write a program to demonstrate multithreading using Java.
19. Write a program to demonstrate applet life cycle.
20. Write a program to demonstrate concept of servlet.                                          
 

                             CS-307 Self Study (Internal Assessment)   

Objective of Self Study: is to induce the student to explore and read technical aspects of his area of interest / hobby or new topics suggested by faculty.
Evaluation will be done by assigned faculty based on report/seminar presentation and viva.                                            


                         CS-308 Seminar / Group Discussion(Internal Assessment)  


Objective of GD and seminar is to improve the MASS COMMUNICATION and CONVINCING/ understanding skills of students and it is to give student an opportunity to exercise their rights to express themselves.
Evaluation will be done by assigned faculty based on group discussion and power point presentation.   
 
© Copyright 2022Rajiv Gandhi Proudyogiki Vishwavidyalaya All Rights Reserved.