Course Info 3rd Sem PESU

P.E.S. University B.Tech. 3rdSemester Course Information - CSE Aug - Dec 2015 -1-

GENERAL GUIDELINES

This book is to be brought to the class daily.

Students are not permitted to attend the class without the identity card, once issued.

Students should be well on time right from the first class.

Students should keep the Classrooms, Laboratories and Workshops clean.

Writing on desks and walls is strictly prohibited, failing which the students will be fined heavily. If the identity of the individual is not established the entire class / students in the block will be fined.

Students are advised to show due respect to all faculty regardless of their department and maintain affable personality.

Students are to maintain absolute discipline and decorum, so as to promote the fair name of their college in all its activities.

Students securing less than 85% attendance (with a condonation benefit of 10%) in any individual subject, theory or laboratory, will not be allowed to take up the ESA.

Students are informed to clarify their doubts in the respective courses with the faculty by taking prior appointment.

Students are to inform their parents that they should follow up the progress of their wards by being in touch with the University authorities at regular intervals.

Ragging is punishable under Karnataka Education Act and is strictly prohibited. Any student involved in ragging, will be severely punished – which includes handing over the case to Police, rustication from the college etc.

The suggestion boxes are maintained at strategic places in the campus. Students are to avail these facilities.

Students should come prepared with algorithm / flowchart / program / procedure for all the experiments before attending the laboratory session.

Students should bring the data sheets and laboratory records complete in all respects to the laboratory.

Students are not supposed to alter the configuration of the system / any software on the systems.

Students are advised to be present for the mentor meetings conducted by the Faculty Advisors failing which appropriate disciplinary action will be taken.


B.TECH 3rd

SEMESTER COMPUTER SCIENCE AND ENGINEERING: SCHEME 2014-2018

SI #

Subject Code

Title of the Course

Lecture

Tutorial Practical Self Study

Credits Course Type

Prerequisite

1 UE14CS201 Digital Design & Computer Organization

4 0 0 -- 4 FC NA

2 UE14CS202 Data Structures 4 0 0 -- 4 CC UE14CS151 UE14CS152

3 UE14CS203 Statistics for Computer Science

3 0 0 -- 3 FC NA

4 UE14CS204 Web Technology 1

4 0 0 -- 4 CC NA

5 UE14CS205 Discrete Mathematics and Logic

4 0 0 -- 4 FC NA

6 UE14CS206

Digital Design & Computer Organization Laboratory

0 0 2 -- 1 FC NA

7 UE14CS207 Data Structures Laboratory

0 0 2 -- 1 CC UE14CS151 UE14CS152

8 UE14CS208 Web Technology 1 Laboratory

0 0 2 -- 1 CC NA

9 UE14CS22X Special Topic 0 0 0 -- 1 PW/SL/PC NA

Total 19 00 06 -- 23


UE14CS201: DIGITAL DESIGN AND COMPUTER ORGANIZATION (4-0-0-4)

# of Hours:

52

Class Chapter

Title/Reference

Literature

Unit

No Topics To Be Covered

% Of Portions Covered Reference

Chapter Cumullative

1 Combinational

Logic 4.1 to 4.11 ( Book No. 1 )

1

Introduction, Combinational circuits

15.00 15.00

2 Analysis procedure 3 Design Procedure

4-5 Binary adder-Subtractor 6 Decimal Adder, Binary multiplier 7 Magnitude comparator, Decoders 8 Encoders, Multiplexers

9 Synchronous

Sequential Logic 5.1 to

5.8(EXCLUDING

5.6) ( Book No. 1 ) 6.1-6.5 (Book No. 1)

2

Synchronous Sequential Logic:

Introduction, Sequential circuits

27.00 42.00

10 Storage elements: Latches 11 Flip flops

12-13 Analysis of clocked sequential

circuits 14 State reduction and assignment

15-16 Design procedure 17 Registers and counters: Registers,

18-19 Shift register 20 Ripple counters 21 Synchronous counters 22 Other counters

23-25

Basic structure

of computers 1.1 – 1.3, 2.1 – 2.6(

excluding 2.2 and

2.3) ( Book No. 2)

3

Computer Types: Functional unit:

Input Unit, Memory unit, arithmetic

& logic unit, Output unit, Control

unit

23.00 65.00

26 Basic operational concepts

27-28 Number representation and

arithmetic Operations 29 Character representation

30-31

Addition of Positive Numbers,

Addition and subtraction of signed

numbers, overflow in integer

arithmetic

32-33 Instruction and instruction

sequencing ,Addressing modes

34

Assembly Languages

35 Basic Processing

Unit

Basic Processing unit: Some

fundamental concepts 20.00 85.00


36 7.1-7.6 6.1-6.7( excluding

6.3 and 6.4) ( Book No. 2 )

4 Instruction execution: Load

instructions 37 Arithmetic and logic instruction

38-39 Store instruction, Execution of a

complete instruction

40 Instruction fetch and execution

steps: Branching, waiting for

memory

41 Hardwired control: Data path

control signals, Dealing with

memory delay 41 Micro programmed control,

42 Arithmetic: Addition and

subtraction of signed numbers ,Fast

adders, fast multiplication

43-44 Integer division, floating point

number and operations

45 The Memory

System and the

Basic Input /

Output 5.1 – 5.3 , 4.1- 4.2 ( Book No. 2 )

The memory system: Some basic

concepts

15.00 100.00

46 Semiconductor RAM memories:

Internal organization of memory

chips

47 Static memories, Dynamic

memories

48 Synchronous DRAMs, Structure of

Larger Memories

49 Read only memories:

ROM,PROM,EPROM, EEPROM

50 Basic Input / Output: Accessing I/O

Devices

51

Interrupts: Enabling and disabling

interrupts, Handling Multiple

devices

52 Controlling I/O device behaviour

Reference literature:

Reference

books Title & Author

Publication Info

Edition Year

1 Digital Design By M.Morris Mano & Michael

D. Ciletti 5 2013

2 Computer Organization By Carl Hamacher,

ZvonkoVranesic, SafwatZaky 5 2002

UE14CS202: DATA STRUCTURES (4-0-0-4)


# of Hours: 52

Class #

Chapter Title/Reference Literature

Topics to be Covered % of Portions Covered

Reference Chapter

Cumulative

1.

Unit: I Review of OOP/List;

T2 : Ch 3,4,5,6,11 T1: Ch 4.4, 5.2

Review of Java, OOP concepts

27 27

2. OOP - Inheritance

3. OOP – Polymorphism

4. Interfaces, ADT

5. Inner Classes

6. Recursion/Exception Handling

7. Packages/Asymptotic Analysis

8. List Interface and Operations

9. Node based Implementation – Head/Tail

10. Linked list implementation

11. Lists operations – Create, Insert, Update etc.

12. Array implementation of list

13. Comparison/Additional behavior of lists

14. Exercises on SLL

15.

Unit: II

DLL/Stack/Queues

T1: Ch 4.2-4.4

DLL – Interface and Linked List Implementation

17 44

16. DLL – Array Implementation

17. Stack – Interface and Array Implementation

18. Stack – Linked List Implementation

19. Stack – Applications (post fix etc)

20. Stack - Applications

21. Queue – Interface and Array Implementation

22. Queue – LL implementation

23. Queue - Applications

24.

Unit: III

Circular Queue/Trees

T1: Ch 4.5, 6.1-6.4, 7.3, 9.1,11.3

Circular Queues – Array Implementation

24 68

25. Circular Queues - LL Implementation

26. Double ended Queue, Multilist

27. Trees

28. Binary Trees Interface and Implementation

29. Binary Trees Traversals

30. Representation of Trees to Binary trees

31. Building and Evaluating binary Expression Tree

32. Binary Search Tree and BST Operations

33. Binary Search Tree Operations

34. Heap Tree

35. Intro to Trie Trees and Suffix Trees


36.

Unit: IV

Priority Queue/Graphs

T1: Ch 7.1-7.3,

12.1-12.2

Priority Queue – ADT and Implementation

17 85

37. Priority Queue Implementation sort/unsort

38. Priority Queue Implementation of Heap

39. PQ Applications – (sort)

40. Graph – Terminology, Properties, Digraph

41. Graph ADT, Implementation

42. Edge List, Adjacency List, Adjacency Matrix

43. Applications of Graphs, Weighted Graphs

44. Exercise and Review of Unit 4

45.

Unit: V

GenericProgramming and Java Collections

T2 : Ch 12,13

Generic Programming

15 100

46. Generic Classes and Methods

47. Review and exercise of Generic programming

48. Collections and Interface

49. List

50. Set and Map

51. Concrete collection

52. Collection Framework, Algorithm

Literature

Book Type Code Title & Author Publication Information

Edition Publisher Year

Textbook T1 Data Structures and Algorithms in Java, by Michael T Goodrich and Roberto Tamassia.

3rd or later

Wiley Student Edition

2012

Textbook T2 Core Java Vol 1. Fundamentals 8th edition, Cay S. Horstmann& Gary Cornell

8th Edition

Prentice Hall 2008


UE14CS203: STATISTICS FOR COMPUTERSCIENCE (3-0-0-3)

# of Hours: 52

Class #

Chapter Title/Reference Literature

Topics to be Covered % of Portions Covered

Reference Chapter

Cumulative

1. Unit: I

Sampling and Descriptive Statistics;

Probability;

T1 : Ch 1.1 – 1.3, Ch 2.1 – 2.5

Sampling and Descriptive Statistics: Introduction, Sampling

21 21

2. Summary Statistics

3. Summary Statistics

4. Graphical Summaries

5. Probability: Introduction, Basic Ideas

6. Counting Methods

7. Conditional Probability and Independence Random Variables

8. Linear Functions of Random Variables

9.

Unit: II

Propagation of Error; Commonly Used

Distributions;

T1: Ch 3.1-3.4: Ch 4.1- 4.5,4.11

Propagation of Error: Introduction, Measurement Error,

26 47

10. Linear Combinations of Measurements

11. Uncertainties for Functions of One Measurement

12. Uncertainties for Functions of Several Measurements

13. Commonly Used Distributions: Introduction, The Bernoulli Distribution

14. The Binomial Distribution

15. The Poisson Distribution

16. Some Other Discrete Distributions 17. The Normal Distribution

18. The Central Limit Theorem

19. Unit : III

Confidence Intervals

T1 : Ch 5.1 – 5.4

Confidence Interval :Introduction, Large-Sample Confidence Intervals for a Population Mean

20 67

20. Large-Sample Confidence Intervals for a Population Mean

21. Confidence Intervals for Proportions

22. Confidence Intervals for Proportions

23. Small-Sample Confidence Intervals for a Population Mean

24. Small-Sample Confidence Intervals for a Population Mean


25. Confidence Intervals for the Difference Between Two Means

26. Confidence Intervals for the Difference Between Two Means

27.

Unit: IV

Hypothesis Testing

T1: Ch 6.1 – 6.5

Hypothesis Testing: Introduction, Large-Sample Tests for a Population Mean

19 86

28. Drawing Conclusions from the Results of Hypothesis Tests

29. Drawing Conclusions from the Results of Hypothesis Tests

30. Tests for a Population Proportion, Small-Sample Tests for a Population Mean

31. Tests for a Population Proportion, Small-Sample Tests for a Population Mean

32. Large-Sample Tests for the Difference between Two Means

33. Large-Sample Tests for the Difference between Two Means

34.

Unit: V

Correlation and Simple Linear Regression

T1: Ch 7.1 - 7.4

Correlation and Simple Linear Regression: Introduction, Correlation

14 100

35. The Least-Squares Line

36. Uncertainties in the Least-Squares Coefficients

37. Uncertainties in the Least-Squares Coefficients

38. Checking Assumptions and Transforming Data

39. Checking Assumptions and Transforming Data

Literature

Book Type Code Title & Author Publication Information


Text Book T1 Statistics for Engineers and Scientists, William Navidi

3rd McGraw Hill

Education, India 2013


UE14CS204: WEB TECHNOLOGY – I (4-0-0-4)

# of Hours: 52

Class # Chapter Title / Reference

Literature

Topics to be Covered

% of portions covered Percentage Cumulative

1

Unit 1: Introduction; HTML;

Cascading Style Sheets

T1: Ch 4.1-4.11;

Ch 5.1-5.9

INTRO: Internet, Web, Web Server Architecture

19 19

2 INTRO: Server side and Client side scripting

3 HTML: Basic Markup, Images, Hyperlinks

4 HTML: Lists

5 HTML: Tables

6 HTML: Forms

7 CSS: Inline style, embedded style sheets,

8 CSS: Linking external style sheets, w3c CSS validation services

9 CSS: Backgrounds, element dimensions

10 CSS: Text flow and the box model

11

Unit 2: Javascript - I

T1: Ch 6.1-6.7; Ch 7.7-7.10; Ch8.1-8.9; Ch 9.1-9.4; Ch 9.8-9.11; Ch 10.1-

10.10; Ch11.3-11.9

JS: Introduction, Simple program, obtaining user input with prompt dialogs, memory concepts

23 42

12 JS: Arithmetic, decision making, repetition statement, SWITCH multiple-selection statement,

13 JS: DO…WHILE repetition statement, logical operators

14 JS: Program modules in JavaScript, function definitions,

15 JS: Scope rules, global functions, recursion

16 JS: Arrays, References and reference parameters, passing arrays to functions

17 JS: Sorting arrays, multi-dimensional arrays.

18 JS: Math object, Boolean and Number object

19 JS: String object, Date object,

20 JS: Document object, Window object

21 JS: Using cookies

22 JS: Tutorial

23

Unit 3: Javascript – II

T1: Ch12.1-12.6; Ch 13.1-13.8

JS: Introduction, Modeling a document, DOM Nodes and Trees

23 65

24 JS: Traversing and modifying a DOM tree ,DOM Collections

25 JS: Dynamic styles, summary of DOM objects and Collections

26 JS: Traversing and modifying a DOM tree

27 JS: Traversing and modifying a DOM tree

28 JS: DOM Collections, dynamic styles

29 JS: Summary of DOM objects and Collections

30 JS: Registering event handlers, onload, onmousemove,

31 JS: The event object, this, onmouseover

32 JS: The event object, this, onmouseover

33 JS: onmouseout, onfocus, onblur

34 JS: onsubmit, onreset, event bubbling


35 Unit 4: WEB SERVERS & HTML5 T1: Ch 21.1-21.5 T2: Pg 15-22, Pg 41-52, Pg 57-70, Pg 127-134, Pg 137-141, Pg 147-155

Web Server: HTTP transactions, Multi-tier Application architecture

15 80

36 Web Server: Client side versus server scripting, accessing web servers.

37 HTML5: Basics, Main features and semantic tags

38 HTML5: Canvas in detail 39 HTML5: Canvas in detail 40 HTML5: Local Storage

41 HTML5: Offline browsing and input types

42 HTML5: Autofocus and placeholders

43 Unit 5: PHP T1: Ch 23.1-23.7 (excluding 23.5)

PHP: Introduction, basics

20 100

44 PHP: Introduction, basics

45 PHP: string processing and regular expressions

46 PHP: string processing and regular expressions

47 PHP: form processing and business logic

48 PHP: form processing and business logic

49 PHP: using cookies

50 PHP: using cookies

51 PHP: dynamic content

52 PHP: dynamic content

Reference books:

Book Type Code Title Author Publication Info

Edition Publisher

Text Book T1 Internet and World Wide Web, How to Programme

Deitel and Deitel 4

th Edition Prentice Hall

Text Book T2 HTML5 Up and Running Mark Pilgrim 1st

Edition Google Press Reference Material:

Website Code Name Resource

Text Book M1 W3 Schools www.w3schools.com


UE14CS205: DISCRETE MATHEMATICS AND LOGIC (4-0-0-4)

# ofHrs: 52

CLASS #

CHAPTER TITLE /

REFERENCE LITERATURE

TOPIC TO BE COVERED

% OF PORTIONS COVERED

UNIT-WISE CUMULATIVE

Unit: 1 – Logic (14 Hrs)

1.

T1: 1.1 – 1.6

Motivation for the course. Basic connectives and truth tables.

27% 27%

2. Tautology and Contradiction

3. Logical Equivalence

4. The laws of logic

5. The laws of logic (continued)

6. Rules of Inference

7. Rules of Inference (continued)

8. Predicates and Quantifiers

9. Predicates and Quantifiers (continued)

10. Logical Equivalences involving Quantifiers

11. Nested Quantifiers

12. Combining Rules of Inference for Propositions and Quantified Statements

13. Introduction to Proofs

14. Introduction to Proofs (continued)

Unit: 2 - Sets, Functions and Relations (10 Hrs) 15.

T1: 2.1 - 2.3,

7.1, 7.5, 7.6

Sets and Operations in Sets, Relations

19% 46%

16. Functions, Types of Functions

17. Composition and Inverse of Functions

18. Relations on a set

19. Types of Relations

20. Equivalence Relations

21. Equivalence Classes and Partitions

22. Partial Orderings

23. Hasse Diagrams

24. Lattices

Unit: 3 – Counting (10 Hrs)

25. T1:

5.1 - 5.4, Basic Counting Principles – Sum Rule and Product Rule

19% 65%


26. 6.1 - 6.3 The Pigeonhole Principle

27. Applications of the Pigeonhole Principle

28. Permutations

29. Combinations

30. The Binomial Theorem and the Multinomial theorem

31. Permutations with Repetition

32. Combinations with Repetition

33. Introduction to Recurrence Relations

34. Solving Recurrence Relations

Unit: 4 – Graph Theory – Part 1 (10 Hrs) 35.

T1: 8.1 – 8.5

Introduction to Graph Theory

19% 84%

36. Basic Terminologies – Directed & Undirected Graphs

37. Walks, Paths and Circuits

38. Sub-graphs and Complements

39. Graph Isomorphism

40. Vertex Degree & Regular Graphs

41. Konigsberg Bridge Problem

42. Eulerian Graphs, Euler’s Formula

43. Hamilton Graphs

44. Traveling Salesman Problem Unit: 5 - Graph Theory – Part 2 (08 Hrs)

45.

T1: 8.7 – 8.8,

9.1, 9.3 - 9.5

Planar Graphs - Definition & Examples

16% 100%

46. Detection of Planarity

47. Bipartite &Kuratowski’s Graphs

48. Graph Coloring: Proper Coloring & Chromatic Number of Graphs

49. Chromatic Polynomial

50. Trees, Rooted Tree, Ordered Rooted tree

51. Tree Traversals

52. Spanning Tree, Minimum Spanning Tree

References:

Book Type

Code Title & Author Publication Info


Text Book T1 Discrete Mathematics and its Applications - Kenneth H. Rosen (Indian adaptation by Kamala Krithivasan)

7 Tata McGrawHill 2011

Reference R1 Discrete and Combinatorial Mathematics: An Applied Introduction - Ralph P. Grimaldi and B V Ramana

5 PEARSON 2011


Reference R2 Graph Theory with Applications to Engineering and Computer Science - NarsinghDeo

- Prentice Hall India 2004

Reference R3 Discrete Mathematical Structures with Applications to Computer Science – J.P Tremblay & R. Manohar

- McGrawHill -

UE14CS206: DIGITAL DESIGN AND COMPUTER ORGANIZATION LABORATORY (0-0-2-1)

Experiment #1: Must be able to build a small 8 bit processor that supports reading from memory

(16 bytes), Execute 3 instructions, and add/subtract/stop. All operations are to be performed on

set of 4 registers. Must implement program counter and decoder to fetch the next instruction.

Experiment #1: Implement basic gates

Experiment #2: Implement flip-flops

Experiment #3: Implement a multiplexor

Experiment #4: Implement a decoder

Experiment #5: Implement a 8 bit shift register

Experiment #6: Implement a counter

Experiment #7: Implement an 8 bit adder

Experiment #8: Implement an 8 bit multiplier

Experiment #9: Implement a load to register instruction

Experiment #10: Implement a store to memory instruction

Experiment #11: Implement an add (reg, reg, reg) instruction

Experiment #12: Implement a program counter

MiniProject: Put all of above together to build a mini-processor


UE14CS207: DATA STRUCTURES LABORATORY (0-0-2-1)

Program #1 Program to demonstrate use of Arrays and Input/output. Program #2 Program to demonstrate use on Inheritance and Interface Program #3 Program to demonstrate use of List

Program #4

Program to demonstrate use of DLL

Program #5

Program to demonstrate use of Stack.

Program #6

Program to demonstrate use of Queues.

Program #7 Program to demonstrate use of Binary Tree Program #8 Program to demonstrate use of Priority Queue Program #9


Program to demonstrate use of Graph

Mini project :

Equivalent to 3 lab sessions

To be developed by a group of up to 3 members.

UE14CS208: WEB TECHNOLOGY I LABORATORY (0-0-2-1)

Program #1

Example on HTML tags

Program #2

Example on CSS

Program #3

Examples on JavaScript: Dialogs and Control structures

Program #4

Examples on JavaScript: functions and arrays

Program #5

Examples on JavaScript: Arrays and Strings

Program #6

Examples on JavaScript: DOM and event handling

Program #7

Examples on JavaScript: DOM and event handling

Program #8

Example on HTML5

Program #9

Example on HTML5

Program #10

Example on PHP

Program #11 & 12:

Mini project

Course Info 3rd Sem PESU

Documents

Transcript of Course Info 3rd Sem PESU