You are on page 1of 19

SOC /SASTRA

B.Tech., (CSE) SYLLABUS

SHANMUGHA ARTS, SCIENCE,


TECHNOLOGY & RESEARCH ACADEMY
SASTRA University
TIRUMALAISAMUDRAM
THANJAVUR 613402

SUBJECTS OF STUDY AND SYLLABI FOR

B.TECH (CSE) PROGRAMME

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

SHANMUGHA
ARTS, SCIENCE, TECHNOLOGY & RESEARCH ACADEMY (SASTRA)
TIRUMALAISAMUDRAM - 613 402.
School of Computing - B.Tech. (CSE) Scheme
(For Candidates Admitted From 2006 Onwards)
SEMESTER V:

Subject Code
BCSCCS501
BCSCCS502
BCSCCS503
BCSCCS504
BCSDXX XXX
BCSDXX XXX
BCSCCS505
BCSCCS506
BCSCTP509

Subject Title
Design and Analysis of
Algorithms
System Software & compiler
design
Java Programming
Data Base Management Systems
DE 4
DE 5
Java Programming Lab
Data Base Management Systems
Lab
HR Skill III
TOTAL

Periods of
Instruction
L
T
P

CREDIT
Points

3
3
3
3
0

1
1
1
1
0

0
0
0
0
3

4
4
4
4
2

1
20

0
6

0
6

1
30

0
0
0
0
0
0

4
4
4
4
4
4

DEPARTMENTAL Electives:
BCSDCS501
BCSDMA502
BCSDBT503
BCSDCS504
BCSDMA505
BCSDCS506

C# and .NET Framework


Numerical Methods
Basics of Bio-informatics
Theory of Computation
Probability and queuing theory
Micro controller & Applications

3
3
3
3
3
3

1
1
1
1
1
1

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSCCS 501 - DESIGN & ANALYSIS OF ALGORITHMS


L T P
3 1 0
UNIT I

CREDITS
4
15

Introduction: The role of Algorithms in computing - A l g o r i t h m s A l g o r i t h m s a s


a technology Insertion Sort analyzing algorithms designing algorithms Asymptotic notations Standard notations and common functions Mathematical
Background Summations sets relations functions graphs trees recurrences
UNIT II

15

Sorting: Heaps M aintaining t h e H e a p p r o p e r t y - B u i l d i n g a Heap


Heap sort Algorithm Implementing heap using Priority Queues Quick Sort
Description performance randomized version Analysis of Quick Sort Counting
sort Radix sort Bucket sort
UNIT III

15

Design and Analysis Techniques: Dynamic programming Matrix chain


multiplication Elements of dynamic programming Longest Common
Subsequence - Greedy Algorithms Activity selection problem elements of greedy
strategy Huffman coding Task scheduling problems Amortized analysis
aggregate method accounting method potential method Dynamic tables.
UNIT IV

15

Graph Algorithms: Analysis of Breadth first search and Depth first search
Topological sort Minimum spanning trees Growing a minimum spanning tree
The algorithms of Kruskal and Prim - Single source shortest path Dijkstras
Algorithm Bellman Ford Algorithm All pairs Shortest paths Floyd Warshall
algorithm

Text Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest,
Introduction to Algorithms, Second Edition, PHI, 2001
2. Gilles Brassard, Paul Bratley, Fundamentals of Algorithmics, PHI, 2002
References:
1. Donald E.Knuth, "The Art of Computer Programming", Volume1-3,
Addison Wesley Publishing Company, 1997
2. Ellis
Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, "Computer
Algorithms", Galgotia Publications Pvt.Ltd, 1999

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSCCS502 SYSTEMS SOFTWARE & COMPILER DESIGN


L T P
CREDITS
4 1 0 5

UNIT I`

19

Assemblers: Functions-Data structures- machine dependent assembler features machine independent assembler features -one pass assembler and multipass assembler
- assembler design options.
Loaders and Linkers: Functions design - bootstrap loader - machine dependent
loader features - machine independent loader features - loader design options Dynamic linking and Linkage Editors Implementation Examples

UNIT II

19

Introduction: Compilers and translators- The structure of a compiler- Finite automata


and lexical analysis-regular expressions-Finite automata - NFA and DFA Implementation of lexical analyzer-context free grammars- Derivations and parse
trees.

UNIT III

18

Parsers: Shift reduce parsers- Operator precedence parsers- Top down parsingpredictive parsing-LR parsers-SLR parsers-Canonical LR parsers- LALR parser.
Symbol Table & Run Time Storage: Data structures- Syntax directed translation Implementation - Storage allocations

UNIT IV

19

Syntax directed translation: Schemes- Intermediate code - Postfix notation and


translation- Parse trees and Syntax trees - Three address code-array references procedure calls Error Detection and Recovery: Lexical errors - Syntactic errors Semantic errors Code optimization and generation: Loop optimization - DAGGlobal data flow analysis- copy propagations

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

Text Books:
1. Alfred V Aho, Jeffrey D Ullman, Ravi Sethi, "Compilers, Techniques, and Tools",
Addison Wesley,2006
2. Leland L Beck, D. Manjula, "System Software",III Edition, Pearson Education -First Impression, 2007
References:
1. Alfred V Aho, Jeffrey D Ullman,"principles of compiler design", Narosa
Publishers,1999
2. D M Dhamdhere,"Introduction to System Software", Tata Mcgraw hill,1999

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSCCS503 JAVA PROGRAMMING


L T P
CREDITS
3 1 0 4
UNIT - I
15
Introduction to Object Oriented Programming - Genesis of Java - Overview of Java Data types, Variables and Arrays - Operators Control Statements - Introducing
Classes - Methods and Classes - Overloading - Understanding static, final - Nested
and Inner Classes - String class - Command Line Arguments - Inheritance - I/O
Basics - Packages and Interfaces - Exception Handling.
UNIT II
15
Multithreaded Programming - Java Thread Model - Creating Multiple Threads Thread Priorities - Synchronization - Inter thread communication - Suspending,
Resuming and Stopping threads - Applets - Fundamentals - Applet class - Applet
Skeleton - Event Handling - Event classes Event Listener Interfaces - Adapter
Classes - Inner Classes.
UNIT III
15
AWT - Window Fundamentals - Working with Frame Windows, Graphics, colors,
and Fonts - Using AWT controls, Layout managers and Menus Control
Fundamentals - Understanding Layout Managers - Java RMI - Networking - Basics Networking Classes and Interfaces - InetAddress - TCP/IP Socket, ServerSocket
classes - UDP DatagramSocket, DatagramPacket classes
UNIT IV
15
Java Library - String handling - String Operation, comparison, searching, modifying String Buffer - java.lang - Simple Type Wrappers Math - java.util - Collection
Interfaces - Collection classes Legacy classes - Stack - Dictionary - Hash table Date class - Random class - java.io - File - ByteStreams - CharacterStreams Serialization .
Text Books
1. Herbert Schildt, "The Complete Reference Java 2", Fifth Edition, Tata
McGraw Hill Edition, 2002
2. Harvey M. Deitel, Paul J. Deitel, "Java: How to Program", 7th Edition, Deitel
& Associates Inc., 2006.

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSCCS504 DATABASE MANAGEMENT SYSTEMS


L T P
CREDITS
3 1 0 4
UNIT I:

15

Introduction: Data Database types of databases conventional content and rich


content databases Database Management Systems Categories of DBMS Systems
Underlying theories Applications of DBMS Users and Nature of DBMS
Languages, Utilities and Interfaces provided by commercial DBMS
DBMS Architecture & Organization: ANSI SPARC Layered Architecture Goals of
Architecture Data Independence Typical DBMS Organization Schema Objects
System Catalog Typical DBMS Components
UNIT II:
15
Storage Basics: Fundamentals of Storage Types of Storage Purposes of different
types of Storage and comparisons Concept of RAID RAID Schemes
Comparison of RAID Schemes Types of Files Operations on Files Introduction
to Indexes types of Indexes B Trees B+ Trees
Relational Theory and Relational Algebra: Introduction to Relational Theory
Codds Rules NULL Values Basic Operators of Relational Algebra Examples
and Exercises Additional Operators of Relational Algebra Example and Exercises
Extended Relational Algebra Operations and modification of Database Example
and Exercises
UNIT III:
15
SQL: Introduction Sub Languages Standards DDL Constraints System
Tables DML Selection, Insert, Update and Delete operators - Projection
Predicates Joins sub-queries, nesting and correlated sub-queries - Grouping
Sorting Set Operations Aggregation and Built-In Functions Working with Date
Data-type Pseudo Columns Database Security Reports Synonyms views
sequences indexes - Stored Procedures Triggers Cursors
Data Modeling: Phases of a Typical Project Database Design Approaches Keys
Descriptive Fields - Quantitative Fields Types of Keys Data Types and Sizes Entity Relationship Model E-R Notations and concepts Extended ER Examples
and Case Studies Normalization Normal Forms Anomalies Representation of
Multivalued Attributes and MVD Examples, Exercises and Case Studies

UNIT IV:
15
Transactions and Concurrency Management: Transaction States Properties of
Transactions - Locks and Isolation Levels Serializability Schedules Conflict &
View Serializability - Concurrency Concurrency Control Lock-Based and
Timestamp based protocols Two phase commit protocols - Multiversion schemes
Logging and Recovery

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

Text Books:
1. R. Elmasri and S.B. Navathe - Fundamental of Database Systems 4th Edition
Pearson Education, 2004.
2. Henry F. Korth, Abraham Silberschatz and Sudarshan -Database System
Concepts 5th Edition McGraw Hill Inc., 2005.
References:
1. Database Systems Concepts, Design and Applications S. K. Singh
2. An Introduction to Database Systems C. J. Date 8th Edition, Addison Wesley,
2004

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSCCS505 JAVA PROGRAMMING LAB


L T P
0 0 3

CREDITS
2

1. Polymorphism in Java
1. Inheritance in Java
2. Interfaces in Java
3. Packages in Java
4. Developing a simple applet using labels, text field and buttons.
5. Developing a simple applet using list box, choice box, scroll bar, check box.
6. Developing stand-alone GUI interface using frames.
7. Developing an applet demonstrating the font features.
8. Develop an applet using panels and Layout Manager.
9. Develop an applet demonstrating graphics features using brush styles,
colors, etc.
10. Demonstrate Remote Method Invocation in Java

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSCCS506 DATABASE MANAGEMENT SYSTEM LAB


L T P
0 0 3

CREDITS
2

Part1 SQL
1.
2.
3.
4.
5.
6.
7.
8.

Creation of Tables & Simple Queries


Implementation of Key Constraints
Implementation of Arithmetic/Logical Operations, Sorting and Grouping
Nested Queries
Joins
Built-In Functions
Update Operations
Indexes, Sequences, Synonyms & Views

Part2 PL/SQL
1.
2.
3.
4.

Simple PL/SQL Procedure


PL/SQL Procedure with Cursors
Exception Handling
Triggers

Part 3 Developer 2000 (Forms)


1. Student Information
2. Inventory Control System
3. Payroll System
Part 4 Developer 2000 (Reports)
1. Payroll Reports
2. Student Reports

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSCTP509 HR Skill III


L T P
1 0 0

WEEK 01

CAREER PROSPECTS

WEEK 02

MOCK PRESS

WEEK 03

APTITUDE TEST IV

WEEK 04

PUBLIC SPEAKING ESSENTIALS

WEEK 05

PUBLIC SPEAKING PRACTICAL

WEEK 06

PUBLIC SPEAKING PRACTICAL

WEEK 07

ATTENTION TO DETAILS

WEEK 08

TEAM SKILLS III

WEEK 09

GROUP DISCUSSION ESSENTIALS

WEEK 10

GROUP DISCUSSIONS PRACTICE

WEEK 11

MIND SKILL EXERCISE

WEEK 12

DECISION MAKING

WEEK 13

CONFLICT MANAGEMENT

WEEK 14

PSYCHOMETRIC TEST

WEEK 15

ORGANISATIONAL SKILLS

CREDIT
1

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSDCS 501: C# AND .NET FRAME WORK


L T P
3 1 0

UNIT I

CREDITS
4

15

Introduction to .NET frame work-.NET objects- ASP .NET- .NET web services
Windows Forms
UNIT II
15
Introduction to C#, Understanding C# in .NET, overview of C#, Literals, Variables,
Data types, Operators, Expressions, Branching and looping operations- Methods,
Arrays, Strings.
UNIT III
15
Structures and Enumerations Classes and Objects - Inheritance and Polymorphism,
Multiple Inheritance.
UNIT IV
Operator overloading, Events, console I/O operations and Exception.

15

TEXT BOOKS
1.
2.

E. Balagurusamy, Programming in C#, Tata McGraw Hill, 2002


David S. Platt, Introducing Microsoft .NET Microsoft Press, Saarc Edition,
2001

REFERENCES
1.

Microsoft, C# Language specifications, Microsoft Press, 2001.

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSDMA502 NUMERICAL METHODS


L T P
3 1 0
UNIT-1: System of equations and Eigen value problems

CREDITS
4
15

Introduction-Bisection method- Secant method-Regular falsi method- Newton


Raphson method- Iteration method-Horners method Graffs root squaring method
of finding real roots of an equation.
Direct method- Gauss elimination method-Gauss Jordan method- Cholesky method.
Iterative methods- Gauss Jacobi iteration method- Gauss seidel iteration methodSuccessive over relaxation method. Eigen values and Eigen vectors by power method
UNIT-2: Interpolation and Approximation

15

Introduction- Finite difference operators- relation between operators- Lagrange and


Newton interpolations- Gauss interpolation formula- Stirlings interpolation formulaBessels interpolation formula. Solving difference equations with constant co efficient.
UNIT-3: Numerical Differentiation and Integration
15
Introduction- Numerical differentiation- Methods based on finite differences.
Numerical integration-Trapezoidal rule, Simpsons 1\3 rule, Simpsons 3\8 rule.
Power series approximation - solution by Taylor series- Eulers Improved and
modified Eulers methods- Runge Kutta IVth order method- Milnes predictorcorrector method. Adams Bashforth method.
UNIT-4: Numerical solution of Partial Differential Equation

15

Solution of partial differential equations- Classification of partial differential


equations of the second order-Laplace equation and its solution by Liebmanns
process- Solution of Poisson equation-Solution of parabolic equation- Bender
Schmidt method-Crank Nicholson method- Solution of Hyperbolic equation.
Text Book
Dr. M.K. Venkatraman, Numerical methods, National Publishing company-1999
References:
1. Dr.P.Kandasamy. Numerical methods,S.chand&co.,New Delhi-110055. 1996.
2. Dr.Sastri S.S.Introductory methods of Numerical Analusis, Ptentice Hall of
India,1995.

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSDBT 503: BASICS OF BIO-INFORMATICS


L T P CREDITS
3 1 0
4
UNIT I

15

Overview of bioinformatics: The scope of bioinformatics; Bioinformatics & the


internet; useful bioinformatics sites on the WWW.Data acquisition: sequencing
DNA, RNA & proteins; Determination of protein structure; gene & protein
expression data; Protein interaction data. Databases contents, structures &
annotation: file formats; Annotated sequence databases; miscellaneous databases.
Retrieval of biological data: data retrieval with Entrez &DBGET / Link DB; data
retrieval with SRS (sequence retrieval system).

UNIT II

15

Searching sequence databases by sequence similarity criteria:Sequence similarity


searches; amino acid substitution matrices;Databases searches, FASTA & BLAST;
sequence filters;Iterative databases searches & PSI BLAST.Multiple sequence
databases alignment, gene & protein families:Multiple sequence alignment & family
relationships; protein Families & pattern databases; protein domain
families.Phylogenetics: Phylogenetics, cladistics & ontology; building Phylogenetic
trees; evolution of macromolecular sequence.

UNIT III

15

Sequence annotation: principles of genome annotation; Annotation tools & resources.


Structural bioinformatics: conceptual models of protein structure; the relationship of
protein three-dimensional structure to protein function ; the evaluation of protein
structure & function; obtaining viewing & analyzing structural data; structural
alignment; classification of proteins of known three-dimensional structure : CATH &
SCOP; introduction to protein structure prediction ; advanced protein structure
prediction & prediction strategies.

UNIT IV

15

Microarray data analysis: microarray data , analysis methods ;Microarray data, tools
& resources ; sequence sampling & SAGE.Bioinformatics in pharmaceutical industry:
informatics & drug Discovery ; pharmainformatics resources .Basic principles of
computing in bioinformatics : running Computer software ; computer operating
systems; software Downloading & installation; database management .

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

Text Books:
D.R. Westhead, J.H .Parish & R.M . Twyman , Bioinformatics, Viva Books
Private Limited, New Delhi, 2003.
Cynthia Gibas , Per Jambeck , OReilly , Developing Bioinformatics Computer
Skills 1st Edition April 2001

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSDCS504 THEORY OF COMPUTATION


L T P
3 1 0
UNIT I

CREDITS
4
15

Regular Languages: Finite State systems Basic Definitions Finite Automation


DFA & NFA Finite Automaton with -moves Regular Expression Equivalence
of NFA and DFA Equivalence of NFAs with and without -moves Equivalence
of finite Automaton and regular expressions Pumping Lemma for Regular sets
Problems based on Pumping Lemma.
UNIT II

15

Context Free Languages: Context Free Grammars Derivations and Languages


Relationship between derivation and derivation trees ambiguity simplification of
CFU Greibach Normal form Chomsky normal forms Problems related to CNF
and GNF.
UNIT III

15

Pushdown Automata:
Definitions Moves Instantaneous descriptions
Deterministic pushdown automata Pushdown automata and CFL - pumping lemma
for CFL - Applications of pumping Lemma.
UNIT IV

15

Turing Machines: Turing machines Computable Languages and functions Turing


Machine constructions Storage in finite control multiple tracks checking of
symbols subroutines two way infinite tape.

TEXT BOOK
J.E.Hopcroft and J.D.Ullman, Introduction to Automata Theory, Languages and
Computation, Narosa Publishers, 2002
REFERENCES
1.
2.

Michael Sipser, Introduction to the Theory of Computation, Brooks/Cole


Thomson Learning, 1997.
J.C.Mortin, Introduction to Languages and Theory of Computation,
McGraw Hill, 2002.

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSDMA505 PROBABILITY & QUEUING THEORY


L T P
3 1 0

CREDITS
4

UNIT I

15

Probability: Probability Axioms conditional probability independence of


events BAYES rule random variable discrete - continuous
distribution
expectation definition properties moments
UNIT II

15

Stochastic process: processes classification poisson process markov process renewal model of program behavior
UNIT III

15

Makov Chains: Discrete and continuous parameters markov chains nth step
Transition
Probability state classification limiting distribution

M/G/1/QUEUEING systems discrete and continuous parameters birth and death


of process analysis of program execution time.
UNIT IV
Network queues: Open queuing networks closed queuing networks non
exponential substitution distribution multiple job types Non Product form
networks
Text Books:
1. Kishore S Trivedi, Probability and Statistics with Reliability, Queuing, and
Computer Science Applications, (PHI), 1994
2. Medhi, J.P., Stochastic Processes, John Wiley & Sons Inc., 1994.

15

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

BCSDCS506 MICROCONTROLLER & APPLICATIONS


L T P CREDITS
3 1 0
4
Unit I: Introduction
Introduction to Microcontrollers types of MC Embedded External memory
Processor architecture MC memory types MC features 8051 and suppliers
8051 architecture CPU addressing modes External addressing Interrupts and
Instruction execution instruction sets of 8051 data movement arithmetic bit
operators
(15 periods, Chaps. 1 3, TB 1)
Unit II: 8051 Features
Hardware features 8051 Enhanced features - architecture enhancement Control
store and External memory scratch pad RAM enhancement timers serial I/O
parallel I/O analog I/O Application design power I/P Reset System
oscillators / clocks I/O pin interfacing interrupts External RAM and ROM
(15 periods, Chaps. 4 6, TB 1)
Unit III: 8051 Programming
8051 Programming Dallas Semiconductors DS87000 Programmer Atmel
AT89Cx051 Programming PROG35 AT89Cx051 Programmer circuit Dallas
Semiconductor encrypted data Microcontroller programming software
development tools / enviroments Assembly Language 8051 Assembly Language
Programming styles Interpreters High level languages Intel Hex format Object
files 8051 programming examples
(15 periods, Chaps. 7 9, TB 1)
Unit IV: 8051 Applications
Keyboards displays pulse measurements D/A, A/D conversions multiple
interrupts serial data communications network configurations 8051 data
communication models Example programs RS 232C interface PWM motor
control aircraft controls light sensors for robots
(15 periods, Chaps. 10 & 11, TB 2, Chap. 12, TB 1)
Text books:
1. Myke Predko, Programming and Customizing the 8051 Microcontroller, TMH
1999
2. Kenneth J. Ayala, The 8051 Microcontroller Architecture, Programming and
Applications, 2 Ed, Thomson Delmar Learning 2004

SOC /SASTRA
B.Tech., (CSE) SYLLABUS

References:
1. Mohamed Ali Mazdi, Janice Gillispie Mazdi, Rolin D. McKinlay, The 8051
Microcontroller and Embedded systems using Assembly & C, 2 Ed, Pearson
Education 2006
2. David Calcutt, Fred Cowan, Hassan Parchizadeh, 8051 Microcontroller an
application based introduction, Elsevier 2006
3. Dr. Rajiv Kapadia, 8051 Microcontroller and Embedded Systems, Jaico
Publishing Press 2004