[go: up one dir, main page]

0% found this document useful (0 votes)
166 views24 pages

Syllabus For 2020-2024

This document provides the syllabus for the course Database Management Systems (PCCCS501). The course is divided into 6 modules covering topics such as database system architecture, data models, relational query languages including SQL, database design through normalization, query processing and optimization, storage strategies, transaction processing, database security, and advanced topics. The course aims to provide students with an understanding of fundamental concepts of database management systems and skills in designing and querying relational databases. References for textbooks are also provided.

Uploaded by

nitish kamath
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
166 views24 pages

Syllabus For 2020-2024

This document provides the syllabus for the course Database Management Systems (PCCCS501). The course is divided into 6 modules covering topics such as database system architecture, data models, relational query languages including SQL, database design through normalization, query processing and optimization, storage strategies, transaction processing, database security, and advanced topics. The course aims to provide students with an understanding of fundamental concepts of database management systems and skills in designing and querying relational databases. References for textbooks are also provided.

Uploaded by

nitish kamath
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

Syllabus for Autonomous Batch 2020-2024

for
B. TECH
in
Computer Science and Engineering

INSTITUTE OF ENGINEERING & MANAGEMENT


Semester V (Third year) Curriculum

Sl. Type of course Code Course Title Hours per week Credits
No.

Lecture Tutorial Practical sessional

Theory Papers

1 Engineering ESC501 Signals & Systems 3 0 0 0 3


Science Course

2 Professional Core PCCCS501 Database 3 0 0 0 3


Courses Management
Systems

3 Professional Core PCCCS502 Formal Language 3 0 0 0 3


Courses & Automata
Theory

4 Professional Core PCCCS503 Object Oriented 2 0 0 0 2


Courses Programming

5 Professional Core PCCCS504 Software 2 0 0 0 2


Courses Engineering

6 Humanities & HSMC501 Humanities-II 3 0 0 0 3


Social Sciences (Principles of
including Management)
Management
courses

7 Professional PECCS501 Professional 3 0 0 0 3


Elective Courses Elective - I

8 Mandatory MC401 Constitution of 2 0 0 0 0


Courses India/ Essence of
Indian Knowledge
Tradition

9 Humanities & HSMC(CS)502 Essential Studies 2 0 0 0 2


Social Sciences for Professionals
including (CS) - V
Management
courses

Total 23 0 0 0 21

Practical Papers

1 Professional Core PCCCS391 Database 0 0 4 0 2


Courses Management
Systems Laboratory

2 Professional Core PCCCS393 Object Oriented 0 0 4 0 2


Courses Programming
Laboratory

3 Professional Core PCCCS394 Software 0 0 2 0 1


Courses Engineering
Laboratory
Total 0 0 10 0 5

Sessional Papers

11 Humanities & HSMC582 Skill Development 0 0 0 2 1


Social Sciences for Professionals -
including V
Management
courses

2 Innovative PROJCS501 Innovative Project - 0 0 0 0 1


Project III

3 Mandatory MAR581 Mandatory 0 0 0 0 0


Additional Additional
Requirements(M Requirements
AR) (MAR) - V

Total 0 0 0 2 2

Total 28

Twenty Credit Points are required in Massive Open Online Courses (MOOCs).

Twenty certificates are required in International Foreign Certification.

Course Code : ESC501


Course Title : Signals & Systems
Contact Hours: L-T-P: 3-0-0
Credit : 3

Module -I [5L]

Signals Properties: Signals and systems as seen in everyday life, and in various branches of engineering
and science. Energy and power signals, Continuous and discrete time signals, Continuous and discrete
amplitude signals. System Properties: linearity: Additivity and homogeneity, Shift invariance, Causality,
Stability, Realizability, Linear shift-invariant (LSI) systems, Impulse response and step response,
Convolution, Input output behaviour with aperiodic convergent inputs, Characterization of causality and
stability of linear shift invariant systems, System representation through differential equations and
difference equations.

Module -II [8L]

Fourier Series: Periodic and semi-periodic inputs to an LSI system, the notion of a frequency response
and its relation to the impulse response, Dirichlet’s conditions, Fourier series representation of
Continuous & Discrete signals. Fourier Transform: Fourier Transform, convolution/multiplication and
their effect in the frequency domain, magnitude and phase response, Fourier domain duality. The
Discrete-Time Fourier Transform (DTFT) and the Discrete Fourier Transform (DFT). Parseval's Theorem.
The idea of signal space and orthogonal bases, LTI System analysis.

Module -III [7L]

Laplace Transform: Evolution of Transforms: Laplace Transform, Z-transform (single sided and Double
sided) The Laplace Transform, notion of eigen functions of LSI systems, a basis of eigen functions,
region of convergence, poles and zeros of system, solution to differential equations and system behaviour
using Laplace Transformation, LTI System analysis. Z-Transform: The z-Transform for discrete time
signals and systems-eigen functions, region of convergence, z-domain analysis, solution to difference
equations and system behaviour using z-Transformation. LTI System analysis.

Module -IV [6L]

Signal Sampling: The Sampling Theorem and its implications - Spectra of sampled signals.
Reconstruction: ideal interpolator, zero-order hold, first-order hold, and so on. Aliasing and its effects.
Relation between continuous and discrete time systems.

Text Books & Reference Books:

1. Ramesh Babu & R.Anandanatarajan- Signals and Systems 4/e- Scitech

2. Hsu, Hwei P. Schaum's outlines of theory and problems of signals and systems. McGraw-Hill, 1995,

3. A.V.Oppenheim, A.S.Willsky and S.H.Nawab -Signals & Systems, Pearson

Course Outcomes:

At the end of the course, a student will be able to:


CO 1: Recall different sorts of mathematical expressions pertaining to continuous and discrete time
signals and systems with input output relationship

CO 2: Understand of linear shift invariant system and the convolution operator for continuous and
discrete time systems and the sampling theorem and its implications

CO 3: Apply the essential knowledge to resolve the signals in frequency domain using Fourier series and
Fourier transform.

CO 4: Analyze the limitations of Fourier transform and the necessity for Laplace transform and
developing the ability to analyze the system in s- domain and z-domain.

CO 5: Evaluate solution to differential equations and system’s behaviour using Laplace transform and z-
Transform for discrete time signals and systems.

CO 6: Create new ideas by exploiting acquired knowledge to build up new systems and studying their
behaviour in the field of signals and systems.

Course Code : PCCCS501


Course Title : Database Management Systems
Contact Hours: L-T-P: 3-0-0
Credit : 3

Module -I [6L]

Database system architecture: Data Abstraction, Data Independence, Data Definition Language (DDL),
Data Manipulation Language (DML). Data models: Entity-relationship model, network model, relational
and object oriented data models, integrity constraints, data manipulation operations.

Module -II [13L]

Relational query languages: Relational algebra, Tuple and domain relational calculus, SQL, DDL and
DML constructs, Open source and Commercial DBMS - MYSQL, ORACLE, DB2, SQL server.

Module -III [6L]

Relational database design: Functional Dependency, Different anomalies in designing database,


Normalization using functional dependency, Armstrong’s axioms, Decomposition, Normal forms,
Dependency preservation, Lossless design.

Query processing and optimization: Evaluation of relational algebra expressions, Query equivalence, Join
strategies, Query optimization algorithms.

Module -IV [3L]

Storage strategies: Indices, B-trees, hashing.

Module -V [5L]

Transaction processing: Concurrency control, ACID property, Serializability of scheduling, Locking and
timestamp based schedulers, Multi-version and optimistic Concurrency Control schemes, Database
recovery.

Module -VI [3L]

Database Security: Authentication, Authorization and access control, DAC, MAC and RBAC models,
Intrusion detection, SQL injection.

Advanced topics: Object oriented and object relational databases, Logical databases, Web databases,
Distributed databases, Data warehousing and data mining.

Text book and Reference books:

1. “Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F. Korth, S.


Sudarshan,McGraw-Hill.

2. “Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D. Ullman, Computer


SciencePress.

3. “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S. Navathe,

4. PearsonEducation “Foundations of Databases”, Reprint by Serge Abiteboul, Richard Hull, Victor


Vianu, Addison-Wesley

5. Database Management Systems, R.P. Mahapatra, Khanna Publishing House

Course Outcomes:

CO1: To remember different aspects of a database management system.

CO2: To understand different issues involved in the design and implementation of a database system.

CO3: To apply the knowledge of a database system for writing queries, normalizing a database, applying
techniques to serialize transaction schedules in concurrent or parallel databases and also applying security
techniques for data warehousing and data mining.

CO4: To analyse a database architecture, query methods suitable to it, finding suitability of normalization
degrees, storage strategies in terms of time-space trade off, analyzing the performance of a concurrency
control scheme, and suitability of the security technique pertaining to the use cases of the database.

CO5: To evaluate the performance of a database in terms of its architecture, design, data storage,
concurrency control and security.

CO6: To design and build a new architectural model for a simple database system and demonstrate
competence with the fundamental tasks involved with modelling, designing, and implementing a DBMS.

Course Code : PCCCS502


Course Title : Formal Language & Automata Theory
Contact Hours: L-T-P: 3-0-0
Credit : 3
Module -I
Introduction [6L]:
Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of Languages.
Module -II
Regular languages and finite automata [7L]:
Regular expressions and languages, deterministic finite automata (DFA) and equivalence with regular
expressions, nondeterministic finite automata (NFA) and equivalence with DFA, regular grammars and
equivalence with finite automata, properties of regular languages, pumping lemma for regular languages,
minimization of finite automata.
Module -III
Context free languages and pushdown automata [6L]:
Context free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms,
nondeterministic pushdown automata (PDA) and equivalence with CFG, parse trees, ambiguity in CFG,
pumping lemma for context free languages, deterministic pushdown automata, closure properties of
CFLs.
Module -IV
Context sensitive languages [6L]:
Context sensitive grammars (CSG) and languages, linear bounded automata and equivalence with CSG.
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.
Module -V
Undecidability [6L]:
Church Turing thesis, universal Turing machine, the universal and diagonalization languages, reduction
between languages and Rice s theorem, undecidable problems about languages
Text Books & Reference Books:

1. Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation,


Pearson Education Asia.10. Dexter C. Kozen, Automata and Computability,
Undergraduate Texts in Computer Science, Springer.
2. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing.
3. John Martin, Introduction to Languages and the Theory of Computation, Tata McGraw
Hill.
4. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata Theory,
Languages, and Computation, Pearson Education Asia.
Course Outcomes:
At the end of the course, a student will be able to:
CO1: Remember the definitions related to Chomsky hierarchy, FSA, PDA, CFG, TM;
CO2: Understanding the concept of FSA, PDA, TM etc;
CO3: Apply the above concepts through problem solving;
CO4: Analyzing the mathematical structure of the above abstract machines and their working;
CO5: Compare, evaluate and optimize different implementation models of abstract machines;
CO6: Construction of different types of abstract machines and their applications (e.g., compiler design);

Course Code : PCCCS503


Course Title : Object Oriented Programming
Contact Hours: L-T-P:2-0-0
Credit : 2

Module -I [8L]

Basics of Object-Oriented concepts, Difference between OOP and procedural programming – advantages
and disadvantages.

Properties of Object-Oriented Programming: Encapsulation, Inheritance, Polymorphism. Object Oriented


Design.

Introducing JAVA as OOP Language – advantages of Java, Byte-code & JVM.

Module -II [10L]

Data types, access specifiers. Array, creation of class, object, constructor, this keyword, methods, static
variables and methods, reference variables, basics of I/O operation. Exception handling basics, Different
types of exception classes, use of try & catch with throw, throws & finally, Creation of user defined
exception classes, String handling.

Module -III [8L]

Reusability Property, Inheritance in OOP design, Polymorphism, Use of abstract classes & methods,
interfaces, Creation of packages, importing packages, member access for packages.

Module -IV [6L]

Model-view-controller pattern. Commands as methods and as objects. Implementing OO language


features. Memory management, finalize and garbage collection.

Module -V [6L]
JAVA Applets, Multi-Threading, Generic types and collections GUIs. Graphical programming with
Swing.

Course Outcome:

CO1: Students will be able to remember the basic features of Object-Oriented Programming.
CO2: Students will be able to understand the concepts of encapsulation, polymorphism, inheritance, and
composition of systems based on object identity.
CO3: Students will be able to apply the features of MVC Architecture and Generic types and collections
GUIs.
CO4: Students will be able to analyze the ideas of MVC architecture regarding the development process
of any software architecture.
CO5: Students will be able to evaluate the various design applications with an event-driven graphical user
interface.
CO6: Students will be able to create the real-life case studies with AWT and Swing.

Course Code : PCCCS504

Course Title : Software Engineering


Contact Hours: L-T-P:2-0-0
Credit : 2

Module -I

Overview of System Analysis & Design, Business System Concept, System Development Life Cycle,
Waterfall Model, Spiral Model, Agile Software Development approach, Introduction to at least one agile
framework e.g. Scrum, Feasibility Analysis, Technical Feasibility

Module -II

Understanding of Requirements, Requirement Gathering Techniques, Functional and Non Functional


Requirements, Decision Tree and Decision Table.

System Design – Context diagram and DFD, Problem Partitioning, Top-Down and Bottom-Up design;
Decision tree, decision table and structured English; Functional vs. Object- Oriented approach. Static
and dynamic models, why modeling, UML diagrams: Class diagram, interaction diagram: collaboration
diagram, sequence diagram, state chart diagram, activity diagram, implementation diagram

Module -III

Coding & Documentation – Structured Programming, OO Programming, Information Hiding, Reuse,


System Documentation.

Testing – Levels of Testing, Integration Testing, Test case Specification, Reliability Assessment,
Validation & Verification, Metrics, Monitoring & Control.

Module -IV
Software Project Management – Cost- Benefit Analysis, COCOMO model, Project Scheduling,
Staffing, Software Configuration Management. Agile estimation techniques i.e. relative vs. absolute
scale, complexity points, Development Velocity.

Module -V
Software Maintenance, Software Reuse, Software Quality Assurance, SEI-CMM.

Text book and Reference books:

1. Pressman, Software Engineering: A practitioner’s approach– (TMH)

2. Pankaj Jalote, Software Engineering- (Wiley-India)

3. N.S. Gill, Software Engineering – (Khanna Publishing House)

4. Rajib Mall, Software Engineering- (PHI)

5. Agarwal and Agarwal, Software Engineering – (PHI)

6. Sommerville, Software Engineering – Pearson

7. Martin L. Shooman, Software Engineering – TMH

Course Outcome:

CO1: Students will be able to remember the given project in various phases of a life cycle as well as
various cost-benefit analysis.

CO2: Students will be able to understand and specify software requirements through a productive
working relationship with various stakeholders of the project

CO3: Students will be able to apply the different concepts of Decision Tree, Decision Table, DFD,
Structure Chart, UML diagrams and then realize that design practically, using an appropriate software
engineering methodology.

CO4: Students will be able to analyze the process of writing the code from the design and effectively
apply relevant standards and perform testing.

CO5: Students will be able to evaluate use modern engineering tools necessary for software project
management, time management, software reuse, quality assurance.

CO6: Students can create the own customized segments of the project by coordinating all aspects of
Software Engineering.

Course Code : MC501


Course Title : Constitution of India/ Essence of Indian Knowledge Tradition
Contact Hours: L-T-P: 3-0-0
Credit : 0

SYLLABUS:

Module -I:

Indian Constitution: Sources and constitutional history, Features: Citizenship, Preamble, Fundamental
Rights and Duties, Directive Principles of State Policy.

Module -II:

Union government and its administration: Structure of the Indian Union: Federalism, Centre- State
relationship, President: Role, power and position, PM and Council of ministers, Cabinet and Central
Secretariat, Lok Sabha, Rajya Sabha.

State government and its administration: Governor: Role and Position, CM and Council of ministers,
State Secretariat: Organization, Structure and Functions.

Module -III:

Supreme court: Supreme Court: Organization of Supreme Court, procedure of the court, independence of
the court, jurisdiction and power of Supreme Court.

High court: Organization of high court, procedure of the court, independence of the court, jurisdiction and
power of Supreme Court.
Subordinate courts: constitutional provision, structure and jurisdiction. National legal services authority,
Lok Adalats, family courts, gram nyayalays.
Public interest litigation (PIL): meaning of PIL, features of PIL, scope of PIL, principle of PIL, guidelines
for admitting PIL

Module -IV:

Local Administration: District’s Administration head: Role and Importance, Municipalities:


Introduction, Mayor and role of Elected Representative, CEO of Municipal Corporation, Pachayati
raj:Introduction, PRI: Zila Pachayat, Elected officials and their roles, CEO Zila Pachayat: Position and
role, Block level: Organizational Hierarchy (Different departments), Village level: Role of Elected and
Appointed officials, Importance of grass root democracy.

Text Books & Reference Books:

1. ‘Indian Polity’ by Laxmikanth

2. ‘Indian Administration’ by Subhash Kashyap

3. ‘Indian Constitution’ by D.D. Basu

4. ‘Indian Administration’ by Avasti and Avasti


Course Outcomes:

CO1: Remembering the features of the Constitution, different acts, structure of the union state and local
governments, the structure of the judiciary and the basic function of the local administration of India.

CO2: Understand the meaning and importance of Constitution, the workings of Union, State and local
governments, functioning of the judiciary and local governments.

CO3: Apply the concepts of the constitution to find the relevance of each in the current scenario.

CO4: Identify authority to redress a problem in the profession in the society.

CO5: Analyze how the Constitution embody certain ideals.

CO6: Develop an attitude and skills for critical analysis of social policy and development plans.

Course Code : HSMC501


Course Title : Humanities - II (Principles of Management)
Contact Hours: L-T-P: 3-0-0
Credit : 3

Module -I [6L]

1. Basic concepts of management: Definition – Essence, Functions, Roles, Level.

2. Functions of Management: Planning – Concept, Nature, Types, Analysis, Management by objectives;


Organisation Structure – Concept, Structure, Principles, Centralization, Decentralization, Span of
Management; Organisational Effectiveness.

Module -II [6L]

3. Management and Society – Concept, External Environment, CSR, Corporate Governance, Ethical

Standards.

4. People Management – Overview, Job design, Recruitment & Selection, Training & Development,

Stress Management.

Module -III [6L]

5. Managerial Competencies – Communication, Motivation, Team Effectiveness, Conflict

Management, Creativity, Entrepreneurship.

Module -IV [6L]

6. Leadership: Concept, Nature, Styles.

7. Decision making: Concept, Nature, Process, Tools & techniques.


Module -V [6L]

8. Financial Statement & Ratio Analysis, Quantitative Methods – Statistical Interference, Forecasting,

Regression Analysis, Statistical Quality Control.

Module -VI [6L]

9. Customer Management – Market Planning & Research, Marketing Mix, Advertising & Brand

Management.

10. Operations & Technology Management – Production & Operations Management, Logistics & Supply
Chain Management, TQM, Kaizen & Six Sigma, MIS.

Text Books & Reference Books:

1. Principles of Management – Premvir Kapoor, Khanna Publishing House, 2018.

2. Management: Principles, Processes & Practices – Bhat, A & Kumar, A (OUP).

3. Essentials for Management – Koontz, Revised edition, Tata McGraw Hill (TMH)

4. Management – Stoner, James A. F. (Pearson)

5. Management - Ghuman, Tata McGraw Hill(TMH)

Course Outcomes:

CO1. To enable the students to study the evolution of Management,

CO2. To study the functions and principles of management.

CO3. To learn the application of the principles in an organization.

CO4. Students would be able to pick and choose the best business methods and strategies more

professionally.

CO5. To study the system and process of effective controlling in the organization.

CO6. Students would be able to understand standard business principles and practices, evaluate

and analyze professional ability.

Course Code : HSMC(CS)502

Course Title : Essential Studies for Professionals (CS) - V


Contact Hours: L-T-P: 2-0-0
Credit : 1
Prerequisite: Basics of Digital Electronic, Programming, Discrete Mathematics and Computer
Organization

Syllabus

Digital Logic: Digital Logic Boolean algebra. Combinational and sequential circuits. Minimization.
Number representations and computer arithmetic (fixed and floating point).

Programming and Data Structures


Programming and Data Structures Programming in C. Recursion. Arrays, stacks.

Computer Organization and Architecture:


Machine instructions and addressing modes. ALU, data path and control unit. Instruction pipelining.
Discrete Mathematics:
Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs:
connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.

Learning Resources:
Ref. Books:
1. G.K publishers GATE Computer Science Engineering,
2. McGraw hill GATE 2020 Computer Science Engineering,
3. Wiley GATE 2020 Computer Science Engineering,
Course Objective:

1. To learn about basic of digital circuits for professional exams.

2. To learn about fundamentals of computer programming for various exams.

3. To learn about basic of discrete mathematics for professional exams.

4. To learn about fundamentals of computer organizations for various exams.

Course Outcomes:

CO1: To develop an understanding of Digital electronic circuit components and their working principles.

CO2: To learn all types of linear, non-linear data structures and calculate time complexity and space
complexity of any given algorithm.
CO3: To understand memory technology and communication among processing elements.

CO4: To use logical notation & Perform logical proofs, recursive functions and solve recurrence relations
and principles of counting.

Course Code : PECCS501B


Course Title : Principles of Artificial Intelligence & Deep Learning
Contact Hours: L-T-P: 3-0-0
Credit : 3
Prerequisite : Artificial Intelligence & Machine Learning
Module -I [10L]
Knowledge Representation:
Representation of knowledge using First Order Logic; theorem proving and answer extraction.
Representing knowledge in an uncertain domain, the semantics of Bayesian networks, Dempster-Shafer
theory. Introduction to Fuzzy sets; Different operators; Fuzzy relation; Fuzzy numbers; Fuzzy logic;
Defuzzification.
Search techniques:
Traditional search techniques – BFS, DFS; Heuristic search strategies – Hill climbing, A* Search;
evolutionary strategies; Adversarial search - Games, optimal decisions & strategies in games, the
minimax search procedure, alpha-beta pruning, additional refinements, iterative deepening.
Module -II [6L]
Brief Review of Machine Learning:
Types of machine learning; Process of machine learning, evaluating different ML models; Concept of loss
function; Challenges faced by ML.
Feature engineering:
Feature construction; Feature extraction; Feature selection.
Module -III [6L]
Basics of Neural Network:
Understanding biological neuron and artificial neuron; Types of activation functions; Architectures of
neural network; Learning process in ANN.
Training Deep Neural Network:
Back-propagation and mathematics behind it; Deep L-layer network; Computation graph; Weight
initialization in neural network; Batch, mini-batch and stochastic gradient descent; Optimization
algorithms; Regularization; Normalization.
Module -IV [12L]
Convolutional Neural Network:
Basic concept of computer vision; Challenges faced by traditional ANN to deal with image data;
Convolutional neural network concepts – kernel, stride, padding, pooling; Building a CNN; Popular CNN
architectures – LeNet, AlexNet, GoogLeNet, ResNet, Inception network, UNET; Object detection –
bounding box, YOLO, landmark detection, Transfer learning.
Sequence Based Models:
Introduction to sequence data; recurrent neural network; Vanishing Gradient Problem and RNN; Long
Short-term Memory (LSTM); Gated Recurrent Units (GRU); Bi-directional Models; Language modelling
and Sequence models

Text Books & Reference Books:

1. Deep Learning by Ian Goodfellow, Yoshua Bengio, Aaron Courville


2. Deep Learning by Amit Kumar Das, Saptarsi Goswami, Pabitra Mitra and Amlan Chakrabarti
3. Artificial Intelligence by Rich and Elaine Rich, Kevin Knight, & Shivashankar B Nair
4. Artificial Intelligence : A modern approach by Stuart Russell, Peter Norvig Pearson

Course Outcomes (CO):


CO1: To recall the different types of machine learning and deep learning techniques.
CO2: To understand the components of artificial neural networks.
CO3: To implement commonly used neural network models.
CO4: To analyze and compare the different types of deep learning techniques.
CO5: To assess the applicability of modern deep learning models and evaluate the efficiency over
machine learning models.
CO6: To create/modify the deep learning models for solving real life challenges as a part of the project.

Course Code : PECCS501C


Course Title : Web and Internet Technology
Contact Hours: L-T-P: 3-0-0
Credit : 3
Prerequisite : Basics of Programming

Module 1 [6L]:
Introduction
Overview, Network of Networks, Intranet, Extranet, and Internet. World Wide Web, Domain and Sub
domain, Address Resolution, DNS, Telnet, FTP, HTTP.
TCP/IP
Features, Segment, Three-Way Handshaking, Flow Control, Error Control, Congestion control, IP
Datagram, IPv4 and IPv6. IP Subnetting and addressing - Classful and Classless Addressing, Subnetting.
NAT, IP masquerading, IP tables.
Routing Protocol
Routing - Intra and Inter Domain Routing, Unicast and Multicast Routing, Broadcast, Electronic Mail
Protocol - POP3, SMTP.
Module 2 [9L]:
HTML
Introduction, Editors, Elements, Attributes, Heading, Paragraph. Formatting, Link, Head, Table, List,
Block, Layout, CSS. Form, Iframe, Colors, Colorname, Colorvalue.
Image Maps
Map, area, attributes of image area.
Extensible Markup Language (XML)
Introduction, Tree, Syntax, Elements, Attributes, Validation, Viewing. XHTML in brief.
CGI Scripts
Introduction, Environment Variable, GET and POST Methods.

Module 3 [10L]:
Perl
Introduction, Variable, Condition, Loop, Array, Implementing data structure, Hash, String, Regular
Expression, File handling, I/O handling.
JavaScript
Basics, Statements, comments, variable, comparison, condition, switch, loop, break. Object - string, array,
Boolean, reg-ex. Function, Errors, Validation.
Cookies
Definition of cookies, Create and Store a cookie with example.
Java Applets
Container Class, Components, Applet Life Cycle, Update method; Parameter passing applet,
Applications.
Module 4 [12L]:
Client-Server programming In Java
Java Socket, Java RMI.
Threats
Malicious code-viruses, Trojan horses, worms; eavesdropping, spoofing, modification, denial of service
attacks.
Network security techniques
Password and Authentication; VPN, IP Security, security in electronic transaction, Secure Socket Layer
(SSL), Secure Shell (SSH).
Firewall
Introduction, Packet filtering, Stateful, Application layer, Proxy.
Internet Telephony
Introduction, VoIP.
Multimedia Applications
Multimedia over IP: RSVP, RTP, RTCP and RTSP. Streaming media, Codec and Plugins, IPTV.
Search Engine and Web Crawler
Definition, Meta data, Web Crawler, Indexing, Page rank, overview of SEO.

Text Books & Reference Books:

1. Web Technology: A Developer's Perspective, N.P. Gopalan and J. Akilandeswari, PHI


learning, Delhi, 2013.
2. Internetworking Technologies, An Engineering Perspective, Rahul Banerjee, PHI Learning,
Delhi, 2011.

Course Outcomes (CO):


CO1: To understand the concept of network and internet.
CO2: To analyze various routing protocols in TCP/IP network.
CO3: To use HTML, XML, CSS, JavaScript and Perl for web application development.
CO4: To implement the server-side and client-side programming using Java RMI & Sockets.
CO5: To identify various security hazards on the Internet and the need of security measures.
CO6: To describe applications for IP telephony, multimedia and search engine optimization.

Course Code : PCCCS591

Course Title : Database Management System Lab


Contact Hours: L-T-P: 0-0-4
Credit : 2
Prerequisite: Data Structure & algorithms Lab

SYLLABUS:

Structured Query Language


1. Creating Database [6L]
Creating a Database
Creating a Table
Specifying Relational Data Types
Specifying Constraints
Creating Indexes
2. Table and Record Handling [6L]
INSERT statement
Using SELECT and INSERT together
DELETE, UPDATE, TRUNCATE statements
DROP, ALTER statements
3. Retrieving Data from a Database [6L]
The SELECT statement
Using the WHERE clause
Using Logical Operators in the WHERE clause
Using IN, BETWEEN, LIKE , ORDER BY, GROUP BY and HAVING
Clause, Using Aggregate Functions, Combining Tables Using JOINS, Subqueries
4. View [6L]
Creating Views
Creating Column Aliases
Creating Database Users
Using GRANT and REVOKE
5. PL/SQL
Introduction to PL/SQL, Basic Stored Procedures and functions.
Stored Procedure Continued -
Exceptions , Cursors, For Loop
Trigger , Sequence , Row ID, Rownum

Text Books and/or Reference Material


1. SQL Cookbook by Anthony Molinaro
2. Head First SQL: Your Brain on SQL -- A Learner's Guide Book by Lynn Beighley
3. SQL in 10 Minutes, Sams Teach Yourself (4th Edition) 4th Edition by Ben Forta
4. SQL, PL/SQL the Programming Language of Oracle by Ivan Bayross
Course outcomes:
CO1: Learn SQL basics for data definition and data manipulation.
CO2: To write select queries both at row level and aggregate level.
CO3: To write and apply the knowledge of joins, insert, update and delete statements.
CO4: To learn concept of view and use view for frequently used, complex queries.
CO5: Students should be able to understand and use basic PL/SqL blocks. like functions, procedures,
cursors and exception handling and students should be able to explain the need of views and how to
create them. To understand different concepts like Row Id, Row Number.
CO6: Develop solutions for database applications using functions, procedures, cursors, triggers and
exception handling.

Course Code : PCCCS593

Course Title : Object Oriented Programming Lab


Contact Hours: L-T-P: 0-0-4
Credit : 2
Prerequisite: Introduction to Computing, Data Structure Algorithms, Software Engineering
Syllabus:

1. Assignments on class, constructor, overloading, inheritance, overriding


2. Assignments on wrapper class, arrays
3. Assignments on developing interfaces multiple inheritance, extending interfaces
4. Assignments on creating and accessing packages
5. Assignments on multithreaded programming
6. Assignments on applet programming Note: Use Java for programming

Course Outcome:
CO1: Students will be able to remember the basic features of Object-Oriented Programming.
CO2: Students will be able to understand the concepts of encapsulation, polymorphism, inheritance, and
composition of systems based on object identity.
CO3: Students will be able to apply the features of MVC Architecture and Generic types and collections
GUIs.
CO4: Students will be able to analyze the ideas of MVC architecture regarding the development process
of any software architecture.
CO5: Students will be able to evaluate the various design applications with an event-driven graphical
user interface.
CO6: Students will be able to create the real-life case studies with AWT and Swing.

Text Books and/or Reference Material


1.Patrick Naughton, Herbert Schildt – “The complete reference-Java2” – TMH
2. R.K Das – “Core Java For Beginners” – VIKAS PUBLISHING
3. Deitel and Deitel –”Java How to Program” – 6th Ed. – Pearson
4. Ivor Horton’s Beginning Java 2 SDK – Wrox

Course Code : PCCCS594

Course Title : Software Engineering Lab


Contact Hours: L-T-P: 0-0-2
Credit : 1

Syllabus

Problem Analysis and Project Planning

Identify Project scope, Objectives, and Infrastructure Software Requirement Analysis

Describe the individual Phases / modules of the project and Identify deliverables

Identify functional and non-functional requirements


Data Modelling

Use work products – data dictionary

Software Designing Develop use case diagrams and activity diagrams

Build and test class diagrams

Sequence diagrams and add interface to class diagrams

Prototype model– Develop the prototype of the product

Text Books and/or Reference Material


1. Roger Pressman – “Software Engineering: A Practitioner's Approach” – McGraw-Hill
Higher Education.
2. Pankaj Jalote, Software Engineering- (Wiley-India)
3. N.S. Gill, Software Engineering – (Khanna Publishing House)
4. Rajib Mall, Software Engineering- (PHI)
5. Agarwal and Agarwal, Software Engineering – (PHI)
6. Sommerville, Software Engineering – Pearson
7. Martin L. Shooman, Software Engineering – TMH

Course outcome:
CO1: Students will be able to remember the given project in various phases of a life cycle as
well as various cost-benefit analysis.
CO2: Students will be able to understand and specify software requirements through a
productive working relationship with various stakeholders of the project
CO3: Students will be able to apply the different concepts of Decision Tree, Decision Table,
DFD, Structure Chart, UML diagrams and then realize that design practically, using an
appropriate software engineering methodology.
CO4: Students will be able to analyze the process of writing the code from the design and
effectively apply relevant standards and perform testing.
CO5: Students will be able to evaluate use modern engineering tools necessary for software
project management, time management, software reuse, quality assurance.
CO6: Students can create the own customized segments of the project by coordinating all
aspects of Software Engineering.

Course Code : HSMC582

Course Title : Skill Development for Professionals


Contact Hours: L-T-P: 2-0-0
Credit : 1
Prerequisite: Basic Mathematics, General English from primary to high school.

Syllabus

Quantitative Aptitude & Data Interpretation- Miscellaneous

Logical Reasoning

1) Statement And Assumption,


2) Statement And Conclusion,
3) Statement And Course Of Action,
4) Cause And Effect,
5) Drawing Inference

Verbal English

1) Sentence Corrections
2) Fill the blanks with appropriate words/articles/preposition/verbs/adverbs/conjunction.
3) Reading Comprehension (Advance Level)
4) Vocabulary

Learning Resources:
Reference Books:
1. Objective General English- S.P Bakshi
2. English Grammar and Competition-S.C Gupta
3. Fast Track Objective Arithmetic- Rajesh Verma
4. Advance Maths- Rakesh Yadav
5. Verbal and Non-Verbal Reasoning- R.S Agarwal
6. A new approach to Reasoning- BS Sijwali
7. Quantitative Aptitude-R.S Agarwal

Course Objective:

1. To enhance the aptitude & analytical skill of students with multiple tricky approaches.

2. To prepare the students for various competitive examinations & professional exams.

Course Outcomes:

CO1: The ability to communicate effectively with a range of audiences.


CO2: The ability to face the test and interview conducted by different companies and succeed
CO3: The ability to recognize the need for continuing professional development.
CO4: The ability to succeed in competitive exams.

You might also like