Embed Size (px)
Citation preview
Basaveshwar Engineering College, Bagalkot
Department of computer Science and Engineering
Revised Scheme of teaching for (2015-16 and 2016-17 Admitted Batches)
3rd Semester B. E. (CSE)
Sl.NoSubject Code Subjects
Hrs/WeekC CIE SEE TotalL T P
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 UCS324CTheoretical Foundations of Computer Science 3 0 0 3 50 50 100
5 UCS315C Computer Organization 4 0 0 4 50 50 100
6 UCS316HEngineering 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 022 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 Evaluation SEE : Semester End Examination
Note: Diploma lateral entry students have to additionally register for EVS.
\
Basaveshwar Engineering College, Bagalkot
Department of computer Science and Engineering
Revised Scheme of teaching for (2015-16 and 2016-17 Admitted Batches)
4th Semester B. E. (CSE)
Sl.NoSubject Code Subjects
Hrs/Week
C 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 UCS416CObject Oriented Programmingwith C++ 4 0 0 4 50 50 100
7 UCS427LDatabase Application andVisualization Lab 0 1 3 2 50 50 100
8 UCS438LObject Oriented ProgrammingLab 0 0 2 1.5 50 50 100
9 UCS439L Microcontroller Lab 0 0 2 1.5 50 50 10010 UMA400M*Advanced Mathematics-II 4 0 0 0 50 50 100
22** 1 7 25 450 450 900
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.
UMA301C: ENGINEERING MATHEMATICS-III
4 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-INumerical 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 ofcontinuous and functions having finite number ofdiscontinuities, even and odd functions. Half-range series, practical harmonic analysis.
UNIT-III
Fourier 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 transforms
Calculus of Variations
UNIT-IV
Partial 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.
CS322C DATA STRUCTURES USING C 4 CREDITS
Hrs/Week: 04 CIE Marks: 50
Total Hrs: 48 SEE Marks: 50
Course Objectives:1.To make familiar with basic ’ C’ concepts
2. To make familiar with linear & non linear data structures in ‘C’
3. To develop skills to analyse the problem given and to design & develop an efficient solution to given problem
4. To develop capability to choose appropriate data structures for given problems
5. To imbibe programming skills & thereby making industry ready
Course Outcomes : After undergoing this course , student will 1. Have thorough knowledge about advanced C concepts such as Pointers,Structures, Unions,
Bitwise operators, Macro definitions, Command line arguments, Files etc
2. Have thorough knowledge about data structures
3. Ability to design& develop program using linear data structures& non linear data structures for solving problems
4. Ability to choose appropriate data structures for problem solving
5. Ability to use combination of these data structures for problem solving.
UNIT I 12 Hours
Pointers: Concepts, Pointer variables, Accessing variables through pointers, Pointer declarationand 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 compilationunits, 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, QueueLinked 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, Findvertex, Graph storage structures: Adjacency matrix, Adjacency list.
Text Books:
l 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)
l Behrouz A. Forouzan and Richard F. Gilberg, 2nd Edition, Cengage Learning Publisher, 2005. Data Structure A Pseudocode Approach with C, (Chapter 1(1.1-1.5), 2,3,4 (4.1-4.4), 5, 6(6.1-6.2 )7(7.1-7.3), 11)
Reference Books:
Basavraj S Anami, Shanmukhappa Angadi, Sunil Kumar S Manvi, PHI Publications, 2010. A Holistic approach to learning C.l
Andrew Tenanbaum, Thomson, 2005, Data Structures with C.l
Robert Kruse & Bruce Leung, Data Structures & Program Design in C,Pearson Education, 2007.
UCS313C DIGITAL SYSTEMS 4-CREDITS
Hrs/Week :04 CIE Marks:50
Total Hrs:48 SEE Marks:50
Course Objectives
The objective of the course is to bring knowledge of analyze, design, and evaluate digital circuits, of medium complexity, that are based on SSIs, MSIs, and programmable logic devices in students.
Course outcomes
At the end of the course the student should be able to ,
Explain about the working of various basic Digital elements involved in combinational and sequential circuits, Digital and Analog, Analog to Digital circuits.
Simplify the complex digital circuits using Boolean theorems and bring it to simplest possible low cost digital circuits by applying K-map, Quine McChliskey methods etc.
Design arthmetic circuits, code converters, multiplexers, comparator, registers, and counters using MSI digital IC’s available in the market.
Understand working and applications of Op-amps and also to design linear and non linear circuits, ADC, DAC.
UNIT-I 12 Hours
Boolean algebra and combinational networks:
Boolean algebra- Definition, principle of duality, Boolean algebra theorems, The two valued Boolean algebra Boolean formulas and functions- normal forms Canonical Formulas- Minterm canonical formula, m-notation, Maxterm Canonical formulas, M-notation Manipulation of Boolean formulas Gates and combinational networks Incomplete Boolean functions and don’t care conditions, Additional Boolean operations and gates, Introduction to HDL
Simplification of Boolean expressions:
Formulation of the Simplification problem Prime Implicants and Irredundant Disjunctive expressionsPrime implicates and Irredundant conjunctive expressions Karnaugh maps Using K-map to obtainminimal 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 forobtaining prime implicants/implicates Variable Entered K-map. Design of code converters, adder / substractor , multiplexer / demultiplexer , comparator and other circuits .
Logic Design with MSI components and programmable logic Devices:
Decimal Adders Comparators Decoders Encoders Multiplexers, PLDs, PROM, PLAs PALs , HDL implementation of data processing circuits.
UNIT-III 12 Hours
Flip-Flops and applications:
Basic bistable element Latches Master Slave Flip-Flops Edge Triggered Flip-Flops Characteristic equations Registers Counters Design of Synchronous Counters.,
Synchronous Sequential networks:
Structure and operation of clocked Synchronous sequential networks Analysis of clocked Synchronous sequential networks,HDL implementation of flipflops, registers and counters.
UNIT-IV 12 Hours
Op-Amps and D/A -A/D conversion: Introduction to operational amplifiers
Introduction, the operational amplifier, Block diagram representation of a typical Op-Amp, Interpreting a typical set of data sheets,The Ideal Op-Amps,Equivalent Circuits of an Op-Amps,Ideal Voltage Transfer curve,Open Loop Op-Ams Configurations,Summing,Scaling,Average Amplifiers,
Analog to digital converters and Digital to analog converters,
Variable resistor networks, Binary Ladders D/A Converters, D/A Accuracy and resolution. A/D Converter– Simultaneous conversion, A/D Converter – Counter Method.
Text Books
1. D.D. Givone, 2002, ‘Digital Principles and design’, TMH.(3.1 to 3.9, 4.1 to 4.6, 4.8, 4.11, 4.14-1 to 4.14-3, 5.1-1, 5.1-2, 5.2 to 5.10,to 6.9, 7.1, 7.2)2. Ramakant A. Gayakwad, 2008, ‘Op-Amps and Linear Integrated Circuits’, 4th Edition, PHI.(1.1 to 1.3, 2.2 to 2.6, 6.5, 8.11-1 and 8.11-2)
3. Malvino, Leach and Saha ‘Digital Principles and applications’, 6th Edition, 2007, TMH, ( 2.5, 3.11, 4.14, 6.12, 8.12, 9.7, 10.9, 12.1 to 12.6)
Reference Book:
1) R.D.Sudhakar Samuel, Logic Design - a simplified appraoch revised Edition, 2005, Sanguine Technical Publications.
UCS324C THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE 3-CREDITS
Hours/Week: 03 CIE MARKS: 50
Total Hours: 40 SEE Marks: 50
Course Learning Objectives:
At the end of the course, the student will be able to
1) Reason mathematically about basic data types and structures.2) Apply the techniques of discrete methods and combinatorial reasoning to solve the
problems.3) Apply various tools to the areas of data structures, theory of computer languages and
analysis of algorithms.4) Represent the real-world problems in the form of graphs and solve them.5) Apply Techniques for constructing mathematical proofs, illustrated by discrete
mathematical examples.
Course Outcomes:
Student will be able to:
1) Use logical notation to define and reason about fundamental mathematical concepts such as sets, relations and functions.
2) Evaluate elementary mathematical arguments and identify fallacious reasoning.3) Prove elementary properties of modular arithmetic and explain their applications in
computer science.4) Apply Graph theory models of data structures and state machines to solve problems on
connectivity and constraint satisfaction, for example, scheduling.5) Calculate number of possible outcomes of elementary combinatorial processes such as
permutations and combinations.
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 TwoGraphs.
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:50
Total Hrs:48 SEE Marks:50
Course Objectives:
1. To demonstrate the design and function of the various units of digital computers2. To write assembly language programs3. To analyze the execution of program4. To assess the performance of the computer
Course learning Outcomes:
At the end of the course students are able to:
1. Explain the basic organization of the digital computer and functions of processor, memory and I/O devices 2. Choose Data representation and instructions 3. Analyze the functions of various units of digital computer 4. Evaluate the performance of the digital Computer 5. Develop an assembly programs 6. Design the schematic diagram to implement 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 to4.5.2, 4.6 , 4.7, 5.1 to 5.3, 5.9, 6.1 to 6.7, 7.1 to 7.4, 7.5.1 to 7.5.4, 1.6)
Reference Books
1. J.P. Hayes , 1998, ’Computer Architecture and Organization ‘ , Third Edition, MGH.2. William Stallings, 2007 ‘Computer Organization and Architecture’, 7th Edition, PHI.
UCS316H ENGINEERING TECHNOLOGY AND MANAGEMENT 3-CREDITS
Hours/Week: 03 CIE Marks: 50
Total Hours: 40 SEE Marks: 50
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:
Students will demonstrate an understanding of the concept of Engineering Management and system theory.
Students will demonstrate the ability to analyze management functions and time management.
Students will demonstrate an understanding of planning and organization maintenance.
At the end of the course, the student will be able to:
1. Analyze the roles played by different levels of managers.2. Organize the activities required to complete the projects
3. Describe the importance of groups to perform the assigned tasks effectively and efficiently and methodology of group management.
4. Explain the R& D project selection process.
5. Estimate the financial profits/losses gained in the projects.
UNIT-I 10 Hours
Engineering and Management: Introduction, Definitions of Engineering and management. 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:
6. Daniel L. Babcock and Lucy C. Morse, Managing Engineering and Technology, Prentice-Hall of India Private Limited, 2005, New Delhi, Third Edition.
Reference books:
1. Harold Koontz and Weihrich, Tata McGraw-Hill, 1998, Essentials of Management.
2. Don Hellrigel, John W. Slocum Jr. Addition-Wesley Publishing Company, 1991, Singapore ,Management, 6th Edition.
3. James A. F. Stonner, Second Edition, Prentice-Hall of India Private Limited, New Delhi,Management.
4. V. S. Bagad, Technical Publications, Pune, Engineering and Technology Management, Joseph L. Massie, Fourth Edition, Prentice-Hall of India, Pearson, 2003, Essentials of Management
UCS317L DIGITAL SYSTEMS LABORATORY 1.5-CREDITS
Hours/Week: 03 CIE Marks: 50
SEE Marks: 50
Course Objectives.
To reinforce learning in the accompanying this course through hands-on experience with design, construction, and implementation of digital circuits.
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.
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:
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.
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 Objectives and Outcomes
Course Objectives: Student should be
1. Able to design & develop program for given problem using advanced features of C
2 .Able to design & develop solutions using linear data structures.
3. Able to design & develop solutions using nonlinear data structures.
4. Able to define appropriate& efficient data structures for solving problems
Course Outcomes:Student is
1. Able to design & develop program for given problem using advanced features of C
2 .Able to design & develop solutions using linear data structures.
3. Able to design & develop solutions using nonlinear data structures.
4. Able to define appropriate& efficient data structures for solving problems
1.
a) Write a C program to hold information about the students like roll_no, name, usno, and stay (hostelite /localite). In addition for hostelites room_no, mess_id and for localites their residence address are to be stored. Use array of structures nested as specified below. Write function to display the list of hostelites and localites separately.
(hint : structure hostel : mess_id, room_no union stay_inf : hostel, residence address
structure student: roll_no, name, usno, an integer to indicate an hostelite or localite, stay_inf).
b) Write a C program to hold the details of the students like name, usno, rollno and marks in three subjects.Compute average for each student. Use array of pointers to structures and dynamic memory concept. Also provide function to sort the array of pointers based on average marks computed.
(hint: structure student: name, rollno, usno, marks [3] array class : student * class [ ]
use malloc to allocate space for each student structure).
2
a) Write a C program to store 2d ragged array use calloc function to allocate memory for array. The no ofrows and column size of each row must be tailored to the needs of the user. Provide functions to load, display and retrieve specific element from the array.
(hint: for ragged array(uneven column size)representation using dynamic memory refer to ‘A Structuredprogramming approach using C ‘ by Forouzan, page no:497, int ** table : pointer to array of pointerswith each cell of an array holding starting address of a row. Each row contains size of the row as its first element.
For Ex, following diagram depicts the data structure for a 2d ragged array of 3 rows with sizes 3, 5, 4 respectively.)
Column Size
table
3 1 3 4
5 1 6 2 7 6
4 2 3 4 7
b) Write a C program to hold names of several cities using 2d array. Use pointer to 2d array to displayindividual cities and last character of the city.
(hint : array : int table [ ] [ ] pointer : int ** ptable=table).
3
a) Write a C program to create a text file. Provide functions to perform the following.i) Tokenize the text (hint: tokens are words delimited by whitespace. use strtok)
ii) Place the words containing vowels and not containing vowels into two different files whose names are fed as command line arguments.
iii) Search for a particular word and display the message (exists or do not exists) accordingly.
b) Write a program to perform the following on a binary file (use functions).
i) Create a file containing students information like rollno, name, usnoii) Display the file contents in reverse orderiii) Determine nth student record details.
iv) Search for a given student based on usno and accordingly allow to modify the file contents.
4
a) Write recursive functions to find all occurrences of a substring in a string.
b) Check recursively if the following objects are palindromes.i) Words ii) Sentences (ignoring punctuation, blank, uppercase & lowercase)
5
a) Write a C program to implement two stacks using only one array. Your stack routines should not declarean overflow unless every cell in the array is used.
(hint: use two ends of array as base of two stacks so that they grow in opposite direction and declares stack full only when top of stack 1 meets top of stack 2)
b) Write a C program to convert prefix expression to postfix.(hint: use stack)
6
a) Write a C program to implement dequeue using array. Provide routines remvleft,remvright,insertleft andinsert right to remove and insert at left and right ends of a dequeue.Also write routines to test for queue full and queue empty.
(dequeue is double ended queue were insertion and deletion takes at either end)
b) Write a C program to implement priority queue with 3 priorities high, medium and low for customerswith cust_id and number_of_ items purchased. Write C functions to insert, delete and to test for queue empty and queue full conditions.
7
a) Write a C program to add two polynomials of 3 variables x, y, z using singly linked list. (hint: accept the terms as quadruple containing coefficient followed by degree of (x, y, z))
b) Write a C program to perform the following on doubly linked list with each node containing one integer field.
i) Function to create doubly linked list. ii) Functions to compute L1 L2 and L1 L2 where L1
& L2 are two doubly linked list iii) function to display list.
8
a) Write a C program to sort the vertices of given graph G in the non-decreasing order of degrees use adjacency matrix representation of the graph and insertion sort technique.
b) Write a C program that accepts a pointer to a binary tree and returns a pointer to a
new binary tree that is the mirror image of first.
9
a) Using selection sort technique sort the array of pointers using C program, so that the numbers can beaccessed in non-decreasing order. Do not modify the array containing the numbers.
b) Write a C program to read the ten different names and sort them using bubble sort in non-increasingorder.
Note: The list of problems is an indicative list only
UMA401C: ENGINEERING MATHEMATICS-IV
4 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
3. to solve Engineering problems using complex variable techniques.4. to evaluate the line integrals of a complex valued function.5. to apply series solution of Bessel’s and Legendre’s differential equations for BVP arising in
cylindrical and spherical coordinate system respectively.6. to apply the least square sense method to construct the specific relation for the given group
of data. 7. to apply the concept of probability to find the physical significance of various distribution
phenomena.
UNIT-I
Complex Variables: 13 Hours
Analytic 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 Hours 13 Hours
Curve 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 Hours
Resources:3. Higher Engineering Mathematics by Dr. B.S. Grewal, Khanna Publishers, New Delhi.4. Theory and problems of probability by Seymour Lipschutz (Schaum’s Series).5. Advanced Engineering Mathematics by H. K. Dass6. Advanced Engineering Mathematics by E Kreyszig ( John Wiley & Sons)7. Probability and stochastic processes by Roy D. Yates and David J. Goodman, wiley India pvt.ltd 2 nd
edition 2012.8. A first course in Complex analysis with applications by Dennis G. zill Patrick D shanahan, 2nd edition
2010.
2, ,xy a bx y ab y a bx cx=+ = =+ +
9. Advanced Engineering Mathematics by Peter V. O’Neil.
Question paper pattern for SEE5. Total of eight questions with two from each unit to be set uniformly covering the entire
syllabus. 6. Each question should not have more than four subdivisions. 7. Any five full questions are to be answered choosing at least one from each unit.
UCS412C DATABASE MANAGEMENT SYSTEMS 4 CREDITS
Hours/Week: 04 CIE MARKS: 50
Total Hours: 48 SEE Marks: 50
Course Objectives: The objective of the course is to:
1. Introduction to database management systems.2. Design a database for a given application.3. Implement database queries based on given requirements.4. Introduction to concurrency control system.
Learning Outcomes: Upon successful completion of this course, students should be able to:
• Describe the fundamental elements of relational database management systems
• Explain the basic concepts of relational data model, entity-relationship model, relational database design, relational algebra and SQL.
• Design ER-models to represent simple database application scenarios
• Convert the ER-model to relational tables, populate relational database and formulate SQL queries on data.
• Improve the database design by normalization.
UNIT-I
Introduction and Entity-Relationship Model 12 Hrs
Introduction; An example; Characteristics of Database approach; People who work with databases; Advantages of using DBMS approach; when not to use a DBMS. Data models, schemas and instances; Three-schema architecture and data independence; Database languages and interfaces; The database system environment; Classification of Database Management systems. Using High-Level Conceptual Data Models for Database Design; An Example Database Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship Sets, Roles and Structural Constraints; Weak Entity Types; Refining the ER Design for COMPANY database; ER Diagrams, Naming Conventions and Design Issues; Relationship types of degree higher than two.
UNIT-II
Relational Model and Relational Algebra 12 Hrs
Relational Model Concepts; Relational Model Constraints and Relational Database Schemas; Update Operations, Transactions and dealing with constraint violations; Unary Relational Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary Relational Operations : JOIN and DIVISION; Additional Relational Operations; Examples of Queries in Relational Algebra; Relational Database Design using ER- to-Relational Mapping.
SQL-The Relational Database Standard:
SQL Data Definition and Data. Types, Specifying Basic Constraints in SQL, Schema Change Statements in SQL; Basic Queries in SQL; More Complex SQL Queries; Additional Features of SQL; Views (Virtual Tables) in SQL, Cursors, Triggers and PL/SQL Programming
UNIT-III 12 Hrs
Database Design: Informal Design Guidelines for Relation Schemas; Functional Dependencies; NormalForms 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 423C MICROCONTROLLERS 4-CREDITS
Hours/Week : 04 CIE. Marks: 50
Total Hours : SEE. Marks: 100
Course Objectives
1. Give an understanding about basic architecture and addressing modes of 8051 microcontrollers.
2. Give knowledge about 8051 instructions and assembly language & C programming.3. Give knowledge about interfacing different devices.
Course Outcomes
A student who successfully completes this course should be able to
1. List different addressing modes and instructions of different types.2. Compare features of microcontroller and microprocessor.3. Develop assembly program and 8051 C program for simple microcontroller based
application.4. Calculate delays generated by delay routines and timers.5. Design address decoder to interface external memory.6. Select appropriate mode of operation for programming interface circuits.
UNIT- I 13 HoursThe 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 Hours8051 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 Hours8051 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 Hours8051 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 CREDITS
Hours/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
security
4. To gain knowledge on synchronization algorithms, deadlock handling algorithms .
Course Outcomes
After the completion of this Course Students should be able to
1. List goals of an OS, services provided by OS and functions of OS.
2. Compare performance of different process scheduling policies , memory management techniques, file system implementation, and protection and security mechanisms.
3. Solve Scheduling problems and memory allocation problems.
4. Distinguish different classes of operating systems.
5. Develop concurrent applications using processes and threads.
6. Select appropriate deadlock handling method , synchronization method and Interprocess
Communication method to develop applications.
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 Wesley
2. William Stallings:Operating Systems, 6th Edition, Addison Wesley
UCS416C OBJECT ORIENTED PROGRAMMING WITH C++ 4-CREDITS
Hrs/Week: 04 CIE Marks: 50
Total Hrs: 48 SEE Marks: 50
Course Objectives
II. To Understand object oriented programming and advanced C++ concepts
III. Be able to explain the difference between object oriented programming and procedural
programming.
IV. Be able to program using more advanced C++ features such as composition of objects,
operator overloads, dynamic memory allocation, inheritance and polymorphism, file I/O,
exception handling, etc.
V. Be able to build C++ classes using appropriate encapsulation and design principles. Improve your
problem solving skills Be able to apply object oriented or non-object oriented techniques to solve bigger
computing problems
Course Outcomes
After learning the course the students should be able to:
1. Describe the important concepts of object oriented programming like object and class, Encapsulation, inheritance and polymorphism.
2. Write the simple object oriented programs in C++ using objects and classes. 3. Develop the programs using features of C++ like type conversion, inheritance, polymorphism, I/O
streams and files tfor real life problems. 4. Use advance features like temples and exception to make programs supporting reusability and
sophistication. 5. Use standard template library for faster development. 6. Develop the applications using object oriented programming with C++.
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 Hours
Stream 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, maps
Exception 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-OrientedProgramming in Turbo C++.
UCS427L DATABASE APPLICATION AND VISUALIZATION LAB 2-CREDITS
Hours/Week: 03 CIE MARKS: 50
SEE Marks: 50
Course Outcome:
After the completion of the course the student should be able to:
Explain the creation and maintenance of tables using SQL
Handling all types of Queries
Writing all kinds of programming scripts in PL/SQL,
Create stored procedures, functions and packages
Create cursors & triggers.
Design and develop real database application.
Course Objective:
The Database Application Laboratory Course is designed to equip the students with knowledge of the:
1. Designing the Database.
2. Implement queries using SQL and PL/SQL and
3. Develop mini project on real database application using ORACLE and VB.
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.
5) Creation of simple PL/SQL program which includes declaration section, executable section and exception –Handling section (Ex. Student marks can be selected from the table and printed for those who secured first class and an exception can be raised if no records were found)
6) Programs development using creation of procedures, passing parameters IN and OUT of PROCEDURES.
7) Program development using creation of stored functions, invoke functions in SQL Statements
8) Program development using creation of package specification, package bodies, private objects, package variables and calling stored packages.
9) Develop programs using features parameters in a CURSOR, FOR UPDATE CURSOR, WHERE CURRENT of clause and CURSOR variables.
10) Develop Programs using BEFORE and AFTER Triggers,
PART – B
Develop Mini Project on any application.
UCS438L OBJECT ORIENTED PROGRAMMING LABORATORY 1.5-CREDIT
Hours/Week: 02 CIE MARKS: 50
SEE Marks: 50
Course Objectives
VI. To Understand object oriented programming and advanced C++ concepts
VII. Be able to explain the difference between object oriented programming and procedural
programming.
VIII.Be able to program using more advanced C++ features such as composition of objects,
operator overloads, dynamic memory allocation, inheritance and polymorphism, file
I/O,
exception handling, etc.
IX. Be able to build C++ classes using appropriate encapsulation and design principles.
Improve your problem solving skills Be able to apply object oriented or non-object oriented
techniques to solve bigger computing problems
Course OutcomesAfter learning the course the students should be able to:
7. Describe the important concepts of object oriented programming like object and class, Encapsulation, inheritance and polymorphism.
8. Write the simple object oriented programs in C++ using objects and classes. 9. Develop the programs using features of C++ like type conversion, inheritance,
polymorphism, I/O streams and files tfor real life problems. 10.Use advance features like temples and exception to make programs supporting reusability
and sophistication. 11.Use standard template library for faster development. 12.Develop the applications using object oriented programming with C++.
Indicative List of Programs:
1. Define EMPLOYEE class with Employee_Number, Employee_Name, Basic_Salary, All_Allowances, IT, Net_Salary as data members. Use member function to read, to calculate net salary and to print employee details.
2. Define a STUDENT class with USN, Name, and Marks in 3 tests of a subject. Declare an array of 4 STUDENT objects. Using appropriate functions, find the average of two better marks for each student. Print the USN, Name and the average marks of all the students.
3. Write a C++ program to create a class called STRING and implement the following operations.
i.)STRING s1 (“VTU”) (use parameterized constructor) ii) STIRNG s2 = s1; (Use copy constructor)
4. Write a C++ program to create a class called TIME and implements the following operations by overloading ADD ( ).
i. ADD (T1, T2) - where T1 and T2 are two time objects.ii. ADD (T1, N) - where N is an integer number to be added to seconds of T1 object
5 Define a class LIST to implement singly linked list and perform the following operations on linked list.
i. Insert a new node to the left of the node whose key value is read as an input.ii. Delete the node of a given data if it is found, otherwise display appropriate message.
iii. Display the contents of the list.
6. Write a C++ program to create the following classes. PERSON : Data members – Name, Address, Age
Member functions – Insert(), Output()
STUDENT : Derived from PERSON
Data members : CGPA
Member functions – Insert(), Output() PROFESSOR : Derived from PERSON
Data members : No. of Publications
Member functions – Insert(), Output()
Display the details of the students having CGPA > 8.5 and also the details of the professors having no. of publications > 25.
7. Write a C++ program to create the following classes. BOOK: Data members-Title, author, publisher, price
Member function read (), display () CD: Data members-Title, type, price
Member function: read(),display() SHOP: derived from BOOK and CD
Data members: shop_name, sales_ type, sale_date, qty Member function: read (), display ()
Display the details of books and cds sold on date 12/09/2010 by AKASH shop and also find the total number audio cds sold by shop.
8. Write a C++ program to create a class called STACK using an array of integers. Implement the stack operations by overloading the increment and decrement operators. display the contents of the stack after each operation, by overloading the operator «.Use
Exception for stack full and empty conditions.
9. Write program in C++ to create a class called DATE with methods to accept two valid dates in the form dd/mm/yy and to implement the following operations by overloading the operators + and -. After every operation the results are to be displayed by overloading the operator <<.
i) if (d1> =d2) overload >= operator then
no_of_days = d1 – d2; where d1 and d2 are DATE objects, else
no_of_days = d2 – d1; where d1 and d2 are DATE objects,
ii. d2 = d1 + no_of_days; where d1 is a DATE object and no_of_days is an integer.
10. Write a C++ program to create a class MATRIX. Read two matrices by overloading >> operator. Perform addition of two matrices by overloading operators + and display the results by overloading << operator.
11. Write a C++ program to create a template function for merge sort and demonstrate sorting of integers and doubles.
12. Write a C++ program to create a template class called CIR_QUEUE with member functions to add an element and to delete an element from the circular queue. Using these member functions, implement a circular queue of integer and double. Demonstrate the operations by displaying the content of the circular queue after every operation. Use exception for queue full and empty condition
13. Write a C++ program to create BOOK.DAT file with the following information. title, author, publisher, price
Perform the following operations.
i) Download the information from the file into an array of BOOK objects.
ii) Find total number of books published by each publication. Store the results in PUBLISH.DAT file.
iv) Display the details of all the books written by same author.
v) Append new record to the file
14. Write a C++ program to create STUDENT.DAT file with the following information. name, department, entry number, fees, course.
Perform the following operations.
i) Download the information from the file into an array of STUDENT objects.
ii) Find total number of students registered for each course (course is UG / PG) and Store the results (course and total no. of students) in a COURSE.DAT file.
iii) Display the contents of the output file.
iv) Display the total number of students opted for CSE branch.
15. Write a program that accepts a shopping list of five items from the keyboard and stores them in vectors. Extend the program to accomplish the following:
a) To delete a specified item in the listb) To add an item at a specified locationc) To add an item at the endd) To print the contents of the vectors
Note:
l In the examination questions must be given lots.l Each student must be given one full question.
UCS439L MICROCONTROLLER LAB 1.5 CREDIT
Hours/Week: 02 CIE MARKS: 50
SEE 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 in appropriate mode and interface devices.5. Develop programs for simple microcontroller based applications
i. 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.32h onwards n numbers are available store the result in register r7.
ii. Write an ALP to implement decimal up down counter using P0 read P1.0 to decide up or down counter.
iii. Write an ALP to wasp to add no until sum<=ffhhw many no that causes sum ffh store it, i/p start from 30h
iv. Write an ALP to find smallest of n numbersv. Write an ALP Programme to generate triangle wave
vi. Write an ALP to rotate the stepper motor by 180 in clockwise directionvii. Write a ALP to find even or odd sum.
viii. Write a ALP to sort number in ascending orderix. Write a ALP to send data stored in ROM to port2 serially using hyper
terminal.
x. Write C Programme to generate square wave.xi. Write C Programme to generate staircase wave
xii. Write C programme to generate staircase wavexiii. Write an ALP to define interrupt service routine for external interrupt. xiv. Write an alp to 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 Hours
Velocity, Acceleration of a particle moving on a space curves. Vector point function.
Directional derivative, Gradient, Curl and Divergence. Solenoidal and Irrotational vectors-simple problems.
3. Laplace Transforms: 19 Hours
Definition- Transform of elementary functions. Derivatives and integrals of transforms-problems. Periodic functions.
Inverse transforms- Properties Solutions of linear differential equations. Applications to Engineering problems.
Resources:
1. Elementary Mathematics by B. S. Grewal.
2. Engineering Mathematics by B. S. Grewal.3. Higher Engineering Mathematics by B. S. Grewal. Khanna Publishers.
Question paper pattern for SEE:
1. Total of eight questions to be set , covering the entire syllabus.2. Each question should not have more than 4 sub divisions.3. Any five full questions are to be answered.
