B.Tech (Computer Science & Technology) Syllabus
Semester III

COURSE CODECOURSE NAMECREDITS

JEAS301
Engineering Mathematics III:
UNITI
Function of Complex variable: Analytic function, CR equations, Cauchy's integral theorem, Cauchy's integral formula for derivatives of analytic function, Taylor's and Laurent's series, singularities, Residue theorem, Evaluation of real integrals of the type and
UNITII
Statistical Techniques – I: Moments, Moment generating functions, Skewness, Kurtosis, Curve fitting, Method of least squares, Fitting of straight lines, Polynomials, Exponential curves etc., Correlation, Linear, non –linear and multiple regression analysis, Probability theory
UNITIII
Statistical Techniques – II: Binomial, Poisson and Normal distributions, Sampling theory (small and large), Tests of significations: Chisquare test, ttest, Analysis of variance (one way) , Application to engineering, medicine, agriculture etc. Time series and forecasting (moving and semiaverages), Statistical quality control methods, Control charts, , R, p, np, and c charts
UNITIV
Numerical Techniques – I: Zeroes of transcendental and polynomial equation using Bisection method, Regulafalsi method and NewtonRaphson method, Rate of convergence of above methods. Interpolation: Finite differences, difference tables, Newton's forward and backward interpolation, Lagrange's and Newton's divided difference formula for unequal intervals
UNITV
Numerical Techniques –II: Solution of system of linear equations, Gauss Seidal method, Crout method. Numerical differentiation, Numerical integration , Trapezoidal , Simpson's one third and threeeight rules, Solution of ordinary differential (first order, second order and simultaneous) equations by Euler's, Picard's and forthorder Runge Kutta mehthods
Books:
 1. Peter V. O'Neil, Advance Engineering Mathematics Thomson (Cengage) Learning, 2007
 2. Jain, Iyenger & Jain, Numerical Methods for Scientific and Engineering Computation, New Age International, New Delhi , 2003
 3. J.N. Kapur, Mathematical Statistics, S. Chand & company Ltd.,2000
 4. R.K. Jain & S.R.K. Iyenger, Advance Engineering Mathematics, Narosa Publication House, 2002.
 5. Chandrika Prasad, Advanced Mathematics for Engineers, Prasad Mudralaya
 6. E. Kreysig, Advanced Engineering Mathematics, John Wiley & Sons, 2005
 7. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 2005.
 8. Devi Prasad, An introduction to Numerical Analysis, Narosa Publication house, New Delhi 2006.
04 
JECS301
Data Structure Using C:
UNITI
Introduction: Introductory concepts of C++Data typesControl structuresDefinitions of Data Structure and Algorithm The Abstract Data TypeAlgorithm efficiencySearchingList structuresHashed List structuresBasic conceptsHashing methods
UNITII
Linked Lists: Linear and Linked List conceptsLinked List AlgorithmsProcessing a Linked ListList ApplicationsComplex Linked List StructuresImplementationCase studies.
UNITIII
DStacks And Queues: STACKS: Basic Operations Linked List Implementation ApplicationsStack ADTArray Implementation.
QUEUES: OperationsLinked List designImplementationCase studyOverflow and underflow of stack sizeUNITIV
Trees And Graphs: TREES: Basic Tree ConceptsBinary Trees Tree Traversals General Trees Search Trees: Binary SearchTreesAVL treesGRAPHS: OperationsDepth First TraversalBreadth First TraversalImplementationStorage StructuresCase studies
UNITV
Sorting Concepts: General Sort conceptsInsertion SortShell SortSelection SortHeap SortExchange SortBubble sortQuick SortCase studies
Books:
 1. Richard F.Gilberg And Behrouz A.Forouzan "Data Structures  A Pseudo Codeapproach With C++", Thomson Asia, 2005.
 2. Herbert Schildt "The Complete Reference C++" Fourth Edition, Tatamcgraw Hill Edition, 2003
 3. Yedidyah Langsan, Moshe J. Augenstein And Aoron M. Tanenbaum "Datastructures Using C And C++", PrenticeHall Of India Pvt Ltd, 2004.
 4. Sartaj Sahni "Data Structures, Algorithms And Applications In C++", McgrawHill International Edition, 2000.
 5. Mark Allen Weiss, "Data Structures And Algorithm Analysis In C++" AddisonWesley Publishing Company, 1994.
 6. Aho, Hopcroft, Ullman – "Data Structures And Algorithms" – Pearson Education – 1983.
 7. Jean Paul Tremblay & Paul Sorenson – "An Introduction To Data Structures Withapplications" – Tmh – 1984.
04 
JECS302
Data Base Management System:
UNITI
Introduction: An overview of database management system, database system Vs file system, Database system concept and architecture, data model schema and instances, data independence and database language and interfaces, data definitions language, DML, Overall Database Structure.
Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model, relationship of higher degree.UNITII
Relational data Model and Language: Relational data model concepts, integrity constraints, entity integrity, referential integrity, Keys constraints, Domain constraints, relational algebra, relational calculus, tuple and domain calculus
Introduction on SQL: Characteristics of SQL, advantage of SQL. SQl data type and literals. Types of SQL commands.SQL operators and their procedure.Tables, views and indexes. Queries and sub queries. Aggregate functions. Insert, update and delete operations, Joins, Unions, Intersection, Minus, Cursors, Triggers, Procedures in SQL/PL SQLUNITIII
Data Base Design & Normalization: Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependence, loss less join decompositions, normalization using FD, MVD, and JDs, alternative approaches to database design
UNITIV
Transaction Processing Concept: Transaction system, Testing of serializability, serializability of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction failures, log based recovery, checkpoints, deadlock handling.
Distributed Database: distributed data storage, concurrency control, directory systemUNITV
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, case study of Oracle.
Books:
 1. Hector GarciaMolina, Jeff Ullman, and Jennifer Widom, "Database Systems: The Complete Book" Pearson Education, 2002
 2. Silberschatz, H. Korth and S. Sudarshan, "Database System Concepts", 4rth Edition, McGrawHill International, 2002.
 3. R. Elmasri and Shamakant B. Navathe, "Fundamentals of Database Systems", 3rd Edition, AddisionWesley , 2000.
04 
JECS303
Object Oriented Programming with C++ :
UNITI
Introduction: Introducing Object – Oriented Approach, Relating to other paradigms {Functional, Data decomposition}. Basic terms and ideas: Abstraction, Encapsulation, Inheritance, Polymorphism, Review of C, Difference between C and C++  cin, cout, new, delete, operators
UNITII
Classes and Objects: Encapsulation, information hiding, abstract data types, Object & classes, attributes, methods, C++ class declaration, State idendity and behaviour of an object, Constructors and destructors, instantiation of objects, Default parameter value, object types, C++ garbage collection, dynamic memory allocation, Metaclass / abstract classes.
UNITIII
Inheritance: Inheritance, Class hierarchy, derivation – public, private & protected, Aggregation, composition vs classification hierarchies, types of Inheritance
UNITIV
Polymorphism: Polymorphism, Categorization of polymorphism techniques, Method polymorphism, Polymorphism by parameter, Operator overloading, Parameteric Polymorphism. Generic function Template function, function name overloading, Overriding inheritance methods, Run time polymorphism
UNITV
Files and Exception Handling: Streams and files, Namespaces, Exception handling, Generic Classes
Books:
 1. A.R. Venugopal, Rajkumar, T. Ravishanker "Mastering C++", TMH, 1997
 2. S.B. Lippman&J.Lajoie, " C++ Primer", 3rd Edition, Addison Wesley, 2000.The C programming Lang., Person Ecl – Dennis Ritchie
 3. R. Lafore, "Object Oriented Programming using C++", Galgotia Publications.
04 
JECS304
Digital Logic Design:
UNITI
Number Systems & Boolean Algebra: Digital Computers and digital systemsReview of binary number systemsNumber conversionComplementsBinary ArithmeticBinary codesBoolean Algebra and TheoremsCanonical and standard formsSimplification of Boolean functions using Karnaugh map & tabulation methods
UNITII
Implementation Of Combinational Logic Design: Logic gatesCombinational CircuitsAnalysis and design procedureBinary Adder and Subtractor Decimal adder EncoderDecoderMultiplexer DemultiplexerBinary parallel adders Magnitude comparatorsReadOnly Memory(ROM)Programmable Logic Array(PLA)Programmable Array Logic (PAL)
UNITIII
Design Of Synchronous Sequential Circuits: Sequential circuits LatchesFlipflops Analysis of clocked sequential circuitsState reduction and state assignmentDesign procedure Design of counters. Shift registers and ripple counters
UNITIV
Asynchronous Sequential Logic: Analysis and design procedureReduction of state and flow tablesRace and Free State assignmentHazards
UNITV
Hardware Description Logic: Introduction to Hardware Description Language (HDL)HDL for combinational circuits
Books:
 1. M.Morris Mano, "Digital Logic and Computer Design", PHI,2001 (Chapter 1, 2, 3 for UNITI)
 2. M.MorrisMano, "DigitalDesign", Thirdedition, Pearson Education, 2002 (Chapter 2,4,7 for UNITII, Chapter 5,6 for UNITIII, Chapter 9 for UNITIV, Chapter 3.9 and 4.11 for UNITV)
 3. Raj Kamal ," Digital Systems Principles and Design", Pearson Education,2007
 4. Charles H.Roth, Jr." Fundamentals of Logic Design", 4th edition, Jaico publishing House,1995
 5. Donald D.Givone, "Digital Principles and Design", TataMcGraw –Hill ,2003.
04 
JECS351
Data Structure Lab:
List of Exercises
Cycle – I
 1. Implementation of stack & Queue
 2. Singly Linked List
 3. Doubly linked list
 4. Binary tree Implementations and traversals.
 5. Sorting Techniques : Insertion , Selection Sort
 6. Sorting Techniques : Quick sort , Merge sort
 1. Divide and Conquer Method
 a) Binary Search
 b) Max Min Problem
 2. Greedy Method
 a) Knapsack Problem
 4. Backtracking
 a) 8Queens Problem
Cycle II
Reference: Laboratory Manual
04 
JECS352
Database Lab:
List of Experiments
 1. Write the queries for Data Definition and Data Manipulation Language.
 2. Write SQL queries using logical operations (=,<,>,etc)
 3. Write SQL queries using SQL operators
 4. Write SQL query using character, number, date and group functions
 5. Write SQL queries for relational algebra
 6. Write SQL queries for extracting data from more than one table
 7. Write SQL queries for sub queries, nested queries
 8. Write programme by the use of PL/SQL
 9. Concepts for ROLL BACK, COMMIT & CHECK POINTS
 10. Create VIEWS, CURSORS and TRGGERS & write ASSERTIONS
 11. Create FORMS and REPORTS
Note:
 1. The queries to be implemented on DBMS using SQL
 2. Students are advised to use Developer 2000/Oracle9i or other latest version for above experiments.. However student may use Power Builder/SQL SERVER .
Mini Projects may also be planned & carried out throughout the semester to understand important concepts of database.
04 
JECS351
C++ Lab:
List of the Experiment No:
 1. Write a program to print simple Addition Using Two Integer Value.
 2. Write a program to print two integers values Addition using Class.
 3. Write a program for calculator.
 4. Write a program for New And Delete.
 5. Write a program for Function Overloading.
 6. Write a program for Operator Overloading.
 7. Write a program for Overriding inheritance.
 8. Write a program for reverse string.
 9. Derive the two classes son and daughter, and demonstrate polymorphism in action.
 10. Write a program that uses coordinate to model a point.
02 
JECS355
Logic Design Lab:
Practical
 1. Verification of Gates & Flip Flops
 2. Adders
 3. Multiplexers & Demultiplexers
 4. Counters
 5. Shift registers
 6. Encoders & Decoders
02 
JGP101/ JGP201
General Proficiency
02 
Total Credits30