1 ANDHRA UNIVERSITY COLLEGE OF ENGINEERING - AUTONOMOUS VISAKHAPATNAM COMPUTER SCIENCE & SYSTEMS ENGINEERING. (With effect from 2006-07 admitted batch onwards) II/IV B.TECH.(CSE) I - SEMESTER B.TECH. (CSE) 2nd YEAR I-SEMESTER SCHEME OF INSTRUCTION AND EXAMINATION With effect from 2006-07 admitted batch Sub. Ref. No. Name of the Subject Periods Maximum Marks Credits Theory Tutorial Lab. Exam Sessionals Total CSE 2.1.1 ELECTRONICS-I 3 1 70 30 100 4 CSE 2.1.2 ELEMENTS OF ELECTRICAL ENGINEERING 3 1 70 30 100 4 CSE 2.1.3 DATA STRUCTURES 3 1 70 30 100 4 CSE 2.1.4 DESCRETE MATHEMATICAL STRUCTURES-I 3 1 70 30 100 4 CSE 2.1.5 PROBABILITY, STATISTICS & QUEUING THEORY 3 1 70 30 100 4 CSE 2.1.6 DIGITAL LOGIC DESIGN 3 1 70 30 100 4 CSE 2.1.7 ELECTRICAL LAB. 3 50 50 100 2 CSE 2.1.8 DATA STRUCTURES LAB. 3 50 50 100 2 TOTAL CREDITS 28 II/IV B.TECH.(CSE) II - SEMESTER B.TECH. (CSE) 2nd YEAR II-SEMESTER SCHEME OF INSTRUCTION AND EXAMINATION With effect from 2006-07 admitted batch Sub. Ref. No. Name of the Subject Periods Maximum Marks Credits Theory Tutorial Lab. Exam Sessionals Total CSE 2.2.1 ELECTRONICS-II 3 1 70 30 100 4 CSE 2.2.2 DISCRETE MATHEMATICAL STRUCTURES-II 3 1 70 30 100 4 CSE 2.2.3 MICROPROCESSORS-I 3 1 70 30 100 4 CSE 2.2.4 COMPUTER ORGANIZATION 3 1 70 30 100 4 CSE 2.2.5 OBJECT ORIENTED PROGRAMMING 3 1 70 30 100 4 CSE 2.2.6 ENVIRONMENTAL STUDIES 3 1 70 30 100 2 CSE 2.2.7 MICROPROCESSORS-I LAB. -- -- 3 50 50 100 2 CSE 2.2.8 ELECTRONICS LAB. -- -- 3 50 50 100 2 TOTAL CREDITS 26 III/IV B.TECH.(CSE) I - SEMESTER B.TECH. (CSE) 3rd YEAR I-SEMESTER SCHEME OF INSTRUCTION AND EXAMINATION With effect from 2006-07 admitted batch Sub. Ref. No. Name of the Subject Periods Maximum Marks Credits Theory Tutorial Lab. Exam Sessionals Total CSE 3.1.1 MICROPROCESSOR-II 3 1 -- 70 30 100 4 CSE 3.1.2 SYSTEM PROGRAMMING 3 1 -- 70 30 100 4 CSE 3.1.3 ELECTIVE – I 3 1 -- 70 30 100 4 CSE 3.1.4 FORMAL LANGUAGES & AUTOMATA THEORY 3 1 -- 70 30 100 4 CSE 3.1.5 FILE STRUCTURES 3 1 -- 70 30 100 4 CSE 3.1.6 OPERATING SYSTEMS 3 1 -- 70 30 100 4 CSE 3.1.7 OPERATING SYSTEMS LAB. -- -- 3 50 50 100 2 CSE 3.1.8 OBJECT ORIENTED PROGRAMMING LAB. -- -- 3 50 50 100 2 CSE 3.1.9 SOFT SKILLS LAB. -- -- 3 100 100 1 TOTAL CREDITS 29 ELECTIVE-I : [1]. COMPUTER GRAPHICS, [2]. DIGITAL SIGNAL PROCESSING , [3]. FAULT TOLERANT COMPUPTING, [4]. COMBINATORICS & GRAPHIC THEORY. 2 III/IV B.TECH.(CSE) II - SEMESTER B.TECH. (CSE) 3rd YEAR II-SEMESTER SCHEME OF INSTRUCTION AND EXAMINATION With effect from 2006-07 admitted batch Sub. Ref. No. Name of the Subject Periods Maximum Marks Credits Theory Tutorial Lab. Exam Sessionals Total CSE 3.2.1 COMPILER DESIGN 3 1 -- 70 30 100 4 CSE 3.2.2 DESIGN & ANALYSIS OF ALGORITHMS 3 1 -- 70 30 100 4 CSE 3.2.3 DATA BASE MANAGEMENT SYSTEMS 3 1 -- 70 30 100 4 CSE 3.2.4 DATA COMMUNICATIONS 3 1 -- 70 30 100 4 CSE 3.2.5 ELECTIVE - II 3 1 -- 70 30 100 4 CSE 3.2.6 COMPUTER ARCHITECTURE 3 1 -- 70 30 100 4 CSE 3.2.7 MICROPROCESSOR-II LAB. -- -- 3 50 50 100 2 CSE 3.2.8 DBMS LAB. -- -- 3 50 50 100 2 TOTAL CREDITS 28 ELECTIVE - II [1]. PRINCIPLES OF PROGRAMMING LANGUAGE, [2]. BIO-INFORMATICS . [3]. IMAGE PROCESSING. [4]. VHDL [5] WEB TECHNOLOGIES IV/IV B.TECH.(CSE) I - SEMESTER B.TECH. (CSE) 4th YEAR I-SEMESTER SCHEME OF INSTRUCTION AND EXAMINATION With effect from 2006-07 admitted batch Sub. Ref. No. Name of the Subject Periods Maximum Marks Credits Theory Tutorial Lab. Exam Sessionals Total CSE 4.1.1 OBJECT ORIENTED SOFTWARE ENGG. 3 1 -- 70 30 100 4 CSE 4.1.2 COMPUTER NETWORKS 3 1 -- 70 30 100 4 CSE 4.1.3 ARTIFICIAL INTELLIGENCE 3 1 -- 70 30 100 4 CSE 4.1.4 MANAGEMENT PRINCIPLES 3 1 -- 70 30 100 4 CSE 4.1.5 ELECTIVE-III 3 1 -- 70 30 100 4 CSE 4.1.6 OPERATIONS RESEARCH 3 1 -- 70 30 100 4 CSE 4.1.7 GRAPHICS & MULTIMEDIA LAB. -- -- 3 50 50 100 2 CSE 4.1.8 OBJECT ORIENTED SOFTWARE ENGG. LAB. -- -- 3 50 50 100 2 CSE 4.1.9 INDUSTRIAL TRAINING 2 TOTAL CREDITS 30 ELECTIVE-III : [1]. EMBEDDED SYSTEMS, [2]. NEURAL NETWORKS & FUZZY LOGIC, [3]. RANDOM PROCESSES IN ENGINEERING. IV/IV B.TECH.(CSE) II - SEMESTER B.TECH. (CSE) 4th YEAR II-SEMESTER SCHEME OF INSTRUCTION AND EXAMINATION With effect from 2006-07 admitted batch Sub. Ref. No. Name of the Subject Periods Maximum Marks Credits Theory Tutorial Lab. Exam Sessionals Total CSE 4.2.1 DISTRIBUTED OPERATING SYSTEMS 3 1 -- 70 30 100 4 CSE 4.2.2 CRYPTOGRAPHY AND NETWORK SECURITY 3 1 -- 70 30 100 4 CSE 4.2.3 DATA WARE HOUSING & DATA MINING 3 1 -- 70 30 100 4 CSE 4.2.4 DATA COMMUNICATIONS & NETWORK PROGRAMMING LAB -- -- 3 50 50 100 2 CSE 4.2.5 PROJECT -- -- 3 50 50 100 8 TOTAL CREDITS 22 3 II/IV B.TECH.(CSE) I - SEMESTER CSE 2.1.1 ELECTRONICS – I Credits:4 Instruction: 3 Periods & 1 Tut /week Sessional Marks: 30 Univ. Exam : 3 Hours Univ-Exam-Marks:70 I. Semiconductors : Electronic Emission from metal carrier concentration in an intrinsic Semiconductors open circuited PN junction – diffusion. II. PN Junction Diode : PN Junction Diode, VI Characteristics of PN Junction Diode, capacitate effects in PN Junction Diode, Quantitative theory of PN Junction Diode. III. Special Devices: Principles, Working of zero diode, Tunnel diode, Varactor diode, Schottky diode, SCR and UJT. IV. Transistors: The bipolar junction Transistor – Operation of PNP and NPN Transistors – Transistor Circuit configurations- characteristics of a CE configurations – h parameter, low frequency small signal equivalent circuit of a Transistor. V. Transistor Biasing and thermal stabilization: Transistor Biasing, stabilization, Different methods of transistor biasing – Fixed bias, Collector feedback bias – self bias – Bias compensation. VI. Field Effect Transistors: Junction Field Effect Transistors (JFET) – JFET characteristics, JFET Parameters, Small equivalent circuit – MOSFETS – Depletion and Enhancement MOSFETS. VII. Rectifying circuits: Half wave and full wave rectifiers – Bridge rectifiers – rectifier efficiency, Ripple and regulation – Shunt capacitor filter – Zener regulation. VIII. Transistor Amplifiers: CE, CB, CC amplifier configurations – Analysis using h- parameters – Multistage amplifier – RC coupled amplifier – frequency response curve and bandwidth. TEXT BOOK: Electronic Device and Circuits by Sanjeev Gupth. REFERENCE: Integrated Electronics by Millman & Halkias. 4 CSE 2.1.2 ELEMENTS OF ELECTRICAL ENGINEERING Credits:4 Instruction: 3 Periods & 1 Tut / week Sessional Marks: 30 Univ. Exam : 3 Hours Univ-Exam-Marks:70 Magnetic circuits: Definitions of magnetic circuit, Reluctance, Magneto-motive force), magnetic flux, Simple problems on magnetic circuits, Hysterisis loss. Electromagnetic Induction : Faraday’s laws of Electromagnetic Induction, Induced E.M.F., Dynamically induced E.M.F., Statistically induced EMF, Self Inductance, Mutual Inductance. D.C. Generators: D.C.Generator principle, construction of D.C. generator, E.M.F equation of D.C. generator, Types of D.C. generator, Efficiency, Characteristics of D.C. generator, Efficiency, Applications of D.C. generator D.C. Motors: D.C. Motor principle, working of D.C.Motors. significance of back E.M.F., Torque equation of D.C. Motors, Types of D.C. Motors, Characteristics of D.C. Motors, Speed control methods of D.C. Motors, Applications of D.C. Motor. Testing of D.C. Machines : Losses and Efficiency, Direct load test and Swinburne’s test. A.C. Circuits: Introduction to Steady State Analysis of A.C. Circuits, Single and Balanced 3 Phase Circuits. Transformers: Transformer principle, EMF equation of transformer, Transformer on load, Equivalent circuit of Transformer, Voltage regulation of Transformer, Losses in a Transformer, Calculation of Efficiency and Regulation by Open circuit and Short circuit Tests. Three phase Inductance Motor: Induction Motor working principle. Construction of 3 Phase induction Motor, Principle of operation. Types of 3 phase induction Motor., Torque Equation of Induction Motor., slip – Torque characteristics., Starting Torque, Torque under running condition., Maximum Torque Equation., Power stages of Induction Motor., Efficiency Calculation of Induction Motor by direct loading. Alternator: Alternator working principle, EMF equation of Alternator, Voltage Regulation by Sync. Impedance method. Synchronous Motor: Synchronous Motor principle of Operation, Construction., Methods of starting of synchronous motor Text Book: “Elements of Electrical Engineering and Electronics” by V.K.Mehta, S. Chand & Co Reference Book: “A First Course in Electrical Engineering” by Kothari. 5 CSE 2.1.3 DATA STRUCTURES Credits:4 Instruction: 3 Periods & 1 Tut/week Sessional Marks: 30 Univ. Exam : 3 Hours Univ-Exam-Marks:70 Introduction to Data Structures: Information and Meaning – Representation of Multi- Dimensional Arrays _ Review of C Programming. The Stack: Primitive operations – As an Abstract Data Type – Implementing the Stack operations in C. Infix, Postfix and Prefix: Definitions, Evaluation and Conversions using C. Recursion: Recursive Definition and Processes, Recursion in C and Recursive Implementation of Applications. Simulation of Recursion – Efficiency of Recursion. Queues and Lists: The Queue as Abstract Data Type – Sequential Representation _Types of Queues – Operations – Implementation in C. Linked List: Operations – Implementation of Stacks, Queues and priority Queues in C. Circular Lists: Insertion, Deletion and Concatenation Operations _ Stacks and Queues as Circular Lists _ Doubly Linked Lists _Applications. Trees: Binary Trees Operations and Applications. Binary Tree Representation: Node Representation – Implicit array Representation – Choice of Representation – Binary Tree Traversal – Threaded Binary Trees and their Traversal – Trees and their Applications Sorting: General Background: Efficiency – The big 0 Notation – Efficiency of Sorting. Bubble Sort and Quick Sort and their Efficiency – Selection Sorting – Binary Tree Sort – Heap Sort – Insertion Sorts – Shell Sort – Address calculation Sort – Merge and Radix Sorts. Searching: Basic Searching Techniques: Dictionary as an Abstract Data Type – Algorithmic Notation – Sequential Searching and its Efficiency – Binary Search – Interpolation Search. Tree Searching: Insertion into a Binary Search Tree – Deleting from a Binary Search Tree – Efficiency of Binary Search Tree operation Graphs and Their Application: Graphs: Application of Graphs – Representation of Graphs in C – Transitive closure – Warshall’s Algorithm – Shortest Path Algorithm. Linked Representation of Graphs: Dijikstra’s Algorithm – Organizing the set of Graph Nodes – Application to Scheduling and its implication. Graph Traversal and Spanning Forests – Undirected Graph and their Traversals, Applications and Efficiency – Minimal Spanning Trees –Prim’s and Kruskal’s Algorithms. Textbooks: 1. Data Structures Using C and C++ Yddish Langsam, Moshe J. Augenstein and Aaron M. Tanenbaum, Prentice Hall Of India (2nd Edition) (Chapters 1 to 8) 2. Data Structures, Algorithms and Applications with C++, Sahani Mc-Graw Hill. Note: All Implementation are Using C Language only. 6 CSE 2.1.4 DISCRETE MATHEMATICAL STRUCTURES - I Credits:4 Instruction: 3 Periods & 1 Tut/week Sessional Marks: 30 Univ. Exam : 3 Hours Univ-Exam-Marks:70 Introduction: Sets-Operations on sets-relations-functions-Proof methods and problem solving strategies- Fundamentals of Logic- Logical inferences-Methods of proof of an implication-First Order logic and Other Proof methods-Rules of inference for quantified Propositions-Mathematical Induction Elementary Combinatorics: Basics of Counting- Combinations and Permutations-Their Enumeration with and without repetition-Binomial coefficients-Binomial and Multinomial Theorems-The Principle of Inclusion-Exclusion. Recurrence Relations: Generating Functions of Sequences-Calculating their Coefficients- Recurrence relations-Solving recurrence relations-Method of characteristic Roots- Non-homogeneous Recurrence relations and their solutions Relations and Digraphs: Relations and Directed Graphs-Special Properties of Binary relations- Equivalence Relations-Ordering Relations-Lattices and Enumeration- Operations on relations-Paths and Closures-Directed Graphs and Adjacency matrices- Applications of sorting, searching and topological sorting. Graphs: Basic concepts-Isomorphism-subgraphs-Planar Graphs-Euler’s formula- Multigraphs and Euler circuits-Hamiltonian graphs-Chromatic numbers-Four color theorem. Trees: Trees and their properties-Trees as graphs-spanning trees-Directed trees-Binary trees-Their traversals-Arithmetic and Boolean expressions as trees- height balanced trees. Text Book: “Discrete Mathematics for computer scientists & Mathematicians” by Joe L. Mott, Abraham Kandel & T. P. Baker, Prentice Hall of India Ltd, New Delhi Reference Books: 1) “Discrete mathematics and its applications” by Keneth. H. Rosen, , Tata McGraw- Hill Publishing Company, New Delhi 2) “ Discrete mathematics” by Richard Johnsonbaug, Pearson Education, New Delhi 7 CSE 2.1.5 PROBABILITY, STATISTICS & QUEUING THEORY Credits:4 Instruction: 3 Periods & 1 Tut/week Sessional Marks: 30 Univ. Exam : 3 Hours Univ-Exam-Marks:70 Probability: Definitions of probability, Addition theorem, Conditional probability, Multiplication theorem, Bayes theorem of probability and Geometric probability. Random variables and their properties, Discrete Random variable, Continuous Random variable, Probability Distribution joint probability distributions their properties, Transformation variables, Mathematical expectations, probability generating functions. Probability Distributions / Discrete distributions: Binomial, Poisson Negative binominal distributions and their properties. (Definition, mean, variance, moment generating function., Additive properties, fitting of the distribution.) Continuous distributions: Uniform, Normal, exponential distributions and their roperties. Curve fitting using Principle of Least Squares. Multivariate Analysis: Correlation, correlation coefficient, Rank correlation, Regression Analysis, Multiple Regression, 2 Attributes, coefficient of Association, χ – test for goodness of fit, test for independence. Sample, populations, statistic, parameter, Sampling distribution, standard error, unbiasedness, efficiency, Maximum likelihood estimator, notion & interval estimation. Testing of Hypothesis: Formulation of Null hypothesis, critical region, level of significance, power of the test. Small Sample Tests: Testing equality of .means, testing equality of variances, test of correlation coefficient, test for Regression Coefficient. Large Sample tests: Tests based on normal distribution Queuing theory: Queue description, characteristics of a queuing model, study state solutions of M/M/1: α Model, M/M/1 ; N Model. Text Book: Probability, Statistics and Random Processes by T.Veerarajan, Tata McGraw Hill Reference Book: Probability & Statistics with Reliability, Queuing and Computer Applications by Kishor S. Trivedi , Prentice Hall of India ,1999 8 CSE 2.1.6 DIGITAL LOGIC DESIGN Credits:4 Instruction: 3 Periods & 1 Tut. /week Sessional Marks: 30 Univ.-Exam : 3 Hours Univ-Exam-Marks:70 1. Binary Systems, Boolean Algebra and Logic Gates. Digital Systems. Binary Numbers. Number Base Conversions. Octal and Hexadecimal Numbers. Complements. Signed Binary Numbers. Binary Codes. Binary Storage and Registers. Binary Logic Basic Definitions. Axiomatic Definition of Boolean Algebra. Basic Theorems and Properties of Boolean Algebra. Boolean Functions. Canonical and Standard Forms. Other Logic Operations. Digital Logic Gates. Integrated Circuits. 2. Combinational Logic Design, Gate-Level Minimization. The Map Method. Four-Variable Map. Five-Variable Map. Product of Sums Simplification. Don't-Care Conditions. NAND and NOR Implementation. Other Two- Level Implementations. Exclusive-OR Function. Hardware Description Language (HDL). Combinational Logic Combinational Circuits. Analysis Procedure. Design Procedure. Binary Adder- Subtractor. Decimal Adder. Binary Multiplier. Magnitude Comparator. Decoders. Encoders. Multiplexers. HDL For Combinational Circuits. 3. Sequential Logic Design, Synchronous Sequential Logic Sequential Circuits. Latches. Flip-Flops. Analysis of Clocked Sequential Circuits. HDL For Sequential Circuits. State Reduction and Assignment. Design Procedure. Registers ad Counters. Registers. Shift Registers. Ripple Counters. Synchronous Counters. Other Counters. HDL for Registers and Counters. Fundamentals of Asynchronous Sequential Logic Introduction. Analysis Procedure. Circuits With Latches. Design Procedure. Hazards 4. Memory and Programmable Logic Introduction. Random-Access Memory. Memory Decoding. Error Detection and Correction. Read-Only Memory. Programmable Logic Array. Programmable Array Logic. Sequential Programmable Devices. rd TEXT BOOK : Digital Design, 3 Edition, M. Morris Mano, Pearson Education, Inc., 2002 REFERENCE BOOKS:1. Digital Logic Design Principles, Norman Balabanian and Bradley Carlson, John Wiley & Sons(Asia) Pte. Ltd., 2002 2. Fundamentals of Digital Circuits, A. Ananda Kumar, PHI, 2002 3. Digital Circuits and Design, 2nd Edition,S Salivahanan and S Arivazhagan, Vikas Publishing House Pvt. Ltd., 2003 4. Fundamentals of Digital Logic with VHDL Design, Stephen Brown and Zvonko Vranesic, Tata McGraw-Hill Edition, 2002 9 CSE2.1.7 ELECTRICAL ENGINEERING LAB Credits:2 Lab: 3 Periods /week Sessional Marks: 50 Univ.-Exam : 3 Hours Univ-Exam-Marks:50 Cycle I 1. O.C.C and Load Characteristics of a D.C Shunt Generator. 2. O.C.C and Load Characteristics of a D.C Separately Excited Generator. 3. O.C and S.C Test on a Single Phase Transformer. 4. O.C and S.C. Test on a D.C Shunt Motor. Cycle II 1. No Load and Blocked rotor tests on a 3 - φ Squirrel cage I.M. 2. Load test on a 3 - φ Slip ring Induction Motor. 3. Power measurement in a 3 - Phase Balanced A.C circuit using two wattmeter method. 4. O.C & S.C .C test on a 3 -phase alternator (Synchronous impedance method of regulator calculation. 10 CSE2.1.8 DATA STRUCTURES LAB Credits:2 Lab: 3 Periods /week Sessional Marks: 50 Univ.-Exam : 3 Hours Univ-Exam-Marks:50 1. Write a program to implement the operations on stacks. 2. Write a program to implement the operations on circular queues 3. Write a program for sorting a list using Bubble sort and then apply binary search. 4. Write a program to create a binary search tree and for implementing the in order, preorder, post order traversal using recursion 5. Write a program for finding the Depth First Search of a graph, and Breadth First Search of a graph 6. Write a program for converting a given infix expression to postfix form 7. Write a program for evaluating a given postfix expression 8. Write a program for implementing the operations of a dequeue 9. Write a program for the representation of polynomials using circular linked list and for the addition of two such polynomials 10. Write a program for quick sort 11. Write a program for Heap sort 12. Write a program for Merge sort. 13. a) Write a program for finding the transitive closure of a digraph b) Write a program for finding the shortest path from a given source to any vertex in a digraph using Dijkstra’s algorithm