Professional Documents
Culture Documents
b.tech Cse III Sem Syllabus Hyd Campus
b.tech Cse III Sem Syllabus Hyd Campus
b.tech Cse III Sem Syllabus Hyd Campus
Course Objective:
Introduce the concept of digital and binary systems
Be able to design and analyze combinational logic circuits.
Be able to design and analyze sequential logic circuits.
Understand the basic software tools for the design and implementation of digital circuits
and systems.
Reinforce theory and techniques taught in the classroom through experiments and
projects in the laboratory.
Course Outcome:
Apply knowledge of mathematics, science and engineering
Apply Boolean algebra techniques to digital circuit analysis.
Use the techniques, skills, and modern engineering tools necessary for successful
practice.
Design and conduct experiments and interpret analysis results.
UNIT-I :Number System and Logic Simplification: Number Systems, Base Conversion
Methods and Complements of Numbers, Introduction to Boolean algebra, Boolean identities,
Basic logic functions, standard forms of logic expressions. SOP & POS forms, Canonical
forms, K-map representation, simplification of logic expressions, Karnaugh map up to 5
variables with don’t cares, Tabular method (Mc Clusky method). realization of logic
expressions using AOI, NOR, NAND and other combinations of logic functions.
UNIT-II: Combinational circuits: Half and Full Adders, Subtractors Serial and Parallel
Adders, BCD Adder, Magnitude Comparators, Multiplexers, demultiplexers and decoders,
encoders, Seven-segment and alphanumeric display design.
UNIT-III: Sequential circuits: Introduction to latches, Operation of RS, JK, D, and T flip
flops and Master Slave flip flop; Shift registers, Universal shift register.
Counters: Ripple, synchronous, and up-down; Design of counters, ring counter and Johnson
counter , design of other sequential circuits.
UNIT-IV: Logic Families: Design of Logic family, Specifications, Noise margin, Propagation delay, fan-
in, fan-out, Tristate TTL, ECL, CMOS Logic families, Logic implementation using PLDs-PROM, PAL and PLA
Text Books:
1. M.Morris Mano, Michael D. Ciletti, “Digital Design”, Pearson, 4th Edition, 2012.
Reference Books:
1. Anand Kumar A., Fundamentals of Digital Circuits, Prentice Hall of India, 4 th Edition,
2003.
2. Zvykohavi, Switching & Finite Automata Theory, Tata McGraw Hill, 2 nd Edition
3. P.Jain, “Modern Digital Electronics”, Tata McGraw Hill, 4th Edition, 2009.
Objectives:
Course Code PCCCS301
Category Professional Core Courses
Course Tilte DATA STRUCTURES THROUGH CPP
Scheme and Credits L T P Credits
3 1 2 5 Semester-III
Prerequisites if any None
• To understand the basic concepts such as Abstract Data Types, Linear and Non‐Linear Data
structures.
• To understand the notations used to analyze the Performance of algorithms.
• To understand the behavior of data structures such as stacks, queues, trees, hash tables,
search trees, Graphs and their representations.
• To choose the appropriate data structures for a specified application
• To write programs in C++ to solve problems using data structures such as arrays, linked
lists, stacks, queues, trees, graphs, hash tables, search trees.
UNIT-I
Introduction and Overview: Definitions-Concept, Overview and Implementation of Data
Structure.
Arrays: Definition – One dimensional Arrays - Multi dimension Arrays - Pointer Arrays.
Linked lists: Definition, Single linked List-Circular linked list -Doubly linked list -Application
of Linked Lists
UNIT-II
Stacks: Introduction, Definition and Representation of Stack, Operations on Stacks,
Applications of Stack.
Queues: Introduction, Definition-Representation of Queues, Various Queue Structures,
Application of Queues.
UNIT-III
Trees: Definition and Concepts, Representation of Binary Tree, Operations on Binary Tree,
Types of Binary Trees, Expression Tree, Binary Search Tree, Heap Trees, B Trees, Operations
on B Trees.
Graphs – Introduction, Representation of Graphs, Operations on Graphs, Application of Graph
Structures, Shortest Path Problem, Minimum Spanning Trees.
UNIT-IV
Sorting: Introduction, Insertion Sort, Shell Sort, Heap Sort, Merge Sort, Quick Sort
Hashing: Hash Function, Separate Chaining, Hash Tables without Linked List.
Algorithm Analysis: Mathematical Background-Model, What to Analyze, Running Time
Calculations.
Textbooks:
1. D. Samanta, “Classic data structures”, Printice Hall India, ISBN 81-203-1874-9.
2. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss Florida International
University, Fourth Edition. Pearson.
References:
1. Ellis Horowitz, Sartaj Sahani, Dinesh Metha, “Fundamentals of data structures in C++”,
Galgotia Publications Pvt. Ltd, ISBN 81-203-1874-9.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein. Introduction to Algorithms, 3rd
edition, MIT Press, 2009.
3. Data Structures Using C++, SIXTH edition, E. Balaguru Swamy, Tata McGraw-Hill, ISBN
1-25-9029544-9.
4. Fundamentals Of Data Structures In C++, Horowitz, Sahni, Universities Press ISBN
10:8173716056
COURSE CODE BSC
Category BASIC SCIENCE COURSE
Course Title MATHEMATICS-III
Scheme and Credits L T P C SEMESTER-III
2 0 0 2
UNIT-1
Solution Of Ordinary Differential Equations-Picard’s Method, Taylor’s Method, Euler’s
Method
UNIT-II
Solution of Algebraic and Transcendental Equations, Bisection method, Regular falsi method,
Newton-Raphson method, Iteration method
UNIT-III
Finite Differences, Forward Differences, Backward Differences,
Newton’s forward and backward Interpolation Formulae, Numerical Differentiation.(forward
and backward derivatives)
UNIT-IV;
Numerical Integration-Trapezoidal Rule, Simpson’s one –third Rule, Simpson’s three-eight
Rule.
UNIT II-Relation Query Languages, Relational Algebra, Tuple and Domain Relational
Calculus, SQL and QBE.
Relational Database Design: Domain and Data dependency, Armstrong’s Axioms, Normal
Forms, Dependency Preservation, Lossless design, Comparison of Oracle & DB2.
Textbooks:
1. Database System Concepts by Sudarshan, Korth (McGraw-Hill Education)
2. Fundamentals of Database System By Elmasari &Navathe- Pearson Education
References Books:
1. An introduction to Database System – Bipin Desai, Galgotia Publications
2. Database System: concept, Design & Application by S.K.Singh (Pearson Education)
3. Database management system by leon &leon (Vikas publishing House).
4. Database Modeling and Design: Logical Design by Toby J. Teorey, Sam S. Lightstone, and
Tom Nadeau, “”, 4thEdition, 2005, Elsevier India Publications, New Delhi
5. Fundamentals of Database Management System – Gillenson, Wiley India
UNIT-I: FUNDAMENTALS
Sets, relations and functions, problem-sol ving strategies, Fundamentals of Logic,
Logic inferences, first order logic, Mathematical induction
REFERENCE BOOKS:
1. Discrete Mathematics by TREMBELY AND MANOHAR (TMH)
2. Elements of Discrete Mathematics by C. L. LIU (TMH)
Course Objectives:
Understanding the importance of Ecosystem.
Understanding the impacts of Environmental Pollution and Control Technologies.
Understanding the environmental policies and regulations
Course Outcomes:
Based on this course, the Engineering graduate will understand /evaluate / develop
Technologies on the basis of ecological principles and environmental regulations which
in turn
Helps in understanding Environmental Management Plan.
UNIT-I
Ecosystems: Definition, Scope, and Importance of ecosystem. Classification, structure, and
function of an ecosystem, Food chains, food webs, and ecological pyramids. Natural
Resources: Classification of Resources, water resources, Mineral resources, Land resources,
Energy resources.
UNIT-II
Biodiversity And Biotic Resources: Introduction, Definition, genetic, species and ecosystem
Diversity. Value of biodiversity; consumptive use, productive use, social, ethical, aesthetic and
optional Values. India as a mega diversity nation, Hot spots of biodiversity. Threats to
biodiversity: Habitat loss, poaching of wildlife, man-wildlife conflicts; conservation of
biodiversity: In-Situ and Ex-situ Conservation.
UNIT-III
Environmental Pollution and Control Technologies: Environmental Pollution: Classification of
pollution, Air Pollution, Water pollution, Soil Pollution, Noise Pollution, Climate change and
impacts on human environment. Ozone depletion and Ozone depleting substances (ODS).
Deforestation and desertification. International conventions /Protocols: Earth summit, Kyoto
protocol, and Montréal Protocol. NAPCC-GoI Initiatives.
UNIT-IV
Environmental Policy, Legislation & EIA: Environmental Protection act, Legal aspects Air
Act- 1981,
Water Act, Forest Act, Wildlife Act, Municipal solid waste management and handling rules
EIA: EIA
structure, methods of baseline data acquisition. Overview on Impacts of air, water, biological
and Socioeconomical aspects. Strategies for risk assessment, Concepts of Environmental
Management Plan (EMP).
TEXTBOOKS:
1. Textbook of Environmental Studies for Undergraduate Courses by Erach Bharucha for
University Grants Commission.
2. Environmental Studies by R. Rajagopalan, Oxford University Press.
3. M. Chandrasekhar, Environmental science, Hi Tech Publishers, 2009.
REFERENCE BOOKS:
1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008 PHL
Learning Private Ltd. New Delhi.
2. Environmental Engineering and science by Gilbert M. Masters and Wendell P. Ela. 2008
PHI
Learning Pvt. Ltd.
3. Environmental Science by Daniel B. Botkin& Edward A. Keller, Wiley INDIA edition.
4. Environmental Studies by AnubhaKaushik, 4th Edition, New age international
publishers.
5. Text book of Environmental Science and Technology - Dr. M. Anji Reddy 2007, BS
Publications.
6. Introduction to Environmental Science by Y. Anjaneyulu, BS. Publications