Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal
Branch- Common to All Discipline
ES301 | Energy & Environmental Engineering | 3L-1T-0P | 4 Credits |
The objective of this Course is to provide an introduction to energy systems and renewable energy resources, with a scientific examination of the energy field and an emphasis on alternative energy sources and their technology and application.
Module 1: Introduction to Energy Science:
Introduction to energy systems and resources; Introduction to Energy, sustainability & the environment; Overview of energy systems, sources, transformations, efficiency, and storage; Fossil fuels (coal, oil, oil-bearing shale and sands, coal gasification) - past, present & future, Remedies & alternatives for fossil fuels - biomass, wind, solar, nuclear, wave, tidal and hydrogen; Sustainability and environmental trade-offs of different energy systems; possibilities for energy storage or regeneration (Ex. Pumped storage hydro power projects, superconductor-based energy storages, high efficiency batteries)
Module2: Ecosystems
Concept of an ecosystem; Structure and function of an ecosystem; Producers, consumers and decomposers; Energy flow in the ecosystem; Ecological succession; Food chains, food webs and ecological pyramids; Introduction, types, characteristic features, structure and function of the following ecosystem (a.)Forest ecosystem (b) Grassland ecosystem (c) Desert ecosystem (d) Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
Module 3: Biodiversity and its conservation
Introduction – Definition: genetic, species and ecosystem diversity; Bio- geographical classification of India; Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values; Biodiversity at global, National and local levels; India as a mega-diversity nation; Hot-sports of biodiversity; Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts; Endangered and endemic species of India; Conservation of biodiversity: In-situ and Ex-situ conservation of biodiversity.
Module 4: Environmental Pollution
Definition, Cause, effects and control measures of Air pollution, Water pollution, Soil pollution, Marine pollution, Noise pollution, Thermal pollution, Nuclear hazards; Solid waste Management: Causes, effects and control measures of urban and industrial wastes; Role of an individual in prevention of pollution; Pollution case studies; Disaster management: floods, earthquake, cyclone and landslides.
Module 5: Social Issues and the Environment
From Unsustainable to Sustainable development; Urban problems related to energy; Water conservation, rain water harvesting, watershed management; Resettlement and rehabilitation of people; its problems and concerns. Case Studies
Environmental ethics: Issues and possible solutions. Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Case Studies Wasteland reclamation; Consumerism and waste products; Environment Protection Act; Air (Prevention and Control of Pollution) Act; Water (Prevention and control of Pollution) Act; Wildlife Protection Act; Forest Conservation Act; Issues involved in enforcement of environmental legislation; Public awareness.
Module 6: Field work
Visit to a local area to document environmental assets- river/forest/grassland/hill/mountain
Visit to a local polluted site-Urban/Rural/Industrial/Agricultural
Study of common plants, insects, birds.
Study of simple ecosystems-pond, river, hill slopes, etc.
Brunner R.C., 1989, Hazardous Waste Incineration, McGraw Hill Inc.
Clark R.S., Marine Pollution, Clanderson Press Oxford (TB).
Cunningham, W.P. Cooper, T.H. Gorhani, E & Hepworth, M.T. 2001, Environmental Encyclopedia, Jaico Publ. House, Mumabai,
De A.K., Environmental Chemistry, Wiley Eastern Ltd.
Trivedi R.K., Handbook of Environmental Laws, Rules Guidelines, Compliances and Standards’, Vol I and II, Enviro Media (R)
Boyle, Godfrey, Bob Everett, and Janet Ramage (Eds.) (2004), Energy Systems and Sustainability: Power for a Sustainable Future. Oxford University Press.
Schaeffer, John (2007), Real Goods Solar Living Sourcebook: The Complete Guide to Renewable Energy Technologies and Sustainable Living, Gaiam
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, III-Semester CS302 Discrete Structure
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.
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.
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
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.
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.
C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.
Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill.
Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.
Bisht, “Discrete Mathematics”,Oxford University Press
Biswal,”Discrete Mathematics & Graph Theory”, PHI
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, III-Semester CS303 Data Structure
Review of C programming language.Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data structures operations and its cost estimation. Introduction to linear data structures- Arrays, Linked List: Representation of linked list in memory, different implementation of linked list. Circular linked list, doubly linked list, etc. Application of linked list: polynomial manipulation using linked list, etc.
Stacks: Stacks as ADT, Different implementation of stack, multiple stacks. Application of Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Dqueue and Priority Queue, Queue simulation, Application of queues.
Tree: Definitions - Height, depth, order, degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B* tree and red-black tree.
Graphs: Introduction, Classification of graph: Directed and Undirected graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)- Kruskal, Prim’s algorithms. Dijkstra’s shortest path algorithm; Comparison between different graph algorithms. Application of graphs.
Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sort, Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort; comparison of various sorting techniques. Searching: Basic Search Techniques: Sequential search, Binary search, Comparison of search methods. Hashing & Indexing. Case Study: Application of various data structures in operating system, DBMS etc.
AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”, Prentice Hall India.
Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson Education.
Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
Jean – Paul Trembly , Paul Sorenson, “An Introduction to Structure with application”, TMH.
Richard, GilbergBehrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, III-Semester CS304 Digital Systems
:Bistable, Monostable, Astable, Schmitt trigger, IC 555 & Its applications. TTL, PMOS, CMOS and NMOS logic. Interfacing between TTL to MOS.
Morris Mano, Digital Circuits & Logic Design, PHI
Gothman, Digital Electronics, PHI
Tocci, Digital Electronics, PHI
Mavino& Leach, Digital Principles & Applications, PHI
Taub and schilling, Digital Integrated electronics.
Simon Haykin, Introductionto Analog& Digital Communication, Wiley.
Lathi B.P., Modern analog& digital communication , Oxford University.
To study and verify the truth tables of various Logic gates
To verify the properties of NAND and NOR gates as Universal Building Blocks.
Simplification and implementation of a Boolean function
Implementation of basic Boolean arithmetic logic circuits such as Half-adder, Half-subtractor, Full adder and Full subtractor
Conversion from Binary to Gray and Gray to Binary code
To construct a binary multiplier using combinational logic and to verify with the truth table
To verify 2-bit Magnitude comparator for all possible conditions
Generation of various logical functions using 8-to-1 multiplexer
Construction of a 4-bit ripple counter and study of its operation
Operation of IC-555 Timer as Monostable, Astable and Bistablemultivibrators
To characterize binary ladder type digital to analog (D/A) and analog to digital (A/D) convertor
Comparison of various Logic families
Design and implementation of various types of flip-flops using JK flip-flop
To study natural sampling of continuous time waveforms using different sampling rates
To study Pulse-Code modulation with Time-division multiplexing (PCM-TDM)
To study generation and detection of BPSK and QPSK waveforms
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, III-Semester CS305 Object Oriented Programming & Methodology
Introduction to Object Oriented Thinking & Object Oriented Programming: Comparison with Procedural Programming, features of Object oriented paradigm– Merits and demerits of OO methodology; Object model; Elements of OOPS, IO processing.
Encapsulation and Data Abstraction- Concept of Objects: State, Behavior & Identity of an object; Classes: identifying classes and candidates for Classes Attributes and Services, Access modifiers, Static members of a Class, Instances, Message passing, and Construction and destruction of Objects.
Relationships – Inheritance: purpose and its types, ‘is a’ relationship; Association, Aggregation. Concept of interfaces and Abstract classes.
Polymorphism: Introduction, Method Overriding & Overloading, static and run time Polymorphism.
Strings, Exceptional handling, Introduction of Multi-threading and Data collections. Case study like: ATM, Library management system.
Timothy Budd, “An Introduction to Object-Oriented Programming”, Addison- Wesley Publication, 3rd Edition.
Cay S. Horstmann and Gary Cornell, “Core Java: Volume I, Fundamentals”, Prentice Hall publication.
G. Booch, “Object Oriented Analysis& Design”, Addison Wesley.
James Martin, “Principles of Object Oriented Analysis and Design”, Prentice Hall/PTR.
Peter Coad and Edward Yourdon, “Object Oriented Design”, Prentice Hall/PTR.
Herbert Schildt, “Java 2: The Complete Reference”, McGraw-Hill Osborne Media,
7th Edition.
=======Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal
Branch- Common to All Discipline
ES301 | Energy & Environmental Engineering | 3L-1T-0P | 4 Credits |
The objective of this Course is to provide an introduction to energy systems and renewable energy resources, with a scientific examination of the energy field and an emphasis on alternative energy sources and their technology and application.
Module 1: Introduction to Energy Science:
Introduction to energy systems and resources; Introduction to Energy, sustainability & the environment; Overview of energy systems, sources, transformations, efficiency, and storage; Fossil fuels (coal, oil, oil-bearing shale and sands, coal gasification) - past, present & future, Remedies & alternatives for fossil fuels - biomass, wind, solar, nuclear, wave, tidal and hydrogen; Sustainability and environmental trade-offs of different energy systems; possibilities for energy storage or regeneration (Ex. Pumped storage hydro power projects, superconductor-based energy storages, high efficiency batteries)
Module2: Ecosystems
Concept of an ecosystem; Structure and function of an ecosystem; Producers, consumers and decomposers; Energy flow in the ecosystem; Ecological succession; Food chains, food webs and ecological pyramids; Introduction, types, characteristic features, structure and function of the following ecosystem (a.)Forest ecosystem (b) Grassland ecosystem (c) Desert ecosystem (d) Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
Module 3: Biodiversity and its conservation
Introduction – Definition: genetic, species and ecosystem diversity; Bio- geographical classification of India; Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values; Biodiversity at global, National and local levels; India as a mega-diversity nation; Hot-sports of biodiversity; Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts; Endangered and endemic species of India; Conservation of biodiversity: In-situ and Ex-situ conservation of biodiversity.
Module 4: Environmental Pollution
Definition, Cause, effects and control measures of Air pollution, Water pollution, Soil pollution, Marine pollution, Noise pollution, Thermal pollution, Nuclear hazards; Solid waste Management: Causes, effects and control measures of urban and industrial wastes; Role of an individual in prevention of pollution; Pollution case studies; Disaster management: floods, earthquake, cyclone and landslides.
Module 5: Social Issues and the Environment
From Unsustainable to Sustainable development; Urban problems related to energy; Water conservation, rain water harvesting, watershed management; Resettlement and rehabilitation of people; its problems and concerns. Case Studies
Environmental ethics: Issues and possible solutions. Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust. Case Studies Wasteland reclamation; Consumerism and waste products; Environment Protection Act; Air (Prevention and Control of Pollution) Act; Water (Prevention and control of Pollution) Act; Wildlife Protection Act; Forest Conservation Act; Issues involved in enforcement of environmental legislation; Public awareness.
Module 6: Field work
Visit to a local area to document environmental assets- river/forest/grassland/hill/mountain
Visit to a local polluted site-Urban/Rural/Industrial/Agricultural
Study of common plants, insects, birds.
Study of simple ecosystems-pond, river, hill slopes, etc.
Brunner R.C., 1989, Hazardous Waste Incineration, McGraw Hill Inc.
Clark R.S., Marine Pollution, Clanderson Press Oxford (TB).
Cunningham, W.P. Cooper, T.H. Gorhani, E & Hepworth, M.T. 2001, Environmental Encyclopedia, Jaico Publ. House, Mumabai,
De A.K., Environmental Chemistry, Wiley Eastern Ltd.
Trivedi R.K., Handbook of Environmental Laws, Rules Guidelines, Compliances and Standards’, Vol I and II, Enviro Media (R)
Boyle, Godfrey, Bob Everett, and Janet Ramage (Eds.) (2004), Energy Systems and Sustainability: Power for a Sustainable Future. Oxford University Press.
Schaeffer, John (2007), Real Goods Solar Living Sourcebook: The Complete Guide to Renewable Energy Technologies and Sustainable Living, Gaiam
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, III-Semester CS302 Discrete Structure
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.
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.
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
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.
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.
C.L.Liu, “Elements of Discrete Mathematics” Tata Mc Graw-Hill Edition.
Trembley, J.P & Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill.
Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill.
Bisht, “Discrete Mathematics”,Oxford University Press
Biswal,”Discrete Mathematics & Graph Theory”, PHI
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, III-Semester CS303 Data Structure
Review of C programming language.Introduction to Data Structure: Concepts of Data and Information, Classification of Data structures, Abstract Data Types, Implementation aspects: Memory representation. Data structures operations and its cost estimation. Introduction to linear data structures- Arrays, Linked List: Representation of linked list in memory, different implementation of linked list. Circular linked list, doubly linked list, etc. Application of linked list: polynomial manipulation using linked list, etc.
Stacks: Stacks as ADT, Different implementation of stack, multiple stacks. Application of Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression, Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue, Concept of Dqueue and Priority Queue, Queue simulation, Application of queues.
Tree: Definitions - Height, depth, order, degree etc. Binary Search Tree - Operations, Traversal, Search. AVL Tree, Heap, Applications and comparison of various types of tree; Introduction to forest, multi-way Tree, B tree, B+ tree, B* tree and red-black tree.
Graphs: Introduction, Classification of graph: Directed and Undirected graphs, etc, Representation, Graph Traversal: Depth First Search (DFS), Breadth First Search (BFS), Graph algorithm: Minimum Spanning Tree (MST)- Kruskal, Prim’s algorithms. Dijkstra’s shortest path algorithm; Comparison between different graph algorithms. Application of graphs.
Sorting: Introduction, Sort methods like: Bubble Sort, Quick sort. Selection sort, Heap sort, Insertion sort, Shell sort, Merge sort and Radix sort; comparison of various sorting techniques. Searching: Basic Search Techniques: Sequential search, Binary search, Comparison of search methods. Hashing & Indexing. Case Study: Application of various data structures in operating system, DBMS etc.
AM Tanenbaum, Y Langsam& MJ Augustein, “Data structure using C and C++”, Prentice Hall India.
Robert Kruse, Bruse Leung, “Data structures & Program Design in C”, Pearson Education.
Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
Jean – Paul Trembly , Paul Sorenson, “An Introduction to Structure with application”, TMH.
Richard, GilbergBehrouz, Forouzan ,“Data structure – A Pseudocode Approach with C”, Thomson press.
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, III-Semester CS304 Digital Systems
:Bistable, Monostable, Astable, Schmitt trigger, IC 555 & Its applications. TTL, PMOS, CMOS and NMOS logic. Interfacing between TTL to MOS.
Morris Mano, Digital Circuits & Logic Design, PHI
Gothman, Digital Electronics, PHI
Tocci, Digital Electronics, PHI
Mavino& Leach, Digital Principles & Applications, PHI
Taub and schilling, Digital Integrated electronics.
Simon Haykin, Introductionto Analog& Digital Communication, Wiley.
Lathi B.P., Modern analog& digital communication , Oxford University.
To study and verify the truth tables of various Logic gates
To verify the properties of NAND and NOR gates as Universal Building Blocks.
Simplification and implementation of a Boolean function
Implementation of basic Boolean arithmetic logic circuits such as Half-adder, Half-subtractor, Full adder and Full subtractor
Conversion from Binary to Gray and Gray to Binary code
To construct a binary multiplier using combinational logic and to verify with the truth table
To verify 2-bit Magnitude comparator for all possible conditions
Generation of various logical functions using 8-to-1 multiplexer
Construction of a 4-bit ripple counter and study of its operation
Operation of IC-555 Timer as Monostable, Astable and Bistablemultivibrators
To characterize binary ladder type digital to analog (D/A) and analog to digital (A/D) convertor
Comparison of various Logic families
Design and implementation of various types of flip-flops using JK flip-flop
To study natural sampling of continuous time waveforms using different sampling rates
To study Pulse-Code modulation with Time-division multiplexing (PCM-TDM)
To study generation and detection of BPSK and QPSK waveforms
New Scheme Based On AICTE Flexible Curricula Computer Science and Engineering, III-Semester CS305 Object Oriented Programming & Methodology
Introduction to Object Oriented Thinking & Object Oriented Programming: Comparison with Procedural Programming, features of Object oriented paradigm– Merits and demerits of OO methodology; Object model; Elements of OOPS, IO processing.
Encapsulation and Data Abstraction- Concept of Objects: State, Behavior & Identity of an object; Classes: identifying classes and candidates for Classes Attributes and Services, Access modifiers, Static members of a Class, Instances, Message passing, and Construction and destruction of Objects.
Relationships – Inheritance: purpose and its types, ‘is a’ relationship; Association, Aggregation. Concept of interfaces and Abstract classes.
Polymorphism: Introduction, Method Overriding & Overloading, static and run time Polymorphism.
Strings, Exceptional handling, Introduction of Multi-threading and Data collections. Case study like: ATM, Library management system.
Timothy Budd, “An Introduction to Object-Oriented Programming”, Addison- Wesley Publication, 3rd Edition.
Cay S. Horstmann and Gary Cornell, “Core Java: Volume I, Fundamentals”, Prentice Hall publication.
G. Booch, “Object Oriented Analysis& Design”, Addison Wesley.
James Martin, “Principles of Object Oriented Analysis and Design”, Prentice Hall/PTR.
Peter Coad and Edward Yourdon, “Object Oriented Design”, Prentice Hall/PTR.
Herbert Schildt, “Java 2: The Complete Reference”, McGraw-Hill Osborne Media,
7th Edition.
>>>>>>> html