S4 - Rajagiri School of Engineering & Technology

COURSE HAND-OUT B.TECH. - SEMESTER IV

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Semester VI, Course Hand-Out

RAJAGIRI SCHOOL OF ENGINEERING AND TECHNOLOGY (RSET)

VISION TO EVOLVE INTO A PREMIER TECHNOLOGICAL AND RESEARCH INSTITUTION, MOULDING EMINENT PROFESSIONALS WITH CREATIVE MINDS, INNOVATIVE IDEAS AND SOUND PRACTICAL SKILL, AND TO SHAPE A FUTURE WHERE TECHNOLOGY WORKS FOR THE ENRICHMENT OF MANKIND

MISSION

TO IMPART STATE-OF-THE-ART KNOWLEDGE TO INDIVIDUALS IN VARIOUS TECHNOLOGICAL DISCIPLINES AND TO INCULCATE IN THEM A HIGH DEGREE OF SOCIAL CONSCIOUSNESS AND HUMAN VALUES, THEREBY ENABLING THEM TO FACE THE CHALLENGES OF LIFE WITH COURAGE AND CONVICTION

Department of CSE, RSET

2


DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (CSE), RSET

VISION TO BECOME A CENTRE OF EXCELLENCE IN COMPUTER SCIENCE & ENGINEERING, MOULDING PROFESSIONALS CATERING TO THE RESEARCH AND

PROFESSIONAL

NEEDS

OF

NATIONAL

AND

INTERNATIONAL

ORGANIZATIONS.

MISSION

TO INSPIRE AND NURTURE STUDENTS, WITH UP-TO-DATE KNOWLEDGE IN COMPUTER SCIENCE & ENGINEERING, ETHICS, TEAM SPIRIT, LEADERSHIP ABILITIES, INNOVATION AND CREATIVITY TO COME OUT WITH SOLUTIONS MEETING THE SOCIETAL NEEDS.


3


B.TECH PROGRAMME

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs) 1. Graduates shall have up-to-date knowledge in Computer Science & Engineering along with interdisciplinary and broad knowledge on mathematics, science, management and allied engineering to become computer professionals, scientists and researchers. 2. Graduates shall excel in analysing, designing and solving engineering problems and have life-long learning skills, to develop computer applications and systems, resulting in the betterment of the society. 3. Graduates shall nurture team spirit, ethics, social values, skills on communication and leadership, enabling them to become leaders, entrepreneurs and social reformers.

PROGRAMME OUTCOMES (POs) Graduates will be able to achieve a. An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modelling and design of computer-based systems. b. An ability to identify, analyse, formulate and solve technical problems by applying principles of computing and mathematics relevant to the problem. c. An ability to define the computing requirements for a technical problem and to design, implement and evaluate a computer-based system, process or program to meet desired needs. d. An ability to learn current techniques, skills and modern engineering tools necessary for computing practice. e. An ability to carry out experiments, analyse results and to make necessary conclusions. f. An ability to take up multidisciplinary projects and to carry out it as per industry standards. g. An ability to take up research problems and apply computer science principles to solve them leading to publications. h. An ability to understand and apply engineering solutions in a global and social context. i. An ability to understand and practice professional, ethical, legal, and social responsibilities as a matured citizen. j. An ability to communicate effectively, both written and oral, with a range of audiences. Department of CSE, RSET

4


k. An ability to engage in life-long learning and to engage in continuing professional development. l. An ability to cultivate team spirit and to develop leadership skills thereby moulding future entrepreneurs.

INDEX SCHEME: B.TECH. 4TH SEMESTER

6

EN010 401 Engineering Mathematics III

6

COURSE INFORMATION SHEET Course Plan CS010 402 Object Oriented Programming

7 10 12

COURSE INFORMATION SHEET

12

Course plan ( S4 CS A & B)

15

CS010 403 Data Structures and Algorithms

17


17

Course Plan

20

CS010 404 Communication Systems

22


22

Course plan

25

CS010 405 Microprocessor Systems

27


27

Course Plan

31

CS010 406 Theory of Computation

33


33

CS010 407 Data Structures lab

36


36

LAB CYCLE

36

CS010 408 Electronic Circuits lab

40


40

COURSE PLAN

43


5


SCHEME: B.TECH. 4TH SEMESTER (Computer Science & Engineering) Mahatma Gandhi University Revised Scheme for B.Tech Syllabus Revision 2010

Hours/Week Code EN010 401 CS010 402 CS010 403 CS010 404 (EC) CS010 405 CS010 406 CS010 407 CS010 408 (EC)

Subject

Marks Inter End-nal Sem

End-Sem duration - hours

Credits 4

L

T

P/D

2

2

-

50

100

3

3

1

-

50

100

3

2

2

-

50

100

3

4

3

1

-

50

100

3

4

Microprocessor Systems Theory of Computation Data Structures lab Electronic Circuits lab

3 3 -

1 1 -

3

50 50 50

100 100 100

3 3 3

4 4 2

-

-

3

50

100

3

2

Total

16

8

6

Engineering Mathematics III Object Oriented Programming Data Structures and Algorithms Communication Systems

4

28

EN010 401 Engineering Mathematics III Department of CSE, RSET

6


COURSE INFORMATION SHEET PROGRAMME: COURSE: Engineering Mathematics III

EN010401

COURSE CODE: REGULATION: 2010 COURSE AREA/DOMAIN: Mathematics CORRESPONDING LAB COURSE CODE (IF ANY):

DEGREE: BTECH SEMESTER: S4 CREDITS: 4 COURSE TYPE: CORE

CONTACT HOURS: 3+1 (Tutorial) hours/Week. LAB COURSE NAME:

SYLLABUS: UNIT I

II

III

IV

V

DETAILS

HOURS 12

MODULE 1 Fourier series ( 12 hours) Dirichlet conditions – Fourier series with period 2 π and 2l – Half range sine and cosine series –Harmonic Analysis – r.m.s Value MODULE 2 Fourier Transform ( 12 hours) Statement of Fourier integral theorem – Fourier transforms – derivative of transforms- convolution theorem (no proof) – Parsevals identity MODULE 3 Partial differential equations ( 12 hours) Formation by eliminating arbitrary constants and arbitrary functions – solution of Lagrange’s equation –Charpits method –solution of Homogeneous partical differential equations with constant coefficients MODULE 4 Probability distribution ( 12 hours) Concept of random variable , probability distribution – Bernoulli’s trial – Discrete distribution – Binomial distribution – its mean and variance- fitting of Binominal distribution – Poisson distribution as a limiting case of Binominal distribution – its mean and variance – fitting of Poisson distribution – continuous distribution- Uniform distribution – exponential distribution – its mean and variance – Normal distribution – Standard normal curve- its properties MODULE 5 Testing of hypothesis ( 12 hours) Populations and Samples – Hypothesis – level of significance – type I and type II error – Large samples tests – test of significance for single proportion, difference of proportion, single mean, difference of mean – chi –square test for variance- F test for equality of variances for small samples TOTAL HOURS

12

12

12

12

60

TEXT/REFERENCE BOOKS: T/R

BOOK TITLE/AUTHORS/PUBLICATION

Reference 1. Bali& Iyengar – A text books of Engg. Mathematics – Laxmi Publications Ltd. 2. M.K. Venkataraman – Engg. Mathematics vol II 3rd year part A & B – National Publishing Co. 3. I.N. Sneddon – Elements of partial differential equations – Mc Graw Hill 4. B.V. Ramana – Higher Engg. Mathematics – Mc Graw Hill 5. Richard A Johnson – Miller Fread’s probability & Statistics for Engineers- Pearson/ PHI 6. T. Veerarajan – Engg. Mathematics – Mc Graw Hill 7. G. Haribaskaran – Probability, Queueing theory and reliability Engg. – Laxmi


7


Publications 8. V. Sundarapandian - probability ,Statistics and Queueing theory – PHI 9. H.C.Taneja – Advanced Engg. Mathematics Vol II – I.K.International 10. A.K.Mukhopadhyay-Mathematical Methods For Engineers and PhysicistsI.K.International COURSE PRE-REQUISITES: C.CODE

COURSE NAME Higher Secondary Level Mathematics

EN 010 101

Engineering Mathematics I

DESCRIPTION Idea about fundamentals of calculus and Probability theory To generate concept about partial differentiation and integration.

SEM

1

COURSE OBJECTIVES:

Apply standard methods of mathematical &statistical analysis COURSE OUTCOMES: SNO

DESCRIPTION

PO MAPPING

1

Graduates will develop a thorough knowledge of fourier series, and its applications in engineering.

2

Graduates will develop a thorough knowledge of fourier transform, properties of transforms and its applications in engineering. Graduates will be able to have a thorough knowledge in partial differential equations and applications

3

4

Graduates will be able to understand basics of probability theory and applications

5

Graduates will be able to understand the fundamentals of testing and its scope and applications.

GAPES IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS: SNO

1 2 3 4

DESCRIPTION

Application of ordinary differential equation in Engineering disciplines Theory and concept Partial differential equations ANOVA test, Analysis of variance Characteristics of good estimation

PROPOSED ACTIONS

Assignments Lectures Lectures Discussion

PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN: 1 Module I Finding the application of fourier series in different branches of engineering. 2 Module II Finding the application of fourier transform in different branches of engineering. 3 ModuleIII Importance of Partial Differential Equations in Engineering. 4 Module IV


8


5

Application of Probability theory in different branches of engineering. Module V Applications of testing and hypothesis in different branches of engineering.

WEB SOURCE REFERENCES: 1 1. en.wikipedia.org/wiki/Fourier_series,

mathworld.wolfram.com › Calculus and

Analysis › Series › Fourier Series , www.fourier-series.com 2 o 3

4 o 5

en.wikipedia.org/wiki/Fourier_transform, mathworld.wolfram.com › ... › Integral Transforms › Fourier Transforms , www.thefouriertransform.com/ en.wikipedia.org/wiki/Partial_differential_equation, www.math.umn.edu/~olver/pdn.html, mathworld.wolfram.com › ... › Partial Differential Equations en.wikipedia.org/wiki/Probability_distribution, www.itl.nist.gov/div898/handbook/eda/section3/eda36.htm

en.wikipedia.org/wiki/Statistical_hypothesis_testing , www.sagepub.com upm-data hapter .pdf

DELIVERY/INSTRUCTIONAL METHODOLOGIES: ☐ CHALK & TALK

☐ STUD. ASSIGNMENT

☐ WEB RESOURCES

☐ LCD/SMART BOARDS

☐ STUD. SEMINARS

☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT ☐ ASSIGNMENTS

☐ STUD. SEMINARS

☐ TESTS/MODEL EXAMS

☐ UNIV. EXAMINATION

☐ STUD. LAB PRACTICES

☐ STUD. VIVA

☐ MINI/MAJOR PROJECTS

☐ CERTIFICATIONS

☐ ADD-ON COURSES

☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT ☐ ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE) ☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by Murali T.K by (Faculty)


☐ STUDENT FEEDBACK ON FACULTY (TWICE) ☐ OTHERS

Approved (HOD)

9


Course Plan Engineering Mathematics III Hour 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

Module 1 1 1 1 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5

Syllabus Fourier series intoduction General case problems fourier series expansin half range sine series.cosine series harmonic analysis r m s values more problems fourier series problems Staement -fourier integral theorem fourier transforms fourier transforms Derivative of transforms convolution and Parrsevals identity formation of partial differential equations Lagranges equations Charpits method Solution of homogeneous P D E with constant co efficent Charpits method Solution of homogeneous P D E with constant co efficent Revision INTRODUCTION TO PROBABILITY BINOMIAL DISTRIBUTION- DEF, MEAN, VARIENCE BINOMIAL DISTRIBUTION PROBLEMS POISSON DISTRIBUTION P.D LIMITING CASE OF B.D NORMAL DISTRIBUTION - DEF NORMAL DISTRIBUTION - PROBLEMS STANDARD NORMAL DISTRIBUTION FITTING OF BD AND PD POPULATION AND SAMPLES SAMPLING DISTRIBUTION OF MEAN - S.D KNOWN S.D OF VARIENCE - CHI SQUARE DISTRIBUTION F DISTRIBUTION POINT ESTIMATION CONFIDENCE INTERVAL FOR MEAN S.D KNOWN CONFIDENCE INTERVAL FOR MEAN S.D UNKNOWN CONFIDENCE INTERVAL FOR VARIENCE TESTING OF HYPOTHESIS TESTING OF MEAN OF POPULATION TESTING OF MEAN WHEN SD KNOWN DIFFERENCE BETWEEN MEAN TESTING OF ONE VARIENCE, TWO VARIENCE TESTING OF SINGLE PROPORTION AND DIFFERENCE OF PROPORTION SAMPLING DISTRIBUTION OF MEAN S.D KNOWN S.D OF VARIENCE


10


47 48 49 50 51 52 53 54 55

5 5 5 5 5 5 5 5 5

F DISTRIBUTION ESTIMATION OF PARAMETERS POINT ESTIMATION CONFIDENCE INTERVAL FOR MEAN-S.D KNOWN CONFIDENCE INTERVAL FOR MEAN -S.D UNKNOWN CONFIDENCE INTERVAL FOR VARIENCE TESTING OF HYPOTHESIS TESTING OF MEAN OF POPULATION TESTING OF MEAN WHEN SD KNOWN & UNKNOWN


11


CS010 402 Object Oriented Programming COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE AND ENGINEERING COURSE: OBJECT ORIENTED PROGRAMMING COURSE CODE: CS010 402 REGULATION:2010 COURSE AREA/DOMAIN: PROGRAMMING,DATA STRUCTURES AND ALGORITHM CORRESPONDING LAB COURSE CODE (IF ANY):NIL

DEGREE: BTECH

YEAR: JAN 2014 – JUNE 2014

SEMESTER: FOUR CREDITS: 4 COURSE TYPE: CORE CONTACT HOURS: 3+1 (Tutorial) hours/Week. LAB COURSE NAME:NIL

SYLLABUS: UNIT

DETAILS

I

Introduction to OOP - Evolution of object oriented languages - Need of Objects Definition of Object-Oriented Language – Classes and Objects – Creating and Using Classes and objects – Member functions and variables – Constructors –multiple and parameterized constructors copy constructors –constructors with default arguments- Destructors. Inheritance and Access Control - Member access control in classes – Friend functions and classes – Extending classes - Public Private and Protected Inheritance – Classification of Inheritance – Single – Multiple – Multilevel – Hierarchical – Hybrid.. Polymorphism – Runtime and compile time polymorphism – overloading functions and operators – selecting friend member function for operator overloading - Virtual methods – pure virtual methods – Abstract classes - applications of abstract classes. Virtual Destructors – Virtual Base Classes - Template- class templates and function templates- Creating and using templates – Namespaces-Dynamic Objects - Dynamic object allocation - Inline functions. Exception Handling-basics of exception handling-exception handling mechanism- Throwing and Catching Mechanism-Rethrowing and Specifying exceptions.

II

III

IV

HOURS 8

13

14

13

12

V Data file operations –opening and closing files-reading and writing from file-Classes and file operations-Other object oriented languages – Java – Object oriented features in Java – Comparison with C++-Object oriented system development-object oriented notations and graphs- object oriented analysis-object oriented design. TOTAL HOURS

TEXT/REFERENCE BOOKS: T/R BOOK TITLE/AUTHORS/PUBLICATION R 1.Robert Lafore :Object Oriented Programming

60

in C ++, 3rd Edition, Galgotia Pub,

New Delhi R

2. E. Balaguruswamy : Object oriented Programming with C++,2nd Edition, Tata McGraw Hill, New Delhi, 2004

R

3. Dilkeshwar Pandey,Upendra K Tiwari, Object Oriented Programming with Java, Acme Learning (Module V), New Delhi ,2010

R

4. D Ravichandran: Programming with C++ , 3rd Edition ,Tata McGraw Hill, New Delhi

R

5. Bjarne Stroustrup , The C++ Programming Language, 3rd Edition..,

R

6. Randal Albert, Todd Breedlove: C++ ,An Active Learning Approach, Jones And Bartlett Publishers, New Delhi ,2010


12


R

7. Deitel & Deitel, C++ How To Program, Introducing Object-Oriented Design with the UML, 3rd Edition Pearson

R

8. Matt Weisfeld: The Object Oriented Thought Process ,3rd Edition,Pearson Education, New Delhi ,2009

R

9. Jyoti Singh: Object Oriented Systems & Concepts of C++; Acme Learning, New Delhi,2010

R

10. Poornachandra Sarang: Object Oriented Programming with C++, 2nd Edition, PHI, New Delhi,2009

R

11. R. Rajaram, Object Oriented Programming and C++,2nd Edition,,New Age International Publishers, New Delhi,2007

R

12. E. Balaguruswamy, Programming with Java, 2nd Edition, Tata McGraw Hill, New Delhi

R

13.Bhushan Trivedi, Programming with Ansi C++ ,Oxford Higher Education, New Delhi,2007 Syllabus - B.Tech. Computer Science and Engg.

COURSE PRE-REQUISITES: C.CODE COURSE NAME C010303 Problem Solving and Computer Programming

DESCRIPTION Basic Concepts of C language

SEM S3

COURSE OBJECTIVES: 1 To impart the basic concepts of object oriented programming in C++. 2

To provide sufficient knowledge about developing real world projects with object oriented concept.

COURSE OUTCOMES: SNO

1 2 3 4 5

DESCRIPTION

PO MAPPING

Ability to describe the concepts of object-oriented programming Ability to apply the concepts of data encapsulation, inheritance, and polymorphism to large-scale software Ability to handle exceptions in programs Ability to construct appropriate diagrams and textual descriptions to communicate the static structure and dynamic behavior of an object oriented solution

c,d,e a,c,d,e

Ability to design and develop Object Oriented systems

a,b,c

a,c,d,e b,c,d

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS: SNO

1 2

DESCRIPTION

Practical session for implementing the object oriented concepts Implementation of Object oriented concepts in various object Oriented languages(JAVA)

PROPOSED ACTIONS

PO MAPPING

Tutorial Tutorial

c,e c,d


TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:


13


1

Practical Implementation of object Oriented System

e,f

WEB SOURCE REFERENCES:

1

http://www.codeproject.com/Articles/22769/Introduction-to-Object-Oriented-ProgrammingConcep http://www.youtube.com/watch?v=q5EIJHe0mjw (video lecture) http://www.w3schools.in/cplusplus/intro/

2

DELIVERY/INSTRUCTIONAL METHODOLOGIES: 

CHALK & TALK





LCD/SMART BOARDS



STUD. ASSIGNMENT STUD. SEMINARS



WEB RESOURCES

☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT 

ASSIGNMENTS






☐ ADD-ON COURSES

STUD. SEMINARS STUD. VIVA

 

TESTS/MODEL EXAMS MINI/MAJOR PROJECTS



UNIV. EXAMINATION

☐ CERTIFICATIONS

☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT  

ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE) ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by by Santhosh K M




STUDENT FEEDBACK ON FACULTY (ONCE)

☐ OTHERS

Approved Mr. Ajith S (HOD)

14


CS010 -402 Object Oriented Programming Course plan ( S4 CS A & B)

Faculty: Santhosh K M Lecture No

Module

Topics

1

1 Introduction to OOP

2

1 Introduction to OOP

3

1 Need of Objects - Definition of Object-Oriented Language – Classes and Objects

4

1

5

1 Creating and Using Classes and objects – Member functions and variables

6

1 Constructors –multiple and parameterized constructors

7

1 copy constructors –constructors with default arguments- Destructors.

8

2 Inheritance and Access Control

9

2 Member access control in classes

Classes and Objects

10

2 Friend functions and classes

11

2 Extending classes

12

2 Public Private and Protected Inheritance

13

2 Classification of Inheritance

14

2 Classification of Inheritance

15

3 Polymorphism – Runtime and compile time polymorphism

16

3 overloading functions and operators

17



15


18


19


20

3 Virtual methods – pure virtual methods

21

3 Abstract classes - applications of abstract classes

22

4 Virtual Destructors – Virtual Base Classes

23

4 Template- class templates and function templates-

24

4 Template- class templates and function templates-

25

4 Namespaces-Dynamic Objects - Dynamic object allocation

26

Inline functions. Exception Handling-basics of exception handling-exception 4 handling mechanism

27

4 Throwing and Catching Mechanism-Rethrowing and Specifying exceptions.

28

5 Data file operations –opening and closing files-reading and writing from file

29

5 Classes and file operations

30

5 object oriented languages – Java – Object oriented features in Java –

31

5 Comparison with C++-Object oriented system development

32

5 object oriented notations and graphs-object oriented analysis

33

5 object oriented design.


16


CS010 403 Data Structures and Algorithms COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING COURSE: DATASTRUCTURES AND ALGORITHMS COURSE CODE: CS010 403 COURSE AREA/DOMAIN: PROGRAMMING , DATA STRUCTURES AND ALGORITHMS CORRESPONDING LAB COURSE CODE (IF ANY): CS010 407

DEGREE: BTECH YEAR: JAN 2014 – JUNE 2014 SEMESTER: IV CREDITS: 4 COURSE TYPE: CORE /ELECTIVE / BREADTH/ S&H CONTACT HOURS: 3+1 (Tutorial) hours/Week. LAB COURSE NAME: DATA STRUCTURES LAB

SYLLABUS: UNIT I

II

III

IV Trees

V

DETAILS

HOURS

Principles of programming – System Life Cycle - Performance Analysis and Measurements- Time and Space complexity-Complexity calculation of simple algorithms. Hashing:- Static Hashing-Hash Tables-Different Hash Functions-Mid Square- DivisionFolding-Digit Analysis, Collision-Collision Resolution Techniques. Study of basic data structures – Arrays- Structures-Sparse matrix – Stacks – QueuesCircular queues- Priority queues - Deque. Evaluation of expressions – Polynomial representation using arrays. Linked Lists - Linked stacks and queues - Doubly linked lists – Polynomial representation using linked lists, Garbage collection and Compaction - Binary Trees – Tree Traversal – Inorder - Preorder and Postorder, Search trees - AVL Trees, height balanced trees, Multiway search Trees- B Trees-B+ Trees. Graphs – Depth first and breadth first search. Sorting methods: Selection sort, Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort, External sorting methods. TOTAL HOURS

10 12

12

14

12 60

TEXT/REFERENCE BOOKS: T/R 1

2 3

4

5 6

7

8 9


Horowitz ,Sahni & Anderson Freed, Fundamentals of Data Structures in C, 2nd ed., Universities Press, Hyderabad, 2009 Rajesh K Shukla, Data Structures Using C & C++ ,Wiley India, New Delhi, 2009 Yedidyah Langsam, Moshe J Augenstein, Aron M Tenenbaum, Data Stuctures using C and C++, 2 nd ed., PHI Learning Private Limited, New Delhi, 1996 G. A. V Pai, Data Structures and Algorithms Concepts, Techniques and Applications, Tata McGraw Hill , New Delhi, 2008 G. S Baluja, Data Structures Through C, Dhanpat Rai & Co. , New Delhi, 2009 Sartaj Sahni , Data Structures, Algorithms and Applications in C++ , 2nd ed., Universities Press, Hyderabad, 2009 Michael T Goodrich, Roberto Tamassia, David Mount, Data Structures and Algorithms in C++, Wiley India Edition, New Delhi, 2009 B.M. Harwani, Data Structures and Algorithms in C++, Dreamtech Press, New Delhi, 2010 Brijendra Kumar Joshi, Data Structures and Algorithms in C, McGraw Hill , New Delhi, 2010


17


10 11 12 13 14 15 16 17

K R Venugopal, K G Srinivasa, P M Krishnaraj, File Structures using C++, McGraw Hill , New Delhi, 2009 ISRD Group, Data Structures using C, McGraw Hill , New Delhi, 2010 Sudipta Mukherjee, , Data Structures using C 1000 Problems and Solutions, Tata McGraw Hill , New Delhi, 2010 Seymour Lipschutz, Data Structures with C, Schaum’s Outlines, McGraw Hill , New Delhi, 2010 R Krishnamoorthy & G Indirani Kumaravel, Data Structures using C, McGraw Hill , New Delhi, 2008 John R Hubbard, Data Structures with C++, Schaum’s Outlines, Tata McGraw Hill , New Delhi, 2010 Jean Paul Tremblay & Paul G Sorenson, An Introduction to Data Structures with Applications, 2nd ed., Tata McGraw Hill , New Delhi, 2010 Seymour Lipschutz, Data Structures , Schaum’s Outlines, Tata McGraw Hill , New Delhi, 2006

COURSE PRE-REQUISITES: C.CODE CS010 303

COURSE NAME Problem Solving and Computer Programming

DESCRIPTION Programming skills

SEM III

COURSE OBJECTIVES: 1 To impart the basic concepts of data structures and algorithms 2

To develop understanding about writing algorithms and step by step approach in solving problems with the help of fundamental data structures

COURSE OUTCOMES: SNO 1 2 3 4 5

DESCRIPTION Graduates will gain basic ability to analyze algorithms and to determine algorithm correctness. Graduates will have knowledge of basic data structures. Graduates will understand how abstract data structures such as stack, queue and linked list can be used to manage the memory using static and dynamic allocations. Graduates will understand and distinguish the conceptual and applicative differences in trees and graphs. Graduates will have knowledge of different sorting methods

PO MAPPING a,b a,b,e a,b,e a,b,e a,b,e


1 2

DESCRIPTION

PROPOSED ACTIONS

Dynamic Storage Management Connected Components

Reading Assignment Reading Assignment

PO MAPPING

a,b a,b


TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN: SNO

1 2

DESCRIPTION

Spanning Trees Counting Binary Trees

PO MAPPING

a,b a,b

WEB SOURCE REFERENCES: 1 http://www.cs.cmu.edu/ 2 http://www.sorting-algorithms.com/ 3 http://www.cs.rit.edu/atk/Java/Sorting/sorting.html 4 http://www.memorymanagement.org/glossary/g.html 5 http://www.ics.uci.edu 6 http://www.technion.ac.il


18


DELIVERY/INSTRUCTIONAL METHODOLOGIES: 

CHALK & TALK LCD/SMART BOARDS

 STUD. ASSIGNMENT STUD. SEMINARS

 WEB RESOURCES ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT  ASSIGNMENTS  STUD. LAB PRACTICES ADD-ON COURSES

STUD. SEMINARS  STUD. VIVA OTHERS

 TESTS/MODEL EXAMS MINI/MAJOR PROJECTS

 UNIV. EXAMINATION CERTIFICATIONS

ASSESSMENT METHODOLOGIES-INDIRECT 


Prepared by by Ms. Sminu Izudheen



STUDENT FEEDBACK ON FACULTY (TWICE)

OTHERS

Approved

Mr. Ajith S (H.O.D)


19


Course Plan Subject

:

Instructor Hour No.

Data Structures and Algorithms (CS010 403) :

Module

Sminu Izudheen

Topics to be covered

1

Principles of programming – System Life Cycle - Performance Analysis and Measurements - Space complexity

2

Time complexity, Problems with Time complexity

3

Problems with Time complexity

4

Asymptotic Notation

5

I

Complexity calculation of simple Algorithms

6

Sparse matrix representation, addition

7

Space matrix multiplication, Polynomial representation

8

II

Stacks and Queues

9

Circular Queue, Priority Queue

10

D Queue

11

Singly Linked List Implementation

12

Linked Stack and Queues

13

Doubly Linked List

14

III

Applications

15

Circular Linked List, Polynomial Representation using Linked List

16

Sorting – Selection Sort, Bubble Sort

17

Insertion Sort

18

Quick Sort

19

V

Merge Sort

20

Merge Sort

21

Radix Sort


20


22

External sorting methods

23

Introduction to Trees, Traversals

24

Binary tree- Insertion

25

Binary tree- Deletion

26

IV

Binary Search tree , Searching

27

Insertion and Deletion on Binary Search tree

28

Balanced tree – AVL tree

29

Balancing a AVL tree

30

Insertion into AVL tree

31

B-Trees

32

B+-Trees

33

Heap Sort

34

Heap Sort

35

Introduction to graphs, application

36

Graph traversals - DFS

37

Graph traversals - BFS

38

I

39 40

Hashing – Hash functions Collision Resolution

III

Dynamic Memory Management

41

Storage Allocation Garbage collection

42

Compaction


21


CS010 404 Communication Systems COURSE INFORMATION SHEET PROGRAMME: UG COURSE: COMMUNICATION SYSTEMS COURSE CODE: CS010 404 REGULATION: COURSE AREA/DOMAIN: COMMUNICATION CORRESPONDING LAB COURSE CODE (IF ANY): CS010 408(EC)

DEGREE: BTECH SEMESTER: 4 CREDITS: 4 COURSE TYPE: CORE CONTACT HOURS: 3+1 (Tutorial) hours/Week. LAB COURSE NAME: ELECTRONIC CIRCUITS AND COMMUNICATION LAB

SYLLABUS: UNIT DETAILS I Introduction to Signals:- Continuous Time Signals- Discrete Time Signals- Signal Operations- Properties of Signals(Periodicity and Symmetry), Frequency Domain Representation of Continuous Time Signals-Continuous Time Fourier Series(CTFS)Definition- properties- Examples, Continuous Time Fourier Transform(CTFT)Definition- Properties – Examples- Concept of Frequency Spectrum, Sampling- The Sampling Theorem(proof not required)- Quantisation II Communication Systems:- Architecture of a Typical Communication System – Basic problems in Signal Transmission - Noise – Types of Noise- Internal and External Noise, Cross Talk- Typical parameters of Communication Systems- Signal propagation Delay, Signal to Noise Ratio, Attenuation, Bandwidth Communication Channels:- Twisted Pairs- Coaxial Cables- Fiber Optic Cables- Capacity of a Noisy Channel- Shannon Hartley Theorem III Modulation- Need for Modulation Analog Modulation- Types of analog modulation- Amplitude Modulation, Frequency modulation, Phase modulation, Pulse Modulation Schemes- Pulse Amplitude modulation(PAM), Pulse Width Modulation(PWM), Pulse Position Modulation(PPM), Pulse Code Modulation(PCM),Delta modulation, Sample problems based on different modulation methods. Digital modulation;- Amplitude Shift Keying(ASK), Frequency Shift keying(FSK),Phase Shift Keying(PSK), Quadrature Amplitude modulation (QAM), Differential Phase Shift Keying(DPSK) IV Multiplexing:-Time Division Multiplexing(TDM)- Frequency Division Multiplexing(FDM)- Wavelength Division multiplexing(WDM) Switching:- Circuit, Packet and Message Switching Schemes, Case Study:SONET( Basic ideas only)- Datagrams and virtual Circuits Digital Transmission:- Analog to Digital Converter(ADC), Serial and parallel Transmission- Simplex, Half Duplex and Full Duplex Transmissions. V Error Correction and Detection;- Line Coding Schemes- Block Coding- Convolution Coding- Hamming Codes Transmission Codes:- Different Character Codes- ASCII, EBCDIC, Baudot Code, Bar Coding, Parity Coding TOTAL HOURS

HOURS 15

12

15

8

10

60

TEXT/REFERENCE BOOKS:


22


T/R 1. 2. 3. 4. 5. 6. 7. 8.

BOOK TITLE/AUTHORS/PUBLICATION S. Haykin and B. V. Veen, Signals and Systems, John Wiley & Sons, N. Y., 2002 George Kennedy, Bernard Davis - Electronic Communication Systems-Tata McGraw Hill Behrouz Forouzan- Data Communication and Networking- Tata McGraw Hill Michael J Roberts, Govind Sharma- Fundamentals of Signals and Systems-Tata McGraw Hill William Stallings- Data and Computer Communications- Prentice Hall of India Fred Halsall- Digital Communication, Computer Networks and Open Systems Pearson Education Taub and Schilling – Principles of Communication Systems- Tata McGraw Hill Kolimbiris H.- Digital Communication Systems- Pearson Educatio

COURSE PRE-REQUISITES: C.CODE

EN 010 101 EN010401

COURSE NAME Engineering Mathematics I

Engineering Mathematics III

DESCRIPTION

SEM

Solving Maths Equation About Fourier Transform and Fourier Series

1 4

COURSE OBJECTIVES: 1 To introduce the fundamentals of Analog and Digital Signals ,their properties and introduce the relevant transforms used in Communication. 2 To familiarize the core ideas of Communication Engineering which in turn adds to the study of Computer Communication COURSE OUTCOMES: SNO 1 2 3

DESCRIPTION

Students will get the basic idea about what is signal and different types of signal, which become easy for them to understand in lab. About communication, how communication takes place and what all interference take place and different types of measurement methods. The various applications and fields where the communication system are used and applied are discussed and shown to the students in detail, thus makes them aware about the vastness and application range of communication systems

PO MAPPING a, e, a, e, g a, b, e,

GAPES IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS: SNO

DESCRIPTION

PROPOSED ACTIONS

1 PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN: 1 2 WEB SOURCE REFERENCES: 1 Nil DELIVERY/INSTRUCTIONAL METHODOLOGIES: ☐ CHALK & TALK

☐ STUD. ASSIGNMENT

☐ WEB RESOURCES


☐ STUD. SEMINARS

☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT


23


☐ ASSIGNMENTS

☐ STUD. SEMINARS

☐ TESTS/MODEL EXAMS

☐ UNIV. EXAMINATION


☐ STUD. VIVA


☐ CERTIFICATIONS

☐ ADD-ON COURSES

☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT ☐ ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE)

☐ STUDENT FEEDBACK ON FACULTY (TWICE)

☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

☐ OTHERS

Prepared by by (Faculty) Abhishek Viswakumar


Approved (HOD)

24


Course plan

Module - 1 1. Introduction to Signals:- Continuous Time Signals- Discrete Time Signals 2. Signal Operations- Properties of Signals 3. Frequency Domain Representation of Continuous Time Signals 4. Continuous Time Fourier Series(CTFS) - Definition 5. CTFS Properties 6. Continuous Time Fourier Transform(CTFT)- Definition 7. CTFT Properties 8. Concept of Frequency Spectrum 9. Sampling- The Sampling Theorem 10. Quantisation Reference – 1,4

Module – 2 11. Communication Systems:- Architecture of a Typical Communication System 12. Basic problems in Signal Transmission 13. Noise – Types of Noise 14. Internal and External Noise 15. Cross Talk 16. Typical parameters of Communication Systems 17. Signal propagation Delay, Signal to Noise Ratio, Attenuation, Bandwidth 18. Communication Channels:- Twisted Pairs 19. Coaxial Cables 20. Fiber Optic Cables 21. Capacity of a Noisy Channel- Shannon Hartley Theorem Reference – 2,3 Module – 3

22. Modulation- Need for Modulation 23. Analog Modulation 24. Types of analog modulation- Amplitude Modulation, Frequency modulation 25. Phase modulation, Pulse Modulation Schemes 26. Pulse Amplitude modulation(PAM), Pulse Width Modulation(PWM) 27. Pulse Position Modulation(PPM), Pulse Code Modulation(PCM) 28. Delta modulation 29. Digital modulation;- Amplitude Shift Keying(ASK) 30. Frequency Shift keying(FSK),Phase Shift Keying(PSK) 31. Quadrature Amplitude modulation (QAM), Differential Phase Shift Keying(DPSK) Reference – 2, 3, 5 Department of CSE, RSET

25


Module 4: (8 Hrs)

32. Multiplexing:-Time Division Multiplexing(TDM) 33. Frequency Division Multiplexing(FDM) 34. Wavelength Division multiplexing(WDM) 35. Switching:- Circuit, Packet and Message Switching Schemes 36. Case Study:- SONET( Basic ideas only)- Datagrams and virtual Circuits Digital Transmission:- Analog to Digital Converter(ADC), Serial and parallel Reference – 2, 3, 5, 7, 8 Module 5: (10 Hrs)

37. Error Correction and Detection;- Line Coding Schemes- Block Coding 38. Convolution Coding- Hamming Codes 39. Transmission Codes:- Different Character Codes- ASCII, EBCDIC, 40. Baudot Code, Bar Coding, Parity Coding Reference – 3, 6, 8

Reference Books

1. S.Haykin and B. V. Veen, Signals and Systems, John Wiley & Sons, N. Y., 2002

2. George Kennedy, Bernard Davis - Electronic Communication Systems-Tata McGraw Hill 3. Behrouz Forouzan- Data Communication and Networking- Tata McGraw Hill 4. Michael J Roberts, Govind Sharma- Fundamentals of Signals and Systems-Tata McGraw Hill 5. William Stallings- Data and Computer Communications- Prentice Hall of India 6. Fred Halsall- Digital Communication, Computer Networks and Open Systems Pearson Education 7. Taub and Schilling – Principles of Communication Systems- Tata McGraw Hill 8. Kolimbiris H.- Digital Communication Systems- Pearson Education


26


CS010 405 Microprocessor Systems COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING COURSE: MICROPROCESSOR SYSTEMS COURSE CODE: CS010 405 COURSE AREA/DOMAIN: COMPUTER HARDWARE CORRESPONDING LAB COURSE CODE (IF ANY): CS010 508

DEGREE: BTECH YEAR: JAN 2014 – JUNE 2014 SEMESTER: IV CREDITS: 4 COURSE TYPE: CORE CONTACT HOURS: 3+1 (Tutorial) hours/Week. LAB COURSE NAME: HARDWARE AND MICROPROCESSOR LAB

SYLLABUS: UNIT DETAILS I Architecture of 8085 – Registers. Instruction set of 8085 - Instruction Types – Arithmetic – Logic data transfer, Branch, Stack, I/O and Machine Control instructions - Addressing Modes - Direct and Indirect Addressing - Immediate Addressing - Implicit Addressing

HOURS

10 II Subroutines - Stack Operations - Call Return sequence- Programming Examples. Timing and control unit – The fetch operation – Machine cycle and T- State instruction and data flow. Address space partitioning - Memory mapped I/O - I/O mapped I/O 12 III Interrupts of 8085 - Hardware & Software Interrupts – Enabling, Disabling and masking of interrupts – Polling – HALT & HOLD states – Programmable interrupt controller – 8259.

14

IV Data transfer schemes - Programmed data transfer - synchronous and asynchronous transfer - interrupt driven data transfer – DMA data transfer. Study of Interfacing ICs – 8257,8255 programmable peripheral interface (compare it with 8155).

12

V Programmable interval timer 8253, 8251 -,Interfacing Keyboard and display devices, Hardware and Software approach – USART 8251. (interfacing chips functions and internal block diagram only).

TOTAL HOURS


12 60

27


TEXT/REFERENCE BOOKS: T/R BOOK TITLE/AUTHORS/PUBLICATION T Gaonkar -Microprocessor Architecture, Programming and Applications with the 8085 - New Age International T Renu Singh, B. P. Singh -Microprocessors, interfacing and Applications New Age InternationalThird Edition T N K Srinath -8085 Microprocessors programming and interfacing - PHI R Adithya P. Mathur -Introduction to Microprocessors Systems - PHI R KK Tripathi, Rajesh K Gangwar -Microprocessorand its Applications -Acme learning R R.Theagarajan,S.Dhanasekaran,S.Dhanapal –Microprocessor and ITS Applications New Age International R N Senthil Kumar,M saravanan,s.jeevananthan-Microprocessor and microcontrollers -Oxford higher education COURSE PRE-REQUISITES: C.CODE COURSE NAME CS010 304 Computer Organization

CS010 305

Switching Theory and Logic Design

DESCRIPTION In-depth study of the basics of memory, CPU arithmetic and processor organization Basics of logic gates and small ALU components

SEM III

III

COURSE OBJECTIVES: 1 To impart the basic concepts of microprocessors and interfacing concepts. 2

To develop an understanding about the assembly level programming.


DESCRIPTION

Graduates will have fundamental knowledge about the architecture of 8085 microprocessor Graduates will be able to choose appropriate addressing modes and instructions for writing programs Graduates will be able to write 8085 assembly language programs for solving a given problem Graduates will understand the need for using peripheral devices for the efficient operation of an 8085 processor based system Graduates will understand the architecture of various interfacing ICs and how they can be used along with 8085

PO MAPPING d c, e b, c, d,e a, c a, d

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS: SNO DESCRIPTION PROPOSED ACTIONS PO MAPPING 1 History of Computers An introductory class c


28


2 Counters and Time Delays Additional Session on the topic b, e 3. Code conversion Programs Tutorial b, e PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/NPTEL videos etc.. TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN: SNO DESCRIPTION 1 Future of Microprocessors Reading Assigments ( Shekhar Borkar and Andrew A. Chien, “The Future of Microprocessors”, Communications of the ACM, DOI 10.1145/1941487.1941507) 2 Familiarization 8085 Simulators like GNUSIM8085, MSIM etc...

PO MAPPING d

d

WEB SOURCE REFERENCES: 1 http://www.abandah.com/gheith/wp-content/uploads/2011/02/8251A-Datasheet.pdf 2 http://pdf1.alldatasheet.com/datasheet-pdf/view/66098/INTEL/8253.html 3 http://pdos.csail.mit.edu/6.828/2010/readings/hardware/8259A.pdf 4 http://pdf1.alldatasheet.com/datasheet-pdf/view/66109/INTEL/8279.html 5 http://www.csee.umbc.edu/~cpatel2/links/310/data_sheets/8255.pdf 6 http://pdf1.alldatasheet.com/datasheet-pdf/view/127002/INTEL/8257.html 7 http://www.computersciencelab.com/ComputerHistory/History.htm DELIVERY/INSTRUCTIONAL METHODOLOGIES: m. CHALK & TALK n. STUD. o. WEB RESOURCES  STUD. LAB ASSIGNMENT PRACTICES p. LCD/SMART STUD. SEMINARS ADD-ON COURSES BOARDS ASSESSMENT METHODOLOGIES-DIRECT  ASSIGNMENTS  ASKING QUESTIONS DURING LECTURE HOURS  MID SEM  UNIVERSITY EXAMINATION EXAMINATION ADD-ON OTHERS COURSES

ASSESSMENT METHODOLOGIES-INDIRECT ASSESSMENT OF COURSE OUTCOMES (BY FEEDBACK, ONCE) ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS


 CLASS TESTS

 END SEM EXAMINATION

MINI/MAJOR PROJECTS

CERTIFICATIONS

 STUDENT FEEDBACK ON FACULTY (ONCE) OTHERS

29


Prepared by Ms. Shimmi Asokan


Approved by Mr. Ajith S (H.O.D)

30


RAJAGIRI SCHOOL OF ENGINEERING & TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING CS 010405 MICROPROCESSOR SYSTEMS

Course Plan Lecture No. Lecture Content Assignment Test 1 Historical Background of Microprocessor 2 Introduction to Microprocessor 3 Introduction to 8085 4 Architecture of 8085 5 6 Pin Diagram 7 Programming Model 8 Data transfer instructions 9 10 Arithmetic instructions 11 12 Logical instructions 13 14 Branch & Machine control instructions 15 Addressing Modes Assignment 1 16 8085 Programming 17 18 Stack & Subroutines - Instructions 19 Class Test 20 Call Return sequence 21 22 Fetch operation – instruction and data flow Machine cycle and T- State

23 Timing Diagram Programming Assignment 24 25 Memory mapped I/O - I/O mapped I/O 26 27 Tutorial 2 28 Interrupts of 8085 - Hardware & Software Interrupts 29 Enabling, Disabling and masking of interrupts 30 Polling 31 HALT & HOLD states 32 Programmable interrupt controller – 8259

33 34 35 Programmed data transfer, synchronous and asynchronous transfer 36 Interrupt driven data transfer, DMA data transfer 37 Study of 8257

38 Department of CSE, RSET

31


39 8255 programmable peripheral interface 40 Comparison of 8255 with 8155 Assignment 2 41 Programmable interval timer 8253 42 Interfacing Keyboard and display devices, 43 Hardware and Software approach 44 45 USART 8251 46 Prepared By Ms. Shimmi Aokan


32


CS010 406 Theory of Computation COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING COURSE: THEORY OF COMPUTATION COURSE CODE: CS010-406 COURSE AREA/DOMAIN: MATHEMATICAL FOUNDATIONS AND COMPUTING CORRESPONDING LAB COURSE CODE (IF ANY):NIL

DEGREE: BTECH YEAR: JAN 2013 – JUNE 2013 SEMESTER: IV CREDITS: 4 COURSE TYPE: CORE /ELECTIVE / BREADTH/ S&H CONTACT HOURS: 3+1 (Tutorial) hours/Week. LAB COURSE NAME: NIL

SYLLABUS: UNIT I

DETAILS

HOURS

Proving techniques-Mathematical induction -Diagonalization principle –Pigeonhole principle- Functions – Primitive recursive and partial recursive functions – Computable and non computable functions—-Formal representation of languages – Chomsky Classification. II

III

Introduction to Automata theory – Definition of Automation – Finite Automata –Language acceptability by Finite Automata –Deterministic and Nondeterministic finite automationRegular Expressions – -Transitions –Conversion of NFA to DFA - Minimisation of DFA-DFA to Regular Expressions conversion-pumping lemma for regular languages – Applications of finite automata-NFA with o/p ( moore /mealy) Context Free Grammar –Simplification of CFG-Normal forms-Chomsky Normal form and Greibach Normal form- pumping lemma for Context free languages- Applications of PDA -Pushdown Automata – Formal definition – Language acceptability by PDA through empty stack and final state – Deterministic and nondeterministic PDA – designing of PDA-

10

13

12

IV

Turing Machines – Formal definition – Language acceptability by TM –TM as acceptors, Transducers - designing of TM- Two way infinite TM- Multi tape TM - Universal Turing Machines- Church’s Thesis-Godelization.- - Time complexity of TM - Halting Problem Rice theorem - Post correspondence problem-Linear Bounded Automata.

13

V

Complexity classes- Tractable problems– Class P –P Complete-Reduction problemContext grammar nonempty-Intractable problems- Class NP – NP Complete- Cooks theorem-Reduction problems-SAT-Clique-Hamiltonian-TSP-Vertex Cover-NP Hard problems.

12

TOTAL HOURS

60

TEXT/REFERENCE BOOKS: T/R R R R

R R R


K.L.P. Mishra, N. Chandrashekharan , Theory of Computer Science , Prentice Hall of India Michael Sipser, Introduction to the Theory of Computation, Cengage Learning,New Delhi,2007 Harry R Lewis, Christos H Papadimitriou, Elements of the theory of computation, Pearson Education Asia, Rajendra Kumar,Theory of Automata Language & Computation,Tata McGraw Hill,New Delhi,2010 Wayne Goddard, Introducing Theory of Computation, Jones & Bartlett India,New Delhi2010 Bernard M Moret: The Theory of Computation, Pearson Education


33


R R R R R R R

John Hopcroft, Rajeev Motwani & Jeffry Ullman: Introduction to Automata Theory Languages & Computation , Pearson Edn Raymond Greenlaw,H. James Hoover, Fundamentals of Theory of Computation,Elsevier,Gurgaon,Haryana,2009 John C Martin, Introducing to languages and The Theory of Computation, 3rd Edition, Tata McGraw Hill,New Delhi,2010 Kamala Krithivasan, Rama R, Introduction to Formal Languages,Automata Theory and Computation, Pearson Education Asia,2009 Rajesh K. Shukla, Theory of Computation, Cengage Learning, New Delhi,2009 K V N Sunitha, N Kalyani: Formal Languages and Automata Theory, Tata McGraw Hill,New Delhi,2010 S. P. Eugene Xavier, Theory of Automata Formal Language & Computation,New Age International, New Delhi ,2004


COURSE NAME

DESCRIPTION

SEM III

Discrete Mathematics

COURSE OBJECTIVES: 1 To impart the basic concepts of theory of automata, languages and computation.

2

To develop understanding about machines for sequential computation, formal languages and grammars, and classification of feasible and intractable problems.

COURSE OUTCOMES: SNO 1

2

3

4

5

DESCRIPTION

Graduates will have a good knowledge of formal computation and its relationship to languages, be able to classify languages into their types and also to understand formal reasoning about languages. Graduates will be able to prove the equivalence of languages described by finite state machines and regular expressions. They will also be able to design and construct finite state machines and the equivalent regular expressions, grammars, languages modeling and small compilers basics. Graduates will be able to construct pushdown automata and the equivalent context free grammars and also be able to prove the equivalence of languages described by pushdown automata and context free grammars. Graduates will be able to understand how to use Turing Machines to represent computable functions and how a Universal Turing machine can simulate any Turing Machine on any input. Graduates will be able to define classes P, NP, the notions of polynomial time reduction, NPhardness, and NP-completeness and also apply NP-completeness concepts to create proofs regarding the computational complexity of novel problems.

PO MAPPING a,b,c

a,b,c,,e,

a,b,c,e,

a,b,c

a,b,d,e


DESCRIPTION

1

Implementations of Finite State machines, Different types of FSA

PROPOSED ACTIONS Lab Session

PO MAPPING a,b,c

2

Programming in Turing Machine’s

Lab Session

a,b,c

3

Implementing parsers to recognize different grammars of formal language

Lab Session

a,b,c



34


TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN: SNO

DESCRIPTION

PO MAPPING a,b,c

1

Regulated rewriting

2

L systems Grammar systems

a,b,c

DNA computing Membrane computing

a,b,c

3 4 5

a,b,c

a,b,c

WEB SOURCE REFERENCES: 1 http://www.nptel.iitm.ac.in/courses/106104028/ 2 http://toc.csail.mit.edu/ 3 http://toc.seas.harvard.edu/ http://www.cis.upenn.edu/~giorgi/cl.html 4 http://web.mit.edu/~holden1/www/coursework/math/18.404/main.pdf 5 http://www.eng.utah.edu/~cs3100/KonradNotes.pdf 6 http://engineeringppt.net/theory-of-computation-ppt-pdf-lecture-notes/ 7 http://meru.cecs.missouri.edu/courses/cecs341/ 8 http://www.scribd.com/doc/23550586/Turing 9 http://www.gobookee.net/theory-of-computation-ullman/s 10 DELIVERY/INSTRUCTIONAL METHODOLOGIES:  










Prepared by by Ms. Mary Priya Sebastian




OTHERS

Approved Mr. Ajith S

(H.O.D)


35


CS010 407 Data Structures lab COURSE INFORMATION SHEET PROGRAMME: COMPUTER SCIENCE & ENGINEERING COURSE: DATA STRUCTURES LAB COURSE CODE: CS010 407 REGULATION: 2010 COURSE AREA/DOMAIN: PROGRAMMING, DATA STRUCTURES AND ALGORITHMS CORRESPONDING LAB COURSE CODE (IF ANY): NIL

DEGREE: BTECH YEAR: JAN 2014 – JUNE 2014 SEMESTER: IV CREDITS: 2 COURSE TYPE: CORE CONTACT HOURS: 3 Lab hours/Week. LAB COURSE NAME:NA

SYLLABUS: UNIT I

II

III

IV

V

DETAILS

HOURS

(i) Representation of Polynomials using Arrays and Linked List and the different operations that can be performed on Polynomials (ii) Representation of Sparse Matrix using Arrays and Linked List and the different operations that can be performed on Sparse Matrices (iii) Representation of Stacks using Arrays and Linked List and the different operations that can be performed on Stacks (iv) Representation of Queues using Arrays and Linked List and the different operations that can be performed on Queues (v)Infix, Postfix and Prefix conversions. (vi)String representation using Arrays and Linked List and different pattern matching algorithms (vii) Representation of Double Ended Queue using Arrays and Linked List and the different operations that can be performed on Double Ended Queue (viii) Representation of Priority Queues using Arrays and Linked List and the different operations that can be performed on Priority Queues (ix) Representation of Binary Trees using Arrays and Linked List and the different operations that can be performed on Binary Trees (x) Representation of Graphs using Arrays and Linked List and the different operations that can be performed on Graphs (xi)Different Sorting and Searching methods. (xii) Implementation and operations on B-Tree and B+Tree TOTAL HOURS

6

9

12

9

9 45

LAB CYCLE DAY 1 1. Write a program to perform the following operation in stack using array a. Insert b. Delete c. Display d. Peep e. Isempty f. Isfull 2. Write a program to perform the following operation in queues using array a. Insert b. delete c. display 3. Simulate a circular queue using an array DAY 2 4. Implement a Double ended queue using array 5. Priority Queues using array. 6. Infix to postfix conversions and expression evaluation DAY 3


36


7. Implement a singly linked list and perform the following operations a) Insert     

at the beginning at the end after some specified no. of nodes before some specified no. of nodes after/before a specified node

b) Delete

 At front  At the end  A specified node c) Reversal of a linked list without another list d) Displaying the list 8. Write a program to perform the following operation in stack using link list a. Insert b. delete c. Peep d. Display e. Isempty f. Isfull 9. Write a program to perform the following operation in queues using link list a.Insert b.delete c. display DAY 4 10. Implement a Doubly linked list and perform the following operations a) Insert  at the beginning  at the end  after some specified no. of nodes  before some specified no. of nodes  after/before a specified node b) Delete  At front  At the end  A specified node c) Displaying the list 11. Implement the Double Ended Queue using linked list 12. Implement the Priority Queues using linked List (HA) DAY 5 13. Write a program to perform Polynomial addition using Linked List 14. Write a program to perform Polynomial multiplication using Linked List . DAY 6 16. Implement following sorting techniques a. Insertion sort, Selection Sort and bubble sort. b. Recursive implementation of Quick Sort. c. Recursive implementation of Merge Sort. DAY 7 TREE 17. Implement a Binary Tree and perform the following operations a)Insertion (b) Deletion (c) Traversal 18 . Implement a Binary Search Tree and perform the following operations


37


a)Insertion (b) Deletion (c) Traversal (d)Mirror Image of the tree (e)Depth, Level & Height of a node 19. Implement Heap Sort

DAY 8 GRAPH 20 . Implement DFS and BFS on a connected directed graph 22. Implement the Addition of two sparse matrices 23. Simulate a B tree using linked list 24. Simulate a B+ tree using linked list TEXT/REFERENCE BOOKS: T/R 1 2 3 4 5


Horowitz ,Sahni & Anderson Freed, Fundamentals of Data Structures in C, 2nd ed., Universities Press, Hyderabad, 2009 Seymour Lipschutz, Data Structures , Schaum’s Outlines, Tata McGraw Hill , New Delhi, 2006 Jean Paul Tremblay & Paul G Sorenson, An Introduction to Data Structures with Applications, 2nd ed., Tata McGraw Hill , New Delhi, 2010 Rajesh K Shukla, Data Structures Using C & C++ ,Wiley India, New Delhi, 2009 Yedidyah Langsam, Moshe J Augenstein, Aron M Tenenbaum, Data Stuctures using C and C++, 2nd ed., PHI Learning Private Limited, New Delhi, 1996


COURSE NAME PROBLEM SOLVING AND COMPUTER PROGRAMMING

DESCRIPTION C Programming skills

SEM III

COURSE OBJECTIVES: 1

To provide experience on design, testing, and analysis of Algorithms and Data Structures.

2

To acquaint the students with the Data Structures used in the Computer Science field.


DESCRIPTION

Understand and implement stack, queue and its applications. Understand and implement linked lists and its variations. Understand and apply fundamental algorithmic problems including Tree traversals, Graph traversals, and shortest paths. Understand and implement various searching and sorting algorithms. Students will be able to select the appropriate data structure for solving a problem.

PO MAPPING a, b, e a, b, e a, b, e a, b, e a, b, c, d


DESCRIPTION

PO

1

Implementation of threaded binary trees

b,c

2

Implementation of Tower of Hanoi problem

a,e


PROPOSED ACTIONS

Group assignment Group

38


assignment PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN: 1 AVL TREES 2 DIJIKSTRA’S AND PRIM’S ALGORITHM

a, b, e a, b, e

WEB SOURCE REFERENCES: 1 http://www.cse.iitk.ac.in/users/dsrkg/cs210/applets/sortingII/mergeSort/mergeSort.html 2 www.oo we .com Algorithms iles Algorithms.html 3 www.cse.unt.edu/~rada/CSCE3110/Lectures/Trees. t 4 5 6

7

cslibrary.stanford.edu/110/BinaryTrees. d cslibrary.stanford.edu/103/LinkedListBasics. d www.nptel.iitm.ac.in ideo. h su ectId 10610 0 www.iitg.ernet.in cse age id 220

DELIVERY/INSTRUCTIONAL METHODOLOGIES:  










Prepared by by Ms.Jomina John




OTHERS

Approved Mr. Ajith S

(H.O.D)


39


CS010 408 Electronic Circuits lab COURSE INFORMATION SHEET PROGRAMME: Computer Science Engineering COURSE: Electronic Circuits & Communication Lab COURSE CODE: : CS010 408(EC) REGULATION: 2010 COURSE AREA/DOMAIN: Electronic Devices and Circuits CORRESPONDING LAB COURSE CODE (IF ANY):

DEGREE: B.TECH SEMESTER: 4

CREDITS: 2

COURSE TYPE: CORE CONTACT HOURS: 3 hrs. LAB COURSE NAME: Nil

SYLLABUS: UNIT DETAILS Design of Two Stage RC Coupled Amplifiers I Design of Bootstrap Sweep Generators II Design of Astable Multivibrator using Op-Amp and 555 Timer. III Design of Monostable Multivibrator using Op-Amp IV Design of RC Phase Shift Oscillator using Op-Amp. V VI Amplitude Modulation VII Pulse Amplitude Modulation (PAM) VIII Pulse Width Modulation (PWM) IX Amplitude Shift Keying (ASK) X Phase Shift Keying (PSK) TOTAL HOURS

HOURS 3 hrs. 3 hrs. 3 hrs. 3 hrs. 3 hrs. 3 hrs. 3 hrs. 3 hrs. 3 hrs. 3 hrs 30 hrs.

TEXT/REFERENCE BOOKS: T/R BOOK TITLE/AUTHORS/PUBLICATION 1 Boylestead and Nashelky- Electronic Devices and Circuits- Prentice Hall of India 2 Op amps and Linear Integrated Circuits- Ramakand Gaykwad- Prentice Hall of India 2 George Kennedy - Electronic Communication Systems - TMH COURSE PRE-REQUISITES: C.CODE COURSE NAME CS010 Electronic Devices and Circuits 306 (EC)


DESCRIPTION Students should know design and working of basic electronic circuits

SEM 3

40


CS010 404

Signals and Communication Systems

To familiarize the core ideas of Communication Engineering

4

COURSE OBJECTIVES: 1 To provide experience on design, testing and analysis of basic discrete electronic circuits 2

4

To give a hands on experience on working with various Electronic Components and Devices including BJT, Op-amp and 555 Timers. To provide experience on design, testing, and analysis of few electronic circuits used for communication engineering. To develop necessary skills to function effectively on teams.

5

To develop necessary skills in technical writing and effective communication

3

COURSE OUTCOMES: SNO DESCRIPTION 1 2 3

4 5

PO MAPPING e

Students can demonstrate ability to identify, formulate and solve engineering problems in the field of analog devices c,e,f Students will demonstrate ability to design as per the required application. a,b,c,e,f Effectively designed laboratory experiments can significantly increase a student’s knowledge and understanding o communication circuits. Students can demonstrate their aptitude & technical skills to succeed g,h,j in recruitment / competitive exams. b,d,f,g,h,l Students can show ability to participate and succeed in project contests.

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS: SNO DESCRIPTION

PROPOSED ACTIONS 1 Effectively design and interconnect different circuits to form a larger NPTEL, circuit to perform a useful operation Mini Project PROPOSED ACTIONS: TOPICS BEYOND SYLLABUS/ASSIGNMENT/INDUSTRY VISIT/GUEST LECTURER/NPTEL ETC TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN: 1 Matlab and P-Spice simulation of the experiments.


41


WEB SOURCE REFERENCES: 1 http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-ROORKEE/BASICELECTRONICS/home_page.htm 2 http://nptel.iitm.ac.in/video.php?subjectId=117103063 DELIVERY/INSTRUCTIONAL METHODOLOGIES: ☐ CHALK & TALK

☐ STUD. ASSIGNMENT

☐ WEB RESOURCES


☐ STUD. SEMINARS

☐ ADD-ON COURSES

ASSESSMENT METHODOLOGIES-DIRECT ☐ ASSIGNMENTS

☐ STUD. SEMINARS

☐ TESTS/MODEL EXAMS

☐ UNIV. EXAMINATION


☐ STUD. VIVA


☐ CERTIFICATIONS

☐ ADD-ON COURSES

☐ OTHERS

ASSESSMENT METHODOLOGIES-INDIRECT ☐ ASSESSMENT OF COURSE OUTCOMES ☐ STUDENT FEEDBACK ON (BY FEEDBACK, ONCE) FACULTY (TWICE) ☐ ASSESSMENT OF MINI/MAJOR PROJECTS BY EXT. EXPERTS

Prepared by Anila Kuriakose


☐ OTHERS

Approved by (HOD)

42


CS010 408 ELECTRONIC CIRCUITS AND COMMUNICATION LAB COURSE PLAN Planned Slot

PLANNED TOPIC

Day 1

Design of Two Stage RC Coupled Amplifiers

Day 2

Design of Bootstrap Sweep Generators

Day 3

Design of Astable Multivibrator using Op-Amp and 555 Timer.

Day 4

Design of Monostable Multivibrator using Op-Amp

Day 5

Design of RC Phase Shift Oscillator using Op-Amp.

Day 6

Amplitude Modulation

Day 7

Pulse Amplitude Modulation (PAM)

Day 8

Pulse Width Modulation (PWM)

Day 9

Amplitude Shift Keying (ASK)

Day 10

Phase Shift Keying (PSK)


43