becbgk.edu ver-2… · Web viewB. V. V. Sangha’s. Basaveshwar Engineering College (Autonomous),...

B. V. V. Sangha’sBasaveshwar Engineering College (Autonomous), Bagalkot

Department of Computer Science and Engineering

Scheme of teaching for 3rd Semester (2015-2016 to 2017-2018 Admitted Batches)

Sl.No.

Subject Code Subjects Hrs/Week C CIE SEE Total

1 UMA301C Engineering Mathematics- III 4 0 0 4 50 50 1002 UCS322C Data Structures using C 4 0 0 4 50 50 1003 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 andManagement 3 0 0 3 50 50 100

7 UCS317L Digital Systems Lab 0 0 3 1.5 50 50 1008 UCS318L Data Structures Lab 0 1 2 1.5 50 50 100

UMA300M Advanced Mathematics-I 4 0Total 22 3 7 25 450 450 900

L : Lecturer Hours per Week T : Tutorial hours per weekP : Practical Hours per Week C : Credit pointsCIE : Continuous Internal EvaluationSEE : Semester End Examination

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

UMA301C:

ENGINEERING MATHEMATICS-III4 Credits (4-0-0)

Course Objectives:

To enable the students to apply the knowledge of Mathematics in various engineering fields by making them

1. to understand the method of solving algebraic, transcendental equations .2. to determine the approximate value of the derivative & definite integral for a given

data using numerical techniques.3. able to expand the given periodic function defined in the given range in terms of sine

and cosine multiple of terms as a Fourier series.4. able to extremise the functional using integration technique.5. able to form and solve the partial differential equation using different analytical

techniques.6. to solve different forms of heat and wave equations.

Course outcomes:

On completion of this course, students are able 1. to know how root finding techniques can be used to solve practical engineering

problems.2. to apply the concept of numerical analysis to find the relative strengths and

weaknesses of each computation method and know which are most applicable for given problem.

3. to apply the analytical technique to express periodic function as a Fourier sine and cosine series.

4. to apply partial differential techniques to solve the physical engineering problems.5. to implement integration technique to determine the extreme values of a functional.

UNIT-I

Numerical Analysis: 13 Hours

Bisection Method, Newton-Raphson method.Finite differences, forward and backward difference operators (no derivations on relations 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-problems.Numerical solutions offirst order ODE:

UNIT-II

Numerical integration: 13 HoursTrapezoidal rule, Simpson's one third rule, Simpson's three eighth rule and Weddle's rule (no derivation ofany formulae)-problems.

Fourier Series:Periodic functions, Conditions for Fourier series expansions, Fourier series expansion of

continuous and functions having finite number ofdiscontinuities, even and odd functions. Half-range series, practical harmonic analysis.

UNIT-IIIFourier transforms: 13 Hours Infinite Fourier transforms and inverse Fourier transforms- simple properties, complex Fourier transform, Fourier sine and Fourier cosine transforms, Inverse Fourier sine and cosine transformsCalculus of Variations

UNIT-IVPartial Differential Equations: 13 Hours Formation ofpartial differential equations by elimination of arbitrary constants and arbitrary functions, Solution ofequation ofthe type: Pp + Qq = R, Charpit's method. Solution ofPDEs by the method of separation ofvariables.Derivation of one-dimensional heat and wave equations. Numerical solutions ofone-dimensional heat and wave equations by explicit method, Laplace equation by using standard five point formula. Resources:

2. Numerical Methods for Engineers by Steven C Chapra &Raymond P Canale.3. Higher Engineering Mathematics by Dr. B.S. Grewal, Khanna Publishers, New Delhi.4. Advanced Engineering Mathematics By H. K. Das, S. Chand & company Ltd. Ram

Nagar, New Delhi.5. Advanced Engineering Mathematics by E Kreyszig ( John Wiley & Sons)

Question paper pattern for SEE1. Total of eight questions with two from each unit to be set uniformly covering the

entire syllabus. 2. Each question should not have more than four subdivisions. 3. Any five full questions are to be answered choosing at least one from each unit.

UCS322C DATA STRUCTURES USING C 4 CREDITSHrs/Week: 04 CIE Marks: 50Total Hrs: 48 SEE Marks: 50

Course Outcomes : At the end of the course ,the student should be capable to

1) Demonstrate understanding of storage classes, dynamic memory allocation, structures, pointers, strings, files,bitwise operators and abstract data types

2) Design and develop programs using pointers, structures, unions ,bitwise operators3) Demonstrate understanding of abstract data types and create recursive solutions

based on the need4) Analyze and implement linear & non linear data structures like stacks, queue, linked

lists, graph and demonstrate their applications5) Identify and combine relevant data structures to develop solutions for a given

problem

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, ComputerScience A Structured Programming Approach Using C, (Chapter 4:4.1 to 4.5, Chapter7: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:

1. Basavraj S Anami, Shanmukhappa Angadi, Sunil Kumar S Manvi, PHI Publications, 2010. Holistic approach to learning C.

2. Andrew Tenanbaum, Thomson, 2005, Data Structures with C. Pearson ,Robert Kruse & Bruce Leung, Data Structures & Program Design in C

UCS313C DIGITAL SYSTEMS 4-CREDITSHrs/Week :04 CIE Marks:50Total Hrs:48 SEE Marks:50

Course OutcomesAt the end of the course the student should be able to ,

CO 1. Demonstrate the understanding of Boolean algebra.CO 2. Explain the working of combinational/sequential circuits, op-amp, ADC and

DAC.CO 3. Apply the Boolean theorems, K-Map and Q-M Method to design minimal

circuits.CO 4. Design arithmetic circuits, code converters etc using MSI digital ICs.CO 5. Simulate simple logical and combinational circuits using Verilog

programming.

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

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

THEORETICAL FOUNDATIONS OF COMPUTER SCIENCEUCS324C

Hours/Week: 033-CREDITSCIE MARKS: 50

Total Hours: 40 SEE Marks: 50

Course Outcomes:

At the end of the course, the student will be able to:1. Identify and apply basic concepts of set theory, arithmetic logic, proof techniques, relations,

functions, graphs and trees.2. Produce convincing arguments, conceive and/or analyse basic mathematical proofs.3. Demonstrate an understanding of discrete structures and be able to determine their

properties. 4. Apply the knowledge and skills obtained to investigate and solve a variety of discrete

mathematical problems.5. 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 andOne-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 ElementaryProperties, 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, Disconnectedgraphs 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 andcenters 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, FundamentalCircuits 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-CREDITSHrs/Week: 04 CIE Marks: 50Total Hrs: 48 SEE Marks: 50

Course learning Outcomes:

At the end of the course students are able to:1. Demonstrate the design and function of various units of digital computers2. Analyze the execution of program and various functional units 3. Asses the performance of the digital Computer 4. Write an assembly programs 5. Develop a micro program for simple operation

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.

ENGINEERING TECHNOLOGY AND MANAGEMENTUCS316HHours/Week: 03

3-CREDITSCIE Marks: 50


Course Objectives:

To provide students with introduction to foundational principles of engineering management

To develop sufficient problem solving skills through design and optimization exercises, project management assignments and case studies.

To train students to identify, formulate and solve engineering management problems in a dynamic environment.

To introduce students to management concepts, time management, planning and organizing.

To introduce students to reliability issues, cost control, quality control management and simulation techniques.

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

1. Build an understanding of need and functions of management, product and process development, concurrent engineering and technology protection processes in managing technology projects

2. Understand and follow the professional and ethical responsibilities.3. An ability to select and apply knowledge of mathematics, science, engineering, and

technology to engineering technology problems that require the application of principles and applied procedures or methodologies.

4. Describe and analyze the key concepts and principles of decision making, R&D management, leadership/ motivation styles and protection of ideas.

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

UNIT-I 10 Hours

Engineering and Management: Introduction, Definitions of Engineering and management. Managementlevels, 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 forPlanning, 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, Traditionalorganization theory, Staffing Technical Organizations, Authority and power, Delegation, Committees and Meetings.

UNIT-III 10 Hours

Motivation and Leading Technical People: Motivation, Theory X and Theory Y, Content and Processtheories, Leadership: Nature of leadership, People/Task Matrix approaches, Situational Approaches. Controlling: Introduction, Process of control, Three Perspective on timing of control, Characteristics ofeffective control systems, Financial and Non-financial controls

UNIT-IV 10 Hours

Technology Management: Introduction, Product and Technology life cycles, Nature of Research andDevelopment, 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/NewProduct 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

DIGITAL SYSTEMS LABORATORYUCS317LHours/Week: 03

1.5-CREDITSCIE Marks: 50

Exam Hours:03 SEE Marks: 50

Course Objectives.

1. To reinforce learning in the accompanying this course through hands-on experience with design, construction, and implementation of digital circuits.

2. To provide the student with the capability to use VHDL software as tools in the simulation of digital circuits, and in future courses, design projects, and professional work assignments.

Course Outcomes.

1. This course provides the foundation education in digital electronic circuit analysis and design. Through lecture, laboratory, and out-of-class assignments, students are provided learning experiences that enable them to:

2. Design, simulate and implement basic combinational and sequential logic circuits. Become proficient with computer skills (eg., VHDL language) for the analysis and design of circuits.

3. Acquire teamwork skills for working effectively in groups .

Practice Assignments using digital I C’s :

l Implementation of Boolean Expressions of basic logic gates such as 2-input/3-input AND,OR,NAND,NOR, EX-OR gates

l 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 :

l Implementation of Boolean Expressions of basic logic gates such as 2-input/3-input AND,OR,NAND,NOR, EX-OR gates

l 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:

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

l In the examination questions must be given on lots. Each student must be given one question from PART-A and one from PART-B.

l Practice Assignments are not to be considered for SEE Examination.

UCS318L DATA STRUCTURES LABORATORY 1.5 CREDITS

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

Course Outcomes

At the end of the course, the student should be capable of 1. Developing simple applications using features such as strucrures, unions, pointers, files

and dynamic memory2. Designing & implementing linear and non linear data structures.3. Identifying appropriate data structures and develop solutions for given problem

1. Write C program to accept information about set of students like rollno, name, usno & stay information (hostelite or localite). Further for hostelites roomno & messid are to be stored and for localities residence address should be stored. Use array of structures nested as specified below. Write separate functions.I. To accept students information.II. To display either hostelite of localites information based on users wish.III. To search a student given the rollno. In case of success it should return 1 else 0. Further in

case of success it should pas all the information of the required student to the caller via parameter method.

2. Write C program to hold details of the student like name, rollno, usno and marks in three tests. Computer average marks for each student. Use array of pointers to student structure & dynamic memory concept. Write separate functions.1. To accept the student information.2. To display student information.3. To sort tha array of pointers to student structure based on the average marks computed.4. To determine the topper of the class and to return the topper student details via return

statement (hint: structure: student_info:rollno, usno, name, marks [3].array: stud: stud_info*stud[])Use malloc to allocate space for each student structure.

3. Write C program to store 2d ragged array. Use calloc to allocate memory for array. The number of rows and column size of each row must be tailored to the needs of the user. Provide functions. To allocate space for the array. To load the array. To display the array. To compute total number of prime numbers in the array. To compute row average, row minimum and row maximum separately. These functions

should take as input the beginning address of the row and return the result via return statement.

4. Write C program to perform the following on a binary file.i) Accept the student information like rollno, name, name, usno and store in a file.ii) Display the file contents in reverse order on at a time.iii) Display the file contents by reading all n records into an array and display one at a time.iv) Retrieve the user specified record (numbering is from 1 onwards).v) Search the students based on usno and accordingly allow to modify the fields as per the

user wish.5. Write C program to create text file. The two filenames are to be passed as command line

arguments. Provide functions to perform the following.

i) Tokenise the text (tokens are words separate by white space. Use strtok()].ii) Place the words into another file

6. Write C program to implement the following string library functions i)strcat() ii)strlen()iii)strcpy()iv)strchr()

7. a)Write C program to create an ADT for linked stack. Use the ADT and create stack of integers and stack of characters.

b)Write C program to create stack of students with roll ,name and usno.Implement stack using array. Provide functions to display and to perform other possible operations on the stack.

8. a)Write C program to create an ADT for linked queue. Use the ADT and crate queue of integers and queue of characters.

b)Write C program to create queue of students with roll ,name and usno.Implement queue using array. Provide functions to display and to perform other possible operations on the queue.

9. Write C program to create a circular linked list with each data node containing integer data and a link to successor node. Provide function to perform following operations on the list.

i. Insertion based on position.ii. Insertion after the key element.

iii. Insertion before the key element.iv. Deleting key element.v. Search for key element.

vi. Display.10. Write C program to perform the following.1. Create a binary tree of integers. User should input the element and the position of insertion of

the node.2. Search for a given element.3. Functions to compute no of leaf nodes, internal nodes.4. Function to compute depth/height of a tree.5. Total number of nodes.6. Largest element.7. Parent of a given node.8. Sum of the nodes.9. Copy tree.10. No of occurrences of key element.11. Write C program to create binary search tree with each node containing one integer data field.

Provide functions to perform the following operations on the tree.1. Search for a given element.2. Insert a node.3. Functions to traverse in preorder, postorder and inorder.4. To obtain largest element.5. To sort in descending order.

vi) To check whether tree is balanced6. To set pointer to key node7. To set pointer to parent node

12. Write C program to perform the following on unsigned 8 bit fixed integer i) Function that returns bitwise string of the number passed as input

ii)Function to set the bits specified iii)Function to reset the bits specified iv)Functions to left rotate and right rotate v)Functions to flip the specified bits

13)Write C program to accept two floats, two integers as command line arguments and print the following i)program name,number of command line arguments ii)actual command line arguments & their sum seperately



Scheme of Syllabus for 4th Semester (2015-2016 to 2017-2018 Admitted Batches)

Sl.No Subject Code Subjects

Hrs/WeekC CIE *SEE TotalL 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 UCS423C Microcontrollers 4 0 0 4 50 50 100

4 UCS434C Operating Systems 4 0 0 4 50 50 100

6 UCS416C Object Oriented Programmingwith C++ 4 0 0 4 50 50 100

7 UCS427L Database Application andVisualization Lab 0 1 3 2 50 50 100

8 UCS438L Object Oriented ProgrammingLab 0 0 2 1.5 50 50 100

9 UCS439L Microcontroller Lab 0 0 2 1.5 50 50 100

UHS001N Fundamentals of Quantitative Aptitude and Softskills 0 0 2 1 50 50 100

10 UMA400M* Advanced Mathematics-II 4 0 0 0 50 50 100Total 22** 1 7 26 500 500 1000


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 4 th Semester through lateral scheme is 26 hours.

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

UMA401C: ENGINEERING MATHEMATICS-IV4 Credits (4-0-0)

Course Objectives:

To enable the students to apply the knowledge of Mathematics in various Engineering fields by making them

1 to identify the functions in engineering problems as analytic function and their study as a functions of a complex variables.

2 to specify some difficult integration that appear in applications can be solved by complex integration.

3 to understand the method of finding the series solution of Bessel’s and Legendre’s differential equations.

4 to form a specific relation for the given group of data using least square sense method.5 to specify probability is an area of study which involves predicting the relative likely hood

of various outcomes.

Course outcomes:

On completion of this course, students are able 1. to solve Engineering problems using complex variable techniques.2. to evaluate the line integrals of a complex valued function.3. to apply series solution of Bessel’s and Legendre’s differential equations for BVP arising in

cylindrical and spherical coordinate system respectively.4. to apply the least square sense method to construct the specific relation for the given group

of data. 5. to apply the concept of probability to find the physical significance of various distribution

phenomena.

UNIT-I

Complex Variables: 13 HoursAnalytic function, Cauchy-Reimann equations in Cartesian and polar forms. Construction of analytic function (Cartesian and polar forms), Discussion of conformal transformations: z2, ez and z +a2/z (z # 0),Bilinear transformations.Complex Integration: Line integral, Cauchy's theorem - corollaries, Cauchy's integral formula. Taylor’s and Laurent's series (statements only), singularities, poles, calculation of residues, Cauchy’s residue theorem (without proof) - problems.

UNIT-II

Special Functions: 13 HoursSeries 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: 13 HoursCurve fitting by the method of least squares:. Correlation, expression for the rank correlation coefficient and regression. Probability: addition rule, conditional probability, multiplication rule, Baye’s rule.

UNIT-IV

Probability distributions: 13 HoursDiscrete and continuous random variables-Probability density function, Cumulative distribution Function, Binomial distributions Poisson distributions and Normal distributions

Joint Probability Distribution and Markov Chains:Concept of joint probability, Joint distributions - discrete and continuous random variables, Independent random variables, Problems on expectation and variance. Markov chains: Introduction, Probability vectors, Stochastic Matrices, Fixed Points and Regular stochastic Matrices, Markov chains, higher transition probabilities, stationary distribution of regular Markov chains and absorbing states.

Total 52 HoursResources:

1. Higher Engineering Mathematics by Dr. B.S. Grewal, Khanna Publishers, New Delhi.2. Theory and problems of probability by Seymour Lipschutz (Schaum’s Series).3. Advanced Engineering Mathematics by H. K. Dass4. 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 2nd edition 2012.6. A first course in Complex analysis with applications by Dennis G. zill Patrick D shanahan,

2nd edition 2010.7. Advanced Engineering Mathematics by Peter V. O’Neil.

Question paper pattern for SEE

1. Total of eight questions with two from each unit to be set uniformly covering the entire syllabus.

2. Each question should not have more than four subdivisions. 3. Any five full questions are to be answered choosing at least one from each unit.

DATABASE MANAGEMENT SYSTEMSUCS412CHours/Week: 04

4 CREDITSCIE MARKS: 50


Course Outcomes: On completion of this course, students should be able

1. Explain the concepts of database and database management system.2. Describe security concepts for multi user database applications.3. Design database for given database application.4. Apply normalization concepts to refine designed database.5. Develop database programming skills.

UNIT-I

Introduction and Entity-Relationship Model 12 HrsIntroduction; 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 HrsRelational 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 423CMICROCONTROLLERS 4-

CREDITSHours/Week : 04 CIE. Marks: 50

Total Hours : 52 SEE. Marks: 100

Course Outcomes

A student who successfully completes this course should be able to 1. List different addressing modes and instruction sets of 8051 Microcontroller.2. Compare features of microcontroller and microprocessor.3. Develop assembly and embedded C program for simple microcontroller based application.4. Design address decoder to interface external memory devices.5. Select appropriate mode of operation for programming interface I/O circuits.

UNIT- I (13 Hours)

The 8051 Microcontrollers: Microcontrollers and Embedded systems, Overview of the 8051 family.8051 Assembly Language Programming: Inside the 8051, Introduction to 8051 Assembly Programming, Assembling and running an 8051 program, the program counter and ROM space in the 8051, 8051 data types and directives, 8051 flag bits and PSW register, 8051 register banks and stack.Jump, Loop and Call Instructions: Loop and Jump instructions, Call instructions, Time delay for various 8051 chips.I/O Port Programming: 8051 I/O programming, I/O bit manipulation programming.

UNIT-II (13 Hours)

8051 Addressing Modes: Immediate and register addressing modes, Accessing memory using various addressing modes, Bit addresses for I/O and RAM, Extra 128-byte-on-chip RAM in 8052.Arithmetic, Logic Instructions and Programs: Arithmetic Instructions, Signed number concepts arithmetic operations, Rotate instruction and data serialization, BCD, ASCII, and other application programs.8051 Programming in C: Data types and time delay in 8051 C, I/O programming in 8051 C, Logic operations in 8051 C, Data conversion programs in 8051 C, Accessing code ROM space in 8051 C, Data serialization using 8051C.Pin description of 8051: Pin description of the 8051.

UNIT-III (13 Hours)

8051 Timer Programming in Assembly and C: Programming 8051 timers, counter programming, programming timer 0 and 1 in 8051 C.8051 Serial Port Programming in Assembly and C: Basics of serial communication, 8051 conversion to RS232, 8051 serial port programming in Assembly, Programming the second serial port, Serial port programming in C.Interrupts Programming in Assembly and C: 8051 interrupts, Programming timer interrupts, Programming external hardware interrupts, Programming the serial communication interrupt, Interrupt priority in the 8051/52, Interrupt programming in C.

UNIT-IV (13 Hours)

8051 Interfacing to External Memory: Semiconductor Memory, Memory address decoding, 8031/51 interfacing with external ROM, 8051 data memory space, accessing external data memory in 8051 using C.8051 interfacing with the 8255: Programming the 8255, 8255 interfacing, 8051 C Programming for the 8255. Motor control: Stepper motor interfacing, DC motor interfacing and PWM.Text Book:

1. Muhammad Ali Mazidi, Janice Gillipse Mazidi and Rolin D. Mckinlay, “The 8051 Microcontroller and Embedded Systems using Assembly and C”, Pearson 2nd Edition, 2011.

Reference Text Books:

1. Kenneth J. Ayala, “The 8051 Microcontroller Architecture, Programming and Applications”, 2nd Edition, Penram International, 1996.

2. Dr. Uma Rao and Dr. Andhe Pallavi, “The 8051 Microcontroller Architecture, Programming and Applications”, Pearson Education Sanguine.

3. V Udayshankar, M S Mallikarjunswamy, “8051 Microcontroller: Hardware, Software and Applications”, McGrawHill, New Delhi.

UCS434C OPERATING SYSTEMS 4 CREDITSHours/Week: 04 CIE MARKS: 50 Total Hours: 52 SEE Marks: 50--------------------------------------------------------------------------------------------------------------------------------Course objectives

1. To learn the fundamentals of Operating Systems.2. To learn the mechanisms of OS to handle processes and threads and their communication 3. To learn the mechanisms involved in memory management ,file system, protection and security4. To gain knowledge on synchronization algorithms, deadlock handling algorithms .

Course Outcomes

After the completion of this Course Students should be able to1. List and explain goals, service and functions of different classes of operating systems2. Analyze the performances of different process scheduling, memory management, file

system implementation, protection and security mechanisms.3. Apply scheduling and memory allocation policies for solving scheduling and memory

management problems.4. Develop simple concurrent applications using processes and threads5. Select appropriate mechanisms for deadlock handling, synchronization and interprocess

communication.

UNIT I 13 Hours

Introduction : Abstract Views of an Operating System , Goals of an Operating System , Operation of an Operating System, Operating System 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 , Modern Operating Systems Processes and Threads: Processes and Programs, Programmer View of Processes , Operating System View of Processes. Threads, Scheduling : Preliminaries, Non-preemptive Scheduling Policies, Preemptive Scheduling Policies, Scheduling in Practice .

UNIT II 13 Hours

Synchronisation : Background, The critical section problem,Petersons solution, Synchronisation hardware, Semaphores, Classic Problems of synchronization, Monitors.Deadlocks: System model, Deadlock Characterization, Methods of Handling deadlocks ,Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery From Deadlock

UNIT III 13 Hours

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.Virtual Memory : Virtual Memory Basics, Demand Paging , Page Replacement Policies, Memory Allocation to a Process, Shared Pages, Memory Mapped Files.

UNIT Iv 13 Hours

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 .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, Capabilities. Case Study : The Linux System: Linux History, Design Principles, Kernel Modules, Process Management, Scheduling, Memory Management, File Systems, Input and Output,Interprocess Communication, Security.

Text Book:

1. D. M. Dhamdhere, Operating Systems--A Concept Based Apparoach, Second edition, Tata McGraw-Hill, 2006. (Chapter 1,2,3,4,5,6,7 and 8)

2. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Principles, 7 th edition, Wiley-India, 2006. (Chapter 6,7 and 21)

References:

1. Harvey M Deital: Operating systems, 3rd Edition, Addison Wesley2. William Stallings:Operating Systems, 6th Edition, Addison Wesley

OBJECT ORIENTED PROGRAMMING WITH C++ UCS416CHrs/Week: 04

4-CREDITSCIE Marks: 50

Total Hrs: 48 SEE Marks: 50

Course Outcomes

After learning the course the students should be able to: Explain the basic and advanced elements of object oriented paradigm. Demonstrate the concepts of object oriented programming. Design object oriented solutions and implement using C++ for the given problems. Incorporate / Integrate robustness, reusability, and portability into software development. Apply the object oriented concepts for developing simple real-world problems.

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

Constructors Destructors: Constructors, Destructors.

Inheritance: Introduction to Inheritance, Base Class and Derived Class Pointers, Function Overriding, BaseClass 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 classreference, 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 theIncrement 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 HoursStream Handling: Streams, The Class Hierarchy of Handling Streams, Text and Binary Input/0utput, Textversus 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: Anoverview, containers, vectors, lists, mapsException Handling: Exception handling Fundamental, Handling Derived class ExceptionException 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++.

DATABASE APPLICATION AND VISUALIZATION LABUCS427LHours/Week: 03

2-CREDITSCIE MARKS: 50

Exam Hours: 03 SEE Marks: 50

Course Outcome:

After the completion of the course the student should be able to:1. Create and maintain database using SQL.2. Query the given database to generate reports.3. Execute modular programs using PL/SQL concepts.4. Design and develop real time database applications.

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 Organization3) Inventory Processing System4) 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.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)

5)Programs development using creation of procedures, passing parameters IN and OUT of PROCEDURES.

6)Program development using creation of stored functions, invoke functions in SQL Statements7)Program development using creation of package specification, package bodies, private objects,

package variables and calling stored packages.8)Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR, WHERE

CURRENT of clause and CURSOR variables.9)Develop Programs using BEFORE and AFTER Triggers,

PART – B

Develop Mini Project on any application.

OBJECT ORIENTED PROGRAMMING LABORATORYUCS438LHours/Week: 02

1.5-CREDIT CIE MARKS: 50


Course OutcomesAfter learning the course the students should be able to:1. Build classes and create programs in C++ that are robust and can be reused.2. Make use of various object oriented features including polymorphism, inheritance,

generic function and class.3. Gain in depth, hands-on experience to design and develop software using C++

programming concepts.4. Work in a team to analyze engineering problems and develop C++ programs for

real world problems.5. Design and implement object oriented applications.

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 PERSONData 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.Display the contents of the output file.

iii. 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 listb) To add an item at a specified locationc) To add an item at the endd) To print the contents of the vectors

Note:1. In the examination questions must be given lots.2. Each student must be given one full question.

MICROCONTROLLER LAB UCS439LHours/Week: 02

1.5 CREDIT CIE MARKS: 50


Course objectives:

1. To introduce the basics of microcontroller and its applications.2. To provide in depth knowledge of 8051 and assembly language programming.3. To expertise working with Keil compiler and embedded C programming. 4. To impart the I/O interfacing concepts

Course outcomes:

At the end of the course, the student should be able to:1. Write assembly and C programs.2. Develop applications using Kiel compiler and simulator.3. Interface I/O devices.4. Program 8255 Programmable Peripheral Interface in appropriate mode and

interface devices.5. Develop programs for simple microcontroller based applications.

List of Programs:

1. Write an ALP to find frequency of occurrence of a key number in the list of N numbers is available in location 30h , N is available in location 31h. The array of N numbers are available from the location 32h. Store the result in register r7.

2. Write an ALP to implement decimal up down counter using P0 read P1.0 to decide up or down counter.

3. Write an ALP to swap to add no until sum<=ffh how many numbers that causes sum ffh store it, input start from 30h.

4. Write an ALP to find smallest of n numbers.5. Write an ALP Program to generate triangle wave.6. Write an ALP to rotate the stepper motor by 180 in clockwise direction.7. Write an ALP to find even or odd sum. 8. Write an ALP to sort number in ascending order.9. Write an ALP to send data stored in ROM to port2 serially using hyper

terminal.10. Write C Program to generate square wave.11. Write C Program to generate staircase wave.12. Write C program to generate staircase wave.13. Write an ALP to define interrupt service routine for external interrupt for

interface keyboard.

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 HoursVelocity, 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 HoursDefinition- 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.




Sl.No

Subject Code Subjects Hrs/Week C CIE *SE

E TotalL T P

1 UCS521C Analysis and Design of Algorithms 3 0 2# 4 50 50 100

2 UCS512C System Software 3 0 0 3 50 50 1003 UCS523C Data Communications 4 0 0 4 50 50 1004 UCS524C Software Engineering 4 0 0 4 50 50 1005 UCSXXE Elective – 1 3 0 0 3 50 50 1006 UCS048E Elective - 2 (ADBMS) 3 0 0 3 50 50 1007 UCS525L System Software Lab 0 0 2 1 50 50 1008 UCS526L Operating Systems Lab 0 0 2 1 50 50 100

9 UHS002NAdvanced Quantitative Aptitude and Soft Skills 0 2 0 1 50 50 100

Total 20 3 7 24 450 450 900

L: Lecturer Hours per Week T: Tutorial hours per weekP: Practical Hours per Week C: Credit points*CIE: Continuous Internal Evaluation *SEE: Semester End Examination

# Lab is to be evaluated for 20 marks in CIE only, theory is to be evaluated for 30 marks in CIE and 50 marks in SEE and the same scheme is applicable to elective courses on programming languages.

ANALYSIS AND DESIGN OF ALGORITHMSSub Code : UCS521C Credits : 04Hours/Week : Theory: 03, Practical: 2 CIE MARKS : 50 (30 theory, 20 lab)Total Hours : 40 SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMES

1. Explain different problem types, data structures and efficiency classes such as best, worst and average class efficiencies with the asymptotic notations employed for analysis of algorithms.

2. Devise algorithms using divide and conquer, decrease and conquer strategies and explain the difference between them. Also exhibit the understanding of trasform and conquer techniques.

3. Write the algorithm for solving problems employing space anf tradeoff technique, greedy strategy and dynamic programming.

4. Explain the concepts of tractability and intractability of problems using backtracking and branch and bound methods and also notions of polynomial time and NP-completeness.

5. Implement the algorithms using a suitable programming language.

UNIT I (10 Hours)

Introduction: Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem Types, Fundamental Data Structures.Fundamentals of the Analysis of Algorithm Efficiency: Analysis Framework, Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Non-recursive and Recursive Algorithms, Example – Fibonacci Numbers. Brute Force: Selection Sort and Bubble Sort, Sequential Search and Brute-Force String Matching, Exhaustive Search.

UNIT II (10 Hours)

Divide and Conquer: Mergesort, Quicksort, Binary Search, Binary tree traversals and related properties, Multiplication of large integers and Stressen’s Matrix Multiplication.Decrease and Conquer: Insertion Sort, Depth First Search, Breadth First Search, Topological Sorting, Algorithms for Generating Combinatorial Objects.

UNIT III (10 Hours)

Transform and Conquer: Presorting, Balanced Search Trees, Heaps and Heapsort, Problem Reduction Space and Time Tradeoffs: Sorting by Counting, Input Enhancement in String Matching , Hashing, B-Trees Dynamic Programming: Computing a Binomial Coefficient, Warshall’s and Floyd’s Algorithms, Optimal Binary Search Trees. The Knapsack Problem and Memory Functions.

UNIT IV (10 Hours)

Greedy Technique: Prim’s Algorithm,Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees. Limitations of Algorithm Power: Lower-Bound Arguments, Decision Trees, ProblemsCoping with the Limitations of Algorithm Power: Backtracking, Branch-and-Bound,

Text Books:

1. Anany Levitin, 2007,’Introduction to The Design & Analysis of Algorithms’, 2nd Edition, Pearson Education.

Reference Books

1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein, 2006,’Introduction to Algorithms’, 2nd Edition, PHI.

2. Horowitz E., Sahni S., Rajasekaran S.,Galgotia Publications, 2001, ’Computer Algorithms’ .

Note: It also includes laboratory (3 Hours Theory and 2 Hours Practical/Week)

COURSE OUTCOMES

At the end of the course student should be able to:1. List and define features/concepts of machine architectures and system softwares.2. Explain characteristics/concepts/basic operations of machines architectures, system softwares and Lex and Yacc tools.3. Write programs to implement simple assembler, loader, linker, macroprocessor, lexical analyzer and syntactic analyzer.4. Compare and contrast types of softwares, machine architectures, system softwares and Lexical and syntactic analyzer.5. Analyze, Design and implement system softwares for different architectures.

UNIT I (10 Hours)

Machine Architecture: Introduction, System Software and Machine Architecture, Simplified Instructional Computer (SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming Examples, Traditional (CISC) Machines - VAX Architecture, RISC Machines - Ultra SP ARC Architecture. Assemblers: Basic Assembler Function - A Simple SIC Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler Features - Instruction Formats & Addressing Modes, Program Relocation, Machine Independent Assembler Features - Literals, Symbol-Definition Statements, Expression, Program Blocks, Control Sections and Programming Linking.

UNIT II (10 Hours)

Loaders And Linkers: Basic Loader Functions - Design of an Absolute loader, A Simple Bootstrap Loader, Machine-Dependent Loader Features - Relocation, Program Linking, Algorithm and Data Structures for a Linking Loader, Machine-Independent Loader Features - Automatic Library Search, Loader Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders.

UNIT III (10 Hours)

Compilers: Basic Compiler Function - Grammars, Lexical Analysis, Syntactic Analysis, Code Generation, Machine Dependent Compiler Features Intermediate Form of the Program. Machine-Dependent Code Optimization, Machine Independent Compiler Features - Structured Variables, Machine Independent Code Optimization, Storage Allocation, Block Structured Languages.

SYSTEMS SOFTWARESub Code : UCS512C Credits : 03

Hours/Week : 03 CIE MARKS : 50

Total Hours : 40 SEE Marks : 50

UNIT IV (10 Hours)

Macro Processor: Basic Macro Processor Functions - Macro Definitions and Expansion, Macro Processor Algorithm and Data Structures, Machine-Independent Macro Processor Features - Concatenation of Macro Parameters, Generation of Unique Labels, Conditional Macro Expansion, Keyword Macro Parameters, Macro Processor Design Options - Recursive Macro Expansion, General-Purpose Macro Processors, Macro Processing Within Language Translators. Lex And Yacc: Lex and Yacc - The Simplest Lex Program, Recognizing Words with LEX, Grammars, Parser-Lexer Communication, A Y ACC Parser, The Rules Section, Running LEX and Y ACC, LEX and Hand- Written Lexers, Using LEX - Regular Expression, Examples of Regular Expressions, A Word Counting Program, Using Y ACC - Grammars, Recursive Rules, Shift/Reduce Parsing, What Y ACC Cannot Parse, A Y ACC Parser - The Definition Section, The Rules Section, Symbol Values and Actions, The LEXER, Compiling and Running a Simple Parser, Arithmetic Expressions and Ambiguity, Variables and Typed Tokens.

TEXT BOOKS:

1) Leyland.L.Beck, 1997, System Software, 3rd Edition, Addison-Wesley.2) John.R.Levine, 1999, Tony Mason and Doug Brown, Lex and Yacc, O’Reilly,

SPD.

REFERENCE BOOK:

1) D.M.Dhamdhere, 1999, System Programming and Operating Systems, 2nd Edition, TMH.

DATA COMMUNICATIONS

Sub Code : UCS523C Credits : 04




Explain the importance of data communications and the Internet in supporting business communications and daily activities

Explain how communication works in data networks and the Internet Recognize the different internetworking devices and their functions Explain the role of protocols in networking Analyze the services and features of the various layers of data networks Design, calculate, and apply subnet masks and addresses to fulfill networking

requirements Analyze the features and operations of various application layer protocols such as

Http, DNS, and SMTP

UNIT – I (12 Hours)

Introduction: Data Communications; Networks; the Internet; Protocols and Standards.Network Models: Layered tasks; The OSI Model, Layers in the OSI model; TCP / IP Protocol Suite, Addressing. Data and Signals: Analog and digital signals; Periodic Analog Signals, Digital Signals, Transmission impairment; Data rate limits; Performance.

UNIT – II (12 Hours)

Digital Transmission, Analog Transmission and Multiplexing: Digital-to-Digital conversion; Analog-to-Digital conversion: PCM; Transmission modes, Digital - to - Analog conversion; Analog - to - Analog conversion; Multiplexing.

Transmission Media: Guided media, unguided media: Wireless.

UNIT – III (12 Hours)

Error Detection and Correction:Introduction to Error Detection and Correction; Block Coding; Linear Block Codes; Cyclic codes, Checksum.

Data Link Control: Framing; Flow and Error control; Protocols; Noiseless channels; Noisy channels; HDLC; Point-to-point Protocol.

Multiple Accesses: Random Access; Controlled Access; Channelization.

UNIT – IV (12 Hours)

Ethernet: EEE standards; Standard Ethernet and changes in the standard; Fast Ethernet; Gigabit Ethernet.Wireless LANs and Connection of LANs: IEEE 802.11; Bluetooth. Connecting devices; Backbone Networks; Virtual LANs.Other Technologies: Cellular telephony; SONET / SDH: Architecture, Layers, Frames; STS multiplexing.

TEXT BOOK:

1) Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006, Data Communications and Networking.

REFERENCE BOOKS:

1) Alberto Leon, Garcia and Indra Widjaja, 3rd Edition, Tata McGraw- Hill, 2004, Communication Networks: Fundamental Concepts and Key Architectures.

2) William Stallings, 8th Edition, Pearson Education, 2007, Data and Computer Communication.

SOFTWARE ENGINEERING





Understand the current theories, models and techniques that provide a basis for software product development.

Write software requirement specification based on the formal specifications for software systems.

Design and develop different components of the software product using standard models.

Verify and Validate the individual components and the whole software product using different testing tools.

Demonstrate the necessary understanding of methods and techniques for software management and also to use these in various development situations.

UNIT –I (12 Hours)

OVERVIEW: Introduction: FAQ's about software engineering, Professional and ethical responsibility. Socio-Technical systems: Emergent system properties; Systems engineering; Organizations, people and computer systems; Legacy systems.CRITICAL SYSTEMS, SOFTWARE PROCESSES: Critical Systems: A simple safety-critical system; System dependability; Availability and reliability. Software Processes: Models, Process iteration, Process activities; The Rational Unified Process; Computer-Aided Software Engineering.

UNIT –II (12 Hours)

REQUIREMENTS: Software Requirements: Functional and Non-functional requirements; User requirements; System requirements; Interface specification; The software requirements document. Requirements Engineering Processes: Feasibility studies; Requirements elicitation and analysis; Requirements validation; Requirements management.SYSTEM MODELS, PROJECT MANAGEMENT: System Models: Context models; Behavioral models; Data models; Object models; Structured methods. Project Management: Management activities; Project planning; Project scheduling; Risk management.

UNIT –III (12 Hours)

SOFTWARE DESIGN: Architectural Design: Architectural design decisions; System organization; Modular decomposition styles; Control styles. Object-Oriented design: Objects and Object Classes; An Object- Oriented design process; Design evolution.DEVELOPMENT: Rapid Software Development: Agile methods; Extreme programming; Rapid application development. Software Evolution: Program evolution dynamics; Software maintenance; Evolution processes; Legacy system evolution.

UNIT –IV (12 Hours)

VERIFICATION AND VALIDATION: Verification and Validation: Planning; Software inspections; Automated static analysis; Verification and formal methods. Software testing: System testing; Component testing; Test case design; Test automation.MANAGEMENT: Managing People: Selecting staff; Motivating people; Managing people; The People Capability Maturity Model. Software Cost Estimation: Productivity; DESIGNING AND DOCUMENTING SOFTWARE ARCHITECTURE: Architecture in the life cycle; Designing the architecture; Forming the team structure; Creating a skeletal system.

TEXT BOOK:

1) Ian Somerville, 8th Edition, Pearson Education, 2007, Software Engineering.2) Len Bass, Paul Clements, Rick Kazman, Pearson Education, 2003. Software

Architecture in Practice , 2nd Edition,

REFERENCE BOOKS:

1) Roger S. Pressman, 7th Edition, McGraw-Hill, 2007, Software Engineering: A Practitioners Approach.

2) Shari Lawrence Pfleeger, Joanne M. Atlee, 3rd Edition, Pearson Education, 2006, Software Engineering Theory and Practice.

3) Waman S Jawadekar, Tata McGraw Hill, 2004, Software Engineering Principles and Practice.

Course Outcomes

At the end of this course, students will be able toi) Explain the concepts of Java and J2EE.ii) Apply object oriented programming concepts in problem solving.iii) Develop the database application using JDBC drivers.iv) Illustrate the concepts of JavaBeans and RMIv) Develop web application for real life problems using JSP, JAVA servlet

Technologies.

UNIT – I 10 Hours

INTRODUCTION TO JAVA: Java and Java applications; Java Development Kit (JDK); Java is interpreted, Byte Code, JVM; Object oriented programming; Simple Java programs. Operators and expressions: Arithmetic Operators, Relational operators, The? Operator; Logical expression; Type casting; Strings, Control Statements: Selection statements, iteration statements, Jump Statements. CLASSES, PACKAGES, EXCEPTIONS Classes: Defining Class, Constructors, Inheritance, Overriding, Final classes, Interfaces, Implementing Interfaces, Packages: Creating Packages, Adding a class to a Package, Hiding classes, Exceptions: Types of Errors, Syntax of Exception handling, Multiple Catch Statement.

UNIT – II 10 Hours

MULTI THREADED PROGRAMMING: Creating Threads, Extending Thread Class, Stopping and blocking thread, Thread exceptions, Thread priority, Synchronization, Implementing runnable interface Managing I/O Files in java Stream classes, Character stream classes, other I/o Classes, Input/output Exceptions, Reading/ writing characters, Reading/writing Bytes, Random access files

UNIT – III 10 Hours

JAVA 2 ENTERPRISE EDITION OVERVIEW, DATABASE ACCESS: Overview of J2EE and J2SE. The Concept of JDBC; JDBC Driver Types; JDBC Packages; A Brief Overview of the JDBC process; Database Connection; Associating the JDBC/ODBC Bridge with the Database; Statement Objects; ResultSet; Transaction Processing; SERVLETS: Background; The Life Cycle of a Servlet; Using Tomcat for Servlet Development; A simple Servlet; The Servlet API; The Javax. servlet Package; Reading Servlet Parameter; The Javax.servlet.http package; Handling HTTP Requests and Responses; Using Cookies; Session Tracking.

Java and J2EE

Sub Code : UCS038E Credits : 3Hours/Week : 03 CIE MARKS : 50Total Hours : 40 SEE Marks : 50

UNIT – IV 10 Hours

JSP, RMI: Java Server Pages (JSP): JSP, JSP Tags, Tomcat, Request String, User Sessions, Cookies, Session Objects. Java Remote Method Invocation: Remote Method Invocation concept; Server side, Client side. ENTERPRISE JAVA BEANS: Enterprise java Beans; Deployment Descriptors; Session Java Bean.

TEXT BOOKS:

1. E. Balaguruswamy, 2007, Programming with Java ,3rd Edition, Tata McGraw Hill.2. Jim Keogh , 2007, J2EE - The Complete Reference , Tata McGraw Hill.

REFERENCE BOOKS:

1. Y. Daniel Liang, 2007, Introduction to JAVA Programming ,6th Edition, Pearson Education. 2. The J2EE Tutorial – Stephanie Bodoff et al, 2nd Edition, Pearson Education, 2004.

Advance Database Management Systems


Course Objectives: The objective of the course is1. Explain the concepts of OLTP applications.2. Demonstrate the basic concepts of data storage, file data structures and query

optimization.3. Analyze the performance of tree structured indexing and hash based indexing.4. Evaluate given query using suitable algorithms.5. Illustrate various methods to evaluate relational operations.

UNIT-I (9 Hours)

Storage and Indexing, Disks and Files: Data on external storage, File organizations and indexing, Index data structures, Comparison of file organizations, Indexes and performance tuning, RAID, Disk space management, Buffer manager, Files of records, Page formats and record formats.

UNIT-II (10 Hours)

Tree Structured and Hash Based Indexing:Intuition for tree indexes, Indexed sequential access method (ISAM), B+ trees, Search, Insert, Delete, Duplicates, B+ trees in practice, Static hashing: Extendible hashing, Linear hashing, comparisons.

UNIT-III (10 Hours)

Query Evaluation and External Sorting:The system catalog, Introduction to operator evaluation, Algorithms for relational Operations, Introduction to query optimization, Alternative plans, motivating example, what a typical optimizer does, when does a DBMS sort data? A simple two-way merge sort, External merge sort.Evaluating Relational Operators The Selection operation, General selection conditions, The Projection operation, The Join operation, The Set operations, Aggregate operations, The impact of buffering

UNIT-I (11 Hours)

A Typical Relational Query Optimizer: Translating SQL queries in to Relational Algebra, Estimating the cost of a plan,

Relational algebra equivalences, Enumeration of alternative plans, Nested sub-queries, other approaches to query optimization.Transaction Processing Concepts : Characterizing schedules based on recoverability, Characterizing schedules based on serializability, Concurrency control: Two Phase Locking Techniques, Based on Time Stamp Ordering, Granularity of Data items and Multiple Granularity Locking, Recovery Technique: ARIES Recovery Algorithm, Recovery in MultidataBase Systems, DataBase Backup and Recovery from Catastrophic failures..Text Books:

1. Raghu Ramakrishnan and Johannes Gehrke, 2003, “Database Management Systems”, 3rd Edition, McGraw-Hill (Chapters 8, 9, 10, 11, 12, 13.1 to 13.3, 14, 15) Elmasri and Navathe, Addison- Wesley, 2007 Fundamentals of Database Systems, 5th Edition, (Chapter 17, 18, 19, 30)

REFERENCE BOOKS:

1. Connolly and Begg, 2002. Database Systems, 3rd Edition, Pearson Publications,

SYSTEMS SOFTWARE LABORATORY

Sub Code : UCS525L Credits : 02


Exam Hours : 03 SEE Marks : 50

COURSE OUTCOMES

At the end of the semester student should be able to:1. Implement the system softwares such as assembler, loader and linker etc using C or C++.2. Design and write Lex program to implement lexical analyzer for given problem statement.3. Design and write Yacc program to implement parser for the given structure recognition.4. Modify the existing design of the algorithm of system softwares to enhance the efficiency.

Part I

1. Write a C program to implement pass one of two pass assembler.2. Write a C program to implement absolute loader.3. Write a C program to implement pass one of two pass macroprocessor.4. Write a C program to implement pass two of two pass macroprocessor 5. Write a C program to generate a lexical analyzer to identify the C keywords6. Design recursive descent parser for parsing pascal read & write statements.

Part II

Design lexical analysers using Lex tool to accomplish the following.

1. Design Lexical analyzer to count the no of occurrences of the words from a given text file.The program should accept the text file and list of words as input.

2. Design Lexical analyzer to count no of positive numbers and negative numbers from the input given.

3. Design Lexical analyzer to count number of printf and scanf statements and replace them by sprintf and sscanf respectively.

4. Design Lexical analyzer to count number of integers , float, double,char variable from C declaration statements

5. Design Lexical analyzer to count number of blank spaces lines, characters, words from a given text file.

6. Design Lexical analyzer to check whether a given simple arithmetic operation is valid or not. If valid print number of positive, negative, multiplication and division operators separately

Part III

Design parsers using Yacc tool to accomplish the following.

1. Design parser using Yacc tool to test the validity of a simple expression involving operators ‘+’,’-‘,’/’,’*’.

2. Design parser using Yacc tool to evaluate the given arithmetic expression involving operators ‘+’,’-‘,’/’,’*’.

3. Design parser using Yacc tool to recognize a valid variable which starts with a letter followed by any number of letters and digits.The length of the identifier should not exceed 15.

4. Design parser using Yacc tool to recognize the grammar an b where n>=10.5. Design parser using Yacc tool to recognize the validity of nested if statements and

also display the number of levels of nesting

Note:

Continuous Internal Evaluation (50 marks) :

Marks are based on execution of assignments and lab internal test. The marks are distributed as below;

1. 30 marks for lab assignment execution.2. 20 marks for lab internal test.

Semester End Examination (50 marks):

In semester end examination two questions will be given. One from Part-I and Part-III respectively.

OPERATING SYSTEM LABORATORY

Sub Code : UCS526L Credits : 02


Exam Hours : 03 SEE Marks : 50


At the end of the course the student should be able to Design and implement simple, but efficient, concurrent process and thread based

application. Implementing various memory allocation strategies and analysing their

performance. Analyse the performance of various scheduling algorithms by implementing them. Analysing the performance of various page replacement policies by implementing

them. Analyse and Implement the solution for various synchronization problems. Analysing and implementing various Deadlock handling strategies. Know where to look for platform specific programming information and be

familiar with reading and using man page information as well as other standard reference materials

Write correct and well documented advanced C code using low level Unix/Linux system calls.

Add new system calls to Kernel. Able to explain about File system.

PART A

1. Write a C program to sort the given set of numbers. Let the parent process sort the first half of the list and child process sort the second half of the list. Finally let the parent process merge the two sorted sublists and display the result.

2. Write a C program to sort the given set of numbers. Let the parent sort the first half of the list and child thread sort the second half of the list. Finally let the parent thread merge the two sorted sublists and display the result.

3. Write a C program to implement Shortest Request Next Scheduling Policy (Non-Preemptive).

4. Write a C program to implement the following memory allocation schemes by considering the problem of external fragmentation.a. Best Fitb. Worst Fit

5. Write a C program to implement FIFO page replacement technique,also check Beladays anomaly.

6. Write a C program to implement LRU page replacement technique.

7. Write a C program to implement Producer-Consumer problem using Dekkers algorithm

8. Write a C program to implement Bankers Algorithm.

PART B

1. Write a C program to implement the following functions using File APIs1. a.displayfile(filename)2. b.readfrom(filename,position,buff,size)

2. Write a C program to print the type of file for each command line argument.3. Write a C program to display environment variables of the parent process,then

create a child process and execute a new program with new environment(Use apprpriate exec system call)

4. Write a C program to display process times.5. 5. Write a C program to generate SIGINT and SIGSTOP signals using signal()

API,Count number of CTRL_C pressings of user and display the CTRL_C pressing count when user presses CTRL_Z.

6. Write a C program to handle signal generated during arithemetic operations.7. Write a C program to demonstrate interprocess communication using pipes. A

parent process reads data from a file and writes it to a pipe wheres as the child process reads data from the pipe and displays it on screen.

8. Write a C program to implement the solution for producer-Consumer problem using Semaphores.

Part C (Not for SEE)Adding system calls to the kernel.

Advance Database Management Systems


Course Objectives: The objective of the course is6. Explain the concepts of OLTP applications.7. Demonstrate the basic concepts of data storage, file data structures and query

optimization.8. Analyze the performance of tree structured indexing and hash based indexing.9. Evaluate given query using suitable algorithms.10. Illustrate various methods to evaluate relational operations.

UNIT-I (9 Hours)

Storage and Indexing, Disks and Files: Data on external storage, File organizations and indexing, Index data structures, Comparison of file organizations, Indexes and performance tuning, RAID, Disk space management, Buffer manager, Files of records, Page formats and record formats.

UNIT-II (10 Hours)

Tree Structured and Hash Based Indexing:Intuition for tree indexes, Indexed sequential access method (ISAM), B+ trees, Search, Insert, Delete, Duplicates, B+ trees in practice, Static hashing: Extendible hashing, Linear hashing, comparisons.

UNIT-III (10 Hours)

Query Evaluation and External Sorting:The system catalog, Introduction to operator evaluation, Algorithms for relational Operations, Introduction to query optimization, Alternative plans, motivating example, what a typical optimizer does, when does a DBMS sort data? A simple two-way merge sort, External merge sort.Evaluating Relational Operators The Selection operation, General selection conditions, The Projection operation, The Join operation, The Set operations, Aggregate operations, The impact of buffering

UNIT-IV (11 Hours)

A Typical Relational Query Optimizer: Translating SQL queries in to Relational Algebra, Estimating the cost of a plan,

Relational algebra equivalences, Enumeration of alternative plans, Nested sub-queries, other approaches to query optimization.Transaction Processing Concepts : Characterizing schedules based on recoverability, Characterizing schedules based on serializability, Concurrency control: Two Phase Locking Techniques, Based on Time Stamp Ordering, Granularity of Data items and Multiple Granularity Locking, Recovery Technique: ARIES Recovery Algorithm, Recovery in MultidataBase Systems, DataBase Backup and Recovery from Catastrophic failures..Text Books:

2. Raghu Ramakrishnan and Johannes Gehrke, 2003, “Database Management Systems”, 3rd Edition, McGraw-Hill (Chapters 8, 9, 10, 11, 12, 13.1 to 13.3, 14, 15) Elmasri and Navathe, Addison- Wesley, 2007 Fundamentals of Database Systems, 5th Edition, (Chapter 17, 18, 19, 30)

REFERENCE BOOKS:

2. Connolly and Begg, 2002. Database Systems, 3rd Edition, Pearson Publications,

Python Programming

Sub Code : UCS065E Credits : 03



Course Outcomes: At the end of the course, students are able to:1. Explain syntax and semantics of different statements and functions in Python.2. Demonstrate the use of strings, files, lists, dictionaries and tuples in simple

applications.3. Write simple applications using regular expressions, multiple threads, different

data types.4. Build simple database applications with GUI.5. Analyze the given problem and select appropriate data types and modules to

develop the solution.

Unit – I (10-Hours)Variables, Expressions and statements, Conditional execution, Functions, Iterations, Strings

Unit – II (10-Hours)Files, Lists, Dictionaries, Tuples, Regular expressions

Unit – III (10-Hours)Networked programs, Object Oriented Programming

Unit – IV (10-Hours)

GUI Programming, Multi-threaded programming, Using Databases and SQL

Text Books:

1. Charles R. Severance, “Python for Everybody: Exploring Data Using Python 3”, 1st Edition, CreateSpace Independent Publishing Platform, 2016. (http://do1.drchuck.com/pythonlearn/EN_us/pythonlearn.pdf ) (Chapters 1 – 13, 15)

2. Wesley J. Chun, “Core Python Applications Programming”, Third Edition, Pearson Education India, 2015.

Reference Books:1) Charles Dierbach, "Introduction to Computer Science Using Python", 1st

Edition, Wiley India Pvt Ltd.2) Mark Lutz, “Programming Python”, 4th Edition, O’Reilly Media, 2011.ISBN-

13: 978-9350232873

3) Roberto Tamassia, Michael H Goldwasser, Michael T Goodrich, “Data Structures and Algorithms in Python”, 1st Edition, Wiley India Pvt. Ltd, 2016. ISBN-13: 978- 8126562176

4) Reema Thareja, “Python Programming using problem solving approach”, Oxford university press, 2017

5) https://www.python.org/




Sl.No

Subject Code Subjects Hrs/Week C CIE *SEE TotalL T P

1 UCS611C Computer Networks 4 0 0 4 50 50 100

2 UCS612C Advanced Computer Architectures 3 0 2# 4 50 50 100

3 UCS613C Computer Graphics and Visualization 4 0 0 4 50 50 100

4 - Elective - 3 3 0 0 3 50 50 1005 - Elective -4 3 0 0 3 50 50 1006 - Elective -5 3 0 0 3 50 50 1007 UCS614L Computer Graphics Lab 0 0 3 1.5 50 50 1008 UCS615L Computer Networks Lab 0 0 3 1.5 50 50 100

9 UHS003N Career planning and Professional Skills 0 2 0 1 50 50 100

Total 20 0 6 25 400 400 800


# Lab is to be evaluated for 20 marks in CIE only, theory is to be evaluated for 30 marks in CIE and 50 marks in SEE and the same scheme is applicable to elective courses on programming languages.

COURSE OUTCOMES

1 To build an understanding of the fundamental concepts of Computer Networks.

2 To analyze and explain different protocols & security aspects of Computer Networks.

3 To apply techniques like addressing, mapping, routing, error controlling, security etc. for efficient handling of Computer Networks.

4 Design and implement a secured and manageable network.


Network Layer: Logical Addressing: IPv4 Addresses, IPv6 Addresses. Internet Protocol: Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6. Address Mapping, Error Reporting & Multicasting: Address Mapping, ICMP, and IGMP. Delivery, Forwarding & Routing: Delivery, Forwarding, Unicast Routing Protocols.


Transport Layer: Peer-to-Peer Delivery: UDP, TCP, and SCTP. Congestion Control and Quality of Service: Data traffic, Congestion, Congestion Control, Two Examples, Quality of Service, Techniques to improve QoS, Integrated Services, QoS in Switched Networks.


Application Layer: Domain Name System: Name Space, Domain Name Space, Distribution of Name Space, DNS In The Internet, Resolution, DNS Messages, Types of records, Registrars, Dynamic Domain Name System, Encapsulation. Remote Logging, Electronic Mail, File Transfer. WWW and HTTP: Architecture, Web Documents, HTTP.


Network Management: Network Management System, SNMP. Multimedia: Digitizing Audio and Video, Audio and Video Compression, Streaming Stored Audio/Video, Streaming Live Audio/Video, Real-Time Interactive Audio/Video, RTP, RTCP, Voice Over IP. Cryptography: Introduction, Symmetric-Key Cryptography, Asymmetric-key Cryptography, Network Security services.

COMPUTER NETWORKS




TEXT BOOK:

1. Behrouz A. Forouzan, 4th Edition, Tata McGraw-Hill, 2006, Data Communications and Networking.

REFERENCE BOOKS:

1. James F. Kurose, Keith W. Ross, Third Edition, Pearson Education, 2008, Computer Networking-A top-down approach featuring the Internet.

2. William Stallings, 8th Edition, Pearson Education, 2007, Data and Computer Communication.

3. Larry L. Peterson and Bruce S. David – 4th Edition, Elsevier, 2007, Computer Networks A Systems Approach.

4. Wayne Tomasi, Pearson Education, 2005, Introduction to Data Communications and Networking.

UCS612C ADVANCED COMPUTER ARCHITECTURES 4 CREDITS

Hours/Week: 03 Hrs Theory+2 Hrs lab CIE Marks: 50

Total Hours: 48 SEE Marks:50

Course Outcomes:At the end of the course students are able to

1. Explain the basic concepts of high performance computers.

2. Compare the relationship between different computer architectures and their corresponding instruction sets.

3. Calculate and analyze the performance of various computer architectures.

4. Design interconnection networks for various architectures with given specification.

5. Design and develop simple parallel programs.

UNIT – I 10hrs Parallel Computer Models : The State of Computing, Computer Development Milestones, Elements of Modem Computers, Evolution of Computer Architecture, System Attributes to Performance, Multiprocessors and Multicomputers, Shared -Memory Multiprocessors, Distributed -Memory Multiprocessors, A Taxonomy of MIMD Computers, Multivector and SIMD computers, Vector Supercomputers, SIMD Supercomputers, Program and Network Properties, Conditions of Parallelism, Data and Resource Dependencies, Hardware and Software Parallelism, Program flow Mechanisms, Control Flow Versus Data Flow , Demand-Driven Mechanisms, Comparisons of Flow Mechanisms. PARALLEL PROGRAMMING: Message passing Programming, Shared memory programming, open MP Libraries.

UNIT-II 10hrs

System Interconnect Architecture: Network properties and Routing, Static Connection Networks, Dynamic Connection Networks, Processor and Memory Technologies, Advanced Processor Technology, Instruction Pipelines, Processors and Co-processors, Instruction-Set Architectures,CISC Scalar Processor, RISC Scalar Processors, Superscalar and Vector Processor, Superscalar Processors, VLIW Architecture

Backplane Bus System, Backplane Bus Specification, Addressing and Timing Protocols, Arbitration, Transaction and Interrupt, IEEE Futurebus+ Standards, Shared-Memory, Organizations, Interleaved Memory Organization, Bandwidth and fault Tolerance, Memory Allocation Schemes.

UNIT – III 10 hrs

Pipelining and Superscalar Techniques: Linear Pipeline Processors, Asynchronous and Synchronous Models, Clocking and Timing control, Speed up, Efficiency and Throughput, Non-linear Pipeline Processors, Reservation and Latency Analysis, Collision-Free Scheduling, Instruction Pipeline Design, Instruction Execution Phases, Mechanism for Instruction, Pipelining, Dynamic Instruction Scheduling, Branch Handling Techniques, Arithmetic Pipeline Design, Computer Arithmetic Principles, Static Arithmetic Pipeline, Multifunctional Arithmetic

UNIT-IV 10hrs

Multiprocessors and Multi-computers: Multiprocessor System Interconnects, Hierarchical Bus Systems: Crossbar Switch and Multiport Memory, Multistage and Combing Networks, Cache Coherence and Synchronization Mechanisms, The Cache Coherence Problem, Snoopy Bus Protocol, Directory-based protocols, Single core and Multicore architecture: Architectural Design space, Introduction to heterogeneous computing , GPU architecture and OpenCL

TEXT BOOKS:

1. Kai Hwang, 1993, “Advanced Computer Architecture- Parallelism, Scalability, Programmability”, McGraw Hill (Chapter 1.1-1.3, 2.1-204, 4. 1 (only specified topics), 4.2.1, 4.2.2, 5.1, 5.3, 6.1, 604, 7.1, 7.2, 704.1, 704.2, 704.3)

2. V Rajararnan, C Siva Ram Murthy, 2000,”Parallel Computers - Architecture andProgramming “, PHI

3. Benedict R. Gaster, Lee Howes, David R, Perhaad Mistry, Dana Schaa, “Heterogeneous Computing with OpenCL” Morgan Kaufmann, 2012.

REFERENCE BOOKS:

1. David E Culler, J P Singh, Anoop Gupta, Harcourt Asia and Morgan Kaufmann 1999, “Parallel Computer Architecture”,

2. John P Hayes, 1998, “Computer Architecture and Organization”, 3rd Edition, McGraw-Hill

3. Michael Quinn, “Parallel Programming in C with MPI and OpenMP”, Tata McGraw Hill, 2011.

Note: It also includes laboratory (3hrs theory and 2hrs practical/week).

CS613C COMPUTER GRAPHICS AND VISUALIZATION 4 CREDITS

Hours/Week: 04 CIE Marks: 50


Course Outcomes

At the end of the course students are able to:1. Explain fundamental concepts of computer graphics and visualization

2. Apply algorithms to solve graphics problem

3. Able to develop interactive 2D and 3D graphics applications

4. Illustrate the animations of graphics models using geometric transformation functions

5. Construct the graphical model with lighting and shading patterns

UNIT –I 12 Hrs

Overview of Graphics Systems: Video Display Devices, Raster-Scan Displays, GraphicsWorkstations and Viewing Systems, Introduction to OpenGL, Graphics Output Primitives : Coordinate Reference Frames, Specifying A Two-Dimensional World-Coordinate Reference Frame in OpenGL, OpenGL Point Functions, OpenGL Line Functions, Line drawing algorithms: Bresenham’s Line-Drawing Algorithm, OpenGL Curve Functions, Circle generating Algorithms: Midpoint Circle Algorithm, Fill-Area primitives, OpenGL Polygon Fill-Area Functions, OpenGL Vertex Arrays, Pixel-Array Primitives, OpenGL Pixel-Array Functions, Character Primitives, OpenGL Character Functions, OpenGL Display Lists, OpenGL Display-Window Reshape Function, Attributes of Graphics Primitives: OpenGL State Variables, Color and Grayscale, OpenGL Color Functions, OpenGL Point-Attribute Functions, OpenGL Line-Attribute Functions

UNIT–II 12 Hrs

Interactive Input Methods and Graphical User Interfaces:

Graphical Input Data, Logical Classification of Input Devices, Input Functions for Graphical Data, Interactive Picture-Construction Techniques, OpenGL Interactive Input-Device Functions , OpenGL Menu Functions, Designing a Graphical User Interface

Geometric Transformations-1: Basic Two-Dimensional Geometric Transformations, Matrix Representations and Homogeneous Coordinates, Inverse Transformations, Two-Dimensional Composite Transformations, Other Two-Dimensional Transformations, Raster Methods for Geometric Transformations, OpenGL Raster Transformations, Transformations between Two-Dimensional Coordinate Systems

UNIT –III 12 Hrs

Geometric Transformations-2:Geometric Transformations in Three-Dimensional Space, Three-Dimensional Translation, Three-Dimensional Rotation, Three-Dimensional Scaling, Composite Three Dimensional Transformations, Other Three Dimensional Transformations, Transformations between Three Dimensional Coordinate Systems, Affine Tranformations, OpenGL Geometric Transformations Functions

Two-Dimensional Viewing: The Two-Dimensional Viewing Pipeline, The clipping Window, Normalization and Viewport Transformations, OpenGL Two-Dimensional Viewing Functions, Clipping Algorithms, Two-Dimensional Point Clipping, Two-Dimensional Line Clipping: Cohen-Sutherland line Clipping, Polygon Fill-Area Clipping: Sutherlan-Hodgman Polygon Clipping, Curve Clipping, Text Clipping

UNIT-IV 12 Hrs

Three-Dimensional Viewing: Overview of Three-Dimensional Viewing Concepts, The Three-Dimensional Viewing Pipeline, Three-Dimensional Viewing-Coordinate Parameters, Transformation from World to Viewing Coordinates, Projection Transformations, Orthogonal Projections, Oblique Parallel Projections, Perspective Projections, The Viewport Transformation and Three- Dimensional Screen Coordinates, OpenGL Three-dimensional Viewing Functions, Three-Dimensional Clipping Algorithms, OpenGL Optional Clipping Planes

Illumination Models and Surface-Rendering Methods: Light Sources, Surface Lighting Effects, Basic Illumination Models, Transparent Surfaces, Atmospheric effects, Shadows, Camera Parameters, Displaying Light Intensities, Polygon Rendering Methods, Ray-Tracing methods, Radiocity Lighting Models, OpenGL Illumination and Surface-Rendering Functions, OpenGL Texture Functions

Text Books:

1. Donald Hearn and Pauline Baker, 3rd Edition ,Pearson Education, 2004, Computer Graphics with OpenGL

References:

1. Edvard Angel, 5th Edition, Addison-Wesley, 2008, Interactive Computer Graphics A Top-Down Approach with openGL

2. F.S.Hill Jr.2nd Edition, Pearson Education, 2001, Computer Graphics using OpenGL

3. James D. Foley, Andries Van Dam, Steven K Feiner, John F. Hughes, Addison-wesley 19997, Computer Graphics

COMPUTER GRAPHICS LABORATORY

Sub Code : UCS614L Credits : 1.5Hours/Week : 03 CIE MARKS : 50Exam Hours : 03 SEE Marks : 50

Course OutcomesAt the end of the course students are able to:

1. Draw the basic geometrical using OpenGL built in functions 2. Execute the program to implement fundamental graphics algorithms3. Develop the programs to create animation of objects using graphics

functions4. Develop graphics applications using OpenGL programming tool.

Part-A1. Write OpenGL program to implement Bresenham’s line drawing algorithm.2. Write OpenGL program to implement midpoint circle drawing algorithm.3. Implement OpenGL program to draw bar chart and pie chart.4. Write the following interactive OpenGL program

i) Draw a house using mouse to select two end point positions for straight lineii) Display string “WEL TO BEC” on display window accepted from keyboard

5. Implement interactive animation programs. Kite flying Rotating wheel Moving car

6. Program to recursively subdivide a triangle to form 2D Sierpinski gasket. The number of recursive steps is to be specified by the user.

7. Program to draw a cube and spin it using OpenGL transformation matrices.8. Program to create a house like figure and rotate it about a given fixed point using

OpenGL functions.9. Program to implement the Cohen- Sutherland line-clipping algorithm.10. Program to create a cylinder and a parallelepiped by extruding a circle and

quadrilateral respectively. Allow the user to specify the circle and the quadrilateral

Part- BDevelop a suitable graphics package to implement the skills learnt in the theory and the exercises indicated in Part A. Use the OpenGL.

Lab Assessment:1. Each laboratory subject is evaluated for 100 marks (50 CIE and 50 SEE)2. Allocation of 50 marks for CIE

1. Marks for each experiment = 20 marks/No. Of proposed experiments2. 10 marks for graphics package3. one practical test for 20 marks(25% write up ,50% conduction, calculation,

25% results)3. Allocation of 50 marks for SEE

30 marks for evaluating program (25% write up ,50% conduction, calculation, 25% results)

20 marks for evaluating graphics package.

Course Objectives:1. Introduce the fundamental concepts in machine learning and popular machine

learning problems.2. Apply various supervised learning algorithms 3. Introduce various clustering and dimensionality reduction algorithms

Course Outcome:1. Define machine learning and types of learning algorithms2. Explain various machine learning algorithms3. Apply machine learning algorithm to solve problems of moderate complexity4. Analyze performance of algorithms by varying some parameters5. To formulate machine learning model for the simple problems

UNIT-I (10-Hours)Introduction: What is Machine Learning? Examples of Machine Learning Applications. Well posed learning problems, Designing Learning System, Perspectives and issues in Machine Learning.Decision Tree Learning: Introduction, Decision tree representation, Appropriate problems for decision tree learning, the basic decision tree learning algorithm, Hypothesis space search in decision tree learning, Inductive Bias in decision tree learning, Issues in decision tree learning

UNIT-II (10-Hours)Artificial Neural Networks (ANN): Introduction, Neural Network Representations, Appropriate Problems For Neural Network Learning, Perceptron, Multilayer Networks And The Back propagation Algorithm, Remarks On The Back propagation Algorithm, An Illustrative Example: Face Recognition.Kernel Machines: Introduction, Optimal Separation Hyper plane, the non separable case: soft margin hyper plane, V-SVM, Kernel Trick, Vectorial Kernels, Defining kernel, Multiple kernel learning, Multiclass kernel machines, kernel machine for regression, One class kernel machine

UNIT-III (10-Hours)Bayesian learning: Introduction, Bay’s theorem, Maximum likelihood and least squared hypothesis, Maximum likelihood hypothesis for predicting probabilities, Minimum Description length principle, Bay’s optimal classifier, Gibbs algorithm, Naive Bay’s Classifier. An Example: Classify Text. Bayesian Belief networks, EM Algorithm

Machine Learning

Sub Code : UCS044E Credits : 3Hours/Week : 03 CIE MARKS : 50Toatal Hours : 40 SEE Marks : 50

Instance Based Learning: Introduction, k-Nearest Neighbor Learning, Locally Weighted Regression, Radial Basis function, and case based reasoning

UNIT-IV (10-Hours)Dimensionality Reduction: Introduction, Subset Selection, Principal Components Analysis, Factor Analysis, Multi dimensional scaling, Linear descreminant analysis, isomap, Locally Linear EmbeddingClustering: Introduction, Mixture Densities, K-means Clustering, Expectation Maximization Algorithm, Mixture Latent Variable models, Supervised learning after clustering, Hierarchical clustering, Choosing the number of clusters

Text Books:

1. “Machine Learning”, Tom Mitchell. First Edition, McGraw- Hill, 2013.2. “Introduction to Machine Learning”, Edition 2, by Ethem Alpaydin.

Reference Books:1. “Elements of Statistical Learning”, 2nd Edition, Trevor Hastie, Robert

Tipeshirani, Jerome Fredman.2. “Introduction to Machine Learning” ,NPTEL Course Material, Dr. Sudheshna

Sarkar IIT Kharakpur.3. “Building Machine Learning Systems with Python”, 2nd edition, Luis Pedro

Coelho and Willi Richart, PACKT Publication.

Artificial Intelligence and Expert Systems


Course Outcomes:

At the end of the course, the students will be able to1. Identify problems that are amenable to solution by AI methods and identify appropriate methods to solve a given problem.2. Illustrate the representation of knowledge and inference using logic.3. Analyze various control strategies and solve problems using search techniques4. Apply reasoning under inconsistency and uncertainties.5. Demonstrate the knowledge of expert systems and intelligent planning.

UCS041E: Artificial Intelligence and Expert Systems

Credits: 03 LTP: 3-0-0 No. of hours: 40

Course Outcomes:

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

1. Identify problems that are amenable to solution by AI methods and identify appropriate

methods to solve a given problem.

2. Illustrate the representation of knowledge and inference using logic.

3. Analyze various control strategies and solve problems using search techniques

4. Apply reasoning under inconsistency and uncertainties.

5. Demonstrate the knowledge of expert systems and intelligent planning.

Unit - I

1. What is AI? The AI Problems, Underlying assumptions, AI technique, Level of the model, Criteria for success (1.1 to 1.5 from Rich and Knight) 4 Hours

2. Problems, problem spaces and search Problem as a state space search, Production systems, Problem characteristics, Production system characteristics, Issues in the design of search problems, additional problems (2.1 to 2.6 from Rich and Knight) 6 Hours

Unit - II

3. Knowledge representation issues Representation and mappings, approaches to knowledge representation, (4.1 to 4.2 from Rich and Knight), Syntax and semantics for Propositional logic (4.2 from D. W. Patterson) 4 Hours

4. Using predicate logic Representing simple facts in logic, representing instance and is-a relationships, computable functions and predicates, resolution, natural deduction (5.1 to 5.5 from Rich and Knight) 6 Hours

Unit - III

5. Search and control strategies Introduction, Generate and Test, Hill Climbing, Simulated annealing, (3.1, 3.2 from Rich and Knight), Informed search, Searching And-Or graphs (9.5, 9.6 from D. W. Patterson) 5 Hours

6. Probabilistic reasoning Introduction, Bayesian probabilistic inference, possible world representation, Dempster-Shafer theory, Ad-hoc methods, heuristic reasoning methods (6.1 to 6.6 from D. W. Patterson) 5 Hours

Unit - IV

8. Expert system architectures Introduction, Rule-based system architectures, Non-production system architectures, Dealing with uncertainty, Knowledge acquisition and validation, (15.1 to 15.4 from D. W. Patterson) 4 Hours

9. Planning Overview, an example domain: The Blocks world, Components of a planning system, goal stack planning, non-linear planning using constraint posting, hierarchical planning, reactive systems, other planning techniques (13.1 to 13.8 from Rich and Knight) 6 Hours

Text books:

1. Elaine Rich, Kevin Knight and Shivashankar B. Nair, Artificial Intelligence, 3rd Edition, TMH Education (P) Ltd., New Delhi, 2010

2. Dan W. Patterson, Artificial Intelligence and Expert Systems, PHI Learning (P) Ltd., New Delhi, 2008

Reference books:

1. Stuart Russell and Peter Norvig, Artificial Intelligence: A modern approach, 3rd edition,Pearson, 2016

2. Nilson N. J., Principles of Artificial Intelligence, Springer Verlag, 19803. Eugene Charniak and Drew McDermot, Introduction to Artificial Intelligence, Addison-

Wesley, 19984. Peter Jackson, “Introduction To Expert Systems”, 3rd Edition, Pearson Education, 20075. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education 2013

COURSE OUTCOMES

Create topology. Demonstrate the use of TCP/UDP commands. Analyze the performance of the network in terms of bandwidth, packet drop and

throughput. Demonstrate how error detection and correction methods work. analyze routing

algorithm to find the suitable path for transmission. Analyze and demonstrate the control of flow rate.

Demonstrate the client-server communication using TCP/IP sockets ,explain how inter-process communication established using different methods.

Demonstrate reliability of data flow; demonstrate how data can be secured.

PART –A

Simulation Exercises

Introduction PartIntroduce students to network simulation through the Network simulation Package, Create a simple network model with multiple scenarios, Collect statistics on network performance through the use of simulator tools, Analyze and draw conclusion on network performance

1. Simulate two nodes point-to-point network and study the impact of bit error rate on packet error rate and investigate the impact of error of a simple hub based CSMA / CD network.

2. Simulate four nodes point-to-point network and study how the loss, utilization and transmission of wireless LAN (IEEE 802.11b) network varies as the distance between access point and wireless nodes.

3. Simulate point-to-point network which consists of 4 to 6 nodes and study network performance analysis of different scheduling technique like First In Out (FIFO), Priority, Round Robin, Weight Fair Queue (WFQ) using NetSim.

4. Simulate and study the throughputs of slow start, Congestion avoidance (also known as Old Tahoe) and First Retransmit (also known as Tahoe), Congestion Control Algorithms during client-server TCP downloads.

5. Create a network topology which consists six nodes, simulate and study the working and routing table formation of Interior Routing Protocol i.e. Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).

6. Simulate seven cells GSM network and study and compare the effect of dynamic channel allocation (DCA) and fixed channel allocation (FCA) using NetSim.

7. Simulate seven cells GSM network and study how call blocking probability varies as the load on a GSM network is continuously increased.

COMPUTER NETWORK LABORATORY


PART – B

Implement the following in C/C++:

1. Write a program for error detecting code using CRC-CCITT (16- bits). 2. Write a program for Hamming code generation for error detection and correction. 3. Write a program for even / odd parity checking on binary data.4. Write a program to perform stuffing and destuffing on given information.5. Write a program for distance vector algorithm to find suitable path for

transmission.6. Write a program for congestion control using leaky bucket algorithm7. Using TCP/IP sockets, write a client – server program to make the client send the

file name and to make the server send back the contents of the requested file if present.

8. Implement the program 7 using the message queues IPC channels. 9. Implement the program 7 using the FIFO IPC channels: 10. Write a program for simple RSA algorithm to encrypt and decrypt the data.

Note: Student is required to solve one problem from PART-A and one problem from PART-B. The questions are allotted based on lots. Both questions carry equal marks.




Sl.No SubjectCode Subjects

Hrs/WeekC CIE *SEE Tota

lL T P

1 UCS711C Object Oriented Modeling and Design 3 0 0 3 50 50 100

2 UCS712C Web Technologies 3 0 0 3 50 50 100

3 UCS713H Business communication & Technical Writing 3 0 0 3 50 50 100

UCS718C Mobile Computing Systems 3 0 0 34 Elective – 6 3 0 0 3 50 50 1005 Elective-7 3 0 0 3 50 50 1007 UCS724L Web Programming Laboratory 0 0 3 1.5 50 50 100

8 UCS725L Object Oriented Modeling and Design Laboratory 0 0 3 1.5 50 50 100

9 UCS716P Project Phase-I 0 0 4 4 50 50 100Total 18 0 8 25 450 450 900


Course Outcomes:At the end of the course the student should be able to 1. Explain the concepts of Object Oriented Modeling and Design.2. Analyze user requirements for an application.3. Design various models using Unified Modeling Language.4. Comprehend the nature of design patterns by understanding small number of

examples from different categories.5. Develop an application of Object Oriented Modeling and Design practices

from software project management perspectives..


INTRODUCTION, MODELING CONCEPTS, CLASS MODELING: What is Object Orientation? What is OO development? OO themes; Evidence for usefulness of OO development; OO modeling history. Modeling as Design Technique: Modeling; abstraction; The three models. Class Modeling: Object and class concepts; Link and associations concepts; Generalization and inheritance; A sample class model; Navigation of class models; Practical tips. ADVANCED CLASS MODELING, STATE MODELING: Advanced object and class concepts; Association ends; N-ary associations; Aggregation; Abstract classes; Multiple inheritance; Metadata; Reification; Constraints; Derived data; Packages; Practical tips.State Modeling: Events, States, Transitions and Conditions; State diagrams; State diagram behavior; Practical tips.


ADVANCED STATE MODELING, INTERACTION MODELING: Advanced State Modeling: Nested state diagrams; Nested states; Signal generalization; Concurrency; A sample state model; Relation of class and state models; Practical tips. Interaction Modeling: Use case models; Sequence models; Activity models. Use case relationships; Procedural sequence models; Special constructs for activity models. PROCESS OVERVIEW, SYSTEM CONCEPTION, DOMAIN ANALYSIS: Process Overview: Development stages; Development life cycle. System Conception: Devising a system concept; Elaborating a concept; Preparing a problem statement. Domain Analysis: Overview of analysis; Domain class model; Domain state model; Domain interaction model; Iterating the analysis.


APPLICATION ANALYSIS, SYSTEM DESIGN: Application Analysis:

OBJECT ORIENTED MODELING AND DESIGN

Sub Code : UCS711C Credits : 03Hours/Week : 03 CIE MARKS : 50Total Hours : 40 SEE Marks : 50

Application interaction model; Application class model; Application state model; Adding operations. Overview of system design; Estimating performance; Making a reuse plan; Breaking a system in to sub-systems; Identifying concurrency; Allocation of sub-systems; Management of data storage; Handling global resources; Choosing a software control strategy; Handling boundary conditions; Setting the trade-off priorities; Common architectural styles; Architecture of the ATM system as the example.

CLASS DESIGN, IMPLEMENTATION MODELING, LEGACY SYSTEMS: Class Design: Overview of class design; Bridging the gap; Realizing use cases; Designing algorithms; Recursing downwards, Refactoring; Design optimization; Reification of behavior; Adjustment of inheritance; Organizing a class design; ATM example. Implementation Modeling: Overview of implementation; Fine-tuning classes; Fine-tuning generalizations; Realizing associations; Testing. Legacy Systems: Reverse engineering; Building the class models; Building the interaction model; Building the state model; Reverse engineering tips; Wrapping; Maintenance.


DESIGN PATTERNS – 1: What is a pattern and what makes a pattern? Pattern categories; Relationships between patterns; Pattern description.Communication Patterns: Forwarder-Receiver; Client-Dispatcher-Server; Publisher-Subscriber. DESIGN PATTERNS – 2, IDIOMS: Management Patterns: Command processor; View handler. Idioms: Introduction; What can idioms provide? Idioms and style; Where to find idioms; Counted Pointer example. TEXT BOOKS:

1. Object-Oriented Modeling and Design with UML – Michael Blaha, James

Rumbaugh, 2nd Edition, Pearson Education, 2005. 2. Pattern-Oriented Software Architecture: A System of Patterns - Volume 1–

Frank Buschmann, Regine Meunier, Hans Rohnert, Peter Sommerlad, Michael Stal, John Wiley and Sons, 2006.

REFERENCE BOOKS:

1. Object-Oriented Analysis and Design with Applications – Grady Booch et al,

3rd Edition, Pearson Education, 2007. 2. Object-Oriented Design with UML and JAVA – K. Barclay, J. Savage, Elsevier,

2008.3. The Unified Modeling Language User Guide – Booch, G., Rumbaugh, J., and

Jacobson I, 2nd Edition, Pearson, 2005. 4. Design Patterns: Elements of Reusable Object-Oriented Software – E.

Gamma, R. Helm, R. Johnson, J. Vlissides, Addison-Wesley, 1995.

Course Outcome: 1. Understand the basic concepts and tools used in web programming.2. Apply web programming concepts to develop web pages.3. Analyze the given requirement specification to develop any business

applications.4. Design and implement real time web applications.

UNIT-I (10 Hours)

Fundamentals of Web, XHTML : Internet, WWW, Web Browsers, and Web Servers; URLs; MIME; HTTP; Security; The Web Programmers Toolbox. XHTML: Origins and evolution of HTML and XHTML; Basic syntax; Standard XHTML document structure; Basic text markup. XHTML : Images; Hypertext Links; Lists; Tables; Forms; Frames; Syntactic differences between HTML and XHTML. CSS: Introduction; Levels of style sheets; Style specification formats; Selector forms; Property value forms; CSS: Font properties; List properties; Color; Alignment of text; The Box model; Background images; The <span> and <div> tags; Conflict resolution.

UNIT-II (10 Hours)

JAVASCRIPT: Overview of Javascript; Object orientation and Javascript; General syntactic characteristics; Primitives, operations, and expressions; Screen output and keyboard input; Control statements; Object creation and modification; Arrays; Functions; Constructor; Pattern matching using regular expressions; Errors in scripts; Examples. JAVASCRIPT AND HTML DOCUMENTS: The Javascript execution environment; The Document Object Model; Element access in Javascript; Events and event handling; Handling events from the Body elements, Button elements, Text box and Password elements; DYNAMIC DOCUMENTS WITH JAVASCRIPT: Introduction to dynamic documents; Positioning elements; Moving elements; Element visibility; Changing colors and fonts; Dynamic content; Stacking elements;

UNIT-III (10 Hours)

XML: Introduction; Syntax; Document structure; Document Type definitions; Namespaces; XML schemas; Displaying raw XML documents; Displaying XML documents with CSS; ASP.NET;JSP: Architecture of JSP Page, JSP Page life cycle, JSP elements, JSP expression language, Debugging with JSP Debug, JSP Tag extensions: elements of Tag extensions, Tag extension API, Classic tag Handlers, Simple tag Handlers, JSP Fragments, JSP Slandered tag library: Introducing JSTL, Working with the core Tag library, working with XML Tag, Working with SQL Tag library, Working with Function Tag library.

WEB TECHNOLOGIES


UNIT-IV (10 Hours)

EJB: EJB Fundamentals, Classifying EJB, Session Bean, Implementing Session Beans, message – Driven Bean, Implementing message Driven Bean, managing transactions in java EE applications, EJB Timer services, Implementing EJB Timer services.Hibernate: Introduction to Hibernate, Architecture of Hibernate, Hibernate Query Language, Hibernate O/R Mapping, Example on Hibernate, Implementing O/R Mapping with Hibernate, Basics of Jquery, Traversing DOM, DOM manipulation with Jquery.

Text Books:

1. Programming the World Wide Web – Robert W. Sebesta, 4th Edition, Pearson Education, 2008.

2. “Java Server Programming Java EE5” Black Book, Dreamtech Press.3. Jack Franklin “Beginning Jquery” Apress. 4. References:5. Andrew Trolsen, 2007, ―C# and the .NET platform”, Second Edition, Dream tech

Press,6. M. Deitel, P.J. Deitel, A. B. Goldberg, ―2004, India Internet & World Wide Web

How to program ―, 3rd Edition, Pearson Education / PHI7. Chris Bates, 2006, ―Web Programming Building Internet Applications‖,3rd

edition, Wiley India8. Xue Bai et al, Thomson, 2003,‖The Web Warrior Guide to Web Programming”

Course learning Objectives:

At the end of the course student will learn/practice/ think/experience/appreciate:1. Design and implement of system softwares using C or C++.2. Design and implement of scanners using Lex tool.3. Design and implement of parser using Yacc tool.

Course outcomes:

At the end of the semester student should be able to:1. Implement the system softwares such as assembler, loader and linker etc using C

or C++.2. Design and write Lex program to implement lexical analyzer for given problem

statement.3. Design and write Yacc program to implement parser for the given structure

recognition.4. Modify the existing design of the algorithm of system softwares to enhance the

efficiency.

UNIT I (10 Hours)

Communication In The Workplace Role of Communication in Business, characteristics of communication, elements and Process of Communication, principles of communication, Objectives of Communications, Methods of Communication (verbal and Non-Verbal), Media and Mode of Communication, Channels of Communication, Barriers to communication, Exercises.

UNIT II (10 Hours)

Writing For The Effect:Business Etiquette and need for effect, Conversational Style, You view, Point, Positive, Language, CourtesyListening:Introduction, meaning of listening, poor listening habits, types of listening, Effective and ineffective listening skills, Strategies for effective listening, payoffs of effective listening, barriers of effective listening, active and passive listening, role of listening in Leadership style.Business Presentation and Public Speaking:Presentations and Speeches, Exercises

BUSINESS COMMUNICATION AND TECHNICAL WRITING

Sub Code : UCS713H Credits : 03Hours/Week : 03 CIE MARKS : 50Total Hours : 40 SEE Marks : 50

UNIT III (10 Hours)

Constituents of Effective writing:Sentence Construction, Paragraph development, The art of condensation, ExercisesWritten forms of communication:Letters: Business letters, memos, Emails, Reports: Objectives, Characteristics of a report, Types of reports, importance of reports, Formats, Prewriting, Structure of reports, Writing the reports, Revising, editing and proof reading. ExercisesTechnical proposals: Definition, Purposes, types, Characteristics, Elements of structure, Evaluation, Exercises

UNIT IV (10 Hours)

Research paper, Dissertation and ThesisInstruction manuals and technical description: Instruction manuals, types of instructions, Writing instructions, user’s manuals, Technical description, Process description, Exercises.

Text Books:

1. Urmila Rai nad S,M Rai ,Business Communication, Himalaya Publishing House.(chapters 1-7)

2. Lesikar and Fatley , Basics Business communication Skills for Empowering the Internet Generation 10 th edition, Tata McGraw Hill edition,ISBN: 780070599758.(Chapter 4)

3. Meenakshi Raman and Sangeeta Sharma “Technical Communication Principles and practices”, Oxford University Press, ISBN13 9780195668049. (Chapters: 9-11, 13-17)

4. Meenakshi Raman and Prakash Singh “Business Communication”, Oxford University Press, ISBN13: 9780195676952. ( Chapter s 3-4)

MOBILE COMPUTING SYSTEMS



Student should able to Know the architecture of PCS Architecture with mobility support in wireless

networks. Explore the functions of GSM and GPRS Architecture Know the details of Third Generation mobile services and Mobile IP Explore Mobile Internet and Wireless Web issues Explore Mobile agents and process migration


Introduction :PCS Architecture, Cellular Telephony, cordless telehony and Low-ties PCS. Mobility management: Handoff, Rooming management. Rooming management under SS7. GSM system overview: GSM Architecture, Location tracking and call set up, Data services, GSM mobility managenent : GSM Location update , Mobility databases, Failure Restoration, VLR Identification algorithm, VRL Overflow control.


General packet radio services (GPRS): GPRS functional Groups, Architecture, GPRS network nodes, GPRS interfaces, GPRS procedures, Billing , Wireless application Protocol (WAP): WAP Gateway, WAP protocols, WAP UAprof and caching. Third Generation mobile services: W-CDMA and CDMA 2000. Improvements on core network, QoS in 3G, Wireless OS for 3G Handset, Third generation systems.


Cellular communication : In 3G, 3.5G, 4G. Wireless Networks: WLAN standards , Bluetouth, Hiper LAN, Wimax, Logical Mobility : Migrating processes, Physical mobility: Requirements for physical Mobility, Overview of IP4 and IPV6 , Mobile IP, Cellular IP, TCP for mobility, mobile data bases, Mobile handheld devices: Characteristics of PDAS, Palm OS, Windows CE, Nokia handhelds, Symbian OS.


Mobile Internet and Wireless Web: Web programming model, WAP programming model, WAP protocol stack, WAP gateway, Mobile Agents, Characterstics of mobile agents, Requirements for mobile agent systems, Mobile agents plateforms : Aglet ,Aglet Tcl, PMADE, security issuess in mobileComputing: Security threats to wireless networks, IEEE 802.11 security through WEP.TEXTBOOKS:

1. Yi-Bing Lin, Imrich chlamtac “Wireless and mobile network architectures” Wiley2. Kumkum harg “Mobile computing : Theory & Practice” pearson Education India.

REFERENCES:

1. Dr. Ashok Talukder, Ms Roopa Yavagal, Mr. Hasan Ahmed: “ Mobile Computing, Technology, Applications and Service Creation” 2d Edition, Tata McGraw Hill, 2010

2. Martyn Mallik: “Mobile and Wireless Design Essentials” Wiley, 20033. Raj kamal: Mobile Computing, Oxford University Press, 2007.4. Iti Saha Misra: Wireless Communications and Networks, 3G and Beyond, Tata

McGraw Hill, 2009.

Computer Networks Security


Course outcomesAt the end of the course, the students will be able to

1) Identity and analyze the existing security vulnerabilities, services and mechanisms in a computer network and develop a security model to prevent, detect and recover from the attacks.

2) Illustrate the basic concept of encryption and decryption for secure data transmission and apply them

3) Analyze and compare various cryptography techniques, authentication and key management protocols

4) Explain the services and mechanisms employed at the different layers of the OSI to provide security.

5) Evaluate the existing computing systems and propose new strategies to secure data communication.

UNIT- I (10 Hours)Symmetric Ciphers: Overview: Services, Mechanisms and Attacks, The OSI Security Architecture, A Model of Network Security. Classical Encryption Techniques: Symmetric Cipher Model, Substitution Techniques, Transposition Techniques, Rotor Machines, Steganography. Block Cipher and the Data Encryption Standard: Simplified DES, Block Cipher Principles.

UNIT- II (10 Hours)The Data Encryption Standard: The Strength of DES, Differential and Linear Cryptanalysis. Symmetric Ciphers: Triple DES, Blowfish. Confidentiality Using Conventional Encryption: Placement of Encryption Function, Traffic Confidentiality, Key Distribution, Random Number Generation. Public-Key Encryption, Digital signatures and Authentication Protocols: Number Theory: Prime Numbers, Format’s and Euler's Theorems, Testing for Primality. Public-Key Cryptography and RSA: Principles of Public Key Cryptosystems, The RSA Algorithm, Key Management, Diffie Hellman Key Exchange.

UNIT- III (10 Hours)Message Authentication: Authentication Requirements, Authentication Functions, Message Authentication Codes, MDS Message Digest Algorithm. Digital Signatures and Authentication Protocols: Digital Signatures, Authentication Protocols, Digital Signature Standard. Network Security: Authentication Applications: Kerberos, XS09 Directory Authentication Service. Electronic Mail Security: Pretty Good Privacy.

UNIT –IV (10 Hours)IP Security: Overview, IP Security Architecture, Authentication Header, Encapsulation Security Payload. Web Security: Web Security Requirements, Secure Sockets Layer and Transport Layer Security, Secure Electronic Transaction.

Text book:

1. William Stallings, Cryptography and Network Security

UCS050E OPERATIONS RESEARCH 3 CREDITS

Hrs/Week: 3 CIE Marks: 50

Total Hrs.: 40 SEE Marks: 50

UNIT - I

10 Hours

Introduction, Linear Programming Introduction: The origin, nature and impact of OR; Defining the problem and gathering data; Formulating a mathematical model; Deriving solutions from the model; Testing the model; Implementation.

Introduction to Linear Programming: Prototype example; The linear programming (LP)model.

Assumptions of LP: Additional example. The essence of simplex method; setting up the simplex method;Algebra of the simplex method; The simplex method in tabular form;Tie breaking in the simplex method.

UNIT - II

10 Hours

Simplex Method (continued): Assumptions of LP; Additional examples.The essence of the simplex method; Setting up the simplex method; Algebra of the simplex method; The simplex method in tabular form; Tie breaking in the simplex method. Post optimality analysis.The revised simplex method, a fundamental insight. The essence of duality theory; Economic interpretation of duality. Primal dual relationship.

UNIT III

10 Hours

Transportation and Assignment Problems :The transportation problem; A streamlined simplex method for the transportation problem; The assignment problem; A special algorithm for the assignment problem.

Network Optimization models: Prototype example, terminology of network, shortest path problem, Minimum cost flow problem, Network model for projects—critical path.

UNIT IV

10 Hours

Game Theory, Decision Analysis: Game Theory: The formulation of two persons, zero sum games; Solving simple games- a prototype example; Games with mixed strategies; Graphical solution procedure; Solving by linear programming, Extensions. Decision Analysis: A prototype example; Decision making without experimentation; Decision making with experimentation; Decision trees.

Text Books

1. Frederick S. Hillier and Gerald J. Lieberman: 2005,Introduction to Operations Research, 8th Edition, Tata McGraw Hill.

Reference Books

1. Wayne L. Winston, 2003, Operations Research Applications and Algorithms, 4th Edition, Thomson Course Technology.

2. Hamdy A Taha, 2007, Operations Research, An Introduction, 8th Edition, Prentice Hall India.

WEB PROGRAMMING LABORATORY


Course Outcome: 1. Implement static web pages using basic concepts of web programming2. Implement dynamic web pages using basic concepts of web programming3. Demonstrate 2-tier dynamic web pages using mysql and jstl,jsp4. Design and implement real time web applications.

LAB ASSIGNMENT LIST

1. Develop a XHTML document to create bio-data using external style sheet, ordered list, table, borders, padding, color and the <span> tag.

2. A) Develop a XHTML file that includes JavaScript for the following problems: Input: percentage marks of the student Output: Display result.

B) Develop and demonstrate, using JavaScript, a XHTML document that collects the USN ( the valid format is: A digit from 1 to 4 followed by two upper-case characters followed by two digits followed by two upper-case characters followed by three digits; no embedded spaces allowed) of the user. Event handler must be included for the form element that collects this information to validate the input. Messages in the alert dialog box must be produced when errors are detected.

3. Write a XHTML form for Employee information like Emp_id, Name, Department Name, Phone, Email check the validation for each fields(the first character of Emp_id is followed by number ,name should accept 20 characters, Phone max 8 digits, email) using event handler in JavaScript.

4. Develop and demonstrate, using JavaScript, a XHTML document that contains three short paragraphs of text, stacked on top of each other, with only enough of each showing so that the mouse cursor can be placed over some part of them. When the cursor is placed over the exposed part of any paragraph, it should rise to the top to become completely visible.

5. Develop and demonstrate, using JavaScript, a XHTML that changes the content of XHTML elements by assisting to a user filling out a form associated with text area, called a help box. The content of help box can change, depending on the placement of the mouse cursor. When a cursor is placed over particular input field, the help box can display advice on how field is to be filled.

6. Write an XML file which will display the student information which includes the following:

a. USNb. Name of student c. Banchd. CGPA

Make up sample data for 3 students. Write a Document Type Definition (DTD) to validate the above XML file. Display the XML file as follows. The contents should be displayed in a table. Use XML and CSS for the above purpose.

7. Write program using XSLT and XML for displaying student details based on ranking of CGPA

8. Create a XHTML document which allows user to select the course. Once user selects course, it should display course id,course name,course description information using jsp and javabean.

9. Create a form with Name, USN, three test marks text fields. On submitting, store the values in database table along with total marks scored. Retrieve and display the database (Using Java Server Program). . Event handler must be included for the form element that collects every information to validate the input. Messages in the alert dialog box must be produced when errors are detected.

10. Write dynamic XHTML document to list student names from database and search for a particular student details using JSP.

11. Write a program to demonstrate EJB.


1. Design the models for real world applications using UML diagrams.2. Implement the applications using JAVA programming language.3. Trace the behavior and analyze how various scenarios play out.4. Describe a set of object oriented concepts and language independent graphical

notation that can be used to analyze problem requirements.5. Use UML as communication and modeling tool.

ASSIGNMENTS Analyze and design the following Systems with all specifications using the UML diagrams 1. Class Diagram ii) Usecase Diagram iii) Sequence diagram 2. State Chart Diagram v) Activity Diagram

Note: Make appropriate assumptions wherever required.

1. PASSPORT AUTOMATION SYSTEM PROBLEM STATEMENT:Passport Automation System is used in the effective dispatch of passport to all of the applicants. This system adopts a comprehensive approach to minimize the manual work and schedule resources, time in a cogent manner. The core of the system is to get the online registration form (with details such as name, address etc.,) filled by the applicant whose testament is verified for its genuineness by the Passport Automation System with respect to the already existing information in the database. This forms the first and foremost step in the processing of passport application. After the first round of verification done by the system, the information is in turn forwarded to the regional administrator's (Ministry of External Affairs) office. The application is then processed manually based on the report given by the system, and any forfeiting identified can make the applicant liable to penalty as per the law. The system also provides the applicant the list of available dates for appointment to 'document verification' in the administrator's office, from which they can select one. The system forwards the necessary details to the police for its separate verification whose report is then presented to the administrator. The administrator will be provided with an option to display the current status of application to the applicant, which they can view in their online interface. After all the necessary criteria have been met, the original information is added to the database and the passport is sent to the applicant.

2. HOSPITAL MANAGEMENT SYSTEM PROBLEM STATEMENT:In hospital, there are many departments like Orthopedic, Pathology, Emergency, Dental, Gynecology, Anesthetics, I.C.U., Blood Bank, Operation Theater, Laboratory,

OBJECT ORIENTED MODELING AND DESIGN LABORATORY


M.R.I., Neurology, Cardiology, Cancer Department, Corpse, etc. There is an OPD where patients come and get a card (that is, entry card of the patient) for check up from the concerned doctor. After making entry in the card, they go to the concerned doctor’s room and the doctor checks up their ailments. According to the ailments, the doctor either prescribes medicine or admits the patient in the concerned department. The patient may choose either private or general room according to his/her need. But before getting admission in the hospital, the patient has to fullfill certain formalities of the hospital like room charges, etc. After the treatment is completed, the doctor discharges the patient. Before discharging from the hospital, the patient again has to complete certain formalities of the hospital like balance charges, test charges, operation charges (if any), blood charges, doctors’ charges, etc. Next we talk about the doctors of the hospital. There are two types of the doctors in the hospital, namely, regular doctors and call on doctors. Regular doctors are those doctors who come to the hospital daily. Calls on doctors are those doctors who are called by the hospital if the concerned doctor is not available.

3. AIR TRANSPORTATION SYSTEM PROBLEM STATEMENT:Consider the air transportation system. Many flights land and depart from city’s airport. Some of the big cities may have more than one airports. Every flight belongs to specific airline. The planes may have many flights to different airports. Each plane is identified with serial number and model. There are specific pilots for each airline and they fly many flights. Each flight is identified by flight number and date on which flight is scheduled. The passenger reserves a seat for a flight. The seat is identified by a location.

4. RAILWAY MANAGEMENT SYSTEM PROBLEM STATEMENT:Passengers can book their tickets for the train in which seats are available. For this, passenger has to provide the desired train number and the date for which ticket is to be booked. Before booking a ticket for a passenger, the validity of train number and booking date is checked. Once the train number and booking date are validated, it is checked whether the seat is available. If yes, the ticket is booked with confirm status and corresponding ticket ID is generated which is stored along with other details of the passenger. After all the available tickets are booked, certain numbers of tickets are booked with waiting status. If waiting lot is also finished, then tickets are not booked and a message of non‐availability of seats is displayed. The ticket once booked can be cancelled at any time. For this, the passenger has to provide the ticket ID (the unique key). The ticket ID is searched and the corresponding record is deleted. With this, the first ticket with waiting status also gets confirmed.

5. BANK MANAGEMENT SYSTEM PROBLEM STATEMENT:Bank has many branches, each of which has an address and a branch number. A customer opens accounts at a branch. Each account is uniquely identified by an account number, it has a balance and a credit or overdraft limit. There are many types of accounts including acurrent account and savings account. Bank provides services which include taking deposit from their customers, issuing current and savings account to the individuals and business. Extending loans to individuals and business, cashing cheque. Facilitating money Transactions such as withdraw and deposit.

6. HOTEL MANAGEMENT SYSTEM PROBLEM STATEMENT:In the Hotel, booking for rooms is done through phone calls or through visit to the hotel booking office. The guest’s personal details such as Name, Age, Nationality, and Duration of stay, are input during booking in. The booking office orders for preparation of the guest’s room before his/ her check in date. The documents are transferred manually to the filling department for compilation of the guest’s file. On the reporting date the file is transferred to the reception. On checking in the guest is given the key to his allocated room, he also specify if he needs room service. The receptionist hands over the guest’s file to the accountant on the next table. Here the guest pays accommodation and meals fee. The guest’s file is updated on daily basis of his expenditure costs. The accounts department generates the bills on daily basis and delivered to the guests in their rooms at dusk by the service maids. The guest pays at the accounts desk, where the receipts are generated. For a one meal customer the bill is generated immediately after ordering and he pays at the accountant desk before leaving. During checking out of guests, their expenditure outlines are generated a day before check out date. The guests receive their outlines at the accounts desk as they check out, where they pay for bills balances if any.

7. CINEMA THEATRE MANAGEMENT SYSTEM PROBLEM STATEMENT:An administrator of theatre provides number of tickets to each theatre. Each ticket has ticket number, price. The Administrator manages the operations of the entire theatre. Each theatre has number of seats, theatre id, theatre name, theatre location and staff. Every seat has a seat id and seat name. Customer buys the tickets for a movie (which has details like movie id, movie name, release date, language, director and actor) from the ticket counter. Each movie has different shows which have been scheduled (showid, starttime, endtime) at particular times.

8. BOOK STALL MANAGEMENT SYSTEM PROBLEM STATEMENT:The book shop contains different types of books of various subjects with various quality according to the customer’s needs and requirement. The main thing of the book shop is to maintain lot of records for the daily transactions of the business. It is necessary for every business to maintain all following records which show the profit and loss of the business. Following are some of the inputs to the Book Shop.Book Details, Customer Details, Sales details, employee/Owner Details Following are some of the outputs of the Book Shop. Customer bill receipt, Sales report, Stock Report and customer report. Books are represented by, ISBN, Title, Author, Publisher, Edition, Year of Publication and Price. Customers will request books based on categories. Customers can buy books and receive the receipt from a shop employee/Owner. The store has records of number of copies of the books left in stock. Out of stock books cannot be purchased immediately, but can be ordered. Employee/Owner of the bookstore can give requisition for buying of books to publishers based on the amount of stock remaining. For each book the employee/owner maintains a stock which is at least the number of copies of the book sold over last 3 months. Books ordered by some customer are immediately requisitioned. Requisitions are recorded. The publishers inspect the requisition on the 1st of every month and immediately supply the books.

9. SUPERMARKET ADMINISTRATION AND MANAGEMENT SYSTEM PROBLEM STATEMENT:Our supermarket management system, a form of grocery store, is a self-service store offering a wide variety of food and household merchandise, organized into departments. We have updated Super Market management System Detailed products, it helps the store keeper to keep records of sold out and intake products details, advanced feature of bar-coding verifications and billing system to the customers. This system is based on the sales transaction of items in a supermarket. The first activity is based on adding the items to the system along with the rate which are present in the supermarket and the name of the items which the supermarket will agree to sell. This authority is given only to admin. Any modifications to be done in the item name or in the rate can be done only by admin. He also has the right to remove any item. As the customer buys the products and comes to the billing counter, the user is supposed to enter the item name he purchased and the quantity of the item he wanted to purchase. The system will display all the items whose name starts with the letter selected by the user. He can select out of those displayed. Finally a separate bill will be generated for each customer. Any periodic records can be viewed at any time. If the stock is not available; the supermarket orders and buys from a prescribed vendor.

10. LIBRARY MANAGEMENT SYSTEM PROBLEM STATEMENT:The case study titled Library Management System is for the purpose of monitoring and controlling the transactions in a library. This case study gives us the complete information about the library and the daily transactions done in a Library. The following are the brief description on the functions achieved through this case study: End-Users: •Librarian: To maintain and update the records and also to cater the needs of the users. •Reader: Need books to read and also places various requests to the librarian. •Vendor: To provide and meet the requirement of the prescribed books. The following functionalities are required for library management system:1. Maintain the record of new books and retrieve the details of books available in the library.2. Adding new member, new books.3. Searching books and members.4. Issue of books: • A member should be able to issue books. • Each member can issue only a single book. • The Librarian will note the date of issue and calculates the date of return. • The due date for the return of the book is stamped on the book.5. Return of books: • Any person can return the issued books {if they have the member code). • The due date is verified and fine is calculated if applicable.

PROJECT PHASE –I

Sub Code : UCS716P Credits : 04Hours/Week : 4 hours CIE MARKS : 50Exam Hours : 3 hours SEE Marks : 50

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

1. Review the current state of Art and trends in their area of interest and identify a suitable problem in their chosen subject domain with justification.

2. Survey the available research literature/documents for the tools and techniques to be used.

3. Examine the functional, non-functional, and performance requirements of their chosen problem definition.

Students are expected to submit the list of group members for the project work with consent of the guide. The students who are submitting the list without guide consent for them department will allocate guides. The Phase I include

1. Deciding the broad area for project work2. Sufficient literature Survey (includes Research papers, technical reports, white

papers, manuals and survey reports).3. Identification of Issues and defining problem.4. A report containing summary of survey made covering issues and problem

definition with print outs of all literature documents.5. Submission and presentation of term paper by project team.6. A term paper is a research paper written by students over an academic term or

semester which accounts for a large amount of a grade and makes up much of the course. Term papers are generally intended to describe an event or concept or argue a point. There is much overlap between the terms "research paper" and "term paper". The phrase "term paper" was originally used to describe a paper (usually a research based paper) that was due at the end of the "term" - either a semester or quarter, depending on which unit of measure a school used. Common usage has "term paper" and "research paper" as interchangeable, but this is not completely accurate. Not all term papers involve academic research, and not all research papers are term papers.

Project Phase I Evaluation:

Survey Report Evaluation : 50 Marks (By Guide) Term Paper Evaluation : 50 Marks(By Departmental Project Evaluation Committee

(DPEC) including Guide)

http://en.wikipedia.org/wiki/Academic_term

http://en.wikipedia.org/wiki/Students




Sl.No Subject Code Subjects Hrs/Week C CIE *SEE TotalL T P

1 elective – 8 3 0 0 3 50 50 100

2 elective – 9 3 0 0 3 50 50 100elective – 10 3 0 0 3 50 50 100

3 UCS812P Project Phase-II 0 5 10 15 50 50 100

4 UCS813S Seminar 0 2 0 1 50 50 100

9 7 10 25 250 250 500


UCS062ECLOUD COMPUTING

3 CREDITSHours/Weeks: 03 CIE Marks: 50Total Hours: 40 SEE Marks: 50

Course Outcome:

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

1. Understand the definition of cloud computing, its advantages, characteristics, challenges and platforms.

2. Describe cloud computing architecture, reference model, types of cloud, service models with respect to all service models etc.

3. Deploy cloud instances in Aneka cloud computing platform and threading programming of Aneka.

4. Analyze virtualization technology, Cloud Platforms in Industry and High Throughput and Data Intensive Computing, etc.

5. Evaluate the security related to multi-tenancy and appraise compliance issues that arise from cloud computing.

Unit-I(10 Hours)

Introduction: Cloud Computing at a Glance, Historical Development, Characteristics of Cloud Computing, Building Cloud Computing Environments, Computing Platforms and Technologies.

Cloud Computing Architecture: Introduction, Cloud Reference Model, Types of Clouds, Economics of Cloud, Open Challenges.

Unit- II(10 Hours)

Aneka: Cloud Application Platform: Framework Overview, Anatomy of the Aneka Container, Building Aneka Clouds, Cloud Computing and Management.

Concurrent Computing: Thread Programming: Introducing Parallelism for Single Machine Computation, Programming Application with Threads, Multi Applications with Threads, Multithreading with Aneka, Programming Applications with Aneka Threads.

Unit- III(10 Hours)

Virtualization: Introduction and Characteristics of Virtualized Environments, Taxonomy of Virtualization Techniques, Virtualization and Cloud Computing. Pros and Cons of Virtualization, Technology Examples.

Cloud Platforms in Industry: Amazon Web Services, Google AppEngine, Microsoft Azure.

Cloud Applications: Scientific Applications, Business and Consumer Applications.

Unit- IV(10 Hours)

High Throughput Computing: Task Programming: Task Computing, Task-based Application Models, Aneka Task-Based Programming.

Data Intensive Computing: Map- Reduce Programming: What is Data-Intensive Computing? Technologies for Data-Intensive Computing, Aneka Map Reduce Programming.

Text Books:

1. Mastering Cloud Computing by Rajkumar Buyya, Christian Vecchiola, S. Thamarai Selvi, McGraw Hill Education (India) Private Limited.

Reference Book:

1. Cloud Computing by Barrie Sosinsky, Bible, Wiley India.2. Cloud Computing by Kumar Saurabh, Second Edition, Wiley India.

Big Data AnalyticsSub Code : UCS063E Credits : 3



Course Outcomes:At the end of the course, student should be able to:

1) List the concepts tools and technologies for big data analytics.2) Explain the big data and analytics concepts and tools and technologies used for it.3) Apply the MongoDB, Hive and Pig query language to solve the given problems.4) Investigate the given real time scenario and use suitable techniques to extract insights from

the data.5) Design a solution for data analytics problems by combining two or more analytics and

techniques to enhance the value of the enterprise by extracting knowledge from the big data.

Unit- I 10 Hours

Types of digital data: Classification of digital data.Introduction to Big Data: Characteristics of Data, Evolution of Big Data, Definition and challenges of Big Data, Features and other Characteristics of Big Data, Reason for dealing with Big Data, Traditional Business Intelligence(BI) versus Big Data, A Typical Data Warehouse Environment, A Typical Hadoop Environment, Coexistence strategy, Changes in the Realms of Big Data. Big data analytics: Transformation of data, Definition and Sudden Hype Around Big Data Analytics, Classification of Analytics, Challenges in Businesses, Top Challenges Facing Big Data, Importance of Big Data Analytics, Technologies to Meet the Challenges Posed by Big Data, Data Science, Data Scientist, Terminologies Used in Big Data Environments, Basically Available Soft State Eventual Consistency (BASE), Few Top Analytics Tools.

Unit- II 10 Hours

The big data technology landscape: NoSQL (Not Only SQL), Hadoop. Introduction to Hadoop: Introducing Hadoop, significance of Hadoop, RDBMS versus Hadoop, Distributed Computing Challenges, History of Hadoop, Hadoop Overview, Use Case of Hadoop, Hadoop Distributors, HDFS (Hadoop Distributed File System), Processing Data with Hadoop, Managing Resources and Applications with Hadoop YARN (Yet another Resource Negotiator), Interacting with Hadoop Ecosystem.

Unit- III 10 Hours

Introduction to MongoDB: Definition and Features of MongoDB, Terms Used in RDBMS and MongoDB, Data Types in MongoDB, MongoDB Query Language.

Unit- IV 10 Hours

Hive: Definition and features of Hive, Hive Architecture, Hive Data Types, Hive File Format, HiveQuery Language (HQL), RCFile Implementation, SerDe, User-Defined Function (UDF). Pig: Pig and its features, The Anatomy of Pig, Pig on Hadoop, Pig Philosophy, Use Case for Pig: ETL Processing, Pig Latin Overview, Data Types in Pig, Running Pig, Execution Modes of Pig, HDFS Commands, Relational Operators, Eval Function, Complex Data Types, Piggy Bank, User-Defined Functions (UDF), Parameter Substitution, Diagnostic Operator, Word Count Example using Pig, uses of Pig, Pig versus Hive.

Text Book:

1. Big Data and Analytics, Seema Acharya and Subhashini Chellappan – Wiley India, First edition (rp) 2016.

Reference Books:

1. Frank J. Ohlhorst, “Big Data Analytics: Turning Big Data into Big Money”, Wiley India Pvt. Ltd., 2012.2. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, 2007.3. Paul Zikopoulos, Dirk deRoos, Krishnan Parasuraman, Thomas Deutsch , James Giles, David Corrigan, “Harness the Power of Big data – The big data platform”, McGraw Hill, 2013.

Internet of ThingsSub Code : UCS066E Credits : 3



Course outcomes

Having learnt this course learner should be able to

1. Interpret the impact and challenges posed by IoT networks leading to new architectural models. 2. Compare and contrast the deployment of smart objects and the technologies to connect

them to network. 3. Appraise the role of IoT protocols for efficient network communication. Elaborate the need

for Data Analytics and Security in IoT. 4. Illustrate different sensor technologies for sensing real world entities and identify the applications of IoT in Industry.5. Elaborate the need for Data Analytics and Security in IoT.

UNIT-I (10-Hours)

What is IoT, Genesis of IoT, IoT and Digitization, IoT Impact, Convergence of IT and IoT, IoT Challenges, IoT Network Architecture and Design, Drivers Behind New Network Architectures, Comparing IoT Architectures, A Simplified IoT Architecture, The Core IoT Functional Stack, IoT Data Management and Compute Stack. Smart Objects: The “Things” in IoT, Sensors, Actuators, and Smart Objects, Sensor Networks, Connecting Smart Objects, Communications Criteria, IoT Access Technologies.

UNIT-II(10-Hours)

IP as the IoT Network Layer, The Business Case for IP, The need for Optimization, Optimizing IP for IoT, Profiles and Compliances, Application Protocols for IoT, The Transport Layer, IoT Application Transport Methods. Data and Analytics for IoT, An Introduction to Data Analytics for IoT, Machine Learning, Big Data Analytics Tools and Technology, Edge Streaming Analytics, Network Analytics.

UNIT-III(10-Hours)

Securing IoT, A Brief History of OT Security, Common Challenges in OT Security, How IT and OT Security Practices an d Systems Vary, Formal Risk Analysis Structures: OCTAVE and FAIR,

The Phased Application of Security in an Operational Environment IoT Physical Devices and Endpoints - Arduino UNO: Introduction to Arduino, Arduino UNO, Installing the Software, Fundamentals of Arduino Programming. IoT Physical Devices and Endpoints - RaspberryPi: Introduction to RaspberryPi, About the RaspberryPi Board: Hardware Layout.

UNI- IV(10-Hours)

Operating Systems on RaspberryPi, Configuring RaspberryPi, Programming RaspberryPi with Python, Wireless Temperature Monitoring System Using Pi, DS18B20 Temperature Sensor, Connecting Raspberry Pi via SSH, Accessing Temperature from DS18B20 sensors, Remote access to RaspberryPi, Smart and Connected Cities, An IoT Strategy for Smarter Cities, Smart City IoT Architecture, Smart City Security Architecture, Smart City Use-Case Examples.

Text Books:

1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete,Robert Barton, Jerome Henry, "IoT Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of Things”, Edition, Pearson Education (Cisco Press Indian Reprint). (ISBN:978-9386873743)

2. Srinivasa K G, “Internet of Things”,CENGAGE Leaning India, 2017

Reference Books:

1. Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-on-Approach)”, 1st Edition, VPT, 2014. (ISBN:978-8173719547)

2. Raj Kamal, “Internet of Things: Architecture and Design Principles”,1st Edition, McGraw Hill Education, 2017. (ISBN: 978-9352605224)

UCS043E DATA MINING 3 CREDITSHrs/Week: 3 CIE Marks: 50 Total Hrs.: 40 SEE Marks: 50

Course outcomes At the end of the course, the students will be able to

Anticipate the issues related to data mining process, different data types and apply the preprocessing techniques to improve the data quality.

Apply the data mining techniques of clustering, classification, association finding and outlier analysis on the real world data

Display a comprehensive understanding of algorithms for data mining.

Evaluate the performance of different data-mining algorithms and select an efficient algorithm for solving complex problems.

Investigate application areas and current research directions in data mining.

UNIT – I 10 Hours

INTRODUCTION, DATA – 1: What is Data Mining? Motivating Challenges; The origins of data mining; Data Mining Tasks. Types of Data; Data Quality. DATA – 2: Data Preprocessing; Measures of Similarity and Dissimilarity

UNIT – II 10 Hours

CLASSIFICATION: Preliminaries; General approach to solving a classification problem; Decision tree induction; Rule-based classifier; Nearest-neighbor classifier. ASSOCIATION ANALYSIS – 1: Problem Definition; Frequent Itemset generation; Rule Generation; Compact representation of frequent itemsets; Alternative methods for generating frequent itemsets.

UNIT – III 10 Hours

ASSOCIATION ANALYSIS – 2: FP-Growth algorithm, Evaluation of association patterns; Effect of skewed support distribution; Sequential patterns. CLUSTER ANALYSIS: Overview, K-means, Agglomerative hierarchical clustering, DBSCAN, Overview of Cluster Evaluation.

UNIT – IV 10 Hours

FURTHER TOPICS IN DATA MINING: Multidimensional analysis and descriptive mining of complex data objects; Spatial data mining; Multimedia data mining; Text mining; Mining the WWW. Outlier analysis. APPLICATIONS: Data mining applications; Data mining system products and research prototypes; Additional themes on Data mining; Social impact of Data mining; Trends in Data mining.

TEXT BOOKS:

1. Pang-Ning Tan, Michael Steinbach, Vipin Kumar, 2007, Introduction to Data Mining, Pearson Education, 2. Jiawei Han and Micheline Kamber,2006, Data Mining – Concepts and Techniques, 2nd Edition, Morgan Kaufmann.

REFERENCE BOOK:

1. K. P. Soman, Shyam Diwakar, V. Ajay, 2006, Insight into Data Mining – Theory and Practice , PHI.

PROJECT PHASE II

Sub Code : UCS812P Credits : 15

Hours/Week : 10 hours CIE MARKS : 50

Exam Hours : 3 hours SEE Marks : 50

COURSE OBJECTIVES AND OUTCOMESCourse Outcomes (COs):At the end of the course, the students should be able to: 1. Review the current state of Art and trends in their area of interest and identify a suitable

problem in their chosen subject domain with justification. 2. Survey the available research literature/documents for the tools and techniques to be used. 3. Examine the functional, non-functional, and performance requirements of their chosen problem

definition. 4. Design system architecture and different components and develop all the system components

using appropriate tools and techniques. 5. Work effectively in a team and use good project management practices. 6. Defend the project work carried out in teams orally and in writing.

Developing the project plan Implementing the project Controlling, monitoring and evaluating the project Closing the project and reporting on the findings Develop all the project plans (implementation, risk, evaluation); Manage the project from implementation through to closure; Implement specific project strategies and activities; Evaluate the project; Collect and analyze project data; and Write up the final project report for the funding body.

Continuous Internal Evaluation Scheme:

Mid Semester Presentation /Demonstration : 15 MarksFinal Internal Presentation /Demonstration : 20 MarksReport Writing : 15 MarksSEE Evaluation: Presentation and Demonstration : 30 Marks Report Evaluation : 20 Marks

Note:1. Demonstration/Presentations are evaluated by the Departmental Project Evaluation Committee

(DPEC) comprising of Guide, HOD and Project Coordinator of the Department and reports are evaluated by the Guide.

2. In Semester End Examination (SEE) Project Work is evaluated jointly by Internal, External Examiners and HOD/Nominee.

SeminarSub Code : UCS813S Credits : 1Hours/Week : 2 hours CIE MARKS : 50Exam Hours : 3 hours SEE Marks : 50

Seminars are used as course delivery modes to encourage students to gather current trends in technology, research literature, and self-learn topics of their interest. Seminars require students to research a technical topic, make presentations and write a detailed document on their findings individually under the guidance of faculty.

Course outcomes (COs):

The student is expected to:1. Identify seminar topics based on contemporary technical, societal and environmental issues.2. Conduct literature survey on complex issues in the selected domain3. Explore advanced technologies4. Make good oral and written technical presentations

becbgk.edu ver-2… · Web viewB. V. V. Sangha’s. Basaveshwar Engineering College (Autonomous),...

Documents

Transcript of becbgk.edu ver-2… · Web viewB. V. V. Sangha’s. Basaveshwar Engineering College (Autonomous),...