CSE 3rd Semester Syllabus

Unit 1Set Theory, Relations, Functions, and Theorem Proving Techniques

Definition of sets, countable and uncountable sets · Venn diagrams and proofs of general set identities · Definition and types of relations, composition of relations, pictorial representation · Equivalence relations and partial ordering relations; Job‑scheduling problem · Definition and types of functions, one‑to‑one, onto, into, inverse functions, composition of functions · Recursively defined functions and the pigeonhole principle · Mathematical induction and proof by contradiction

Unit 2Algebraic Structures

Definition and properties of semigroups and monoids · Groups, Abelian groups, subgroup, cyclic groups, cosets, factor groups · Permutation groups, normal subgroups, homomorphism and isomorphism of groups · Rings and fields: definitions and standard results

Unit 3Propositional and First‑Order Logic

Propositions, predicates, and quantifiers (universal and existential) · Basic logical operations, truth tables, tautologies and contradictions · Algebra of propositions, logical implications and equivalence · Normal forms (CNF, DNF) and logical equivalences

Unit 4Finite State Machines

Finite state machines as models of physical systems · Equivalence of finite state machines · Finite state machines as language recognizers

Unit 5Graph Theory

Basic terminology of graphs, planar graphs, multigraphs and weighted graphs · Isomorphic graphs, paths, cycles and connectivity · Shortest path algorithms in weighted graphs · Eulerian paths and circuits, Hamiltonian paths and circuits · Graph coloring, chromatic number · Isomorphism and homomorphism of graphs

Unit 6Posets, Hasse Diagrams and Lattices

Ordered sets and Hasse diagrams · Isomorphic and well‑ordered sets · Properties of lattices, bounded and complemented lattices

Unit 7Combinatorics

Permutations and combinations · Binomial theorem and multinomial coefficients

Unit 8Recurrence Relations and Generating Functions

Introduction to recurrence relations and recursive algorithms · Linear recurrence relations with constant coefficients: homogeneous and particular solutions · Total solutions of recurrence relations · Generating functions and solution by the method of generating functions

Unit 1Review of C and Introduction to Data Structures

Review of C programming language · Concepts of data and information · Classification of data structures · Abstract Data Types (ADTs) · Memory representation of data structures · Operations on data structures and cost estimation · Linear data structures: arrays · Linear data structures: linked lists – singly, circular, doubly linked · Representation of linked list in memory · Applications of linked lists (e.g., polynomial manipulation)

Unit 2Stacks and Queues

Stacks as Abstract Data Types · Implementations of stacks (array, linked list, multiple stacks) · Applications of stacks: infix‑to‑postfix conversion, postfix evaluation, recursion · Queues as Abstract Data Types · Implementations of queues (array, linked list, circular queue) · Dequeue and priority queue concepts · Queue simulation and practical applications

Unit 3Tree Data Structures

Tree definitions – height, depth, order, degree · Binary Search Tree: operations, traversal, search · AVL trees · Heaps · Forests and multi‑way trees · B‑tree, B⁺‑tree, B*‑tree · Red‑black trees · Comparative analysis of various tree types

Unit 4Graphs

Graph fundamentals and classification (directed, undirected) · Graph representation techniques (adjacency matrix, adjacency list) · Graph traversal algorithms: Depth‑First Search (DFS), Breadth‑First Search (BFS) · Minimum Spanning Tree algorithms: Kruskal’s and Prim’s · Dijkstra’s shortest‑path algorithm · Comparison of graph algorithms · Practical applications of graphs

Unit 5Sorting, Searching and Hashing

Sorting algorithms: bubble sort, quick sort, selection sort, heap sort, insertion sort, shell sort, merge sort, radix sort · Comparative analysis of sorting techniques · Searching techniques: sequential search, binary search · Comparison of searching methods · Hashing and indexing techniques · Case studies: application of data structures in operating systems and DBMS

Unit 6== END OF UNITS==

Unit 1Number systems and Boolean algebra

Review of number systems and number base conversions · Binary codes · Boolean algebra · Boolean functions · Logic gates · Simplification of Boolean functions · Karnaugh map methods · SOP‑POS simplification · NAND‑NOR implementation

Unit 2Combinational Logic

Half adder · Half subtractor · Full adder · Full subtractor · Look‑ahead carry generator · BCD adder · Series and parallel addition · Multiplexer · Demultiplexer · Encoder · Decoder · Arithmetic circuits · Arithmetic Logic Unit (ALU)

Unit 3Sequential Logic and Memories

Flip‑flops (D, T, S‑R, J‑K Master‑Slave) · Racing condition · Edge‑triggered and level‑triggered circuits · Shift registers · Asynchronous counters · Synchronous counters and state diagrams · Semiconductor memories · Digital ICs 2716, 2732 and address decoding · Modern semiconductor memories (DRAM, FLASH RAM) · Designing with ROM and PLA

Unit 4Analog‑Digital Conversion and Logic Families

A/D and D/A converters and their types · Sample‑and‑hold circuits · Voltage‑to‑Frequency and Frequency‑to‑Voltage conversion · Multivibrators: bistable, monostable, astable, Schmitt trigger, IC 555 and applications · TTL, PMOS, CMOS, NMOS logic · Interfacing between TTL and MOS

Unit 5Digital Communication

Nyquist sampling theorem · Time division multiplexing · Pulse‑Code Modulation (PCM) · Quantization error · BPSK and BFSK modulation schemes · Shannon’s theorem for channel capacity

Unit 6== END OF UNITS==

Unit 1Introduction to Object Oriented Thinking & Programming

Comparison with Procedural Programming · Features of Object oriented paradigm – merits and demerits · Object model · Elements of OOPS · IO processing

Unit 2Encapsulation and Data Abstraction

State, behavior and identity of an object · Identifying classes and class candidates · Attributes and services · Access modifiers · Static members of a class · Instances and message passing · Construction and destruction of objects

Unit 3Inheritance and Relationships

Purpose of inheritance · Types of inheritance · "is‑a" relationship · Association · Aggregation · Concept of interfaces · Abstract classes

Unit 4Polymorphism

Method overriding · Method overloading · Static polymorphism · Runtime polymorphism

Unit 5Strings, Exception Handling, Multithreading & Collections

Strings · Exception handling · Introduction to multithreading · Data collections · Case study: ATM system · Case study: Library management system

Unit 6== END OF UNITS==

==End of Syllabus==

Unit 1Introduction to Energy Science

Introduction to energy systems and resources · Introduction to Energy, sustainability & the environment · Overview of energy systems · sources · transformations · efficiency · 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)

Unit 2Ecosystems

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)

Unit 3Biodiversity 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

Unit 4Environmental 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

Unit 5Social 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 · 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

Unit 6Field 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.