Atal Bihari Vajpayee Vishwavidyalaya II semester Syllabus
BCS-201 PROGRAMMING FUNDAMENTALS USING C/C++
Core Course: 03 Marks: 100 Total Credit: 04
Course Outcome: At the end of course, Students will be able to
● Understand the fundamental programming concepts and methodologies which are essential to create good C/C++ programs.
● Code, test, and implement a well-structured, robust computer program using the C/C++ programming language.
● Write reusable modules (collections of functions).
● Understand design/implementation issues involved with variable allocation and binding, control flow, types, subroutines, parameter passing.
● Develop an in-depth understanding of functional, logic, and object-oriented programming paradigms.
UNIT-I
Introduction to C and C++ Overview of Procedural Programming and Object-Orientation Programming, Character set, Identifiers and Keywords, Data types, Casting of DataTypes, Constants, Variables, Expressions, Statements, Symbolic constants. Operators (Arithmetic, Relational, Logical, Conditional, Bitwise, COMMA operator etc.), Character I/O (getc, getchar, putc, putchar etc), Formatted and Console I/O (printf(), scanf(), cin, cout), Compiling and Executing Simple Programs in C/C++.
Control Statements:if, if-else, Nested if- else, goto statements, switch, break, continue, while, do-while, for, nested loops.
UNIT-II
Arrays:Definition & their types, array declaration and assignments, processing an array, multidimensional arrays.
Functions: Declaration and Definition of Functions, Function prototypes, Call by Value, Call by Reference, Void functions, inline functions, function overloading, friend functions, constructors and their types, destructors, friend class, Command Line Arguments, Recursion, Automatic variables, external variables, static variables.
UNIT-III
String: Introduction, Operation function: strlen(), strcmp(), stricmp(), strncmp(), strincmp(), strcpy(), strcat(), strrev() and their implementation.
Structures and unions: Defining & Accessing a structure, union and enumeration elements, Array of Structures,Understanding the Preprocessor Directives (#include, #define), Macros.
UNIT-IV
Pointersand Referencesin C/ C++: Understanding a Pointer Variable, Simple use of Pointers (Declaring and Dereferencing Pointers to simple variables), Pointers to Pointers, Pointers to structures, Passing pointers as function arguments, Returning a pointer from a function, using arrays as pointers, Passing arrays to functions. Pointers vs. References, Declaring and initializing references, Using references as function arguments and function return values.
UNIT-V
Memory Allocationin C++: Differentiating between static and dynamic memory allocation, use of malloc, calloc and free functions, use of new and delete operators.
Object Oriented Programming: Defining & Using Classes, Access Specifier, Object, Instantiation, Encapsulation, Polymorphism, Abstract class, Inheritance & its types, Class Constructors, Constructor Overloading.
TEXT/REFERENCE BOOKS:
1. Let us C - Y.Kanetkar, BPB Publications
2. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India.
3. E. Balagurusamy, Programming in ANSI C, Tata McGraw-Hill.
4. Object oriented Programming with C++, E. Balagurusamy, Tata McGraw-Hill.
5. C++ Complete reference, Herbert Schildt, Tata McGraw-Hill.
BCS-202 Programming Fundamentals using C/C++ Lab
Core Course: 03(P) Marks: 100 Total Credit: 02
Course Outcome: At the end of course, Students will be able to
● Understand the fundamental programming concepts and methodologies which are essential to create good C/C++ programs.
● Code, test, and implement a well-structured, robust computer program using the C/C++ programming language.
● Write reusable modules (collections of functions).
● Understand design/implementation issues involved with variable allocation and binding, control flow, types, subroutines, parameter passing.
● Develop an in-depth understanding of functional, logic, and object-oriented programming paradigms.
List of Experiments:
1. WAP to print the sum and product of digits of an integer.
2. WAP to reverse a number.
3. WAP to compute the sum of the first n terms of the following series S = 1+1/2+1/3+1/4+……
4. WAP to compute the sum of the first n terms of the following series S =1-2+3-4+5…………….
5. Write a function that checks whether a given string is Palindrome or not. Use this function to find whether the string entered by user is Palindrome or not.
6. Write a function to find whether a given no. is prime or not. Use the same to generate the prime numbers less than 100.
7.WAP to compute the factors of a given number.
8. Write a macro that swaps two numbers. WAP to use it.
9. WAP to print a triangle of stars as follows (take number of lines from user):
*
***
*****
*******
*********
10. WAP to perform following actions on an array entered by the user:
i) Print the even-valued elements
ii) Print the odd-valued elements
iii) Calculate and print the sum and average of the elements of array
iv) Print the maximum and minimum element of array
v) Remove the duplicates from the array
vi) Print the array in reverse order The program should present a menu to the user and ask for one of the options. The menu should also include options to re-enter array and to quit the program.
11. WAP that prints a table indicating the number of occurrences of each alphabet in the text entered as command line arguments.
12. Write a program that swaps two numbers using pointers.
13. Write a program in which a function is passed address of two variables and then alter its contents
14. Write a program which takes the radius of a circle as input from the user, passes it to another function that computes the area and the circumference of the circle and displays the value of area and circumference from the main() function.
15. Write a program to find sum of n elements entered by the user. To write this program, allocate memory dynamically using malloc() / calloc() functions or new operator.
16. Write a menu driven program to perform following operations on strings:
a) Show address of each character in string
b) Concatenate two strings without using strcat function.
c) Concatenate two strings using strcat function.
d) Compare two strings
e) Calculate length of the string (use pointers)
f) Convert all lowercase characters to uppercase
g) Convert all uppercase characters to lowercase
h) Calculate number of vowels
i) Reverse the string
17. Given two ordered arrays of integers, write a program to merge the two-arrays to get an ordered array.
18. WAP to display Fibonacci series
(i)using recursion,
(ii) using iteration
19. WAP to calculate Factorial of a number
(i)using recursion,
(ii) using iteration
20. WAP to calculate GCD of two numbers
(i) with recursion
(ii) without recursion.
21. Create Matrix class using templates. Write a menu-driven program to perform following Matrix Operations (2-D array implementation):
a) Sum b) Difference c) Product d) Transpose
22. Create the Person class. Create some objects of this class (by taking information from the user). Inherit the class Person to create two classes Teacher and Student class. Maintain the respective information in the classes and create, display and delete objects of these two classes (Use Runtime Polymorphism).
23. Create a class Triangle. Include overloaded functions for calculating area. Overload assignment operator and equality operator.
24. Create a class Box containing length, breath and height. Include following methods in it:
a) Calculate surface Area
b) Calculate Volume
c) Increment, Overload ++ operator (both prefix & postfix)
d) Decrement, Overload -- operator (both prefix & postfix)
e) Overload operator == (to check equality of two boxes), as a friend function
f) Overload Assignment operator
g) Check if it is a Cube or cuboid
Write a program which takes input from the user for length, breath and height to test the above class.
25. Create a structure Student containing fields for Roll No., Name, Class, Year and Total Marks. Create 10 students and store them in a file.
26. Write a program to retrieve the student information from file created in previous question and print it in following format: Roll No. Name Marks
27. Copy the contents of one text file to another file, after removing all whitespaces.
28. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void.
Note: List of programs may be changed by the concern teacher
BCS-203 DISCRETE STRUCTURES
Core Course: 04 Marks: 100 Total Credit: 06
Course Outcome: At the end of course, Students will be able to
● Develop the understanding of Logic Sets and Functions.
● Use mathematical reasoning techniques including induction and recursion.
● Understand and apply counting techniques to the representation and characterization of relational concepts.
UNIT-I
Mathematical Logic:
Propositional and Predicate Logic, Predicates and Quantifiers, Law of duality, Rules of inference, Logical Connectives, Basic Logical Operations: Conjunction, Disjunction, Negation, Conditional and Bi-conditional statements, Tautology, Contradiction, Logical Equivalence.
UNIT-II
Set Theory:
Introduction, Universal and Empty set, cardinality of set, Power set, Cartesian Product, Subset, Venn diagram, Set operation, Inclusion and exclusion principle.
UNIT-III
Relation:
Introduction, Properties of Binary Relation, Equivalence Relation, Relation Matrix, Relation Graph, Composition of Relation, Partition, Partial Order Relation, Hasse diagram. Function: Introduction, Onto function, Into function, One to One function, Bijective Function, Composition of Function, Inverse of Function.
UNIT-IV
Graph Theory:
Definition, Finite and Infinite Graph, Incidence and Degree, Matrix Representation, Digraph. Isomorphic Graph, Homomorphism Graph, Connected , Disconnected and strongly connected graph, Sub Graph, Walk, Path , Circuit, Complement of Graph, Regular Graph, Complete Graph, Weighted Graph, Bipartite Graph, Operations on Graph, Cut set, cut Vertex, Eccentricity, Centre , Radius and diameter of a Graph.
UNIT-V
Searching Techniques:
Depth First Search, Breadth First Search, Dijkstra’s Algorithm, Euler and Hamiltonian Paths and Circuits, PlanarGraphs, Graph Coloring, Trees,BasicTerminologyand properties ofTrees,Introduction to Spanning Trees.
TEXT BOOK:
1. “Discrete Mathematical structures with Applications to Computer Science”, JP Trembly and R. Manohar, TMH International Edition (Latest Edition)
2. “Graph theory and its application to Engineering and Computer Science”, NarsingDeo, PHI
3. “Advanced Discrete Mathematics” H.K. Pathak, J.P.Chauhan, ShikshaSahityaPrakashan
REFERENCE BOOK:
1. “Discrete Mathematics”, Seymour Lipshutz& Marc Lipson, TMH
2. “Discrete Mathematics and Its Applications”, Kenneth. H. Rosen, TMH
3. “Discrete Mathematics with Graph Theory” Goodaire and Parmenter, EEE.
BCS-204 ENVIRONMENTAL SCIENCE
Ability Enhancement Compulsory course (AECC): 02 Marks:100 Total credit: 04
Course Outcome: At the end of course, Students will be able to
Understand the principles of ecology and environmental issues that apply to air, land, and water issues on a global scale.
Develop critical thinking and/or observation skills, and apply them to the analysis of a problem or question related to the environment.
Apply their ecological knowledge to illustrate and graph a problem and describe the realities that managers face when dealing with complex issues.
Learn to cope with balancing human requirements and environmental conservation.
Learn causes and prevention of the different environmental Pollution.
Appreciate the ethical, cross-cultural, and historical context of environmental issues and the links between human and natural systems.
UNIT-I
Introduction to environmental studies:
Multidisciplinary nature of environmental studies; Scope and importance; Concept of sustainability and sustainable development.
UNIT-II
Ecosystems:
What is an ecosystem? Structure and function of ecosystem; Energy flow in an ecosystem: food chains, food webs and ecological succession. Case studies of the following ecosystems : Forest ecosystem, Grassland ecosystem, Desert ecosystem, Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries).
UNIT-III
Natural Resources :
Renewable and Non‐renewable Resources: Land resources and land use change; Land degradation, soil erosion and desertification, Deforestation: Causes and impacts due to mining, dam building on environment, forests, biodiversity and tribal populations. Water : Use and over- ‐exploitation of surface and ground water, floods, droughts, conflicts over water (international & inter-‐state). Energy resources : Renewable and non renewable energy sources, use of alternate energy sources, growing energy needs, case studies.
UNIT-IV
Biodiversity and Conservation:
Levels of biological diversity : genetic, species and ecosystem diversity; Biogeography zones of India; Biodiversity patterns and global biodiversity hot spots, India as a mega- ‐biodiversity nation; Endangered and endemic species of India, Threats to biodiversity : Habitat loss, poaching of wildlife, man-‐wildlife conflicts, biological invasions; Conservation of biodiversity : In- ‐situ and Ex- ‐situ conservation of biodiversity, Ecosystem and biodiversity services: Ecological, economic, social, ethical, aesthetic and Informational value.
UNIT-V
Environmental Pollution:
Environmental pollution : types, causes, effects and controls; Air, water, soil and noise pollution, Nuclear hazards and human health risks, Solid waste management : Control measures of urban and industrial waste. Pollution case studies.
UNIT-VI
Environmental Policies & Practices:
Climate change, global warming, ozone layer depletion, acid rain and impacts on human communities and agriculture, Environment Laws: Environment Protection Act; Air (Prevention & Control of Pollution) Act; Water (Prevention and control of Pollution) Act; Wildlife Protection Act; Forest Conservation Act. International agreements: Montreal and Kyoto protocols and Convention on Biological Diversity (CBD). Nature reserves, tribal populations and rights, and human wildlife conflicts in Indian context.
UNIT-VII
Human Communities and the Environment:
Human population growth: Impacts on environment, human health and welfare. Resettlement and rehabilitation of project affected persons; case studies. Disaster management : floods, earthquake, cyclones and landslides. Environmental movements : Chipko, Silent valley, Bishnois of Rajasthan. Environmental ethics: Role of Indian and other religions and cultures in environmental conservation. Environmental communication and public awareness, case studies (e.g., CNG vehicles in Delhi).
UNIT-VIII
Field work:
Visit to an area to document environmental assets: river/ forest/ flora/fauna, etc. Visit to a local polluted site- ‐Urban/Rural/Industrial/Agricultural. Study of common plants, insects, birds and basic principles of identification. Study of simple ecosystems-‐pond, river, Delhi Ridge, etc.
TEXTBOOKS:
1. Carson, R. 2002. Silent Spring. Houghton Mifflin Harcourt.
2. Gadgil, M., & Guha, R. 1993. This Fissured Land: An Ecological History of India. Univ. of California Press.
3. Gleeson, B. and Low, N. (eds.) 1999. Global Ethics and Environment, London, Routledge.
4. Gleick, P. H. 1993. Water in Crisis. Pacific Institute for Studies in Dev., Environment & Security. Stockholm Env. Institute, Oxford Univ. Press.
5. Groom, Martha J., Gary K. Meffe, and Carl Ronald Carroll. Principles of Conservation Biology. Sunderland: Sinauer Associates, 2006.
6. Grumbine, R. Edward, and Pandit, M.K. 2013. Threats from India’s Himalaya dams. Science, 339: 36- -‐37.
7. McCully, P. 1996. Rivers no more: the environmental effects of dams (pp. 29--‐64). Zed Books.
8. McNeill, John R. 2000. Something New Under the Sun: An Environmental History of the Twentieth Century.
9. Odum, E.P., Odum, H.T. & Andrews, J. 1971. Fundamentals of Ecology. Philadelphia: Saunders.
10. Pepper, I.L., Gerba, C.P. & Brusseau, M.L. 2011. Environmental and Pollution Science. Academic Press.
11. Rao, M.N. & Datta, A.K. 1987. Waste Water Treatment. Oxford and IBH Publishing Co. Pvt. Ltd.
12. Raven, P.H., Hassenzahl, D.M. & Berg, L.R. 2012. Environment. 8th edition. John Wiley & Sons.
13. Rosencranz, A., Divan, S., & Noble, M. L. 2001. Environmental law and policy in India. Tripathi 1992.
14. Sengupta, R. 2003. Ecology and economics: An approach to sustainable development. OUP.
15. Singh, J.S., Singh, S.P. and Gupta, S.R. 2014. Ecology, Environmental Science and Conservation. S. Chand Publishing, New Delhi.
16. Sodhi, N.S., Gibson, L. & Raven, P.H. (eds). 2013. Conservation Biology: Voices from the Tropics. John Wiley & Sons.
17. Thapar, V. 1998. Land of the Tiger: A Natural History of the Indian Subcontinent.
18. Warren, C. E. 1971. Biology and Water Pollution Control. WB Saunders.
19. Wilson, E. O. 2006. The Creation: An appeal to save life on earth. New York: Norton. World Commission on Environment and Development. 1987. Our Common Future. Oxford University press
BCS-205 DIGITAL ELECTRONICS
Generic Elective (GE): 02 Marks: 100 Total credit: 04
Course Outcome: At the end of course, Students will be able to
Understand the fundamental concepts and techniques used indigital electronics.
Understand and examine the structure of various number systems and itsapplication in digital design.
Understand, analyse and design various combinational and sequential circuits.
Classify different semiconductor memories.
Minimize the Boolean expression using Boolean algebra and design it using logic gates.
UNIT-I
Number System:
Digital Computers, Number Systems &Conversion: Decimal, Binary, Octal, Hexadecimal, Gray code, Excess-3 code, BCD code. Number system arithmetic, Complements (n-1’s and n’s), Signed and Unsigned numbers, Representation of negative numbers.
UNIT-II
Logic Gates:
OR, AND, NOT, XOR,XNOR,Universal (NOR and NAND) Gates.Boolean algebra, Minimization of Switching Functions: Standard representation of logic function (SOP and POS), Minimization technique- K Map method, Prime implicants, don’t care combinations.
UNIT-III
Combinational Circuits:
Adder, Subtractor, Encoder, Decoder, Multiplexer (MUX), De-Multiplexer.MUX Realization of switching functions, Code-converters (BCD-EXCESS-3), Hazards and Hazard free realizations.
UNIT-IV:
Sequential circuits:
Definition, Basic flip-flops- SR, JK, T and D, Master Slave Flip Flop, race around condition, Steps in synchronous sequential circuit design: Register, modulo-N counter, Ring counter & Shift counters.
UNIT-V
Memory:
Main memory, Semiconductor memory, Flash memory, Cache memory, Secondary memory.
TEXTBOOKS:
1. “Computer Fundamentals Architecture and Organization”, Bram, New Age Techno Press.
2. “Digital Design”, Morris Mano, PHI, 3rd Edition, 2006.
REFERENCE BOOKS:
1. An Engineering Approach To Digital Design – Fletcher, PHI.
2. Digital Logic – Application and Design – John M. Yarbrough, Thomson
3. Fundamentals of Logic Design – Charles H. Roth, Thomson Publications, 5th Edition, 2004.
4. Digital Logic Applications and Design – John M. Yarbrough, Thomson Publications, 2006.
5. Malvino A.P, Digital Principles and Applications, Tata McGraw Hill.
6. Computer Fundamentals: Architecture and Organization
BCS-206 DIGITAL ELECTRONICS LAB
Generic Elective (GE): 02(P) Marks: 100 Total credit: 02
Course Outcome: At the end of course, Students will be able to
Represent numerical values in various number systems and perform number conversions between different number systems.
Analyze and design digital combinational circuits like decoders, encoders, multiplexers, and de- multiplexers including arithmetic circuits (half adder, full adder, and multiplier).
Design and implement binary Adder and Subtractor.
Design and implement 3-bit synchronous counters.
List of Experiments:
1. Study of Logic Gates–AND, OR, NOT, NAND, NOR XOR (Using respective ICs)
2. Realization of AND, OR and NOT gates using Universal Gates.
3. Design and Realization of Half Adder/Subtracted using NAND Gates.
4. Design and Realization of Full Adder using Logic Gates.
5. Design and Realization of 4 bit Adder/Subtractor using IC 7483.
6. Design and Realization of BCD Adder using IC 7483.
7. Realization of J-K flip flop using IC 7400 and 7410.
8. Realization of T and D flip flop using IC 7476.
9. Implementation of PIPO Shift Registers using flip flops. (IC 7476).
10. Design and implementation of odd and even parity checker Generator using IC 74180.
Note: List of experiments may be changed by the concern teacher
BCS-207 INTRODUCTION TO PROGRAMMING
Generic Elective (GE): 02 Marks: 100 Total Credit: 04
Course Outcome: At the end of course, Students will be able to
Understand the basic terminology used in computer programming.
Use different data types in a computer program.
Practice the fundamental programming methodologies in the C/C++ programming language.
Code, test, and implement a well-structured, robust computer program using the C/C++ programming language.
Write reusable modules (collections of functions).
Develop logics which will help them to create programs.
UNIT-I
Introduction to C and C++:
Overview of Procedural Programming and Object-Orientation Programming, Character set, Identifiers and Keywords, Data types, Casting of Data Types, Constants, Variables, Expressions, Statements, Symbolic constants. Operators (Arithmetic, Relational, Logical, Conditional, Bitwise, COMMA operator etc.), Character I/O (getc, getchar, putc, putchar etc), Formatted and Console I/O (printf(), scanf(), cin, cout), Compiling and Executing Simple Programs in C/C++.
Control Statements:
if, if-else, Nested if- else, goto statements, switch, break, continue, while, do-while, for, nested loops.
UNIT-II
Arrays:
Definition & their types, array declaration and assignments, processing an array, multidimensional arrays.
Functions:
Declaration and Definition of Functions, Function prototypes, Call by Value, Call by Reference, Void functions, inline functions, function overloading, friend functions, constructors and their types, destructors, friend class, Command Line Arguments, Recursion, Automatic variables, external variables, static variables.
UNIT-III
String:
Introduction, Operation function: strlen(), strcmp(), stricmp(), strncmp(), strincmp(), strcpy(), strcat(), strrev() and their implementation.
Structures and Unions:
Defining & Accessing a structure, union and enumeration elements, Array of Structures,Understanding the Preprocessor Directives (#include, #define), Macros.
UNIT-IV
Pointers and References in C/ C++:
Understanding a Pointer Variable, Simple use of Pointers (Declaring and Dereferencing Pointers to simple variables), Pointers to Pointers, Pointers to structures, Passing pointers as function arguments, Returning a pointer from a function, using arrays as pointers, Passing arrays to functions. Pointers vs. References, Declaring and initializing references, Using references as function arguments and function return values
UNIT-V
Memory Allocation in C++:
Differentiating between static and dynamic memory allocation, use of malloc, calloc and free functions, use of new and delete operators.
Object Oriented Programming:
Defining & Using Classes, Access Specifier, Object, Instantiation, Encapsulation, Polymorphism, Abstract class, Inheritance & its types, Class Constructors, Constructor Overloading.
TEXT/REFERENCE BOOKS:
1. Let us C - Y.Kanetkar, BPB Publications.
2. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India.
3. E. Balagurusamy, Programming in ANSI C, Tata McGraw-Hill.
4. Object oriented Programming with C++, E. Blagurusamy, Tata McGraw-Hill.
5. C++ Complete reference, Herbert Schildt, Tata McGraw-Hill.
BCS-208 INTRODUCTION TO PROGRAMMING LAB
Generic Elective (GE: 02) -P Marks: 100 Total Credit: 02
Course Outcome: At the end of course, Students will be able to
● Understand the fundamental programming concepts and methodologies which are essential to create good C/C++ programs.
● Code, test, and implement a well-structured, robust computer program using the C/C++ programming language.
● Write reusable modules (collections of functions).
● Understand design/implementation issues involved with variable allocation and binding, control flow, types, subroutines, parameter passing.
● Develop an in-depth understanding of functional, logic, and object-oriented programming paradigms.
List of Experiments:
1. WAP to print the sum and product of digits of an integer.
2. WAP to reverse a number.
3. WAP to compute the sum of the first n terms of the following series S = 1+1/2+1/3+1/4+……
4. WAP to compute the sum of the first n terms of the following series S =1-2+3-4+5…………….
5. Write a function that checks whether a given string is Palindrome or not. Use this function to find whether the string entered by user is Palindrome or not.
6. Write a function to find whether a given no. is prime or not. Use the same to generate the prime numbers less than 100.
7.WAP to compute the factors of a given number.
8. Write a macro that swaps two numbers. WAP to use it.
9. WAP to print a triangle of stars as follows (take number of lines from user):
*
***
*****
*******
*********
10. WAP to perform following actions on an array entered by the user:
vii) Print the even-valued elements
viii) Print the odd-valued elements
ix) Calculate and print the sum and average of the elements of array
x) Print the maximum and minimum element of array
xi)Remove the duplicates from the array
xii) Print the array in reverse order The program should present a menu to the user and ask for one of the options. The menu should also include options to re-enter array and to quit the program.
11. WAP that prints a table indicating the number of occurrences of each alphabet in the text entered as command line arguments.
12. Write a program that swaps two numbers using pointers.
13. Write a program in which a function is passed address of two variables and then alter its contents
14. Write a program which takes the radius of a circle as input from the user, passes it to another function that computes the area and the circumference of the circle and displays the value of area and circumference from the main() function.
15. Write a program to find sum of n elements entered by the user. To write this program, allocate memory dynamically using malloc() / calloc() functions or new operator.
16. Write a menu driven program to perform following operations on strings: j) Show address of each character in string k) Concatenate two strings without using strcat function. l) Concatenate two strings using strcat function. m) Compare two strings n) Calculate length of the string (use pointers) o) Convert all lowercase characters to uppercase p) Convert all uppercase characters to lowercase q) Calculate number of vowels r) Reverse the string 17. Given two ordered arrays of integers, write a program to merge the two-arrays to get an ordered array. 18. WAP to display Fibonacci series (i)using recursion, (ii) using iteration 19. WAP to calculate Factorial of a number (i)using recursion, (ii) using iteration 20. WAP to calculate GCD of two numbers (i) with recursion (ii) without recursion. 21. Create Matrix class using templates. Write a menu-driven program to perform following Matrix Operations (2-D array implementation): a) Sum b) Difference c) Product d) Transpose 22. Create the Person class. Create some objects of this class (by taking information from the user). Inherit the class Person to create two classes Teacher and Student class. Maintain the respective information in the classes and create, display and delete objects of these two classes (Use Runtime Polymorphism). 23. Create a class Triangle. Include overloaded functions for calculating area. Overload assignment operator and equality operator. 24. Create a class Box containing length, breath and height. Include following methods in it: a) Calculate surface Area b) Calculate Volume c) Increment, Overload ++ operator (both prefix & postfix) d) Decrement, Overload -- operator (both prefix & postfix) e) Overload operator == (to check equality of two boxes), as a friend function f) Overload Assignment operator g) Check if it is a Cube or cuboid Write a program which takes input from the user for length, breath and height to test the above class. 25. Create a structure Student containing fields for Roll No., Name, Class, Year and Total Marks. Create 10 students and store them in a file. 26. Write a program to retrieve the student information from file created in previous question and print it in following format: Roll No. Name Marks 27. Copy the contents of one text file to another file, after removing all whitespaces. 28. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void. Note: List of programs may be changed by the concern teacher