Syllabus of 3rd Year

Dr.B.R.
Ambedkar University
College of Engineering (CoE), Etcherla, Srikakulam
III B. Tech. I Semester
Formal Language & Automata Theory (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Course code PCC-CS13
Category CSE
Course title Formal Language & Automata Theory
Scheme and Credits L T P Credits
3 0 0 3
Pre-requisites (if any)
Course Objectives:
Upon completing the course, the student will:
1. Develop a formal notation for strings, languages and machines.
2. Design finite automata to accept a set of strings of a language.
3. Prove that a given language is regular and apply the closure properties of languages.
4. Design context free grammars to generate strings from a context free language and
convert them into normal forms.
5. Prove equivalence of languages accepted by Push Down Automata and languages
generated by context free grammars
6. Identify the hierarchy of formal languages, grammars and machines.
7. Distinguish between computability and non-computability and Decidability and
undecidability.
UNIT 1
Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky
hierarchy of languages. Automata Theory, Automation, Finite Automation, Transition
Systems, Regular languages Regular expressions and languages, deterministic finite automata
(DFA) and equivalence with regular expressions, nondeterministic finite automata (NFA) and
equivalence with DFA, Acceptance of a String by a Finite Automation, DFA, Design of
DFAs, NFA, Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA,
Finite Automata with E-Transition, Minimization of Finite Automata, Mealy and Moore
Machines, Applications and Limitation of Finite Automata. regular grammars and
equivalence with finite automata, properties of regular languages, pumping lemma for regular
languages, minimization of finite automata.
Learning outcomes
1. Distinguish DFA and NFA and Construct DFA for an input string
2. Perform minimization of Automata and construct finite automata for the given
regular expression.
3. Compare Moore and Mealy Machines.
UNIT 2
Context-free languages:
Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms,
parse trees, ambiguity in CFG, pumping lemma for context-free languages, deterministic
closure properties of CFLs. Context-sensitive languages: Context-sensitive grammars (CSG)
and languages, linear bounded automata and equivalence with CSG.
Learning outcomes
1. Define Context Free Grammar
2. Differentiate between Chomsky Normal Form and Greibach Normal form
3. Apply Pumping Lemma theorem on Context Free Grammar
UNIT 3
Pushdown automata:
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description
Language Acceptance of pushdown Automata, Design of Pushdown Automata, Deterministic
and Non – Deterministic Pushdown Automata, Equivalence of Pushdown Automata and
Context Free Grammars Conversion, Two Stack Pushdown Automata, Application of
Pushdown Automata.
Learning outcomes
1. Define acceptance of pushdown automata.
2. Build Pushdown Automata for context free grammar.
3. List the applications of Pushdown Automata.
UNIT 4
Turing machines: The basic model for Turing machines (TM), Turing-recognizable
(recursively enumerable) and Turing-decidable (recursive) languages and their closure
properties, variants of Turing machines, nondeterministic TMs and equivalence with
deterministic TMs, unrestricted grammars and equivalence with Turing machines, TMs as
enumerators. Undecidability: Church-Turing thesis, universal Turing machine, the universal
and diagonalization languages, reduction between languages and Rice s theorem, undecidable
problems about languages.
Learning outcomes
1. List types of Turing Machines
2. Design Turing Machine
3. Formulate decidability and undecidability problems.
Course Outcomes:
After completing this course, the student will be able to:
1. Write a formal notation for strings, languages and machines.
2. Design finite automata to accept a set of strings of a language.
3. For a given language determine whether the given language is regular or not.
4. Design context free grammars to generate strings of context free language .
5. Determine equivalence of languages accepted by Push down Automata and languages
generated by context free grammars
6. Write the hierarchy of formal languages, grammars and machines.
7. Distinguish between computability and non-computability and Decidability and
undesirability.
Suggested books
1. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata
Theory, Languages, and Computation, Pearson Education Asia.
2. Introduction to Automata Theory, Languages and Computation, J.E.Hopcroft, R.Motwani
and J.D.Ullman, 3rd Edition, Pearson, 2008.
3. Theory of Computer Science-Automata, Languages and Computation, K.L.P.Mishra and
N.Chandrasekaran, 3rd Edition, PHI, 2007.
Suggested reference books:

1. Formal Language and Automata Theory, K.V.N.Sunitha and N.Kalyani, Pearson, 2015.
2. Introduction to Automata Theory, Formal Languages and Computation, Shyamalendu
Kandar, Pearson, 2013.
3. Theory of Computation, V.Kulkarni, Oxford University Press, 2013.
4. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of
Computation, Pearson Education Asia.
5. Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer
Science, Springer.
6. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing.
7. John Martin, Introduction to Languages and The Theory of Computation, Tata
McGraw Hill.
Web links:
1. https://www.javatpoint.com/theory-of-automata
2. https://en.wikipedia.org/wiki/Automata_theory
3. https://www.geeksforgeeks.org/toc-finite-automata-introduction/
4. https://www.britannica.com/topic/automata-theory
Dr.B.R.Ambedkar University
Computer Networks (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Computer Networks
3 1 0 3.5
Course Objectives:
1. Explains the Data Communications System and its components, different types of
networktopologies and protocols.
2. Demonstrate different layers of ISO, TCP/IP models and protocols and illuminate its
function.
3. Apply knowledge of different techniques of error detection and correction to detect
andsolve error bit during data transmission.
4. Analyze main protocols such as HTTP, FTP, SMTP, TCP, UDP, IP.
Unit I
Introduction: Data Communication, Components, Data Representation, Data Flow;
Networks:Distributed Processing, Network Criteria, Physical Structures, Network Models,
Categories ofNetwork, Interconnection of Networks; The OSI models: Layered architecture,
peer-to-peerprocess, Encapsulation, Layers in OSI model, TCP/IP protocol suite,
Addressing: PhysicalAddress, Logical Address, Port Address, Specific Address.
Learning outcomes:
1. Understand the different topologies and network criteria’s
2. Demonstrates the different network models and their architectures.
Unit II
Data Link Layer: Design Issues, Services Provided to Network Layer, Framing, Error
Controland Flow Control, Error Detection and Correction- Error Correcting codes, Error
Detectingcodes, Elementary Data Link Protocols, Sliding Window Protocols- A one-bit
sliding windowprotocol, A Protocol Using GO BACK N, A Protocol Using Selective Repeat,
Examples DataLink Protocols- HDLC; The Medium Access Control Sublayer: Multiple
Access Protocol-ALOHA, Carrier Sense Multiple Access Protocols, Collision-Free protocols,
Limited ContentionProtocol.
Learning outcomes:
1. Illustrates in detail about the Data link layer of the OSI reference model
2. Give the Examples for the Data link protocols.
Unit III
The Network Layer: Network Layer Design Issues-Services Provided to Transport
Layer,Implementation of Connection Less Service, Implementation of Connection Oriented
Service,Virtual-Circuit and Datagram Subnets, Routing Algorithms: The Optimality
Principle, ShortestPath Routing, Flooding, Distance Vector Routing, Link State Routing,
Hierarchical Routing,Broad Cast Routing, Multicast Routing, Congestion Control
Algorithms: General Principles ofCongestion Control, Congestion Prevention Policies, The
Network Layer in Internet-The IP Protocol, IP Address-IPV4, IPV6.
Learning outcomes:
1. Explain in brief about the Network layer of the OSI reference model.
2. Apply the different network routing algorithms on the networks
Unit IV
Module 1:
The Transport Layer: Process-to-Process Deliver, Client/Server Paradigm,
Multiplexing,Connectionless verses Connection Oriented Services, Reliable verses
Unreliable; UDP: WellknownPorts for UDP, User Datagram, Checksum, UDP Operations
and Uses of UDP; TCP:TCP Services, TCP Features, TCP Segment, a TCP Connection-
Connection Establishment, Data Transmission, Connection Termination.
Module 2:
The Application Layer: DNS- Domain Name System- The DNS Name Space,
ResourceRecords, Name Servers, SNMP, Electronic Mail- Architecture and Services, The
User Agent,Message Format, Message Transfer, Final Delivery, the World Wide Web-
Architectural Overview, Static Web Document, Dynamic Web Document; Hyper Text
Transfer Protocol(HTTP).
Learning outcomes:
1. Differentiate the Connectionless and connection oriented services by using transport
layer deliver system
2. Explains how can the protocols are used in the OSI reference model
3. Analyze the features and their operations of protocols that are used in the internet.
Course Outcomes:
1. Identify and enumerate different types of network topologies, protocols and the layers of
the OSI and TCP/IP models and explain the functions of each layer.
2. Explain the protocols of Data Link Layer and MAC Sublayer and illustrate how a network
can detect and correct transmission errors.
3. Classify and compare the major routing and congestion control algorithms and understand
how a packet is routed over the internet.
4. Describe how TCP and UDP function, its uses and summarize the differences between
them.
5. Analyze the features and operations of various Application layer protocols such as http,
DNS, and SMTP.
Text Books:
1) Andrew S. Tanenbaum, Computer Networks, 5th Edition, Pearson Education, 2016.
2) Behrouz A Forouzan, Data Communications and Networking, 4th Edition, McGraw-
Hill,2006.
Reference Books:
1) S Keshav, An Engineering approach to computer Networking, 2nd Edition,
PearsonEducation.
2) J.F.Kurose, K.W.Ross, Computer Networking a Top-Down approach featuring theinternet,
2nd Edition, Pearson Education.
Reference Link :
1. http://nptel.ac.in/courses/Webcoursecontents/
IIT%20Kharagpur/Computer%20networks/New_index1.html
Web Technologies (For CSE Branch)
Category CSE
Course title Web Technologies
3 1 0 3
Course Objectives:
1. Understanding the need of web applications & available technologies.
2. Creating web pages by using HTML and applying JavaScript validations
3. Understanding the use of XML in Advanced Web Technologies
4. Understanding Database Connectivity concepts.
5. Creating interactive web pages by Using Servlets and JSP
Unit I
HTML Introduction, Common tags – Headings, Links, Paragraphs, Lists, Tables, images,
forms, Frames; Introducing Cascading Style sheets: Inline styles, External Style Sheets,
Internal Style Sheets, Style Classes, Multiple Styles
Learning outcomes:
1. Understand the concepts of web applications by using HTML.
2. Apply the CSS to the created HTML pages
Unit II
Introducing Java Script: Introduction, Embedding JavaScript in an HTML Page, Handling
Events, Using Variables & Arrays in Java Script
AJAX: Introduction, Creating a simple AJAX Application
XML: Introduction, XML Basics, Document Type Definition, XML Schemas,
XML Processors: DOM and SAX
Learning outcomes:
1. Apply the java script validations to the web pages
2. Creating the AJAX Applications and the XML pages .
Unit III
JDBC:Introduction, Exploring JDBC Drivers, Describing JDBC APIs, JDBC Drivers,
Exploring JDBC Processes with java.sql package. Introduction to Servlets, Exploring the
features of Java Servlets, The Servlet Lifecycle, The Servlet API, web.xml Configuration,
Reading parameters (ServletConfig, ServletContext).
Learning outcomes:
1. Illustrates the concepts of the data base connectivity components
2. Explains the servlets and their applications and the parameters of the servelets.
Unit IV
Introduction to JSP: Understanding JSP, Describing the JSP Lifecycle, Creating Simple JSP
pages, JSP Implicit Objects, Using Cookies & Session Tracking, accessing a Database from a
JSP Page, Introduction to MVC Architecture.
Learning outcomes:
1. Creating the JSP pages and introduces the all concepts of JSP.
2. Expalins the MVC Architecture.
Course Outcomes:
1. Build the principles of Web based application development using HTML.
2. Validate the dynamic content in Web Pages using JavaScript and Apply the Styles to the web
pages
3. Retrieve the data from XML files using parsers and design applications using java servelets.
4. Connect java programs to different databases and develop the EJB programms
5. Integrate Database Applications with the Web Applications.
Text Books:
1. Web Technologies Black Book, Kogent Learning Solutions Inc, Dreamtech Press
Reference Books:
1. Web Programming, building internet applications, Chris Bates 2nd edition,
WILEYDreamtech
2. The complete Reference Java 2 Fifth Edition by Patrick Naughton and Herbert
Schildt.TMH
3. Java Server Pages –Hans Bergsten, SPD O’Reilly 2. Internet and World Wide Web – How
to program by Dietel and Nieto PHI/Pearson Education Asia.
Reference Links:
1. https://www.mooc-list.com/course/introduction-web-development-coursera
2. https://www.edx.org/course/introduction-html-javascript-microsoft-dev211-1x-0
3. http://infolab.stanford.edu/~ullman/fcdb/oracle/or-web.html
Dr.B.R. Ambedkar University

Design and analysis of algorithms (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Design and analysis of algorithms
3 0 1 3.5
Pre-requisites (if any) PCC-CS2
Course Objectives:
1. Analyze the asymptotic performance of algorithms.
2. Write rigorous correctness proofs for algorithms.
3. Demonstrate a familiarity with major algorithms and data structures.
4. Apply important algorithmic design paradigms and methods of analysis.
5. Synthesize efficient algorithms in common engineering design situations.
UNIT I
Introduction (9 Lectures)
Characteristics of algorithm, Analysis of algorithm: Asymptotic analysis of complexity
bounds – best, average and worst-case behaviour; Performance measurements of Algorithm,
Time and space trade-offs, Analysis of recursive algorithms through recurrence relations:
Substitution method, Recursion tree method and Masters’ theorem.
Learning outcomes
1. Understand the asymptotic analysis of complexity bounds and performance
measurements of algorithms.
2. Illustrates the recurrence relations.
3. Analysis of recursive algorithms through recurrence relations.
UNIT II
Fundamental Algorithmic Strategies (10 Lectures)
Brute-Force, Greedy, Dynamic Programming, Branch- and- Bound and 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.
Learning outcomes
1. Illustrates the techniques greedy method and multistage graphs.
2. Illustrates the techniques 0/1 Knapsack problem using branch and bound concept.
3. Solve travelling sales person problem using dynamic programming.
UNIT III
Graph and Tree Algorithms (15 Lectures)
Traversal algorithms: Depth First Search (DFS) and Breadth
First Search (BFS); shortest path algorithms, Transitive closure, Minimum Spanning Tree,
Topological sorting, Network Flow Algorithm: Ford Fulkerson Algorithm, Max Flow-Min
Cut; Bipartite Matching. String matching Algorithm: Rabin – Karp algorithm, Knuth –
Morris Pratt algorithm.
Learning outcomes of unit 3:

1. Illustrate basic traversing and techniques for trees and graphs
2. Illustrates the string matching algorithms.
UNIT IV
Tractable and Intractable Problems (10 Lectures)
Computability of Algorithms, Computability classes-P, NP, NP-complete and NP-
hard. Cooks theorem, standard NP-complete problems and reduction techniques.
Advanced Topics: Approximation algorithms, Randomized algorithms, Class of
problems beyond NP – P SPACE
Learning outcomes of unit 4:

1. Understand the lower bound theory concept.
2. Illustrates the NP-hard and NP-complete problems.
3. Apply the reduction techniques on tractable and intractable problems.
Course Outcomes:
1. For a given algorithms analyze worst-case running times of algorithms based on
asymptotic analysis and justify the correctness of algorithms.
2. Describe the greedy paradigm and explain when an algorithmic design situation calls for
it. For a given problem develop the greedy algorithms.
3. Describe the divide-and-conquer paradigm and explain when an algorithmic design
situation calls for it. Synthesize divide-and-conquer algorithms. Derive and solve
recurrence relation.
4. Describe the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it. For a given problems of dynamic-programming and develop the
dynamic programming algorithms, and analyze it to determine its computational
complexity.
5. For a given model engineering problem model it using graph and write the corresponding
algorithm to solve the problems.
6. Explain the ways to analyze randomized algorithms.
Suggested books:
1. Introduction to Algorithms, 4TH Edition, Thomas H Cormen, Charles E Lieserson, Ronald
L Rivest and Clifford Stein, MIT Press/McGraw-Hill.
2. Fundamentals of Algorithms – E. Horowitz et al.
Suggested reference books

1. Algorithm Design, 1ST Edition, Jon Kleinberg and ÉvaTardos, Pearson.
2. Algorithm Design: Foundations, Analysis, and Internet Examples, Second Edition,
Michael T Goodrich and Roberto Tamassia, Wiley.
3. Algorithms—A Creative Approach, 3RD Edition, UdiManber, Addison-Wesley, Reading,
MA.
Web links:
1. https://www.youtube.com/watch?
v=gY0MwGLq9W8&list=PLGdMwVKbjVQ8Ew7KUp65sRL9_k2_3xlKE
2. https://www.youtube.com/watch?v=5Y8Lfsreeck&list=PL7DC83C6B3312DF1E
3. https://www.youtube.com/watch?v=7KQf7f8ti1U
4. https://www.tutorialspoint.com/design_and_analysis_of_algorithms/index.htm
5. https://www.javatpoint.com/daa-tutorial
6. https://www2.cs.duke.edu/courses/fall08/cps230/Book.pdf
7. http://www.vssut.ac.in/lecture_notes/lecture1428551222.pdf

II B. Tech. II Semester
Machine learning (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Machine learning
3 0 0 3
Course Objectives:
1. Understand how to design a learning system and what are concept learning tasks
2. Analyze how to apply decision tree learning in classification tasks.
3. Predicate logic as one of the knowledge representation techniques.
4. Gain an insight into the role played by neural networks in machine learning.
5. Learn the concepts of genetic algorithm and genetic programming and reinforcement
Learning.
UNIT-1
Introduction – Well defined learning problems, Designing a Learning System, Machine
learning: what and why? Types of machine learning,Issues in Machine Learning;Concept
Learning Task - General-to-specific ordering of hypotheses, Find-S, List then eliminate
algorithm, Candidate elimination algorithm, Inductive bias
Learning outcomes:
1. State the machine learning and their issues.
2. List then eliminate algorithm, Candidate elimination algorithm, Inductive bias
UNIT-2
Decision Tree Learning - Decision tree learning algorithm-Inductive bias- Issues in
Decision tree learning; Artificial Neural Networks – Perceptrons, Gradient descent and the
Delta rule, Adaline, Multilayer networks, Derivation of backpropagation rule,
Backpropagation Algorithm, Convergence, Generalization
Learning outcomes:
1. Discuss about the decision tree learning and inductive bias and issues in decision tree
learning.
2. Describe the artificial neural networks Perceptrons and the multi-layer networks
UNIT-3
Evaluating Machine Learning algorithms and Model Selection, Ensemble Methods
(Boosting, Bagging, and Random Forests), Learning set of rules
Bayesian Learning: Introduction, Bayes Theorem, Bayes Theorem and Concept Learning.
Instance-Based Learning: Introduction, k-Nearest Neighbor Learning, Locally Weighted
Regression.
Genetic Algorithms: Motivation, Genetic Algorithms, an Illustrative Example, Hypothesis
Space Search, Genetic Programming.
Learning outcomes:
1. Learn about the Evaluating Machine Learning algorithms and Model Selection,
Ensemble Methods
2. Predicts the instant based learning and generic programming
UNIT-4
Analytical Learning: Introduction,Learning with perfect domain theories,Remarks on
explanation based learning, explanation based learning of search control knowledge.
Reinforcement Learning: Introduction, Learning Task Q Learning, on deterministic rewards
and actions, temporal difference learning, generalizing from examples, Relationship to
dynamic programming.
Learning outcomes:
1. Identify the Analytical Learning and the explanation based learning.
2. Predict the Reinforcement Learning and the generalizing from examples, Relationship
to dynamic programming.
Course Outcomes:
1. Have a broad understanding of machine learning algorithms and their use in data-driven
knowledge discovery and program synthesis.
2. Identify, formulate and solve machine learning problems that arise in practical
applications
3. Understand instance based learning algorithms.
4. Design a neural network to solve classification and function approximation problems.
5. Build optimal classifiers using genetic algorithms.
6. Understand how to apply a variety of Reinforcement learning algorithms to data.
Text Books
1. Tom M. Mitchell, Machine Learning, McGraw Hill Education (India) Private Limited,
2013.
2. Introduction to Machine Learning by EthemAlpaydin, Prentice-Hall of India, 2006
3. Machine Learning by SaikatDutt and Subramanian Chandramouli
Reference Books
1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012
II B. Tech. I Semester
Computer Graphics (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Course code PEC 1
Category CSE
Course title Computer Graphics
3 1 0 3
Course Objectives:
• Enlighten the working principles of display devices and understand the fundamental data
structures and algorithms used for output primitives.
• Design graphics programmes using mathematical and theoretical foundations.
• Hypothesize 3D models of objects.
• Understanding and generation of animations.
Unit – I
Application areas of computer graphics, overview of graphic system: video display devices,
Input devices, Display system architecture: Random and Raster Scan; Output primitives –
Line, Circle and Ellipse drawing algorithms; Polygon filling algorithms: Scan-line, Flood fill,
Boundary Fill. mid-point circle algorithm, polygon fill algorithm, boundary-fill.
Learning outcomes:
1. Explains the Applications of computer graphics systems and how can we use the
Computer graphics systems
2. Give a brief on the input primitives and output primitives and the their algorithms
Unit – II
Geometric transformations: 2D Geometric transformations – translation, Scaling, Rotation,
reflection and shear transformation;2D viewing; 2D Clipping – Line & Polygon: Cohen-
Sutherland, Cyrus-beck & Sutherland-Hodgeman algorithms.
3D Concepts: 3D Object representation – Polygons, Curved lines, Splines – B-Spline;
3Dtransformations- translation, Scaling, Rotation; 3D Viewing; Projections – Parallel
andPerspective.
3D Graphics: 3D basic Transformations, Projections, Curve generation, Hermite curve,
Bezier curve and B-spline curve, B-spline surfaces.
Learning outcomes:
1. Understand the concepts of 2D transformation and 2D viewing of the objects
2. Illustrates the 3D transformation, 3D Viewing and 3D graphics of the objects.
Unit – III
Visible Surface Detection: VSD classification; Algorithms: Back-face detection, Z-
bufferalgorithm, Scan-line algorithm, Depth-Sorting algorithm, Area-subdivision, BSP Tree,
Octreemethod, Painter’s algorithm.
Learning outcomes:
1. Demonstrate the visible surface detection of the object.
2. Apply the algorithms on objects that are specifies the VSD classification
Unit – IV
Animations & Overview of Ray Tracing: Animations – Steps in design sequence,
Animation languages, Raster Animation, Keyframe systems; Ray Tracing: Intersecting rays
with other primitives – Reflections and Transparency – Boolean operations on Objects.
Color Models: Intuitive color concepts, Basics of RGB Color model, YIQ Color Model,
CMY & HSV Color models.
Learning outcomes:
1. Analyse the 2D,3D,VSD and Ray tracing to perform the animations on the object
2. Apply the color models on the animated objects
Course Outcomes:
1. Demonstrate routines for generating different output primitives including: drawing lines,
conic sections, polygons, other routines for polygon filling.
2. Apply 2D transformations like translate, rotate, and scale to manipulate images and
perform clipping.
3. Generate 3D computer graphics using interpolation and approximation functions and
develop Projections.
4. Detect visible surfaces using various routines, thus hiding back faces in 3D graphics
5. Organize steps and plan for generation Computer Animation and the color models.
Text Books:
1. Donald Hearn and M Pauline Baker, “Computer Graphics C Version”,
PearsonEducation,2014
References:
1. Procedural elements for Computer Graphics, David F Rogers, Tata McGraw hill,
2ndedition.
2. Computer Graphics, Steven Harrington, TMH.
3. “Computer Graphics Principles & practice”, second edition in C, Foley, VanDam, Feiner
and Hughes, Pearson Education.
II B. Tech. I Semester
Soft Computing (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Course code PEC 1
Category CSE
Course title Soft Computing
3 0 0 3
Course Objective:
1. Understanding of the soft computing field and understand the adequate knowledge about
fuzzy set theory and Fuzzy Inference.
2. Expose the ideas about genetic algorithm
3. Demonstrate about the feedback neural networks
4. Familiar with neural networks that can learn from available examples
5. Generalize to form appropriate rules for inference systems.
Unit I
Soft Computing: Introduction to Fuzzy Computing, Neural Computing, GeneticAlgorithms,
Associative Memory, Adaptive Resonance Theory, Different Tools and
Techniques,Usefulness andApplications.
Fuzzy Logic
Fuzzy Set Theory: Basic Definition and Terminology, Set Theoretic Operations,
MembershipFunction Formulation and Parameterization, MF of two dimensions.
Fuzzy Rules and Fuzzy Reasoning: Extension Principles and Fuzzy Relations, Fuzzy IF
THENRules, Fuzzy Reasoning. Fuzzy Inference System Introduction, Mamdani Fuzzy
Models,Sugeno Fuzzy Models.
Derivative-free Optimization: Genetic Algorithms, Simulated Annealing, Random Search
Learning outcomes:
1. Discuss the concepts of soft computing
2. Understand the Fuzzy set theory, fuzzy rules and reasoning
3. Execute the derivative free optimization algorithms
Unit II
Artificial Neural Networks
Introduction, Artificial Neuron and its model, activationfunctions, Neural network
architecture: single layer and multilayer feed forward networks,re-current networks. Various
learning techniques, perception and convergence rule, Auto-associativeand hetro-associative
memory, Hebb’s Learning, Adaline,Perceptron.
Learning outcomes:
1. Associate the Neurons and its models and their functions
2. Infer the neural networks and the learning techniques.
Unit III
Module 1:
Multilayer Feed Forward Network: Back Propagation Algorithms, Different
IssuesRegarding Convergence of Multilayer Perceptron, Competitive Learning, Self-
Organizing, FeatureMaps, Adaptive Resonance Theory, Associative Memories,Applications.
Module 2:
Evolutionary and Stochastic Techniques: Genetic Algorithm (GA),
GeneticRepresentations, (Encoding) Initialization and Selection, Different Operators of GA,
Analysis ofSelection Operations, Hypothesis of Building Blocks, Schema Theorem and
Convergence ofGenetic Algorithm, Simulated Annealing and Stochastic Models, Boltzmann
Machine,Applications.
Learning outcomes:
1. Discuss the multilayer feed forward network and their algorithms to solve the
problems.
2. Write the algorithms to evolutionary and stochastic techniques
Unit IV
Rough Set: Introduction, Imprecise Categories Approximations and Rough Sets,
Reductionof Knowledge, Decision Tables and Applications. Hybrid Systems: Neural-
Network-BasedFuzzy Systems, Fuzzy Logic-Based Neural Networks, Genetic Algorithm for
Neural Network Designand Learning, Fuzzy Logic and Genetic Algorithm for
Optimization,Applications
Learning outcomes:
1. Understand the rough set theory concepts and their applications
2. Apply the hybrid systems that are neural networks to pattern classification problems.
Course Outcomes:
1. Demonstrate Fuzzy set theory.
2. Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems
3. Analyze the genetic algorithms and their applications
4. Design single and multi-layer feed-forward neural networks
5. Apply neural networks to pattern classification problems
Text Book
1. J.S.R.Jang, C.T.Sun and E.Mizutani, "Neuro-Fuzzy and Soft Computing", PHI, 2004,
PearsonEducation 2004.
2. Rough Sets, Z.Pawlak, Kluwer Academic Publisher,1991.
3. Intelligent Hybrid Systems, D. Ruan, Kluwer Academic Publisher,1997
4. NeuralNetworks,FuzzyLogicandGeneticAlgorithm:SynthesisandApplications,S.Rajsekaran
and G.A. VijayalakshmiPai, Prentice Hall ofIndia.
References
1. Timothy J.Ross, "Fuzzy Logic with Engineering Applications", McGraw-Hill, 1997.
2. Artificial Intelligence and Intelligent Systems, N.P.Padhy, Oxford UniversityPress.
3. Neural Fuzzy Systems, Chin-Teng Lin & C. S. George Lee, Prentice HallPTR. Addison-
Wesley
4. Learning and Soft Computing, V. Kecman, MIT Press,2001
5. Fuzzy Sets and Fuzzy Logic, Klir& Yuan, PHI,1997

II B. Tech. II Semester
Advance computer architecture (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Course code PEC1
Category CSE
Course title Advance computer architecture
3 0 0 3
Course Objectives:
1. Gain the knowledge on system performance dependence attributes and calculation
ofsystem throughput.
2. Learn memory hierarchy concepts and different ways to improve the performance ofcache
memory.
3. Learn coherence, inclusion and locality properties are satisfied in memoryhierarchy.
4. Understand the linear and nonlinear scheduling processes in pipelining, variousmessage
passing techniques in Multiprocessor and Multi Vector computers.
UNIT-1
Parallel Computer: State of computing, Elements of modern computer,
Flynn’sclassification of parallel processors, System attributes to performance,
Multiprocessors andMulticomputer, Shared memory multiprocessors, Distributed memory
multiprocessors
Learning outcomes:
1. Understand the basic elements of modern computer an classification of parallel
processors and performance o system attributes
2. Shared memory multi processors and distributed memory multi processors.
UNIT-2
Memory Hierarchy Design: Basic memory hierarchy, Optimization of cache performance,
Small and simple first level cache to reduce hit time and power, Way prediction to reduce hit
time, Pipelined cache access to increase cache band width
Linear and Non-Linear Pipeline Processors: Asynchronous and synchronous
models,Clocking and timing control, Speedup, Efficiency and Throughput, Non-Linear
PipelineProcessors- Reservation and latency analysis problems, Collision free scheduling
problems,Instruction execution phases.
Learning outcomes:
1. Discuss about the memory hierarchy design
2. Predict the reduction and hit time and pipelined cache access to increase cache band
width
3. Gain the knowledge about the linear and nonlinear pipeline processors
UNIT-3
Multiprocessors and Multivector Computers: Inter connection structure-Crossbar switch
andmultiport memory, Multistage and combining network routing Multivector computers-
Vectorprocessing principles, Vector instruction types, Vector access Memory schemes
Learning outcomes:
1. Discuss the Inter connection structure-Crossbar switch and multiport memory
2. Apply theMultistage and combining network routing Multi vector computers-Vector
processing principles, Vector instruction types, Vector access Memory schemes.
UNIT-4
Cache coherence and Message Passing Mechanisms: Cache coherence problems-Two
protocol approach, Snoopy protocol, Directory based protocol, Message Passing
Mechanisms-Message routing schemes, Deadlock virtual channels, Flow control strategies,
Multicast routing algorithm.
Learning outcomes:
1. Illustrates the Cache coherence problems-Two protocol approach, Snoopy protocol,
Directory based protocol
2. Implement the Message Passing Mechanisms-Message routing schemes, Deadlock
virtual channels, Flow control strategies, Multicast routing algorithm
Course Outcomes:
Upon the completion of the course the students will be able to
1. Identify the architectural trends in the processors.
2. Familiarize with memory hierarchy and optimizing the performance of cache memory to
increase cache band with.
3. Distinguish between Linear and Non-Linear Pipeline Processors.
4. Design the interconnection structure of the Multiprocessor and Multi Vector
computers.
5. Analyze Cache Incoherence, coherence protocols and learn various message
routing mechanisms.
Text Books
1. Kai Hwang and NareshJotwani, “Advanced Computer Architecture-parallelism,
Scalability,
Programmability” 3rd Edition McGraw-Hill Publications. 2016.
Reference Books
1. John L Hennessey and David A Patterson, “Computer Architecture A Quantitative
Approach”, Morgan Kaufmann/ Elsevier, Sixth Edition, 2012

Web Technologies Lab (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Web Technologies Lab
3 0 0 3
Course Objectives:
1. Create a Complete Web technology solution through creating an online book Store
website.
2. Understand the importance of Java Script in creating a web Application
3. Understand the importance of CSS in creating a web Application
4. Creating Server Side Web Applications by using Servlets .
5. Understanding the advantage of using JSP over Servlets in creating applications
6. Creating Database connectivity Applications.
List of Experiments:
1. Design the following static web pages required for an online book store web site.
HOME PAGE:
The static home page must contain three divisions(using div tag & styles).
Top division : Logo and the college name and links to Home page, Login page, Registration
page, Catalogue page and Cart page (the description of these pages will be given below).
Left division: At least four links for navigation, which will display the catalogue of
respective links. For e.g.: When you click the link “CSE” the catalogue for CSE Books
should be displayed in the Right frame.
Right division: The pages to the links in the left frame must be loaded here. Initially this
page contains description of the web site.
2. Login page
3. REGISTRATION PAGE:
Create a “registration form “with the following fields
• Name (Text field)
• Password (password field)
• E-mail id (email field)
• Phone number (text field)
• Sex (radio button)
• Date of birth (3 select boxes)
• Languages known (check boxes – English, Telugu, Hindi, Tamil)
• Address (text area)
4. CATOLOGUE PAGE:
The catalogue page should contain the details of all the books available in the web site
in a table.
The details should contain the following:
Snap shot of Cover Page.
Author Name.
Publisher.
Price.
Add to cart button.
5. VALIDATIONS:
Write JavaScript to validate the following fields of the above registration page.
i) Name (Name should contains alphabets and the length should not be less than 6
characters).
ii) Password (Password should not be less than 6 characters length).
iii) E-mail id (should not contain any invalid and must follow the standard pattern
[email protected])
iv) Phone number (Phone number should contain 10 digits only). Note : You can also validate
the login page with these parameters.
6. CSS
Design a web page using CSS (Cascading Style Sheets) which includes the following:
1) Use different font, styles:
In the style definition you define how each selector should work (font, color etc.). Then, in
the body of your pages, you refer to these selectors to activate the styles
7. Write an XML file which will display the Book information which includes the
following:
i) Title of the book
ii) Author Name
iii) ISBN number
iv) Publisher name
v) Edition
vi) Price
Write a Document Type Definition (DTD) to validate the above XML file.
8. Install TOMCAT web server.
While installation assign port number 4040 to TOMCAT.
Access the above developed static web pages for books web site, using this server by putting
the web pages developed in experiment-1 and experiment-2 in the document root. Access the
pages by using the url : http://localhost:4040/online/books.html (for tomcat)
9. Write servlet program to read parameters from web.xml
10. Write a servlet program using cookie management
11. Write servlet program to illustrate HttpSession
12. Create tables in the database which contain the details of items (books in our case like
Book name , Price, Quantity, Amount ) of each category. Modify your catalogue page in such
a way that you should connect to the database and extract data from the tables and display
them in the catalogue page using JDBC.
13. Design Airlines Ticket Reservation System
14. Design ONLINE Banking system.
15. Design Library Information system
16. Design Gram Panchayat Information system for House tax, water tax, wealth tax, Library
tax collection, phone bill, Electricity bill collection.
17. Design student information system portal which maintain attendance, marks etc.
Course Outcomes:
The above exercise shall make the students competent in the following ways and will be able
to learn following parameters at the end of the course.
1. Able to build a complete website using HTML ,
2. Able to include JavaScript for validations
3. Able to use XML to store and forwarding data .
4. Able to develop Web applications by using JSP with More Productivity
5. Able to develop database applications
6. Able to create a complete Web Application with all the required modules.
Text Books:
1. Web Technologies Black Book, Kogent Learning Solutions Inc, Dreamtech Press
Reference Books:
1. Web Programming, building internet applications, Chris Bates 2nd edition, WILEY
Dreamtech
2. The complete Reference Java 2 Fifth Edition by Patrick Naughton and Herbert Schildt.
TMH
3. Java Server Pages –Hans Bergsten, SPD O’Reilly 2. Internet and World Wide Web – How
to program by Dietel and Nieto PHI/Pearson Education Asia.
Reference Links:
1. https://www.mooc-list.com/course/introduction-web-development-coursera
2. https://www.edx.org/course/introduction-html-javascript-microsoft-dev211-1x-0
3. http://infolab.stanford.edu/~ullman/fcdb/oracle/or-web.html

Computer networks Lab (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Computer networks Lab

3 0 0 3
Course Objectives:
1. Build and understanding of the fundamental concepts of computer networking.
2. Analyze the different layers in networks and define, use, and differentiate such
concepts as OSI-ISO, TCP/IP.
3. To be familiar with contemporary issues in networking technologies and allow the
student to gain expertise in maintenance of individual networks.
4. To know that how the routing algorithms worked out in network layer.
List of Experiments
1. Implement a data link framing method for counting characters in a given frame.
2. Implement a data link framing methods for the bit stuffing in a frame.
3. Implement a data link framing methods for character stuffing in a frame.
4. Implement a data link framing method for even and odd parity.
5. Implement the CRC encoding mechanism in data link layer.
6. Implement the CRC decoding mechanism in data link layer.
7. Implement Dijkstra’s algorithm to compute the shortest path through a graph.
8. Take an example subnet graph and obtain routing table for each node using distance
vector routing algorithm.
9. Implement a Hierarchical routing algorithm.
10. Take an example subnet of hosts. Obtain broadcast tree for it.
11. Implement the token bucket congestion control algorithm.
12. Implement the leaky bucket congestion control algorithm.
13. Implementation of sliding window protocol: go back n sliding window protocol
14. Configuration of TCP/IP Protocols in Windows
15. Installing of internal modem and connecting to Internet. B. To configure WiFi for your
PC.
Course Outcomes
1. To apply knowledge of different techniques of error detection and correction to detect and
solve error bit during data transmission.
2. Familiarity with the basic protocols of computer networks, and how they can be used to
assist in network design and implementation.
3. Understand and building the skills of routing mechanisms during packet delivery.
4. To explain the congestion control algorithms and understand how a packet is routed.
5. To be familiar with network tools and network programming.
Text Books:
1) Andrew S Tanenbaum, Computer Networks, 5th Edition, Pearson Education, 2016.
2) Behrouz A Forouzan, Data Communications and Networking, 4th Edition, McGraw-Hill,
2006
Reference Books:
1) S Keshav, An Engineering approach to computer Networking, 2nd Edition, Pearson
Education.
2) J.F.Kurose, K.W.Ross, Computer Networking a Top-Down approach featuring the
internet, 2nd Edition, Pearson Education.
III B. Tech. II Semester
Compiler Design (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Compiler Design

3 1 0 3
Course Objectives:
1. Describe the design of a compiler including its phases and components and
basicunderstanding of grammars and language definition.
2. Identify the similarities and differences among various parsing techniques and
grammartransformation techniques.
3. Understand the syntax analysis, intermediate code generation, type checking, the role
ofsymbol table and its organization.
4. Providing students with practical programming skills necessary for constructing
acompiler.
5. Understand, design code generation and optimization schemes.
Unit I:
Overview of Compilation: Phases of Compilation – Lexical Analysis, Regular Grammar and
regular expression for common programming language features, pass and phases of
translation, interpretation, bootstrapping, LEX - lexical analyzer generator.
Learning outcomes:
1. Recognise the different phases of the compilation and explain those phases.
2. Express the programming language features.
Unit II
Top down Parsing: Context free grammars, Top down parsing – Backtracking, LL
(1),Recursive Descent Parsing, Predictive Parsing.
Bottom up Parsing: Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing,
handling ambiguous grammar, YACC – automatic parser generator.
Learning outcomes:
1. Describe the different top down parsing techniques.
2. Classify the different bottom up parsing techniques.
Unit III
Semantic analysis: Intermediate forms of source Programs – abstract syntax tree,
polishnotation and three address codes. Attributed grammars, Syntax directed translation,
Typechecker.
Symbol Tables: Symbol table format, organization for block structures languages.
Blockstructures and non block structure storage allocation: static, runtime stack and heap
storageallocation.
Learning outcomes:
1. Execute the semantic analysis phase and their attributes while compilation process.
2. Organise the symbol tables in compilation process by using different techniques.
Unit IV
Code optimization: Consideration for Optimization, Scope of Optimization, local
optimization,
loop optimization, frequency reduction, DAG representation.
Data flow analysis: Flow graph, global optimization, redundant sub expression elimination,
Induction variable elements live variable analysis, Copy propagation.
Code generation: Object code forms, machine dependent code optimization, register
allocationand assignment generic code generation algorithms, DAG for register allocation.
Learning outcomes:
1. Understand the Code optimisation and scope of the code optimisation.
2. Report the data flow analysis and their different elements.
3. Generate code foe machine for machine understanding.
Course Outcomes:
1. Use the knowledge of patterns, tokens & regular expressions for solving a problem.
2. Apply the knowledge of lex tool &yacc tool to develop a scanner & parser.
3. Write the new code optimization techniques to improve the performance of a programin
terms of speed & space.
4. Employ the knowledge of modern compiler & its features.
5. Experiment the tools and technologies used for designing a compiler.
Text Books:
1. Alfred V. Aho, Ravi Sethi& Jeffrey. D. Ullman, “Compilers Principles, Techniques &
Tools”, Pearson Education, third edition, 2007.
2. Andrew N. Appel, “Modern Compiler Implementation in C”, Cambridge University
Press, 2004.
Reference Books:
1. John R. Levine, Tony Mason, Doug Brown, “lex&yacc”, O'Reilly Media, Inc., 1992.
2. Kenneth C. Louden, Compiler Construction: Principles and Practice, Course Technology
Inc;
International edition, 1997
Reference link:
1. https://www.holub.com/software/compiler.design.in.c.html
Data Analytics (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Data Analytics
3 1 0 3

Course Objective:
1. Make use of Data Analysis.
2. Create descriptive statistics and tabulation.
3. Apply Data Visualisation to numerous plots.
4. Illustrate the HDFS file system, Map Reduce frameworks.
5. Develop sorting, Map and Reduce side joins.
Unit – I
Introduction: Some Simple Math, Types of Data Items, The Structure of Data Items,
Readingand Getting Data into R, Viewing Named Objects, Examining Data Structure,
Working withHistory Commands, Saving Your Work in R.
Learning outcomes:
1. Gain the knowledge on the basics of Data analytics.
2. Discuss the structure and the getting data into R.
Unit – II
Working with Objects and Descriptive Statistics and Tabulation: Manipulating Objects,
Viewing Objects within Objects, Constructing Data Objects, Forms of Data Objects:
Testingand Converting, Summary Commands, Summarizing Samples, Summary Tables.
Learning outcomes:
1. Achieve basic knowledge on data objectives
2. Implement the Descriptive statistics and tabulation on the R.
Unit – III
Data Distribution, Hypothesis Testing and Graphical Analysis: Types of Data
Distribution:The Normal Distribution, Other Distributions, Quantile-Quantile Plots,
Hypothesis Testing:The Student’s t-test, Correlation and Covariance, Scatter Plots, Line
Charts, Pie Charts, BarCharts, Copy Graphics to Other Applications, Analysis of Variance
(ANOVA).
Learning outcomes:
1. Identify the types of data distribution and their comparision
2. Learn the different hypothesis testing methods.
Unit – IV
Working with Big Data: Google File System, Hadoop Distributed File System (HDFS) –
Building blocks of Hadoop (Namenode, Datanode, Secondary Namenode, JobTracker, Task
Tracker), Introducing and Configuring Hadoop cluster (Local, Pseudo-distributed mode,
FullyDistributed mode), Configuring XML files.
Writing MapReduce Programs: Understanding Hadoop API for MapReduce Framework
(Oldand New), Basic programs of Hadoop MapReduce: Driver code, Mapper code, Reducer
code,RecordReader, Combiner, and Partitioner.
Learning outcomes:
1. Perform the hadoop system on the big data analysis
2. Configure the hadop cluster for working with big data
3. Writing the map for reduce and the also the programs for reduce.
Course Outcomes
1. Classify the creation of data objects.
2. Analyze the manipulation of data objects such as select, sort, rearrange, display and test
for different object types.
3. Analyze different distributions and graphs.
4. Outline the concepts of HDFS file systems and interfaces and able to keep HDFS Cluster
balanced.
5. Compile map reduce classes, combiner functions and map reduce job.
Text Books
1. Beginning R: The Statistical Programming Language by Mark Gardener, First Edition,
Wrox Publisher.
2. Hadoop: The Definitive Guide by Tom White, 3rd Edition, O’reilly
3. Hadoop in Action by Chuck Lam, MANNING Publ.
References
1. http://www.r-tutor.com/elementary-statistics
2. https://www.cse.iitm.ac.in/~ravi/courses/Introduction%20to%20Data%20Analytics.html
3. Hadoop in Practice by Alex Holmes, MANNING Publ.
4. HadoopMapReduceCookbook,SrinathPerera, ThilinaGunarathne
5. Hadoop:http://hadoop.apache.org/
Artificial Intelligence (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Artificial Intelligence
3 1 0 3.5
Course Objective:
1. Achieve basic knowledge of artificial intelligence.
2. Learn the methods of solving problems using Artificial Intelligence.
3. Analyze the different search strategies to understand their practical applications.
4. Gain basic and practical knowledge of game playing and knowledge representation.
5. Learn basic machine learning and the machine learning algorithms and Expert systems.
Unit I
Introduction to AI and Production Systems: Introduction to AI-Problem formulation,
Problem Definition -Production systems, Control strategies, Search strategies. Problem
characteristics, Production system characteristics -Specialized production system- Problem
solving methods -Problem graphs, Matching, Indexing and Heuristic functions -Hill
Climbing-Depth first and Breath first, Constraints satisfaction - Related algorithms, Measure
of performance and analysis of search algorithms.
Learning outcomes:
1. Understand the applications of AI and problem solving using AI methods
2. Describe the production system using AI.
Unit II
Representation of Knowledge: Game playing - Knowledge representation,
Knowledgerepresentation using Predicate logic, Introduction to predicate calculus,
Resolution, Use ofpredicate calculus, Knowledge representation using other logic-Structured
representation ofknowledge.
Learning outcomes:
1. Explain the game playing for knowledge representation using predicate logic
2. Discuss the structure representation of knowledge
Unit III
Knowledge Inference: Knowledge representation -Production based system, Frame
basedsystem. Inference - Backward chaining, Forward chaining, Rule value approach,
Fuzzyreasoning - Certainty factors, Bayesian Theory-Bayesian Network-Dempster - Shafer
theory.
Learning outcomes:
1. Describe the knowledge representation using production based system.
2. Recognise the inference of the problem solving.
Unit IV
Planning and Machine Learning: Basic plan generation systems - Strips -Advanced
plangeneration systems – K strips -Strategic explanations -Why, Why not and how
explanations.Learning- Machine learning, adaptive Learning.
Expert Systems: Architecture of expert systems, Roles of expert systems –
KnowledgeAcquisition – Meta knowledge, Heuristics. Typical expert systems-MYCIN,
DART, XOON,Expert systems shells.
Learning outcomes:
1. Analyse the different algorithms on problem solving by using formalization
2. Interpret the knowledge in expert systems.
Course Outcomes:
After completing this course, the student should be able to:
1. Identify problems that are amenable to solution by AI methods.
2. Identify appropriate AI methods to solve a given problem.
3. Formalize a given problem in the language/framework of different AI methods. Implement
basic AI algorithms.
4. Design and carry out an empirical evaluation of different algorithms on problem
formalization, and state the conclusions that the evaluation supports.
5. Have the knowledge in expert system.
Text Book:
1. Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, McGraw Hill-2008.
(Unit s- I, II, IV & V)
2. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007. (Unit -III).
References:
1. Peter Jackson, “Introductionto Expert Systems”, 3rd Edition, Pearson Education, 2007.
2. Stuart Russel and Peter Norvig “AI – A Modern Approach”, 2nd Edition, Pearson
Education
2007.
3. Deepak Khemani “Artificial Intelligence”, Tata McGraw Hill Education 2013.
Reference Link
1. http://nptel.ac.in
Cryptography and Network Security (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Course code PEC2
Category CSE
Course title Cryptography and Network Security
3 1 0 3

Course Objective:
1. Introduction of the issues in network security- its need and importance, taxonomy and
terminology.
2. Compute different Conventional Encryption Algorithms.
3. Exploration of different types of security threats and remedies.
4. Recognizes the different Security Attacks, Security Services and Security Mechanisms.
5. Understanding of Internet security protocols and standards
6. Categorize Intrusions and intrusion detection techniques and to develop the different
firewall principles.
Unit I
Introduction:
Computer Security Concepts, Threats, Attacks, and Assets, Security Functional
Requirements, A Security Architecture for Open Systems, ComputerSecurity Trends,
Computer Security Strategy.
Cryptographic Tools: Confidentiality with Symmetric Encryption, Message Authentication
and Hash Functions,Public-Key Encryption, Digital Signatures and Key Management,
Random andPseudorandom Numbers, Practical Application: Encryption of Stored Data. User
Authentication:Means of Authentication, Password-Based Authentication, Token-
BasedAuthentication, Biometric Authentication, Remote User Authentication, Security Issues
forUser Authentication, Practical Application: An Iris Biometric System, Case
Study:Security Problems for ATMSystems.
Learning outcomes:
1. Understand the computer security concepts and encryption and decryption
2. Discuss the different authentication techniques and the security issues.
3. Implement the authentication techniques for practical applications.
Unit II
Module 1:
Access Control: Access Control Principles, Subjects, Objects, and AccessRights,
Discretionary Access Control, Example: UNIX File Access Control, Role-BasedAccess
Control, Case Study: RBAC System for a Bank. Database Security: The Need forDatabase
Security, Database Management Systems, Relational Databases, DatabaseAccess Control,
Inference, Statistical Databases, Database Encryption, CloudSecurity.
Module 2:
Malicious Software: Types of Malicious Software (Malware),Propagation—Infected
Content—Viruses, Propagation—Vulnerability Exploit—Worms,Propagation—Social
Engineering—SPAM E-mail, Trojans, Payload—System Corruption,Payload—Attack
Agent—Zombie, Bots, Payload—Information Theft—Key loggers, Phishing,Spyware,
Payload—Stealthing—Backdoors, Root kits,Countermeasures.
Learning outcomes:
1. Discuss the principals of access control and their objectives
2. Illustrate the security and need of database.
3. Describe the types of malicious software and propagation
Unit III
Module 1:
Denial-of-Service Attacks: Denial-of-Service Attacks, Flooding Attacks,Distributed Denial-
of-Service Attacks, Application-Based Bandwidth Attacks, Reflector andAmplifier Attacks,
Defenses Against Denial-of-Service Attacks, Responding to aDenial-of-Service Attack.
Module 2:
Intrusion Detection: Intruders, Intrusion Detection, Different Intrusions, Intrusion Detection
ExchangeFormat, Honeypots, Example System: Snort. Firewalls and Intrusion Prevention
Systems: The
NeedforFirewalls,FirewallCharacteristics,TypesofFirewalls,FirewallBasing,Firewall Location
and Configurations, Intrusion Prevention Systems, Example: UnifiedThreat
ManagementProducts.
Learning outcomes:
1. Identify the different attacks and their supports.
2. Predicts the intrusion detection techniques and their examples.
Unit IV
Module 1:
Buffer Overflow: Stack Overflows, Defending against Buffer Overflows, Other Formsof
Overflow Attacks, Software Security and Issues, Handling ProgramInput and output, Writing
Safe Program Code, Interacting with the Operating System and OtherPrograms,Operating
System Security and VirtualizationSecurity.
Symmetric Encryption and Message Confidentiality: Symmetric EncryptionPrinciples,
Data Encryption Standard, Stream Ciphers andRC4, Cipher Block Modes of Operation,
Location of Symmetric Encryption Devices,Key Distribution. Public-Key Cryptography and
Message Authentication: SecureHash Function, HMAC, the RSA Public-Key Encryption
Algorithm, Diffie-Hellman andOther AsymmetricAlgorithms.
Module 2:
Internet Security Protocols and Standards: Secure E-mail and S/MIME, DomainKeys
Identified Mail, SSLandTLS,HTTPS, IPv4 and IPv6 Security. Internet Authentication
Applications: Kerberos, X.509,Public-Key Infrastructure, Federated Identity Management.
Wireless Network Security: Wireless Security Overview, IEEE 802.11 Wireless LAN
Overview, IEEE 802.11i Wireless LAN Security.
Learning outcomes:
1. Apply the overflow techniques for software security issues.
2. Learn about the different encryption and encryption algorithms.
3. Achieve the protocols for internet security and wireless network security.
Course Outcomes:
1. Realize the need and importance of network and data security in the Internet and in the
distributed environments.
2. Identify the different types of network security issues and their remedies.
3. Application various cryptographic tools and techniques in different contexts and as per
need of security levels.
4. Implementation of some Internet security protocols and standards
TextBook:
1. Computer Security – Principles and Practices (Except the Chapters 13, 14, 15, 16, 17,18,
19), 2nd Edition by William Stallings, Pearson Education,Inc.
2. Network Security Essentials: Applications and Standards, William Stallings, Pearson
Education.
ReferenceBooks:
1. Cryptography and Network Security by William Stallings, Pearson Education Asia,New
Delhi.
2.NetworkSecurityEssentialsApplicationsandStandards,byWilliamStallings,Pearson
Education Asia, NewDelhi.
1. Cryptography and Network Security: Principles and Practice, William Stallings,
Pearson Education.
Web links:
1. https://www.cse.iitb.ac.in/~mp/teach/crypto/s17/
2. https://onlinecourses.nptel.ac.in/noc18_cs07
Embedded Systems (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Course code PEC2
Category CSE
Course title Embedded Systems
3 0 0 3

Course Objectives:
1. Understand the basics of embedded systems and its examples.
2. Study the 8051 Microcontroller architecture and its instruction set.
3. Discuss various software architectures in embedded systems.
4. Illustrate the inter task communication procedures in RTOS and design issues of RTOS.
5. Apply the various embedded software development tools and debugging techniques.
Unit I
Introduction to Embedded Systems: Examples, Typical Hardware, Memory,
Microprocessors , Busses; Introduction to 8051 Microcontroller , Architecture, Instruction
set, Programming. Interrupts: Interrupt Basics, Shared-Data problem, Interrupt Latency.
Software Architectures: Round-Robin Architecture, Round-Robin with Interrupts
Architecture, Function-Queue Scheduling Architecture, Real-Time Operating Systems
Architecture, Selection of Architecture.
Learning outcomes:
1. Understand the basic concepts of embedded systems and examples
2. Discuss the software architecture and interrupts arrived to the processor
Unit II
Real Time Operating System: Tasks and Task States, Tasks and Data, Semaphores and
Shared Data, Semaphore Problems, Semaphore variants.
Inter Task Communication: Message Queues, Mailboxes, Pipes, Timer Functions, Events,
Memory Management, Interrupt Routines in RTOS Environment.
Learning outcomes:
1. Gain the knowledge on the task procedures in real time operating systems
2. Illustrates the inter task communication in real time os.
Unit III
Design issues of RTOS: Principles, Encapsulation Semaphores and Queues, Hard Real-Time
Scheduling Considerations, Saving Memory Space, Saving Power.
Embedded Software development Tools: Host and Target Machines, Linker/Locator for
Embedded Software, Getting Embedded Software into the Target System.
Learning outcomes:
1. Identify the design issues of real time operating system
2. Predict the embedded software development tools.
Unit IV
Embedded Software Debugging Techniques:Testing on your Host Machine, Instruction
Set Simulators, and Laboratory Tools used for Debugging.
Introduction to the Internet of Things: History of IoT, IoT Architecture, M2M – Machine
to Machine, Web of Things, IoT protocols, The Layering concepts, IoT Communication
Pattern, IoT protocol Architecture.
Learning outcomes:
1. Discuss the debugging techniques in real time operating systems
2. Understand the basic concepts of Internet of things.
Course Outcomes:
1. Understand the basic architecture of 8051 micro controller.
2. Write ALP programs using 8051 instruction set.
3. Understand the concepts related to RTOS and its Inter Task Communication methods.
4. Understand various design issues of RTOS.
5. Understand about embedded software development tools.
Text Books:
1. The 8051 Microcontroller Architecture, Programming & Applications, Kenneth J.
Ayala, Penram International.
2.Introduction to Embedded Systems by K.V Shibu
3. An Embedded Software Primer, David E. Simon, Pearson Education , 2005.
4. Internet of Things: Converging Technologies for Smart Environments and Integrated
Ecosystems, Marina Ruggieri&HomayounNikookar, River Publishers Series in
Communications.
Reference Book:
1. Embedded Systems: Architecture, Programming and Design, Raj Kamal, Tata McGraw-
Hill Education, 2008

Distributed systems (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Course code PEC2
Category CSE
Course title Distributed systems
3 0 0 3
Course Objectives:
1. Provides an introduction to the fundamentals of distributed computer systems
2. Assumingthe availability of facilities for data transmission.
3. Discuss the IPC mechanisms in distributed systems, Remote procedure calls.
4. Expose the current technology used to build architectures to enhancedistributed computing
infrastructures with various computing principles
UNIT-1
Characterization of Distributed Systems: Introduction, Examples of Distributed
Systems,Resource Sharing and the Web, Challenges.
System Models: Introduction, Architectural Models- Software Layers, System
Architecture,Variations, Interface and Objects, Design Requirements for Distributed
Architectures,Fundamental Models- Interaction Model, Failure Model, Security Model.
Learning outcomes:
1. Understand the examples of distributed systems and resource sharing and the web
2. Expose the system models such as architectural models and fundamental models
UNIT-2
Inter process Communication: Introduction, The API for the Internet Protocols-
theCharacteristics of Inter process communication, Sockets, UDP Datagram
Communication,TCPStream Communication; External Data Representation and Marshaling;
Client ServerCommunication; Group Communication- IP Multicast- an implementation of
groupcommunication, Reliability and Ordering of Multicast.
Learning outcomes:
1. Discuss the Inter process communication for internet protocols and characteristics of
IPC
2. Illustrates the TCP and UDP Group communications and IP multicast.
UNIT-3
Distributed Objects and Remote Invocation: Introduction, Communication
betweenDistributed Objects- Object Model, Distributed Object Modal, Design Issues for
RMI,Implementation of RMI, Distributed Garbage Collection; Remote Procedure Call,
Events and
Notifications, Case Study: JAVA RMI.
Distributed File Systems: Introduction, File Service Architecture; Peer-to-Peer
Systems:Introduction, Napster and its Legacy, Peer-to-Peer Middleware, Routing Overlays.
Coordinationand Agreement: Introduction, Distributed Mutual Exclusion, Elections,
MulticastCommunication.
Learning outcomes:
1. Predicts the communication between distributed objects, object models and design
issues for RMI.
2. Enhance the file service architecture, peer to peer systems, and routing overlays of the
coordination and agreement
UNIT-4
Transactions & Replications: Introduction, System Model and Group
Communication,Concurrency Control in Distributed Transactions, Distributed Dead Locks,
TransactionRecovery; Replication-Introduction, Passive (Primary) Replication, Active
Replication.
Learning outcomes:
1. Analyze the transaction on system model and group communication and concurrency
control
2. Discuss the recovery and replication and the passive replication and active rplication.
Course Outcomes:
1. Describe important characteristics of distributed systems and the salient architectural
features of Distributed systems.
2. Develop practical experience of inter-process communication in a distributed
environment.
3. Identify the features and applications of important standard protocols which are used in
distributed systems.
4. Develop a familiarity with distributed file systems.
5. Contrast process concurrency and synchronization.
Text Books
1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems- Concepts and
Design”, 5th Edition, Pearson Publication- 2011.
2. Ajay D Kshemkalyani, MukeshSighal, “Distributed Computing, Principles,Algorithms
andSystems”,CambridgeReissue Edition 2011.
References Books:
1. Distributed Systems, Principles and Paradigms, Andrew S. Tanenbaum, Maarten Van
Steen, 2nd Edition, PHI.
2. Distributed Systems, An Algorithm Approach, SukumarGhosh, Chapman&Hall/CRC,
Taylor &Fransis Group, 2007.
3. Distributed Computing, S.Mahajan and S.Shah, Oxford University Press.
4. Distributed Operating Systems Concepts and Design, PradeepK.Sinha, PHI.
5. Advanced Concepts in Operating Systems, M Singhal, N G Shivarathri, Tata McGraw-
Hill Edition.

Data Analytics Lab (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Data Analytics Lab
3 0 0 1.5

Course Objectives:
1. Perform exploratory Data Analysis.
2. Descriptive Statistics and Tabulation.
3. Apply Data Visualization to create fancy plots.
4. The HDFS file system, Map Reduce frameworks.
5. Sorting. Map side and Reduce side joins.
List of Experiments
1. You have the results of a simple experiment to look at the visitation of various bee species
to different plants. The number of bees observed was as follows:
Buff tail : 10 1 37 5 12
Garden bee: 8 3 19 6 4
Red tail: 18 9 1 2 4
Honey bee: 12 13 16 9 10
Carder bee: 8 27 6 32 23
Make five simple numeric vectors of these data.
2. Write a program to Save and Read a Binary Data File to and from Disk.
3. Use the following data:
Buff tail : 10 1 37 5 12
Garden bee: 8 3 19 6 4
Red tail: 18 9 1 2 4
Honey bee: 12 13 16 9 10
Carder bee: 8 27 6 32 23
Re-order the data so that the Buff tail column is sorted in decreasing abundance(You can
can use the Red tail column as a tie-breaker).
Now re-order the columns so that the top row (Golden rain) is in decreasing abundance
from left to right.
4. Use the Beginning.RData file for the below excercise.
Look at the bfs data object. Construct contingency tables using both the table() and ftable()
commands. How can you get one command to produce the same layout of table as the other
and what is the key difference between these results.
Examine the orchis2 data object. Here you see a two column data frame with a response
variable(flower) and a predictor variable(site). Produce a histogram for the sprayed site.Now
overlay a density plot.
6. Look at the mtcars data that gives data on the fuel consumption and other features of some
automobiles from the 1970s. First look at the correlation matrix of these data, then focus on
the correlation between mpg and the other variables. Finally, carry out a correlation test on
the mpg and qsec( time taken to travel a quarter mile) variables.
The HairEyeColor data are built into R. These data are in the form of a table, which has three
dimensions.As well as the usual rows and columns, the table is split in two: Male and
Female. Use the “males” table to create a Cleveland dot chart of the data. Use the mean
values for the columns as an additional grouping summary result.
8. Implement the following file management tasks in Hadoop:
i. Adding files and directories
ii. Retrieving files
iii. Deleting files
Hint: A typical Hadoop workflow creates data files (such as log files) elsewhere and copies
them into HDFS.
9. Implement a basic Word Count Map Reduce program to understand Map Reduce
Paradigm.
10. Running the Word Count program in a distributed cluster environment
11. Plotting the Hadoop results using GNUplot.
12. Calculating histograms using Map Reduce.
13. Calculating scatter plots using Map Reduce.
14. Parsing a Complex dataset with Hadoop.
15. Joining two datasets using Map Reduce.
Course Outcomes
After the completion of this course, the student will be able to
1. Understand creation of data objects and its type.
2. Analyze and design the manipulation of data objects such as select, sort, rearrange, display
and test for different object types.
3. Understand and Analyze different distributions and graphs.
4. Understand the concepts of HDFS file systems and interfaces and able to keep HDFS
Cluster balanced
5. Understand and develop with map reduce classes, combiner functions and can run map
reduce job.
Text Book: Hadoop Map Reduce Cookbook, Srinath Perera & Thilina Gunarathne, 2013,
PACKT PUBLISHING.
Text Books
1. Beginning R: The Statistical Programming Language by Mark Gardener, First Edition,
Wrox Publisher.
2.Hadoop: The Definitive Guide by Tom White, 3rd Edition, O’reilly
3.Hadoop in Action by Chuck Lam, MANNING Publ.
References
1. http://www.r-tutor.com/elementary-statistics
2. Hadoop in Practice by Alex Holmes, MANNING Publ.
3. Hadoop MapReduce Cookbook,Srinath Perera, Thilina Gunarathne
4. Hadoop:http://hadoop.apache.org/

Compiler Design & Cryptography Lab (For CSE Branch)
-------------------------------------------------------------------------------------------------------
Category CSE
Course title Compiler Design & Cryptography Lab
3 0 0 1.5

Course Objectives:
1. Memorize the knowledge in various phases of compiler and its use, code optimization
techniques, machine code generation, and use of symbol table.
2. Understand the major concept areas of language translation and compiler design.
3. Extend the knowledge of parser by parsing LL and LR parser and Give example
programming skills necessary for constructing a compiler
4. Implement the C/JAVA program for different encryption and decryption algorithms
List of Experiments:
Cycle 1(Compiler design):
1. Write a program to find the number of characters, words, digits, lines form the given
input.
2. Design a Lexical analyzer. The lexical analyzer should ignore redundant spaces, tabs and
newlines. It should also ignore comments.
3. Implement the lexical analyzer using either JLex, flex or lex or other lexical analyzer
generating tools.
4. Write a program to compute FIRST function for the given grammar.
5. Write a program to compute FOLLOW function for the given grammar.
6. Write a program to implement a predictive parser.
7. Design LALR Bottom up Parser.
8. Convert the BNF rules into Yacc form and write code to generate abstract syntax tree.
9. Write program to generate machine code from the abstract syntax tree generated by the
parser.
Cycle 2(Cryptography):
1. Write a Java program to perform encryption and decryption using the following
algorithms a. Ceaser cipher b. Substitution cipher c. Hill Cipher
2. Write a C/JAVA program to implement the DES algorithm logic.
3. Write a C/JAVA program to implement the Blowfish algorithm logic.
4. Write a C/JAVA program to implement the Rijndael algorithm logic.
5. Write the RC4 logic in Java Using Java cryptography; encrypt the text ―Hello world‖
using Blowfish. Create your own key using Java key tool.
6. Write a Java program to implement RSA algorithm.
7. Implement the Diffie-Hellman Key Exchange mechanism using HTML and JavaScript.
8. Calculate the message digest of a text using the SHA-1 algorithm in JAVA.
9. Calculate the message digest of a text using the MD5 algorithm in JAVA.
Course Outcome
1. Apply the knowledge of lex tool & yacc tool to devleop a scanner & parser.
2. Design and conduct experiments for Intermediate Code Generation.
3. Describe different translators and develop program to solve complex problems in
compiler.
4. Choose new code optimization techniques to improve the performance of a program in
terms of speed and space. And analyze new tools and technologies used for designing a
compiler
5. Analyze the programs for solving the security problems by applying the different
algorithms.
Text Books
1. Alfred Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers Principles, Techniques and tools”,
Pearson Education Asia, 2003
Reference Book
1. Allen I. Houlb “Compiler Design in C”, Prentice Hall of India, 2003
2. C. N. Fischer and R.J. LeBalnc, “Crafitng a compiler with C ”, benjamin Cummings,
2003
3. J.P.Bennet,”Introduction to Compiler Techniques”, Second Edition, tata Mcgraw-
Hills,2003.

Syllabus of 3rd Year

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Syllabus of 3rd Year

Uploaded by

Copyright:

Available Formats

Dr.B.R.

Course code PCC-CS13

Course title Formal Language & Automata Theory

Scheme and Credits L T P Credits

Pre-requisites (if any)

Suggested reference books:

Course code PCC-CS14

Course title Computer Networks

Scheme and Credits L T P Credits

Pre-requisites (if any)

Course code PCC-CS15

Course title Web Technologies

Scheme and Credits L T P Credits

Pre-requisites (if any)

Dr.B.R. Ambedkar University

Course code PCC-CS16

Course title Design and analysis of algorithms

Scheme and Credits L T P Credits

Pre-requisites (if any) PCC-CS2

Learning outcomes of unit 3:

Learning outcomes of unit 4:

Suggested reference books

Dr.B.R. Ambedkar University

Course title Machine learning

Scheme and Credits L T P Credits

Pre-requisites (if any)

Course title Computer Graphics

Scheme and Credits L T P Credits

Pre-requisites (if any)

Scheme and Credits L T P Credits

Pre-requisites (if any)

Dr.B.R. Ambedkar University

Scheme and Credits L T P Credits

Pre-requisites (if any)

Dr.B.R. Ambedkar University

Scheme and Credits L T P Credits

Pre-requisites (if any)

Dr.B.R. Ambedkar University

Course title Computer networks Lab

Pre-requisites (if any)

Course code PCC-CS20

Course title Compiler Design

Scheme and Credits L T P Credits

Pre-requisites (if any)

Course title Data Analytics

Scheme and Credits L T P Credits

Pre-requisites (if any)

Course code PCC-CS22

Course title Artificial Intelligence

Scheme and Credits L T P Credits

Course title Cryptography and Network Security

Scheme and Credits L T P Credits

Pre-requisites (if any)

Scheme and Credits L T P Credits

Pre-requisites (if any)

Dr.B.R. Ambedkar University

Course title Distributed systems

Scheme and Credits L T P Credits

Dr.B.R. Ambedkar University

Course title Data Analytics Lab

Scheme and Credits L T P Credits

Pre-requisites (if any)

Dr.B.R. Ambedkar University