ii year b.e.: scheme of teaching and credits: 2016-2017...

1

II Year B.E.: Scheme of Teaching and Credits: 2016-2017

COMPUTER SCIENCE AND ENGINEERING

SCHEME:III Semester

Sub.

Code

Subject Name L T P C

MA301 Engineering Mathematics - III 4 0 0 4

CS302 Computer Organization 3 0 0 3

CS303 Logic Design 3 1 0 4

CS304 Data Structures 4 0 0 4

CS305 Microprocessors 3 1 0 4

CS306 Object Oriented Programming with C++ 4 0 0 4

HS003 Communication Skills - I 0 0 2 1

CS307 Data Structures Laboratory with C & C++ 0 0 3 1.5

CS308 Digital and Microprocessors Laboratory 0 0 3 1.5

Total Credits 27

Course outcomes (Cos) (with mapping shown against the program outcomes - Pos)

1. Introducing Fourier series to learn practical harmonic analysis and learning Fourier transforms

and its inverse. (Po-1, Po-5, Po-8)

2. Adopting Z-transforms concepts to solve difference equations and solving algebraic and

transcendental equations numerically. (Po-1, Po-5, Po-8, Po-9, Po-11)

3. Adopting numerical different formulas for solving engineering problems and exposure to

numerical integration through standard rules. (Po-5, Po-8, Po-9, Po-11)

4. Learning solution of system of homogeneous equations through matrices and numerical

solution of differential equations. (Po-1, Po-5, Po-8, Po-9, Po-11)

PART A

Unit 1 Fourier series: Periodic functions, representation of a periodic function as a

Fourier series using Euler’s Formulae. Fourier series of an even & an odd

function. Half-range Fourier series and practical harmonic analysis-

illustrative examples. Graphs of Fourier series. (7 hours)

Unit 2 Fourier Transforms and Inverse Fourier transforms: – properties of

Fourier transform, Evaluation of Complex Fourier, Fourier sine & Fourier

cosine transforms. Inverse complex Fourier, Inverse sine & Cosine

transforms. Applications of transforms to boundary value problems. (7 hours)

PART B

Unit 3 Z-Transforms: Definition, standard forms, Linearity property, damping (6 hours)

MA301 - ENGINEERING MATHEMATICS – III (4-0-0) 4

Exam. Hours: 3 Hrs / week: 4

SEE: 50 Total hrs: 52

2

rule, shifting rule – Problems. Inverse Z transforms. Solution of Difference

equations using Z Transforms.

Unit 4 Numerical Techniques: Solution of algebraic & Transcendental equations

by (i) Bisection method, (ii) Newton Raphson method.,(iii) Regula falsi

method. Solution of non – linear system of equations by using Newton

Raphson method. (6 hours)

PART C

Unit 5 Numerical Interpolation / Extrapolation: Finite differences - Forward,

backward & Central differences. Interpolation by Newton’s Interpolation

formula (both forward & backward), Stirling & Bessel’s interpolation

formula for central interpolation. Lagrange’s & Newton’s divided

differences formula for un-equal intervals. Some application oriented

engineering problems. (7 hours)

Unit 6 Numerical Integration: General quadrature formula with proof and

deduction of trapezoidal rule, Simpsons 1/3rd rule, weddles rule and

illustrative examples. Gaussian quadrature 3 point formula. (6 hours)

PART D

Unit 7 Matrix algebra, Consistency of non homogeneous system of equations

using the rank concept,( using elementary row operation), Solution of the

system of linear equations by Gauss elimination method, Gauss – Seidel

iterative method. Solution of system of homogeneous equations, Finding

Eigen values and Eigen vectors of matrices. Physical significance of Eigen

values and Eigen vectors in Engineering. (6 hours)

UNIT 8 Numerical solution of ordinary differential equations. Computation of

solution by using the following single step methods: Taylor series method,

Picard’s method of successive approximation, Runge-Kutta method of

fourth order., Solution of first order simultaneous differential equations by

R.K. method of fourth order . Predictor and corrector methods (Adams

Bashforth method). (7 hours)

Text Book:

Dr. B. S. Grewal, Higher Engineering Mathematics, Khanna Publications, 40th edition (2007)

Reference Books:

1. Erwin Kreyezig, Advanced Engineering Mathematics, Tata McGraw Hill Publications, 8th

edition (2007)

2. S. C. Chapra and R. Canale, Numerical Analysis for Engineers, Tata McGraw Hill Publications, 5th

edition (2005)

3. Numerical methods for Scientific and Engineering computation by M.K. Jain, SRK Iyengar, R.K.

Jain, 5th edition, New age International Publishers.

Course Outcomes (COs): At the end of the course the students will be able to:

1. Acquire knowledge of the basic structure of computers & machine instructions and programs, Addressing modes and data representation.

PO1,PO2

2. Analyze the fundamentals of Input/output Organization such as accessing I/O Devices, Interrupts and different types of communication bus.

PO2,PO3

3. Study the working of Memory system, Semiconductor RAM Memories, Static memories, Asynchronous DRAMS, Read Only Memories, Cache Memories and Virtual Memories.

PO1,PO3

4. Demonstrate the hardware implementation of how arithmetic and logical operations are performed within ALU.

PO2,PO4

CS302 - COMPUTER ORGANISATION (3-0-0) 3



3

5. Understand the fundamentals of Advanced Computer Architecture. PO1,PO2

6. Apply the knowledge gained in the design of Computer and evaluate its performance.

PO1,PO2

PART A

1. Basic Structures of Computers:

Computer types: Functional units: Input unit, Memory unit, Arithmetic & logic unit, output unit, Control

unit; Basic Operational Concepts : Bus Structures : Performance: Processor clock, Basic Performance

equation, Pipelining & Superscalar operation, Clock rate, Performance measurement; Multiprocessor &

Multicomputer. Data Organization Numbers, Arithmetic operations and characters, Memory Locations &

Addresses: Byte addressability, Big-endian & Little-endian assignments, Word Alignment, Accessing

Numbers, Characters & Character strings. 5 Hrs

2. Input/Output Organization:

Accessing I/O devices: Interrupts: Interrupt Hardware, Enabling & Disabling Interrupt, Handling

Multiple devices, Controlling Device Requests, Exceptions; Direct Memory Access: Bus Arbitration. 5 Hrs

PART-B

3. Input/Output Organization (contd.):

Buses: Synchronous Bus, Asynchronous Bus; PCI bus, SCSI bus, USB. 5 Hrs

4. The Memory System:

Some Basic Concepts : Semiconductor RAM Memories : Internal Organization of Memory Chips, Static

Memories, Asynchronous DRAMs, Synchronous DRAMs, Structure of Larger Memories, Memory

System Considerations, Rambus memory; Read-only Memories : ROM, PROM, EPROM, EEPROM,

Flash memory. 5 Hrs

PART-C

5. The Memory System (contd.):

Speed, Size & Cost: Cache Memories: Mapping functions; Performance considerations: Interleaving, Hit

Rate & Miss Penalty; Virtual memories: Address Translation; Secondary Storage: Magnetic Hard Disks,

Optical Disks. 5 Hrs

6. Arithmetic:

Addition & Subtraction of Signed Numbers: Addition/Subtraction Logic Unit; Design of fast adders:

Carry-Look ahead Addition; Multiplication of Positive numbers: Signed-Operand Multiplication: Booth

Algorithm; Fast Multiplication; Bit-pair Recoding of Multipliers. 5 Hrs

PART-D

7. Arithmetic (contd.):

Integer division: Floating-Point Numbers & Operations: IEEE Standard for Floating-Point Numbers,

Arithmetic Operations on Floating-Point Numbers, Implementing Floating-Point Operations.

5 Hrs

8. Introduction to Advance Computer Architecture

The State of Computing: evolution of computer architecture, System Attributes to Performance

Multiprocessors and Multicomputer: Shared-Memory Multiprocessors, Distributed-Memory

Multicomputer, Multivector and SIMP Computers: Vector Supercomputers, SIMP Supercomputers

5 Hrs

Text Book:

1. Carl Hamacher, Z Vranesic & S Zaky, Computer Organization , 6th Edition, McGraw Hill, 2012

4

2. Kai Hwang: Advanced Computer Architecture Parallelism, Scalability, Programability, 2 nd

Edition, Tata Mc Graw Hill, 2011.

Reference Books:

1. David A. Patterson and John L. Hennessey, “Computer organization and design‟, Morgan

auffman / lsevier, Fifth edition, 2014.

2. William Stallings, Computer Organization and Architecture, 9th Edition, Pearson India, 2013

3. B Govindharajalu, Computer Architecture and Organization, 2nd Edition, McGraw Hill

Education (India) Private Limited, 2011

Course Outcomes (COs): At the end of the course the students will be able to:

1 Familiarize with the basics of various Boolean expressions, its simplification and realization using gates

PO2,PO3

2 Design and realize the combinational logic circuits using gates PO2,PO3

3 Design the sequential circuits using memory devices PO3

4 Write Verilog/VHDL code to implement Combinational/Sequential logic circuits PO2,PO3

PART-A 1. Digital Logic: The Basic Gates: NOT, OR, AND, Universal Logic Gates: NOR, NAND, Positive and Negative Logic, Introduction to HDL. Combinational Logic Circuits: Sum-of-Products Method, Truth Table to Karnaugh Map, Pairs Quads, and Octets, Karnaugh Simplifications. (6 Hrs)

2. Combinational Logic Circuits(contd..): Don’t-care Conditions, Product-of-sums Method, Product-of-sums simplifications, Simplification by Quine-McClusky Method, VEM technique, Hazards and Hazard Covers, HDL Implementation Models. (7 Hrs)

PART-B

3. Data-Processing Circuits & Arithmetic Circuits,: Multiplexers, Demultiplexers, 1-of-16 Decoder, Encoders, Exclusive-or Gates, Parity Generators and Checkers, Magnitude Comparator, Programmable Array Logic, Programmable Logic Arrays, HDL Implementation of Data Processing Circuits, Binary addition, subtraction, 2's complement arithmetic, 2's complement representation. (6 Hrs) 4. Arithmetic Circuits(conti.., Flip-Flops: Arithmetic building blocks, the adder, subtracter, fast adder, Flip Flops: SR flip flop, Clocked D FLIP-FLOP, Edge-triggered D FLIP-FLOP, Edge-triggered JK FLIP-FLOP, FLIP-FLOP Timing, JK Master-slave FLIP-FLOP, Switch Contact Bounce Circuits, Various Representation of FLIP-FLOPs. Analysis of Sequential Circuits. (7 Hrs)

PART-C 5. Registers: HDL Implementation of FLIP-FLOP, Types of Registers, Serial In - Serial Out, Serial In - Parallel out, Parallel In - Serial Out, Parallel In - Parallel Out, Universal Shift Register, Applications of Shift Registers, Register Implementation in HDL. (6Hrs) 6. Counters: Asynchronous Counters, Decoding Gates, Synchronous Counters, Changing the Counter Modulus, Decade Counters, Presettable Counters, Counter Design as a Synthesis problem, Digital Clock ,Counter Design using HDL. (7 Hrs)

PART-D 7. Design of Synchronous and Asynchronous Sequential Circuits: Design of Synchronous Sequential Circuit: Model Selection, State Transition Diagram, State Synthesis Table, Design Equations and Circuit Diagram, Implementation using Read Only Memory, Algorithmic State Machine, State Reduction Technique. (7 Hrs) 8. Design of Synchronous and Asynchronous Sequential Circuits (conti..), Memory : Asynchronous Sequential Circuit: Analysis of Asynchronous Sequential Circuit, Problems with Asynchronous

CS303- LOGIC DESIGN (3-1-0) 4


SEE:50 Total hrs: 52

5

Sequential Circuits, Design of Asynchronous Sequential Circuit, FSM Implementation in HDL. Basic terms and ideas, Magnetic memory, Optical memory, memory addressing, ROM, PROM and EPROMs , RAMs, Sequential Programmable devices, Content addressable memory. (6 Hrs)

Text Book: Donald P Leach, Albert Paul Malvino & Goutam Saha: Digital Principles and Applications, 8th Edition, Tata McGraw Hill, 2015 Reference Books:

5. Stephen Brown, Zvonko Vranesic: Fundamentals of Digital Logic Design with VHDL, 2nd Edition, Tata McGraw Hill, 2014.

6. Ronald J. Tocci, Neal S. Widmer, Gregory L. Moss: Digital Systems Principles and Applications, 10th Edition, Pearson Education, 2013.

7. M Morris Mano: Digital Logic and Computer Design, 1st Edition, Pearson, 2013. Web Reference: http://

Course Outcomes (COs):

At the end of the course the students will be able to:

1. Get acquainted with advance C programming techniques such as pointers, dynamic memory

allocation, structures and apply them for solving suitable problems.

PO1,PO2

2. Understand basic linear data structures such as Stacks, Queues and Linked list and use these data

structures in suitable applications.

PO2

3. To understand and use advanced linear structures like circularly linked list and doubly linked list. PO3

4. Understand basic non linear linear data structures such as trees and graphs as well as use these

data structures in suitable applications.

PO2, PO3

5. Exemplify and implement linear and nonlinear data structures using static and dynamic

allocations.

PO2, PO3

6. To comprehend the use of efficient data structures and identify their practical use. PO2

PART-A

UNIT - 1 7 Hours

Basic Concepts : Pointers and Dynamic Memory Allocation, Algorithm Specification, Data Abstraction,

Arrays and Structures: Arrays, Dynamically Allocated Arrays.

UNIT - 2 6 Hours Structures and Unions, Polynomials, Sparse Matrices, Representation of Multidimensional arrays.

PART B

UNIT - 3 6 Hours

The Stack - Definition and examples: Primitive operation, Example. Representing stacks in C:

Implementing the pop operation, Testing for exceptional conditions, Implementing the push operation.

Example: Infix, postfix and prefix, Basic definitions and examples, Evaluating a postfix expression,

Program to evaluate a postfix expression, Converting an expression from infix to postfix, Program to

convert an expression from infix to postfix.

UNIT - 4 7 Hours Recursion : Recursive definition and processes: Factorial function, Multiplication of natural numbers,

Fibonacci sequence, Binary search, Properties of recursive definition or algorithm. Recursion in C,

Towers of Hanoi problem.

Queues and list - The queue and its sequential representation: C implementation of queues, Circular

queues. Linked lists - Inserting and removing nodes from a list, Linked implementation of stacks.

Linked list as a data structure, Example of list operations, Header nodes.

CS304 - DATA STRUCTURES (4-0-0) 4 Exam. Hours: 3 Hrs / week: 4


6

PART C

UNIT - 5 6 Hours Allocating and freeing dynamic variables, Linked lists using dynamic variable, Examples of list

operations in C , Circular lists, Stack as a circular list, doubly linked lists. Trees – 1: Introduction, Binary

Trees, Binary Tree Traversals.

UNIT - 6 7 Hours TREES – 2 : Threaded Binary Trees, Heaps. Binary Search Trees, Selection Trees, Forests,

Representation of Disjoint Sets, The Graph Abstract Data Type.

PART D

UNIT - 7 6 Hours

Priority Queues Single- and Double-Ended Priority Queues, Leftist Trees, Binomial Heaps, Fibonacci

Heaps.

UNIT - 8 7 Hours

Efficient Binary Search Trees: Optimal Binary Search Trees, AVL Trees, Red-Black Trees, Splay

Trees.

Text Books:

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

Universities Press, 2007. (Chapters 1, 2.1 to 2.6, 5.1 to 5.3, 5.5 to 5.10, 6.1, 9.1 to 9.4 , 10)

2. Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and C++, 2nd Edition, Pearson

Education, 2003.


1. Explain the basic concepts of microprocessors and its architecture PO1

2. Demonstrate the working and use of instruction set of a microprocessor PO1

3. Ability to develop ALP to solve simple and moderate complex problems PO 1, PO 2, PO3

4. Explain the purpose and timing of all signals in a microprocessor PO 1, PO 3

5. Understand the function and use of interrupts in microprocessor systems PO 1, PO 2

6. Design and describe interfacing of peripheral devices to the microprocessor to solve simple real life problems

PO 1, PO 2

PART A

1. Introduction to the Microprocessor and Computer: A Historical Background, The Microprocessor-

Based Personal Computer System, Number Systems, Computer Data Formats. The Microprocessor &

its Architecture: Internal Microprocessor Architecture, Real Mode Addressing 6 Hrs

2. Addressing Modes & Directives: Data Addressing Modes, Program Memory-Addressing Modes,

Stack Memory-Addressing Modes, Assembler Directives 7 Hrs

PART-B

3. Data Movement Instruction: MOV Revisited, PUSH/POP, Load-Effective Address, String Data

Transfers, Miscellaneous Data Transfer Instructions, Segment Override Prefix. 7 Hrs

4. Arithmetic and Logic Instructions: Addition, Subtraction and Comparison, Multiplication and

Division, BCD and ASCII Arithmetic, Basic Logic Instructions, Shift and Rotate, String comparisons.

CS305 - MICROPROCESSORS (4-0-0) 4



7

6 Hrs

PART-C

5. Program Control Instructions : The Jump Group, Procedures, Introduction to Interrupts, Machine

Control and Miscellaneous Instruction, 8086 Hardware Specifications : Pin–Outs and the Pin Functions,

Bus Buffering and Latching, Bus Timing, READY and the Wait State, Minimum Mode Versus

Maximum Mode 7 Hrs

6. Programming the Microprocessor: Modular Programming (till placing macro definition in their own

module), Using the Keyboard and Video Display, Data Conversions, Example Programs (no hexadecimal

dump). 6 Hrs

PART-D

7. Basic Peripherals and their Interfacing with 8086 : Semiconductor Memory Interfacing, Dynamic

RAM Interfacing, Interfacing I/O Ports, PIO 8255, Modes of Operation of 8255 7 Hrs

8. Basic Peripherals and their Interfacing with 8086 (contd..) Interfacing ADC, Interfacing DAC,

Stepper Motor Interfacing, Control of High Power Devices using 8255. Programmable Communication

Interfaces USART, 8259A Programmable Interrupt Controller (only ICW and OCW) 6 Hrs

Text Book:

1. Barry B Brey: The Intel Microprocessors, 8th Edition, Pearson Education, 2014.

2. Ajoy Kumar Ray & Kishor M Bhurchandi, Advanced Microprocessors and Peripherals, 3rd edition,

TMH, 2014 (5.1 to 5.9, 6.2, 6.4)

Reference Books:

1. Douglas V.Hall, Microprocessor and Interfacing , 3rd Edition , TMH, 2015

2. K. Udaya Kumar & B.S. Umashankar : Advanced Microprocessors & IBM-PC Assembly

Language Programming, 1st edition TMH 2014

CS306-OBJECT ORIENTED PROGRAMMING WITH C++ (4-0-0)4





1. Acquaint the students with Object-Oriented concepts and terminology. PO1

2. Be able to develop, design and implementation issues related to Object-Oriented techniques.

PO4,PO6

3. Understand functions and parameter passing. PO1,PO11

4. Be able to apply the user defined classes in C++. PO5

5. Applying the concepts of operator overloading, inheritance etc… PO5

6. Write the programs for any real time engineering problems PO6

PART-A

1. Introduction to C++ Object Oriented Technology, Disadvantages of Conventional Programming,

Programming Paradigms, Comparison of C++ with C, Advantages and key concepts of OOP, OO

Languages, Usage of OOP & C++, Console Input /Output in C++: Variables in C++, Reference

Variables in C++, Function Prototyping, Function Overloading, Default Values for Formal Arguments of

Functions. Inline functions. 6 Hrs

2. Classes and Objects: Introduction to classes and objects, Structures in C, Structures in C++.Classes in

C++, Declaring Objects, The public keyword, The private keyword, The protected keyword, Member

Functions, Outside member Function inline, Rules for Inline Functions, Data Hiding or Encapsulation,

Classes, Objects and Memory, Static Member variables and Functions, Static Object, Array of objects.

6 Hrs

8

PART-B

3. Objects as Function Arguments Friend Functions, The const Member Function, Recursive member

functions, Member Functions and Non-Member Functions. Operator Overloading and type

Conversion: Introduction, The Keyword Operator, Overloading Unary Operator, Operator Return Type,

Constraint On Increment and Decrement Operator, Overloading Binary Operator, Overloading with

friend Functions, Type Conversion. 7 Hrs

4. Constructors and Destructors :Characteristics of Constructors and Destructors, Applications with

Constructors, Constructors with Arguments, Overloading Constructors, Constructors with Default

Arguments, Copy Constructors, Destructors, Calling Constructors and Destructors, Qualifier and Nested

Classes, Anonymous Objects, Private Constructors and Destructors. 7 Hrs

PART-C

5. Inheritance: Introduction, Access Specifiers and Simple Inheritance, Protected Data with Private

Inheritance, Types of Inheritance: Single Inheritance, Multilevel Inheritance, Multiple Inheritance,

Hierarchical Inheritance, Hybrid Inheritance, Multipath Inheritance, Virtual Base Classes, Constructors

Destructors and Inheritance. 7 Hrs

6. Inheritance (contd..) & C++ and Memory: Object as class member, Abstract Classes, Qualifier

Classes and Inheritance, advantages and disadvantages of Inheritance. Introduction, Memory Models,

The new and delete Operators, Heap Consumption, Overloading new and delete Operators, Specifying

Address of an Object, Dynamic Objects, Calling Convention. 6 Hrs

PART-D

7. Binding & Virtual Functions : Introduction , Binding in C++,Virtual Functions, rules for Virtual

Functions , Pure Virtual Functions, abstract classes, working of Virtual Functions, Virtual Functions in

derived classes and constructors & Virtual Functions, Virtual Destructors. 6Hrs

8. Exception Handling: Introduction, Principles of Exception Handling, The keywords- try, throw and

catch, Exception Handling Mechanism, Multiple Catch Statements, Catching Multiple Exceptions,

Rethrowing exceptions, Exceptions in Constructors and Destructors, Guidelines for Exception Handling.

Generic Programming with Templates: Introduction, Need of Template, Definition of Class Template,

Normal Function Template. 7 Hrs

Text Books:

1. Ashok N. Kamthane, Object Oriented Programming with ANSI & Turbo C++, Pearson

Education-2013

(Chapters:1.3-1.5,1.7-1.11,6.1-6.17,6.19,6.20,6.24,7.1 7.14,7.21,8,9,14.11,14.13, 15.1-15.9,15.14)

2. Sourav Sahay, Object Oriented Programming with C++, Oxford Higher Education, Second

edition 2012.

Reference Books:

1. E. Balaguruswamy, Object Oriented Programming with C++, TMH Publications.

2. Herbert Schildt, Complete Reference C++, 4th Edition.

Web Reference: http://elearning.vtu.ac.in



1) Able to understand the importance of structure and abstract data type, and their basic

usability in different applications

PO1,PO2

2) Programs that helps to understand basic concepts of structures PO2

CS307 - DATA STRUCTURES LABORATORY WITH C & C++ (0-0-3) 1.5

Exam. Hours: 3 Hrs / week:3


http://elearning.vtu.ac.in/

9

3) Design and implement abstract data types such as stack and queues using C or C++ as the

programming language using static or dynamic memory allocation.

PO3

4) Solve problems using data structures such as linear lists, queues, binary trees, binary

search trees and writing programs for the same.

PO3

5) Gain practical knowledge on the application of data structures. PO3,PO4

6) Appropriate use of particular data structure and algorithm to solve the real world problems PO5

PRACTICE PROGRAMS ( SELF STUDY COMPONENT)

Following set of programs are given for execution in lab, which will be helpful in understanding the basics

of programming and serves as base for execution of Exercise Programs. These programs are not

considered for CIE and SEE, but carries 10 marks that will be included with record marks.

Practices the following Programs before executing the corresponding programs of Exercise

programs Part.

1. Write a C program to find the maximum and minimum element in an array of n integers. Use

only pointers for referencing the array.

2. Write a C program to calculate the area of circle, square and rectangle using pointers.

3. Write a C program for Dynamic Memory allocation of 10 elements and find the largest element.

4. Write a C/C++ program to concatenate 2 strings and check if the second string is present in the

first string.

5. Write a C program to add and subtract 2 polynomials of degree n.

6. Write a C/C++ program to represent a complex number using structure variable. Write user

defined functions that accept two complex numbers and finds their sum and difference.

7. Write a C function that checks if every element of array A is equal to corresponding element in

array B. That is the function must check if a[0]=b[0], a[1]=b[1] ……a[n]=b[n] . It is assumed

that A and B have equal number of elements. The function must accept only two pointer values

and the integer n representing number of elements. Function returns 0 for equal and nonzero for

unequal.

Exercise Programs

Following set of programs are included in CIE and SEE, Students have to pick a program in

CIE and SEE.

1. Write a C program to create a structure called Employee with three data members, Emp_nuber,

Emp_Name , Basic salary, Allowances and net salary. Write functions for reading the details of an

employee, Computing the net salary and for printing the details of employee.

2. Write a C program to create an array of structure where each structure holds the following details of a

student

USN Name Marks1 Marks2 Marks3

Non-zero

Positive

integer

25

Characters

Positive

integer

Positive

integer

Positive

integer

Write necessary functions1) Input details for n students.(n is the parameter to be read) 2) To display all

the records created 3) To search for specific record based on the USN using pointers. In case the

required record is not found, suitable message should be displayed. Both the options in this case must

be demonstrated.

3. Write a C program to construct a stack of integers and to perform the following operations on it.

10

i. Push

ii. Pop

iii. Display The program should print appropriate messages for stack overflow, stack underflow and stack empty.

4. Write a C program to convert and print a given valid parenthesized infix arithmetic expression to

postfix expression. The expression consists of single character operands and the binary operators +

(plus), - (minus), * (multiply) and / (divide).

5. Write a C program to evaluate a valid suffix/postfix expression-using stack. Assume that the suffix /

postfix expression is read as a single line consisting of non-negative single digit operands and binary

arithmetic operators. The arithmetic operators are +(ADD), -(SUBTRACT), *(MULTIPLY) and

/(DIVIDE).

6. Write a C/C++ program to implement a linear queue by initializing rear and front pointers.

7. Write a C/C++ program to implement a circular queue by initializing rear and front pointers.

8. Write a C/C++ program to implement a priority queue to add and delete the elements.

9. Write a C/C++ program to create a singly linked list and perform insertion, deletion and display

operations.

10. Write a C/C++ program to create and display an ordered linked list of integers.

11. Write a C/C++ program to create a doubly linked list and perform insertion, deletion and display

operations.

12. Write a C/C++ program to create a binary search tree and traverse the same in the three basic

traversal methods.

13. Write recursive C programs for the following:

Searching an element on a given list of integers using the Binary search method.

Solving the Towers of Hanoi problem.



1 Provide students in-depth practical base of the Digital Electronics and Microprocessors. PO1

2 Familiarize the students regarding designing of different types of the Digital Circuits. PO3,PO5

3 Provide the computational details for Digital Circuits. PO5

4 Gain Experience in assembly language programming of Microprocessor. PO1,PO4

5 Provide knowledge about microprocessor application. PO4

6 Perform Simulation and implementation of logic circuits using Xilinx software. PO4,PO5

PRACTICE EXPERIMENTS ( SELF STUDY COMPONENT)

Following set of programs are given for execution in lab, which will be helpful in understanding the

basics of programming and serves as base for execution of Exercise Programs. These programs are not

considered for CIE and SEE, but carries 10 marks that will be included with record marks.

Practices the following Experiments before conducting the corresponding Experiments of Exercise

Part.

1) Simplification and realization of Boolean Expressions using Logic Gates.

2) Realization of Half/Full adder using NAND gates.

3) Design and verify the truth table of the D type flip flop using NAND gates.

CS308 - DIGITAL AND MICROPROCESSOR LABORATORY (0-0-3) 1.5



11

4) Design and Implement the following using 4-bit shift register IC.

a) Johnson Counter

b) Ring Counter

6) Write an ALP to search a key element in a list of 'n' numbers using the Binary Search algorithm.

7) Write an ALP to read an alphanumeric character and display its equivalent ASCII code at the centre of

the screen.

8) Write an ALP to sort a given set of 'n' numbers in ascending order using the Bubble Sort algorithm.

9) Write an ALP to compute nCr using recursive procedure. Assume that 'n' and 'r' are non negative

integers.

10) Write an ALP to reverse a given string and check whether it is a palindrome or not.

11) Write an ALP to read the current time from the system and display it in the standard format on the

screen.

EXERCISE EXPERIMENTS

Following set of Experiments are included in CIE and SEE, Students have to pick a

Experiments from lot in CIE and SEE.

1. Design and implement 4:1 Multiplexer using NAND gates.

2. Design and implement the Full Adder and Full Subtractor using Decoder and other gates.

3. Design and verify the truth table of the J-K Master/Slave Flip-flops using NAND gates.

4. Design and implement the Asynchronous counter using 4 bit binary counter IC to count up from 0 to n

(n<15).

5. Design and implement a Mod-N (N<8)Synchronous counter using J-K Flip-flops. Display the result

suitably.

6. Write two ALP modules stored in two different files; one module is to read a character from the

keyboard and the other one is to display a character. Use the above two modules to read a string of

characters from the keyboard terminated by the carriage return and print the string on the display in the

next line.

7. 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.

8. Write an ALP to read your name from the keyboard and display it at a specified location on the screen

after the message " What is your name?" You must clear the entire screen before display.

9. Write an ALP to simulate a Decimal Up-Counter to display 00-99.

10. Write an ALP to create a file (input file) and to delete an existing file.

11. Write an ALP to implement a BCD Up-Down Counter on the Logic Controller Interface.

12. Write an ALP to display messages FIRE and HELP 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 it is necessary for the student to

compute these values).

13. write an ALP to scan an 8X3 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.

14. Write an ALP to 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. (Any arbitrary value for the delay may be assumed by the

student).

15. Write an ALP to generate the Sine Wave using DAC interface (The output of the DAC is to be

displayed on the CRO).

16. Write an ALP to drive an elevator interface in the following way:

(i) Initially the elevator should be in the ground floor, with all requests in OFF state.

12

(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 ignored.

HS003 - Communication Skills – I (0-0-3) 1

(Common to EE/EC/IT/CS/IS during the Odd semester term) Exam. Hours: 3 Hrs / week: 3


Semester: III/ IV Duration: 39 Hours (@3 hours/week)



1) Understand the rules of spelling, pronunciation and accent and demonstrate the speaking skills

a, d

2) Draw conclusions, relate contents and make presentations using multimedia H

3) Express ideas in essay structure that are clearly linked through cohesive paragraphs and appropriate transitions

g, h

4) Apply writing and presentation skills to assignments of other courses h, i

Part A

UNIT-1 & 2 : Me - My Dreams – SMART Goals, Explanation of Goals, Action Planning, Talking about

self, Writing about self in 500 words, SWOT Analysis - SWOT through situations, Time management

strategies and application in a given situation, Essay Writing, Spotting difference in formal and informal

writing & Rewriting informal in formal form, Grammar - error corrections, Grammar exercises

(application and analysis). 12 Hrs

Part B

UNIT-3 & 4 : Rules of spelling/ pronunciation & Accent, Homophones, Homonyms - Academic

Vocabulary/ Speaking Skills, Time Management - Time management strategies and application in a

given situation. Comprehensions - Reading comprehension for drawing inferences, skimming and

scanning techniques. 09 Hrs

Part C

UNIT-5 & 6 : Understanding academic essay structure - Formal & Informal writing - Interpretation of

graphs and Report writing, Negotiations/ Conflict Management - Application of negotiation and conflict

management skills in a given situation, Power of Body Language - understanding body language,

Interpreting body language, Individual activities through solving problems given in worksheets.

09 Hrs

Part D UNIT- 7 & 8 : Taking and Giving directions – General & Academics, Giving and taking information -

Writing process of model making (any) writing directions to reach a destination by looking at picture,

Presentation Skills – Making academic presentations - Making power point presentations/ using multi-

media. These sessions will be student centered practical sessions imparted through language games,

group activities, group discussions based on video clippings. 09 Hrs

Evaluation: CIE–1 & 2 (20 marks each); Assignment–1 (10 marks) and SEE (50 Marks)

ii year b.e.: scheme of teaching and credits: 2016-2017...

Documents