Skip to main content

IGNOU BCA Syllabus 2022-2023

 IGNOU BCA Syllabus 2022-2023


Minimum Duration

3 Years

Maximum Duration

6 Years

Course Fees

Rs 42,000

Minimum Age

No bar

Maximum Age

No bar

Eligibility

10+2 or its equivalent

IGNOU Syllabus of BCA Program Given Below with the details of the Credits of the Subjects.

> BCA 1st Semester <<

COURSE CODE

 COURSE NAME

CREDITS

 FEG-02

 Foundation course in English-2

4

 ECO-01

 Business Organization

4

 BCS-011

 Computer Basics and PC Software

3

 BCS-012

 Mathematics

4

 BCSL-013

 Computer Basics and PC Software Lab

2

>> BCA 2nd Semester <<

COURSE CODE

 COURSE NAME

CREDITS

 ECO-02

 Accountancy-1

4

 MCS-011

 Problem Solving and Programming

3

 MCS-012

 Computer Organization and Assembly Language Programming

4

 MCS-015

 Communication Skills

2

 MCS-013

 Discrete Mathematics

2

 BCSL-021

 C Language Programming Lab

1

 BCSL-022

 Assembly Language Programming Lab

1

>> BCA 3rd Semester <<

COURSE CODE

 COURSE NAME

CREDITS

 MCS-021

 Data and File Structures

4

 MCS-023

 Introduction to Database Management Systems

3

 MCS-014

 Systems Analysis and Design

3

 BCS-031

 Programming in C++

3

 BCSL-032

 C++ Programming Lab

1

 BCSL-033

 Data and File Structures Lab

1

 BCSL-034

 DBMS Lab

1

>> BCA 4th Semester <<

COURSE CODE

 COURSE NAME

CREDITS

 BCS-040

 Statistical Techniques

4

 MCS-024

 Object-Oriented Technologies and Java Programming

3

 BCS-041

 Fundamentals of Computer Networks

4

 BCS-042

 Introduction to Algorithm Design

2

 MCSL-016

 Internet Concepts and Web Design

2

 BCSL-043

 Java Programming Lab

1

 BCSL-044

 Statistical Techniques Lab

1

 BCSL-045

 Algorithm Design Lab

1

>> BCA 5th Semester <<

COURSE CODE

 COURSE NAME

CREDITS

 BCS-051

 Introduction to Software Engineering

3

 BCS-052

 Network Programming and Administration

3

 BCS-053

 Web Programming

2

 BCS-054

 Computer Oriented Numerical Techniques

3

 BCS-055

 Business Communication

2

 BCSL-056

 Network Programming and Administration Lab

1

 BCSL-057

 Web Programming Lab

1

 BCSL-058

 Computer Oriented Numerical Techniques Lab

1

>> BCA 6th Semester <<

COURSE CODE

 COURSE NAME

CREDITS

 BCS-062

 E-Commerce

2

 MCS-022

 Operating System Concepts and Networking Management

4

 BCSL-063

 Operating System Concepts and Networking Management Lab

1

 BCSL-064

 Project

8


For the Solved Assignment : Read Another Post, All the solved Assignement Avalable here...

Some Tags of this Post :- 

IGNOU BCA Syllabus,BCA IGNOU,IGNOU BCA Subjects,ignou Solved Assignments,IGNOU syllabus,Ignou BCA,Ignou BCA Programme,BCA Syllabus of IGNOU Program

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