3rd 4th Scheme Syllabus CSE

DAYANANDA SAGAR COLLEGE OF ENGINEERING
(An Autonomous Institution affiliated to Visvesvaraya Technological University, Belagavi& recognized by AICTE)
NAAC Accredited with A Grade
ISO 9001:2008 Certified

CHOICE BASED CREDIT SYSTEM (CBCS)
SCHEME OF TEACHING AND EXAMINATION 2015-2016
B. E. COMPUTER SCIENCE & ENGINEERING

III SEM
Teaching
Examination
Subject Teaching Hours/Week
Sl. No. Subject Credit
Code Department
L T P CIE SEE Total
1 MAT31 Engineering Mathematics-III MATHS 4 0 0 50 50 100 4
2 CS32 Data Structures with C CSE 4 0 0 50 50 100 4
3 CS33 OOPS with Java CSE 4 0 0 50 50 100 4
4 CS34 Logic Design CSE 3 0 0 50 50 100 3
5 CS35 Computer Organization CSE 3 0 0 50 50 100 3
6 CS36 Discrete Mathematical Structures CSE 3 0 0 50 50 100 3
7 CSL37 Data Structures Laboratory CSE 0 1 2 50 50 100 2
8 CSL38 Java Programming Laboratory CSE 0 1 2 50 50 100 2
Total 400 400 800 25

ENGINEERING MATHEMATICS-III
Sub. Code: MAT31 CIE:50
Hrs./ Week: 4 SEE:50
Total Hrs.: 52 Exam Hours: 3
Course Objectives:
1. Generalize a periodic function as a sum of series of trigonometric functions using Fourier
series.
2. Explain the concept of Fourier and Z transform and state the use of it in time varying
signals (continuous).
3. Finding solutions of equations and also evaluating approximate areas and volume using
numerical methods.
Course outcomes:
1. Explain Fourier series, reproduce Fourier transforms & Z- transform and list numerical
methods for various analytical problem.
2. Expand a function using Fourier series, operate Fourier transform, Z-transform and
practice numerical methods.
3. Rewrite a function using Fourier series, summarize Fourier and Z-transforms and compare
numerical solution with analytical solution.
Course Content
Module 1
FOURIER SERIES:
Periodic functions, Dirichlets conditions, Fourier series of periodic functions of period and
with arbitrary period 2 , Half-range Fourier sine and cosine series,Practical Harmonic Analysis.
12 Hours
(Self Study Component:Infinite Series-Convergence, Divergence of infinite series of positive
terms (p-series Ratio test, Comparison test))
Module 2
FOURIER TRANSFORMS:
Infinite Fourier transform, Infinite Fourier sine and cosine transforms, Inverse Fourier transforms,

Inverse Fourier sine and cosine transforms, Convolution theorem (without proof) and problems.
10 Hours
(Self Study Component:Properties of Fourier transforms (without proof).)
Module 3
Curve fitting: Curve fitting by the method of least squares, Fitting of the curves of the form
Numerical Methods: Numerical solution of algebraic and transcendental equations,Regula-Falsi

method, Newton-Raphsonmethod. 10 Hours
(Self Study Component:Fixed point iteration method.)
Module 4
FINITE DIFFERENCES: Forward and Backward differences, Newtons forward and Backward
interpolation formulae. Newtons divided difference formula, Lagranges interpolation formula
and inverse interpolation formula (without proofs).
Numerical Integration: Simpsons 1/3rd, 3/8th rule, Weddles rule (all formulae/rules without
proof). 10 Hours
(Self Study Component: Trapezoidal rule.)
Module 5
Z-TRANSFORMS:
Z-Transforms, Standard Z-transforms, Damping rule, Shifting rule, Initial value and final value
theorems (without proof), Inverse Z-transforms, Application of Z-transforms to solve difference
equations. 10 Hours
(Self Study Component: Region of convergence.)
Note: NO questions from Self Study Component.

Text Books:
1. B.S. Grewal, Higher Engineering Mathematics Khanna Publishers, 43rd Edition, 2014
June, ISBN:978817409195.
2. Erwin Kreyszig; Advanced Engineering Mathematics; John Wiley & Sons, 9th Edition,
2007, ISBN: 9788126531356.
References:
1 B.V.Ramana, Higher Engineering Mathematics, Tata McGraw-Hill, 2006,

ISBN:9780070634190
2 M. K. Jain, S. R. K. Iyengar and R. K. Jain Numerical Methods: For Scientific and

Engineering Computation, New Age International Publications, 6th Edition, 2012, ISBN:
9788122433234.
3. Murray Speigel, Schaum's Outline of Advanced Mathematics for Engineers and

Scientists McGraw-Hill, 1971, ISBN: 9780070602168.
4. Steven C. Chapra and Raymond Canale, Numerical methods for Engineers, McGraw-
Hill Education,7th Edition, 2014, ISBN: 007339792X.
Data Structures with C
Sub Code: CS32 CIE:50

Hrs / Week: 04 SEE:50
Total Hrs: 52 Exam Hours:03
Course objectives:
This course will enable students to
1. Explain fundamentals of data structures and their applications essential for programming /
problem solving
2. Analyze Linear Data Structures: Stack, Queues, Lists
3. Analyze Non-Linear Data Structures: Trees, Graphs
4. Assess appropriate data structure during program development / problem solving
Course Outcome
1. Acquire knowledge of - Various types of data structures, operations and algorithms. -

Sorting and searching operations.
2. Analyze the performance of - Stack, Queue, Lists, Trees, Graphs, Searching and Sorting
techniques.
3. Implement all the applications of Data structures in a high-level language.
4. Design and apply appropriate data structures for solving computing problems.
Course Content
Module 1
BASIC CONCEPTS: Structure & Union, Introduction to Data Structure and its classification,
the need for Data structure, Algorithm specification, performance analysis & measurements,
Polynomials and Sparse Matrices. 11 Hours
(Self-study components: Dynamic Memory Allocation)
Module 2
STACKS AND QUEUES: Introduction to Stacks, Stacks Using Dynamic Arrays, Evaluation of
Expressions, Introduction to Queues, Types of Queue: Ordinary queue, Circular Queues &
Double ended queue, Application of stacks and Queues. 11Hours
(Self-study components: Multiple Stacks and Queues)
Module 3
LINKED LISTS: Definition of Linked lists and Chains, Representing Chains in C, Types of
Linked List: Singly Linked List, Circular Singly Linked List, Doubly Linked Lists & Circular
doubly linked list, Application of Linked List. 10Hours
(Self-study components: Operation on Linked list using Stacks, Queues, Polynomials )
Module 4
TREES & GRAPH: Introduction to Binary Search Trees (BST), Properties of Binary Tree,
Operation on BST, Traversals in Binary Trees, Heaps, Selection Trees, Forests tree, Counting
Binary Trees. 10Hours
(Self-study components: Introduction to Graph, properties of graph, Representation of graph in
memory)
Module 5
EFFICIENT BINARY SEARCH TREES: Optimal Binary Search Trees, AVL Trees,
Properties of AVL tree, Construction of AVL tree, Red-Black Trees, Properties of red black tree,
Construction of red black tree. 10 Hours
(Self-study components: Splay Trees)
Text Book:
1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd Edition,

Universities Press, 2007.
Reference Books:
1 Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and C++, 2nd Edition, Pearson
Education, 2003.
2 Richard F. Gilberg and Behrouz A. Forouzan: Data Structures A Pseudocode Approach with C,
Cengage Learning, 2005.
3 A.M Padma Reddy, Approach of Data Structures, Person Publication, 5th Edition, 2015
4 Reema Theraja Data Structure using C. 1st Edition , 2014

OOPS with Java

Hrs/ Week: 04 SEE:50
Total Hrs: 52 Exam Hours: 03
Course Objectives:
1. Compare procedural and object oriented programming languages.
2. Understand fundamentals of programming such as variables, conditional and iterative

Execution and methods.
3. Understand fundamentals of object-oriented programming in Java, including defining classes,

invoking methods, and using class libraries.
4. A deep understanding of the concepts of Interfaces, Exception Handling and Multithreaded

programming.
Course Outcomes:
After completing the course the student is expected to know
1. Design, write, compile and test programs using the basic constructs and the object oriented
paradigms.
2. Demonstrate the ability to use various types of selection constructs in a Java program. Be able
to employ a hierarchy of Java classes to provide a solution to a given set of requirements.
3. Given a problem statement, the student is expected to divide the same into different
interrelated modules and design the individual modules and integrate them.
Course Content
Module 1
Overview of Java: Object Oriented Programming, Java and Java applications, java
Development kit(JDK); Java is interpreted, Byte code, JVM, Java Buzzwords, A simple program,
Two Control statements, arrays, Lexical Issues.
Operators: Arithmetic operators, Bitwise operators, Relational operators, the assignment

operators, The ? Operator, operator precedence logical expression, type casting, strings.
Control Statements: Selection statements, iteration statements, Jump statements.
Introducing Classes: Class fundamentals, declaring Objects, creating and destroying objects,
assigning object reference variables, access specifiers, introducing methods, constructors, this
keyword, garbage collection, the finalize() method. 10 Hours
(Self Learning Component: Data types and other tokens: Boolean Variables, int, long, char,
white spaces, literals.)
Module 2
A Closer Look at Methods and Classes: Overloading methods, Overloading constructors, using
objects as parameters, a closer look at argument passing, returning objects, recursion, introducing
access control, understanding static, introducing final, nested and inner classes, using command
line arguments
Inheritance: inheritance basics, using super, creating multilevel hierarchy, method overriding,
using abstract classes, using final with inheritance.
Input/Output: I/O Basics, Reading Console Input, Writing Console Output, Reading and
Writing files. 10 Hours
(Self Learning Component: the PrintWriter Class, dynamic method dispatch.)
Module 3
Packages: Defining a package, Access protection; importing packages.
Interfaces: Defining an Interface, Implementing Interface, Nested Interface, Applying interfaces,

Variables in interfaces.

Exception handling: Fundamentals, Exception types, uncaught exceptions, using try and catch,
nested try statements, throw, throws, finally. 10 Hours
(Self Learning Component: Interfaces can be extended, multiple catch clauses, Java's built-in
exceptions.)
Module 4
Multithreaded Programming: Java thread model, main thread, creating a thread, creating
multiple threads, using isAlive( ) and join( ), suspending, resuming thread.
String handling: String Constructors, String Length, Special string operators, character
extraction, string comparison. 11 Hours
(Self Learning Component: thread priorities, stopping thread, searching strings, modifying a
string.)
Module 5
Generics: What are Generics? A Simple Generics Example, A generics Class with two type
parameters, The General form of a Generic Class, creating a generic method.
The Collections Framework: Collections Overview, the Collection Interfaces, the Collection
Classes 11 Hours
(Self Learning Component: generic interfaces, java.lang: Primitive Type Wrappers.)
Text Books:
1. Herbert Schildt: Java The Complete Reference, 7th Edition, Tata McGraw Hill, 2007.
Reference Books:
1. Y. Daniel Liang: Introduction to JAVA Programming, 6th Edition, Pearson Education,

2007.
2. Kathy Sierra and Bert Bates: Head First Java, 2nd Edition, O' Reilly
3. Understanding OOP with Java, updated edition, T. Budd, pearson eduction.
4. An Introduction to programming and OO design using Java, J.Nino and F.A. Hosch, John
wiley & sons.
LOGIC DESIGN
Sub. Code: CS34 CIE: 50
Hrs./ Week: 3 SEE: 50
Total Hrs.: 40 Exam Hours: 03
Course Objectives:
1. Explain Digital and analog signals, its working and difference between them and positive
and negative logic.
2. Simplification of Algebraic Equations using different methods.(K-Map, Quine-
McCluskey, EVM).
3. Design and Analysis of Data processing circuits using Multiplexers, De-Multiplexers,
Decoders, Encoders, Programmable Logic Device.
4. Design and synthesis of sequential circuits using Flip-Flops, Counters, Registers.
Course Outcomes:
1. The Students will be able to understand positive and negative logic, Digital and analog
signals with its working and difference.
2. The Students will be able to solve algebraic equations using K-Map, EVM and Quine-
Mcclukey Technique.
3. The Students will be able to Design various Data processing circuits using Multiplexer,
De-Multiplexer, Decoders, Encoders, programmable array logic, programmable logic
array.
4. The Students will be able to understand & synthesis Sequential Circuits using various
Registers, Counters and Flip-flops (JK, D, SR, T).
Course Content
Module 1
Combinational Logic Circuits: Digital Signals, Basic Gates and Universal Gates, Positive and
Negative Logic, Sum-of-Products Method, Product-of-sums Method, Karnaugh Map, Pairs,
Quads, and Octets, Karnaugh Simplifications, Dont-care Conditions, Sum-of-Products
simplifications, Product-of-sums simplifications. 8 Hours
(Self Study Component: Simplification by Quine-McClusky Method & EVM Method.)


Module 2
Data-Processing Circuits: Multiplexers, De-multiplexers, 1-of16 Decoder, Encoders, Priority
Encoder, Magnitude Comparator, BCD to 7 segment Decoder, Programmable Logic Device,
Programmable Array Logic, Programmable Logic Arrays. 8 Hours
(Self Study Component: Parity Generators and Checkers.)
Module 3
Clocks, Flip-Flops: Clock Waveforms, Types of triggering, Flip-Flop Timing, D Flip-Flop, T

Flip-Flop, SR Flip-Flop, JK Flip-Flop, JK Master-slave Flip-Flop 8Hours
(Self Study Component: Latches Vs Flip-Flops )
Module 4
Registers: Types of Registers, Serial In -Serial Out, Serial In - Parallel out, Parallel In- Serial
Out, Parallel In - Parallel Out, Applications of Shift Registers. 8 Hours
(Self Study Component: Universal Shift Register.)
Module 5
Design of Synchronous and Asynchronous Counters: Asynchronous Counters, Synchronous
Counters, design of up and down counters, Decoding Gates, Ring Counters, Decade Counters.
8 Hours
(Self Study Component: Asynchronous Counters Vs Synchronous Counters. )
Text Book:
Donald P Leach, Albert Paul Malvino & GoutamSaha: Digital Principles and Applications, 7th
Edition, Tata McGraw Hill, 2010.
Reference Books:
1. R D Sudhaker Samuel: Illustrative Approach to Logic Design, Sanguine-Pearson, 2010.
2. A.P.Godse, D.A.Godse: Logic Design, Technical Publications,2011
3. M Morris Mano: Digital Logic and Computer Design, 10th Edition, Pearson Education,
2008.

4. Charles H. Roth: Fundamentals of Logic Design, Jr., 5th Edition, Cengage Learning, 2004.
5. Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss: Digital Systems Principles and
Applications, 10th Edition, Pearson Education, 2007.
6. Stephen Brown, ZvonkoVranesic: Fundamentals of Digital Logic Design with VHDL, 2nd
Edition, Tata McGraw Hill, 2005
COMPUTER ORGANIZATION
Course Objectives:
The Course introduces students:
1. To learn and understand the fundamental concepts of how Computer Systems works & its
basic principles.
2. To learn and understand I/O device address, Interrupts and different buses.
3. To learn and understand the current state of art in memory system design.
4. To impart knowledge on arithmetic concepts of signed numbers, Adders Design,
Multiplication and floating point numbers.
Course Outcomes:
After completing the course,
1. Students will have the knowledge of the fundamental concepts of how Computer Systems
works &its basic principles.
2. The students will have knowledge of I/O device address, Interrupts and different buses.
3. The students will be able to design simple memory systems.
4. The student will have the knowledge on arithmetic concepts of signed numbers, Address
design, Multiplication and floating point numbers.
Course Content
Module 1
Basic Structure of Computers: Functional Units, Basic Operational Concepts, Performance

Processor Clock, Basic Performance Equation, Clock Rate, Performance Measurement. Machine

Instructions and Programs: Arithmetic Operations and Characters, Memory Location and
Addresses. 08 Hours
(Self-Study Component: Memory Operations, Instructions and Instruction sequencing.)
Module 2
Input/ Output Organization: Accessing I/O Devices, Interrupts Interrupt Hardware, Enabling
and Disabling Interrupts, Handling Multiple Devices, Controlling Device Requests, Exceptions
08 Hours
(Self-Study Component: Addressing Modes)
Module 3
Direct Memory Access, Buses, Interface Circuits, Standard I/O Interfaces PCI Bus, SCSI Bus
08 Hours
(Self-Study Component: USB)
Module 4
Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories,
Speed, Size, and Cost, Cache Memories Mapping Functions, Replacement Algorithms,
Performance Considerations, Virtual Memories 08 Hours
(Self-Study Component: Secondary Storage)
Module 5
Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication
of Positive Numbers, Signed Operand Multiplication, Fast Multiplication, Integer Division,
Floating-point Numbers and Operations, IEEE Standard for Floating-point Numbers.
08 Hours

(Self-Study Component: Basic Processing Unit: Single bus organization, Execution of a
complete instruction.)
Text Books:
1. Carl Hamacher, ZvonkoVranesic, SafwatZaky: Computer Organization, 5th Edition, Tata
McGraw Hill, 2002. (Listed topics only from Chapters 1, 2, 4, 5, 6)
Reference Books:
1. William Stallings: Computer Organization & Architecture, 7th Edition, PHI, 2006.
2. Computer Systems Design and Architecture by Vincent P. Heuring & Harry F. Jordan,
Ed2, Pearson Education
DISCRETE MATHEMATICAL STRUCTURES

Sub. Code: CIE: 50
CS36
Hrs./ Week: 3 SEE: 50
Total Hrs.: 40 Exam hours: 3
Course Objectives:
1. Explain Fundamentals of Sets, Probability Concepts and their Applications essential for
Problem Solving.
2. Analyze Mathematical Logic using truth tables, laws of logic, Rules of Inference and
Proofs.
3. Explain Properties of Relations and various types of functions, Partial order and Hasse
diagrams during problem solving.
Course Outcomes:
1. Acquire knowledge of - basics of Set Theory & Probability concepts
2. Improves logical reasoning and problem solving skills on how the fundamentals of logic
can be applied for applications like switching networks.
3. Ability to apply various concepts of functions and relations for solving computing
problems.
Course Content
Module 1
Set Theory: Sets and Subsets, Set Operations and the Laws of Set Theory, Counting and Venn
Diagrams, A First Word on Probability. 8 Hours
(Self Study Component: Countable and Uncountable Sets.)
Module 2
Fundamentals of Logic I: Basic Connectives and Truth Tables, Logic Equivalence The Laws
of Logic, Logical Implication Rules of Inference 8 Hours
(Self Study Component: Duality.)

Module 3
Fundamentals of Logic II : Quantifiers ,The Use of Quantifiers, Quantifiers Types ,Methods of
Proofs and Methods of Disproofs. 8Hours
(Self Study Component: Open statements.)
Module 4
Relations and Functions: Cartesian Products and Relations, Functions Plain and One-to-One,
Onto Functions Stirling Numbers of the Second Kind, Pigeon-hole Principle, Function
Composition. 8Hours
Self Study Component: Special Functions.
Module 5
Relations II: Properties of Relations, Zero-One Matrices and Directed Graphs, Partial Orders
Hasse Diagrams, Equivalence Relations and Partition 8 Hours
Self Study Component: Operations on Relations.
Text Book:
1. Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, 5th Edition, Pearson Education,
2004.
Reference Books:
1. Kenneth H. Rosen: Discrete Mathematics and its Applications, 7th Edition, McGraw Hill,
2010.
2. Jayant Ganguly: A Treatise on Discrete Mathematical Structures, Sanguine-Pearson,

2010.
3. D.S. Malik and M.K. Sen: Discrete Mathematical Structures: Theory and Applications,
Cengage Learning, 2004.
4. Thomas Koshy: Discrete Mathematics with Applications, Elsevier, 2005, Reprint 2008.
Data Structure laboratory using C

Sub Code: CSL37 CIE:50
Hrs / Week: 03 SEE:50
Total Hrs: 36 Exam Hours:02
Course objectives:
This laboratory course enables students to get practical experience in design, develop, implement,
analyze and evaluation/ testing of
1. Linear data structures and their applications such as Stacks, Queues and Lists
2. Non-Linear Data Structures and their Applications such as Trees and Graphs
3. Sorting and Searching Algorithms
1. Write an algorithm to find the average of best of two elements from an array.
2. Write an algorithm to create a student database using structure with following fields USN,
NAME & SEMESTER for 10 students and sort it according to USN using bubble sort.
3. Design an algorithm and execute a program to read a sparse matrix of integer values and to search
the sparse matrix for an element specified by the user. Print the result of the search appropriately.
Use the triple <row, column, value> to represent an element in the sparse matrix
4. Design, develop and execute a program in C to convert a given valid parenthesized infix
arithmetic expression to postfix expression and then print both the expressions. The expression
consists of single character operands and the binary operators +, - , * , /
5. Design, develop and execute a program in C to evaluate a valid postfix expression using stack.
Assume that the postfix expression is read as single line consisting of non-negative single digit
operands and binary arithmetic operators. The arithmetic operators are +(add),-(sub),*(mul) and /
(divide)
6. Design, develop and execute a program in C to simulate the working of a queue of integers using
an array. Provide the following operations.
a. Insert b. Delete c. Display
7. Design, develop and execute a program in C to perform the following operation on Singly linked
list
a. Insert the node at the beginning
b. Insert the node at the end of the list
c. Display the list
8. Write an algorithm to implement Singly Linked List using stack principles.

9. Design, develop and execute a program in C to implement a doubly linked list where each node
consists of integers. The program should support the following operations:
a. Create a doubly linked list by adding each node at the front
b. Insert a new node to the left of the node whose key value is read as an input.
c. Delete the node of a given data If it is found, otherwise display appropriate
message
d. Display the contents of the list.
(Note: Only either (a,b and d) or (a,c and d) may be asked in the examination) */
10. Design, develop and execute a program in C to create a max heap of integers by accepting one
element at a time and by inserting it immediately in to the heap. Use the array representation for
the heap. Finally display the heap list.
11. Design, develop and execute a program in C to create a Binary tree and perform the following
operation inorder, preorder and postorder traversals.
12. Write an algorithm to construct a Binary Search Tree for the given array elements and display
the elements using array indexing.
Course Outcomes: On completion of this course.
1. Students are able to have knowledge of data structure and its applications.
2. Students are in a position to write, compile and debug programs in C language and able
to design programs involving various data structures.
3. Students are exposed to various Linear & Non Linear Data Structures
Practical Examination Procedure:
1.All laboratory experiments (Twelve) are to be included for practical examination.
2. Students are allowed to pick one experiment from the list of programs.
3.Strictly follow the instructions as printed on the cover page of answer script for breakup
of marks
4.Change of experiment is allowed only once and writes up procedure made to be zero.
OOPS WITH JAVA LAB
Sub Code: CSL 38 CIE: 50
Hrs/ Week: 3hrs SEE: 50
Course Objectives:
1. To have hands on session on the basics of Java, including looping constructs and selection
statements.
2. To understand the various built in packages, the classes within them and gain a knowledge
of using the methods of these classes.
3. To gain a deep insight into concepts of interfaces, Exception handling and threads by
executing programs that incorporates them.
1. Write a Java program that prints all real solutions to the quadratic equation ax2 + bx + c = 0.
Read in a, b, c and use the quadratic formula. If the discriminate b2-4ac is negative, display a
message stating that there are no real solutions.
2 a. Write a Java program that uses both recursive and non recursive functions to print the nth
value in the Fibonacci sequence.
b. Write a Java program that prompts the user for an integer and then prints out all prime
numbers up to that integer.
3. Write a Java program to multiply two given matrices. The matrix should be read from the
command line.
4. Write a java program to illustrate functionalities of different Bitwise operators.
5. Write a Java program to illustrate constructors to add and subtract two complex numbers.
6. Write a Java program to calculate gross salary & net salary taking the following data.
Input: Empno, Empname, basic


DA=40% of basic
HRA=20% of basic
CCA=Rs 250/-
PF=10% of basic
PT=Rs100/-
IT = 10% of gross
Gross income = Basic + DA + HRA + CCA
Deductions = PF+PT+IT
Net income = Gross income Deductions
7. Write a Java program to declare an abstract class Solid and implements Cylinder, Cone and
Sphere by inheriting from Solid abstract class. Compute the surface area and volume.
8. Write a Java program to read from console and write these data into a file, again read that file
and print the content onto console.
9. Write a Java program to implement the following interface.
Vehicle
(Interface)
Bus Lorry Car
10. Write a Java (Class) (Class)

(Class)the keyboard and to do
program to read a string from the following
a. Extract the middle character of the string
b. Check whether the string entered is palindrome or not
c. Count the number of vowels in the string
d. Count the total number of characters in the string.
11 a. Write a Java program that implements ArrayIndexOutofBound Exception using built-in-

Exception.

b. Write a Java program to identify the significance of finally block in handling exceptions.
12. Write a Java program that creates three threads. First thread displays Good Morning, every
one second. The second thread displays Hello every two seconds and the third thread displays
Welcome every three seconds.
Course outcomes:
1. The students will be able to write Java code using the concept of classes and object.
2. Given a problem statement, the student will be able to identify modules and code them
individually which can be then integrated into one.
3. The student will be a have knowledge of built in packages and their contents, which can
be used in designing of their programs.
Practical Examination Procedure:

1. All laboratory experiments (Twelve) are to be included for practical examination.
2. Students are allowed to pick one experiment from the list of programs.
3. Strictly follow the instructions as printed on the cover page of answer script for
breakup of marks
4. Change of experiment is allowed only once and writes up procedure made to be zero.
IV SEMESTER
Teaching Hours/Week Examination

Teaching
Sl. No. Subject Credit
Subject Department
L T P CIE SEE Total
Code
1 MAT41 Engineering Mathematics-IV MATHS 4 0 0 50 50 100 4
2 CS42 Algorithm Design and Analysis CSE 4 0 0 50 50 100 4
3 CS43 Operating System CSE 3 0 0 50 50 100 3
4 CS44 Microprocessors CSE 4 0 0 50 50 100 4
5 CS45 Introduction to Python CSE 3 0 0 50 50 100 3
6 CS46 Unix System Programming CSE 3 0 0 50 50 100 3
7 CSL47 Algorithm Laboratory using C CSE 0 1 2 50 50 100 2
8 CSL48 Microprocessor Laboratory CSE 0 1 2 50 50 100 2
Total 400 400 800 25
ENGINEERING MATHEMATICS-IV
Sub Code: MAT41 CIE: 50

Hrs/ Week: 04 SEE: 50
COURSE OBJECTIVES
1. Apply Numerical techniques to solve ordinary and partial differential equations.

2. Explain the concepts of function of complex variable, analytic functions and complex
integration.
3. Applications of Probability theory.
COURSE OUTCOME
On completion of the course student will be able to
1. List the numerical methods for solving differential equations, define analytical functions
and reproduce concepts of Probability distribution.
2. Practice Numerical methods, examine analytical functions, employ probability
distribution for real life problem.
3. Evaluate differential equation using Numerical methods and predict solutions using
probability distribution.
COURSE CONTENT
MODULE 1 NUMERICAL METHODS-1:Numerical solution of Ordinary Differential Equations of

first order and first degree: Picards method, Taylors series method, Modified Eulers method,
Runge-Kutta method of fourth order, Predictor and Corrector method: Milnes Method (No
derivations of formulae). 12Hours
(Self studycomponent: AdamsBashforth Method (No derivations of formula))
MODULE 2

NUMERICALMETHODS-2:Numerical solution of Partial Differential Equations: Finite
difference approximations to derivatives, Numerical solution of one-dimensional heat equation by
Schmidt method and by Crank-Nicholson Method, Numerical solution of one-dimensional wave
equation. 10Hours
(Self Study Component: Numerical solution of two-dimensional Laplaces equation.)
MODULE 3
COMPLEX VARIABLES-I:
Complex Variables-I: Functions of complex variables, Analytic function, Cauchy-Riemann

Equations in cartesian and polar coordinates, Consequences of Cauchy-Riemann Equations,
Construction of analytic functions.
Transformations: Conformal transformation, Discussion of the transformations w = z2, w = ez
and (z 0), Bilinear transformations. ` 10Hours
(Self Study Component: Transformation .)
MODULE 4
COMPLEX VARIABLES-II:
Complex integration, Cauchy theorem, Cauchy integral formula. Taylor & Laurent series
(statements only). Cauchy residue theorem (statement only). 10Hours
(Self Study Component:Singularities, Poles and Residues.)
MODULE 5
PROBABILITY THEORY:
Introduction to probability, Random variables (discrete and continuous), Probability mass

function, Probability density function, Cumulative density function, Probability distributions:
Geometric and Poisson distributions, Exponential and Normal distributions.
Sampling distribution: Samples, Central limit theorem (statement only), Hypothesis testing for
means, confidence limits for means, Students t-distribution-illustrative examples. 10Hours
(Self Study Component: Chi-Square distribution as a test of goodness of fit.)
TEXT BOOKS
1. B.S. Grewal, Higher Engineering Mathematics Khanna Publishers, 43rd Edition,

2014 June, ISBN: 9788174091956.
2. Erwin Kreyszig; Advanced Engineering Mathematics; John Wiley & Sons, 9th Edition,
2007, ISBN: 9788126531356.
REFERENCE BOOKS
1. B.V.Ramana, Higher Engineering Mathematics, Tata McGraw-Hill, 2006;

2. ISBN: 9780070634190.
3. M. K. Jain, S. R. K. Iyengar and R. K. Jain Numerical Methods: For Scientific and
Engineering Computation, New Age International Publications, 6th Edition, 2012,
ISBN: 9788122433234.
4. Murray Speigel, Schaum's Outline of Advanced Mathematics for Engineers and
Scientists McGraw-Hill, 1971; ISBN: 9780070602168.
5. Schaum's Outline: Introduction to Probability and Statistics, McGraw Hill Education
(India) Private Limited (1 September 2005); ISBN-13: 978-0070605015.

Algorithm Analysis and Design
Sub Code: CS 42 CIE:50

COURSE OBJECTIVES:
1. The student will be able to understand and use asymptotic notation to formulate the time
and space requirements of algorithms.
2. The student will be able to analyze and compare complexity for different types of
algorithms for different types of problems.
3. The student will be able to apply and implement major different algorithm design
techniques to solve problems and analyze time complexity of those problems.
4. Ability to apply and implement learned algorithm design techniques and data structures
to solve problem
COURSE OUTCOMES
1. Analyze the asymptotic performance of algorithms.

2. Write rigorous correctness proofs for algorithms.
3. Demonstrate a familiarity with major algorithms and data structures.
4. Apply important algorithmic design paradigms and methods of analysis.
5. Synthesize efficient algorithms in common engineering design situations
COURSE CONTENT
Module 1
Introduction: Notion of Algorithms, Fundamentals of Algorithmic Problem Solving.

Fundamentals of the Analysis of Algorithm Efficiency: The Analysis Framework, Asymptotic
27

Notations and Basic Efficiency Classes, Mathematical Analysis of Recursive Algorithms. Brute
Force: Selection Sort, Sequential Search and Brute-Force String Matching. 11 Hours
(Self-study Component: Mathematical Analysis of Non recursive Algorithms, Bubble Sort)
Module 2
Divide-and-Conquer: Introduction, Master theorem, Mergesort, Multiplication of Large

Integers and Strassens Matrix Multiplication. Decrease-and-Conquer: Introduction, Insertion
Sort, Depth-First Search and Breadth-First Search, Topological Sorting, Algorithms for
Generating Combinatorial Objects.
11 Hours
(Self-study Component: Binary Search, Quicksort.)
Module 3
Space and Time Trade-Offs: Introduction, Sorting by Counting, Input Enhancement in String
Matching,. Dynamic Programming: Introduction,Three Basic Examples, Warshalls and
Floyds Algorithms, The Knapsack Problem and Memory Functions. Transform-and-Conquer:
Introduction, Balanced Search Trees. 10 Hours
(Self-study Component: Hashing, Heaps and Heapsort.)
Module 4
Greedy Technique:Introduction, Prims Algorithm, Kruskals Algorithm, Dijkstras Algorithm,

Huffman Trees and Codes. PRAM ALGORITHMS: Introduction, Computational Model,
Parallel Algorithms for Prefix Computation. 10 Hours
(Self-study Component: List Ranking, and Graph Problems)
28

Module 5
Limitations of Algorithm Power: Lower-Bound Arguments, Decision Trees, P, NP, and NP-
Complete Problems. Backtracking, Branch-and-Bound, Approximation Algorithms for NP-Hard
Problems. 10 Hours
(Self-study Component: Coping with the Limitations of Algorithm Power)
Text Books:
1. AnanyLevitin: Introduction to The Design & Analysis of Algorithms, 3rd Edition,

Pearson Education.
2. Ellis Horowitz, SartajSahni, SanguthevarRajasekaran: Fundamentals of Computer

Algorithms, 2nd Edition, Universities Press.
Reference Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein: Introduction

to Algorithms, 3rd Edition, PHI.
29

Operating System

COURSE OBJECTIVES
1. The student will be able to understand the importance of operating systems in utilizing
the hardware and software resources along with the protection and security mechanisms.
2. The student will be able to comprehend and analyze various resource management
techniques.
3. The student will be able to implement resource management algorithms.
4. The student will gain knowledge on the various protection and security mechanisms
provided by operating system.
COURSE OUTCOMES
1. Demonstrate understanding of the concepts, structure and design of operating Systems

2. Demonstrate understanding of operating system design and its impact on application
system design and performance.
3. Demonstrate competence in recognizing and using operating system features.
COURSE CONTENT:
Module 1
Overview-Introduction: What operating systems do; Operating System Structure, Operating

System operations. System Structures: Operating System Services; User Operating-System
Interface; System calls; Types of System calls; Operating System design and implementation.
30

8 Hours
(Self Study Component: Distributed system; Special-purpose systems; Computing

environments. Operating System structure; Virtual machines.)
Module 2
Process Management-Process concept: Process concept; Process scheduling; Multi-Threaded

Programming: Overview; Multithreading models; threading issues. Process Scheduling: Basic
concepts; scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling 8 Hours
(Self Study Component: Inter Process Communication; Thread Libraries.)
Module 3
Process Coordination- Synchronization: The Critical section problem; Semaphores; Classical

problems of synchronization. Deadlocks: System model; Deadlock characterization; Methods for
handling deadlocks; Deadlock prevention; Deadlock avoidance; Deadlock detection and
recovery from deadlock.
8 Hours
(Self Study Component: Petersons solution; Monitors)
Module 4
Memory Management-Memory Management Strategies: Background; Contiguous memory

allocation; Paging;. Virtual Memory management: Background; Demand paging; Copy-on-write;
Page replacement; Allocation of frames. 8 Hours
(Self Study Component: Swapping; Segmentation; Thrashing.)
31

Module 5
Storage Management-File System: File concept; Access methods; Directory and Disk
structure; File system mounting; File sharing; Protection. Secondary Storage Structures:
Overview of Mass storage structures; Disk scheduling. System Protection: Goals of protection,
Principles of protection, Domain of protection, Access matrix.
8 Hours
(Self study Component: File System Structure; File System Implementation.)
Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Principles, 8th
edition, Wiley India, 2009
Reference Books:
1. D.M Dhamdhere: Operating systems - A concept based Approach,2nd Edition, Tata

McGraw- Hill, 2002.
2. P.C.P. Bhatt: Introduction to Operating Systems: Concepts and Practice, 2nd Edition, PHI,
2008.
3. Harvey M Deital: Operating systems, 3rd Edition, Pearson Education, 1990.
32

MICROPROCESSOR
COURSE OBJECTIVES:
The Course introduces students:
1. To understand the key characteristics of a microprocessor programming model

2. To analyze the effective address of an operand based on the addressing mode used, the
operation of the stack and identify the instructions that manipulate it.
3. To create an assembly language or C program and mixed level program that performs a
prescribed task
4. To understand the basis of interrupts, procedures , memory and I/O interfacing
COURSE OUTCOMES:
After completing the course:
1. Student should know functionality of the microprocessor programming model.

2. Student should know the addressing modes, stack functionality and instruction
manipulation.
3. Student should know the concepts of interrupts, procedures, memory and I/O interfacing.
COURSE CONTENT:
MODULE 1
INTRODUCTION, MICROPROCESSOR ARCHITECTURE 1: The Microprocessor and

its Architecture: Internal Microprocessor Architecture, Real Mode Memory Addressing.
33

Introduction to programming 8086: Data Transfer Instructions, Arithmetic Instructions:
Addition, Subtraction and Comparison, Multiplication and Division.
11 Hours
(Self study component: Data Addressing modes, Assembler Details, Mov instruction machine
code generation)
MODULE 2
INTERRUPTS AND PROGRAMMING: Introduction to Interrupts, DOS Interrupts, BIOS

Interrupts, Interrupt vector table, Program Control Instructions: The Jump Group, Controlling the
Flow of the Program, Macros and Procedures, Basic Logical Instructions, BCD and ASCII
arithmetic instructions. 11 Hours
(Self study component: Shift and Rotate Instructions, String Comparisons, Miscellaneous
Instructions).
MODULE 3
I/O INTERFACE: The Programmable Peripheral Interface 82C55, Programmable Interval

Timer 8254. Interfacing microprocessor to keyboard, 7-segment display and stepper motor.
10 Hours
(Self study component: Example programs on interface)
MODULE 4
HARDWARE SPECIFICATIONS, MEMORY INTERFACE: Pin-Outs and the Pin
Functions, Clock Generator, Bus Buffering and Latching, Bus Timings, Ready and Wait State,
Minimum versus Maximum Mode. Memory Interfacing: Memory Devices. Address Decoding,
8088 Memory Interface, 8086 Memory Interface. 10 Hours
(Self study component: Basic I/O Interface: Introduction to I/O Interface, I/O Port Address
Decoding)
34

MODULE 5
8086 BASED MULTIPROCESSING SYSTEMS & COMBINING ASSEMBLY

LANGUAGE WITH C/C++: Coprocessor configurations, The 8087 numeric data processor:
data types, processor architecture, instruction set and examples. Introduction to 80386
microprocessor, Special 80386 registers, Introduction to 80486 processor, Introduction to
Pentium microprocessor. Using Assembly Language with C/C++ for 16-Bit DOS Applications
and 32-Bit Applications. 10 Hours
(Self Study Component: Modular Programming, Data Conversions, Example Programs)
TEXT BOOKS:
1. Barry B Brey: The Intel Microprocessors, 8th Edition, Pearson Education, 2009.
2. Microcomputer systems-The 8086/8088 Family Y.C.Liu and G.A Gibson, 2E PHI-
2003.
REFERENCE BOOKS:
1. Douglas V. Hall: Microprocessors and Interfacing, Revised 2nd Edition, TMH, 2006.
2. K. Udaya Kumar & B.S. Umashankar : Advanced Microprocessors & IBM-PC Assembly
Language Programming, TMH 2003.
3. James L. Antonakos: The Intel Microprocessor Family: Hardware and Software
Principles and Applications, Cengage Learning, 2007.
35

Introduction to Python Programming

COURSE OBJECTIVES
1. Introduce the Python language, its most important libraries, and its recommended
programming styles and idioms.
2. Teachs how to solve typical programming problems in Pythonic style. Survey some
exemplary Python applications and systems.
COURSE OUTCOME
1. An understanding of scripting and the contributions of scripting languages.

2. Understanding of Object oriented concept , built in objects in python
3. Exposure to advance applications
Course Content
Module 1
Introduction to Python Programming: Features, basic syntax, Writing and executing simple
program, Basic Data Types such as numbers, strings, etc Declaring variables, Performing
assignments, arithmetic operations, Simple input-output, Precedence of operators, Type
conversion, Control statements: Terminating loops, skipping specific conditions, String
Manipulation: declaring strings, string functions, Manipulating Collections Lists, Tuples.
8 Hours
(Self Study Component: Conditional Statements: if, if-else, nested ifelse, Looping: for, while,
nested loops.)
36

Module 2
Dictionaries Concept of dictionary, techniques to create, update & delete dictionary items.
Functions: Defining a function, calling a function, Advantages of functions, types of functions,
function parameters, Formal parameters, Actual parameters, anonymous functions, global and
local variables. 8 Hours
(Self Study Component: Modules: Importing module, Creating & exploring modules, Math
module, Random module, Time module.)
Module 3
Python File Input-Output: Opening and closing file, various types of file modes, reading and
writing to files, manipulating directories. Regular Expressions Concept of regular expression,
various types of regular expressions, using match function. 8 Hours
(Self Study Component: Exception Handling What is exception, various keywords to handle
exception such try, catch, except, else, finally, raise.)
Module 4
GUI Programming in Python (using Tkinter/wxPython/Qt) - What is GUI, Advantages of

GUI, Introduction to GUI library, Layout management, Events and bindings, Widget such as:
Frame, Label, Button, Checkbutton, Entry, Listbox, Message, Radiobutton, Text, Spinbox etc. 8
Hours
(Self Study Component: Font, Colors, drawing on canvas (line, oval, rectangle, etc.))
37

Module 5
Database connectivity in Python Installing mysql connector, accessing connector module,

using connect, cursor, execute & close functions, reading single & multiple results of query
execution, understanding exceptions in database connectivity. 8 Hours
(Self Study Component: executing different types of statements, executing transactions.)
Text books:
1. Paul Gries , Jennifer Campbell, Jason Montojo, Practical Programming: An Introduction
to Computer Science Using Python 3, Pragmatic Bookshelf, 2/E 2014
2. James Payne, Beginning Python: Using Python 2.6 and Python 3, Wiley India, 2010
Reference Books:
1. Charles Dierbach, Introduction to Computer Science using Python, Wiley, 2013
2. A. Lukaszewski, MySQL for Python: Database Access Made Easy, Pact Publisher, 2010
38

UNIX SYSTEM PROGRAMMING

COURSE OBJECTIVE
1. The student will be familiar with basic UNIXOS concepts such as: types of UNIX
versions,process,program,processgroups,signals,runningprograms,processcontrol,address
space,userandkernelmodes,systemcalls,and contextswitching.
2. The student will have the ability to write programs for fileI/O operations using
APIs(i.e.open,close,read,write,seek).
3. The student will be able to write system programs to handle signals and exceptions within
a process and to control processes.
4. The student will be able to write system programs using sockets to implement
clientserve r process environment.
COURSE OUTCOMES
1. Identify and use UNIX utilities to create and manage simple file processing operations,
organize directory structures with appropriate security, and develop shell scripts to
perform more complex tasks.
2. Effectively use the UNIX/Linux system to accomplish typical personal, office, technical,
and software development tasks.
Course Content
Module 1
UNIX Operating System and Unix Commands: The Unix Operating System, The UNIX
architecture and Command Usage,The File System, Basic File Attributes 8 Hours
Self Study Component: Simple Filters
39

Module 2
Unix Editor, Environment and Shell: The vi Editor, The Process, The Shell and Essential Shell
Programming 8 Hours
(Self Study Component: Customizing the environment)
Module 3
UNIX Standards and Files: UNIX and ANSI Standards: The ANSI C Standard, The ANSI/ISO
C++ Standards, Difference between ANSI C and C++, The POSIX Standards, The POSIX.1
FIPS Standard, UNIX and POSIX APIs: The POSIX APIs, The UNIX and POSIX Development
Environment, API Common Characteristics. UNIX FILES: File Types, the UNIX and POSIX
File System, Application Program Interface to Files, UNIX Kernel Support for Files. 8 Hours
(Self Study Component: Relationship of C Stream Pointers and File Descriptors.)
Module 4:
File APIs and UNIX Processes: UNIX File APIs: General File APIs, File and Record Locking,
Directory File APIs, Device File APIs, FIFO File APIs, Symbolic Link File APIs.. UNIX
Process: main function, Process Termination, Process Identifiers, fork, vfork, exit, wait, waitpid
Functions, Race Conditions, exec Functions 8Hours
(Self Study Component: UNIX Kernel Support for Processes)
UNIT - 5:
Signals/Daemon Processes and Inter-Process Communication: SIGNALS AND DAEMON

PROCESSES: Signals: The UNIX Kernel Support for Signals, signal, Signal Mask, sigaction,
sigsetjmp and siglongjmp Functions, Alarm, Interval Timers, Daemon Processes: Introduction,
Daemon Characteristics, Coding Rules, Error Logging, Client-Server Model. INTERPROCESS
COMMUNICATION: Pipes, popen, pclose Functions; 8 Hours
(Self Study Component: FIFOs; Message Queues; Semaphores.)
40

Text Books:
1. Sumitabha Das: UNIX Concepts and Applications, 4th Edition, Tata McGraw Hill, 2006.
2. Terrence Chan: UNIX System Programming Using C++, Prentice Hall India, 1999.
3. W. Richard Stevens: Advanced Programming in the UNIX Environment, 2nd Edition, Pearson
Education, 2005.
Reference Books:
1. Behrouz A. Forouzan and Richard F. Gilberg: UNIX and Shell Programming, Cengage
Learning, 2005.
2. M.G. Venkateshmurthy: UNIX & Shell Programming, Pearson Education, 2005
3. Marc J. Rochkind: Advanced UNIX Programming, 2nd Edition, Pearson Education, 2005.
4. Maurice J Bach: The Design of the UNIX Operating System, Pearson Education, 1987.
41

Algorithm Laboratory using C/C++
Sub Code: CSL 47 CIE:50

Design, develop and implement the specified algorithms for the following problems using
C++ Language in LINUX / Windows environment.
1. Design, develop, and execute a program to create a class called QUICK_SORT that
represents the array of elements, with member functions to sort a given set of elements using the
Quicksort method and determine the time required to sort the elements. Repeat the experiment
for different values of n, the number of elements in the list to be sorted and plot a graph of the
time taken versus n. The elements should be read from a file and also be generated using the
random number generator.
2. Design, develop, and execute a program to create a class called MERGE_SORT that
represents the array of elements, with member functions to sort a given set of elements using the
merge sort method and determine the time required to sort the elements. Repeat the experiment
for different values of n, the number of elements in the list to be sorted and plot a graph of the
time taken versus n. The elements should be read from a file and also be generated using the
random number generator.
3a. Design, develop, and execute a program to create a class called BFS that represents the
adjacency matrix, with member functions. Print all the nodes reachable from a given starting
node in a digraph using BFS method.
b. Design, develop, and execute a program to create a class called DFS that represents the
adjacency matrix, with member functions. Print all the nodes reachable from a given starting
node in a digraph using DFS method.
42

4a. Design, develop, and execute a program to create a class called FLOYDS that represents
the cost adjacency matrix and member functions to Implement All-Pairs Shortest Paths Problem
using Floyd's algorithm.
b. Design, develop, and execute a program to create a class called WARSHALL that represents
the adjacency matrix, with member functions to compute the transitive closure of a given
directed graph using Warshall's algorithm. Print all the matrices of transitive closure.
5. Design, develop, and execute a program to create a class called HORSPOOL that represents
the text and pattern string and member functions to search for given pattern string in text string
using Horspool method.
6. Design, develop, and execute a program to create a class called KNAPSACK that represents
the weights and profits of n objects, with member functions to Implement 0/1 Knapsack
problem using Dynamic Programming.
7. Design, develop, and execute a program to create a class called KRUSKAL that represents the
cost adjacency matrix, Find Minimum Cost Spanning Tree of a given undirected graph using
Kruskal's algorithm.
8. Design, develop, and execute a program to create a class called PRIMS that represents the
cost adjacency matrix presents and member functions to find Minimum Cost Spanning Tree of a
given undirected graph using Prims algorithm.
9. Design, develop, and execute a program to create a class called DIJKSTRA that represents the
cost adjacency matrix. From a given vertex in a weighted connected graph, find shortest paths to
other vertices using Dijkstra's algorithm.
10. Design, develop, and execute a program to create a class called SUMOFSUBSET that
represents the array of elements, and member functions to find a subset of a given set S = {sl,
s2,.....,sn} of n positive integers whose sum is equal to a given positive integer d. For example, if
S={1, 2, 5, 6, 8} and d = 9 there are two solutions {1,2,6} and {1,8}. A suitable message is to be
displayed if the given problem instance doesn't have a solution.
43

11. Design, develop, and execute a program to create a class called QUEENS that represents the
number of queens and member functions Implement N Queen's problem using Back Tracking.
12. Design, develop, and execute a program to create a class called TSP that represents the cost
adjacency matrix and member functions to implement any scheme to find the optimal solution
for the Traveling Salesperson problem and then solve the same problem instance using any
approximation algorithm and determine the error in the approximation.
44

Microprocessors Laboratory
Sub Code: CSL 48 CIE:50

Note:
Develop and execute the following programs using 8086 Assembly Language. Any
suitable assembler like MASM, TASM etc may be used.
Program should have suitable comments.
The board layout and the circuit diagram of the interface are to be provided to the
student during the examination.
1a. Write an ALP to conduct binary search for unsorted array of N numbers.
b. Read the status of eight input bits from the Logic Controller Interface and display FF if it is
the parity of the input read is even, otherwise display 00.
2a. Read an alphanumeric character and displays its equivalent ASCII code at the center of the
screen.
b. Read the status of two 8-bit inputs (X & Y) from the Logic Controller Interface and display
X*Y.
3a. Write an ALP to read an 8 bit number from the keyboard and check whether it is a prime
number or not.
b. Implement a BCD Up-Down Counter on the Logic Controller Interface.
4a. Write an ALP to read a string from the keyboard and check whether it is a palindrome or not.
b. Display messages DSCE and 4CSE alternately with flickering effects on a 7-segment
display interface for a suitable period of time. Ensure a flashing rate that makes it easy to
read both the messages (Examiner does not specify these delay values nor is it necessary for
the student to compute these values).
45

5a. Write an ALP to read two strings, store them in locations STR1 and STR2. Check whether
they are equal or not and display appropriate messages. Also display the length of the
stored strings.
b. Convert a 16-bit binary value (assumed to be an unsigned integer) to BCD and display it
from left to right and right to left for specified number of times on a 7-segment display
interface.
6a. Write an ALP to separate even and odd numbers from N array elements.
b. Scan an 8 x 3 keypad for key closure and to store the code of the key pressed in a memory
location or display on screen. Also display row and column numbers of the key pressed.
7a. Write an ALP to generate and print first N Fibonacci numbers.
b. Drive a Stepper Motor interface to rotate the motor in specified direction (clockwise or
counter-clockwise) by N steps (Direction and N are specified by the examiner). Introduce
suitable delay between successive steps.
8a. Compute nCr using recursive procedure. Assume that n and r are non-negative integers.
b. Display the system time on a 7-segment display interface.
9a. Develop an assembly level program to display the system date at the centre of the screen.
b. Generate the Sine Wave using DAC interface (The output of the DAC is to be displayed on
the CRO).
10a. Read a pair of input co-ordinates in BCD and move the cursor to the specified location on
the screen.
b. Drive an elevator interface in the following way:
i. Initially the elevator should be in the ground floor, with all requests in OFF state.
ii. When a request is made from a floor, the elevator should move to that floor, wait there
for a couple of seconds (approximately), and then come down to ground floor and
stop. If some requests occur during going up or coming down they should be ignore
46

3rd 4th Scheme Syllabus CSE

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

3rd 4th Scheme Syllabus CSE

Hochgeladen von

Copyright:

Verfügbare Formate

DAYANANDA SAGAR COLLEGE OF ENGINEERING

NAAC Accredited with A Grade

ISO 9001:2008 Certified

B. E. COMPUTER SCIENCE & ENGINEERING

1 MAT31 Engineering Mathematics-III MATHS 4 0 0 50 50 100 4

2 CS32 Data Structures with C CSE 4 0 0 50 50 100 4

3 CS33 OOPS with Java CSE 4 0 0 50 50 100 4

4 CS34 Logic Design CSE 3 0 0 50 50 100 3

5 CS35 Computer Organization CSE 3 0 0 50 50 100 3

6 CS36 Discrete Mathematical Structures CSE 3 0 0 50 50 100 3

7 CSL37 Data Structures Laboratory CSE 0 1 2 50 50 100 2

8 CSL38 Java Programming Laboratory CSE 0 1 2 50 50 100 2

Total 400 400 800 25

NAAC Accredited with A Grade

ISO 9001:2008 Certified

NAAC Accredited with A Grade

ISO 9001:2008 Certified

Numerical Methods: Numerical solution of algebraic and transcendental equations,Regula-Falsi

(Self Study Component: Trapezoidal rule.)

(Self Study Component: Region of convergence.)

Note: NO questions from Self Study Component.

NAAC Accredited with A Grade

ISO 9001:2008 Certified

1 B.V.Ramana, Higher Engineering Mathematics, Tata McGraw-Hill, 2006,

2 M. K. Jain, S. R. K. Iyengar and R. K. Jain Numerical Methods: For Scientific and

3. Murray Speigel, Schaum's Outline of Advanced Mathematics for Engineers and

NAAC Accredited with A Grade

ISO 9001:2008 Certified

Data Structures with C

Sub Code: CS32 CIE:50

1. Acquire knowledge of - Various types of data structures, operations and algorithms. -

3. Implement all the applications of Data structures in a high-level language.

NAAC Accredited with A Grade

ISO 9001:2008 Certified

(Self-study components: Operation on Linked list using Stacks, Queues, Polynomials )

1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd Edition,

4 Reema Theraja Data Structure using C. 1st Edition , 2014

NAAC Accredited with A Grade

ISO 9001:2008 Certified

OOPS with Java

Hrs/ Week: 04 SEE:50

Total Hrs: 52 Exam Hours: 03

1. Compare procedural and object oriented programming languages.

2. Understand fundamentals of programming such as variables, conditional and iterative

3. Understand fundamentals of object-oriented programming in Java, including defining classes,

4. A deep understanding of the concepts of Interfaces, Exception Handling and Multithreaded

After completing the course the student is expected to know

NAAC Accredited with A Grade

ISO 9001:2008 Certified

Operators: Arithmetic operators, Bitwise operators, Relational operators, the assignment

Control Statements: Selection statements, iteration statements, Jump statements.

(Self Learning Component: the PrintWriter Class, dynamic method dispatch.)

Packages: Defining a package, Access protection; importing packages.

Interfaces: Defining an Interface, Implementing Interface, Nested Interface, Applying interfaces,

NAAC Accredited with A Grade

ISO 9001:2008 Certified

(Self Learning Component: generic interfaces, java.lang: Primitive Type Wrappers.)

Note: NO questions from Self Study Component.

1. Y. Daniel Liang: Introduction to JAVA Programming, 6th Edition, Pearson Education,

NAAC Accredited with A Grade

ISO 9001:2008 Certified

(Self Study Component: Simplification by Quine-McClusky Method & EVM Method.)

NAAC Accredited with A Grade