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.

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

rd

B.TECH 3 SEMESTER COMPUTER SCIENCE AND ENGINEERING: SCHEME 2014-2018

SI
#

Subject
Code

Title of the
Course

UE14CS201

Digital Design &

Computer
Organization

UE14CS202

Data Structures

UE14CS203

UE14CS204

UE14CS205

UE14CS206

UE14CS207

UE14CS208

UE14CS22X

Statistics for
Computer
Science
Web Technology
1
Discrete
Mathematics
and Logic
Digital Design &
Computer
Organization
Laboratory
Data Structures
Laboratory
Web Technology
1 Laboratory
Special Topic

Total

Lecture Tutorial

Practical

Self
Study

Credits

Course
Type

Prerequisite

--

FC

NA

--

CC

UE14CS151
UE14CS152

--

FC

NA

--

CC

NA

--

FC

NA

--

FC

NA

--

CC

UE14CS151
UE14CS152

--

CC

NA

--

PW/SL/PC

NA

19

00

06

--

23

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

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

# of Hours:
52

Class
1
2
3
4-5
6
7
8
9
10
11
12-13
14
15-16
17
18-19
20
21
22
23-25
26
27-28

Chapter
Title/Reference
Literature
Combinational
Logic
4.1 to 4.11
( Book No. 1 )

Unit
No

Synchronous
Sequential Logic
5.1 to
5.8(EXCLUDING
5.6)
( Book No. 1 )
6.1-6.5
(Book No. 1)

Basic structure
of computers
1.1 1.3,
2.1 2.6(
excluding 2.2 and
2.3)
( Book No. 2)

29
3
30-31

32-33

Topics To Be Covered
Introduction, Combinational circuits
Analysis procedure
Design Procedure
Binary adder-Subtractor
Decimal Adder, Binary multiplier
Magnitude comparator, Decoders
Encoders, Multiplexers
Synchronous Sequential Logic:
Introduction, Sequential circuits
Storage elements: Latches
Flip flops
Analysis of clocked sequential
circuits
State reduction and assignment
Design procedure
Registers and counters: Registers,
Shift register
Ripple counters
Synchronous counters
Other counters
Computer Types: Functional unit:
Input Unit, Memory unit, arithmetic
& logic unit, Output unit, Control
unit
Basic operational concepts
Number representation and
arithmetic Operations
Character representation
Addition of Positive Numbers,
Addition and subtraction of signed
numbers, overflow in integer
arithmetic
Instruction and instruction
sequencing ,Addressing modes
Assembly Languages

% Of Portions Covered
Reference
Cumullative
Chapter

15.00

15.00

27.00

42.00

23.00

65.00

20.00

85.00

34
35

Basic Processing
Unit

Basic Processing unit: Some

fundamental concepts

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

36
37
38-39

7.1-7.6
6.1-6.7( excluding
6.3 and 6.4)
( Book No. 2 )

40

41
41
42
43-44
45
46
47

The Memory
System and the
Basic Input /
Output
5.1 5.3 ,
4.1- 4.2
( Book No. 2 )

48
49
50

51
52

Instruction execution: Load

instructions
Arithmetic and logic instruction
Store instruction, Execution of a
complete instruction
Instruction fetch and execution
steps: Branching, waiting for
memory
Hardwired control: Data path
control signals, Dealing with
memory delay
Micro programmed control,
Arithmetic: Addition and
subtraction of signed numbers ,Fast
adders, fast multiplication
Integer division, floating point
number and operations
The memory system: Some basic
concepts
Semiconductor RAM memories:
Internal organization of memory
chips
Static memories, Dynamic
memories
Synchronous DRAMs, Structure of
Larger Memories
Read only memories:
ROM,PROM,EPROM, EEPROM
Basic Input / Output: Accessing I/O
Devices
Interrupts: Enabling and disabling
interrupts, Handling Multiple
devices

15.00

100.00

Controlling I/O device behaviour

Reference literature:
Reference
books
1

Title & Author

Digital Design
By M.Morris Mano & Michael
D. Ciletti
Computer Organization
By Carl Hamacher,
ZvonkoVranesic, SafwatZaky

Publication Info
Edition

Year

2013

2002

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

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

# of Hours: 52
Class
#

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.

Chapter Title/Reference
Literature

Topics to be Covered

% of Portions Covered
Reference
Cumulative
Chapter

Review of Java, OOP concepts

OOP - Inheritance
OOP Polymorphism
Unit: I
Review of OOP/List;

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

Unit: II
DLL/Stack/Queues
T1: Ch 4.2-4.4

Interfaces, ADT
Inner Classes
Recursion/Exception Handling
Packages/Asymptotic Analysis
List Interface and Operations
Node based Implementation Head/Tail
Linked list implementation
Lists operations Create, Insert, Update etc.
Array implementation of list
Comparison/Additional behavior of lists
Exercises on SLL
DLL Interface and Linked List Implementation
DLL Array Implementation
Stack Interface and Array Implementation
Stack Linked List Implementation
Stack Applications (post fix etc)
Stack - Applications
Queue Interface and Array Implementation

27

27

17

44

24

68

Queue LL implementation
Queue - Applications

Unit: III
Circular Queue/Trees
T1: Ch 4.5, 6.1-6.4,
7.3, 9.1,11.3

Circular Queues Array Implementation

Circular Queues - LL Implementation
Double ended Queue, Multilist
Trees
Binary Trees Interface and Implementation
Binary Trees Traversals
Representation of Trees to Binary trees
Building and Evaluating binary Expression Tree
Binary Search Tree and BST Operations
Binary Search Tree Operations
Heap Tree
Intro to Trie Trees and Suffix Trees

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

Priority Queue ADT and Implementation

36.
37.
38.
39.
40.

Priority Queue Implementation sort/unsort

Priority Queue Implementation of Heap

Unit: IV
Priority Queue/Graphs
T1: Ch 7.1-7.3,
12.1-12.2

41.
42.
43.

Graph Terminology, Properties, Digraph

17

85

15

100

Graph ADT, Implementation

Edge List, Adjacency List, Adjacency Matrix
Applications of Graphs, Weighted Graphs

44.
45.

Exercise and Review of Unit 4

Generic Programming
Generic Classes and Methods

46.
47.
48.
49.
50.
51.
52.

PQ Applications (sort)

Unit: V

Review and exercise of Generic programming

GenericProgramming
and Java Collections
T2 : Ch 12,13

Collections and Interface

List
Set and Map
Concrete collection
Collection Framework, Algorithm

Literature
Book Type

Code

Textbook

T1

Textbook

T2

Title & Author

Data Structures and Algorithms in Java, by
Michael T Goodrich and Roberto Tamassia.
Core Java Vol 1. Fundamentals 8th edition,
Cay S. Horstmann& Gary Cornell

Publication Information
Edition
3rd or
later
8th
Edition

Publisher
Wiley Student
Edition
Prentice Hall

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

Year
2012
2008

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

# of Hours: 52
Class
#

1.
2.
3.
4.
5.
6.
7.

Chapter Title/Reference
Literature

Unit: I
Sampling and
Descriptive Statistics;
Probability;

T1 : Ch 1.1 1.3,
Ch 2.1 2.5

8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.

Unit: II
Propagation of Error;
Commonly Used
Distributions;
T1: Ch 3.1-3.4:
Ch 4.1- 4.5,4.11

Unit : III
Confidence Intervals
T1 : Ch 5.1 5.4

Topics to be Covered

Sampling and Descriptive Statistics:

Introduction, Sampling
Summary Statistics
Summary Statistics
Graphical Summaries
Probability: Introduction, Basic Ideas
Counting Methods
Conditional Probability and Independence
Random Variables
Linear Functions of Random Variables
Propagation of Error: Introduction, Measurement
Error,
Linear Combinations of Measurements
Uncertainties for Functions of One Measurement
Uncertainties for Functions of Several
Measurements
Commonly Used Distributions: Introduction, The
Bernoulli Distribution
The Binomial Distribution

% of Portions Covered
Reference
Chapter

Cumulative

21

21

26

47

20

67

The Poisson Distribution

Some Other Discrete Distributions
The Normal Distribution
The Central Limit Theorem
Confidence Interval :Introduction, Large-Sample
Confidence Intervals for a Population Mean
Large-Sample Confidence Intervals for a
Population Mean
Confidence Intervals for Proportions
Confidence Intervals for Proportions
Small-Sample Confidence Intervals for a
Population Mean
Small-Sample Confidence Intervals for a
Population Mean

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

25.
26.
27.
28.
29.
Unit: IV

30.

Hypothesis Testing
T1: Ch 6.1 6.5

31.
32.
33.
34.
35.
36.
37.
38.
39.

Unit: V
Correlation and Simple
Linear Regression
T1: Ch 7.1 - 7.4

Confidence Intervals for the Difference Between

Two Means
Confidence Intervals for the Difference Between
Two Means
Hypothesis Testing: Introduction, Large-Sample
Tests for a Population Mean
Drawing Conclusions from the Results of
Hypothesis Tests
Drawing Conclusions from the Results of
Hypothesis Tests
Tests for a Population Proportion, Small-Sample
Tests for a Population Mean
Tests for a Population Proportion, Small-Sample
Tests for a Population Mean
Large-Sample Tests for the Difference between
Two Means
Large-Sample Tests for the Difference between
Two Means
Correlation and Simple Linear Regression:
Introduction, Correlation
The Least-Squares Line
Uncertainties in the Least-Squares Coefficients

19

86

14

100

Uncertainties in the Least-Squares Coefficients

Checking Assumptions and Transforming Data
Checking Assumptions and Transforming Data

Literature
Book Type

Text Book

Code

T1

Title & Author

Statistics for Engineers and Scientists,
William Navidi

Publication Information
Edition

Publisher

Year

3rd

McGraw Hill
Education, India

2013

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

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

# of Hours: 52
Class #

Chapter Title / Reference

Literature

1
2
3
4
5
6
7

Unit 1:
Introduction; HTML;
Cascading Style Sheets

T1: Ch 4.1-4.11;
Ch 5.1-5.9

9
10
11
12
13
14
15
16
17
18
19
20
21
22

Unit 2: Javascript - I
T1: Ch 6.1-6.7; Ch 7.77.10; Ch8.1-8.9; Ch 9.19.4; Ch 9.8-9.11; Ch 10.110.10; Ch11.3-11.9

23
24
25
26
27
28
29
30
31
32
33
34

Unit 3: Javascript II
T1: Ch12.1-12.6; Ch

13.1-13.8

Topics to be Covered
INTRO: Internet, Web, Web Server Architecture
INTRO: Server side and Client side scripting
HTML: Basic Markup, Images, Hyperlinks
HTML: Lists
HTML: Tables
HTML: Forms
CSS: Inline style, embedded style sheets,
CSS: Linking external style sheets, w3c CSS validation
services
CSS: Backgrounds, element dimensions
CSS: Text flow and the box model
JS: Introduction, Simple program, obtaining user input
with prompt dialogs, memory concepts
JS: Arithmetic, decision making, repetition statement,
SWITCH multiple-selection statement,
JS: DOWHILE repetition statement, logical operators
JS: Program modules in JavaScript, function definitions,
JS: Scope rules, global functions, recursion
JS: Arrays, References and reference parameters,
passing arrays to functions
JS: Sorting arrays, multi-dimensional arrays.
JS: Math object, Boolean and Number object
JS: String object, Date object,
JS: Document object, Window object
JS: Using cookies
JS: Tutorial
JS: Introduction, Modeling a document, DOM Nodes
and Trees
JS: Traversing and modifying a DOM tree ,DOM
Collections
JS: Dynamic styles, summary of DOM objects and
Collections
JS: Traversing and modifying a DOM tree
JS: Traversing and modifying a DOM tree
JS: DOM Collections, dynamic styles
JS: Summary of DOM objects and Collections
JS: Registering event handlers, onload, onmousemove,
JS: The event object, this, onmouseover
JS: The event object, this, onmouseover
JS: onmouseout, onfocus, onblur
JS: onsubmit, onreset, event bubbling

% of portions covered
Percentage
Cumulative

19

19

23

42

23

65

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

35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

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
Web Server: Client side versus server scripting,
accessing web servers.
HTML5: Basics, Main features and semantic tags
HTML5: Canvas in detail
HTML5: Canvas in detail
HTML5: Local Storage
HTML5: Offline browsing and input types
HTML5: Autofocus and placeholders
Unit 5: PHP
PHP: Introduction, basics
T1:
Ch
23.1-23.7 PHP: Introduction, basics
(excluding 23.5)
PHP: string processing and regular expressions
PHP: string processing and regular expressions
PHP: form processing and business logic
PHP: form processing and business logic
PHP: using cookies
PHP: using cookies
PHP: dynamic content
PHP: dynamic content

15

80

20

100

Reference books:
Book Type

Code

Text Book

T1

Text Book

T2

Title

Author

Internet and World Wide

Web, How to Programme
HTML5 Up and Running

Deitel and Deitel

Mark Pilgrim

Edition

Publication Info
Publisher

th

Prentice Hall

st

Google Press

4 Edition
1 Edition

Reference Material:
Website

Code

Text Book

M1

Name

W3 Schools

Resource

www.w3schools.com

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

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

# ofHrs: 52
CHAPTER
TITLE /
REFERENCE
LITERATURE
Unit: 1 Logic (14 Hrs)
CLASS
#

% OF PORTIONS COVERED
TOPIC TO BE COVERED

Motivation for the course.

Basic connectives and truth tables.
Tautology and Contradiction
2.
Logical Equivalence
3.
The laws of logic
4.
The laws of logic (continued)
5.
Rules of Inference
6.
Rules of Inference (continued)
7.
T1:
1.1

1.6
Predicates and Quantifiers
8.
Predicates and Quantifiers (continued)
9.
Logical Equivalences involving Quantifiers
10.
Nested Quantifiers
11.
Combining Rules of Inference for Propositions
12.
and Quantified Statements
Introduction to Proofs
13.
Introduction to Proofs (continued)
14.
Unit: 2 - Sets, Functions and Relations (10 Hrs)
Sets and Operations in Sets, Relations
15.
Functions, Types of Functions
16.
Composition and Inverse of Functions
17.
Relations on a set
18.
T1:
Types of Relations
19.
2.1 - 2.3,
20. 7.1, 7.5, 7.6 Equivalence Relations
Equivalence Classes and Partitions
21.
Partial Orderings
22.
Hasse Diagrams
23.
Lattices
24.

UNIT-WISE

CUMULATIVE

27%

27%

19%

46%

19%

65%

1.

Unit: 3 Counting (10 Hrs)

T1:
Basic Counting Principles Sum Rule and
25.
5.1 - 5.4,
Product Rule

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

The Pigeonhole Principle

Applications of the Pigeonhole Principle
Permutations
Combinations
The Binomial Theorem and the Multinomial
30.
theorem
Permutations with Repetition
31.
Combinations with Repetition
32.
Introduction to Recurrence Relations
33.
Solving Recurrence Relations
34.
Unit: 4 Graph Theory Part 1 (10 Hrs)
Introduction to Graph Theory
35.
Basic Terminologies Directed & Undirected
36.
Graphs
Walks, Paths and Circuits
37.
Sub-graphs and Complements
38.
Graph Isomorphism
39.
T1:
Vertex Degree & Regular Graphs
40.
8.1 8.5
Konigsberg Bridge Problem
41.
Eulerian Graphs, Eulers Formula
42.
Hamilton Graphs
43.
Traveling Salesman Problem
44.
Unit: 5 - Graph Theory Part 2 (08 Hrs)
Planar Graphs - Definition & Examples
45.
Detection of Planarity
46.
Bipartite &Kuratowskis Graphs
47.
T1:
Graph Coloring: Proper Coloring & Chromatic
48. 8.7 8.8,
Number of Graphs
9.1,
Chromatic Polynomial
49. 9.3 - 9.5
Trees, Rooted Tree, Ordered Rooted tree
50.
Tree Traversals
51.
Spanning Tree, Minimum Spanning Tree
52.

26.
27.
28.
29.

6.1 - 6.3

19%

84%

16%

100%

References:
Book
Type

Code

Text Book

T1

Reference

R1

Title & Author

Discrete Mathematics and its
Applications - Kenneth H. Rosen (Indian
adaptation by Kamala Krithivasan)
Discrete and Combinatorial Mathematics:
An Applied Introduction - Ralph P.
Grimaldi and B V Ramana

Edition

Publication Info
Publisher

Year

Tata McGrawHill

2011

PEARSON

2011

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

Reference

R2

Reference

R3

Graph Theory with Applications to

Engineering and Computer Science NarsinghDeo
Discrete Mathematical Structures with
Applications to Computer Science J.P
Tremblay & R. Manohar

Prentice Hall India

McGrawHill

2004

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

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

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
P.E.S. University B.Tech. 3rdSemester Course Information - CSE Aug - Dec 2015 -14-

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
P.E.S. University B.Tech. 3rdSemester Course Information - CSE Aug - Dec 2015 -15-

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