Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Traversal Algorithms, Computability, and Complexity in Computer Science, Schemes and Mind Maps of Mathematics

An in-depth exploration of traversal algorithms such as depth first search (dfs) and breadth first search (bfs), along with their applications in shortest path algorithms, transitive closure, minimum spanning tree, topological sorting, and network flow algorithm. The document also delves into tractable and intractable problems, computability of algorithms, computability classes, p, np, np-complete, and np-hard problems, cook’s theorem, standard np-complete problems, reduction techniques, approximation algorithms, randomized algorithms, and problems beyond np-pspace. Additionally, the document covers introductory biology topics, including classification systems, genetics, biomolecules, enzymes, information transfer, macromolecular analysis, metabolism, microbiology, and environmental sciences.

Typology: Schemes and Mind Maps

2022/2023

Uploaded on 03/12/2024

fardeen-ansari
fardeen-ansari 🇮🇳

2 documents

1 / 14

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
4th Semester Syllabus CSE
COMPUTER ARCHITECTURE
3 Credit
Module 1:
- Introduction (3 Lectures)
- Review of basic computer architecture (Revisited)!
- Quantitative techniques in computer design!
- Measuring and reporting performance!
- Pipelining (9 Lectures)
- Basic concepts!
- Instruction and arithmetic pipeline!
- Data hazards!
- Control hazards!
- Structural hazards!
- Techniques for handling hazards!
- Exception handling!
- Pipeline optimization techniques!
- Compiler techniques for improving performance!
Module 2:
- Hierarchical memory technology (8 Lectures)
- Inclusion, Coherence, and locality properties!
- Cache memory organizations!
- Techniques for reducing cache misses!
- Virtual memory organization!
- Mapping and management techniques!
- Memory replacement policies!
Module 3:
- Instruction-level parallelism (6 Lectures)
- Basic concepts!
- Techniques for increasing ILP!
- Superscalar, super-pipelined, and VLIW processor architectures!
- Array and vector processors!
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe

Partial preview of the text

Download Traversal Algorithms, Computability, and Complexity in Computer Science and more Schemes and Mind Maps Mathematics in PDF only on Docsity!

4th Semester Syllabus CSE

COMPUTER ARCHITECTURE

3 Credit

Module 1:

- Introduction (3 Lectures)

  • Review of basic computer architecture (Revisited)
  • Quantitative techniques in computer design
  • Measuring and reporting performance

- Pipelining (9 Lectures)

  • Basic concepts
  • Instruction and arithmetic pipeline
  • Data hazards
  • Control hazards
  • Structural hazards
  • Techniques for handling hazards
  • Exception handling
  • Pipeline optimization techniques
  • Compiler techniques for improving performance

Module 2:

- Hierarchical memory technology (8 Lectures)

  • Inclusion, Coherence, and locality properties
  • Cache memory organizations
  • Techniques for reducing cache misses
  • Virtual memory organization
  • Mapping and management techniques
  • Memory replacement policies

Module 3:

- Instruction-level parallelism (6 Lectures)

  • Basic concepts
  • Techniques for increasing ILP
  • Superscalar, super-pipelined, and VLIW processor architectures
  • Array and vector processors

Module 4:

  • Multiprocessor architecture (8 Lectures)
    • Taxonomy of parallel architectures
    • Centralized shared-memory architecture
      • Synchronization
      • Memory consistency
      • Interconnection networks
    • Distributed shared-memory architecture
    • Cluster computers
  • Non von Neumann architectures (4 Lectures)
    • Data flow computers
    • Reduction computer architectures
    • Systolic architectures
  • Variants of Turing machines
  • Nondeterministic TMs and equivalence with deterministic TMs
  • Unrestricted grammars and equivalence with Turing machines
  • TMs as enumerators Module 6:
  • Undecidability
  • Church-Turing thesis
  • Universal Turing machine
  • The universal and diagonalization languages
  • Reduction between languages and Rice's theorem
  • Undecidable problems about languages

DESIGN AND ANALYSIS OF ALGORITHMS

3 Credit

Module 1:

  • Introduction
    • Characteristics of algorithm
  • Analysis of algorithm
    • Asymptotic analysis of complexity bounds - Best, average, and worst-case behavior
    • Performance measurements of Algorithm
    • Time and space trade-offs
    • Analysis of recursive algorithms through recurrence relations - Substitution method - Recursion tree method - Masters’ theorem Module 2:
  • Fundamental Algorithmic Strategies
    • Brute-Force
    • Greedy
    • Dynamic Programming
    • Branch and Bound
    • Backtracking methodologies for the design of algorithms
    • Illustrations of these techniques for Problem-Solving
    • Bin Packing
    • Knap Sack
    • TSP
  • Heuristics
    • Characteristics and their application domains Module 3:
  • Graph and Tree Algorithms
    • Traversal algorithms - Depth First Search (DFS) - Breadth First Search (BFS)
    • Shortest path algorithms
    • Transitive closure
    • Minimum Spanning Tree
    • Topological sorting
    • Network Flow Algorithm

BIOLOGY

3 Credit

Module 1: Introduction to Biology A. Importance and Comparison: ◦ Significance of Biology compared to Physics, Chemistry, and Engineering ◦ Comparison between eye and camera, bird and aircraft to illustrate fundamental differences ◦ Identifying the most exciting aspects of Biology as a unique scientific discipline ◦ Reasons why studying Biology is essential B. Observations and Discoveries: ◦ Analyzing how biological observations in the 18th Century led to major breakthroughs ◦ Using examples like Brownian motion and the origin of thermodynamics (based on Robert Brown and Julius Mayer's observations) to emphasize the importance of observation in scientific inquiry Module 2: Classification Systems A. Hierarchical Classification: ◦ Introduction to the hierarchy of life forms at a phenomenological level ◦ Understanding how classification unifies this hierarchy ◦ Different classification criteria: ▪ Cellularity: Unicellular vs. multicellular ▪ Ultrastructure: Prokaryotes vs. eukaryotes ▪ Energy and Carbon utilization: Autotrophs, heterotrophs, lithotrophs ▪ Ammonia excretion: Aminotelic, uricotelic, ureotelic ▪ Habitat: Aquatic vs. terrestrial ▪ Molecular taxonomy: Three major kingdoms of life B. Model Organisms: ◦ Recognizing that organisms can fall into different categories based on classification ◦ Exploring model organisms used in biological studies and their respective groups (e.g., E.coli, S.cerevisiae, D. Melanogaster, C. elegans, A. Thaliana, M. musculus) Module 3: Genetics A. Fundamental Principles: ◦ Mendel's laws: Segregation, independent assortment, allele concept ◦ Gene mapping, interaction, and epistasis B. Cellular Basis of Inheritance: ◦ Understanding cell division (mitosis and meiosis) in the context of genetic material inheritance, not focusing on detailed mechanics ◦ Explaining concepts of recessiveness, dominance, and mapping phenotypes to genes C. Human Genetics: ◦ Analyzing single gene disorders in humans ◦ Utilizing the concept of complementation in human genetics

Module 4: Biomolecules A. Building Blocks: ◦ Introducing monomers and polymeric structures ◦ Exploring specific biomolecules: ▪ Sugars, starch, and cellulose ▪ Amino acids and proteins ▪ Nucleotides and DNA/RNA ▪ Two carbon units and lipids Module 5: Enzymes A. Essential Role of Enzymes: ◦ Emphasizing the importance of enzymes for life on Earth B. Understanding Enzyme Activity: ◦ Learning how to monitor enzyme-catalyzed reactions ◦ Exploring mechanisms of enzyme catalysis and classification ◦ Analyzing examples of enzyme action C. Enzyme Kinetics and Parameters: ◦ Understanding enzyme kinetics and key parameters ◦ Explaining why knowing these parameters is crucial for understanding biology D. RNA Catalysis: ◦ Briefly exploring the role of RNA catalysis Module 6: Information Transfer A. Universality of Genetic Code: ◦ Comprehending the universality of genetic information coding and decoding B. DNA as Genetic Material: ◦ Examining the structure hierarchy of DNA (single-stranded, double helix, nucleosomes) ◦ Understanding the concept of genetic code, including its universality and degeneracy ◦ Defining a gene in terms of complementation and recombination Module 7: Macromolecular Analysis A. Protein Structure and Function: ◦ Delving into the hierarchy of protein structure (primary, secondary, tertiary, quaternary) ◦ Exploring the diverse roles of proteins as enzymes, transporters, receptors, and structural elements Module 8: Metabolism A. Energy Transactions and Principles: ◦ Applying thermodynamics principles to understand energy transactions in biology ◦ Distinguishing between exothermic/endothermic and endergonic/exergonic reactions ◦ Understanding the concept of Keq and its relation to standard free energy ◦ Exploring spontaneity and the role of ATP as energy currency

ENVIRONMENTAL SCIENCES

1 Credit

Module 1:

  • Basic Ideas of Environment
    • Concepts of Man, Society, and Environment
  • Mathematics of Population Growth
    • Importance in Environmental Engineering
  • Definition of Resource
    • Types: Renewable, Non-renewable, Potentially Renewable
  • E ff ect of Excessive Resource Use vis-à-vis Population Growth
  • Sustainable Development
  • Materials Balance
    • Steady State Conservation System
    • Steady State System with Non-conservative Pollutants
    • Step Function
  • Environmental Degradation
    • Natural Hazards: Flood, Earthquake, Landslide
    • Anthropogenic Degradation: Acid Rain
  • Nature and Scope of Environmental Science and Engineering Module 2:
  • Elements of Ecology
    • System, Open System, Closed System
  • Definition of Ecology
    • Species, Population, Community
    • Definition of Ecosystem: Components, Types, Function
  • Structure and Function of Ecosystems
    • Forest, Grassland, Desert, Aquatic, Mangrove (Special Reference to Sundarbans)
  • Food Chain and Food Web
  • Biogeochemical Cycle
    • Oxygen, Carbon, Nitrogen, Phosphate, Sulphur
  • Biodiversity
    • Types, Importance
    • Endemic Species, Biodiversity Hotspot
    • Threats to Biodiversity, Conservation Module 3:
  • Atmospheric Composition
    • Troposphere, Stratosphere, Mesosphere, Thermosphere
    • Tropopause and Mesopause
  • Energy Balance
    • Conductive and Convective Heat Transfer
  • Radiation Heat Transfer
  • Simple Global Temperature Model
  • Greenhouse E ff ects
  • Impact on Global Climate, Sea Water Level, Agriculture, Marine Food
  • Global Warming, Consequences
  • Earth’s Heat Budget
  • Lapse Rate
  • Ambient Lapse Rate, Adiabatic Lapse Rate
  • Atmospheric Stability, Temperature Inversion
  • Atmospheric Dispersion
  • Maximum Mixing Depth, Ventilation Coefficient
  • Effective Stack Height, Smokestack Plumes
  • Gaussian Plume Model
  • Pollutants and Contaminants
  • Primary and Secondary Pollutants
  • Emission Standard, Criteria Pollutant
  • Sources and Effects of Air Pollutants
  • Suspended Particulate Matter, Oxides of Carbon, Nitrogen, Sulphur
  • Smog, Photochemical Smog, London Smog
  • Depletion of Ozone Layer
  • CFC, Destruction, Impact of Greenhouse Gases
  • Ozone Modification Module 4:
  • Hydrosphere and Hydrological Cycle
  • Natural Water, Pollutants of Water
  • Oxygen Demanding Wastes, Pathogens, Nutrients, Salts
  • Thermal Application, Heavy Metals, Pesticides, VOCs
  • River/Lake/Groundwater Pollution
  • River: DO, BOD, COD, Oil, Grease, pH
  • Lake: Eutrophication
  • Groundwater: Aquifers, Hydraulic Gradient, Groundwater Flow
  • Wastewater Standard
  • BOD, COD, Oil, Grease
  • Water Treatment System
  • Coagulation and Flocculation, Sedimentation and Filtration
  • Disinfection, Hardness and Alkalinity, Softening
  • Wastewater Treatment System
  • Primary and Secondary Treatments
  • Trickling Filters, Rotating Biological Contractor
  • Activated Sludge, Sludge Treatment, Oxidation Ponds
  • Tertiary Treatment

DISCRETE MATHEMATICS

4 Credit

Module 1: Sets, Relation and Function Operations and Laws of Sets Cartesian Products Binary Relation Partial Ordering Relation Equivalence Relation Image of a Se Sum and Product of Functions Bijective Functions, Inverse and Composite Function Size of a Set, Finite and Infinite Sets Countable and Uncountable Sets Cantor's Diagonal Argument and The Power Set Theorem Schroeder-Bernstein Theorem Principles of Mathematical Induction The Well-Ordering Principle Recursive Definition The Division Algorithm: Prime Numbers The Greatest Common Divisor: Euclidean Algorithm The Fundamental Theorem of Arithmetic Module 2: Basic Counting Techniques Inclusion and Exclusion Pigeonhole Principle Permutation and Combination Module 3: Propositional Logic Syntax, Semantics, Validity, and Satisfiability Basic Connectives and Truth Tables Logical Equivalence: The Laws of Logic Logical Implication Rules of Inference The Use of Quantifiers

Proof Techniques Some Terminology Proof Methods and Strategies Forward Proof Proof by Contradiction Proof by Contraposition Proof of Necessity and Sufficiency Module 4: Algebraic Structures and Morphism Algebraic Structures with One Binary Operation Semi-Groups, Monoids, Groups Congruence Relation and Quotient Structures Free and Cyclic Monoids and Groups Permutation Groups Substructures, Normal Subgroups Algebraic Structures with Two Binary Operations Rings, Integral Domain, and Fields Boolean Algebra and Boolean Ring Identities of Boolean Algebra Duality Representation of Boolean Function Disjunctive and Conjunctive Normal Form Module 5: Graphs and Trees Graphs and Their Properties Degree, Connectivity, Path, Cycle, Sub Graph, Isomorphism Eulerian and Hamiltonian Walks Graph Coloring, Coloring Maps, and Planar Graphs Coloring Vertices, Coloring Edges List Coloring Perfect Graph Definition, Properties, and Example Rooted Trees, Trees, and Sorting Weighted Trees and Prefix Codes Bi-connected Component and Articulation Points Shortest Distances