Computer Science and Engineering

(Jan – May 2019)

GENERAL GUIDELINES

Do’s: -
  Students should be on time for every lecture.

  Students are advised to show due respect to all faculty members.

  Students should keep the Classrooms, Laboratories and Workshops clean and tidy.

  Students must maintain absolute discipline and decorum, while on campus.

 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 completed in all respects to
 the laboratory.

  Students are advised to clarify their doubts in the respective courses with the faculty.

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

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

Don’ts: -
  Students are not permitted to attend the class without the identity card, once issued.

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

 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 must not use their cell phones during class hours. If any student is found using
their cell phone during class hours, it will be confiscated.

 Students are not supposed to alter the configuration of the system / any software on the
systems.

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -1

 Computer Science and Engineering
(Jan – May 2019)

UE17MA251 – LINEAR ALGEBRA (3-1-1-0-4)

# of Credits: 4 # of Hours: 52
Class No. Portions to be covered Percentage
Covered/ Marks
allotted
1 Introduction to Linear Algebra
2-3 The Geometry of Linear Equations
4-5 Gaussian Elimination, Singular cases
6 Scilab Class Number1 – Gaussian Elimination
7 Elimination Matrices 20%
8 Triangular Factors and Row Exchanges 20 marks
9 Inverse by Gauss -Jordan Method, Transposes
10-11 Scilab Class Number 2&3- LU Decomposition and Inverses
12-14 Vector Spaces and Subspaces ( Definition only )
15-17 Linear Independence, Basis and Dimensions
18-19 The Four Fundamental Subspaces 40%
20-21 Scilab Class Number 4&5 – Span of Column Space of A and 20 marks
Four Fundamental Subspaces of A
22-24 Linear Transformations
25-26 Orthogonal Vectors and Subspaces
27 Cosines and Projections onto Lines 60%
28-29 Projections and Least Squares 20 marks
30 Scilab Class Number 6-Projections by Least Squares
31-32 Orthogonal Bases
33-34 The Gram- Schmidt Orthogonalization
35 Scilab Class Number 7- The Gram- Schmidt process
36-37 Introduction to Eigen values and Eigen vectors, Power 80%
Method 20 marks
38-39 Diagonalization of a Matrix
40-42 Scilab Class Number 8&9- Eigen Values and Eigen Vectors,
The Power Method
43 Tests for Positive Definiteness
44-45 Positive Definite Matrices and Least Squares, Semi definite
Matrices 100%
46-47 Singular Value Decomposition 20 marks
48-49 Applications of SVD
50 Scilab – In Semester Assessment
51-52 Lab Test Evaluation

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -2

 Computer Science and Engineering
(Jan – May 2019)

Literature

Publication Information
Book Type Code Title & Author
Edition Publisher Year

Linear Algebra and its Applications Thomson Brooks/

Text Book T1 4th 2007
by Gilbert Strang, , Cole

Higher Engineering Mathematics

Text Book T2 42nd Khanna Publishers
by B S Grewal

UE17CS251 - DESIGN AND ANALYSIS OF ALGORITHMS (4-0-0-0-4)

# of Credits: 4 # of Hours: 52
Class Chapter Topics to be Covered
# Title / % of Portion
Reference covered
Literature
Syllabus Cumu
lative
1 Unit #1 Motivation for the course.
Scheme of the course.
T1: Introduction to Algorithms.
2 Chapters Fundamentals of Algorithmic problem solving.
1 (1.1, 1.2, Important problem types – sorting, searching.
3 1.3), and Important problem types – string processing, 16% 16%
2 (2.1, 2.2, graph problems, Combinatorial , Geometrical,
2.3, 2.4) numerical problems
4 Analysis Framework, Orders of Growth
5 Asymptotic Notations
6 Basic Efficiency Classes
7 Analysis of Non-recursive Algorithms
8 Analysis of Recursive Algorithms
9 Unit #2 Brute-Force approach and Sequential Search
10 Brute-Force String Matching
11 T1: Selection Sort and Bubble Sort

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -3

 Computer Science and Engineering
(Jan – May 2019)

12 Chapters Depth First Search

13 3 (3.1, 3.2, Breadth First Search 23% 39%
14 3.4), Exhaustive Search – Travelling Salesman Problem
15 5 (5.2), and Knapsack Problem, Assignment Problem
16 4 (4.1, 4.2, Divide-and-Conquer approach with Mergesort
17 4.3, 4.4, Quicksort
18 4.5) Binary Search
19 Multiplication of Large Integers
20 Strassen’s Matrix Multiplication, Master Theorem

21 Unit #3 Decrease-and-Conquer approach - Insertion Sort

22 Topological Sorting
23 T1: Algorithms for Generating Combinatorial Objects
24 Chapters Decrease-by-a-Constant-Factor Algorithms
25 5 (5.1, 5.3, Transform-and-Conquer approach - Presorting 19% 58%
26 5.4, 5.5), Heapsort
27 and Balanced Search Trees - AVL Trees
28 6 (6.1, 6.2, AVL Tree Construction
29 6.3, 6.4, 2-3 Trees
30 6.5) B Trees

31 Unit #4 Space and Time Tradeoffs - Sorting by Counting

32 Distribution Counting Sort
33 T1: chapters Input Enhancement in String Matching –
7 (7.1, 7.2), Horspool’s algorithm
34 and Boyer-Moore Algorithm
35 8 (8.1, 8.2, Dynamic Programming approach 19% 77%
36 8.4) Examples of Dynamic Programming
37 Computing a Binomial Coefficient
38 Knapsack problem
39 Warshall’s Algorithm
40 Floyd’s Algorithm

41 Unit #5 Greedy Approach

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -4

 Computer Science and Engineering
(Jan – May 2019)

42 Prim’s Algorithm
43 T1 : Kruskal’s Algorithm
44 chapters Dijkstra’s Algorithm
45 9 (9.1, 9.2, Problem using Dijkstra’s Algorithm
46 9.3, 9.4), Huffman trees
47 11 (11.1, Comparison of Design Strategies
48 11.2, 11.3), Lower Bound Algorithms 23% 100%
49 and 12 Decision Trees
50 (12.1, 12.2) P, NP and NP Complete problems
51 Backtracking: N queens Problem, Hamiltonian
circuit Problem
52 Branch-and-Bound: Knapsack Problem, Travelling
Salesman Problem

Literature

Title & Author Publication Information

Book
Code
Type Edition Publisher Year

Introduction to The Design and Analysis

Text
T1 of Algorithms 2 Pearson 2011
Book
Anany Levitin
Introduction to Algorithms
Refer
Thomas H. Cormen, Charles E. Prentice-Hall India
ence R1 3 2009
Leiserson, Ronald L. Rivest and Clifford
Book
Stein
Refer
Horowitz, Sahni, Rajasekaran,
ence R2 2 Universities Press 2007
Fundamentals of Computer Algorithms
Book
Refer
Jon Kleinberg, Eva Tardos, Algorithm
ence R3 Pearson Education 2006
Design
Book

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -5

 Computer Science and Engineering
(Jan – May 2019)

UE17CS252: DATABASE MANAGEMENT SYSTEMS (4-0-0-0-4)

# of Credits: 4 # of Hours: 52
CHAPTER % OF PORTIONS COVERED
CLASS TITLE /
REFERENCE TOPIC TO BE COVERED REFERENCE
# CUMULATIVE
CHAPTER
LITERATURE
Unit #: 1 – Introduction to Database and Conceptual Design using ERD
1 Introduction to Databases (Ch. 1.1 – 1.5)
2 Introduction to Databases, (Ch. 1.6 – 1.8)
Data models, Three-Schema Architecture,
Data Abstraction and Data Independence,
3
Database Languages and Interfaces (Ch 2.1
T1: Chapter – 2.3)
1.1 – 1.8, Conceptual Data Modeling – ER Model (Ch
4
2.1 - 2.3, 3.1 – 3.2)
19 19
5 3.1 - 3.7, Entity Relationship Model (Ch 3.3 - 3.4)
6 3.9 Entity Relationship Model (Ch 3.5 -3.6)
3.10 Revision with Company database. Entity
7
Relationship Model (Ch 3.7)
8 Entity Relationship Model (3.9),
ER Model Exercises (University schema)
9
(3.10)
10 ER Model Exercises (Student Project)
Unit #: 2 – The Relational Data Model, Constraints, and Basic SQL
Relational Model Concepts , Constraints
11
and Schema (Ch 5.1, 5.2)
Update Operations, Transactions and
12
Dealing with Constraint Violations (Ch 5.3)
Relational Database Design Using ER-to
13
T1: 5.1, 5.2, Relational Mapping (Ch 9.1)
5.3, 9.1, 6.1, ER to Relational mapping examples (Ch 19 38
14
6.2, 6.3, 6.4, 9.1)
7.4 Introduction to SQL commands. SQL Data
Definition, Primary Data Types and
15
Advanced
Data Types like CLOB, BLOB, (Ch 6.1)
16 Specifying Constraints in SQL, (Ch 6.2)

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -6

 Computer Science and Engineering
(Jan – May 2019)

Schema Change Statements in SQL, (Ch

17
7.4)
Insert, Delete, Update, Basic Retrieval
18
Queries, (Ch 6.4, 6.3)
Relational Model, SQL Exercises (University
19
schema)
Relational Model, SQL Exercises (Student
20
Project)
Unit #:3 – Advanced SQL Queries, Relational Algebra
Advanced SQL Queries, NULL values,
21
Nested Queries. (7.1.1 – 7.1.2)
Advanced SQL Queries, Correlated Nested
22
Queries (7.1.3)
Advanced SQL Queries, Outer Joins (7.1.4 –
23
7.1.6)
Advanced SQL Queries, Aggregate
24
Functions (7.1.7 – 7.1.8)
T1: 7.1 - 7.3,
Views, Specifying General Constraints as
25 8.1 – 8.5
Assertions and Triggers, (7.2, 7.3) 19 57
Summary of
Relational Algebra, Unary Relational
26 Ch 10 & 11
Operations: SELECT and PROJECT (8.1)
27 Set Theory Operations and Examples (8.2)
Binary Relational Operations: JOIN. (8.3 -
28
8.3.3)
DIVISION, Aggregate functions and
29
grouping, Examples (8.3.4 - 8.5)
Database Programming, PL/ SQL.
30
(Summary of Ch 10 and 11)
Unit #:4 – Relational Database Design
Informal Design Guidelines for Schema, (Ch
31 14.1)

Functional Dependencies (FD) Definitions

32
and examples, Inference Rules. (Ch 14.2) 19 76
T1: 14.1 -
FD: Closure, Equivalence, Minimal Cover,
33 14.5, 15.1
(Ch 15.1)
Exercise for Closure, Equivalence, Minimal
34
Cover, (Ch 15.1)

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -7

 Computer Science and Engineering
(Jan – May 2019)

Normal Forms Based on Primary Keys (1st,

35 2nd
and 3rd NF). (Ch 14.3)
General Definitions of Normal Forms,
36
Boyce-Codd Normal Form (Ch 14.4, 14.5)
37 Exercises on Normal Forms.
Overview of Higher Normal Forms. (Fourth
38
Normal Form) (14.6)
Properties of Relational Decompositions,
39
(Ch 15.)
Relational Database Design (Student
40
Project)
Unit #: 5 - Transaction Management and Database Security
DBMS Modules (2.4),
41
Database Security, Access Control.
ACID Properties, Transactions and
42
Schedules,
43 Serializability and Recoverability,
Concurrency, Lock-Based Protocols, 2PL,
44 Strict 2PL Protocols, Timestamp-Based
Protocols,
Deadlocks - Detection and Prevention, 24 100
45
Precedence Graphs,
46 Introduction to Crash Recovery,
Crash Recovery - Write Ahead Log, ARIES
47
Protocol
48 Crash Recovery, Examples
49 Crash Recovery, Exercises
50 NoSQL databases.
51 Advanced Topics,
52 Guest Lecture

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -8

 Computer Science and Engineering
(Jan – May 2019)

Publication Info
Book Type Code Title & Author
Edition Publisher Year
Fundamentals of Database Systems,
Text T1 Ramez Elamsri, Shamkant B 7th Pearson 2017
Navathe

“Database Management Systems”,

Text T2 Johannes Gehrke, Raghu 3rd McGraw-Hill 2003.
Ramakrishnan
“Database Systems: The Complete
Reference R1 Book”, Garcia-Molina, J D Ullman, 2nd Prentice-Hall 2008
Widom J
“Database System Concepts”,
Reference R2 Silberschatz, H Korth, S Sudarshan, 6th McGraw-Hill 2010

UE17CS253: MICROPROCESSOR AND COMPUTER ARCHITECTURE (4-0-0-0-4)

# of Credits: 4 # of Hours: 52
Class # Chapter Title / % of portions
Reference Topics to be Covered covered
Literature Reference Cumula
Chapter tive
UNIT 1: Introduction to Microprocessor, & ISA (10 hours )
1 Introduction Case study -ARM/MIPS/x86
processor.Overview of Microprocessor :
Evolution and Introduction to INTEL Processor
2 ISA – Classification
1.6 , 2.3 of T3,
3 Introduction to RISC and CISC Processors
A-3 of T1, RISC Architecture
pg no: 51-55 of
4 Instruction Set-Addressing Modes
T3 20% 20%
5 Data Processing Flow, Control Flow
Chapter 3.1 to
instructions
3.5 of T4
6 Data Processing Instructions
6.8 , 5.6 of T3
7 Conditional Execution Instructions
8 Branch Instructions & Functions
9 Interrupt Instructions
10 Instruction encoding,
UNIT 2 Pipelining ( 12 hours)

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -9

 Computer Science and Engineering
(Jan – May 2019)

11 Introduction to Pipelining,
3 stage pipelining
12 5 stage pipelining
13 4.1 of Text T3 Pipeline hazards
14 Data Hazards
Appendix
15 Data Hazards continued..
C-1, C-2, Sec
16 Data Hazards continued..
1.1 , 1.4, 1.5 of 25% 45%
17 Structural Hazards
T1
18 Branch Hazards
19 Branch Prediction
20 Continued..
21 Performance Metrics,
22 Trends in technology, power & energy in
Integrated Circuits
UNIT 3: Memory Hierarchy ( 10 Hours)
23 Introduction to Memory Hierarchy
24 Fully Associative Cache Memory
25 Direct Map Cache Memory
26 Set Associative Cache Memory
27 Appendix B.1, Cache Performance Problems
20% 65%
28 B.2, B.3 of T1 Basic cache Optimizations
29 First & Second optimizations
30 Third & Fourth Optimizations
31 Fifth & Sixth Optimizations
32 Fifth & Sixth Optimizations continued..
UNIT 4 : I/O and Interrupts (10 Hours)
33 Exceptions & Interrupts : Introduction
34 Chapter: 9.1 to Interrupts handling mechanism
35 9.3 of T4 Polling & Daisy Chain Techniques
36 Chapter 9 of Case Study: ARM Architecture
37 T3. Continued..
20% 85%
38 Chapter 4.1 Programmable Interrupt Controller
39 4.2, 4.4 (only Continued..
40 DMA) Direct Memory Access
41 DMA continued
42 AMBA and APB bus
UNIT 5 : Advances in Architecture ( 10 Hours)
43 Introduction to Parallel Architecture
15% 100%
44 Sec 1.9 of T1, Continued..

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -10
 Computer Science and Engineering
(Jan – May 2019)

45 Sec 3.1, 4.1, Amdahl’s Law & Problem

46 Gustafson’s Law & Problem
47 Introduction to Instruction Level Parallelism
(ILP)
48 Continued..
49 Introduction to Data Level Parallelism (DLP).
50 Continued..
51 Introduction Multicore Architecture
52 Revision

Literature:
Code Title & Author Publication Info
Book Type
Edition Publisher Year
MK Morgan
Text Book T1 Hennessy Patterson Fifth Edition 2012
Kaufmann
Mc-Graw Hill
Text Book T2 Computer Organization Fifth Edition 2011
education
ARM System on Chip, Steve Second Pearson
Text Book T3 2000
Furber Edition, Education
ARM System Developer's
Text Book T4 Reprint 2009 Elsevier 2009
Guide

UE17CS254: THEORY OF COMPUTATION (4-0-0-0-4)

# of Credits: 4 # of Hours: 52
Uni Chapter & % Coverage
Hours Topic
t Section Unit Total
1 1.2, 1.3, 1.7,
Introduction
1.8
2
3
Deterministic Finite Automata, Construction 2.1 – 2.8, 2.11
4 1 21.17 21.17
5
6
Non–Deterministic Finite Automata 3.1, 3.2
7
8 Equivalence of Deterministic and Non– 3.3, 3.4

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -11
 Computer Science and Engineering
(Jan – May 2019)

9 Deterministic Finite Automata

10
Minimizing Finite Automata 3.5
11
12 Regular Expressions, Construction of Regular 4.1 – 4.4, 4.7,
13 Expressions 4.9
14 Equivalence of RegEx and
4.5 – 4.6
15 Finite Automata
16 Regular Grammars 5.1 – 5.3
2 19.23 40.40
17 Equivalence of Regular Grammar & Finite
5.4 – 5.6
18 Automata
19 Closure Properties of Regular Languages 6.1, 6.2
20 Pumping Lemma and identifying Non–Regular
6.3 – 6.5
21 Languages
22 Context–Free Languages 7.1, 7.2
23
Constructing Context–Free Grammars: Linear &
24 7.3, 7.4
Non – linear
25
26
Parsing and Ambiguity 7.6 – 7.8
27 3 21.15 61.55
28
29 Constructing Pushdown Automata 8.1 – 8.3
30
31
Non–Deterministic Pushdown Automata 8.7
32
33 Deterministic Pushdown Automata and
11.12
Deterministic Context–Free Languages
34 Greibach Normal Form, Conversion of CFG to
7.11, 8.5
35 4 PDA 21.15 82.70
36 Conversion to Chomsky Normal Form, A
37 Membership Algorithm for Context–Free 7.9, 7.10
38 Languages

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -12
 Computer Science and Engineering
(Jan – May 2019)

39 Simple and Linear Grammars 7.12

40
Closure Properties Context Free Languages 9.1 – 9.4
41
42
Pumping Lemma for Context–Free Languages 9.5, 9.6
43
44 The Standard Turing Machine 10.1 – 10.3
45
46 Constructing Turing Machines 10.4
47
48 10.7, 10.9,
Church–Turing Thesis , Universal Turing Machine
10.10
5 17.30 100
49 Recursive and Recursively Enumerable
Languages 11.1 – 11.8,
11.13
50 Diagonalization, Chomsky hierarchy
51 Post Correspondence Problem, The Halting
12.1, 12.3
Problem of Turing Machines
52 Undecidable Problems 12.7
Textbook:
Theory of Computation: A Problem–Solving Approach, Kavi Mahesh, Wiley India, New Delhi,
2012.

UNIT# Sections
UNIT – I 1.2, 1.3, 1.7, 1.8, 2.1 – 2.8, 2.11, 3.1 – 3.5
UNIT – II 4.1 – 4.7, 4.9, 5.1 – 5.6, 6.1 – 6.5
UNIT – III 7.1 – 7.4, 7.6 – 7.8, 8.1 – 8.3, 8.7
UNIT – IV 7.9 – 7.12, 8.5, 9.1 – 9.6, 11.12
UNIT – V 10.1 – 10.4, 10.7, 10.9, 10.10, 11.1 – 11.8, 11.13, 12.1 – 12.13, 12.7

References:
An Introduction to Formal Languages and Automata, Peter Linz, 5th Edition, Jones and Bartlett,
New Delhi, India, 2011.
Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Rajeev
Motwani, Jeffrey D. Ullman, 3rd edition, Pearson Education, Delhi, India, 2009.
Theory of Computation, Michael Sipser, Cengage Learning, New Delhi, India, 2008.

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -13
 Computer Science and Engineering
(Jan – May 2019)

UE17CS255 - DESIGN AND ANALYSIS OF ALGORITHMS LABORATORY (4-0-0-0-4)

# of Credits: 1 # of Weeks: 13
Session Tasks
Introduction to the lab environment.
- Compile and execution of a C program in Linux.
1 - Handling Input-Output formats with large number of test-cases.
Brute Force: Implementation of Sequential Search algorithm
Find the key element in an array of integers using the sequential search algorithm.
Brute Force: Implementation of String Matching algorithm
2 Find a pattern of length m in a text of length n using the naive string matching
algorithm.
Brute Force: Implementation of Bubble Sort algorithm
Sort a given array of integers using the bubble sort algorithm.
3
Brute Force: Implementation of Selection Sort algorithm
Sort a given array of integers using the selection sort algorithm.
Brute Force: Solution for Traveling Salesperson Problem
4 Find a solution to the traveling salesperson problem using the exhaustive search
method.
Divide and Conquer: Implementation of Merge Sort
Sort a given array of integers using the merge sort algorithm.
5
Divide and Conquer: Implementation of Binary Search
Search for a key element in a sorted array of integers.
Divide and Conquer: Implementation of Quick Sort
6
Sort a given array of student records using the quick sort algorithm.
Decrease and conquer: Implementation of Insertion Sort algorithm
Sort a given array of student records using the insertion sort algorithm.
7
Decrease and conquer: Demonstration of BFS
Find the minimum number of hops required between source and destination node in an
undirected graph given in the form of an adjacency matrix using BFS technique.
Decrease and conquer: Demonstration of DFS algorithms
Find the number of components of an undirected graph given in the form of an
8 adjacency matrix using DFS technique.
Decrease and conquer: Topological Sorting of vertices in a digraph
Find a topological order of a directed acyclic graph using the DFS technique.
Transform and Conquer: Implementation of Heap Sort algorithm
9
Sort a given array of student records using the heap sort algorithm. Use bottom up

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -14
 Computer Science and Engineering
(Jan – May 2019)

approach for the heap construction.

Space and Time Tradeoffs: Implementation of Sorting by Distribution Counting
algorithm
Sort a given array of student records using the distribution counting sort algorithm.
Space and Time Tradeoffs: Implementation of Horspool’s algorithm
10
Find a pattern of length m in a text of length n using the Horspool’s algorithm.
Dynamic Programming: Implementation of Warshall’s algorithm
Find the transitive closure of a graph given in the form of an adjacency matrix.
11
Dynamic Programming: Implementation of Floyd’s algorithm
Find all-pairs-shortest-paths of a weighted graph given in the form of a cost matrix.
Dynamic Programming: Solution for the Knapsack Problem
12
Find the solution to a 0/1 Knapsack problem using Dynamic Programming technique.
Greedy Technique: Implementation of Prim’s algorithm
Find a minimum spanning tree of a weighted connected undirected graph using the
Prim’s algorithm.
13
Greedy Technique: Implementation of Dijkstra’s algorithm
Find single-source-shortest-paths of a weighted connected graph using the Dijkstra’s
algorithm.

UE17CS256: MICROPROCESSOR AND COMPUTER ARCHITECTURE LABORATORY (0-0-2-0-1)

# of Credits: 1 # of Weeks: 13
Lab# Program No Title of the program/ Problem Statement
1 Program 1 Debugging assembly language code using a simulator.
2 Program 2 Program using data processing instructions.
3 Program 3 Program using logical and looping instructions.
4 Program 4 Program using functions and subroutine instructions.
5 Program 5 Program to perform operations on string data.
6 Program 6 Program using recursion.
7 Program 7 Program to interface with input / output devices.
8 Program 8 Install setup and configure a single board microcomputer system.
9 Program 9 Mini Project
10 Program 10 Mini Project
11 Program 11 Mini Project
12 Program 12 Mini Project
13 Program 13 Mini Project

P.E.S.University B.Tech.4th Semester Course Information - CSE Jan- May 2019 -15