SETH JAI PARKASH MUKAND LAL INSTITUTE OF ...Lecture Plan BCA-231 Lecture Topic 1. Object-Oriented...
Transcript of SETH JAI PARKASH MUKAND LAL INSTITUTE OF ...Lecture Plan BCA-231 Lecture Topic 1. Object-Oriented...
SETH JAI PARKASH MUKAND LAL INSTITUTE OF
ENGINEERING & TECHNOLOGY, RADAUR
Academic Calendar
Session 2018-2021
Third Semester
Name……………………………………………….
Roll No…..……………………………………
Department of Computer Science and Application
(BCA-III SEM)
EXAMINATION SCHEME FOR BACHELOR OF COMPUTER APPLICATIONS (BCA)
(SIX-SEMESTER PROGRAMME)
Semester – III
Paper
No.
Title of the Paper Duration
Of Exam
Maximum Marks Total
Theory Sessional*
BCA-231 Object Oriented Programming Using
C++
3 Hours 80 20 100
BCA-232 Data Structures 3 Hours 80 20 100
BCA-233 Computer Architecture 3 Hours 80 20 100
BCA-234 Software Engineering 3 Hours 80 20 100
BCA-235 Fundamentals of Data Base Systems 3 Hours 80 20 100
BCA-236 Computer Oriented Numerical
Methods
3 Hours 80 20 100
BCA-251 Lab – I Based on BCA-231 3 Hours 100
BCA-252 Lab – II Based on BCA-232 3 Hours 100
BCA – 231 OBJECT ORIENTED PROGRAMMING USING ‘C++’
Maximum Marks: 100 External: 80
Minimum Pass Marks: 35 Internal:20
Time: 3 hours
Note: Examiner will be required to set Nine Questions in all. First Question will be
compulsory, consisting of objective type/short-answer type questions covering the entire
syllabus. In addition to that eight more questions will be set, two questions from each
Unit. A candidate will be required to answer five questions in all, selecting one question
from each unit in addition to compulsory Question No. 1. All questions will carry equal
marks.
UNIT – I
Object oriented Programming: Object-Oriented programming features and benefits. Object-Oriented features of C++, Class and Objects, Data Hiding & Encapsulation, Structures, Data members and Member functions, Scope resolution operator and its significance, Static Data Members, Static member functions, Nested and Local Class, Accessing Members of Class and Structure.
UNIT – II
Constructor, Initialization using constructor, types of constructor– Default, Parameterized
& Copy Constructors, Constructor overloading, Default Values to Parameters,
Destructors, Console I/O: Hierarchy of Console Stream Classes, Unformatted and
Formatted I/O Operations.
UNIT – III Manipulators, Friend Function, Friend Class, Arrays, Array of Objects, Passing and Returning Objects to Functions, String Handling in C++, Dynamic Memory Management: Pointers, new and delete Operator, Array of Pointers to Objects, this Pointer, Passing Parameters to Functions by Reference & pointers.
UNIT – IV
Polymorphism: Operators in C++, Precedence and Associativity Rules, Operator
Overloading, Unary & Binary Operators Overloading, Function Overloading, Inline
Functions
TEXT BOOKS: 1. Herbert Scildt, C++, The Complete Reference, Tata McGraw-Hill
2. Robert Lafore, Object Oriented Programming in C++, SAMS Publishing
REFERENCE BOOKS:
1. Bjarne Stroustrup, The C++ Programming Language, Pearson Education
2. Balaguruswami, E. , Object Oriented Programming In C++, Tata McGraw-Hill.
Lecture Plan
BCA-231
Lecture Topic
1. Object-Oriented programming features and benefits. 2. Object-Oriented features of C++ 3. Class and Objects 4. Data Hiding 5. Encapsulation 6. Structures 7. Data members and Member functions 8. Scope resolution operator and its significance 9. Static Data Members 10. Static member functions 11. Nested and Local Class 12. Accessing Members of Class and Structure. 13. Constructor, Initialization using constructor 14. Types of constructor– Default, Parameterized & Copy Constructors 15. Constructor overloading 16. Default Values to Parameters 17. Destructors 18. Hierarchy of Console Stream Classes 19. Unformatted and Formatted I/O Operations. 20. Manipulators 21. Friend Function, Friend Class 22. Arrays, Array of Objects 23. Passing and Returning Objects to Functions 24. String Handling in C++ 25. Dynamic Memory Management: Pointers, new and delete Operator 26. Array of Pointers to Objects, this Pointer 27. Passing Parameters to Functions by Reference & pointers.
28. Introduction to Polymorphism
29. Operators in C++
30. Precedence and Associativity Rules
31. Operator Overloading
32. Unary & Binary Operators Overloading
33. Function Overloading
34. Inline Functions
Tutorial sheet-1 1. Differentiate between the concept of structure and class with suitable examples?
2. Write a short note on friend function in C++. Give suitable example?
3. Explain object oriented programming features and benefits?
4. What is scope resolution operator in C++? Explain its significance and give suitable
exmples?
Tutorial sheet-2
1. What is the use of constructor and destructor in C++? How do we declare them?
Write a program to compute area of various geometrical figures using constructor
and destructor?
2. Explain the concept of operator overloading in C++. Write a program to overload
binary “+” operator in C++
3. Explain the concept of string handling and dynamic memory management in C++
with suitable examples?
Tutorial sheet-3
1. What is virtual function? Explain its significance. Write any program in C++ using
virtual function?
2. Explain function overloading with example?
3. Explain type conversion using example?
Tutorial sheet-4
1. What is inheritance? Explain various types of inheritance with suitable example?
2. Explain the concept of exception handling in C++ with suitable example?
3. What is the difference between function template and class template in C++
BCA – 232 DATA STRUCTURES
Maximum Marks: 100 External:80
Minimum Pass Marks: 35 Internal:20
Time: 3 hours
Note: Examiner will be required to set Nine Questions in all. First Question will be
compulsory, consisting of objective type/short-answer type questions covering the entire
syllabus. In addition to that eight more questions will be set, two questions from each Unit.
A candidate will be required to answer five questions in all, selecting one question from
each unit in addition to compulsory Question No. 1. All questions will carry equal marks.
UNIT – I
Introduction: Elementary data organization, Data Structure definition, Data type vs. data
structure, Categories of data structures, Data structure operations, Applications of data
structures, Algorithms complexity and time-space tradeoff, Big-O notation.
Strings: Introduction, strings, String operations, Pattern matching algorithms.
UNIT – II
Arrays: Introduction,Linear arrays,Representation of linear array in memory, Traversal,
Insertions, Deletion in an array, Multidimensional arrays, Parallel arrays, Sparce matrics.
Linked List: Introduction, Array vs. linked list, Representation of linked lists in memory,
Traversal, Insertion, Deletion, Searching in a linked list, Header linked list, Circular
linked list, Two-way linked list, Garbage collection, Applications of linked lists.
Algorithms for Insertion, deletion in array, Single linked list
UNIT – III
Stack: Introduction, Array and linked representation of stacks, Operations on stacks,
Applications of stacks: Polish notation, Recursion.
Queues: Introduction, Array and linked representation of queues, Operations on queues,
Deques, Priority Queues, Applications of queues.
UNIT – IV
Tree: Introduction, Definition, Representing Binary tree in memory, Traversing binary
trees, Traversal algorithms using stacks and using recursion.
Graph: Introduction, Graph theory terminology, Sequential and linked representation of
graphs.
TEXT BOOKS
1. Seymour Lipschutz, “Data Structure”, Tata-McGraw-Hill
2. Horowitz, Sahni & Anderson-Freed, “Fundamentals of Data
Structures in C”, University Press
REFERENCE BOOKS:
1. Trembley, J.P. And Sorenson P.G., “An Introduction to Data Structures With
Applications”, Mcgrraw- Hill International Student Edition, New York.
2. Mark Allen Weiss Data Structures and Algorithm Analysis In C, Addison- Wesley,
(An Imprint Of Pearson Education), Mexico City.
3. Yedidyan Langsam, Moshe J. Augenstein, and Aaron M. Tenenbaum, “Data Structures
Using C”, Prentice- Hall of India Pvt. Ltd., New Delhi.
Lecture Plan
BCA-232
Lectures Topics
1. Introduction to Elementary data organization, Data Structure definition
2. Data type vs. data structure
3. Categories of data structures
4. Data structure operations
5. Applications of data structures,Algorithms complexity
6. Time-space trade off,Big-O notation.
7. Introduction to strings,String operations
8. Pattern matching algorithms.
9. Introduction to arrays,Linear arrays
10. Representation of linear array in memory,Traversal
11. Insertions in an array
12. Deletion in an array,
13. Multidimensional arrays
14. Parallel arrays
15. Sparce matrics.
16. Introduction to linked list
17. Array vs. linked list
18. Representation of linked lists in memory
19. Traversal, Insertion in a linked list
20. Deletion, Searching in a linked list
21. Header linked list, Circular linked list
22. Two-way linked list, Garbage collection, Applications of linked lists
23. Algorithms for Insertion, deletion in array, Single linked list
24. Introduction to Stack, Array and linked representation of stacks
25. Operations on stacks
26. Applications of stacks: Polish notation, Recursion.
27. Introduction to Queues, Array and linked representation of queues
28. Operations on queues
29. Deques, Priority Queues,
30. Applications of queues.
31. Introduction and Definition of tree, Representing Binary tree in memory
32. Traversing binary trees
33. Traversal algorithms using stacks and using recursion.
34. Introduction of graphs and Graph theory terminology
35. Sequential and linked representation of graphs.
Tutorial sheet-1
1. What is data structure?
2. Name the various ways to store strings in computer memory
3. How can you calculate the address of an element of an array?
4. Discuss the purpose of circular linked list?
5. What is recursion?
6. What do you understand by complexity of an algorithm? Discuss big-O notation to represent complexity?
7. Describe various operations that can be performed on various data structure?
Tutorial sheet-2
1. What are various operations that can be performed on strings? Explain using suitable examples and algorithms?
2. Compare and explain any two ways to sort data from a linear array?
3. Write an algorithm to search an element from a linked list?
4. Write an algorithm to insert an element in a two-way linked list.
Tutorial sheet-3
1. Write the algorithm for inserting and deleting an element in a stack using array?
2. How can you convert an infix expression to a prefix and postfix expression? Explain using suitable examples?
3. What is priority queue? How can you represent priority queue in computer memory?
4. What is deque? What is purpose of using it?
Tutorial sheet-4
1. What is binary search tree? Explain various operations on binary search trees in detail?
2. Explain DFS traversal method in graphs?
3. Write warshall algorithm for finding shortest path in a graph?
4. How queues are stored in linked list?
5. What is adjacency matrix?
BCA – 233 COMPUTER ARCHITECTURE
Maximum Marks: 100 External: 80
Minimum Pass Marks: 35 Internal:20
Time: 3 hours
Note: Examiner will be required to set Nine Questions in all. First Question will be
compulsory, consisting of objective type/short-answer type questions covering the entire
syllabus. In addition to that eight more questions will be set, two questions from each
Unit. A candidate will be required to answer five questions in all, selecting one question
from each unit in addition to compulsory Question No. 1. All questions will carry equal
marks.
UNIT -I
Basic Computer Organisation and Design: Instruction Codes, Computer registers,
Computer Instructions, Timing and Control, Instruction Cycle, Memory reference
instructions, Input-Output and Interrupt, Design of Basic computer, Design of
accumulator logic
UNIT -II
Register Transfer and Microoperations: Register Transfer Language (RTL), register
transfer, Bus and Memory Transfers, Arithmetic Microoperations, Logic
Microoperations, Shift Microoperations, Arithmetic Logic Shift Unit,
Microprogrammed Control: Control memory; address sequencing, microprogram
sequencer, Design of Control Unit
UNIT -III
Central Processing Unit: General registers Organization, Stack Organization,
Instruction formats, Addressing Modes, Data Transfer and Manipulation, Program
Control, Program Interrupt, RISC, CISC.
UNIT -IV
Memory Organization: Memory hierarchy, Auxiliary Memory, Associative
Memory, Interleaved memory, Cache memory, Virtual Memory, Memory
Management Hardware, Input Output Organization : Peripheral devices , Input-Output
Interface, Asynchronous data transfer, Modes of Transfer, Priority Interrupt, Direct
Memory Access(DMA),Input-Output Processor(IOP).
TEXT BOOKS
1. Computer System Architecture By. Moris Mano, Pearson Education
2. Computer Architecture and Organization By J.P. Hayes, Tata McGraw
Hill
REFERENCE BOOKS: 1. W. Stallings, Computer Organisation and Architecture, 4th Edition, Pearson Education
2. Harry, Jordan, Computer Systems Design & Architecture, Edition, Addison Wesley
3. J. D. Carpinelli, Computer Systems Organization & Architecture, Addison Wesley.
4. P. V. S. Rao, “Computer System Architecture”, PHI, 2009
Lecture Plan
BCA-123
Lectures Topics
1. Introduction to Basic Computer Organisation and Design
2. Instruction Codes, Computer registers, Computer Instructions
3. Timing and Control
4. Instruction Cycle, Memory reference instructions
5. Input-Output and Interrupt
6. Design of Basic computer
7. Design of accumulator logic
8. Register Transfer and Microoperations: Register Transfer Language
(RTL)
9. Register transfer, Bus and Memory Transfers
10. Arithmetic Microoperations
11. Logic Microoperations
12. Shift Microoperations
13. Arithmetic Logic Shift Unit
14. Microprogrammed Control, Control memory
15. Address sequencing
16. Microprogram sequencer
17. Design of Control Unit
18. Central Processing Unit, General registers Organization
19. Stack Organization
20. Instruction formats
21. Addressing Modes
22. Data Transfer and Manipulation
23. Program Control
24. Program Interrupt
25. RISC, CISC.
26. Memory Organization, Memory hierarchy
27. Auxiliary Memory, Associative Memory, Interleaved memory
28. Cache memory, Virtual Memory
29. Memory Management Hardware, Input Output Organization, Peripheral
devices,
30. Input-Output Interface
31. Asynchronous data transfer, Modes of Transfer
32. Priority Interrupt
33. Direct Memory Access(DMA)
34. Input-Output Processor(IOP).
Tutorial sheet-1
1. Discuss hit ratio, flag bit in cache memory?
2. Discuss fetch cycle?
3. What is priority interrupt?
4. What is cycle-stealing in DMA?
5. What do you understand by computer instructions? Explain memory reference
instructions?
6. What is instruction cycle? Explain execution cycle for LDA, ADD, OUT, HLT?
Tutorial sheet-2
1. Explain design and truth table for automatic unit using RTL?
2. What is control memory? Explain the design and function of control memory?
Tutorial sheet-3
1. Explain the concept of data transfer. Discuss the concept using program controlled
and interrupt driven data transfer.
2. Solve X= (A*B)-(C+D) using 3,2,1,0 addressing modes?
3. Explain architecture of RISC model?
Tutorial sheet-4
6. What is associative memory? Explain read aand write operation in
associative memory?
7. Explain in detail DMA AND Asynchronous data transfer?
BCA/D-18
COMPUTER ARCHITECTURE BCA-233
1. (a)Describe various types of CPU Registers. (b)Describe the advantages and
disadvantages of micro programmed control.
(c)What is thye principal of hardwired control? (d)Explain IOP.
UNIT-I
2. (a)Explain various approaches of control unit design and its implementation.
(b)Explain fetch and execute operation for a direct type instruction of your
choice.
3. (a)Explain various components of the control unit of basic computer.
(b)Discuss various memory references and register references instructions.
UNIT-II
4.What do you mean by micro operations?Explain various types of micro operations
with its hardware implementation. 5.An 8-bit register contains the binary value
10010110.What is the register value after following operations:
(a)shift right (b)shift left
(c)circular shift right (d)circular
shift left
UNIT-III
6.(a)What do you mean by instruction format?Describe various types of instruction formats
with suitable examples.
(b)What do you mean by stack?Explain various operations on it. 7.(a)Write assembly language code for 1’s and 2’s
compliment addition of 2 binary numbers.
(b)Explain bus organization for various CPU registers using diagrams.
UNIT-IV
8.Describe various data transfer techniques. 9.(a)What do you mean by auxiliary memory?Explain its hardware implementation.
(b)Explain the concept of virtual memory.
BCA – 234 SOFTWARE ENGINEERING
Maximum Marks: 100 External:80
Minimum Pass Marks: 35 Internal:20
Time: 3 hours
Note: Examiner will be required to set Nine Questions in all. First Question will be
compulsory, consisting of objective type/short-answer type questions covering the entire
syllabus. In addition to that eight more questions will be set, two questions from each
Unit. A candidate will be required to answer five questions in all, selecting one question
from each unit in addition to compulsory Question No. 1. All questions will carry equal
marks.
UNIT – I
Introduction: Program vs. Software, Software Engineering, Programming
paradigms, Software Crisis – problem and causes, Phases in Software development:
Requirement Analysis, Software Design, Coding, Testing, Maintenance, Software
Development Process Models: Waterfall, Prototype, Evolutionary and Spiral models,
Role of Metrics.
UNIT – II
Feasibility Study, Software Requirement Analysis and Specifications: SRS, Need for SRS,
Characteristics of an SRS, Components of an SRS, Problem Analysis, Information
gathering tools, Organizing and structuring information, Requirement specification,
validation and Verification. . SCM
UNIT – III
Structured Analysis and Tools: Data Flow Diagram, Data Dictionary, Decision table,
Decision tress, Structured English, Entity-Relationship diagrams, Cohesion and
Coupling.
Gantt chart, PERT Chart, Software Maintenance: Type of maintenance, Management of
Maintenance, Maintenance Process, maintenance characteristics. .
UNIT – IV
Software Project Planning: Cost estimation: COCOMO model, Project scheduling,
Staffing and personnel planning, team structure, Software configuration management,
Quality assurance plans, Project monitoring plans, Risk Management. Software
testing strategies: unit testing, integration testing, Validation testing, System testing,
Alpha and Beta testing.
TEXT BOOKS:
1. Pressman R. S., “Software Engineering – A Practitioner’s Approach”, Tata McGraw
Hill.
2. Jalote P., “An Integrated approach to Software Engineering”, Narosa.
REFERENCE BOOKS:
1. Sommerville, “Software Engineering”, Addison Wesley.
2. Fairley R., “Software Engineering Concepts”, Tata McGraw Hill.
3. James Peter, W Pedrycz, “Software Engineering”, John Wiley & Sons.
LECTURE PLAN
BCA-124
Lecture Topic
1. Introduction to software engineering, Program vs. Software
2. Software Engineering, Programming paradigms
3. Software Crisis – problem and causes
4. Phases in Software development: Requirement Analysis,
Software Design, Coding, Testing, Maintenance
5. Software Development Process Models: Waterfall, Prototype
6. Evolutionary and Spiral models
7. Role of Metrics.
8. Feasibility Study
9. Software Requirement Analysis and Specifications, Need for SRS
10. Characteristics of an SRS, Components of an SRS
11. Problem Analysis, Information gathering tools
12. Organizing and structuring information, Requirement specification
13. validation and Verification
14. SCM
15. Data Flow Diagram, Data Dictionary
16. Decision table, Decision tress, Structured English
17. Entity-Relationship diagrams, Cohesion and Coupling.
18. Gantt chart, PERT Chart
19. Software Maintenance, Type of maintenance
20. Management of Maintenance, Maintenance Process, maintenance
characteristics.
21. Software Project Planning, Cost estimation: COCOMO model
22. Project scheduling, Staffing and personnel planning
23. Team structure, Software configuration management
24. Quality assurance plans
25. Project monitoring plans
26. Risk Management
Software testing strategies
27. Unit testing, integration testing
28. Validation testing
29. System testing
30. Alpha and Beta testing.
Tutorial sheet-1 1. Who are the members of development team in software development?
2. How the progress of a project can be tracked?
3. What is a risk?
4. What do you understand by integration testing?
5. Explain waterfall model along with its advantages and limitations?
6. What is software crisis problem? Explain its causes.
7. What is software engineering? Explain various phases of software
development?
Tutorial sheet-2 1. What are the various tools used for information gathering??
2. What is the role of validation and verification?
3. What is the requirement of SRS? Explain its components and
characteristics?
4. What do you mean by software restructuring?
5. What is a software?
Tutorial sheet-3 1. Describe the various types of maintenance. What are various problems
and cost associated with maintenance?
2. Explain the difference between coupling and cohesion?
3. What is the purpose of data flow diagram?
4. What are the characteristics of a process?
Tutorial sheet-4
1.What is the purpose of COCOMO model?
2.What is risk management?
3.What are various testing strategies? Explain various types of testing?
4.What do you mean by SCM?
BCA – 235 FUNDAMENTALS OF DATABASE SYSTEM
Maximum Marks: 100 External:80
Minimum Pass Marks: 35 Internal:20
Time: 3 hours
Note: Examiner will be required to set Nine Questions in all. First Question will be
compulsory, consisting of objective type/short-answer type questions covering the entire
syllabus. In addition to that eight more questions will be set, two questions from each
Unit. A candidate will be required to answer five questions in all, selecting one question
from each unit in addition to compulsory Question No. 1. All questions will carry equal
marks.
UNIT – I
Basic Concepts – Data, Information, Records and files. Traditional file – based Systems-
File Based Approach-Limitations of File Based Approach, Database Approach-
Characteristics of Database Approach, Database Management System (DBMS),
Components of DBMS Environment, DBMS Functions and Components,
Advantages and Disadvantages of DBMS, Roles in the Database Environment - Data and
Database Administrator, Database Designers, Applications Developers and Users.
UNIT – II
Database System Architecture – Three Levels of Architecture, External, Conceptual and
Internal Levels, Schemas, Mappings and Instances, Data Independence – Logical
and Physical Data Independence, Classification of Database Management System,
Centralized and Client Server architecture to DBMS.
UNIT – III
Data Models: Records- based Data Models, Object-based Data Models, Physical Data
Models and Conceptual Modeling, Entity-Relationship Model – Entity Types, Entity
Sets, Attributes Relationship Types, Relationship Instances and ER Diagrams.
UNIT – IV
Relational Data Model:-Brief History, Terminology in Relational Data Structure,
Relations, Properties of Relations, Keys, Domains, Integrity Constraints over Relations,
Base Tables and Views, Basic Concepts of Hierarchical and Network Data Model.
TEXT BOOKS:
1. Elmasri & Navathe, “Fundamentals of Database Systems”, 5th edition, Pearson
Education.
REFERENCE BOOKS:
1. Thomas Connolly Carolyn Begg, “Database Systems”, 3/e, Pearson
Education
2. C. J. Date, “An Introduction to Database Systems”, 8th edition, Addison Wesley
N. Delhi.
Lecture Plan
BCA-125
Lectures Topics
1. Data, Information, Records and files
2. Traditional file based Systems, File Based Approach, Limitations of File Based
Approach
3. Database Approach, Characteristics of Database Approach, Database Management
System (DBMS)
4. Components of DBMS Environment
5. DBMS Functions and Components
6. Advantages and Disadvantages of DBMS
7. Roles in the Database Environment - Data and Database Administrator
8. Database Designers
9. Applications Developers and Users.
10. Database System Architecture, Three Levels of Architecture
11. External, Conceptual and Internal Levels
12. Schemas, Mappings and Instances
13. Data Independence, Logical and Physical Data Independence
14. Classification of Database Management System
15. Centralized and Client Server architecture to DBMS
16. Data Models, Records- based Data Models
17. Object-based Data Models
18. Physical Data Models and Conceptual Modeling
19. Entity-Relationship Model – Entity Types, Entity Sets
20. Attributes Relationship Types
21. Relationship Instance
22. ER Diagrams.
23. Relational Data Model, Brief History
24. Terminology in Relational Data Structure
25. Relations, Properties of Relations
26. Keys
27. Domains
28. Integrity Constraints over Relations
29. Base Tables and Views
30. Basic Concepts of Hierarchical
31. Basic Concepts of Network Data Model.
Tutorial sheet-1
1. Differentiate between physical and logical data independence.
2. Define database management system, what are the functions of DBMS?
Explain the three level architecture of DBMS as propsed by NSI-SPARC?
3. Who is DBA? Discuss the responsibilities of DBA? Write a note on different
types of user involved in DBMS?
Tutorial sheet-2
1. What is entity relationship model? Outline the conventions used for
displaying an ER schema as an ER diagram. How relationship constraints are used
in ER diagram? 2. What do you mean by attribute? Explain the different types of attribute with
their symbols? 3. Differentiate between conceptual and physical data models?
Tutorial sheet-3
1. What is relational algebra? Discuss relational-oriented and set oriented
operations with suitable examples? 2. What do you mean by key? Explain different types of keys?
3. Write a note on network data model?
4. What is the difference between strong and weak entity with example?
Tutorial sheet-4 1. What are the data types used in SQL? Explain the various components of
SQL?
2. Differentiate between
(a) BCNF and 3NF
(b) Lull and partial functional dependencies
3. What are integrity constraints? Explain?
4. Write a note on SQL operators?
BCA- 236 COMPUTER-ORIENTED NUMERICAL METHODS
Maximum Marks: 100 Time: 3 hours
Minimum Pass Marks: 35
Note: Examiner will be required to set Nine Questions in all. First Question will be
compulsory, consisting of objective type/short-answer type questions covering the entire
syllabus. In addition to that eight more questions will be set, two questions from each
Unit. A candidate will be required to answer five questions in all, selecting one question
from each unit in addition to compulsory Question No. 1. All questions will carry equal
marks.
UNIT-I
Computer Arithmetic: Floating-point representation of numbers, arithmetic operations
with normalized floating-point numbers and their consequences, significant figures.
Error in number representation-inherent error, truncation, absolute, relative, percentage
and round-off error.
Iterative Methods: Bisection, False position, Newton-Raphson method. Iteration method,
discussion of convergence, Bairstow's method.
UNIT-II
Solution of simultaneous linear equations and ordinary differential equations: Gauss-
Elimination methods, pivoting, Ill-conditioned equations, refinement of solution.
Gauss-Seidal iterative method, Euler method, Euler modified method, Taylor-series
method, Runge-Kutta methods, Predictor-Corrector methods.
UNIT-III
Interpolation and Approximation:
Polynomial interpolation: Newton, Lagranges, Difference tables, Approximation
of functions by Taylor Series.
Chebyshev polynomial: First kind, Second kind and their relations, Orthogonal
properties.
UNIT-IV
Numerical Differentiation and integration: Differentiation formulae based on
polynomial fit, pitfalls in differentiation, Trapezoidal & Simpson Rules, Gaussian
Quadrature.
REFERENCE BOOKS
1. V. Rajaraman, Computer Oriented Numerical Methods, Prentice Hall, India.
2. S. S. Sastry, Introductory Methods of Numerical Analysis.
3. M. K. Jain, S.R.K. Iyengar & R. K. Jain, Numerical Methods for
Scientific and Engineering Computation.
4. H. C. Saxena, Finite Differences and Numerical Analysis.
Lecture Plan
BCA-236
Lectures Topics
1. Computer Arithmetic, Floating-point representation of numbers
2. Arithmetic operations with normalized floating-point numbers and their
consequences, significant figures.
3. Error in number representation-inherent error
4. Truncation, absolute, relative, percentage and round-off error.
5. Iterative Methods, Bisection
6. False position, Newton-Raphson method
7. Iteration method
8. Discussion of convergence
9. Bairstow's method.
10. Solution of simultaneous linear equations and ordinary differential equations
11. Gauss-Elimination methods
12. Pivoting
13. Ill-conditioned equations, refinement of solution
14. Gauss-Seidal iterative method
15. Euler method
16. Euler modified method
17. Taylor-series method
18. Runge-Kutta methods
19. Predictor-Corrector methods.
20. Interpolation and Approximation
21. Polynomial interpolation, Newton
22. Lagranges
23. Difference tables, Approximation of functions by Taylor Series.
24. Chebyshev polynomial: First kind, Second kind and their relations
25. Orthogonal properties.
26. Numerical Differentiation and integration
27. Differentiation formulae based on polynomial fit
28. Pitfalls in differentiation
29. Trapezoidal & Simpson Rules
30. Gaussian Quadrature.
Tutorial sheet-1
1. (a) Two cards are drawn successively with replacement from a well shuffled
Pack of 52 cards. Find the mean and SD of the number of kings.
(b) An unbiased coin is tossed 10 times. Find by using binomial distribution, the
probability of getting :
(i) exactly 6 heads
(ii) at least 6 heads
(iii) atmost 6 heads
(iv) at least 3 heads.
2. (a) The marks obtained by 8 student in Mathematics and Statistics in a test are
as follows :
(15, 11), (12, 4) (16, 8), (10, 15), (12, 9), (10, 15), (16, 17), (20, 14)
(b) Calculate the coefficient of rank correlation from the following data :
X : 4 20 6 13 9 13 6 19 25 15
Y : 16 65 9 48 24 33 16 57 40 16
Tutorial sheet-2 1. (a) Form an ordinary frequency table :
Height No. of Height No. of
(in ft.) trees (in ft.) trees
Below 7 26 Below 35 216
Below 14 57 Below 42 287
Below 21 92 Below 49 341
Below 28 134 Below 56 360
(b) Calculate the AM from the following data :
Marks : 0-10 10-20 20-30 30-40 40-50
No. of Students : 12 18 27 20 17
2. . (a) Find the mean deviation about the mean of the marks of 10 students
of
Sections A and B as given:
Section A : 7 10 12 13 15 20 21 27 30 35
34
Section B : 15 15 15 15 18 19 21 22 25 25
(b) Calculate standard deviation and its coefficient of variation from the following:
Wages upto (in Rs.) : 10 20 30 40 50 60 70 80
No. of Persons : 12 30 65 107 157 202 220 230
Tutorial sheet-3 1. (a) Define Quartile Deviation.
(b) Define Continuous Random Variables.
(c) Give two characteristics for an ideal measure of central tendency. (d) Give
two demerits of Harmonic mean.
(e) Calculate the coefficient of correlation between x and y. When
∑y=60, ∑x=60, ∑x2=400, ∑y2=580, ∑xy=305, n=10.
(f) Define two differences between correlation and regression.
(g) Find the regression coefficient of y on x for the following data : Ex=60,
Ey=105, Ex2=800, Ey2=2000, Exy=1200, n=10.
(h) Examine the validity of the following data :
In an ANOVA table: Total sum of squares=25, between sum of
squares=16 and within sum of squares=7.
Tutorial sheet-4 1. (a) Find the value of Chi-square for the following : Class
A B C D E Observed frequency 8 29
44 15 4
Expected frequency 7 24 38 24 7
(b) Three different machines are used for the production. On the basis of the outputs,
test whether the machines are equally effective or not.
Output of machines
I 10 5 11 10
II 9 7 5 6
III 20 16 10 14
2. (a) A population consists of three numbers 3, 6, 9. Consider all possible sample of
size two which can be drawn with replacement from the population. Calculate
the standard error of the sample means
(b) Define errors in testing of hypothesis. Also give their types.
35
36
37
38
39
Software Lab. I
(BCA 231)
Object Oriented Programming Using C++
Examination: 100 Total: 100
1. Write a program to print “ HELLO WORLD” in C++.
2. Write a program to add two numbers in C++
3. Write a program to find quotient and remainder
4. Write a program to swap two numbers.
5. Write a program to check whether a number is even or odd.
6. Write a program to find largest number among three numbers.
7. Write a program to calculate sum of natural numbers.
8. Write a program to find factorial of a number.
9. Write a program to check whether the number is prime or not.
10. Write a program to check whether the number is palindrome or not.
40
Software Lab. II
(BCA 232)
DataStructures
Examination: 100 Total: 100
List of Programs to be implemented using C language
1. Implement bubble sort in C.
2. Implement selection sort in C.
3. Implement insertion sort in C.
4. Implement Quick Sort in C with Algorithm, Example.
5. Implement Merge Sort in C with Example.
6. Implement Counting Sort with C Example.
7. Print Postorder traversal from Preorder and Inorder traversal of a tree.
8. Implement Infix To Postfix Conversion Using Stack [with C program].
9. Evaluation of Postfix Expressions Using Stack [with C program].
10. Find in-order Successor and Predecessor in a BST using C program.
11. Implement in-order traversal using C program.
12. Implement post-order traversal using C program.
13. Implement pre-order traversal using C program.
TIME – TABLE
DAY I II III IV V VI VII
MONDAY
TUESDAY
WEDNESDAY
THURSDAY
FRIDAY
SATURDAY
41