Scheme of Syllabus for Third Semester B.E. Computer Science & Engg

(2011-12 Admission Batch)

Sl.No Subject Code Subjects Hrs/Week

C CIE *SEE Total L T P

1 UMA301C Engineering Mathematics- III 4 0 0 4 50 50 100

2 UCS322C Data Structures using C 4 0 0 4 50 50 100

3 UCS313C Digital Systems 4 0 0 4 50 50 100

4 UCS324C Theoretical Foundations of Computer

Science 3 0 0 3 50 50 100

5 UCS315C Computer Organization 4 0 0 4 50 50 100

6 UCS316H Engineering Technology and

Management 3 0 0 3 50 50 100

7 UCS317L Digital Systems Lab 0 0 3 1.5 50 50 100

8 UCS318L Data Structures Lab 0 1 2 1.5 50 50 100

9 UCS339L Introduction to Linux and IT skills

Lab 0 2 2 2 50 50 100

10 UCS340M* Introduction to Linux and IT skills

Lab 0 2 2 0 50 50 100

22 3 7

**

27/

25

450 450 900

* UCS340M-Introduction to Linux and IT Skills Lab is mandatory subject only for students

having Diploma and admitted to 3rd

semester through lateral entry scheme. However they

are exempted from registering for UCS339L.

** 27 credits for regular entry students.

25 credits for students having diploma and admitted to 3rd

semester through lateral entry

scheme.

Note: Diploma lateral entry students have to additionally register for EVS.

UMA301C ENGINEERING MATHEMATICS-III 4 Credits

Hrs/Week: 04 CIE Marks: 50

Total Hrs: 52 SEE Marks: 50

Unit-I

Numerical Analysis: 14 Hours

Roots of Equations: Motivation, Non computer methods for determining roots, roots of Equations

and Engineering Practice, Mathematical background, goals and objectives: Bracketing Methods,

Graphical Methods. The Bisection Method, The Newton – Raphson Method, Pitfalls of the

Newton – Raphson Method: Multiple roots, Modified Newton – Raphson Method for multiple

roots. Finite differences, Forward and Backward difference operators (No derivation on relation

between operators). Newton-Gregory Forward and Backward interpolation formulae (without

proof). Lagrange’s and Newton’s divided difference interpolation formulae (without proof).

Numerical differentiation using Newton’s Forward and Backward formulae.

Numerical Integration: Trapezoidal rule, Simpson’s one third, Simpson’s three eighth rule and

Weddle’s rule (no derivation of any formulae). Numerical solutions of first order ODE- Euler’s

and Modified Euler’s Method, Runge Kutta 4th

order Method, Milne’s Predictor and Corrector

method (problems only).

Unit –II

Fourier Series, Fourier Transforms, Z-Transforms: 14 Hours

Periodic functions, Conditions for Fourier series expansions, Fourier series expansions of

continuous functions and functions having infinite number of discontinuities, even and odd

functions. Half-range series, Practical Harmonic Analysis.

Infinite Fourier transforms and inverse Fourier transforms- simple properties, Complex Fourier

transforms, Fourier sine and Fourier cosine transforms, Inverse Fourier sine and cosine transforms,

Convolution theorem.

Z-Transforms-definition, standard forms, linearity property, damping rule, shifting rule- problems.

Unit – III

Partial Differential Equations: 12 Hours

Formation of partial differential equations by elimination of arbitrary constants and arbitrary

functions, Solution of equation of the type : ,Pp Qq R Charpit’s Method, Solution of PDE by

the method of separation of variables.

Derivation of one–dimensional heat and wave equations. Numerical solution (finite difference) of

one-dimensional heat and wave equations by explicit method, Laplace equation by using standard

five point formula.

Unit – IV

Linear Algebra: 12 Hours

Rank of a matrix by elementary transformations, Consistency of system of linear equations, Gauss-

Seidel Method, Characteristic values and Characteristic Vectors of matrices (no theorems), Largest

Eigen value and the corresponding Eigen Vector by Power Method.

Calculus of Variations:

Variation of a function and a functional, Extremal of a functional, Variational problems, Euler’s

equation, Standard variational problems including Geodesics, Minimal Surface of Revolution,

Hanging Chain and Brachistochrone problems.

Resources:

1) Numerical Methods for Engineers by Steven C Chapra & Raymond P Canale.

2) Higher Engineering Mathematics by Dr. B. S. Grewal, Khanna Publishers, New Delhi.

3) Advanced Engineering Mathematics by E Kreyszig, John Wiley &Sons.

4) Higher Engineering Mathematics by H. K. Dass, S. Chand & Co.

Question Paper Pattern for SEE:

1) Total of eight questions to be set uniformly covering the entire syllabus.

2) Each question should not have more than 4 sub divisions.

3) Any five full questions are to be answered choosing at least one from each unit.

UCS322C DATA STRUCTURES USING C 4 CREDITS

Hrs/Week: 04 CIE Marks: 50

Total Hrs: 48 SEE Marks: 50

Course Objectives and Outcomes

The Data structures using C course is designed for equipping the students with thorough

knowledge about data structures and advanced C Concepts.

After the completion of the course student should be able to,

1. Incorporate advanced C concepts such as Pointers, Structures, Unions, Bitwise operators,

Macro definitions, Command line arguments, Files in program development for solving

any problems.

2. Define data structures and abstract data types.

3. Design and implement standard linear data structures such as stack, queue, linked list for

various problem solving tasks.

4. Design and implement standard non-linear data structures such binary trees, Binary Search

Trees and graphs.

5. Analyze the problem and solve it using appropriate data structures.

6. Develop and construct new data structures for problem solving.

UNIT I

12 Hours

Pointers: Concepts, Pointer variables, Accessing variables through pointers, Pointer declaration

and definition, Initialization of pointer variables, Pointers and functions, Pointer to pointers,

Compatibility, Lvalue and Rvalue, Arrays and pointers, Pointer arithmetic and arrays, Passing an

array to a function, Memory allocation functions, Array of pointers, dynamic array, Strings and

pointers , array of strings, string manipulation functions.

Derived types Enumerated, Structure and Union: The type definition, Enumerated types,

Structure, Accessing structures, Complex structures, Array of structures, Structures and functions,

Unions, pointers to structures.

Files: Revision of file concepts, character i/o functions ,Classification of Files, ,creating ,reading,

printing and copying text file, Using Binary Files, Standard Library Functions for Files.

Bitwise operators: logical bitwise operators, shift operator, bitwise use.

Preprocessor directives: File inclusion, macro definition, conditional compilation.

Command line arguments: Definition and use.

Storage classes: Types and type qualifiers.

Separate compilation: Writing separate compilation units, procedures for separate compilation

units, Concept of problem solving using C tools.

UNIT II

12 Hours

Introduction to Data Structures :Basic concepts, Pseudocode: Algorithm header, Purpose,

Conditions and Return, Statement Numbers, Variables, Statement constructs, sequence, selection,

loop, Psuedocode example, The abstract data type: Atomic and composite data, Data type, Data

structure, Abstract data type, Model for an abstract data type: ADT operations, ADT data

structures, ADT Implementations: Array implementation, Linked list implementation, Pointers to

linked lists, Generic code for ADTs: Pointer to void, Pointer to Function: Defining pointers to

functions, Using pointers to functions.

Linear Lists: Stacks: Basic stack operations: Push, Pop, Stack top, Stack linked list:

Implementation, Data structure, Stack head, Stack data node, Stack algorithms, Create Stack, Push

Stack, Stack top, Empty Stack, Full Stack, Stack count, Destroy Stack, C language implantations:

Insert data, Push Stack , Print Stack, Pop character, Stack ADT: Data structure, ADT

Implementations, Stack structure, Create stack, Push stack, Pop stack, Stack top, Empty stack,

Stack count, Destroy stack, Stack applications: Reversing data, Reverse a list, Convert decimal to

binary, Infix to postfix transformation, Evaluating postfix expressions.

Recursion: Factorial- A case study: Recursion defined, Iterative solution, Recursive solution,

Designing Recursive algorithms: The design methodology, Limitations of recursion, Design

implementation- Reverse keyboard input, Recursive examples: Greatest common divisor, GCD

design, GCD C implementation, Fibonacci Numbers, Design, Fibonacci C implementation, How

recursion works.

UNIT III

12 Hours

Queues: Queue Operations: Enqueue, Dequeue, Queue front, Queue rear, Queue example, Queue

Linked list design: Data structure, Queue head, Queue data node, Queue algorithms, Create queue,

Enqueue, Dequeue, Retrieving queue data, Empty queue, Full queue, Queue count, Destroy

queue, Queue ADT: Queue structure, Queue ADT algorithms, Queue Applications

General Linear lists: Basic operations, Insertion, Deletion, Retrieval, Traversal, Implementation:

Data structure, Head node, Data node, Algorithms, Create list, Insert node, Delete node, List

search, Retrieve node, Empty list, Full list, List count, Traverse list, Destroy list, List ADT: ADT

functions, Create list, Add node, Internal insertion function, Remove node, Internal delete

function, Search list, Internal search function, Retrieve node, Empty list Full list, List count,

Traverse, Destroy list, Application: Data structure, Application functions, Mainline, Print

instructions, Compare year, Complex Implementations: Circularly linked lists, Doubly linked lists,

Insertion, Deletion.

UNIT IV

12 Hours

Non-Linear lists: Trees: Basic tree concepts, Terminology, User representation, Binary trees:

Properties, Height of binary trees, Balance, Complete and Nearly complete binary trees, Binary

tree traversals, Depth-first traversals, Breadth-first traversals, Expression Trees, Infix traversal,

Postfix traversal, Prefix traversal, Huffman code, G Binary search trees: Basic concepts, BST

operations: Traversals, Searches, Find the smallest and largest node, BST search, Insertion,

Deletion, Binary search tree ADT, Data structure, Head and node structure, Algorithms, Create a

BST, Insert a BST, Internal insert function, Delete a BST, Internal delete function, Retrieve a BST,

Internal retrieve function, Traverse a BST, Internal traverse function, Empty a BST, Full BST,

BST count, Destroy a BST, Internal destroy function.

Graphs: Basic concepts, Operations: Insert vertex, Delete vertex, Add edge, Delete edge, Find

vertex, Graph storage structures: Adjacency matrix, Adjacency list.

Text Books:

Behrouz A. Forouzan and Richard F. Gilberg , 2nd Edition, Thomson, 2003, Computer

Science A Structured Programming Approach Using C, (Chapter 4:4.1 to 4.5, Chapter

7:7.17.3, Chapter 9:9.1 to 9.9, Chapter 10:10.1 to 10.7, Chapter 11:11.1 to 11.5, Chapter

12:12.1 to 12.8, Chapter 13.1 to 13.3, Chapter 14, Chapter 15:15.1 to15.3,Appendix G, I, J,

K,L)

Behrouz A. Forouzan and Richard F. Gilberg, 2nd Edition, Cengage Learning Publisher,

2005. Data Structure A Pseudocode Approach with C, (Chapter 1(1.1-1.5), 2,3,4

(4.1-4.4), 5, 6(6.1-6.2 )7(7.1-7.3), 11)

Reference Books:

Basavraj S Anami, Shanmukhappa Angadi, Sunil Kumar S Manvi, PHI Publications,

2010. A Holistic approach to learning C.

Andrew Tenanbaum, Thomson, 2005, Data Structures with C.

Robert Kruse & Bruce Leung, Data Structures & Program Design in C,

Pearson Education, 2007.

UCS313C DIGITAL SYSTEMS 4-CREDITS

Hrs/Week :04 CIE Marks:50

Total Hrs:48 SEE Marks:50

Course outcomes:

After completion of this course student should be acquainted with theoretical and practical aspects of

Digital System Design.

Can explain more confidently about the working of various basic Digital elements involved in

combinational and sequential circuits, Digital and Analog, Analog to Digital circuits.

Able to simplify the complex digital circuits using Boolean theorems and bring it to simplest possible

low cost digital circuits by applying K-map, Quine McChliskey methods etc.

Can design arthmetic circuits, code converters, multiplexers, comparator, registers, and counters using

MSI digital IC’s available in the market.

Finally better equiped with complete knowledge of digital systems to enter and compete in the job

market.

Able to understand how opamp useful to replace electronic circuits containing transistor, diodes and

registers by single IC chip.

Can able to design linear and non linear circuits, ADC, DAC.

UNIT-I 12 Hours

Boolean algebra and combinational networks:

Boolean algebra- Definition, principle of duality, Boolean algebra theorems, The two valued Boolean

algebra Boolean formulas and functions- normal forms Canonical Formulas- Minterm canonical formula,

m-notation, Maxterm Canonical formulas, M-notation Manipulation of Boolean formulas Gates and

combinational networks Incomplete Boolean functions and don’t care conditions, Additional Boolean

operations and gates, Introduction to HDL

Simplification of Boolean expressions:

Formulation of the Simplification problem Prime Implicants and Irredundant Disjunctive expressions

Prime implicates and Irredundant conjunctive expressions Karnaugh maps Using K-map to obtain

minimal expression Minimal expressions for incomplete functions.

HDL implementation of logic ckts.

UNIT-II 12 Hours

The Quine-McCliskey method of generating prime implicants and prime implicates Decimal method for

obtaining prime implicants/implicates Variable Entered K-map. Design of code converters, adder /

substractor , multiplexer / demultiplexer , comparator and other circuits .

Logic Design with MSI components and programmable logic Devices:

Decimal Adders Comparators Decoders Encoders Multiplexers, PLDs, PROM, PLAs PALs , HDL

implementation of data processing circuits.

UNIT-III 12 Hours

Flip-Flops and applications:

Basic bistable element Latches Master Slave Flip-Flops Edge Triggered Flip-Flops Characteristic

equations Registers Counters Design of Synchronous Counters.,

Synchronous Sequential networks:

Structure and operation of clocked Synchronous sequential networks Analysis of clocked Synchronous

sequential networks,

HDL implementation of flipflops, registers and counters.

UNIT-IV 12 Hours

Op-Amps and D/A -A/D conversion:

Introduction to operational amplifiers

Introduction, the operational amplifier, Block diagram representation of a typical Op-Amp, Interpreting a

typical set of data sheets,The Ideal Op-Amps,Equivalent Circuits of an Op-Amps,Ideal Voltage Transfer

curve,Open Loop Op-Ams Configurations,Summing,Scaling,Average Amplifiers,

Analog to digital converters and Digital to analog converters,

Variable resistor networks, Binary Ladders D/A Converters, D/A Accuracy and resolution. A/D Converter

– Simultaneous conversion, A/D Converter – Counter Method.

Text Books

1. D.D. Givone, 2002, ‘Digital Principles and design’, TMH.

(3.1 to 3.9, 4.1 to 4.6, 4.8, 4.11, 4.14-1 to 4.14-3, 5.1-1, 5.1-2, 5.2 to 5.10,

6.1 to 6.9, 7.1, 7.2)

2. Ramakant A. Gayakwad, 2008, ‘Op-Amps and Linear Integrated Circuits’, 4th Edition, PHI.(1.1 to

1.3, 2.2 to 2.6, 6.5, 8.11-1 and 8.11-2)

3. Malvino, Leach and Saha ‘Digital Principles and applications’, 6th Edition, 2007, TMH, ( 2.5, 3.11,

4.14, 6.12, 8.12, 9.7, 10.9, 12.1 to 12.6)

Reference Book:

1) R.D.Sudhakar Samuel, Logic Design - a simplified appraoch revised Edition, 2005, Sanguine Technical

Publications.

UCS324C THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE

3-CREDITS Hours/Week: 03 CIE MARKS: 50

Total Hours: 40 SEE Marks: 50

At the end of the course, the student will be able to:

1. Apply the techniques of discrete methods and combinatorial reasoning to solve the problems.

2. Apply various tools to the areas of data structures, theory of computer languages and analysis of

algorithms.

3. Represent the real-world problems in the form of graphs and solve them

UNIT-I 10 Hours

Fundamentals of Logic: Basic Connectives and Truth Tables, Logic Equivalence – The Laws of Logic,

Logical Implication – Rules of Inference, The Use of Quantifiers, Quantifiers, Definitions and the Proofs of

Theorems.

UNIT-II 10 Hours

Review of set theory, Relations and Functions: Cartesian Products and Relations, Functions – Plain and

One-to-One, Onto Functions – Stirling Numbers of the Second Kind, Special Functions, The Pigeon-hole

Principle, Function Composition and Inverse Functions, Properties of Relations, Computer Recognition-

Zero-One Matrices and Directed Graphs, Partial Orders – Hasse Diagrams, Equivalence Relations and

Partitions

UNIT-III 10 Hours

Semigroups, Monoids, Groups: Semigroups and Monoids, Definitions, Examples, and Elementary

Properties, Homomorphisms, Isomorphisms, and Cyclic Groups, Cosets and Lagrange’s Theorem.

Introduction to Graphs: Definition of Graph, Applications of graphs, Finite and Infinite Graphs,

Incidence and degree, Isolated Vertex, Pendant Vertex and Null graph

Paths and circuits: Isomorphism, Subgraphs, Walks, Paths and Circuits, Connected graphs, Disconnected

graphs and Components, Euler graphs, Operations on graphs, Hamiltonian Paths and Circuits, Traveling

Salesman Problem.

UNIT-IV 10 Hours

Trees and Fundamental Circuits: Trees, Properties of Trees, Pendant vertices in trees, Distance and

centers in trees, Rooted and Binary trees, Counting trees, Spanning trees, Fundamental circuits, Finding all

Spanning trees of a graph, Spanning trees in weighted graph.

Cut-Sets and Cut-Vertices: Cut-Sets, Some properties of a Cut-Set, All Cut-Sets in a graph, Fundamental

Circuits and Cut-Sets, Connectivity and Separability, Network Flows, 1-Isomorphism, 2-Isomorphism.

Planar and Dual Graphs: Combinatorial Vs. Geometric Graphs, Planar Graphs, Kuratowski’s Two

Graphs.

Text books:

1. Ralph P. Grimaldi, 2004., Discrete and Combinatorial Mathematics, 5th Edition, PHI/Pearson

Education

2. Narasingh Deo, Graph Theory with Applications to Engineering and Computer Science, PHI.

Reference books

1. Dr. D.S. Chandrasekharaiah, Prism, 2005, Graph Theory and Combinatoics.

2. Chartrand Zhang, TMH, 2006, Introduction to Graph Theory.

3. Richard A. Brualdi, 4th Edition, Pearson Prentice Hall, 2004, Introductory Combinatorics,

4. Geir Agnarsson & Raymond Geenlaw, Pearson Prentice Hall, 2007, Graph Theory Modeling,

Applications, and Algorithms.

UCS315C COMPUTER ORGANIZATION 4-CREDITS

Hrs/Week :04 CIE Marks:50

Total Hrs:48 SEE Marks:50

Course learning outcomes

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

1 Describe how data is represented in a computer.

2 Explain the basic organization of the computer and its major functional units.

3 Explain how an instruction is executed in a computer.

4 Write and debug assembly programs.

5 Explain the basic concepts of interrupts and I/O operations.

6 Distinguish different methods used in computer organization.

7 Explore the basic issues in processor, memory and I/O organization.

8 Analyse the performance of the computer.

UNIT-I 12 Hours

Basic structure of Computers:

Computer types, Functional Units, Basic operational concepts, Bus structures

Machine instructions and programs:

Numbers, Arithmetic operations and characters, Memory locations and addresses, Memory operations,

Instructions and instruction sequencing, Addressing modes, Assembly language , assembler directives,

number notation , Basic I/O operations, Stacks and Queues, Subroutines, Encoding of machine instructions

UNIT-II 12 Hours

Input/Output organization:

Accessing I/O devices, Interrupts-Interrupt hardware , Enabling and Disabling Interrupts, Handling

Multiple devices, controlling device requests, Exceptions, Direct memory access – Bus Arbitrations,

Buses- Asynchronous Bus and Synchronous bus , Interface Circuits- Parallel port and serial port, Standard

I/O Interfaces –Peripheral component interconnect Bus, SCSI bus, USB.

UNIT-III 12 Hours

The memory system:

Some Basic concepts, Semiconductor RAM memories, Read only memories, Secondary storage -

Magnetic Hard disks ,Optical Disks, Magnetic tape systems.

Arithmetic Unit:

Addition and subtraction of signed numbers, Design of fast adders, Multiplication of positive numbers,

Signed operand multiplication, Fast multiplication.

UNIT-IV 12 Hours

Arithmetic Unit(Continued..):

Integer Division, Floating point numbers and operations – IEEE standard for Floating point numbers,

Arithmetic operations on Floating point numbers. Implementing Floating point operations.

Basic Processing Unit:

Some fundamental concepts, Execution of complete instruction, Hardwired Control, Micro programmed

control, Microinstructions, microprogram sequencing, Wide branch addressing, Microinstruction with next

address field, Prefetching microinstruction

Performance:

Processor Clock, Basic performance equation, pipelining and superscalar operations, Clock rate,

Instruction set, compiler, performance measurement.

Text Books

1. Hamacher , Zvonko Vranesic, Safwat Zaky, 2002. ‘ Computer Organization’, Fifth Edition, MGH.

(1.1 to 1.4, 2.1 to 2.5, 2.6.1, 2.6.3, 2.7 to 2.9, 2.12, 4.1 , 4.2.1 to 4.2.5, 4.4,4.5.1 to

4.5.2, 4.6 , 4.7, 5.1 to 5.3, 5.9, 6.1 to 6.7, 7.1 to 7.4, 7.5.1 to 7.5.4, 1.6)

Reference Books

1. J.P. Hayes , 1998, ’Computer Architecture and Organization ‘ , Third Edition, MGH.

2. William Stallings, 2007 ‘Computer Organization and Architecture’, 7th Edition, PHI.

UCS316H ENGINEERING TECHNOLOGY AND MANAGEMENT 3-CREDITS

Hours/Week: 03 CIE Marks: 50

Total Hours: 40 SEE Marks: 50

At the end of the course, the student will be able to:

1. Analyze the roles played by different levels of managers.

2. Organize the activities required to complete the projects

3. Describe the importance of groups to perform the assigned tasks effectively and efficiently and

methodology of group management.

4. Explain the R& D project selection process.

5. Estimate the financial profits/losses gained in the projects.

UNIT-I 10 Hours

Engineering and Management: Introduction, Definitions of Engineering and management. Management

levels, About managers, Managerial skills, Managerial roles, Functions of managers, Process of

management, Engineering management, Need for Engineers in Management, Management and Engineering

Career. Historical Development of Engineering Management: Origins, The Industrial Revolution,

Management Philosophies, Scientific Management, Administrative Management, Behavioral Management.

UNIT-II 10 Hours

Planning, Forecasting and Decision Making: Introduction, Nature of Planning, The Foundation for

Planning, Some Planning concepts, Forecasting-Quantitative and Qualitative methods, Strategies for

Managing Technology, Nature of Decision Making, Management Science, Tools for decision making.

Organizing and some Human aspects of Organizing: Introduction, Nature of organizing, Traditional

organization theory, Staffing Technical Organizations, Authority and power, Delegation, Committees and

Meetings.

UNIT-I II 10 Hours

Motivation and Leading Technical People: Motivation, Theory X and Theory Y, Content and Process

theories, Leadership: Nature of leadership, People/Task Matrix approaches, Situational Approaches.

Controlling: Introduction, Process of control, Three Perspective on timing of control, Characteristics of

effective control systems, Financial and Non-financial controls

UNIT-IV 10 Hours

Technology Management: Introduction, Product and Technology life cycles, Nature of Research and

Development, Research Strategy and Organization, Selecting R&D projects, Protection of Ideas: Patents

and copyrights, Creativity: Nature of Creativity and Creative process, Characteristics of Creative People.

Managing Engineering Design: Introduction, Nature of Engineering Design, Systems Engineering/New

Product Development: Phases/Stages, Concurrent Engineering and CALS, Control Systems in Design,

Designing for Reliability: Significance, Reliability and Risk, Simple reliability models.

Text books:

1. Daniel L. Babcock and Lucy C. Morse, Managing Engineering and Technology, Prentice-Hall of

India Private Limited, 2005, New Delhi, Third Edition.

Reference books:

1. Harold Koontz and Weihrich, Tata McGraw-Hill, 1998, Essentials of Management.

2. Don Hellrigel, John W. Slocum Jr. Addition-Wesley Publishing Company, 1991, Singapore ,

Management, 6th

Edition.

3. James A. F. Stonner, Second Edition, Prentice-Hall of India Private Limited, New Delhi,

Management.

4. V. S. Bagad, Technical Publications, Pune, Engineering and Technology Management, Joseph L.

Massie, Fourth Edition, Prentice-Hall of India, Pearson, 2003, Essentials of Management

UCS317L DIGITAL SYSTEMS LABORATORY 1.5-CREDITS

Hours/Week: 03 CIE Marks: 50

SEE Marks: 50

Course outcomes:

After completion of this course student should be acquainted with practical aspects of Digital System

Design.

Student to know about various forms of digital IC’s available in the market.

To classify into SSI/MSI/LSI groups.

To construct truth table based on working principle and select suitable IC’s to design the given circuits.

To find several options in design and demonstrate the same circuit in different forms using Boolean

simplification method and choice of suitable IC’s.

Can design low cost digital circuits in a computer system.

Can design any given circuit and test the working using software techniques (Verilog HDL code).

Practice Assignments using digital I C’s :

Implementation of Boolean Expressions of basic logic gates such as 2-input/3-input

AND,OR,NAND,NOR, EX-OR gates

Simplification of simple Boolean Expressions in SOP/POS forms.

PART- A (Hardware Implementation)

1. Design a Binary to Gray Code converter with K map simplification and using basic Gates.

2. Given any 4-variable logic expression, simplify using K-MAP/Quine McCliskey and realize the

simplified logic expression using 8:1 multiplexer IC.

3. Realize a full adder using 3-to-8 decoder IC and 4 input NAND gates.

4. Realize a full substractor circuit using 3 to 8 line decoder IC and 4 input NAND gate.

5. Realize a J-K Master/Slave Flip-Flop using NAND gates and verify its truth table.

6. Design and implement a mod-n (n<8) synchronous Up Counter using J-K Flip-Flop and basic gate ICs.

7. Design and implement a mod-n (n<8) synchronous Down Counter using J-K Flip-Flop and basic gate

ICs.

8. Design and implement an asynchronous counter using decade counter IC to count up

from 0 to n (n<=9) & display the numbers using 7-segment display.

9. Design a Ring and Johnson Counter using a 4-bit Shift Register IC.

10. Design a 4-bit R-2R ladder D/A converter using Op-Amp. Determine its accuracy and resolution.

Practice Assignments using Simulation package :

Implementation of Boolean Expressions of basic logic gates such as 2-input/3-input

AND,OR,NAND,NOR, EX-OR gates

Simplification of simple Boolean Expressions in SOP/POS forms.

PART- B (Software Implementation)

1. Write the Verilog/VHDL code for Binary to Gray Code converter and verify its

working.

2. Write the Verilog/VHDL code for an 8:1 multiplexer. Simulate and verify its working.

3. Write the verilog/VHDL code for a full adder .Simulate and verify its working.

4. Write the Verilog/VHDL code for D Flip-Flop with positive-edge triggering. Simulate

and verify its working.

5. Write a verilog/VHDL code for mod-8 up counter. Simulate and verify its working.

6. Write the verilog/VHDL code for switched tail counter. Simulate and verify its working.

Note :

Any simulation package like MultiSim/Active HDL etc. may be used.

In the examination questions must be given on lots. Each student must be given one question from

PART-A and one from PART-B.

Practice Assignments are not to be considered for SEE Examination.

Column Size

table

UCS318L DATA STRUCTURES LABORATORY 1.5 CREDITS

Hours/Week: 03 CIE MARKS: 50

SEE Marks: 50

Course Objectives and Outcomes

The Data structure laboratory course is designed to equip the students with the knowledge of the

implementation of standard data structures and use them for problem solving using advanced C

programming concepts.

After the completion of the course the student should be able to,

• Write and execute C programs on Linux and Windows platforms for solving any task using advanced C

programming concepts such as pointers, structures, unions, files, bitwise operators, macro operators,

command line arguments etc.

• Apply the standard data structures such as stacks, queues, binary trees, linked list and graphs in writing

programs.

• Devise new data structures when required for solving programming problems.

• Define the sorting and searching problem and implement them using simple techniques such as selection,

bubble and insertion sort. Further the student should be able to comment on the efficiency of these

techniques.

1.

a) Write a C program to hold information about the students like roll_no, name, usno, and stay (hostelite /

localite). In addition for hostelites room_no, mess_id and for localites their residence address are to be

stored. Use array of structures nested as specified below. Write function to display the list of hostelites and

localites separately.

(hint : structure hostel : mess_id, room_no

union stay_inf : hostel, residence address

structure student: roll_no, name, usno, an integer to indicate an hostelite or localite, stay_inf).

b) Write a C program to hold the details of the students like name, usno, rollno and marks in three subjects.

Compute average for each student. Use array of pointers to structures and dynamic memory concept. Also

provide function to sort the array of pointers based on average marks computed.

(hint: structure student: name, rollno, usno, marks [3]

array class : student * class [ ]

use malloc to allocate space for each student structure).

2

a) Write a C program to store 2d ragged array use calloc function to allocate memory for array. The no of

rows and column size of each row must be tailored to the needs of the user. Provide functions to load,

display and retrieve specific element from the array.

(hint: for ragged array(uneven column size)representation using dynamic memory refer to ‘A Structured

programming approach using C ‘ by Forouzan, page no:497, int ** table : pointer to array of pointers

with each cell of an array holding starting address of a row. Each row contains size of the row as its first

element.

For Ex, following diagram depicts the data structure for a 2d ragged array of 3 rows with sizes 3, 5, 4

respectively.)

3 1

2 3 4

5 5 1

0 6 2

1 7

8 6

1 4 2 3

1 4

0 7

0

b) Write a C program to hold names of several cities using 2d array. Use pointer to 2d array to display

individual cities and last character of the city.

(hint : array : int table [ ] [ ] pointer : int ** ptable=table).

3

a) Write a C program to create a text file. Provide functions to perform the following.

i) Tokenize the text (hint: tokens are words delimited by whitespace. use strtok)

ii) Place the words containing vowels and not containing vowels into two different files whose names are

fed as command line arguments.

iii) Search for a particular word and display the message (exists or do not exists) accordingly.

b) Write a program to perform the following on a binary file (use functions).

i) Create a file containing students information like rollno, name, usno

ii) Display the file contents in reverse order

iii) Determine nth student record details.

iv) Search for a given student based on usno and accordingly allow to modify the file contents.

4

a) Write recursive functions to find all occurrences of a substring in a string.

b) Check recursively if the following objects are palindromes.

i) Words ii) Sentences (ignoring punctuation, blank, uppercase & lowercase)

5

a) Write a C program to implement two stacks using only one array. Your stack routines should not declare

an overflow unless every cell in the array is used.

(hint: use two ends of array as base of two stacks so that they grow in opposite direction and declares stack

full only when top of stack 1 meets top of stack 2)

b) Write a C program to convert prefix expression to postfix.

(hint: use stack)

6 a) Write a C program to implement dequeue using array. Provide routines remvleft,remvright,insertleft and

insert right to remove and insert at left and right ends of a dequeue.Also write routines to test for queue

full and queue empty.

(dequeue is double ended queue were insertion and deletion takes at either end)

b) Write a C program to implement priority queue with 3 priorities high, medium and low for customers

with cust_id and number_of_ items purchased. Write C functions to insert, delete and to test for queue

empty and queue full conditions.

7

a) Write a C program to add two polynomials of 3 variables x, y, z using singly linked list.

(hint: accept the terms as quadruple containing coefficient followed by degree of (x, y, z))

b) Write a C program to perform the following on doubly linked list with each node containing one integer

field.

i) Function to create doubly linked list. ii) Functions to compute L1 L2 and L1 L2 where L1

& L2 are two doubly linked list iii) function to display list.

8

a) Write a C program to sort the vertices of given graph G in the non-decreasing order of degrees use

adjacency matrix representation of the graph and insertion sort technique.

b) Write a C program that accepts a pointer to a binary tree and returns a pointer to a

new binary tree that is the mirror image of first.

9

a) Using selection sort technique sort the array of pointers using C program, so that the numbers can be

accessed in non-decreasing order. Do not modify the array containing the numbers.

b) Write a C program to read the ten different names and sort them using bubble sort in non-increasing

order.

Note: The list of problems is an indicative list only

UCS339L INTRODUCTION TO LINUX AND IT SKILLS LAB

(1 Hr Tutorial, 3 Hrs Practical) 2 CREDITS

Hours/Week: 04 CIE MARKS: 50

SEE Marks: 50

PART –A

Introduction to Linux Laboratory

Course Objectives and Outcomes

The Introduction to LINUX Laboratory Course is designed to equip the students with knowledge of

understanding of basic UNIX commands, and it is structured as a command reference for better continued

learning effectiveness.

After the completion of the course the student should be able to

Demonstrate a broad and integrated understanding of Unix concepts and terminology

Fully utilize basic UNIX commands to take advantage of the most important features of the file

system.

Create documents, edit documents, enhance text & create tables.

Insert or delete a worksheet, perform simple arithmetic calculations directly in a cell as well as by

referring to another cell, sort data & create simple graphs and charts.

Create effective presentations, add new slides, add text to slides & Navigate among slides.

INTRODUCTION TO LINUX

UNIT-I

Introduction to Linux, a Command, Users and super users, The role of the Shell, Running a shell, Logins,

Logouts, and Shutdowns, The File system, The Shell, Installing Software, tar.gz and tar.bz2 files, Basic File

Operations, Directory Operations, File Viewing, File creation and Editing, File Properties, File Location,

File Text Manipulation, More Powerful Manipulations, File Compression and Packaging, File Comparison,

Disks and file systems, viewing Processes, Users and Their Environment, Working with User Accounts,

Working with Groups, Basic Host Information, Host Location, Screen Output, Math and Calculations, &

Dates and Times.

UNIT-II

SHELL PROGRAMMING

System variables, local variables, executing a shell script, comments, read command, multiple arguments,

positional parameters, branching control structures: if conditional, the test command, the case command,

loop control structures: the while command, the until command, the for command, the continue & break

statements, the sleep command, debugging scripts & more script examples.

References:

1. Linux Pocket Guide, Essential Commands, Daniel J, O’Reilly Media, Feb.

2. Introduction to UNIX & SHELL programming, M.G. Venkatesh Murthy, Pearson Education.

3. Unix concepts and applications, Fourth Edition, Sumitabha Das, TMH.

PART-A

LAB ASSIGNMENTS:

1. Working with basic file and directory operations using the following commands: ls, cp, mv, rm, ln, cd,

pwd, basename, dirname, mkdir, rmdir.

2. File viewing using cat, less, head, tail, nl, od, xxd, gv.

3. File creation and editing using emacs, vim, umask, soffice, abiword, gnumeric

4.Knowing file properties using stat, wc, du, file, touch, chmod, lsattr

5. Knowing file location & file compression using find, locate, which, type, whereis, gzip, gunzip, bzip2,

bunzip2, zip & unzip.

6. File text manipulation using grep, cut, paste, tr, sort, uniq, tee, awk, sed and m4.

7. Knowing disk and file system & viewing process using df, tar, ps, uptime, w, top, xload, free.

8. Knowing users and their environment using logname, whoami, id, who, users, finger, last, printenv.

9. Knowing basic host information using uname, hostname and knowing host location using host, whois,

ping, traceroute.

10. Working with screen outputs, mathematical calculation, date & times using echo, printf, yes, seq, clear,

xcalc, expr, cal, xclock & date.

PART – B

1. Write a shell script that copies multiple files to a directory.

2. Write a shell script which counts the number of lines and words present in a file.

3. Write a shell script that accepts a file name, starting and ending line numbers as arguments and displays all the

lines between the given line numbers.

4. Write a shell script that deletes all lines containing a specified word in one or more files supplied as arguments to

it.

5. Write a shell script that takes a command line argument and reports on whether it is directory, a

file, or something else.

6. Write a shell script that determines the period for which a specified user is working on the system.

7. Write a shell script that reports the logging in of a specified user within one minute after she /he

logs in.

8. Write a shell script to illustrate all the arithmetic operations using case, break & continue

statements.

PART-C

INTRODUCTION TO IT SKILLS

i) Word Processor

ii) Spreadsheets

iii) Presentation Package

Assignments on Word Processor:

It is a Word Document to which you will be making the following specified changes:

1. Read the first paragraph of instructions and then delete it, the " Details of Programming Languages"

heading, and the dotted line separator. When you are done, the first line of your document should be

"History of Programming Languages".

2. Change all the text to Times New Roman 12 pt.

3. Set Page margins of 2 cm (for Top, Bottom, Left and Right)

4. Center the title and author's name. Make the title and all the headings bold.

5. Insert a page break just before the diagram.

6. Double space the first three paragraphs ONLY

7. Add footer with page number to all the pages. Put the page number on the right corner.

8. Insert the clip art picture in the document

9. Use bulleted list

10. Highlight the diagram and put a text box around it. Resize the box for the diagram to display correctly.

11. Insert a page break after the diagram.

12. Insert a chart

13. Align the paragraphs

14. Spell check the document.

15. Use print preview to make sure everything looks right.

16. Create tables.

Lab Assignments on Spreadsheets

1. Creating and Enhancing a Worksheet

i) Navigate a workbook

ii) Enter values and labels

iii) Change column width and row height

iv) Use formulas

v) Edit a worksheet

vi) Change alignment and number format

viii) Change fonts, borders, and shading

viii) Add headers and footers

ix) Preview and print a worksheet

2. Using Complex Formulas, Functions and Tables

i) Create complex formulas

ii) Understand functions

iii) Use AutoSum

iv) Use date and time functions

v) Use statistical functions

vi) Apply conditional formatting

vii) Sort rows in a table

viii) Filter table data

3. Working with Charts

i) Understand and plan a chart

ii) Create a chart

iii) Move and resize a chart and chart objects

iv) Apply chart layouts and styles

v) Customize chart objects

vii Enhance a chart

viii) Create a pie chart

ix) Add text and print charts

Lab Assignments on Presentation package

1. Creating a Presentation

i) View a presentation

ii) Use a theme

iii) Enter text on a slide

iv) Format text

v) Add a text box

vi) Create SmartArt

vii) Add a header and footer

viii) Print handouts

2. Polishing and Running a Presentation

i) Add a shape

ii) Add clip art

iii) Work with pictures

iv) Add video and sound

vi) Customize a slide show

vii) Set slide timing and transitions

UCS340M INTRODUCTION TO LINUX AND IT SKILLS LAB

(1 Hr Tutorial, 3 Hrs Practical) 0 CREDITS

Hours/Week: 04 CIE MARKS: 50

SEE Marks: 50

PART –A

Introduction to Linux Laboratory

Course Objectives and Outcomes

The Introduction to LINUX Laboratory Course is designed to equip the students with knowledge of

understanding of basic UNIX commands, and it is structured as a command reference for better continued

learning effectiveness.

After the completion of the course the student should be able to

Demonstrate a broad and integrated understanding of Unix concepts and terminology

Fully utilize basic UNIX commands to take advantage of the most important features of the file

system.

Create documents, edit documents, enhance text & create tables.

Insert or delete a worksheet, perform simple arithmetic calculations directly in a cell as well as by

referring to another cell, sort data & create simple graphs and charts.

Create effective presentations, add new slides, add text to slides & Navigate among slides.

INTRODUCTION TO LINUX

UNIT-I

Introduction to Linux, a Command, Users and super users, The role of the Shell, Running a shell, Logins,

Logouts, and Shutdowns, The File system, The Shell, Installing Software, tar.gz and tar.bz2 files, Basic File

Operations, Directory Operations, File Viewing, File creation and Editing, File Properties, File Location,

File Text Manipulation, More Powerful Manipulations, File Compression and Packaging, File Comparison,

Disks and file systems, viewing Processes, Users and Their Environment, Working with User Accounts,

Working with Groups, Basic Host Information, Host Location, Screen Output, Math and Calculations, &

Dates and Times.

UNIT-II

SHELL PROGRAMMING

System variables, local variables, executing a shell script, comments, read command, multiple arguments,

positional parameters, branching control structures: if conditional, the test command, the case command,

loop control structures: the while command, the until command, the for command, the continue & break

statements, the sleep command, debugging scripts & more script examples.

References:

1. Linux Pocket Guide, Essential Commands, Daniel J, O’Reilly Media, Feb.

2. Introduction to UNIX & SHELL programming, M.G. Venkatesh Murthy, Pearson Education.

3. Unix concepts and applications, Fourth Edition, Sumitabha Das, TMH.

PART-A

LAB ASSIGNMENTS:

1. Working with basic file and directory operations using the following commands: ls, cp, mv, rm, ln, cd,

pwd, basename, dirname, mkdir, rmdir.

2. File viewing using cat, less, head, tail, nl, od, xxd, gv.

3. File creation and editing using emacs, vim, umask, soffice, abiword, gnumeric

4.Knowing file properties using stat, wc, du, file, touch, chown, chgrp, chmod, chattr, lsattr

5. Knowing file location & file compression using find, locate, which, type, whereis, gzip, gunzip, bzip2,

bunzip2, zip & unzip.

6. File text manipulation using grep, cut, paste, tr, sort, uniq, tee, awk, sed and m4.

7. Knowing disk and file system & viewing process using df, tar, ps, uptime, w, top, xload, free.

8. Knowing users and their environment using logname, whoami, id, who, users, finger, last, printenv and

Working with user accounts using useradd & usedel.

9. Working with groups using groups, groupadd, groupdel, knowing basic host information using uname,

hostname and knowing host location using host, whois, ping, traceroute.

10. Working with screen outputs, mathematical calculation, date & times using echo, printf, yes, seq, clear,

xcalc, expr, cal, xclock & date.

PART – B

9. Write a shell script that copies multiple files to a directory.

10. Write a shell script which counts the number of lines and words present in a file.

11. Write a shell script that accepts a file name, starting and ending line numbers as arguments and displays all the

lines between the given line numbers.

12. Write a shell script that deletes all lines containing a specified word in one or more files supplied as arguments to

it.

13. Write a shell script that takes a command line argument and reports on whether it is directory, a

file, or something else.

14. Write a shell script that determines the period for which a specified user is working on the system.

15. Write a shell script that reports the logging in of a specified user within one minute after she /he

logs in.

16. Write a shell script to illustrate all the arithmetic operations using case, break & continue

statements.

PART-C

INTRODUCTION TO IT SKILLS

iv) Word Processor

v) Spreadsheets

vi) Presentation Package

Assignments on Word Processor:

It is a Word Document to which you will be making the following specified changes:

1. Read the first paragraph of instructions and then delete it, the " Details of Programming Languages"

heading, and the dotted line separator. When you are done, the first line of your document should be

"History of Programming Languages".

2. Change all the text to Times New Roman 12 pt.

3. Set Page margins of 2 cm (for Top, Bottom, Left and Right)

4. Center the title and author's name. Make the title and all the headings bold.

5. Insert a page break just before the diagram.

6. Double space the first three paragraphs ONLY

7. Add footer with page number to all the pages. Put the page number on the right corner.

8. Insert the clip art picture in the document

9. Use bulleted list

10. Highlight the diagram and put a text box around it. Resize the box for the diagram to display correctly.

11. Insert a page break after the diagram.

12. Insert a chart

13. Align the paragraphs

14. Spell check the document.

15. Use print preview to make sure everything looks right.

16. Create tables.

Lab Assignments on Spreadsheets

1. Creating and Enhancing a Worksheet

i) Navigate a workbook

ii) Enter values and labels

iii) Change column width and row height

iv) Use formulas

v) Edit a worksheet

vi) Change alignment and number format

viii) Change fonts, borders, and shading

viii) Add headers and footers

ix) Preview and print a worksheet

2. Using Complex Formulas, Functions and Tables

i) Create complex formulas

ii) Understand functions

iii) Use AutoSum

iv) Use date and time functions

v) Use statistical functions

vi) Apply conditional formatting

vii) Sort rows in a table

viii) Filter table data

3. Working with Charts

i) Understand and plan a chart

ii) Create a chart

iii) Move and resize a chart and chart objects

iv) Apply chart layouts and styles

v) Customize chart objects

vii Enhance a chart

viii) Create a pie chart

ix) Add text and print charts

Lab Assignments on Presentation package

2. Creating a Presentation

i) View a presentation

ii) Use a theme

iii) Enter text on a slide

iv) Format text

v) Add a text box

vi) Create SmartArt

vii) Add a header and footer

viii) Print handouts

2. Polishing and Running a Presentation

i) Add a shape

ii) Add clip art

iii) Work with pictures

iv) Add video and sound

vi) Customize a slide show

vii) Set slide timing and transitions

Note: Diploma lateral entry students have to additionally register for EVS.

Scheme of Syllabus for Fourth Semester B.E. Computer Science & Engg

(2011-12 Admission Batch)

Sl.No Subject Code Subjects Hrs/Week

C CIE *SEE Total L T P

1 UMA401C Engineering Mathematics-IV 4 0 0 4 50 50 100

2 UCS412C DataBase Management Systems 4 0 0 4 50 50 100

3 UCS413C Microprocessors and Interfacing 4 0 0 4 50 50 100

4 UCS424C Operating Systems 4 0 0 4 50 50 100

5 UCS415C Finite Automata and Formal Language

3 0 0 3 50 50 100

6 UCS416C Object Oriented Programming with C++

4 0 0 4 50 50 100

7 UCS427L Database Application and Visualization Lab

0 1 3 2 50 50 100

8 UCS428L Object Oriented Programming Lab

0 0 2 1 50 50 100

9 UCS429L Microprocessor and Interfacing Lab

0 0 2 1 50 50 100

10 UMA400M* Advanced Mathematics-II 4 0 0 - 50 50 100

22** 1 7 27 450 450 900 L: Lecturer Hours per Week T: Tutorial hours per week P: Practical Hours per Week C: Credit points *CIE: Continuous Internal Evaluation *SEE: Semester End Examination

* Advanced Mathematics-II is mandatory subject only for students having Diploma and admitted to 4th

Semester through lateral entry scheme. Passing the subject is compulsory; however marks will not be

considered for awarding grade/class. A PP/NP grade will be awarded for passing /not passing the subject.

** The total lecture hours for students having Diploma and admitted to 4th

Semester through lateral scheme is

26 hours.

Note: Diploma lateral entry students have to additionally register for CIP.

ENGINEERING MATHEMATICS –IV

Subject Code: UMA401C Credits (4-0-0)

Unit-I

Complex Analysis: 14 Hours

Analytic functions, Cauchy-Riemann equations in Cartesian and polar forms-consequences,

construction of analytic function (Cartesian and polar forms). Definition of Conformal

transformations: zez ,2 , 02

zwherez

az , Bilinear transformations.

Complex Integration: Line integral, Cauchy’s theorem-Corollaries, Cauchy’s integral formula.

Taylor and Laurent’s series (statements only), Singularities, poles, calculations of residues,

Residue theorem (without proof)-problems.

Unit-II

Special Functions: 14 Hours

Series solution of Bessel’s differential equation, recurrence formulae, generating function,

orthogonal property, Bessel’s integral formula.

Series solution of Legendre’s differential equation recurrence formulae, generating function,

orthogonal property, Rodrigue’s formula.

Unit-III

Statistics and Probability: 12 Hours

Curve fitting by the method of least squares:2,, cxbxayabybxay x .correlation and

regression. Probability –addition rule, conditional probability, multiplication rule, Baye’s rule.

Discrete and continuous random variables-PDF-CDF, Binomial, Poisson and Normal distributions

Unit-IV

Sampling Distribution: 12 Hours

Sampling, Sampling distribution, standard error, Null and alternative hypotheses, Type I error and

Type II errors, testing of hypothesis for means, level of significance for means, Confidence limits

for means, large and small samples, Student’s t-distribution. Central limit theorem (without proof)

Joint Probability Distribution and Markov Chains:

Concept of joint probability , Joint distributions -discrete random variables, Continuous random

variables, independent random variables, Markov chains, higher transition probabilities, stationary

distributions of regular markov chains and absorbing states.

Resources:

1. Higher Engineering Mathematics by B.S.Grewal, Khanna Publishers, New

Delhi.

2. Theory band Problems of Probability by Seymour Lipschutz, Schaum’s series.

3. Advanced Engineering Mathematics by H. K. Dass, S. Chand & Co.

4. Advanced Engineering Mathematics by E Kreyszig,John Wiley & Sons.

5. Probability and stochastic Processes by Roy D Yates and David J Goodman, wiley India

pvt.ltd second edition 2012.

6. A first course in Complex analysis with applications by Dennis G zill Patrick D. Shanahan,

second edition 2010.

Question Paper Pattern for SEE:

1) Total of eight questions to be set uniformly covering the entire syllabus.

2) Each question should not have more than 4 sub divisions.

3) Any five full questions are to be answered choosing at least one from each unit.

UCS412C DATABASE MANAGEMENT SYSTEMS 4 CREDITS Hours/Week: 04 CIE MARKS: 50 Total Hours: 48 SEE Marks: 50

Course Objectives and Outcomes

The Database Management Systems course is designed for equipping the students with thorough

knowledge of Database concepts and SQL and PL/SQL Queries.

After the completion of the course student should be able to,

Explain database system and its operation and use.

Build ER-data models and Develop relational schema.

Create, populate and manage tables.

Build normalized database using SQL.

About PL/SQL

About Relational Algebra

Ability to handle recovery and concurrency issues.

UNIT-I

Introduction and Entity-Relationship Model 12 Hrs Introduction; An example; Characteristics of Database approach; People who work with databases; Advantages of using DBMS approach; when not to use a DBMS. Data models, schemas and instances; Three-schema architecture and data independence; Database languages and interfaces; The database system environment; Classification of Database Management systems. Using High-Level Conceptual Data Models for Database Design; An Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER Design for COMPANY database; ER Diagrams, Naming Conventions and Design Issues; Relationship types of degree higher than two.

UNIT-II

Relational Model and Relational Algebra 12 Hrs Relational Model Concepts; Relational Model Constraints and Relational Database Schemas; Update Operations, Transactions and dealing with constraint violations; Unary Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary Relational Operations : JOIN and DIVISION; Additional Relational Operations; Examples of Queries in Relational Algebra; Relational Database Design using ER- to-Relational Mapping. SQL-The Relational Database Standard: SQL Data Definition and Data. Types, Specifying Basic Constraints in SQL, Schema Change Statements in SQL; Basic Queries in SQL; More Complex SQL Queries; Additional Features of SQL; Views (Virtual Tables) in SQL, Cursors, Triggers and PL/SQL Programming

UNIT-III

12 Hrs

Database Design: Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal Forms Based on Primary Keys; General Definitions of Second and Third Normal Forms; Boyce-Codd Normal Form; Properties of Relational Decompositions; Algorithms for Relational Database Schema Design; Multivalued Dependencies and Fourth Normal Form; Join Dependencies and Fifth Normal Form;

UNIT-IV

Transaction Management and Recovery Techniques 12 Hrs Introduction to transaction processing; Transaction and System concepts; The ACID Properties; Characterizing Schedules Based on Recoverability; Two-Phase Locking Technique for concurrency Control(2PL); Recovery Concepts; Recovery and backup Techniques Based on Deferred Update and Immediate Update Text Books:

1. Elmasri and Navathe,2007, ’Fundamentals of Database Systems’, 5th Edition, Addison-Wesley, 2007

Reference Books:

1. Silberschatz, Korth and Sudharshan: 2006,’ Data base System Concepts’, 5th Edition, Mc-GrawHill, 2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA

McGrawHill, 3rd Edition.

UCS 413C : MICROPROCESSORS AND INTERFACING 4-CREDITS

Hours/Week : 04 CIE. Marks: 50

Total Hours : 48 SEE. Marks: 100

Course Learning Objectives:

The Microprocessor and interfacing course is designed for equipping students with thorough knowledge

about the fundamentals of microprocessor system, hardware and software problems related to

peripherals devices including input/output operations.

After the completion of the course, the students will be able to,

Explain the architecture of the computer system.

Demonstrate the instruction set of 8086 microprocessor.

Develop assembly language codes for microprocessor-based systems using templates.

Design circuits for microprocessors to interface controlling devices and data acquisition systems.

Design and implement a memory map and address decoder for memory and I/O interface.

Explain the use of DOS and BIOS function calls to control the keyboard, display, and various other

components in the computer system.

Compare the salient features of the 80286, 80386, Pentium processors with the 8086/8088

microprocessors.

Write Assembly Language Programs to interface microprocessors with Timers, UART, Logic

Controllers, Interrupt and DMA controllers etc.,

Combine assembly code with C-Programs to interface microprocessors with peripherals on

windows platform.

UNIT – 1 12 Hours

Introduction: A Historical Background, The Microprocessor-Based Personal Computer Systems. The

Microprocessor and its Architecture: Internal Microprocessor Architecture, Real Mode Memory

Addressing.

Addressing Modes: Introduction to Protected Mode Memory Addressing, Memory Paging, Flat Mode

Memory Addressing Modes: Data Addressing Modes, Program Memory Addressing Modes, Stack Memory

Addressing Modes.

UNIT – 2 12 Hours

Instruction Set: Data Movement Instructions: MOV Revisited, PUSH/POP, Load-Effective Address, String

Data Transfers, Miscellaneous Data Transfer Instructions, Segment Override Prefix, Assembler Details.

Arithmetic and Logic Instructions: Addition, Subtraction and Comparison, Multiplication and Division. BCD

and ASCII Arithmetic, Basic Logic Instructions, Shift and Rotate, String Comparisons. Program Control

Instructions: The Jump Group, Controlling the Flow of the Program, Procedures, Introduction to Interrupts,

Machine Control and Miscellaneous Instructions.

UNIT – 3 12 Hours

Embed Assembly Language with C: Using Assembly Language with C for 16-Bit DOS Applications and 32-

Bit Applications Modular Programming, Using the Keyboard and Video Display, Data Conversions, Example

Programs.

Hardware Specifications: Pin-Outs and the Pin Functions, Clock Generator, Bus Buffering and Latching, Bus

Timings, Ready and Wait State, Minimum and Maximum Modes. Salient features of 80286, 80386 and

80586 advanced microprocessors.

UNIT – 4 12 Hours

Memory Interfacing: Memory Devices, Address Decoding, 8088 Memory Interface, 8086 Memory

Interface. Basic I/O Interface: Introduction to I/O Interface, I/O Port Address Decoding.

The Programmable Peripheral Interface 8255, 16550 Programmable communications interface, Interrupts:

Basic Interrupt Processing, Hardware Interrupts, 8259 Programmable Interrupt controller, Interrupt

examples, Direct Memory Access: Basic DMA Operation and Definition, 8237 DMA controller.

Text Book:

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

(Listed topics only from the Chapters 1 to 13)

2. A.K.Ray & K.M.Bhurchandi: Advanced Microprocessors and Peripherals, 2nd Edition, TMH 2006.(

Chapters 9.1,10.1 and 11.1)

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.

UCS424C OPERATING SYSTEM 4 CREDITS Hours/Week: 04 CIE MARKS: 50 Total Hours: 48 SEE Marks: 50

Course learning Objectives and outcomes After the completion of this Course Students should be able to, 1. Define an operating system, its functions. 2. Describe various operating system concepts with respect to memory, process, file system and I/O device management. 3. Implementing basic operating system concepts in Windows and Linux environment. 4. Analyze various algorithms related to process scheduling, memory management, process synchronization. 5. Explain the basic mechanisms for protection and system security. About file system

(Each unit of 12 hours)

UNIT I Introduction : Abstract Views of an Operating System , Goals of an OS , Operation of an OS, OS and the

Computer System, Efficiency, System Performance and User Convenience, Classes of Operating Systems,

Batch Processing Systems, Multiprogramming Systems, Time Sharing Systems, Real Time Operating

Systems, Distributed Operating Systems , Network Operating Systems

Processes and Threads: Processes and Programs, Programmer View of Processes , OS View of Processes.

Threads, Case Studies of Processes and Threads.

UNIT II

Scheduling : Preliminaries, Non-preemptive Scheduling Policies, Preemptive Scheduling Policies

Scheduling in Practice , Real Time Scheduling, Scheduling in Linux, Scheduling in Windows, Performance

Analysis of Scheduling Policies.

Memory Management : Managing the Memory Hierarchy, Static and Dynamic Memory Allocation,

Memory Allocation to a Process, Reuse of Memory, Contiguous Memory Allocation, Noncontiguous

Memory Allocation, Paging, Segmentation, Segmentation with Paging, Kernel Memory Allocation, A

Review of Relocation, Linking and Program Forms.

UNIT III

Virtual Memory : Virtual Memory Basics, Demand Paging , Page Replacement Policies, Memory Allocation

to a Process, Shared Pages, Memory Mapped Files , Unix Virtual Memory , Linux Virtual Memory, Virtual

Memory in Windows, Virtual Memory Using Segmentation

File Systems: File System and Input Output control system(IOCS), Files and File Operations, Fundamental

File Organizations Directory Structures, File Protection, Interface between File System and IOCS, Allocation

of Disk Space, Implementing File Access, File Sharing Semantics, File System Reliability, Virtual File System

, Windows File System, Performance of File Systems

UNIT IV

Security and Protection : Overview of Security and Protection, Goals of Security and Protection, Security

Attacks, Formal and Practical Aspects of Security, Encryption, Authentication and Password Security,

Access Descriptors and the Access Control Matrix, Protection Structures , Linux Security

Process Synchronization

Data Access Synchronization and Control Synchronization, Critical Sections Race Conditions in Control

Synchronization ,Implementing Critical Sections and Indivisible Operations, Classic Process

Synchronization Problems , Structure of Concurrent Systems, Algorithmic Approach Implementing Critical

Sections, Semaphores , Conditional Critical Regions, Monitors, Process Synchronization in Windows .

Deadlock Definition of deadlock, deadlocks in Resource Allocation Handling Deadlocks, Deadlock

Detection and Resolution, Deadlock Prevention, Deadlock Avoidance, Formal Characterization of Resource

Deadlocks, Deadlock Handling in Practice.

Text Book

1. D. M. Dhamdhere, Operating Systems--A Concept Based Apparoach, Second edition, Tata McGraw-Hill,

2006.

References:

1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Principles, 7th edition, Wiley-India, 2006. 2. Harvey M Deital: Operating systems, 3rd Edition, Addison Wesley

UCS415C FINITE AUTOMATA AND FORMAL LANGUAGES 3 CREDITS Hrs/Week: 03 CIE Marks: 50 Total Hrs.: 40 SEE Marks: 50

Course outcomes: After completion of this course student should be acquainted with theoretical aspects of Formal Languages and Finite Automata machines.

Explain the fundamentals of Formal Languages, development with reference to alphabets, strings, language and grammar.

Able to construct valid expressions to develop valid strings in a language.

Able to construct Finite machines to test whether strings in a given language are valid or not.

Able to develop standard forms of grammar to remove unused productions and symbols in a given language.

Able to explain the working principles of digital computer and compiler using turing machine.

UNIT – I 10 Hours

Introduction To Theory of Computation: Three basic concepts; Some applications. Finite Automata: Deterministic Finite Accepters; Nondeterministic Finite Accepters; Equivalence of deterministic and Nondeterministic Finite Accepters; Reduction of the number of states in Finite Automata.

UNIT – II 10 Hours

Regular Languages and Regular Grammars: Regular expressions; Connection between Regular Expression and Regular Languages; Regular Grammars. Properties of Regular Languages: Closure Properties of Regular Languages; Elementary Questions about Regular Languages; Identifying Nonregular Languages.

UNIT – III 10 Hours

Context-Free Languages: Context-Free Grammars; Parsing and Ambiguity; Context-Free Grammars and Programming Languages. Simplification of Context-Free Grammars and Normal Forms: Methods of Transforming Grammars; Two Important Normal Forms.

UNIT – IV 10 Hours

Pushdown Automata: Nondeterministic Pushdown Automata; Pushdown Automata and Context-Free Languages; Deterministic Pushdown Automata and Deterministic Context-Free Languages. Properties of Context-Free Languages: Two Pumping Lemmas; Closure Properties and Decision Algorithms for Context Free Languages. Turing Machines: The Standard Turing Machine. TEXT BOOK:

1. An Introduction to Formal Languages and Automata, Peter Linz, Norosa Publication, 4th Edition, 5th printing, 2007.

REFERENCE BOOK:

1. Introduction to Languages and Automata Theory, John C Martin, 3rd Edition, Tata McGraw-Hill, 2007.

2. Introduction to Automata Therory, Langages and Computation, John E Hopcroft, Rajeev Motwani, Jeffery D. Ullman, 3rd C Edition, Person Education, 2007

UCS416C OBJECT ORIENTED PROGRAMMING WITH C++ 4-CREDITS Hrs/Week: 04 CIE Marks: 50 Total Hrs: 48 SEE Marks: 50

Course Objectives and Outcomes

The Object Oriented Programming with C++ course is designed for equipping the students with thorough

knowledge of Object Oriented Concepts using C++.

After the completion of the course student should be able to,

Explain the basic concepts of object orientation,

Explain the fundamentals of Object Oriented Programming system.

Breakdown real world problems into object-oriented components.

Implement object-oriented techniques using C++.

Adapt object-oriented techniques in software development.

UNIT-I 12 Hours

Fundamentals of OOP: Basic concepts, characteristics, languages and systems. Introduction to C++: History, data types, statements, expressions, operators of C++, Comparison of C++ with 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, Namespaces, Nested Classes Introduction to Classes and Objects, Member Functions and Member Data, Objects and Functions, Objects and Arrays.

UNIT-II 12 Hours

Dynamic Memory Management: Introduction, Dynamic Memory Allocation, Dynamic Memory Deallocation. Constructors Destructors: Constructors, Destructors. Inheritance: Introduction to Inheritance, Base Class and Derived Class Pointers, Function Overriding, Base Class Initialization, the Protected Access Specifier, Deriving by Different Access Specifiers, Different Kinds of Inheritance.

UNIT-III

12 Hours Virtual functions and Polymorphism: Virtual function, calling a Virtual function through a base class reference, Virtual attribute is inherited, Virtual functions are hierarchical, Pure virtual functions, Abstract classes, Using virtual functions, Early and late binding.

Operator Overloading: Operator Overloading, Overloading the Various Operators- overloading the Increment and the Decrement Operators (Prefix and Postfix), Overloading the Unary Minus and the Unary plus Operator, Overloading the Arithmetic Operators, Overloading the Relational Operators, Overloading the Assignment Operator, Overloading the Insertion and Extraction Operators, Overloading the new and the delete Operators, Overloading the Subscript Operator, Overloading the Pointer-to-member (-» Operator Smart Pointer).

Type Conversion: New Style Casts, and RTTI.

UNIT-IV 12 Hours

Stream Handling: Streams, The Class Hierarchy of Handling Streams, Text and Binary Input/0utput, Text versus Binary Files, Text Input/Output, Binary Input/Output, Opening and Closing Files, Files as Objects of the fstream Class, File Pointer, Random Access to Files, Object Input/Output through Member Functions, Error Handling, Manipulators Templates: Generic functions, applying generic functions, generic classes, the power of template STL: An overview, containers, vectors, lists, maps

Exception Handling: Exception handling Fundamental, Handling Derived class Exception Exception handling options, understanding terminate () and unexpected (), the uncaught_exception() function, applying exception handling. .

Text Books 1. Sourav Sahay, Oxford University Press, 2006. Object-Oriented Programming with C++, (Chapters 1, 2, 3, 4, 5, 7, 8) 2. Herbert Schildt, 4th Edition, TMH, 2005, The Complete Reference C++ (chapter 17, 18, 19, 24)

Reference Books 1. Stanley B. Lippman, Josee Lajoie, Barlara E. Moo, 4th Edition, Addison Wesley, 2005, C++ Primer.

2.Barabara Johnson, Eastern Economy Edition, Object-Oriented Programming Today.

3.B. Chandra, Latest Edition, Narosa Publications, Object-Oriented Programming using C++.

4. Robert Lafore, Galgotia Publications Pvt.ltd ,5,Ansan Road, Daryaganj New Delhi, Object-Oriented Programming in Turbo C++.

UCS427L DATABASE APPLICATION AND VISUALIZATION LAB 2-CREDITS Hours/Week: 03 CIE MARKS: 50

SEE Marks: 50

Course Objectives and Outcomes

The Database Application Laboratory Course is designed to equip the students with knowledge of the

Designing the Database, implement queries using SQL and PL/SQL and Develop mini project on real

database application using ORACLE and VB.

After the completion of the course the student should be able to,

Explain the creation and maintenance of tables using SQL

Handling all types of Queries

Writing all kinds of programming scripts in PL/SQL,

Create stored procedures, functions and packages

Create cursors & triggers.

Design and develop real database application.

PART - A

Design the Database for any one of the following Applications and implement the SQL and PL/SQL Queries on designed database.

1) Banking System, 2) Employee Organization 3) Inventory Processing System 4) Library Management

1) Creation, altering and dropping of tables and inserting rows into a table (use constraints while creating tables) using CREATE, ALTER, DROP, INSERT statements. 2) Implementing the queries for Insertion, Updation, Deletion operations. Use ROLL BACK, COMMIT & SAVE POINTS Concepts with INSERT, UPDATE, DELETE statements. 3) Queries (along with sub Queries) using ANY, ALL, IN, EXISTS, NOTEXISTS, UNION, INTERSECT, Constraints. 4) Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING and Creation and dropping of Views.

5) Creation of simple PL/SQL program which includes declaration section, executable section and exception –Handling section (Ex. Student marks can be selected from the table and printed for those who secured first class and an exception can be raised if no records were found) 6) Programs development using creation of procedures, passing parameters IN and OUT of PROCEDURES. 7) Program development using creation of stored functions, invoke functions in SQL Statements 8) Program development using creation of package specification, package bodies, private objects, package variables and calling stored packages. 9) Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR, WHERE CURRENT of clause and CURSOR variables. 10) Develop Programs using BEFORE and AFTER Triggers,

PART – B Develop Mini Project on any application.

UCS428L OBJECT ORIENTED PROGRAMMING LABORATORY 1-CREDIT

Hours/Week: 02 CIE MARKS: 50 SEE Marks: 50

Course Objectives and Outcomes

The Object Oriented Programming Laboratory Course is designed to equip the students with knowledge of

the Object Oriented concepts using C++ language constructs.

After the completion of the course the student should be able to, 1) Create classes and programs in C++ that are robust and can be reused.

2) Make use of various object-oriented features, including inheritance, polymorphism, generic function

and class.

3) Gain in-depth, hands-on experience to design and develop software using the C++ programming

concepts.

4) Work in a team to analyze engineering problems and develop C++ programs for

real world problems.

Indicative List of Programs: 1. Define EMPLOYEE class with Employee_Number, Employee_Name, Basic_Salary, All_Allowances, IT, Net_Salary as data members. Use member function to read, to calculate net salary and to print employee details. 2. Define a STUDENT class with USN, Name, and Marks in 3 tests of a subject. Declare an array of 4 STUDENT objects. Using appropriate functions, find the average of two better marks for each student. Print the USN, Name and the average marks of all the students. 3. Write a C++ program to create a class called STRING and implement the following operations. i.)STRING s1 (“VTU”) (use parameterized constructor) ii) STIRNG s2 = s1; (Use copy constructor) 4. Write a C++ program to create a class called TIME and implements the following operations by overloading ADD ( ).

i. ADD (T1, T2) - where T1 and T2 are two time objects. ii. ADD (T1, N) - where N is an integer number to be added to seconds of T1 object

5 Define a class LIST to implement singly linked list and perform the following operations on linked list. i. Insert a new node to the left of the node whose key value is read as an input. ii. Delete the node of a given data if it is found, otherwise display appropriate message. iii. Display the contents of the list.

6. Write a C++ program to create the following classes. PERSON : Data members – Name, Address, Age Member functions – Insert(), Output() STUDENT : Derived from PERSON Data members : CGPA Member functions – Insert(), Output() PROFESSOR : Derived from PERSON Data members : No. of Publications Member functions – Insert(), Output() Display the details of the students having CGPA > 8.5 and also the details of the professors having no. of publications > 25. 7. Write a C++ program to create the following classes. BOOK: Data members-Title, author, publisher, price Member function read (), display () CD: Data members-Title, type, price Member function: read(),display() SHOP: derived from BOOK and CD Data members: shop_name, sales_ type, sale_date, qty Member function: read (), display () Display the details of books and cds sold on date 12/09/2010 by AKASH shop and also find the total number audio cds sold by shop. 8. Write a C++ program to create a class called STACK using an array of integers. Implement the stack operations by overloading the increment and decrement operators. display the contents of the stack after each operation, by overloading the operator «.Use Exception for stack full and empty conditions. 9. Write program in C++ to create a class called DATE with methods to accept two valid dates in the form dd/mm/yy and to implement the following operations by overloading the operators + and -. After every operation the results are to be displayed by overloading the operator <<. i) if (d1> =d2) overload >= operator then no_of_days = d1 – d2; where d1 and d2 are DATE objects, else no_of_days = d2 – d1; where d1 and d2 are DATE objects, ii. d2 = d1 + no_of_days; where d1 is a DATE object and no_of_days is an integer. 10. Write a C++ program to create a class MATRIX. Read two matrices by overloading >> operator. Perform addition of two matrices by overloading operators + and display the results by overloading << operator. 11. Write a C++ program to create a template function for merge sort and demonstrate sorting of integers and doubles. 12. Write a C++ program to create a template class called CIR_QUEUE with member functions to add an element and to delete an element from the circular queue. Using these member functions, implement a circular queue of integer and double. Demonstrate the operations by displaying the content of the circular queue after every operation. Use exception for queue full and empty condition

13. Write a C++ program to create BOOK.DAT file with the following information. title, author, publisher, price Perform the following operations. i) Download the information from the file into an array of BOOK objects. ii) Find total number of books published by each publication. Store the results in PUBLISH.DAT file.

iv) Display the details of all the books written by same author. v) Append new record to the file 14. Write a C++ program to create STUDENT.DAT file with the following information. name, department, entry number, fees, course. Perform the following operations. i) Download the information from the file into an array of STUDENT objects. ii) Find total number of students registered for each course (course is UG / PG) and Store the results (course and total no. of students) in a COURSE.DAT file.

iii) Display the contents of the output file.

iv) Display the total number of students opted for CSE branch. 15. Write a program that accepts a shopping list of five items from the keyboard and stores them in vectors. Extend the program to accomplish the following:

a) To delete a specified item in the list b) To add an item at a specified location c) To add an item at the end d) To print the contents of the vectors

Note:

In the examination questions must be given lots.

Each student must be given one full question.

UCS429L MICROPROCESSOR AND INTERFACING LAB 1 CREDIT

Hours/Week: 02 CIE MARKS: 50

SEE Marks: 50

Course Learning Objectives

The Microprocessor and interfacing laboratory course is designed to equip the students through the 8086

assembly language to solve problems on Windows XP platforms and to interface peripheral device.

After the completion of the Laboratory, the students will be able to,

Write and execute 8086 assembly language programs for solving any task.

Inspect and modify 8086 processor registers and memory.

Devise different programming techniques, which are used with assembly programming languages.

Design and Implement the Assembly Language Program for interfacing several I/O modules like

keyboard, logic controller, stepper motor controller, D/A converter and elevator interface to the

8086 microprocessor.

Use the MASM32 assembler to develop and run assembly language programs on Windows XP

platform.

Note for problem solving:

Develop and execute the following programs using an Assembly Language. All the programs must be

executed using MASM32 on Windows XP.

Program should be fully described through comments only.

The board layout and the circuit diagram of the interface are to be provided to the student during

the examination.

Part A:

1 Write an ALP to search a key element in a list of N numbers using the Binary

Search algorithm. Display its position if found. 2. Write ALP macros:

- To read a character from the keyboard in the module1. (in a different file). - To display a character in module2 (from different file).

- Use the above two modules to read a string of characters from the keyboard terminated by the carriage return and check whether the string is palindrome or not.

3. Write an ALP to sort a given set of N numbers in ascending and descending orders using the Bubble Sort algorithm. Define procedures in another file. Display sorted numbers on screen.

4 Write an ALP to read an alphanumeric character and display its equivalent ASCII Code on the screen. Give moving effect from top to bottom.

5 Write an ALP to accept string from keyboard terminated by $. Count number of words in it. 6 Write an ALP to read your name from the keyboard and display it on the screen in front of the

message what is your name? You must clear the entire screen before display. Let it move from bottom to top.

7. Write an ALP to compute nCr using recursive procedure. Assume that 'n' and 'r' are non- negative integers. Define procedure in another code segment in the same file.

8 Write an ALP to find out whether a given sub-string is present or not in a main string of characters.

9 Write an ALP to perform summation of 2 digit numbers entered from keyboard until the sum exceeds 0ffH. Then display sum.

10 Write an ALP to simulate a Decimal Up-counter to display 00-99 with delay of 30 seconds. 11 Write an ALP to read the current time from the system and display it in the standard format. 12 Write an ALP to implement file copy command.

Part B: 1 Write C-Program to Read two 4-bit numbers from Logic Controller Interface (LCI) and add them.

If result is greater than 15 then display the sum otherwise display the result as 0. 2. Perform the following functions using the Logic Controller Interface

i. BCD up Counter ii BCD down counter iii. 8-bit even counter. Counter must accept 2 –bits choice from Logic Controller Interface.

3. Read the status of two 4-bits inputs (X & Y) from the Logic Controller Interface and display the results of X*Y and X/Y.

4 Display 4 characters message on a 7- Segment display interface. Accept the message from keyboard and translate ASCII code to 7-segment code using XLAT instruction.

5. Assume any suitable message of 12 characters length and display it in the rolling fashion 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.

6 Write a C-program to Drive a Stepper Motor Interface to rotate the motor in clockwise by 180 degrees.

7 Drive a Stepper Motor interface to rotate the motor by N rotations in anticlockwise direction. Introduce suitable delay between successive steps.

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

9 Scan an 8x3 keypad for key closure and simulate ADD and SUBTRACT operations as in a calculator.

10 Generate a Sine wave form using the DAC interface (The output of the DAC is to be displayed on a CRO).

11 Generate sawtooth wave using the DAC interface and display the waveform on the CRO. 12 Drive an Elevator Interface in the following way to move an elevator from ground to top floor

and top to ground floor and for any intermediate requests it must stand for 1 min.

ADVANCED MATHEMATICS-II

Subject Code: UMA400M Mandatory Subject

1. Solid Geometry: 11Hours

Distance formula (without proof), Division formula, direction cosines and direction ratios,

planes and straight lines, angle between the planes.

2. Vector Differentiation: 10 Hours

Velocity, Acceleration of a particle moving on a space curves. Vector point function.

Directional derivative, Gradient, Curl and Divergence. Solenoidal and Irrotational vectors-

simple problems.

3. Laplace Transforms: 19 Hours

Definition- Transform of elementary functions. Derivatives and integrals of transforms-

problems. Periodic functions. Inverse transforms- Properties Solutions of linear

differential equations. Applications to Engineering problems.

Resources:

1. Elementary Mathematics by B. S. Grewal.

2. Engineering Mathematics by B. S. Grewal.

3. Higher Engineering Mathematics by B. S. Grewal. Khanna Publishers.

Question paper pattern for SEE:

1. Total of eight questions to be set , covering the entire syllabus.

2. Each question should not have more than 4 sub divisions.

3. Any five full questions are to be answered.