Scheme and syllabus of B.Tech.

(2018 batch onwards)

Subject Code: PCCS-108

Subject Name: Artificial Intelligence

Programme: B.Tech.(CSE) L: 3 T: 0 P: 0
Semester: 5th Teaching Hours: 38
Theory/Practical: Theory Credits: 3
Internal Marks: 40 Percentage of Numerical/Design/Programming Problems: 60%
External Marks: 60 Duration of End Semester Exam (ESE): 3 hours
Total Marks: 100 Course Status: Compulsory

Prerequisites: Knowledge of problem solving using different algorithms and basic programming.
Additional Material Allowed in ESE: [NIL]
On completion of the course, the student will have the ability to:

CO# Course Outcome

1. Understand the concept of Artificial Intelligence, Agents, their types and structure.
2. Apply and analyze search strategies to solve the informed and uninformed problems.
3. Design and evaluate intelligent expert models for perception and prediction from
intelligent environment.
4. Formulate valid solutions for problems involving uncertain inputs or outcomes by
using decision making techniques.
5. Demonstrate and enrich knowledge to select and apply AI tools to synthesize
information and develop models within constraints of application area.
6. Examine the issues involved in knowledge bases, reasoning systems and planning.

Detailed Contents:
Part A
Introduction: Intelligence, Foundations of artificial intelligence (AI). History of AI, Agents and
Environments, Rationality of Agents, Nature and Structure of Agents, Communication among Agents.
[3 Hours]

Problem Formulation and solution: Problem types, States and operators, State space, Uninformed
Search Strategies, Informed Search Strategies– Best first search, A* algorithm, Heuristic functions,
Iterative deepening A*(IDA), Small memory A*(SMA).
[5 Hours]

Game playing: Perfect Information game, Imperfect Information game, Evaluation function, Minimax
algorithm, Alpha-beta pruning. [3 Hours]
 Scheme and syllabus of B.Tech. (2018 batch onwards)

Logical Reasoning: Inference in Propositional logic and First order Predicate logic, Resolution, Logical
reasoning, Forward chaining, Backward chaining; Knowledge representation techniques: semantic
networks, Frames. [7 Hours]

Part B
Planning: Basic representation of plans, Partial order planning, Planning in the blocks world,
Hierarchical planning, Conditional planning, Representation of time, schedule and resource constraints,
Measures, temporal constraints. [5 Hours]

Uncertainty: Basic probability, Bayes rule and its use, Belief networks, Default reasoning, Fuzzy sets
and fuzzy logic; Decision making– Utility theory, Utility functions, Decision theoretic expert systems.
[5 Hours]

Inductive learning: Decision trees, Rule based learning, Current-best-hypothesis search, Least
commitment search, Neural networks, Reinforcement learning, Genetic algorithms.
[6 Hours]

Applications: Areas of AI, Natural language processing, Case study of existing expert systems. [4
Hours]

Text Books
1. Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach”, Prentice Hall.
2. Saroj Kaushik, “Artificial Intelligence”, Cengage Learning India.
Reference Books
1. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill.
2. Trivedi, M.C., “A Classical Approach to Artifical Intelligence”, Khanna Publishing House, Delhi.
3. David Poole and Alan Mackworth, “Artificial Intelligence: Foundations for Computational Agents”,
Cambridge University.
E-Books and online learning material
1. HandBook of Artificial Intelligence Edited by Avron Barr and Edward A. Feigenbaum, Computer
Science Department, Stanford University.
https://stacks.stanford.edu/file/druid:qn160ck3308/qn160ck3308.pdf
Online Courses and Video Lectures
1. https://www.coursera.org/courses?query=artificial%20intelligence
Accessed on May 20,2020.
2. https://nptel.ac.in/courses/106/105/106105077/ Accessed on May20,2020.
3. https://nptel.ac.in/courses/106/102/106102220/ Accessed on May20,2020.
4. https://www.youtube.com/watch?v=bV4t4r3SGuI Accessed on May 20,2020.
5. https://www.youtube.com/watch?v=iF1tOCEXLXY Accessed on May20,2020.
 Scheme and syllabus of B.Tech. (2018 batch onwards)

Subject Code: PCCS-109

Subject Name: Database Management Systems
Programme: B.Tech. (CSE) L: 3 T: 0 P: 0
Semester: 5 Teaching Hours:40
Theory/Practical: Theory Credits: 3
Internal Marks: 40 Percentage of Numerical/Design/Programming Problems: Nil
External Marks: 60 Duration of End Semester Exam (ESE): 3hrs
Total Marks: 100 Elective Status: Compulsory
Additional Material Allowed in ESE: Not Any
On completion of the course, the student will have the ability to:
CO# Course Outcomes
1 Analyze the Information Systems as socio-technical systems, its need and advantages as
compared to traditional file based systems.
2 To study the physical and logical database designs, database modeling, relational,
hierarchical, and network models.
3 Analyze Database design using E-R data model by identifying entities, attributes,
relationships, generalization and specialization along with relational algebra.
4 To understand and use data manipulation language to query, update, and manage a database.
5 Apply and create Relational Database Design process with Normalization and De-
normalization of data.
6 To develop an understanding of essential DBMS concepts such as: database security,
integrity, concurrency.
Detailed Contents:
Part-A
Introduction to Database Concepts: Introduction, Database systems versus file systems, Difference
between Database and non-database system, Characteristics of Database Approach, Advantages and
Disadvantages of Using DBMS. Data base users and administrators, Schemas and Instances, DBMS
Architecture, components of a database system, Data Independence, Database Language and Interfaces,
Classification of Database Management Systems. Introduction to NoSQL database. [5 Hours]
Entity Relationship Model: Data models, Entity types, Entity sets, Attributes and keys, Relationship
types, Relationship sets, Roles and structural constraints, Weak entity types, Design choices for ER
conceptual design, Comparison of Models. [4 Hours]
Relational Model: Relational model concepts, Constraints, Update operations, Transaction and dealing
with constraint violations. Relational Algebra –Unary relational operations, Operations from Set theory,
 Scheme and syllabus of B.Tech. (2018 batch onwards)

Binary relational operations, DIVISION operation and additional relational operations. Relational
Calculus – Tuple relational calculus and Domain relational calculus, Queries related to Relational Algebra
and Relational Calculus. [7 Hours]
SQL: SQL Data Definition and data types, specifying constraints in SQL, Schema change statements,
Basic queries in SQL, Set operations, Aggregate functions and views, Complex queries in SQL,
Additional features of SQL. [7 Hours]
Part-B
Relational Database Design: Informal design guidelines for Relational Schemas, Functional
dependencies, Inference rules for functional dependencies, Equivalence of set of functional dependencies,
2QMinimal cover, Normal forms based on primary keys– (1stNF, 2ndNF, 3rdNF, 4thNF and 5thNF)
Decomposition into normalized relations. Physical Database Design – File structures (Sequential files,
Indexing, B tree). [6 Hours]
Transaction Management and Concurrency Control: Introduction to Transaction Processing,
Transaction and System Concepts, need of concurrency control, ACID properties, Schedules,
Characterizing schedules based on recoverability and serializability, Two - phase locking techniques for
concurrency control. [4 Hours]
Database Recovery and Security: Need of recovery, Recovery concepts, Recovery techniques Deferred
update, Immediate update, Shadow paging. Database security – Threats to databases, Control measures,
Database security and DBA, Discretionary access control based on granting and revoking privileges,
Mandatory access control, Introduction to Statistical Database Security, Encryption and decryption.
[7 Hours]
Text Books
1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, "Database System Concepts", McGraw Hill Education.
2. RamezElmasri, Shamkant B Navathe, "Fundamentals of Database Systems", Pearson Education.
3. Connolly, "Specifications of Database Systems: A Practical Approach to Design, Implementation and
Management", Pearson India.
4. Alexis Leon, Mathews Leon, "Database Management Systems" Leon Press.
5. S.K. Singh, "Database Systems Concepts, Design and Applications, Pearson Education.
6. Raghu Ramakrishnan, Johannes Gehrke, "Database Management Systems", Tata McGrawHill.
Reference Books
1. SQL,PL/SQL ,The programming language of oracle, Ivan Bayross BPB Publication
2. An introduction to database system by C.J.Date (Addison Welsey, Publishing house).
3. An introduction to Database Systems by Bipin C. Desai, Galgotia publications.
4. Prateek Bhatia, Database Management system, Kalayani Publishers
 Scheme and syllabus of B.Tech. (2018 batch onwards)

E-Books and online learning material

1. Database Management system. 2nd Ed.
https://ff.tu-sofia.bg/~bogi/knigi/BD/Database%20Management%20Systems.%202nd%20Ed.pdf
2. Fundamentals of Database Management Systems eBook.
https://circuitmix.com/free-download-fundamentals-of-database-management-systems-ebook/
Online Courses and Video Lectures
1. https://nptel.ac.in/courses/106/106/106106220/ Accessed on Jan22, 2020
2.https://www.youtube.com/watch?v=5TU7zH0Z8 Accessed on Jan 22, 2020
3.https://www.youtube.com/watch?v=Z2Zx2G02aI4 Accessed on Jan 22, 2020
4.https://www.youtube.com/watch?v=Kmp76uRHz9c Accessed on Jan 22, 2020
5. https://www.youtube.com/watch?v=QYd6ZjHpzBg Accessed on Jan 22, 2020
 Scheme and syllabus of B.Tech. (2018 batch onwards)

Subject Code: PCCS-110

Subject Name: Formal Language and Automata Theory

Programme: B.Tech. (CSE) L: 3 T: 1 P: 0

Semester: 5 Teaching Hours: 40
Theory/Practical: Theory Credits: 4
Internal Marks: 40 Percentage of Numerical/Design/Programming Problems: 35%
External Marks: 60 Duration of End Semester Exam (ESE): 3hrs
Total Marks: 100 Elective Status: Compulsory

Additional Material Allowed in ESE: Not Any

On completion of the course, the student will have the ability to:
CO# Course Outcomes
1 Apply the knowledge of mathematics and statistics to solve complex engineering problems
related to automata theory.
2 Identify, formulate and analyze uses and Constraints of various computational models used
in engineering practice.
3 Make use of research-based knowledge to abstract the models of computing and their powers
to recognize the grammars.
4 Design and evaluate abstract machines that demonstrate the properties of physical machines
and be able to specify the possible inputs, processes and outputs of these machines.
5 Compare and analyze different computational models including prediction and modeling to
complex engineering activities with an understanding of the limitations.
6 Recognize and comprehend formal reasoning about machines and languages to engage in
independent and life-long learning in the broadest context of technological change.

Detailed Contents:

Part-A
Finite Automata: Deterministic Finite Automata, Acceptance by Finite Automata, Transition systems,
Non-Deterministic Finite Automata, Equivalence of DFA and NDFA, Moore and Mealy machines,
Equivalence of Moore and Mealy machine, Minimization of Finite Automata, Applications and
limitations of Finite Automata. [6 Hours]
 Scheme and syllabus of B.Tech. (2018 batch onwards)

Formal Languages: Basics of strings, Alphabets, grammar, Formal language, Chomsky classification
of languages, Languages and their relation, Operations on languages, Closure properties of language
classes. [4 Hours]
Regular Grammar: Regular grammars, Regular expressions, Algebraic method using Arden’s
theorem, Equivalence of Finite Automata and Regular expressions, Properties of regular languages,
Pumping lemma. [5 Hours]
Context Free Language: Derivation, Ambiguity, Simplification of context free grammar, normal
forms– Chomsky Normal Form, Greibach Normal Form, Pumping lemma. [5 Hours]

Part-B
Push Down Automata: Description and definition, Acceptance by Push Down Automata, Equivalence
of Push Down Automata and context free grammars and languages. [6 Hours]
Turing Machine: Definition and Model, Representation of Turing Machine, Design of Turing
Machine, Variants of Turing Machine, Decidability and recursively enumerable languages, Halting
problem, Post correspondence problem. [6 Hours]
Context Sensitive Language: Context sensitive language, Model of linear bounded automata,
Relation between linear bounded automata and context sensitive language. [5 Hours]

Text Books
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, Pearson Education.
2. K.L.P. Mishra and N. Chandrasekaran, “Theory of Computer Science”, Third Edition, PHI
Learning Private Limited.
3. K.V.N. Sunitha, N. Kalyani, “Formal Languages and Automata Theory”, McGraw-Hill.

Reference Books
1. Daniel, A.Cohen, “Introduction to Computer Theory”, Wiley India Pvt. Ltd.
2. M. Sipser, “Introduction to the Theory of Computation”, Second Edition, Cengage Learning.
3. M. A. Harrison, “Introduction to Formal Language Theory”, Addison-Wesley
4. Peter Linz, “An Introduction to Formal Languages and Automata”, Jones and Bartlett Publishers.

E-Books and online learning material

1. Jean-Eric Pin, “Mathematical Foundations of Automata Theory”,Lecture notes LIAFA,
Université Paris https://www.irif.fr/~jep//PDF/MPRI/MPRI.pdf
2. Michael Sipser, “Introduction to the Theory of Computation”,Thomson Course Technology
http://en.bookfi.net/book/1139836
 Scheme and syllabus of B.Tech. (2018 batch onwards)

3. Anil MaheshwariandMichielSmid, “Introduction to Theory of Computation”, School of

Computer Science, Carleton University, Ottawa Canada
https://cglab.ca/~michiel/TheoryOfComputation/TheoryOfComputation.pdf
4. Michael Levet, “Theory of Computation”, Lecture Notes,University of South Carolina-
Columbia http://people.math.sc.edu/mlevet/Lecture_Notes.pdf

Online Courses and Video Lectures

1. https://nptel.ac.in/courses/106/104/106104028/ Accessed on May23, 2020

2. https://nptel.ac.in/courses/106/106/106106049/ Accessed on May23, 2020

3. https://nptel.ac.in/courses/106/104/106104148/ Accessed on May23, 2020

 Scheme and syllabus of B.Tech. (2018 batch onwards)

Subject Code: PCCS-111

Subject Name: Design and Analysis of Algorithms

Programme: B.Tech. (CSE) L: 3 T: 1 P: 0

Semester: 5 Teaching Hours: 40
Theory/Practical: Theory Credits: 4
Internal Marks: 40 Percentage of Numerical/Design/Programming Problems: 90%
External Marks: 60 Duration of End Semester Exam (ESE): 3hrs
Total Marks: 100 Elective Status: Compulsory
Prerequisites: Knowledge of Data Structures and Algorithms
Additional Material Allowed in ESE: [Scientific Calculator]
On completion of the course, the student will have the ability to:
CO# COURSE OUTCOMES
1 Understand and learn the fundamental techniques for designing algorithms.
2 Learn various advanced techniques to design algorithms for solving complex problems.
3 Design the algorithms using basic and advanced algorithm design techniques.
4 Identify and design various existing algorithms based on advanced techniques.
Analyze the algorithms based on time and space complexity to find optimal algorithm for a given
5
problem.
Categorize various problems based on the complexity and properties of algorithms that solves
6
these problems.

Detailed Contents:
Part-A
Introduction: Algorithms, Algorithm Specification, Performance Analysis: Space complexity,Time
complexity, Asymptotic Notations- Big-Oh notation (O), Omega notation (Ω), Theta notation (Θ),
and Little-oh notation (o), Mathematical analysis of Non-Recursive and recursive Algorithms with
Examples. [4 Hours]

Divide and Conquer: General method, solving recurrences using recurrence trees, repeated
substitution, statement of Master Theorem, applications – Binary search, Merge sort, Quick
sort, Strassen’s Matrix Multiplication, Finding the maximum and minimum. [5 Hours]

Greedy Algorithms: Greedy choice, optimal substructure property, minimum spanning trees-Prims
and Kruskals, Dijkstra shortest path using arrays and heaps, fractional knapsack, Travelling
salesperson problem and Huffman coding. [5 Hours]
 Scheme and syllabus of B.Tech. (2018 batch onwards)

Dynamic Programming: Introduction to dynamic programming and application of the algorithm to

solve multistage graphs, edit distance, matrix chain multiplication, All pairs shortest path problem
and Knapsack problem. [5 Hours]

Part-B
Backtracking: General method, N-Queens problem, Sum of subsets problem, Graph coloring,
Hamiltonian cycles. [4 Hours]

Application of Graph Traversal Techniques: Representation of graphs, BFS (as a method for SSSP
on unweighted graphs), DFS, connected components, topological sorting of DAGs, biconnected
components, and strongly connected components in directed graphs. [5 Hours]

String Matching: Introduction, Brute Force algorithm, Rabin-Karp algorithm, KMP algorithm,
Boyer-Moore algorithm. [5 Hours]

NP Completeness: classes NP, P, NP-complete, and polynomial time reductions, Introduction to

approximation algorithms, Absolute approximations, E-approximations. [7 Hours]

Text Books:
1. Ellis Horowitz, Sartaj Sahni and S. Rajasekharan, “Fundamentals of Computer Algorithms,
Universities Press.
2. P. H. Dave, H. B. Dave, “Design and Analysis of Algorithms”, Pearson Education.
Reference Books:
1. M. T. Goodrich and R. Tomassia, “Algorithm Design: Foundations, Analysis and Internet
examples”, John Wiley and sons.
2. S. Sridhar, “Design and Analysis of Algorithms”, Oxford Univ. Press
3. Aho, Ullman and Hopcroft, “Design and Analysis of algorithms”, Pearson Education.
4. R. Neapolitan and K. Naimipour, “Foundations of Algorithms”, 4th edition, Jones and
Bartlett Student edition.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, “Introduction to Algorithms, 3rd
Edition”, PHI
E-Books and online learning material:
1. Ellis Horowitz, Sartaj Sahni and S. Rajasekharan, “Fundamentals of Computer Algorithms, 2nd
Edition”, Universities Press.
https://nasirmir.files.wordpress.com/2012/09/fundamentals-of-computer-algorithms-by-ellis
horowitz-1984.pdf
Online Courses and Video Lectures:
1. https://nptel.ac.in/content/storage/MP4/new/106106131/mod01lec01.mp4
2. https://nptel.ac.in/content/storage/MP4/new/106106131/mod01lec05.mp4
3. https://nptel.ac.in/content/storage/MP4/new/106106131/mod01lec06.mp4
4. https://nptel.ac.in/content/storage/MP4/new/106106131/mod02lec09.mp4
 Scheme and syllabus of B.Tech. (2018 batch onwards)

5. https://nptel.ac.in/content/storage/MP4/new/106106131/mod02lec13.mp4
6. https://nptel.ac.in/content/storage/MP4/new/106106131/mod03lec18.mp4
7. https://nptel.ac.in/content/storage/MP4/new/106106131/mod09lec44.mp4
8. https://nptel.ac.in/content/storage/MP4/new/106106131/mod10lec50.mp4
 Scheme and syllabus of B.Tech. (2018 batch onwards)

Subject Code: PECS-107

Subject Name: Advanced Computer Networks

Programme: B.Tech.(CSE) L: 3 T: 0 P: 0

Semester: 5 Teaching Hours: 36 Hours

Theory/Practical: Theory Credits: 3

Internal Marks: 40 Percentage of Numerical/Design/Programming Problems: 30%

External Marks: 60 Duration of End Semester Exam (ESE): 3hours

Total Marks: 100 Course Status: Elective

Prerequisites: Basics of computer networks

Additional Material Allowed in ESE: scientific calculator

On completion of the course, the student will have the ability to:
CO # Course Outcomes
1. Understand the core ideas of networks thoroughly with network architecture and
performance metrics for network designing.
2. Apply the knowledge of various modes of communication to solve problems of data
communication over different medium using various technologies.
3. Understand and utilize various communication protocols that provide reliable, ordered,
and error-checked delivery of a stream of octets.
4. Design and implement various algorithms of network to ease the communication
problems over different geographical areas.
5. Compare different routing protocols and propose the optimal solution concerning
different structures of networks.
6. Design and implementation of routing and transport layer protocols for advanced multi
hop networks for smooth flow of data over different networks.

Detailed Contents:

Part-A

Introduction: Basics, History of Internet, Requirements: perspectives, scalable connectivity, cost

effective resource sharing, support for common services, manageability, network architecture: layering
and protocols, Internet architecture, network performance: bandwidth, latency, high-speed networks,
application performance needs. [4 Hours]
Internetworking: half and full duplex, Ethernet at physical layer: standard Ethernet, fast Ethernet,
 Scheme and syllabus of B.Tech. (2018 batch onwards)

gigabit Ethernet, Ethernet cabling-straight-through, crossover and rolled cable, Data encapsulation.
Ethernet at data link layer: CSMA, CSMA/CD and CSMA/CA. [4 Hours]
Wireless LANs: Introduction: architecture comparison, characteristics, access control. IEEE 802.11:
architecture, MAC Sublayer, Physical layer. Bluetooth: architecture and its layers. [3 Hours]
Switching: Switching andbridging: datagrams, virtual circuit switching, source routing, Switches:
Basics, its function, types of switches, Spanning Tree Protocol (STP), Virtual LANs (VLANs): purpose,
memberships, configuration, connection between switches, advantages, types of VLANs: static and
dynamic. [5 Hours]

Part-B

TCP Protocols: Internet Protocol (IP): service model, global addresses, datagram forwarding in IP,
subnetting and classless addressing, Address Translation (ARP), Host Configuration (DHCP), Error
reporting (ICMP). ` [5 Hours]
Routing: Network as a graph, Distance Vector (RIP), Link state (OSPF), metrics. Inter-domain routing:
routing policies, routing protocols (BGP), Intra-domain routing: routing policies, routing protocols
(DVMRP). [5 Hours]
Transport Service and Protocols: User Datagram Protocol (UDP): header format, services, and
applications, Transmission Control Protocol (TCP): transport service characteristics; transport protocol:
features, segment, TCP connection. [3 Hours]
Wireless Ad hoc Networks: Mobile Ad hoc Networks (MANETs): features, advantages, routing in
MANETs, applications of MANETs, Recent trends in networks: green networking, social networks,
software data networks and vehicular ad hoc networks (VANETs). [3 Hours]

Text Books:

1. L. L. Peterson, B. S. Davie, Computer Networks. A Systems Approach, Morgan Kaufmann Publishers

Inc
2. B.A. Forouzan, Data Communications and Networking, Mc-Graw Hill Education
3. Andrew S. Tanenbaum, “Computer Networks”, Pearson Education
Reference Books:

1. J. F. Kurose, K. W. Ross, Computer Networking. A Top-Down Approach, Addison Wesley Longman

2. G. Antoniou, F. van Harmelen, Semantic Web Primer, The MIT Press
3. J. Day, Pattterns in Network Architecture. A Return to Fundamentals, Prentice Hall
4. Douglas E. Comer, “Internetworking with TCP/IP”, Volume-I, Pearson Education.
5. W. Stallings, “Data and Computer Communication”, Prentice Hall of India.
E-Books and online learning material
 Scheme and syllabus of B.Tech. (2018 batch onwards)

• An Introduction to Computer Networks by Peter L Dordal, Department of Computer Science,

Loyola University Chicago.
http://intronetworks.cs.luc.edu/current/ComputerNetworks.pdfAccessed on May 21, 2020
Online Courses and video lectures
https://swayam.gov.in/nd1_noc20_cs23/preview Accessed on May 21, 2020
https://nptel.ac.in/courses/106105081/ Accessed on May 21, 2020
https://nptel.ac.in/courses/106105081/2 Accessed on May 21, 2020
https://nptel.ac.in/courses/106105081/5 Accessed on May 21, 2020
https://nptel.ac.in/courses/106105081/16 Accessed on May 21, 2020
https://nptel.ac.in/courses/106105081/31 Accessed on May 21, 2020