B.

Tech (Information Technology)

Forth SEMESTER
SYLLABUS
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code
Discrete Structure L=3 T=1 P=0 Credits = 4
AM100401
ESE CT TA Total ESE Duration
Evaluation Scheme
100 20 30 150 3 Hours

Course Objectives Course Outcomes

1. To introduce a number of discrete mathematical After completion of this course students will be –
structures found to be serving as tools in the CO1. Able to apply mathematical logic and Boolean
development of theoretical computer science. algebra in switching circuits & logic circuits.
2. Course focuses on how discrete structures helped CO2. Familiar with set theory, relation and functions.
computer engineers to solve problems occurred in CO3. Familiar with algebraic structures, graph theory
the development of programming languages. and combinatorics.
3. Course highlights the importance of discrete CO4. Able to solve problems in various fields in
structures towards simulation of a problem in computer science, especially networking
computer science engineering.

UNIT – I : Mathematical Logic & Boolean Algebra: CO1

Basic concept of mathematical logic, Statements, Connectives, Conditional and biconditional statements,
Logical equivalence, Logical implication & quantifiers, Basic concept of Boolean Algebra, Properties of
Boolean Algebra, Boolean functions, Disjunctive & conjunctive normal forms of Boolean functions,
Applications of Boolean Algebra in switching circuits & logic circuits. [10 Hrs]

UNIT – II : Set Theory, Relations, Functions: CO2

Basic concept of set theory, Relations, Properties of relation in a set, Equivalence relation, Composition
of relations, Partial order & total order relations, Lattices &Hasse diagram, Introduction to function,
Inverse, Identity, Injective, Surjective & Bijective functions, Composition of functions and some special
functions. [10Hrs]

UNIT – III : Algebraic Structures: CO3

Groups, Subgroups, Cosets, Lagrange’s theorem, Isomorphism, Automorphism, Homomorphism, Codes
& group codes, Rings, Integral domains and Fields. [10Hrs]

UNIT – IV : Graph Theory: CO4

Introduction to graph theory, Walks, Paths & Circuits, Types of graphs, Shortest path problems, Eulerian
and Hamiltonian graphs, Basic concept of tree: spanning tree, minimum spanning tree, search tree,
rooted binary tree, Cut sets, Network flow, Matrix representation of graphs. [8 Hrs]

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code
Discrete Structure L=3 T=1 P=0 Credits = 4
AM100401
ESE CT TA Total ESE Duration
Evaluation Scheme
100 20 30 150 3 Hours

UNIT – V: Combinatorics: CO5

Permutation and combination, Pigeon-hole principle, Mathematical induction, Principle of Inclusion and
Exclusion, Generating function, Recurrence relation. [8 Hrs]

Text Books:

S. No. Title Authors Publisher

Elements of discrete Tata McGraw- Hill,

1) mathematics C.L. Liu publications

Discrete Mathematical Bernard Kolman, Robert

2) C. Busby and Sharon Pearson Education
structures
Cutler Ross

Reference Books:

S. No. Title Authors Publisher

A Textbook of Discrete Swapan Kumar Sarkar S. Chand & Company Ltd.

1) Mathematics
Graph theory with applications
Prentice Hall of
2) to engineering and computer Narsingh Deo India.
science
Discrete mathematics for
computer scientists and J. L. Mott, A. Kandel and Prentice Hall of India
3)
mathematicians T.P. Baker
Discrete Mathematical J.P. Tremblay and R.
4) Structures with applications to Tata McGraw-Hill.
Manohar
computer science
Discrete Mathematical
5) H K Pathak S S Publication Meerut
Structure

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Programming In Java L= T= P= Credits = 3

IT106402
ESE CT TA Total ESE Duration
Evaluation Scheme 100 20 30 150 3 Hours

Course Objectives Course Outcomes

1. Make them learn about Java programming CO 1. Apply Java in developing Object Oriented
concepts. code.
2. Knowledge of features of OOPS. CO 2. Analyze and apply feature of OOPS such as
3. Familiarity with multi threading concept in run inheritance, polymorphism etc in implementation of
time environment. program.
4. Design and implement applications using GUI
CO 3. Apply the knowledge of Multi-threading
and Networking in Java.
5. Ability to analyze and implement Java based and Streams in developing Java applications.
applications for real world problems. CO 4. Implement of GUI and Networking in Java
run time environment(JVM).
CO 5. Design and develop Java based applications
for solutions to real world problems.

UNIT – I : INTRODUCTION: CO1

Introduction of Java programming, Features Of OOPS, Features of Java, data types, keywords, variables,
literals, expressions, operators, programming constructs, loop’s, Comparison with C++, Java program
Compilation and Execution, JVM as an interpreter and emulator, class File Format, Class loaders, Security
Promises of the JVM, Garbage Collection. [8 Hrs]

UNIT – II : CLASSES AND OBJECTS: CO2

Classes, Objects and References, Access specifiers, Methods, "this" keyword, static keyword, overloading
method, Arrays, Command line arguments. Constructors and finalizers, overloading constructors, Inner
classes, Wrapper Classes, Type compatibility and conversion .Inheritance; definition and advantages,
overriding, super , final and abstract classes, Interface, Package: Defining package, interfaces in package,
importing packages, Vector. [7Hrs]

UNIT – III : EXCEPTION HANDLING: CO3

STRINGS: Basic of exception handling, Checked and Unchecked Exceptions, default Exception handling,
try and catch, Multiple catch statements, try-catch ,finally, uses of throw and throws, User defined
exception and programs, Strings: string constructor, string arithmetic, string methods, StringBuffer and
methods. [7Hrs]

UNIT – IV : MULTI THREADING AND FILE HANDLING: CO4

Thread & Multi-threading Concepts, Thread life cycle, Thread Creation: Runnable and Thread Class,
Thread Priority, Thread Methods, Thread Synchronization: Concept of Monitor, Synchronized methods &
Synchronized blocks, Deadlocks. File Handling using Java, Streams, Byte and Character Streams, Various
operations with files. [7Hrs]
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Programming In Java L= T= P= Credits = 3

IT106402
ESE CT TA Total ESE Duration
Evaluation Scheme 100 20 30 150 3 Hours

UNIT- V : GUI APPLICATION AND APPLET DEVELOPMENT: CO5

Overview of AWT , applets and application, applet life cycle, User interfacing components, Layout
Managers, Event delegation model, Event types and classes, Listeners: ActionListener, KeyListener,
MouseListener etc., Overview of Swing Components. Introduction to JDBC, ODBC, JDBC drivers: Type
I, Type II, Type III, Type IV. JDBC Architecture, Java Networking: ServerSocket, Socket, RMI. [7Hrs]

Text Books:

S. No. Title Authors Publisher

Introduction to Java
1) Y. Daniel Liang Pearson Education, 7 th Edition.
Programming

2) Java The complete reference Herbert Schildt TMH, 5 th Edition

Reference Books:

S. No. Title Authors Publisher

1) Programming with JAVA Balguruswamy TMH.

2) Kathy Sierra, Bert O'Reilly Media

Head first Java
Bates Publication

3) Java How to Program H.M. Deitel & Paul PHI, 8 th Edition.

J. Deitel

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)
Subject Code
COMPUTER NETWORKS L=4 T=1 P=0 Credits = 3
IT106403
ESE CT TA Total ESE Duration
Evaluation Scheme 100 20 30 150 3 Hours

Course Objectives Course Outcomes

1.To develop an understanding of modern On successful completion of the course, the student will
Network architectures from a design and be able to:
performance perspective. CO1. To Explain the functions of the different layer of the
2. To introduce the student to the major concepts OSI Protocol.
involved in wide-area networks (WANs), local CO2. Draw the functional block diagram of wide-area
area networks (LANs) and Wireless LANs networks (WANs), local area networks (LANs) and
(WLANs). Wireless LANs (WLANs) describe the function of each
3. To provide an opportunity to do network block.
programming CO3.For a given requirement (small scale) of wide-area
4. To provide a WLAN measurement ideas.
networks (WANs), local area networks (LANs) and
5. To provide Cryptography Basics.
Wireless LANs (WLANs) design it based on the market
available component
CO4. For a given problem related TCP/IP protocol
developed the network programming.
CO5. Configure DNS DDNS, TELNET, EMAIL, File
Transfer Protocol (FTP), WWW, HTTP, SNMP, Bluetooth,
Firewalls using open source available software and tools.

Unit-1: Data communication Components: CO1

Representation of data and its flow Networks , Various Connection Topology, Protocols and Standards, OSI
model, Transmission Media, LAN: Wired LAN, Wireless LANs, Connecting LAN and Virtual LAN,
Techniques for Bandwidth utilization: Multiplexing – Frequency division, Time division and Wave division,
Concepts on spread spectrum. [8Hrs]

Unit-II : Data Link Layer and Medium Access Sub Layer: CO2
Error Detection and Error Correction – Fundamentals, Block coding, Hamming Distance, CRC; Flow
Control and Error control protocols - Stop and Wait, Go back – N ARQ, Selective Repeat ARQ, Sliding
Window, Piggybacking, Random Access, Multiple access protocols -Pure ALOHA, Slotted ALOHA,
CSMA/CD,CDMA/CA. [7Hrs]

Unit-III : Network Layer: CO3

Switching, Logical addressing – IPV4, IPV6; Address mapping – ARP, RARP, BOOTP and DHCP–
Delivery,Forwarding and Unicast Routing protocols. [7Hrs]

Unit-IV : Transport Layer: CO4

Process to Process Communication, User Datagram Protocol (UDP),Transmission Control Protocol (TCP),
SCTP Congestion Control; Quality of Service, QoS improving techniques: Leaky Bucket and Token Bucket
algorithm. [7Hrs]

Unit-V : Application Layer: CO5

Domain Name Space (DNS), DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP, SNMP,
Bluetooth, Firewalls, Basic concepts of Cryptography. [7Hrs]

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code
COMPUTER NETWORKS L=4 T=1 P=0 Credits = 3
IT106403
ESE CT TA Total ESE Duration
Evaluation Scheme 100 20 30 150 3 Hours

Text Books:

S. No. Title Authors Publisher

Data Communication and 4th Edition, Behrouz A.

1) McGraw Hill.
Networking, Forouzan
Data and Computer 8th Edition, William Pearson Prentice Hall
2) Communication, India.
Stallings,

Reference Books:

S. No. Title Authors Publisher

Computer Networks, Pearson New International
1) Andrew S. Tanenbaum
8th Edition, , Edition

2) Internetworking with TCP/IP, 6th Edition Douglas Prentice Hall of India.

Volume 1, Comer
Addison-Wesley, United
3) TCP/IP Illustrated, Volume 1, W. Richard Stevens States of America.

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Design Analysis of Algorithm L=3 T=1 P=0 Credits = 3

IT106404
ESE CT TA Total ESE Duration
Evaluation Scheme 100 20 30 150 3 Hours

Course Objectives Course Outcomes

1. Reinforce basic design concepts (e.g., CO 1. Apply design principles and concepts to
pseudocode, specifications, top-down design). algorithm design.
2. Knowledge of algorithm design strategies CO 2. Have the mathematical foundation in analysis
3. Familiarity with an assortment of important of algorithms
algorithms CO3. Understand different algorithmic design
4. Ability to analyze time and space complexity. strategies
5. To understand the Basic concepts of Linear CO4. Analyze the efficiency of algorithms using
time analysis of the KMP algorithm time and space complexity theory.
CO5. Implementation of different algorithm for
complexity measurement.

UNIT – I : Introduction to Algorithms: CO1

Analyzing algorithms, Algorithm types, Recurrence Equations, Growth function: Asymptotic notation,
Standard notation & common functions, Recurrence relation, different methods of solution of recurrence
equations with examples. [8 Hrs]

UNIT – II : Sorting and Introduction of Tree: CO2

Introduction to Divide and Conquer paradigm, Quick and merge sorting techniques, Linear time selection
algorithm, the basic divide and conquer algorithm for matrix multiplication Strassen Multiplication and,
Red Black tree, Binary Search tree , heap sort, shell & bucket sort. [7 Hrs]

UNIT – III : Algorithm Optimization: CO3

Overview of the greedy paradigm examples of exact optimization solution (minimum cost spanning tree),
Knapsack problem, Single source shortest paths.Overview, difference between dynamic programming and
divide and conquer, Applications: Shortest path in graph, Matrix multiplication, Traveling salesman
Problem, longest Common sequence. [7Hrs]

UNIT – IV : Graph: CO4

Representational issues in graphs, Depth first search & Breath first search on graphs, Computation of
biconnected components and strongly connected components using DFS, Topological sorting of nodes of
an acyclic graph & applications, Shortest Path Algorithms , Bellman -Ford algorithm, Dijkstra’s algorithm
& Analysis of Dij kstra’s algorithm using heaps, Floyd -Warshall’s all pairs shortest path algorithm.
[7Hrs]
.

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Design Analysis of Algorithm L=3 T=1 P=0 Credits = 3

IT106404
ESE CT TA Total ESE Duration
Evaluation Scheme 100 20 30 150 3 Hours

UNIT – V : Recursive and Backtracking Algorithms: CO5

The general string problem as a finite automata, Knuth Morris and Pratt algorithms, Linear time analysis
of the KMP algorithm, The Boyer -Moore algorithm. Backtrackin g & Recursive backtracking,
Applications of backtracking paradigm ,Complexity measures, Polynomial Vs Nonpolynomial time
complexity; NP - hard and NP -complete classes, examples. [7Hrs]

Text Books:

S. No. Title Authors Publisher

Algorithm Coreman, Rivest, PHI

1)
Lisserson
Fundamental of Computer
2) Horowitz & Sahani Galgotia
Algorithm

Reference Books:

S. No. Title Authors Publisher

Computer Algorithms:
1) Introduction to Design & Basse, Addision Wesley
Analysis

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Database Management

System L=3 T=1 P=0 Credits = 3
IT106405
ESE CT TA Total ESE Duration
Evaluation Scheme
100 20 30 150 3 Hours

Course Objectives Course Outcomes

1.To understand the role of a database On successful completion of the course, thestudent will
management system and its users in an be able to:
organization. CO 1. Describe the basic concepts of RDMBS and
2.To understand database concepts, including the relational data model Be familiar with the relational
structure and operation of the relational data database theory, and be able to write relational algebra
model. expressions for queries.
3. To successfully apply logical database design CO 2. Understand DML, DDL and will be able to construct
principles, including E-R diagrams and database queries using SQL by knowing the importance of data & its
normalization. requirements in any applications.
4. To construct simple and moderately advanced CO 3. Be familiar with the basic issues of transaction, its
database queries using Structured Query processing and concurrency control.
Language (SQL). CO 4. Able to translate DB designs from relational notation
5.To understand the concept of transaction, its to ER notation & con Perform normalization once
properties and how to persist the data in complex redundancies have been eliminated.
concurrent users environment.. CO 5. Be familiar with basic db storage structures, access
techniques: file / page organizations, indexing methods
including B-tree, hashing.

UNIT – I Introduction: CO 1
An overview of database management system, database system Vs file system, Database system concept and
architecture, data model schema and instances, data independence and database language and interfaces, Overall
Database Structure.
Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER diagram, mapping
constraints, keys, Concepts of Super Key, candidate key, primary key, Generalization, aggregation, reduction of
an ER diagrams to tables, extended ER model, relationship of higher degree. [8 Hrs]

UNIT – II Relational data Model and Language: CO 2

Relational data model concepts, integrity constraints, entity integrity, referential integrity, Keys constraints,
Domain constraints, relational algebra, relational calculus, tuple and domain calculus.
Introduction on SQL: Characteristics of SQL, advantage of SQL. SQl data type and literals. Types of SQL
commands. SQL operators and their procedure. Tables, views and indexes. Queries and sub queries. Aggregate
functions. Insert, update and delete operations, Joins, Unions, Intersection, Minus, Cursors, Triggers, Procedures
in SQL/PL SQL. [7Hrs]

UNIT – III Data Base Design & Normalization: CO 3

Functional dependencies, normal forms, first, second, third normal forms, BCNF, inclusion dependence, loss
less join decompositions, normalization using FD and MVD alternative approaches to database design. [7Hrs]

UNIT – IV Transaction Processing Concept: CO 4

Transaction system, Testing of serializability, serializability of schedules, conflict & view serializable schedule,
recoverability, Recovery from transaction failures, log based recovery, checkpoints, deadlock handling.
[7Hrs]
August 2021 1.00 Applicable for
Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Database Management L=3 T=1 P=0 Credits = 3

IT106405 System
ESE CT TA Total ESE Duration
Evaluation Scheme
100 20 30 150 3 Hours

UNIT – V Concurrency Control Techniques: CO 5

Concurrency control, Locking Techniques for concurrency control, Time stamping protocols for concurrency
control, validation based protocol, multiple granularity, Multi version schemes, Recovery with concurrent
transaction, case study of Oracle.
Overview of Storage and Indexing: Data on External Storage, File Organization and Indexing - Clustered
Indexes, Primary and Secondary Indexes, Index data Structures - Hash Based Indexing, Tree based Indexing,
Comparison of File Organizations, Indexed Sequential Access Methods(ISAM). [7Hrs]

Text Books:

S.
No. Title Authors Publisher

1) Database system concept Korth & Sudarshan TMH, 5th Ed.

2) Introduction to Database Systems C.J.Date Pearson Education, 8th Ed

Reference Books:

S.
No. Title Authors Publisher

1) Principles of Database Systems Ullman, J.O

Galgotia Publications. IInd Ed

2) Fundamentals of Database Elmasri R. & Navathe Pearson Education.

Systems S.B

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Programming In Java Lab L= T= P= Credits = 1

IT106491
ESE CT TA Total ESE Duration
Evaluation Scheme 25 25 50 -------

Course Objectives Course Outcomes

1. Ability to write, compile, run, and test simple CO 1. Use an integrated development environment to
Java programs. write, compile, run, and test simple object-oriented Java
2. Knowledge of features of OOPS required to programs.
implementation in program. CO 2. Implement Object Oriented programming concept
3. Understanding of multi threading concept in using basic syntaxes of control Structures, strings and
run time environment. function for developing skills of logic building activity.
4. Design and implement applications using GUI CO 3. Identify classes, objects, threads of a class and the
and Networking in Java. relationships among them needed for a finding the solution
5. Analyze and implement Java based applications to specific problem.
for real world problems CO 4. Demonstrates how to use GUI and Networking and
describes faster application development can be achieved.
CO 5. Understanding and use of different applications of
java (such as applet, awt, swing etc.)and implementation
for real world problems.

List of Experiment (but should not be limited to): [24 Hrs]

1. Write a program in Java to read from console employee details of 5 employees with following details:
Name of employee, Department, Age, Salary. Print the details of every employee..
2. Write a program to find the volume of a box having its side w,h,d means width ,height and depth. Its
volume is v=w*h*d and also find the surface area given by the formula s=2(wh+hd+dw). use appropriate
constructors for the above.
3. Write a program to show the use 'this' keyword .
4. Develop a program to illustrate a copy constructor so that a string may be duplicated into another variable
either by assignment or copying.
5. Create a base class called shape. Apart from Constructors, It contains two methods get xyvalue() and
show xyvalue() for accepting co-ordinates and to display the same. Create the sub class Called Rectangle
which contains a method to display the length and breadth of the rectangle called showxyvalue().Illustrate
the concepts of Overriding and Constructor call sequence.
6. Write a program that creates an abstract class called dimension, create two subclasses, rectangle and
triangle. Include appropriate methods for both the subclass that calculate and display the area of the
rectangle and triangle.
7. Write a program, which throws Arithmetic Exception. Write another class (in a different file) that handles
the Exception.
8. Write a program to create a user defined Exception class which throws Exception when the user inputs
the marks greater than 100 Catch it and again rethrow it.
9. Write a program to illustrate various String class methods.
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

10. Write a program to illustrate various String Buffer methods.

11. Write a program in which a Mythread class is created by extending the Thread class. In another class,
create objects of the Mythread class and run them. In the run method print “SSTC IT DEPARTMENT”
10 times. Identify each thread by setting the name.
12. Demonstrate using a Java program, how DEADLOCK occurs between threads and also give solution
program..
13. Write a Program to illustrates the concept of Thread Synchronization problem and also give solution.
14. To write a program to create a text file using Byte Stream class.
15. To write a program to copy contents of one file to another.
16. Write a JDBC program for Student Mark List Processing.
17. Write a program, which illustrates the use of Mouse Events. Use Applet for this.
18. Write a program using swing components which simulates simple calculator.
19. Develop two applications in Java using Sockets to communicate with each other using text messages.
20. Develop two applications in Java using RMI to communicate with each other using text messages.

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards

Text Books:
S. No. Title Authors Publisher
Introduction to Java
1) Y. Daniel Liang Pearson Education, 7 th Edition.
Programming

2) Java The complete reference Herbert Schildt TMH, 5 th Edition

Reference Books:

S. No. Title Authors Publisher

Programming with JAVA Balguruswamy TMH.

1)

2) Kathy Sierra, Bert O'Reilly Media

Head first Java
Bates Publication

3) Java How to Program H.M. Deitel & Paul PHI, 8 th Edition.

J. Deitel

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Design Analysis of Algorithm L=3 T=1 P=0 Credits = 1

IT106492 Lab
ESE CT TA Total ESE Duration
Evaluation Scheme 25 25 50 --------

Course Objectives Course Outcomes

1. Write sorting programs using Divide-and- CO 1. Argue the correctness of algorithms using inductive
Conquer techniques. proofs and invariants.
2. Implement to find the minimum cost CO 2. Analyze worst-case running times of algorithms
spanning tree and shortest path using using asymptotic analysis
different Greedy techniques. CO3. Describe the divide-and-conquer paradigm and
3. Construct DFS, BFS programs and explain when an algorithmic design situation calls for it.
topological ordering using Decrease-and- Recite algorithms that employ this paradigm. Synthesize
Conquer technique. divide-and-conquer algorithms. Derive and solve
4. Implement knapsack, travelling salesperson recurrences describing the performance of divide-and-
5. Apply important algorithmic design conquer algorithms
paradigms and methods of analysis. CO4. Describe the dynamic-programming paradigm and
6. Synthesize efficient algorithms in common explain when an algorithmic design situation calls for it.
engineering design situations. Recite algorithms that employ this paradigm. Synthesize
dynamic-programming algorithms, and analyze them
.

List of Experiment: [24 Hrs]

1. Sort a given set of elements using the Quick sort method and determine the time required to sort the
elements. Repeat the experiment for different values of n
2. Sort a given set of elements using merge sort method and determine the time required to sort the elements.
Repeat the experiment for different of values of n
3. Write a program to obtain the topological ordering of vertices in a given digraph.
4. Implement travelling salesman problem.
5. Implement the knapsack problem (0/1).
6. Print all the nodes reachable from a given starting node in a digraph using BFS method.
7. Check whether a given graph is connected or not using DFS method.
8. Write a program to implement binary search using divide and conquer technique
9. Write a program to implement insertion sort using decrease and conquer technique
10. Find minimum cost spanning tree of a given undirected path using a Prim’s algorithm.
11. From a given vertex in a weighted connected graph, find shortest paths to other vertices using Dijkstra’s
algorithm

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Design Analysis of Algorithm L=3 T=1 P=0 Credits = 1

IT106492 Lab
ESE CT TA Total ESE
Evaluation Scheme Duration
25 25 50 -------

Text Books:

S.
No. Title Authors Publisher
Introduction to the Design and Analysis Pearson Publication, ISBN:
1) Anany Levitin,
of Algorithms ,3rd edition 9789332583771

Reference Books:

S.
No. Title Authors Publisher

Algorithm Coreman, Rivest, PHI

1)
Lisserson
2) Fundamental of Computer Algorithm Horowitz & Sahani Galgotia

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Database Management

IT106493 System Laboratory L=0 T=0 P= 2 Credits=1
ESE CT TA Total ESEDuration
EvaluationScheme 25 - 25 50 --------

CourseObjectives CourseOutcomes
1 To understand data definitions and data Upon completion of the course, the students will be able to:
manipulation commands CO 1.Use typical data definitions and manipulation
2 To learn the use of nested and join queries commands. Design applications to test Nested and Join
3 To understand functions, procedures and Queries
procedural extensions of data bases CO 2.Implement simple applications that use Views
4 To be familiar with the use of a front end tool CO 3.Implement applications that require a Front-end Tool
5 To understand design and implementation of CO4.Critically analyzes the use of Tables, Views,
typical database applications. Functions and Procedures.
CO5. Analyze the control structure of DBMS with SQL.

List of experiments: [24 Hrs]

1. To implement Data Definition language

1.1Create, alter, drop, truncate
1.2 To implement Constraints. (a) . Primary key, (b).Foreign Key, (c). Check, (d). Unique, (e). Null,
(f). Not Null (g). Default, (h). Enable Constraints, (i). Disable Constraints (j). Drop Constraints
2. To implementation of DML, DCL commands in RDBMS
2.1 (a).Insert, (b).Select, (c).Update, (d).Delete, (e).commit, (f).rollback, (c) (g).save point, (i).
Like'%', (j).Relational Operator.
3. To implement Nested Queries & Join Queries
3.1 (a) Nested Queries related SQL statement using Inner Join, Left Outer Join, Right Outer Join, and
Full Outer Join
4. To implement Views
4.1. (a). View, (b).joint view, (c).force view, (d). View with check option
5. (a) Control Structure
5.1. To write a PL/SQL block for Addition of Two Numbers
5.2. To write a PL/SQL block for IF Condition
5.3. To write a PL/SQL block for IF and else condition
5.4. To write a PL/SQL block for greatest of three numbers using IF AND ELSEIF
5.5. To write a PL/SQL block for summation of odd numbers using for LOOP
5. (b) Procedures
5.6. To write a PL/SQL Procedure using Positional Parameters
5.7. To write a PL/SQL Procedure using notational parameters
5.8. To write a PL/SQL Procedure for GCD Numbers
5.9. To write a PL/SQL Procedure for cursor implementation
5.10. To write a PL/SQL Procedure for explicit cursors implementation
5.11. To write a PL/SQL Procedure for implicit cursors implementation
5.12. To write a PL/SQL block to implementation of factorial using function
5.13. To write a PL/SQL function to search an address from the given database
6. Triggers:
6.1. To write a Trigger to pop-up the DML operations
6.2. To write a Trigger to check the age valid or not Using Message Alert.
6.3. Create a Trigger for Raise appropriate error code and error message.
6.4. Create a Trigger for a table it will update another table while inserting values

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Database Management

IT106493 System Laboratory L=0 T=0 P= 2 Credits=1
ESE CT TA Total ESE Duration
Evaluation Scheme 25 - 25 50 -------

Text Books:

S.No. Title Authors Publisher

1. Database system concept Korth&Sudarshan TMH, 5 th Ed.
2. Pearson Education, 8 th
Introduction to Database Systems C.J.Date
Ed

Reference Books:

S.No. Title Authors Publisher

1. Principles of Database Systems Ullman, J.O Galgotia Publications
2. Elmasri R. &Navathe
Fundamentals of Database Systems Pearson Education
S.B
3. Database Design Fundamentals Rishe N PHI.

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Mini Project - II (Flask/Jango) L=3 T=1 P=0 Credits = 1

IT106494
ESE CT TA Total ESE Duration
Evaluation Scheme 25 25 50 ------

Course Objectives Course Outcomes

To understandthe working of Web Applications After successful completion if this course, the students will
and clients ide technologies. be able to-
1.To provide understanding of how XML can be
CO 1. Explain the understanding of working of web
developed and used.
Applications..
2.To understande-commerce.
3.To learn howto host anddeploy theweb CO 2. Explain Architectural Framework for e-commerce.
applications on servers. CO3. Develop Web applications that can be hostedon
4. To learn howto Django Processes webservers.
5. To provide understanding Wildcard URL CO 4. Explain Architectural Framework for Django
patterns Processes.
CO5. Develop Web applications that can be Wildcard
URL patterns

Suggested List of Experiments (but should not be limited to): [24 Hrs]

1.Introduction to Django

• What Is a Web Framework?

• The MVC Design Pattern
• Django’s History

2.Installation of Django

• Installing Python
• Installing Django
• Setting Up a Database
• Starting a Project.
• The Development Server
• DjangoCommands Overview

3.The Basics of Dynamic Web Pages

• Your First View: Dynamic Content

• Mapping URLs to Views
• How Django Processes a Request
• URL configurations and Loose Coupling
• 404 Errors
• Your Second View: Dynamic URLs
• A Word About Pretty URLs
• Wildcard URL patterns
• Django’s Pretty Error Pages

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards
 SHRI SHANKARACHARYA TECHNICAL CAMPUS, BHILAI
(An Autonomous Institute affiliated to CSVTU,Bhilai)
Scheme of Examination and Syllabus 2021
Second Year B. Tech. (IT)
B.Tech (4th Semester – Information Technology)

Subject Code Mini Project - II (Flask/Jango) L=3 T=1 P=0 Credits = 1

IT106494
ESE CT TA Total ESE Duration
Evaluation Scheme 25 25 50 ------

4.The Django Template System

• Template System Basics

• Using the Template System
• Creating Template Objects
• Rendering a Template
• Multiple Contexts, Same Template
• Context Variable Lookup
• Playing with Context Objects
• Basic Template Tags and Filters Tags
• Philosophies and Limitations
• Using Templates in Views
• Template Loading
• render_to_response()
• The locals() Trick
• Subdirectories in get_template()
• The include Template Tag

Text Books:

S.
No. Title Authors Publisher

1) The Definitive guide to DJANGO Adrian Holovaty and APRESS

Jacob Kaplan-Moss
2) Django: Web Development with Samuel Dauzon, Aidas
Bendoraiyis, Arun Packt
Python
Ravindran

Reference Books:

S.
No. Title Authors Publisher

Django Professional Series: Dana Moore, Raymond

1) Wrox
Python Frameworks Budd, William Wright

2) Bert Bates O'Reilly Media Publishers

3) Head First PHP & MySQL Lynn Beighley Michael Morrison

August 2021 1.00 Applicable for

Chairman (AC) Chairman (BoS) Date of Release Version AY 2020-21 Onwards