Skip to main content

BCS-031 | Programming in C++ | IGNOU BCA Solved Assignment | July 2021 & Jan 2022



BCS-031 | Programming in C++ |  IGNOU BCA Solved Assignment | July 2021 & Jan 2022


Course Code:- BCS-031
Course Title:- Programming in C++
Assignment Number:-  BCA(3)031/Assignment/2021-22
Maximum Marks:- 100
Weightage:- 25%
Last Date of Submission:- 31st October, 2021(for July session)
15th April, 2022 (for January session)

This assignment has five questions carrying a total of 80 marks. Answer all the questions. Rest 20 marks are for viva-voce. You may use illustrations and diagrams to enhance explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation. Wherever required, you may write C++ program and take its output as part of solution.

Question 1: 
(a) What is Object Oriented Programming (OOP) approach? Explain advantages of OOP.
(b) Briefly explain different operators of C++.
(c) Explain use of followings in C++ programming, with an example program for each.
        (a) for loop (b) while loop

Question 2:
(a) What is a class? Explain how a class is created in C++, with the help of an example.
(b) Explain the following in detail, in context of C++ programming.
    i. Access specifies ii. Friend Function
(c) Write a C++ program to explain how an object can be passed as a parameter to a function.

Question 3:
(a) What are containers? Explain use of List container class, with the help of an example.
(b) What is inheritance? What are different types of inheritance? Explain how multiple inheritance is implemented in C++, with the help of a program.
(c) Write a C++ program to overload ‘+’ operator in such a way that it return the sum of lengths of two strings (Note: if S1 and S2 are two strings then S1+S2 or S2 + S1 should give the sum of lengths of S1 and S2).

Question 4:
 (a) Explain the following in detail with the help of examples, in context of C++ programming
        i. Destructor ii. Virtual Function iii. Inline function
(b) What is template? Write appropriate statements to create a template class for Stack data Structure in C++. 

Question 5:
(a) What is exception? How exceptions are handled in C++? Write program to handle stack overflow as exception.
(b) What is function overloading? Write a C++ program to explain concept of function overloading.
(c) Explain use of any two I/O formatting flags in C++ with example. 

Important :- 
Please don't refer Free Solved Assignment that Are available on the internet, I have checked the solutions of that Assignments, I found some of the issues in that assignments:-
  • Extra or Irrelevent Answers Written
  • Coding/Programes are Copied from the Internet and irrelevent to the question.
  • Question is asking something and Solution is given for other things, not match.
  • If you are worry about the Marks and Wants to save Time, Please Ignore the Free Assignment, But this is your Choice, You want to use that Free Assignment Solution in which most of the Solutions are wrong OR The Paid Assignments which are prepared under the guidance of Teachers/Professors.

Why Paid Assignment Solution ? 

  • It took time to solve the Assignment, and mainly most of the time is used to solved the Programming Question
  • Assignment Solutions are short and 100% accurate and Verified
  • Answers are written according to the Questions, means no extra line.
  • Checked by Teachers/Professors.
  • It motivates us to Solve more Assignment.
  • Trusted Solutions
  • Simple and Clean Interface

You Can Buy From Here as well as From Amazon.in also 

Details:- 
Course Code:- BCS-031
Course Title:- Programming in C++
Assignment Number:-  BCA(3)031/Assignment/2021-22
Maximum Marks:- 100
Weightage:- 25%
Last Date of Submission:- 31st October, 2021(for July session)
15th April, 2022 (for January session)

Buy from Here (Rs. 39) :-

Buy from Amazon :- 






Labels:

Popular posts from this blog

Top 10 Beginner-Friendly LeetCode Questions and Their Solutions

If you're new to solving coding problems on LeetCode, it can feel overwhelming. Where do you start? Which problems are suitable for beginners? Don’t worry! In this blog post, I’ll guide you through 10 beginner-friendly LeetCode questions that are perfect for getting started on your coding journey. These problems will help you build confidence, improve your problem-solving skills, and lay a solid foundation in data structures and algorithms. Why Start with Beginner-Friendly Problems? Before diving into advanced topics like dynamic programming or graph theory, it’s essential to: Build a strong foundation in basic programming concepts. Understand how to approach a coding problem methodically. Gain familiarity with LeetCode’s platform and its problem structure. The following problems are simple yet impactful, designed to introduce you to common techniques like loops, arrays, strings, and basic math operations. 10 Beginner-Friendly LeetCode Problems 1. Two Sum (Easy) Problem Link : Two...
Read more

How to Solve LeetCode’s Hard Problems Without Getting Stuck

LeetCode’s hard problems can seem daunting, especially when you’re just getting comfortable with coding. Tackling these problems isn’t about innate talent—it’s about persistence, learning, and applying the right strategies. In this blog, I’ll share actionable tips and techniques to help you solve LeetCode hard problems without getting stuck and make consistent progress in your problem-solving journey. Why Are Hard Problems Hard? LeetCode hard problems challenge your understanding of advanced data structures, algorithms, and optimization techniques. Here’s why they’re tough: They require deep problem-solving skills and out-of-the-box thinking. Many involve multiple layers of complexity . Edge cases and large inputs often test your algorithm’s efficiency. They push you to master topics like dynamic programming, graph traversal, and segment trees. However, with the right approach, you can break down even the most complex problems into manageable parts. Start with the Right Mindset Appro...
Read more

Efficient Solution to LeetCode 2563: Count the Number of Fair Pairs in C++

 his problem tests our understanding of efficient array traversal techniques and highlights the power of binary search when working with sorted arrays. By the end of this post, you’ll have a clear, optimized solution in C++ that avoids Time Limit Exceeded (TLE) errors and uses two-pointer and binary search techniques . Let’s get started by breaking down the problem and exploring a step-by-step approach to a performant solution. Problem Statement Given: An integer array nums of size n . Two integers, lower and upper . Our goal is to count all pairs (i, j) where: 0 <= i < j < n , and lower <= nums[i] + nums[j] <= upper . Example Walkthrough Let's clarify with an example: Example 1 Input: nums = [0, 1, 7, 4, 4, 5] , lower = 3 , upper = 6 Output: 6 Explanation: Valid pairs that satisfy the condition are (0,3) , (0,4) , (0,5) , (1,3) , (1,4) , and (1,5) . Example 2 Input: nums = [1, 7, 9, 2, 5] , lower = 11 , upper = 11 Output: 1 Explanation: There is only one valid p...
Read more