System Development Methodology

snottysurfsideΔιακομιστές

9 Δεκ 2013 (πριν από 3 χρόνια και 7 μήνες)

137 εμφανίσεις


1

TY B.Tech Computer Science and Engineering (Revised Syllabus)


System Development Methodology


P
eriods

Evaluation Scheme

C
redit

Sessional Exam

L

T

P

Total

TA

CT

ESE

PR

Total

4

--

2

6


25

20


80

--

1
25

5


Objective
:



A
t

the end of th
e course students should understand the overall
software
development methods
,

quality management of software

and will know
details of
an

object oriented software
engineering, testing

methods of software.

They will be aware of
the way in which

software
reen
gineering is performed
.

A :
THEORY

Unit

Contents

Duration

Nature

1


Evolution of Software:

Software Crisis, myths process
,

software engineering layered Technology, software
process model, linear sequential model, prototype
model, RAD

model, evolutionary

s
oftware process
model, formal

method
model, fo
u
rth

generation
techniques, process

technology,
and product

& process
technology.

04
Hours

T
heoretical

2

Managing Software
Project

:

The

management
Spectrums,

people,

the
problem, the

process, the

project,
sof
tware process and project
metrics, metrics

in process
and project
domain, software

measurements, metrics

for
software
quality, software

project planning,

project
planning objectives

software scopes,

resources,

software
project
estimation, decomposition

tec
hniques, empirical
estimation model,

risk

management, reactive

vs.

proactive

risk
strategies, software

risk, risk

identi
fication and
projection,

risk
mitigation, monitoring

and management,

the

RMMM

plan, project

scheduling
and
tracking, basic

concepts, the

relationships between
people and
efforts.
Defining

task set for software
project, scheduling

the project plan.

14
Hours

Theoretical


3


Quality, Configuration management,

technical
metrics and formal methods

:

quality
concepts, quality

movement, software

quality
assurance, software

review,
formal

technical review, statistical quality
assurance,
software

reliability,

the

SQA plan,ISO9000 Quality
standard, the

SCM
process,
SCM

standard, technical

metrics for software ,software
quality, metrics

for
design, m
etrics for source code, metrics for testing,
metrics for
maintenance, formal

methods, basic

concepts, mathematical

preliminaries,

formal

specification language.

14
Hours

Theoretical



2


4


Object Oriented software engineering:
-

concepts,
identifying

the el
ements of an object

m o d e l,
m a n a g e m e n t

o f o b j e c t o r i e n t e d
s o f t w a r e, p r o j e c t
,

o b j e c t
o r i e n t e d
a n a l y s i s, g e n e r i c

c o m p o n e n t s o f O O a n a l y s i s
m o d e l,

O O A p r o c e s s,

o b j e c t r e l a t i o n s h i p
m o d e l, t h e

o b j e c t b e h a v i o r
m o d e l, o b j e c t

o r i e n t e d

d e s i g n, t h e

g e n e r i c c o m p o n e
n t o f t h e O O d e s i g n
m o d e l, s y s t e m

d e s i g n
p r o c e s s, d e s i g n

p a t t e r n s, o b j e c t

o r i e n t e d
p r o g r a m m i n g, o b j e c t

o r i e n t e d t e s t i n g, t e s t i n g O O A a n d
O O D m o d e l s,

O O t e s t i n g
s t r a t e g i e s, t e s t

c a s e d e s i g n f o r
O O s o f t w a r e
, i
n t e r c l a s s t e s t c a s e d e s i g n e d
s y s t e m,

t h e
i n t e n t

o f o b j e c t o r i e n t e d
m e t r i c s,
c l a s s o r i e n t e d m e t r i c s
,
operation

oriented
metrics, metrics of object oriented
testing, metrics for object oriented project.






14

Hours



Theoretical


5


Reuse,

Reengineering, Client
/Server software
engineering and case to
ols:

Domain
Engineering,
component

based
development, Classifying

and
retrieving
component, reengineering
, business

process
engineering, software

engineering, reverse

engineering,
restructuring
,

forward

engineering,

the structure of
client server
system, d
esign

for c
lient server

system,
testing

issues
,

Computer

aided software engineering
,
what is
case, building

block for
case, the

integrated case
environment, the

case repository.


14
Hours

Theoretical


SECTION :A Chap
1,2,3

SECTION :B Chap
4,
5


B : Pract
icals


Unified M
odeling Language (UML):

Basic Notations, Class Diagram, State Diagram activity
diagrams, Use
-
case diagrams, sequence diagrams.


Term work:
-

The term

work shall consist of at least
One

detailed case study based on the above

syllabus
.


Stude
nt should work in a group(minimum 2 to maximum 4 students per group)to develop any
one case study using software Engineering Principles to develop the project and should submit
necessary documents such as SRS ,Design details, User interface, neatly documen
ted code,
testing methods etc.


Staff In
-
charge should

frame assignments based on the above mentioned topics and ensure
unique distribution of the same.



The assessment on the term work shall be done on the following criteria:

1.

Continuous assessment.

2.

Actua
l performance in the work.

3.

Oral examination (conducted internally) on the syllabus and the term work mentioned

above.


3

Suggestive List of case studies:

1.Insurance Management System

2. Traffic Management and Analysis system.

3
. Lib
rary Management system.

4.Railway Reservation System

5. Blood Bank Management System.

6. Online Examination System.

7. Hospital management System.

8.Pathology Lab Management System

9. Time
-
Table Management System.

10. Hostel management System.

C. Suggested Text Books and Refere
nces

Sr. No.

Title

Author

Publication

Edition

1

Software

E
ngineering,

A practitioners approach

Roger S.
Pressman

Mc
-
Graw

H
ill
Publication

Fourth
Edition

2

Software Engineering


Ian
Sommerville

Addison Wesley
Publication 1996

Fifth
Edition

3

Fundamenta
l of
Software
Engineering


Carlo Ghezz
i

Prentice Hall India
1991


4

Integrated Approach to
software engineering

Pankaj Jalote

Naro
sha publishing
house 1997

Second
edition

5

Software Engineering


M.L.
S
hooman

Mc
-
Graw

H
ill
Publication



6

Software Enginee
ring,

A practitioners approach

Roger S.
Pressman

Mc
-
Graw Hill
Publication

2004

Sixth

Edition


D.
Digital
R
eferences

Sr. No.

Website / Links / e
-
journals

1

http:/www.sei.cmu.edu/cmmi/.

2

www.developer.com

3

www.entract.com














4

Pattern of Ques
tion Paper

Faculty of Engineering and Technology

Third year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_





System Development Methodology

Time: 3 Hrs








Max Marks: 80


‘Please check whether you hav
e got the right question paper’

N.B:
-


i.

All the questions are compulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1

16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.2
OR

Question No.2

12 Marks

Question No.3
OR
Question No.3

12 Marks


Note:

1.

The topic may be
intermingled in the questions

2.

The questions will be memory based, application based and understanding type



Section B

Question No. 4 16 Marks











Th
is Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.5
OR

Question No.5

12 Marks

Question No.6
OR
Question No.6

12 Marks


Note:

3.

The topic may be intermingled in the questions

4.

The questions

will be memory based, application based and understanding type









5

TY B.Tech Computer Science and Engineering (Revised Syllabus)

Operating System


Periods

Evaluation Scheme

Credits

Sessional Exam

L

T

P

Total

TA

CT

ESE

PR

Total

4

--

2

6

25


20


80

--

125

5


Objective:

To understand the major functions like memory management, process management, device
management and file system management of operati
ng

system
.


A : THEORY

Unit

Contents

Duration

Nature

1

Introduction

What is an operating system?

OS as extended Machine

OS as a resource manager, History of operating system,
Simple

Batch

system, Time
-
Sharing system, Real
-
Time
systems, parallel systems, Distributed systems

6

Hours

Theoretical

2

Process Management

The process model, Process states,

Process control
block, Interprocess communication (IPC)
-

Race
conditions, Critical Sections , Mutual exclusion with
busy waiting, sleep & wakeup, Semaphores, Event
counters, Monitors, Message passing, Classical IPC
problems: Dining philosophers problem, R
eaders &
writers problem. Process scheduling

Algorithms
: Round
Robin Scheduling, Priority scheduling, Multiple queues,
shortest job first, Policy driven scheduling, Two level
scheduling.

12

Hours

Theoretical
/Practical

3

Input
-

Output Management


Princi
ples of I/O Hardware:

I/O Devices, Device
Controllers,

Principles of I/O software: Goals of I/O
software, Interrupt Handler, Device drivers, Device
Independent I/O Software, User Space I/O software, .
Deadlocks: Resources, Deadlock modeling, The ostrich
al
gorithm, Deadlock detection & recovery, Deadlock
prevention, Deadlock avoidance. RAM Disks: RAM
disks hardware & software, overview of RAM disk
driver. Disks: Disk Hardware, Disk Software, Disk
arm
scheduling algorithms. Terminals: Terminal hardware &
soft
ware, Clocks

12

Hours

Theoretical
/Practical

4

Memory Management

Memory management without swapping or paging, Use
of multiprogramming, Swapping: Multiprogramming
with variable partition, Memory manag
ement with
bitmaps, Linked lists, buddy system, Allocation of s
w
ap
space. Virtual Memory: Paging, Page replacement
algorithms: Optimal page replacement, Not recently
used page replacement, first
-
in first
-
out, least recently
10

Hours

Theoretical

/Practical


6

used random page replacement.

Se
gmentation
,
Design
issues for paging systems: Working set model, p
age
size, Implementation issues

5

File System

The user view of the file system: File basics, directories.
File system design: Disk space management, file
s
torage, Directories structures, Shared files, File system
reliability & performance. File Servers: Interface level,
Atomic updates, Concurrency control
,

transactions,
Replicated files. Security: Security environment Famous
security flaws, Generic security
attacks, User
authentication, Design principles of security. Protection
Mechanism: Protection domains, Access control lists,
capabilities, Protection model

10

Hours

Theoretical

6

Case Studies:

1. Netware: Introduction, History, Arc
hitecture,
Features. 2. Windows NT: Introduction, MS
-
Windows,
& Windows NT, History, Architecture, Features.

10

Hours

Theoretical

SECTION :A Chap 1,2,3

SECTION :B Chap 4,5,6


B : Practical
s



Minimum 08
experiments

should be conducted based on
the
abo
ve
mentioned
syllabus.

The
assessment o
f

the
term work

shall be done on the following criteria:

1.

Continuous assessment.

2.

Performing the
e
xperiment in the Lab.

3.

Oral examination (conducted internally) on the syllabus and the term work mentioned
above.

C. Sugg
ested Text Books and References

Sr. No.

Tiltle

Author

Publication


1

Operating Systems: Design &
Implementation

Andrew S. Tanenbaum

PHI


2

Operating System Concepts

Abrahm Silberschaz,
Peter Galvin

Addison Wesley


3

Operating System

Achyut Godbole

TMH


4

Operating System: Concepts
& Design


Milan Milenkovic

THM


5

Operating System

William Stallings

PHI



D. Digital
R
eferences

Sr. No.

Website / Links / e
-
journals

1

http://www.personal.kent.edu/~rmuhamma/OpSystems/os.html

2

http://williamstallings.com/Extras/OS
-
Notes/h8.html

3

http://pages.cs.wisc.edu/~bart/537/lecturenotes/titlepage.html

4

http://lass
.cs.umass.edu/~shenoy/courses/fall00/lectures.html



7

Pattern of Question Paper

Faculty of Engineering and Technology

Third year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_





Operating
System

Time: 3 H
rs








Max Marks: 80


‘Please check whether you have got the right question paper’

N.B:
-


i.

All the questions are compulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1

16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.2
OR

Question No.2

12 Marks

Question No.
3
OR
Question No.3

12 Marks


Note:

1.

The topic may be intermingled in the questions

2.

The questions will be memory based, application based and understanding type



Section B

Question No. 4

16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.5
OR

Question No.5

12 Marks

Question No.6
OR
Question No.6

12 Marks


Note:

3.

The to
pic may be intermingled in the questions

4.

The questions will be memory based, application based and understanding type










8


TY B.Tech Computer Science and Engineering (Revised Syllabus)

Computer Algorithms


Periods

Evaluation Scheme

Credit

Sessional E
xam

L

T

P

Total

TA

CT

ESE

PR

Total

4

--

2

6

25


20


80

25

150

5


Objective:

1. To learn

the

concept of Algorithm

2. To
learn
the

concept of efficiency and performance of algorithm

3. To
learn
the

different criteria to determine best solution for a gi
ven problem

4. To
learn
the
various techniques of writing algorithm

5. To apply these concepts to various areas

of computer science


A : THEORY

Unit

Contents

Duration

Nature

1

Introduction:


What is algorithm? Writing algorithm in sparks,
Writing structured
programs, Analyzing algorithms,
space

and time complexities
.

6

Hours

Theoretical


2

A brief review of ele
mentary data structures:


Stacks, Queues, Trees, Heaps and heap sort ,Sets and
disjoint sets union, graphs, hashing

6

Hours

Theoretical


/Practical

3

Divide and conquer method :

General method, Binary search, Finding maximum and
minimum, Me
rge
sort, Qui
ck

sort, Selection
,

Insertion
sort,
Stre
s
son’s
Matrix multiplication
.

8

Hours

Theoretical


/Practical

4

The greedy Method :


General method, Optimal storage on tape, Knapsack
problem ,Job sequencing with deadlines, Optimal merge
patterns, minimum spannin
g tree, Single source shortest
path,

8

Hours

Theoretical


/Practical

5

Dynamic programming :


General method, Multistage graph, All pair shortest
path, Optimal binary search tree, 0/1 knapsack,
reliability design, traveling sales person problem, flow
sho
p scheduling

8

Hours

Theoretical


/Practical

6

Basic search and traveling techniques:

The technique, Code optimization, and /or graphs, Game
trees, Bi
-
connected components and DFS

6

Hours

Theoretical


/Practical

7

Backtracking
:


General met
hod , 8 queen problem, sum of subsets,
graph coloring, Hamiltonian cycle, knapsack problem

8

Hours

Theoretical


/Practical

8

Class
-
p, Class
-

NP problems:

Introductions and definition, Examples related to it.

10

Hours

Theoretical


/Practical

SECTION
:A Chap 1,2,3,4

SECTION :B Chap 5,6,7,8


9


B : Practical
s



Minimum 10
experiments

should be conducted based on

the
above
mentioned
syllabus. The

assessment on the
term work

shall be done on the following criteria:

1.

Continuous assessment.

2.

Performing the
e
x
periment in the Lab.

3.

Oral examination (conducted internally) on the syllabus and the term work mentioned
above.

The assessment of practical examination shall be on the following criteria


The practical examination shall consist of performing an experim
ent based on practical
work
done

during the course,

the record of experiment submitted by candidate and viva voce based
on syllabus.


C. Suggested Text Books and References


Sr. No.

Title

Author

Publication


1

Fundamental
s

of Computer
algorithm

Horwtz S
ahani

Galgotia Publication


2

The Design and analysis of
Computer Algorithm

Aho,Hopcroft
Ul
l
man

Addison Wes
ley



D. Digital
R
eferences

Sr. No.

Website / Links / e
-
journals

1

http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html

2

http://www
.imsc.res.in/~vraman/pub/intro_notes.pdf

3

http://20bits.com/articles/introduction
-
to
-
dynamic
-
programming/

























10

Pattern of Question Paper

Faculty of Engine
ering and Technology

Third year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_





Computer Algorithms

Time: 3 Hrs








Max Marks: 80


‘Please check whether you have got the right question paper’

N.B:
-


i.

All the questions are compulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1 16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.2
OR

Question No.2

12 Marks

Question No.3
OR
Question No.3

12 Marks


Note:

1.

The topic may be intermingled in the questions

2.

The quest
ions will be memory based, application based and understanding type



Section B

Question No. 4 16 Marks











This Question will consist of questions f
rom the entire chapter under section A mentioned in the
syllabus.


Question No.5
OR

Question No.5

12 Marks

Question No.6
OR
Question No.6

12 Marks


Note:

3.

The topic may be intermingled in the questions

4.

The questions will be memory based, application base
d and understanding type










11

TY B.Tech Computer Science and Engineering (Revised Syllabus)

T
heory

of

C
omputation




Periods

Evaluation Scheme

Credit

Sessional Exam

L

T

P

Total

TA

CT

ESE

PR

Total

4

-
-

--

4

-
-

20


80

-
-

100

4


Objective:



To
understand

the

various languages

and their grammars.

To make the students
know the various machines accepting those languages
.

A : THEORY

Unit

Contents

Duration

Nature

1


Finite Automata and Regular Expressions


Definition of Determini
stic Finite Automata, Non
Deterministic Finite Automata, Moore and Mealy
Machines and their conversions, acceptability of a string,
Equivalence of DFA and NFA ,Minimization of FA.

08
Hours

Theoretical
/
Logical

2


Regular Expressions,

Recursive definition,

Finite automata and Regular
expressions, Pumping lemma for regular set, closure
properties of regular sets, regular sets and regular
grammars.

08
Hours

Theoretical
/
Logical

3


Context Free Grammars

Definition, production rules, ambiguous grammar, removal
of ambiguity, Chomsky hierarchy, Context Free Grammar
(CFG)


definition, simplification of CFG,

Normal forms
for CFG.

06
Hours

Theoretical
/
Logical


4

Context Free Languages

Definition of Context free Languages, Derivation trees,

Languages and automata,

Operations on languages

.Pumping lemma for Context free languages,

Decision
algorithm for context free language.


08
Hours

Theoretical
/
Logical

5

Pushdown automata

Formal definition, Pushdown automata (PDA),
deterministic pushdown automata (DPDA)


definit
ion,
non
-
deterministic pushdown automata (NPDA)
-
definition
,Acceptance by PDA,PDA and CFL,

Parsing and
pushdown automata.


06
Hours

Theoretical
/
Logical

6


LR(k)Grammars

LR(k)Grammars,

Properties of LR(k) grammars ,Closure
properties of languages

04
Ho
urs

Theoretical
/
Logical



12

7

Turing Machines

The definition of a Turing machine, Computing with
Turing machine, representations of Turing machines,
language acceptability by Turing machines, Design of
Turing machines, The Church’s Turing Hypothesis,
Uni
versal Turing Machines, The Halting problem,
Unsolvable problems about Turing machines. The
technique for TM construction .Variants of Turing
machine.

The model of Linear bounded automata.

10
Hours

Theoretical
/
Logical

8

Decidability and Recursively Enum
erable Languages

The definition of an algorithm,

Decidability

,Decidable
languages, Undecidable languages ,The Post
correspondence problem

06

Hours
.

Theoretical
/
Logical

9

Applications

Applications of RE and FA
-

Lexical analyzer, text editor,
and sear
ching using RE.

Applications of PDA
-

Expression conversion.

Applications of CFG


syntax analysis, language
definition.

04
Hours

Logical

SECTION :A Chap 1,2,3,4

SECTION :B Chap 5,6,7,8
,9

B : Practical
s



NOT APPLICABLE




C. Sugg
ested Text Books and References


Sr.
No.

Title

Author

Publication

Edition

1

Theory of computer Science

KLP.Mishra

PHI Publication

III rd
edition

2


Introduction to Automata
Theory, Languages, and
Computation,

Hopcroft, Ullman,

Addison Wesley Pub.

--

4

Introduction to Languages and
Theory of Computation,

John C. Martin


M
cG
raw Hill.

--



D. Digital
R
eferences


Sr. No.

Website / Links / e
-
journals

1

www.jn.inf.ethz.ch/education/index.html
-

5k

2

www.cs.purdue.edu/homes/gopal/cs584
-
2007/
notes
.pdf

3

www.jn.inf.ethz.ch/education/index.html

4

www.freetechbooks.com/
theory
-
of
-
computation
-
f50.html

5

meru.cecs.missouri.edu/courses/cecs341/tc.html


ww.cse.iitb.ac.in/~supratik/courses/cs331/index.html
-

22k
-







13

Pattern of Question Paper

Faculty of Engineering and Technology

Third year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_





Theory of Computation

Time: 3 Hrs








Max Marks: 80


‘Please c
heck whether you have got the right question paper’

N.B:
-


i.

All the questions are compulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1

16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.2
OR

Question No.2

12 Marks

Question No.3
OR
Question No.3

12 Marks


Note
:

1.

The topic may be intermingled in the questions

2.

The questions will be memory based, application based and understanding type



Section B

Question No. 4 16

Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.5
OR

Question No.5

12 Marks

Question No.6
OR
Question No.6

12 Marks


Note:

3.

The topic may be intermingled in the que
stions

4.

The questions will be memory based, application based and understanding type










14

TY B.Tech Computer Science and Engineering (Revised Syllabus)

Java programming


Periods

Evaluation Scheme

credit

Sessional Exam

L

T

P

Total

TA

CT

ESE


PR

Tota
l

4

--

2

6

25


20


80

25


150

5


Objective:
To develop the programming skills in java language.

A: THEORY

Unit

Contents

Duration

Nature

1

Introduction
-
Features of Java, Differences between Java
and C, Differences between Java and C++, Java class
libra
ry, Developing a sample java program.

3 Hours

Theoretical/
Practical

2

Data types and Tokens



B慳i猠 d
at愠 ty灥pⰠ 䱩L敲al猠 Ⱐ
Varia扬e猬⁏灥r慴潲s‬偲潧r慭mi湧⁣潮 tr畣ts

㔠5潵os

T桥潲eti捡l/
偲Pctic慬

3

Arrays
-

Declaring array variables, creating array ob
jects,
accessing array elements multi
-
dimensional arrays,
vectors.

Strings

-

String methods and String Buffer methods.

3 Hours

Theoretical/
Practical

4

Classes
-
Definition
-
Fields
-
Methods
-
Object
creation
-
Constructors
-

Finalize method
-

Overloading methods
-
Static members
-
This keyword
-
Nested classes
-
Extending
classes
-
Inheritance
-
memberaccessibility
-
Overriding
methods
-
Abstract classes

10 Hours

Theoretical/
Practical

5

Packages
-

Defining a package, understanding class path,
A short package example, Importing p
ackages, Interfaces
-
Defining an interface, implementing interface, interface
variables

5 Hours

Theoretical/
Practical

6

Exception handling
-
Exception handling fundamentals,
Exception
-
types, throw, throws, finally, java's built
-
in
exceptions, creation of u
ser
-
defined exceptions.

5

Hours

Theoretical/
Practical

7

Multithreading

-
Definition of a Thread, States of a
Thread, Common Thread methods creation of a Thread,
Creation of multiple threads ,Thread priorities,
Synchronization

5

Hours

Theoretical/

Practical

8

Files and I/O streams
-
File operations, Methods in
streams, Types of I/O streams
-

FileInputStream,
FileOutputStream, Buffering and Concatenation , Random
access files, Reader and writer classes, Stream Tokenizer

5 Hours

Theoretical/
Practica
l

9

Applets
-
Definition, Differences between applets and
applications, steps to create an applet, passing parameters
to an applet , Applet methods.

Graphics
-
Graphics class, Graphics contexts and Graphics
objects, Drawing Lines, Rectangles, ovals. Font and

Color
class, Creating images.


7 Hours



Theoretical/
Practical




15

10

Events

-

Event delegation model, Handling an event,
Types of even
t

handling, Mouse events, Keyboard events.
User Interface Components
-
container class, component
class
-
Text
Component,

La
bel,

Button, Check box , List .
Layout Managers
-
Flow Layout, Grid Layout, Frames and
Menus.

8 Hours

Theoretical/
Practical

11

Introduction to JDBC
-

Java and JDBC, JDBC vs.
ODBC, JDBC Driver models, The java.
SQL

package,
Steps for using JDBC.

4 Hours

Theor
etical/
Practical

SECTION :A Chap 1,2,3,4,5
,
6

SECTION :B Chap 7,8,9,10
,11


B :
Practica
ls

Minimum 8 experiment
s

should be conducted base
d

on
the
above mention
ed

syllabus

The assessment o
f

the term work shall be done on the following criteria:

1.

Continuous

assessment.

2.

Performing the
e
xperiment in the Lab.

3.

Oral examination (conducted internally) on the syllabus and the term work mentioned
above

The assessment of practical examination shall be on the following criteria
:


The practical examinatio
n shall consist of performing an experiment based on the
practical work done during the course, the record of the experiments submitted by the candidate
and viva
-
voce based on the syllabus.


C. Suggested Text Books and References

Sr. No.

Title

Author

Pu
blication

Edition

1

Complete Reference Java 2

Herbert Schildt

Tata McGraw
Hill

Fifth

2

How to program JAVA

H.M.Deitel and
P.E.Deitel

Prentice Hall


3

Programming with Java
-

A
Primer

E. Balagurusamy

Tata McGraw
Hill

Third

4

The Java programming
language

Ken Arnold and
James Gosling

Addison Wesley



D. Digital R
eferences

Sr. No.

Website / Links / e
-
journals

1

www.java.sun.com/docs/books/tutorial

2

http://math.hws.edu/javanotes/










16

Pattern of Question Paper

Faculty of Engineering and Technology

T
hird year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_





Java Programming

Time: 3 Hrs








Max Marks: 80


‘Please check whether you have got the right question paper’

N.B:
-


i.

All the questions are com
pulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1 16 Marks











This Question will cons
ist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.2
OR

Question No.2

12 Marks

Question No.3
OR
Question No.3

12 Marks


Note:

1.

The topic may be intermingled in the questions

2.

The questions will be memory based
, application based and understanding type



Section B

Question No. 4 16 Marks











This Question will consist of questions from the entire chapter un
der section A mentioned in the
syllabus.


Question No.5
OR

Question No.5

12 Marks

Question No.6
OR
Question No.6

12 Marks


Note:

3.

The topic may be intermingled in the questions

4.

The questions will be memory based, application based and understanding type








17

TY B.Tech Computer Science and Engineering (Revised Syllabus)

Programming in VB.Net


Periods

Evaluation Scheme

Credit

Sessional Exam

L

T

P

Total

TA

CT

ESE

PR

Total

2

---

2

4

25


10


40

25

100

3







A : Theory


Unit

Contents

Duration

Nature

1

Introduction to VB.NET:

The .NET Framework and Common Language Runtime

01
Hours


Theoretical


2

VB.NET Development Environment
:

The Visual Basic .NET IDE: The Menu, The Toolbars,
Toolbox, Code Editors, Forms.

Windows in Visual Studio IDE: Properties W
indow,
Solution Explorer, Class View, Server Explorer, Code
Window, Dynamic Help Window, Component Trays,
Command Windows.

02
Hours

Theoretical

3

Language Features of VB.NET:

Object Oriented Concepts, Classes & Objects, Creating
Methods, Overloading Meth
ods, Overriding Methods,
Namespace, Collections, Multithreading, Constructors,
Inheritance


04
Hours

Theoretical
/

Logical


4


Writing Software:

Variables, Comments, Data Types, Strings, Handling
Time & Dates, Boolean, Arrays



02
Hours


Theoreti
cal
/Logical

5

Controlling The Flow:

The If, Else, If


Else Statement, Comparison Operators,
AND/OR Operators, String Comparison, Select CASE,

Loops:

For
---
Next Loop, For each
---
Next Loop, Do Loop, Do
--
-
Until Loop, Do
---
While Loop, Nested Loop, While
Loo
p


03
Hours

Logical


Objective
:
To

cover Visual Basic.NET tips, examples, and how
-
tos on everything from
programming to managing the development of Visual Basic applications, a
nd provides in
-
depth
material on the new object
-
oriented features of Visual Basic .NET.



18

6

Windows Forms
:

All about Windows MDI Forms, Text Boxes, Rich Text
Boxes, Buttons, Check Boxes, Radio Buttons, List
Boxes, Combo Boxes, Picture Boxes, Check List Boxes,
Timers, Scroll Bars, Menus.

06
Hours


Theoretical
/Logical





7


Data Access With ADO.NET:

What are data bases, Accessing Data with Server
Explorer, Data adapters & Data Sets, Creating New
Data Connection, Selecting a Data Provider Using
SQL

Server, Adding Multiple Table to Dataset


06
Hours



Theoretical



8

B
inding Controls to Data Bases:

Binding Text Boxes, Buttons, Check Boxes, Radio
Buttons, Combo Boxes, List Boxes, Checked List
Boxes, Data Grids

06
Hours



Theoretical






SECTION A : Chapter 3,4,5,6



SECTION B : Chapter 1,2,7,8



B :
Practicals

Minim
um
10

experiment
s

should be conducted base
d

on
the
above mention
ed

syllabus

The assessment of

the term work shall be done on the following criteria:

1.

Continuous assessment.

2.

Performing the
e
xperiment in the Lab.

3.

Oral examination (conducted internally) on the

syllabus and the term work mentioned
above

The assessment of practical examination shall be on the following criteria
:


The practical examination shall consist of performing an experiment based on the
practical work done during the course, t
he record of the experiments submitted by the candidate
and viva
-
voce based on the syllabus.


S
r
.

No
.

Name of Experiments

1

Introduction & Installation of VB.NET

2

VB.NET IDE Environment

3

Building Windows Application

4

Displaying Dialog Boxes & Mess
age Boxes

5

Creating Menus

6

Creating Your own Custom Controls

7

Accessing Data Bases Using Microsoft Access

8

Data Accessing Using ADO & OLEDB

9

Data Binding


10


Creating Windows Application Using Date , Timer, Text Boxes, Buttons, Check
Boxe
s, Radio Buttons ,List Boxes, Combo Boxes, Picture Boxes, Check List
Boxes, Scrollbars





19

C. Suggested Text Books and References

Sr. No.

Title

Author

Publication

Edition

1

Visual Basic .NET Black
Book

Steven Holzner

Dreamtech
Press

New
Edition

2

Visual

Basic .NET The
Complete Reference

Jeffrey R. Shapiro

TMH

Second

3

Beginning VB.NET

Richard Blair, Jonathan
Crossland, Mathew
Reynolds, Thearon Willis

SPD


Second



D. Digital R
eferences

Sr. No.

Website / Links / e
-
journals

1

http//www.w3school.com

2

http//www.microsoft.com

3

http//www.technologia.com

4

http//www.makesofteducation.com

5

www.iranicdl.ir/files/Vb.NET
-
Syllabus.pdf

6

http://home.pec.edu/pg_syllabus/mca.pdf































20

Pattern of Question Paper

Faculty of Engineering a
nd Technology

Third year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_





Programming in VB.Net

Time:
2

Hrs








Max Marks: 40


‘Please check whether you have got the right question paper’

N.B:
-


i.

All t
he questions are compulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1

08

Marks











Thi
s Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.2
OR

Question No.2

06
Marks

Question No.3
OR
Question No.3

06

Marks


Note:

1.

The topic may be intermingled in the questions

2.

The questions

will be memory based, application based and understanding type



Section B

Question No. 4
08

Marks











This Question will consist of questions from
the entire chapter under section A mentioned in the
syllabus.


Question No.5
OR

Question No.5

06

Marks

Question No.6
OR
Question No.6

06

Marks


Note:

3.

The topic may be intermingled in the questions

4.

The questions will be memory based, application based a
nd understanding type










21

TY B.Tech Computer Science and Engineering (Revised Syllabus)

Development of Skills
-
V



Evaluation Scheme

Credit

Sessional Exam

L

T

P

Total

TA

CT

ESE

PR

Total

---

---

2

2

50


---


---

---

50

1


Objective:

i)

Understandi
ng the concept of
quality and applications of quality tools.


ii) Understanding the Entrepreneurship Skills.


iii) Understanding the Technical writing skills.


A: THEORY

Unit

Contents

Duration

Nature

1

Quality:

Definitions

of Quality, Quality control, Quality
Assurance, Dimensions of Quality circle details.


02
Hours

Descriptive

2

2.Problem Solving
T
echniques
:
(Old & New tools)

A.

Old
T
ools
:


i)Tally Sheet/Check Sheet


ii)Pareto Diagram


iii)Cause & Effect Diagram


iv)Graphs/Histogram/Run Chart


v)Stratification


vi)Scatter Diagram


vii)Control Chart

05
Hours

Descriptive


B) New Tools
:

i)Aff
inity Diagram

ii)Relation Diagram

iii) Tree Diagram

iv) Process Decision Program Chart

v) Arrow diagram

vi) Matrix Data Analysis Diagram

05
Hours

Descriptive


C) Helpful Techniques
:

i) Brainstorming

ii) Flow Chart

Definition purpose, procedure & examples
of all the
above said tools.

0
2
Hours

Descriptive

3

3) Entrepreneurship:

Definitions, need, significance, success stories of few
exceptional entrepreneurs.

06
Hours

Descriptive

4

4) Marketing Management:

Definitions of marketing, objectives, types of m
arkets,
marketing techniques.

06
Hours

Descriptive

5


Writing Skills:


Writing of Technical /Project reports, Writing Technical
Research papers


04
Hours

Descriptive

SECTION :A Chap
----

SECTION :B Chap
----



22


B : Practical / Drawing / Design / Workshop
: Practical

Term work shall consist of ten assignments as follows:

1) Three assignme
nts on any three old QC tools.

2) Three assignments on any three new QC tools.

3) One assignment each on Entrepreneurship, Marketing Management, Writing Skills &


Quality.



C. Suggested Text Books and References
:


Sr. No.

Tiltle

Author

Publication

Edition

1

Quality Planning and
Analysis


Juran



2

Handbook of Effective
Technical Communications

Tyler

G. Hicks,
Carl M.
Valorie,

Sr

McGraw Hill Book
Company


3

Technical Writing Process
and Product

Saron J. Gerson
/ M.

Gerson

Prentice Hall


4

Thesis and Assignment
Writing

Anderson,
Dustan, Poole

Wiley Eastern
Limited.































23

TY B.Tech Computer Science and Engineering (Revised Syllabus)

Computer Networks



Period

Evaluation Scheme

Credit


Sessional


Ex
am

L

T

P

Total

TA

CT

ESE

PR

Total

4

--

2

6

25


20


80

25

150

5


Objective:

1. To learn
the
concept of networking and its application
s.


2. To learn differ
e
nt models like TCP/IP,

OSI etc
.

3. To study various functions of OSI layers.


A : THEOR
Y

Unit

Contents

Duration

Nature

1

Introduction :

What is computer Network? Network hardware and
software,

TCP/IP & OSI model, Novell

Netware,
ARPANET. Network standardization:

Who's who in
telecom, International standards and

I
nternet.

8

Hours

Theoreti
cal
/
Logical

2

The Physical
L
ayer:

The theoretical basis for data communication,
Transmission media,

Telephone system:

Local loop,
trunks,
M
ultiplexing,

Circuit and
Pa
cket switching.
Cellular radio: Paging system, Analog and digital
C
ellular telephones,

P
ersonal communication services
.

8

Hours

Theoretical
/
Logical

3

The
D
ata
L
ink
L
ayer
:

Design issues, Error detection and
C
orrection,

Elementary data link protocol,

Sliding
W
indow
P
rotocol: HDLC and data link layer in the Internet
.

8

Hours

Theoretical

4


The Medium Access
S
ub
-

layer:

The Channel allocation problem,

Multiple access
protocol: ALOHA, CSMA
P
rotocol,

Collision free
protocols, IEEE standards like 802.2,

802.3
,

Bridges.


10

Hours

Theoretical
/
Logical

5

The Network Layer :

Design issues,

Routin
g algorithms, Optimality principle,
Shortest path routing, Flooding, Broadcast routing.
Congestion control algorithms: General principles,
Congestion prevention policies, Traffic shaping,
Conge
s
tion control in virtual circuit subnet, Choke
packets.

Interne
tworking in the internet N
\
W: The IP
protocol, IP subnet, Class
-
full addressing, Introduction
to session layer
.

10

Hours

Theoretical
/
Logical

6


The
T
ransport
L
ayer:

The transport service, The TCP and UDP protocol

8

Hours


Theoretical
/
Logical


24

7

The Ap
plication
L
ayer
:
Network security:

traditional cryptography, Two fundamental principles,
Secret key algorithm, DNS, Networ
k

management
protocol, E
-
mail, USENET, news, WWW, TELNET,
FTP, RPC.

Introduction

to THIN CLIENT technology.

8

Hours

Theoretical
/
Log
ical

SECTION :A Chap 1,2,3,4

SECTION :B Chap 5,6,7




B : Practica
ls

Minimum

8

Practicals related with OS installation, Networking, etc.
The assessment of

the term
work shall be done on the following criteria:

1.

Continuous assessment.

2.

Performing the
e
x
periment in the Lab.

3.

Oral examination (conducted internally) on the syllabus and the term work mentioned
above

The assessment of practical examination shall be on the following criteria:


The practical examination shall consist of performing
an experiment based on the
practical work done during the course, the record of the experiments submitted by the candidate
and viva
-
voce based on the syllabus.




C. Suggested Text Books and References

Sr. No.

Title

Author

Publication

1

Computer Network
s

Tanenbaum

PHI

2

Internet
-

Networking with
TCP/IP Volume
-
1

Douglas E. Comer

PHI

3

Data and Computer
C
ommunication

William Stallings

PHI

4

TCP/IP Protocol Suite

Forouzan

AW


D. Digital
R
eferences

Sr. No.

Website / Links / e
-
journals

1

http//www.w3sch
ool.com

2

http//www.wikipedia.com













25

Pattern of Question Paper

Faculty of Engineering and Technology

Third year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_





Computer Networks

Time: 3 Hrs








Max Marks: 80


‘Please check whether you have got the right question paper’

N.B:
-


i.

All the questions are compulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1

16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.2
OR

Question No.2

12 Marks

Question No.3
OR
Question No.3

12 Marks


Note:

1.

The topic may be intermingled in the questions

2.

The questions will be memory based, application based and understanding type



Section B

Question No. 4

16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.5
OR

Question No.5

12 Marks

Question No.6
OR
Question No.6

12 Marks


Note:

3.

The topic m
ay be intermingled in the questions

4.

The questions will be memory based, application based and understanding type









26

TY B.Tech Computer Science and Engineering (Revised Syllabus)

Relational
D
atabase Management System

Period

Evaluation Scheme

Credit

Se
ssional Exam

L

T

P

Total

TA

CT

ESE

PR

Total

4

--

2

6

25

20


80

25

150

5


Objective:


1.
To give students an in
-
depth understanding of the relational model.


2.
To establish fundamental skills with
SQL

and the operation of an RDBMS.


3.
To provide rea
l
-
world examples of data modeling, design and management.


A: THEORY

Unit

Contents

Duration

Nature

1

Introduction

:

Introduction to database & database users, Examples,
need of database system ,advantages of a database
system over file system, view of da
ta: 1) data
abstraction 2) Instance & schema 3) data models, Data
independences, database languages, history of database
system, database system architecture


8

Hours

Theoretical

2

E
-
R Model:


Overview of the design process Design phases, Design
alternat
ives. The E
-
R model
-

Entity Sets, Relationship
sets, attributes. Mapping cardinalities, keys. E
-
R
Diagram, E
-
R Design issues, weak & strong Entity sets,
E
-
R features, alternative E
-
R notations. examples


10

Hours

Theoretical

Practical


3

Database Design
:


Introduction to normalization

process, objectives of
normalization, functional dependence, design guidelines
for normalization,1st normal form,2nd normal form,
transitive dependences, 3 NF data anomalies in 3 NF
relations, Boyce
-
code normal form, 4NF, 5

NF,
Multivalued dependency & join dependency, relational
database design process.

Clocks.
examples


12

Hours

Theoretical

Practical


4

SQL

:

Introduction to
SQL
, characteristics & advantages of
SQL
, data

types,

literals, Basic structure of
SQL

queries:

select,
form, where
, group
by, having

,order by.
Joins
,
aggregate functions, sub queries,
distinct, null

values
SQL statements: DDL, DML, DCL
, grant, revoke.
Examples

12

Hours

Theoretical

Practical


5

Tra
nsactions:

Transaction concept
, transaction state, Implementation
of atomicity & durability, concurrent executions,
serializability, recoverability

12

Hours

Theoretical

Practi
cal



27

Concurrency control :

Lock based protocols, time
-
stamp based protocols,
validation based prot
ocols, multiple granularity,
deadlock handling.

Recovery system:


Failure system, storage structure, different crash
recovery methods: log based recovery, shadow paging
buffer management & remote backup system.



6

Advanced data base concept & Emerging
application:

Object oriented data model oodbms: concept &
meaning. Architecture of OODBMS, distributed
database concept, referential architecture of distributed
database system, database on word wide web.


6

H
ours

Theoretical


SECTION :A Chap 1,2,3



SECTION :B Chap 4,5,6



B : Practicals



Minimum 10 experiments should be conducted based on
the
above
mentioned
syllabus.

The
assessment o
f

the
term work

shall be done on the following criteria:

1.

Continuous as
sessment.

2.

Performing the
e
xperiment in the Lab.

3.

Oral examination (conducted internally) on the syllabus and the term work mentioned
above.

The assessment of practical examination shall be on the following criteria
:


The practical examination shall cons
ist of performing an experiment based on practical
work
done

during the course,

the record of experiment submitted by candidate and viva voce based on
syllabus.


C. Suggested Text Books and References

Sr. No.

Title

Author

Publication

Edition

1

Database
System concepts


Silberschatz,kort
h


McGraw
hill


Fifth


2

Fundamentals of database
system


Ehmasri &
Navathe


Addison


Third


3

Database Management
System


Ragu ramkrishana


McGraw
hill


second



D. Digital
R
eferences


Sr. No.

Website / Links / e
-
j
ournals

1

http://www.niit.edu.pk/~kamran/lectures/rdbms_oracle/
SQL
/lecture_1.pdf

2

http://en.wikipedia.org/wiki/Relational_database_management_system




28

Pattern of Question Paper

Faculty of Engineering and Technology

Third year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_

Rela
tional database Management System


Time: 3 Hrs








Max Marks: 80


‘Please check whether you have got the right question paper’

N.B:
-


i.

All the questions are compulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Sectio
n A

Question No. 1 16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question
No.2
OR

Question No.2

12 Marks

Question No.3
OR
Question No.3

12 Marks


Note:

1.

The topic may be intermingled in the questions

2.

The questions will be memory based, application based and understanding type



Section B

Question No. 4

16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in the
syllabus.


Question No.5
OR

Question No.5

12 Marks

Question No
.6
OR
Question No.6

12 Marks


Note:

3.

The topic may be intermingled in the questions

4.

The questions will be memory based, application based and understanding type








29

TY B.Tech Computer Science and Engineering (Revised Syllabus)

Elective
-
I

Compiler Const
ruction



Period

Evaluation Scheme

Credit

Sessional Exam

L

T

P

Total

TA

CT

ESE

PR

Total

4

--

2

6

25


20


80

--

125

5


Objective:


At the end of the course students should understand the overall structure of
a compiler, and wi
ll know significant details of a number of important techniques
commonly used. They will be aware of the way in which language features raise
challenges for compiler builders.

A : THEORY

Unit

Contents

Duration

Nature

1

Introduction to compilers
-

Transla
tor, Interpreter, Compiler, Phases of compiler, compiler
writing tools, bookkeeping.

02
Hours

Theoretical

2

Introduction to programming languages


-
High level programming languages, data elements, data
structures,

Data
Environment, storage

management, re
cursion

and displays.

03
Hours

Theoretical

3

Finite automata and lexical analysis

The role of lexical analyzer ,design of lexical analyzer,

Implementation of transition diagram ,
Regular

expressions
,
definition

of regular expressions ,

A LEX,

Implementati
on of
lexical analyzer .Implementing
look ahead

operator ,Finite
Automata
-
Non
deterministic

and
deterministic

,A l g o r i t h ms
f o r
C o n s t r u c t i o n

o f D F A f r o m N F A,

c o n s t r u c t i o n

o f N F A
f r o m r e g u l a r e x p r e s s i o n,

Mi n i mi z i n g D F A s t a t e s .

0 8

H o u r s

T h e o r e t i c a l
/L o g i c a l

4

B a s i c p a r s i n g t e c h n i q u e s
-

R e v i e w o f c o n t e x t f r e e
g r a m ma r
,

P a r s e r s ,S h i f t r e d u c e
p a r s i n g,
O p e r a t o r

p r e c e d e n c e p a r s i n g ,o p e r a t o r p r e c e d e n c e
g r a m me r,o p e r a t o r p r e c e d e n c e
a l g o r i t h m, T o p

d o w n p a r s i n g
,R e c u r s i v e d e s c e n t p a r s i n g,

L e f t F a c t o r i n g,

P r e d i c t i v e p a r
s e r
,F I R S T a n d F O L L O W,
c o n s t r u c t i o n

o f p a r s i n g t a b l e

,L L ( 1 )
G r a m ma r s.

0 8
H o u r s

T h e o r e t i c a l
/L o g i c a l

5

A u t o ma t i c c o n s t r u c t i o n o f e f f i c i e n t p a r s e r s

L R P a r s e r s,

L R G r a mma r s,

T h e c a n o n i c a l c o l l e c t i o n o f L R ( 0 )
I t e ms ,C o n s t r u c t i o n o f S L R P a r s i n g T a b l e s ,C o n s t
r u c t i n g
c a n o n i c a l L R p a r s i n g T a b l e s ,C o n s t r u c t i n g L A L R p a r s i n g
T a b l e. u s i n g

A mb i g u o u s g r a m ma r s ,A u t o ma t i c P a r s e r
G e n e r a t o r

,I mp l e me n t a t i o n o f L R P a r s i n g T a b l e s.

C o n s t r u c t i n g
L A L R S e t s o f I t e ms

0 8

H o u r s

T h e o r e t i c a l
/L o g i c a l


6

S y n t a x
D i r e c t e d

T r a n s l a t i o n ( S
D T )

S D T S c h e me s,

I m p l e me n t a t i o n o f s y n t a x d i r e c t e d T r a n s l a t o r s,
I n t e r me d i a t e c o d e ,P o s t f i x n o t a t i o n ,C o n t r o l f l o w i n p o s t f i x
0 8
H o u r s


T h e o r e t i c a l
/L o g i c a l


30

code,

Syntax directed translation to postfix code,

Parse trees
and syntax trees,

Three Address code,

Quadruples

and triples,

Tra
nslation of assignment statements ,Boolean expressions,

Postfix Translations


7

Symbol Table

The contents of a symbol table,

reusing symbol
-
table
space,
Array

names, Storage

allocation
information, Data

Structures
for symb
ol
table, Representation

scope information .

05
Hours

Theoretical

8

Run Time Storage Administration

Implementation of a Simple Stack
-
Allocation
Scheme
,

Implementation of Block structural Languages,

Storage
Allocation in FORTRAN.

05

Hours
.

Theoretical

9

Error Detection and Recovery

Errors
,

Lexical

phase errors,

Syntactic phase
errors,

Error
Recovery in LR
Parsing, Automatic

Error Recovery in YACC.

05

Hours

Theoretical

10

Code Optimization and code
generation

The Principal
sources of

optimization,

Loo
p Optimization,

The
DAG representation of Basic Blocks .code generation
-
Object
programs
Problems in

code
generation, A

simple code
generator,

The code generation
algorithm, Code

generation
from DAG's .

08

Hours

Theoretical

SECTION A :Chapter 1 to 5

SE
CTION B :Chapter 6 to 10


B : Practicals


Minimum 10 experiments should be conducted based on
the
above
mentioned
syllabus
.

The
assessment on the term work shall be done on the following criteria:

1.

Continuous assessment.

2.

Performing the Experiment in the
Lab.


3.
Oral examination (conducted internally) on the syllabus and the term work mentioned
above


List of Experiments


1. Write

a program for lexical analyzer.


2. Write

a program for expression validation.


3. Write

a program for operator
check
ing.


4. Study

of LEX.


5. Write

a program for TOP DOWN parser.


6.Write a program for Shift reduce Parser


7. Study

of LR parser.


8 Write a program for YACC


9.Study of Loop Optimization and DAG representation


10
. Write

a program for LR
Parser.











31

C. Suggested Text Books and References


Sr. No.

Title

Author

Publication


1

Principles of Compiler Design

Aho, Ullman;

Narosa

Publishing House,
1989


2

Compilers : Principles, techniques
and tools

Aho, Sethi,
Ullman;

Wesley 1988


3

Compi
ler Construction : Theory &
Practice


Barrat, Eates,
Cought,

Galgotia 1988





D. Digital
R
eferences


Sr. No.

Website / Links / e
-
journals

1

http://www.onesmartclick.com/engineering/compiler
-
design.html

2

http://en.wikipedia.org/wiki/Principles_of_Com
piler_Design

3

http://ece.ut.ac.ir/classpages/S84/Compiler/

























32

Pattern of Question Paper

Faculty of Engineering and Technology

Third year (BTech)
Computer Science and
Engg

(Revised Course) Examination

November / December, May/June 200_

(Elective

I)
Compiler Construction



Time: 3 Hrs








Max Marks: 80


‘Please check whether you have got the right question paper’

N.B:
-


i.

All the questions are compulsory

ii.

Use separate answ
er book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1 16 Marks











This Question will consist of questions from the
entire chapter under section A mentioned in the
syllabus.


Question No.2
OR

Question No.2

12 Marks

Question No.3
OR
Question No.3

12 Marks


Note:

1.

The topic may be intermingled in the questions

2.

The questions will be memory based, application based and un
derstanding type



Section B

Question No. 4 16 Marks











This Question will consist of questions from the entire chapter under section A mentioned in

the
syllabus.


Question No.5
OR

Question No.5

12 Marks

Question No.6
OR
Question No.6

12 Marks


Note:

3.

The topic may be intermingled in the questions

4.

The questions will be memory based, application based and understanding type








33

TY B.Tech Computer S
cience and Engineering (Revised Syllabus)

Elective
-
I

Artificial Intelligence


Period

Evaluation Scheme

Credit

Sessional Exam

L

T

P

Total

TA

CT

ESE

PR

Total

4

--

2

6

25

20


80

--

125

5


Objective:

1.
To understand human cognition

2.
To understand

cost
-
effective automation.

3.
General problem solving solves broad range of problems.


A: THEORY

Unit

Contents

Duration

Nature

1

Introduction

Definition of Al, Al problems, Al technique, level of
model. Criteria for success.

4

Hours


Theoretical

2

Pr
oblems problem space & search

Defining problem space, production system,
problem
characteristics, production system characteristics, Issues
in the design of search process.

6

Hours



Theoretical



3

Heuristic search technique

Generate & test, hill climb
ing, best first search, problem
reduction, constraint satisfaction, mean
-
ends analysis.

5

Hours


Theoretical



4

Ai programming language

Prolog, introduction to prolog, concepts &
programming.

5

Hours


Theoretical



5

Knowledge Representation(KR)

Repre
sentation & mapping, approaches to KR, issue in
the frame problem

5

Hours


Theoretical


6

Predicate logic

Representation simple facts, its relationship,
propositional logic, predicate logic, quantities, resulting
natural deductions.

8

Ho
urs


Theoretical


7

Knowledge Representation using rules

Procedural vs. declarative knowledge, logic
programming, forward Vs backward searching,


Matching, control Knowledge.

8

Hours


Theoretical

8

Symbolic reasoning under uncertainty

Non monotonic r
easoning, logic for non
-
monotonic
reasoning, implementation issue, augmenting a problem
solve, implementation by

(1)

depth
-
first search, (2) breadth search.

8

Hours


Theoretical

9

Statistical reasoning

Probability & Bayer
’s

th
eorem
. Certainty factors

&
rule
systems, Bayesian n/w,
D
emst
e
r Shafer theory,
F
uzzy
logic.

6

Hours


Theoretical


34

10

Slot & fil
l
er structures

Semantic net, frames, conceptual dependency, scripts.

5

Hours

Theoretical


SECTION :A Chap 1,2,3,4,5



SECTION :B Chap 6,7,8,9,10




B :
Practica
ls

Minimum 8 experiment
s

should be conducted base
d

on
the above mentioned
syllabus

The assessment of

the term work shall be done on the following criteria:

1.

Continuous assessment.

2.

Performing the
e
xperiment in the Lab.


3.
Oral examination (c
onducted internally) on the syllabus and the term work mentioned
above



C
. Suggested Text Books and References


Sr. No.

Title

Author

Publication


1

Artificial Intelligence

Elaine Rich,
Keirn Knight

TMH


2

Introduction to AI & expert
system

Dan W.
Pla
torjon

PHI


3

Introduction to AI

Rajendra
akerkar




D
. Digital
R
eferences


Sr. No.

Website / Links / e
-
journals

1

Http://www.cs.ac.uk/dave/ai/ai1.html


2

http://en.wikipedia.org/wiki/Artificial_intelligence


3

http://www
-
formal.stanford.edu/jmc/whatisai/whatisai.html























35

Pattern of Questio
n Paper

Faculty of Engineering and Technology

Third year (BTech)
Computer Science and
Engg (Revised Course) Examination

November / December, May/June 200_

(Elective

I) Artificial Intelligence


Time: 3 Hrs








Max Marks: 80


‘Please check whether you ha
ve got the right question paper’

N.B:
-


i.

All the questions are compulsory

ii.

Use separate answer book for each section

iii.

……………………………………………

iv.

……………………………………………


Section A

Question No. 1

16 Marks