Sie sind auf Seite 1von 25

(17 July 2009) V Senate Item 4.e.

1 Proposal from DSB in Computer Science and Engineering


(Approval of Structure and Syllabus of BE CSE) Page 1 of 25

Department of Computer Science & Engineering


B.E. Computer Science & Engineering
Curriculum Structure and Scheme of Evaluation
SEMESTER – I
Scheme of Teaching
Scheme of Evaluation (Marks)
(Hrs/week)
Sr. Tot Theory
Course To Ter Pract Tota
No Name of the Subjects al
Code Tu tal m ./ l
. L P Cr Assi
t Hr Test ESE Wor Viva- Mar
edi gn
s k voce ks
ts
Design of Linux
1 CS-401 4 - - 4 4 20 20 60 - - 100
Operating system
Software Testing &
2 CS-402 3 - 1 4 4 20 20 60 - - 100
Quality Assurance
3 CS-403 Network Security 4 - - 4 4 20 20 60 - - 100
CS-404
4 To Elective-I 3 - 1 4 4 20 20 60 - - 100
CS-406
5 CS-407 Seminar - 2 - 2 1 - - - 50 50 100
Lab: Design of Linux 25
6 CS-408 - 2 - 2 1 - - - 25 50
Operating system
7 CS-409 Lab: Software Testing - 2 - 2 1 - - - 25 25 50
CS-410
8 To Lab: Elective-I - 2 - 2 1 - - - 25 25 50
CS-412
9 CS-413 Project-I - 6 - 6 4 - - - 100 - 100
(A) Total of Semester - I 14 14 2 30 24 80 80 240 225 125 750

SEMESTER – II
10 CS-414 Soft Computing 4 - - 4 4 20 20 60 - - 100
Professional & Cyber
11 CS-415 4 - - 4 4 20 20 60 - - 100
Ethics
12 CS-416 Distributed Databases 4 - - 4 4 20 20 60 - - 100
CS-417
13 To Elective-II 4 - - 4 4 20 20 60 - - 100
CS-418
14 CS-419 Project-II - 6 - 6 4 - - - 50 100 150
15 CS-420 Lab: Soft Computing - 2 2 1 - - - 25 25 50
Lab: Professional & 25
16 CS-421 - 2 2 1 25 50
Cyber Ethics
Lab: Distributed 25
17 CS-422 - 2 2 1 - - - 25 50
Databases
CS-423 25
18 To Lab: Elective-II - 2 2 1 - - - 25 50
CS-424
( B) Total of Semester- II 16 14 - 30 24 80 80 240 150 200 750

Grand Total = (A) + (B) 160 160 480 375 325 1500

(Note: L: Lecture, P: Practical, ESE: End Semester Examination)

Elective-I Elective-II
1] Artificial Intelligence 1] Multimedia Techniques
2] Advanced Algorithm 2] Mobile Computing
3] Advanced Embedded System Design
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering1
(Approval of Structure and Syllabus of BE CSE) Page 1 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 2 of 25

CS-401: Design of Linux Operating System


Teaching Scheme: Examination Scheme:
Lectures: 4 Hrs/Week Test: 20 Marks
Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit-1 [8hrs]
Introduction and Process Management
Overview of operating system and kernels, Building the kernel, ext2 file system
Process management: The Process Descriptor and task structure,
Process creation, Linux implementation of threads, process termination

Unit- 2 [8hrs]
Scheduling:
I/O Bound vs. Processor, process priority, Time slice, Process preemption, scheduling algorithm,
preemption and context switching

Unit- 3 [8hrs]
Internal Representation of File and system calls:
Inodes, directories, algorithm for releasing an inode & assigning an inode structure of a regular file,
direct & indirect blocks in inode, algorithm for conversion of a pathname to an inode, super block
and it’s structure.
File System Calls:
Open, crpat, read, write, fseek, pipe, dup, chair, chown, change, mode, state & stat

Unit- 4 [8hrs]
Memory Management
Pages, Zones, getting pages and zones, Slab layer and Slab allocator interface,
Virtual file system, VFS objects and their data structures: superblock object, inode object, file object

Unit- 5 [8hrs]
Shell Programming and System Administration:
Writing simple shell scripts, command line arguments, using if then else, case, do while, for loop,
until loop, role of system administrator, Configuring services like apache web server, DNS, Samba

Text/Reference Books –

The Design of Unix Operating System – Maurice Bach -Pearson Education


Linux Kernel Development – Robert Love – Person Education
Operating systems, Design and Implementation: Andrew S.Tanenbaum -PHI Pub
Advance Unix-Programmers Guide – Stephan Prata. – SAMS Publication

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering2
(Approval of Structure and Syllabus of BE CSE) Page 2 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 3 of 25

CS-402: Software Testing & Quality Assurance


Teaching Scheme: Examination Scheme:
Lectures: 3 Hrs/Week Test: 20 Marks
Tutorial: 1 Hrs/Week Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit- 1 [8hrs]
Introduction – s/w testing background - What is a bug? Why do bugs occur? The cost of bugs.
Goals of a software tester. Characteristics of s/w tester. Software development process- product
component, software project staff, software development lifecycle model. The realities of s/w testing
– testing axioms, s/w testing terms and definitions, Software Testing Life Cycle(STLC)

Unit- 2 [8hrs]
S/w testing fundamentals- Examining the specifications - Black box and white box testing, Static
and dynamic testing, Static black box testing, Performing a high level review of the specification,
low level specification test techniques. Testing the s/w with blinders on – Dynamic black box
testing, Test to pass and test to fail, Equivalence partitioning, data testing, State testing, Other black
box test techniques. Examining the code – Static white box testing, Formal review, Coding standards
and guidelines, Generic code review checklist. Testing the software with X-ray glasses – Dynamic
white box testing, Dynamic white box testing, verses debugging testing the pieces
[8hrs]
Unit- 3 Types of testing-I- Configuration testing, Compatibility testing, Foreign language
testing, Usability testing, Testing the documentation, Testing for software security

Unit- 4 [8hrs]
Types of testing-II- Web site testing, Automated testing and test tools- Benefits of automation and
tools, various test tools, Software test automation, Random testing. Bug bashes and beta testing –
Having other people test your s/w, Test sharing, Beta testing, Outsourcing your testing.
Performance Testing – Introduction, Benefits of performance testing. Types of performance testing
Tools for performance Testing, Process for performance testing, challenges.

Unit- 5 [8hrs]
Test planning and quality assurance –Planning the test – Goal of test planning, Various test
planning topics, Writing and tracking test cases- Goal of test case planning, Test case planning
overview, Test case organization and tracking, Reporting what you find - Getting the bug fixed,
Isolating and replacing bugs, Bug’s lifecycle, Bug tracking system, Measuring the success, Software
quality assurance- Quality is free, Testing and quality assurance in the work place, Test management
and organizational structures, capability maturity model (CMM), ISO 9000
Test Metrics and Measurement – Test Defect Metrics – Defect find rate, Defect fix rate, outstanding
defects rate, priority outstanding rate, Defect trends, Defect classification trend, weighted defects
trend, Defect cause distribution. Productivity Metrics – Defect per 100 hours of testing, Test Cases
Educated per 100 Test Cases, Defects per 100 failed test cases, Test phase Effectiveness, Closed
Defect Distribution

Text/Reference Books –
Software Testing – Ron Patton, SAMS Publishing
Software Testing Fundamentals: Methods and Metrics by Marnei L. Hutcheson – WILEY Pub.
Software Engineering by Pressman - McGraw-Hill publications
Software Testing – Principles and Practices- Strinivasan Desikan and Gopalswami Ramesh, Pearsons

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering3
(Approval of Structure and Syllabus of BE CSE) Page 3 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 4 of 25

CS-403: Network Security


Teaching Scheme: Examination Scheme:
Lectures: 4 Hrs/Week Test: 20 Marks
Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit- 1 [8hrs]
Symmetric Ciphers: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques,
Block cipher modes of Operation, Characteristics of Advanced Symmetric Block Cipher, Euclid’s
Algorithm, triple DES, blowfish, Placement of Encryption Function, Traffic Confidentiality, key
distribution.

Unit- 2 [8hrs]
Public Key Encryption and Hash Function: prime Numbers, Fermat’s and Euler’s Theorems,
Principles of Public-Key Cryptography, The RSA Algorithm, Key Management, Diffie- Hellman
Key Exchange
Elliptic Curve Arithmetic, Elliptic Curve Cryptography, Authentication Requirements,
Authentication Functions, Digital Signatures, Authentication Protocols, Digital Signature Standards.

Unit- 3 [8hrs]
Authentication Application & Electronic Mail Security: Kerberos, X.509 Authentication Service,
Preety Good Privacy, S/MIME.

Unit- 4 [8hrs]
IP Security and Web Security: IP Security overview, IP Security Architecture, Authentication
Header, Encapsulating Security Payload, Combining Security Associations, Key Management, Web
Security Considerations, Secure Electronic Transactions.

Unit-5 [8hrs]
System Security: Intruders, Intrusion Detection, password Management, Viruses and Related
Threats, Viruses Countermeasures, Firewall design Principles, Trusted Systems.

Text/Reference Books –

Cryptography and Network Security by William Stallings


The Complete Reference Book of Network Security by Mark Rhodes- Ousley

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering4
(Approval of Structure and Syllabus of BE CSE) Page 4 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 5 of 25

CS-404: Elective-I [ Advanced Embedded Systems Design]


Teaching Scheme: Examination Scheme:
Lectures: 3 Hrs/Week Test: 20 Marks
Tutorial: 1 Hrs/Week Assignment: 20 Marks
End Sem Exam: 60 Marks

UNIT 1. ARM Embedded Systems The RISC Design Philosophy ARM Design Philosophy
Embedded System Hardware Embedded System Software 2 ARM Processor Fundamentals Registers
Current Program Status Register Pipeline Exceptions, Interrupts, and the Vector Table Core
Extensions Architecture Revisions ARM Processor Families

UNIT 2 Introduction to the ARM Instruction Set, Data Processing Instructions, Branch Instructions,
Load-Store Instructions, Software Interrupt Instructio, Program Status Register Instructions, Loading
Constants, Introduction to the Thumb Instruction Set, Thumb Register Usage ARM-Thumb
Interworking, Other Branch Instructions, Data Processing Instructions, Single-Register Load-Store
Instructions, Multiple-Register Load-Store Instructions, Stack Instructions, Software Interrupt
Instruction

UNIT 3: Efficient C Programming, Overview of C Compilers, and Optimization Basic C Data


Types, C Looping Structures, Register Allocation, Function Calls, Pointer Aliasing Structure,
Floating Point Inline Functions and Inline Assembly Portability Issues

UNIT 4: Writing and Optimizing ARM Assembly Code Writing Assembly Code Profiling and
Cycle Counting Instruction Scheduling Register Allocation Conditional Execution Looping
Constructs Bit Manipulation Efficient Switches Handling Unaligned Data Summary Optimized
Primitives Double-Precision Integer Multiplication Integer Normalization and Count Leading Zeros
Division Square Roots Transcendental Functions: log, exp, sin, cos Endian Reversal and Bit

UNIT 5: Digital Signal Processing Representing a Digital Signal Introduction to DSP on the ARM
FIR filters IIR Filters The Discrete Fourier Transform Exception and Interruput Handling Exception
Handling Interrupts Interrupt Handling Schemes Firmware Firmware and Bootloader Example:
Sandstone Embedded Operating Systems Fundamental Components Example: Simple Little
Operating System Caches, The Memory Hierarchy and Cache Memory Cache Architecture Cache
Policy Coprocessor Caches and Software Performance Memory Protection Units

Books:
1. Arm System Developer's Guide Andrew Sloss Dominic Symes, ARM, Cambridge, UK
Chris Wright, Elsevier Publishers, Second Edition
2. ARM System-on-chip Architecture, Steve Furber, Second Edition,published by Addison
Wesley

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering5
(Approval of Structure and Syllabus of BE CSE) Page 5 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 6 of 25

CS-405: Elective-I [ Artificial Intelligence]


Teaching Scheme: Examination Scheme:
Lectures: 3 Hrs/Week Test: 20 Marks
Tutorial: 1 Hrs/Week Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit-1 [8hrs]
Problems and Search: What is Artificial Intelligence?, The AI Problems, The Underlying
Assumption, What is an AI Technique, The Level of the Model, Criteria for Success, Problem
Spaces, and Search: Defining the Problem as a State Space Search, Production systems, Problem
Characteristics, Production System Characteristics, Issues in the Design of Search Programs,
Heuristic Search Techniques: Generate-and- Test, Hill Climbing, Best-First Search, Problem
Reduction, Constraint Satisfaction, Means-Ends Analysis.

Unit-2 [8hrs]
Knowledge Representation: Representations and Mappings, Approaches to knowledge
Representation, Issues in Knowledge Representation, The Frame Problem. Using Predicate Logic: -
Representing Instance and Isa Relationships, Computable Functions and Predicates, Resolution,
Natural Deduction. Representing Knowledge Using Rules:- Procedural Versus Declarative
knowledge, Logic Programming, Forward versus Back ward Reasoning, Matching, Control
Knowledge.

Unit-3 [8hrs]
Symbolic Reasoning under Uncertainty:- Introduction to Nonmonotonic Reasoning, Logics for No
monotonic Reasoning, Implementation Issues, Augmenting a Problem solver, Implementation:
Depth-First Search, Implementation: Breadth First Search.
Statistical Reasoning:- Probability and Baye’s Theorem, CertaintyFactors and Rule-Based Systems,
Bayesian Networks, Dempster-Shafer Theory, Fuzzy Logic.

Unit-4 [8hrs]
Game Playing: The minimax search procedure, Adding Alpha-Beta cutoffs, Additional Refinements,
Planning: An Example Domain: The block World, Components of Planning System, Goal Stack
Planning, Nonlinear Planning Using Constarint Posting, hierarchical Planning

Unit-5 [8hrs]
Understanding: What is Understanding, What makes Understanding Hard, Understanding as
constraint satisfaction Learning: What is Learning, Rote learning, Learning by taking Advice,
learning in problem Solving, Learning from Examples: Induction, Explanation based Learning,
Discovery

Text/Reference Books –
Artificial Intelligence, Elaine Rich, Kevin Knight, Tata McGrawHill
Artificial Intelligence – A modern approach , Stuart Russel, Peter Norwig, Pearosn Education.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering6
(Approval of Structure and Syllabus of BE CSE) Page 6 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 7 of 25

CS-406: Elective-I [ Advanced Algorithm ]


Teaching Scheme: Examination Scheme:
Lectures: 3 Hrs/Week Test: 20 Marks
Tutorial: 1 Hrs/Week Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit- 1 [8hrs]
Computational Problems
Decision problems, search problems, and optimization problems. Encoding of instances, Examples
of decision and optimization problems, Optimization problems: feasible solutions, cost and goals.
Models of computation: Turing Machines, time and space complexity.

Unit- 2 [8hrs]
NP-Hard and NP-Complete Problems
Asymptotic notation, Measuring the time complexity, Classes P and NP. NP-completeness,
Polynomial reducibility, Examples of reductions.

Unit- 3 [8hrs]
Randomized Algorithms
Classification of randomized algorithms, Las Vegas, One-way communication protocols and their
complexity, One-sided Monte Carlo, MonteCarlo-Sqrt; Equivalence testing: 1-time BP ,Two-sided
Monte-Carlo - Primality testing, Random sampling

Unit- 4 [8hrs]
Approximation Algorithms
Approximation ratio, Examples of approximation algorithms,. Randomized approximation
algorithms.

Unit- 5 [8hrs]
Local Search Algorithms
Local Search: the concept. Examples of local search algorithms, e.g. GSAT. Random walk:
Randomized multi-start local search for 3-SAT

Text/Reference Books –

1. J. Hromkovic. Algorithms for hard problems. Second edition, Springer, 2003, 3-540-
44134-4
2. Vijay V. Vazirani. Approximation Algorithms. Springer, 2004, 3-540-65367-8
3. Michael Mitzenmacher, Eli Upfal. Probability and Computing. Cambridge University
Press, 2005, 0-521-83540-2
4. T. Cormen, C. Leiserson, R. Riverst, and C. Stein, Introduction to Algorithms, MIT
Press, Sept. 2001.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering7
(Approval of Structure and Syllabus of BE CSE) Page 7 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 8 of 25

CS-407: Seminar
Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 50 Marks
Pract. Exam : 50 Marks

Guidelines for presenting a seminar:

• The seminar will consist of a typewritten report covering the topic related to his area
of final year project.
• If more number of students are working on same project then they should separate the
seminar topics from the project area which is relevant and which will contribute for
completion of project.
• Weekly report of students work for finalization of his area of work and topic of
seminar should be submitted to the faculty during designated hours meant for seminar
• Format of weekly report should be finalized by the department with sufficient inputs
received from the students. It should have following stage wise reports:
Project Area and Project Groups by 3rd week
Tentative seminar topics by 4th week
Literature/Field Study Mechanism identified sources and strategy by 5th week
Weekly report on Literature/Field Study 6th, 7th & 8th week
Presentation Format contents & Trial Presentations to student groups 9th,10th week
Journal on above stages and Final Presentation Report 11th week

• It is expected that the candidate prepares a report based on outcomes of literature


studies, field visits, observation schedules, focus group meetings etc related to a
problem in relevant technology area.
• The report shall be tested for any plagiarism out of books, journals and internet based
articles and reports by appropriate web based tool.
• The candidate shall deliver seminar on the topic on first two occasions to students of
his class for peer assessment.
• Format for peer group assessment should be designed by the faculty with approval of
department. Peer assessment should not be given more than 15% weightage
• Final presentation for term work should be attended by minimum TWO faculty
members. Each candidate may be given time minimum of 8 to 10 minutes.
• Assessment criteria for seminar delivery for term work should be designed by the
faculty with inputs received from students of the class. It should include provision for
peer group assessment as per the norm stated above.
• Assessment Criteria so designed will be displayed on the department notice board
with the approval from department along with these guidelines.

• Practical Examination will involve Presentation of seminar in front of Examiners


appointed for not less than 12 minutes per candidate. Practical examination
Presentation of seminar will be used to assess students own contribution in furthering
studies in the topic and contribution by way of analysis of field work studies and/or
literature studies

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering8
(Approval of Structure and Syllabus of BE CSE) Page 8 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 9 of 25

CS-408: Lab : Design of Linux Operating System


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 8 Programs should be completed which will be based on the subject and record for the same
shall be submitted

Suggestive List of Programs –

Design & Develop a program using fork and vfork system calls
Design & Develop a program using File system calls such as read, write, open, creat, close
Design & Develop a program for handling signals
Design & Develop a program for various CPU scheduling algorithms
Design & Develop a program for implementing buffer cache
Design & Develop a program on implementation of inode, virtual memory
Design & Develop a program on exit system call
Installation of Linux, Configuring Apache web server, mail server, samba server
Writing shell scripts using while, until, if then else, for loops

Practical Examination will consist of Performance and Viva-voice Examination


The assessment will be based on the following –

1. Performance in the practical examination


2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering9
(Approval of Structure and Syllabus of BE CSE) Page 9 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 10 of 25

CS-409: Lab : Software Testing & Quality Assurance


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 8 Programs should be completed which will be based on the subject and record for the
same shall be submitted

Suggestive List of Programs –

1. Study of one of the test management tools such as Quality Center / Test Director / Quality
Manager / ClearQuest or Open Source tools such as Bugzilla / QATraq / TestLink etc.
2. Study of one of the automation testing tools such as WinRunner /QTP /QARun /Silk Test / RFT
3. Recording test cases in context sensitive mode
4. Recording test cases in analog mode
5. Testing an application using synchronization checkpoint
6. Test case design in batch mode
7. Testing an application using GUI checkpoints
8. Testing an application using bitmap checkpoint
9. Manual Testing of an application
10. Test case design for functional testing
11. Study of one of the Performance Testing tools – Licensed tools such as Loadrunner / QAload /
Silk Performer / RPT or Open Source Tools such as OpenSTA / Jmeter / Grinder / Microsoft
WAS etc.
12. Load Testing of Sample application using any of the above load testing

Practical Examination will consist of Performance and Viva-voice Examination


The assessment will be based on the following –

1. Performance in the practical examination


2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering10
(Approval of Structure and Syllabus of BE CSE) Page 10 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 11 of 25

CS-410: Lab Elective-I [ Artificial Intelligence ]


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 8 programs should be completed which will be based on the subject and record for the
same shall be submitted.

Suggestive list of programs –

1. Writing facts and rule in prolog.


2. Design & Develop a program in prolog to solve monkey banana problem using resolution
3. Design & Develop a program in prolog Represent the associative network
4. Design & Develop a program in prolog to implement the simulation example using O.O.S.
5. Design & Develop a program in prolog to solve water jug problem using DFS
6. Design & Develop a program in prolog to implement frame data structure
7. Design & Develop a program in prolog to implement grammar used to derive the parse tree
8. Design & Develop a program in prolog to implement expert for trouble shooting in PC
9. Design & Develop a program in prolog to find Cartesian product and biggest number
10. Creating mini calculator and macros

Practical examination will consist of Performance and Viva-voice examination


The assessment will be based on the following –

1. Performance in the practical examination


2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering11
(Approval of Structure and Syllabus of BE CSE) Page 11 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 12 of 25

CS-411: Lab : Elective-I [ Advanced Algorithm ]


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 8 Programs should be completed which will be based on the subject and record for the same
shall be submitted

Suggestive List of Programs –

1. Monte-Carlo Simulation
2. Primality Testing with Monte-Carlo
3. Randomized Quick Sort
4. Vertex-cover Approximation algorithm
5. Traveling Salesperson approximation algorithm
6. Examples on optimization algorithms and decision algorithms(0/1 Knapsack)

Practical Examination will consist of Performance and Viva-voice Examination


The assessment will be based on the following –

1. Performance in the practical examination


2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering12
(Approval of Structure and Syllabus of BE CSE) Page 12 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 13 of 25

CS-412 : Lab: Elective-I [ Advanced Embedded Systems Design ]


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 8 Programs should be completed which will be based on the subject and record for the same
shall be submitted.

Practical Examination should be conducted to assess the skills of the candidate to perform basic experiments
and challenging programming tasks as per the subject contents.

List of experiments should be made available to the candidate well in advance so as to get sufficient time to
prepare for the same. Experiment list should involve mix of software and hardware assignments.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering13
(Approval of Structure and Syllabus of BE CSE) Page 13 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 14 of 25

CS-413: Project-I
Teaching Scheme: Examination Scheme:
Practical: 6 Hrs/Week Term Work : 100 Marks

The project will consist of the work on the topic selected for the project .The project must be done in
a group not exceeding four students. .

The candidate is expected to select the project, do the requirements analysis, and carry out the
necessary design procedure.

Term Work:
The assessments of the term work should be done by two internal examiners, one of which will be
the guide and the other will be HOD or senior staff member from the department.

Guidelines for completing the Project I:

• Weekly report of students work for finalization of his area of work and topic of
project should be submitted to the faculty during designated hours meant for seminar
• Format of weekly report should be finalized by the department with sufficient inputs
received from the students. It should have following stage wise reports:
Project Area and Project Groups by 3rd week
Tentative project problem statements by 5th week
Literature/Field Study Mechanism identified sources and strategy by 6th week
Weekly report on Literature/Field Study 6th, 7th & 8th week
Trial design sheets, SRS, ER diagrams, compilation of field data, trial database design
and normalization, Hardware design documents, prototype software or hardware
modules designed/developed 9th to 11th week
Journal on above stages and Final Presentation Report 12th week

• It is expected that the group of candidates prepare a report based on outcomes of


literature studies, field visits, observation schedules, focus group meetings etc related
to the problem statement. It shall include trial design documents, SRS, Hardware and
software prototypes, Testing strategy
• The report shall be tested for any plagiarism out of books, journals and internet based
articles and reports by appropriate web based tool.
• Assessment criteria for term work assessment should be viva voce examination by
two examiners appointed by the department
• Assessment criteria for seminar delivery for term work should be designed by the
faculty with inputs received from students of the class. It should include provision for
peer group assessment if possible.
• Assessment Criteria so designed will be displayed on the department notice board
with the approval from department along with these guidelines.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering14
(Approval of Structure and Syllabus of BE CSE) Page 14 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 15 of 25

CS-414: Soft Computing


Teaching Scheme: Examination Scheme:
Lectures: 4 Hrs/Week Test: 20 Marks
Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit 1
Basics of Artificial Neural Network 8hrs
Structure and working a biological neural network, characteristics of neural network, learning
methods, artificial neural network: terminology, neuron signal functions, models of neurons: Mc-
Culloch - Pitts model, perceptron model, Adaline model, topology, neural network architectures
Single layer ANN, model for multilayer perceptron

Unit 2
Back propagation Networks 8hrs
Back propagation learning, input layer computation, hidden layer computation, output layer
computation, calculation of error, back propagation algorithm, effect of tuning parameters, selection
of various tuning parameters in BPN, learning coefficient. Linear Seperability problem, XOR
problem, solution to XOR problem, Types of network: feed forward network, feedback network,
competitive learning network.

Unit 3 8hrs
State transition diagram and false minima problem, stochastic update, simulated annealing,
Boltzmann machine and Boltzmann learning, ART networks.
Applications of neural networks: Neocognitron - recognition of handwritten characters, NET talk: to
convert English text to speech.

Unit 4
Fuzzy Logic 8hrs
Fuzzy set theory, crisp sets, operations on crisp set, fuzzy sets, fuzzy versus crisp, operations, fuzzy
relations, crisp relations, properties Fuzzy logic
Application: Air conditioner controller. Genetic algorithm: Basic concepts, creation of offspring,
working principle, encoding, fitness function, reproduction

Unit 5
Neural network, fuzzy logic and genetic algorithm: Hybrids
Genetic algorithm based Back propagation network: 8hrs
Genetic algorithm based weight determination: coding, weight extraction, fitness function,
Reproduction, convergence
Application: Electrical load forecasting, K factor determination in columns
Fuzzy Back propagation networks
LR- type fuzzy members, fuzzy neuron, fuzzy Back Propagation architecture, learning in fuzzy
Back Propagation
Applications: Earthquake damage evaluation, Knowledge base evaluation.

Text/Reference Books:
1) Artificial neural networks :B. Yegnanarayana-PHI publications
2) Neural networks, fuzzy logic and genetic algorithms- synthesis and applications: S.
Rajansekaran, Vijaylakshmi Pari-PHI

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering15
(Approval of Structure and Syllabus of BE CSE) Page 15 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 16 of 25

CS-415: Professional & Cyber Ethics


Teaching Scheme: Examination Scheme:
Lectures: 4 Hrs/Week Test: 20 Marks
Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit- 1 [8hrs]
Computer and Philosophical ethics and ethical decision making
Legal concepts and their implications on the computing professions, Philosophical foundations for ethics,
Defensible decision making in ethical situations, solving ethical dilemma, Professional ethics and moral issues
/ Codes of Conduct, Reliability verses Trust: The Computing Dilemma, Computers and work, Privacy and
Information, Social Issues and broad impact of computers, Professional responsibilities and implications,
Hacking and hacker ethics.

Unit- 2 [8hrs]
Intellectual property issues in cyberspace
Introduction to intellectual property Protections via Trade Secrets, Trademarks, Patents, Etc.
Contracting to protect intellectual property, Protection options - Encryption / PGP, copyright on web-content,
copyright on software,

Unit- 3 [8hrs]
Basic concepts of technology and law
digital contracts, digital signatures, role and functions of certifying authorities, Cyberforensis, computer
forensics and law, forensic evidence, Forensics casework, investigative incident-response actions,

Unit- 4 [8hrs]
Cyberethics
Cyberethics, philosophical challenges to Cyberethics, Computer crimes and criminal law, Computer viruses
and worms - International computer crimes, Cybercrimes, Ethical consideration to computer crimes, Types of
incidents, Stages of incident response, incident prevention and detection, Threats in cyberspace, Blended
attacks.

Unit- 5 [8hrs]
Information technology Act 2000
Scope, jurisdiction, offense and contraventions, powers of police, adjudication

1. Computers, Ethics, And Social Values, Johnson and Nissenbaum, 1994 Prentice Hall
2. Cybersecurity operations Handbook,John Rittinghouse,William Hancock
3. Computer ethics,Deborah G.Johnson,third edition,Pearson education

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering16
(Approval of Structure and Syllabus of BE CSE) Page 16 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 17 of 25

CS-416: Distributed Databases


Teaching Scheme: Examination Scheme:
Lectures: 4 Hrs/Week Test: 20 Marks
Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit- 1 [8hrs]
Introductory concepts and design of Distributed Database Systems
Data Fragmentation, Replication, and allocation techniques for DDBMS, Methods for designing and
implementing DDBMS e.g. designing a distributed relational database,
Architectures for DDBMS e.g. cluster, federated, parallel databases and client server architecture.

Unit- 2 [8hrs]
Distributed transactions
One-tier and two-tier models; three-tier model; sessions and context; queued transaction processing;
transaction monitor; services provided by a transaction monitor; remote procedure call; transactional
remote procedure call; transaction processing on the Internet; web application servers: J2EE;
structure of a Java bean; managing persistence of beans; managing transactions on beans.

Unit- 3 [8hrs]
Distributed query processing
Applications operating on multiple databases; distributed database system; application designer's
view of a distributed database; distributing data among different databases; horizontal partitioning;
vertical partitioning; replication of data; execution strategies for distributed queries; global
optimization of joins; semi join optimization; joins, projections, and selections, query optimization
for a multidatabase system; tuning of database design and queries; distributed databases in Oracle.

Unit- 4 [8hrs]
Replicated databases management
Replication of data items; consistency of replicas; synchronous-update replication; quorum-
consensus replication; asynchronous-update replication; primary-copy replication; group replication;
replication in Oracle; publish-and-subscribe replication; remote backup systems.

Unit- 5 [8hrs]
Parallel databases
Parallel systems; speedup and scale up; parallel-database architectures; data partitioning; handling of
skew; interquery and intraquery parallelism; intraoperation parallelism; parallel join; cost of parallel
evaluation of operations; interoperation parallelism; query optimization for a parallel database;
design of parallel systems.

Text/Reference Books –

1. Oefali, R., Harkey Dan and Edwards, J. The essential Distributed Objects-Survival guide.
John Wiley & Sons, Inc. 1996 ISBN 0-471-12993-3
2. Tamer Ozsu, M. and Valduriez, P. Principles of Distributed Database Systems, (2nd Edition)
Prentice Hall International Inc. 1999 ISBN 0-13-607938-5
3. M. Kifer, A. Bernstein & P. M. Lewis: Database Systems. An Application-Oriented
Approach. Complete Version. Pearson Addison Wesley, 2006
4. Connolly, T.M., Begg, C.E. and Strachan, A.D. Database Systems - A Practical Approach to
Design
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering17
(Approval of Structure and Syllabus of BE CSE) Page 17 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 18 of 25

CS-417: Elective-II [ Multimedia Techniques ]


Teaching Scheme: Examination Scheme:
Lectures: 4 Hrs/Week Test: 20 Marks
Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit- 1 [8hrs]
Multimedia Input / Output Technologies
Multimedia elements, Multimedia applications, Key technology issues, Pen Input, Video & Image
Display system, Print Output technologies, Image scanners, Digital voice & Audio, Digital Camera,
Video images & Animation, Full Motion Video.

Unit- 2 [8hrs]
Data Compression & Optical storage Media
Video Image Compression, Audio Compression, Optical Media, Hierarchical Storage Management.

Unit- 3 [8hrs]
Surface Modeling and Animation Techniques.
Introduction to 3D modeling, types of 3D art : modeling, animation, texturing, rendering
Introduction to animation, Different animation techniques : traditional animation, stop animation,
computer animation; other techniques : film animation, sand animation, character animation etc;
animation software

Unit- 4 [8hrs]
Data & File Format Standards
Rich Text Format, TIFF File format, Resource Interchange File format(RIFF), MIDI file format,
JPEG file format for Still & Motion images, AVI Index file format, MPEG standards, TWAIN.

Unit- 5 [8hrs]
Multimedia Application Design
Multimedia application Classes, Types of multimedia system, Virtual reality Design, Components of
Multimedia system, Organizing multimedia databases, Application workflow design issues,
Distributed application design issues .

Text/Reference Books –

1. “Multimedia Systems Design” by Prabhat K Andleigh, Kiran Thakkar (PHI ).


2. “Multimedia Systems “ by S. D. Joshi ( Techmax).

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering18
(Approval of Structure and Syllabus of BE CSE) Page 18 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 19 of 25

CS-418: Elective-II [ Mobile Computing ]


Teaching Scheme: Examination Scheme:
Lectures: 4 Hrs/Week Test: 20 Marks
Assignment: 20 Marks
End Sem Exam: 60 Marks

Unit- 1 [8hrs]
Wireless and Mobile Network Architecture:
Principle of Cellular Communication, Overview 1G, 2G, 2.5G and 3G and 4G technologies. GSM
Architecture and Mobility management, hand off management, Network signalling. Mobile Computing
fundamental challenges, Mobile Devices –PDA and mobile OS, PalmOs, Win CE and Symbian.

Unit- 2 [8hrs]
Mobile IP Protocol Architecture:
Mobile IP and IP v 6 and its application in mobile computing. Cellular Digital Packet Data CDPD, VOIP,
GPRS Services, Wireless Local Loop-WLL system.

Unit- 3 [8hrs]
Wireless Application Protocol (WAP):
The Wireless Application Protocol application environment, wireless application protocol client software,
hardware and websites, wireless application protocol gateways, implementing enterprise wireless application
protocol strategy,

Unit- 4 [8hrs]
Wireless Markup Language:
An Introduction to Wireless Technologies, Markup Languages , An Introduction to XML, Fundamentals of
WML., Writing and Formatting Text , Navigating Between Cards and Decks, Displaying Images, Tables,
Using Variables, Acquiring User Input

Unit- 5 [8hrs]
Wireless Markup Language Script, Application of Mobile computing:
An Introduction to WMLScript, WMLScript Control Structures, Events, Phone.com Extensions, Usability
ASP and Dynamic WAP Sites, XML and XSLT, Dynamic WML Generation with ASP and XSLT,
Developing WAP Applications using Emulators.

Text/Reference Books -

1. Yi Bing Lin, “Wireless and Mobile Networks Architecture”, John Wiley.


2. Wrox “The Beginning WML and WML Script”, Wrox Publication
3. Tomasz Imielinski et.al, Mobile Computing, Kluwer Academic Press 1996.
4. Uwe Hansmann, Pervasive Computing Handbook. The Mobile World, IEE publication 2002
5. Jochen Burkhardt, et.al. Pervasive Computing, Technology and Architecture of Mobile Internet
Applications, Addison Wesley, 2002

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering19
(Approval of Structure and Syllabus of BE CSE) Page 19 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 20 of 25

CS-419: Project-II
Teaching Scheme: Examination Scheme:
Practical: 6 Hrs/Week Term Work : 50 Marks
Pract. Exam : 100 Marks

The project will consist of the work on the topic selected for the project .The project must be done in
a group not exceeding four students.

The candidate is required to complete the implementation of the project work which was started in
Project I of last semester.

The candidate will submit project report in triplicate to head of the department.

Term Work:
The assessments of the term work should be done by two internal examiners, one of which will be
the guide and the other will be HOD or senior staff member from the department. Guidelines for the
term work and assessment shall be as described in the Project I of the same program.

Practical Examination:
Practical Examination will consist of a presentation along with actual demonstration of the project.
The said examination will be conducted by a panel of two examiners (one internal guide and one
external examiner).

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering20
(Approval of Structure and Syllabus of BE CSE) Page 20 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 21 of 25

CS-420: Lab : Soft Computing


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 8 Programs should be completed which will be based on the subject and record for the same
shall be submitted

Suggestive List of Programs –


1) Implementation of McCulloh-Pitts model with ten inputs { a1, a2, a3,…, a10}
Having weights {w1, w2, w3,…, w10 } using ∑ wiai-ө for summing unit. Calculate the
activation value x and then obtain the output signal s which is a nonlinear function, f(x). f(x)
is a binary function.
Implement NOR gate with weights { 1, 1,-1} and Bias values ө {0, -1} and NAND gates
with w1=w2= -1 ,w3=w4= 1 and ө 1= ө 2=-1, ө 3= 0 using MP-model

2) Implementation of perceptron model with 3 horizontal association units and 3 vertical


association units. Calculate the total of association units being shaded and check it against
threshold value. If it’s exact as for T image display “NO Distortions” similar for H image.
And if input is distorted display “distorted input”

3) Implement Hopfield model for characters A,B,C,D,E . Store the input patterns for these
characters. Take input from user for recall. Check it against stored patterns and give back if
match is found. Also consider the noisy inputs and calculate the percentage of error for the
noisy input patterns.

4) Implement Delta rule with two units having a1 and a2 input values assume a3=1 and w3=-T.
display iteration number along with updated weights and also display the actual output and
desired output at each iteration.
Finally it should give updated weights and with desired output gained.

5) Implement back propagation rule for a back propagation network with one input unit, one
hidden unit, and one output unit. Calculate the activation value and then the output signal for
input unit first then for hidden unit and then for output unit in forward pass. Calculate the
error and update the weights in backward pass to minimize the error.

6) Implement model for multilayer perceptron calculate the output of each output unit as O=
N3[N2[N1(I)]]

7) Study of pattern classification and pattern clustering

8) Study of ART networks

Implement above practical by using C / C++/ matlab

Practical Examination will consist of Performance and Viva-voice Examination


The assessment will be based on the following –
1. Performance in the practical examination
2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering21
(Approval of Structure and Syllabus of BE CSE) Page 21 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 22 of 25

CS-421: Lab : Professional & Cyber Ethics


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Programs should be completed which will be based on the subject and record for the same shall be submitted

Suggestive case studies:

1) The engineer and the teacher: Copyright ethics in schools and industries
2) Code blue: Patient data at a hospital is compromised
3) The New Job: Offensive graphic image appears in an office environment
4) Credit woes: A credit bureau faces a decision of whether to revise a system.

Forensic Tools:

1) Pasco and Galleta(View the contents of encrypted internet cache file and cookie file)
2) Steganography tools(Hide Text files ,Sound and image )
3) Hexdump editor(Compare two files to check whether the contents are same or
disturbed)
4) E-mail tracing with NS-Lookup, Whois, Traceroute(identification of domains,paths)
5) Encase(Analyse the hard disk drive)

Practical Examination will consist of Performance and Viva-voice Examination


The assessment will be based on the following –

1. Performance in the practical examination


2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering22
(Approval of Structure and Syllabus of BE CSE) Page 22 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 23 of 25

CS-422: Lab : Distributed Databases


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 4 Programs and one mini project should be completed which will be based on the subject and
record for the same shall be submitted

Suggestive List of Programs –

Communications among heterogeneous databases.(MS-Access,Oracle,DB2,SQL Server)

Replication and Fragmentation of data (MS-ACCESS, Oracle)

Project work covering the topics presented in syllabus

Practical Examination will consist of Performance and Viva-voice Examination


The assessment will be based on the following –

1. Performance in the practical examination


2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering23
(Approval of Structure and Syllabus of BE CSE) Page 23 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 24 of 25

CS-423: Lab : Elective-II [ Multimedia Techniques ]


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 8 programs should be completed which will be based on the subject and record for the same
shall be submitted.

Suggestive list of programs –

1. Design & Develop a program for data compression techniques


2. Design & Develop VRML program of creation of table and chair
3. Design & Develop VRML program of bouncing ball
4. Design & Develop VRML program of creation of cube
5. Design & Develop VRML program of switching on and off of bulb
6. Design & Develop VRML program of flight simulation system
7. Write assignment on MIDI
8. Write assignment on basic compression techniques
9. Design & Develop a program for interpret a file type and convert the file into another format

Practical examination will consist of Performance and Viva-voice examination


The assessment will be based on the following –

1. Performance in the practical examination


2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering24
(Approval of Structure and Syllabus of BE CSE) Page 24 of 25
(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering
(Approval of Structure and Syllabus of BE CSE) Page 25 of 25

CS-424: Lab : Elective-II [ Mobile Computing ]


Teaching Scheme: Examination Scheme:
Practical: 2 Hrs/Week Term Work : 25 Marks
Pract. Exam : 25 Marks

Minimum of 8 Programs should be completed which will be based on the subject and record for the same
shall be submitted

Suggestive List of Programs –

1) Design & Develop a program to format a text.


2) Design & Develop a program to display data in tabular format.
3) Design & Develop a program for user input and navigation between cards.
4) Design & Develop a program to handle different events.
5) Design & Develop a program to convert currency.
6) Design & Develop a program to perform validation using WML script.
7) Design & Develop a program using phone.com.
8) Design & Develop a program to connect ASP and WML.

Practical Examination will consist of Performance and Viva-voice Examination


The assessment will be based on the following –

1. Performance in the practical examination


2. Record of programs submitted by the candidate.

(17 July 2009) V Senate Item 4.e.1 Proposal from DSB in Computer Science and Engineering25
(Approval of Structure and Syllabus of BE CSE) Page 25 of 25