Skip to main content

BCSL-043 | Java Programming Lab | IGNOU BCA Solved Assignment | July 2021 & Jan 2022

 


BCSL-043 | Java Programming Lab | IGNOU BCA Solved Assignment | July 2021 & Jan 2022

Course Code:- BCSL-043
Course Title:- Java Programming Lab
Assignment Number:-  BCA(4)/L-043/Assignment/2021-22
Maximum Marks:- 50
Last Date of Submission:- 31st October, 2021 (for July Session)
15th April, 2022 (for January Session)

This assignment has two questions. Answer both the questions. These questions carry 40 marks. Rest 10 marks are for viva voce. Write Java program and take its output as part of solution. Please go through the guidelines regarding the assignments given in the programme guide for the format of presentation. 

Question 1 (a): Write a Java program to demonstrate us of all the arithmetic and logical operators in Java.

Question 1 (b): Write a Java program to create shape class as an abstract class, which is having abstract method area(). Derive classes circle and rectangle from shape class. Override area method in circle and rectangle class to find the area of the respective shape. Define appropriate constructors in circle and rectangle classes. Make necessary assumptions id any. 

Question 2 (a): Write a program in java to read the content from a text file and count the number of words in the file. 

Question 2 (b): Write a program in Java to create an applet which takes a number as input and displays the table of it. Use appropriate layout and user interface in your program.


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

Buy from Here (Rs. 49) :-





BCSL-043 | Java Programming Lab



Some Tags :-
BCSL043,BCSL43,Java Programming Language, Ignou Solved Assignment, Ignou BCA 4th Sem solved Assignment,BCSL43 solved Assignment,Ignou Solved Assignment,ignou BCA jan 2022 solved assignment,BCSL043,BCSL43,Java Programming Lab Assignment, Ignou Solved Assignment, Ignou BCA 4th Sem solved Assignment,BCSL43 solved Assignment,Ignou Solved Assignment,ignou BCA jan 2022 solved assignment, ignou BCA new Solved Assignment
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