MUJ MCA 2 SEM Solved Assignments JAN FEB 2026

SESSION	JAN 2026
PROGRAM	MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER	II
COURSE CODE & NAME	DCA6206 COMPUTER NETWORKS & PROTOCOLS

Assignment Set – 1

Q.1. Compare and contrast the OSI and TCP/IP reference models. Discuss the specific functions of each layer and justify why the TCP/IP model is considered the standard for the modern internet. (10 Marks)

Ans 1.

OSI Reference Model

The Open Systems Interconnection (OSI) model is a seven-layer conceptual framework that was developed in the International Organization for Standardization (ISO) in 1984 to standardize communication between diverse systems from different companies. It is a standard source of information on network communication through the division that is data exchange in seven different layers, each one with its own specific responsibility and well-defined interfaces to adjacent layers.

Physical Layer (Layer 1) manages the transmission of data over physical media. It also defines

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/ assignment

MUJ Manipal University Complete SolvedAssignments JAN- FEB 2026

buy cheap assignment help online from us easily

we are here to help you with the best and cheap help

Contact No – 8791514139 (WhatsApp)

Mail us- [email protected]

Our website – https://muj.assignmentsupport.in/

JAN-FEB 2026

Q.2. Analyze the Address Resolution Protocol (ARP) and Reverse ARP (RARP). Explain their working mechanisms, roles in mapping IP addresses to physical MAC addresses, and their significance in legacy systems or diskless workstations. (10 Marks)

Ans 2.

Address Resolution Protocol (ARP)

The Address Resolution Protocol (ARP) is a networking protocol running at the boundary between the Network Layer (Layer 3) and the Data Link Layer (Layer 2) that resolves logical IPv4 addresses to physical addresses known as MAC (Media Access Control) addresses. Within the Ethernet network Data frames are transmitted using MAC addresses with 48 bits rather than IP addresses. When a host must forward a message for delivery to an IP destination on the same network segment to determine the destination’s MAC address before constructing an Ethernet

Q.3. Describe the structure of an IP datagram and explain the processes of fragmentation and reassembly, highlighting the role of the Maximum Transmission Unit (MTU). (10 Marks)

Ans 3.

IP Datagram Structure

An IP Datagram (or datagram) is the main protocol data unit for the Internet Protocol, encapsulating data for delivery across interconnected networks. The IPv4 datagram comprises the variable length header (minimum 20 bytes) and a payload. The header contains important fields to control routing, fragmentation, and processing errors.

Version (4 bits) The four bits indicate the IP version (4 for IPv4). IHL (Internet Header Length, 4

Assignment Set – 2

Q.4. Evaluate the Transport Layer protocols: TCP and UDP. Compare their segment structures, features (connection-oriented vs connectionless), and mechanisms for flow and congestion control. Provide examples of applications suited to each. (10 Marks)

Ans 4.

TCP – Transmission Control Protocol

TCP is a connection-oriented and solid transport protocol, which offers assured, ordered and error-checked transmission of a stream of data between applications. Before data exchange begins, TCP establishes a connection via a three-way handshake. the client transmits a SYN segment to the server, it responds with a SYN-ACK message, then the client confirms this by sending an ACK and establishes synchronized sequence numbers for tracking positions of byte

Q.5. Examine the differences between Symmetric Key Encryption (e.g., DES) and Public Key Encryption (e.g., RSA algorithm), and explain how Digital Signatures ensure data integrity and authentication. (10 Marks)

Ans 5.

Symmetric Key Encryption – DES

Symmetric key encryption employs the same secret code for both encryption and decryption. This is known as the Data Encryption Standard (DES) was developed by IBM and was adopted as the US Federal Standard at the time of its adoption in 1977 was the most popular symmetric cipher for over two decades. DES operates on 64-bit blocks of plaintext, using a 56-bit key. It uses 16 round substitution and permutation operations to produce 64-bit encrypted text. The

Q.6. Discuss the architecture of a Simple Network Management Protocol (SNMP) system and explain how techniques like Network Address Translation (NAT) and Demilitarized Zones (DMZ) are used as security strategies in network management. (10 Marks)

Ans 6.

SNMP Architecture

Simple Network Management Protocol (SNMP) is the protocol of choice that monitors, directing, and configuring networks, including routers, printers, switches, servers as well as IoT devices via a central management station. SNMP runs on UDP (port 161 for agents, port 162 to trap receivers) and employs a manager agent design with three key components. Network Management Station (NMS) is the centralized software platform that runs on a dedicated server, periodically monitors managed devices to get status information, collects and analyzes

MUJ MCA 2 SEM Solved Assignments JAN FEB 2026

SESSION	FEB-MARCH 2026
PROGRAM	MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER	II
COURSE CODE & NAME	DCA6207 OBJECT ORIENTED PROGRAMMING USING JAVA

Assignment Set – 1

Q.1. What are the different types of constructors in Java? Explain each type with code examples. (10 Marks)

Ans 1.

The constructor of Java is a specific block of code which is invoked automatically when an object is created with the help of the new keyword. It is used to initialize the newly-created object and assigns its instance variables according to their appropriate beginning values. Constructors are named after the class, have no return type and are not abstract, static, or end-of-life. Java has three major types of constructors.

Default Constructor

A default constructor takes no parameters. When it’s explicitly declared it will set instance

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/ assignment

MUJ Manipal University Complete SolvedAssignments JAN- FEB 2026

buy cheap assignment help online from us easily

we are here to help you with the best and cheap help

Contact No – 8791514139 (WhatsApp)

Mail us- [email protected]

Our website – https://muj.assignmentsupport.in/

JAN-FEB 2026

Q.2. a) What are the different types of control statements? b) Write a Java program to find the sum of 1+3+5+… for 10 terms in the series. (5+5 = 10 Marks)

Ans 2.

a) Types of Control Statements in Java

Control statements determine the order that statements run in the Java program. They allow execution to branch, loop or even jump depending on the runtime environment. Without them every program would operate linearly from top bottom. Java is divided into three primary categories.

Selection Statements allow choosing different pathways based on certain conditions. The if

Q.3. What are filter streams in Java? Explain their purpose and give examples of commonly used filter stream classes. (10 Marks)

Ans 3.

In Java’s I/O framework the streams are split into node and filter streams. Node streams can be directly connected to a data source or destination such as networks, files, or memory array and execute raw byte and character transfer. Filter streams do not connect to data sources directly. They surround an existing stream to add transparent functions for processing or buffering the data flowing through it. It is based on the Decorator design pattern and allows flexible selection

Assignment Set – 2

Ans 4.

a) Interface vs Abstract Class

Abstract classes as well as interfaces can be used to create abstraction within Java however they are different in purpose, capability and proper usage context.

An abstract class is declared using the abstract keyword and is able to contain abstract methods that are defined without body, and need to be implemented with concrete subclasses and concrete methods with full implementations that subclasses inherit directly. An abstract class can have

Q.5. Describe the architecture of a JDBC application. What are the key components involved? (10 Marks)

Ans 5.

Java Database Connectivity (JDBC) is the most widely used Java API for connecting to the relational database, processing SQL, and processing query results. It provides a database-vendor-independent interface, allowing application code to work with any supported database by changing only the driver and connection URL. It is built on two major layers which are: it is the JDBC API layer utilized by developers, and the JDBC driver layer offered by vendors of

Q.6. How do you implement inheritance in Java? (10 Marks)

Ans 6.

Inheritance is a part of the four fundamental principles of Object-Oriented Programming. It enables a new class called the subclass child class to take on the techniques and fields used by an existing class known as the parent or superclass. It encourages reuse of code through defining common attributes and behaviours when in the parent class, which the children all inherit. may extend or override. In Java, inheritance is implemented through the extends keyword of classes,

SESSION	JAN 2026
PROGRAM	MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER	II
COURSE CODE & NAME	DCA6208 OPERATING SYSTEM

Assignment Set – 1

1.a)Define the different types of the Functions of Operating System.

b) Explain how object-oriented programming principles are used in the Solaris operating system to support a modular kernel design.

Ans 1.

a) Functions of an Operating System

The Operating System (OS) is a system software which manages hardware and software resources, and gives services to software. It serves as an interface between hardware and user devices, ensuring efficient, reliable and safe use of resources on the system.

Process Management: This OS creates, schedules, suspends, resumes, and terminates processes. It controls the process’s time and allocates it to multiple processes by using scheduling

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/ assignment

MUJ Manipal University Complete SolvedAssignments JAN- FEB 2026

buy cheap assignment help online from us easily

we are here to help you with the best and cheap help

Contact No – 8791514139 (WhatsApp)

Mail us- [email protected]

Our website – https://muj.assignmentsupport.in/

JAN-FEB 2026

Explain single-threaded and multithreaded processes. How does a multithreaded process improve performance in modern operating systems?

Ans 2.

Single-Threaded Processes

A program is one running that is working with its own memory space and data. It also has code and resources allocated by the operating system. One-threaded processes contain only one execution thread -that is, a single flow of control that executes instructions sequentially. At any point just one instruction is in process at a time, and the program must complete each operation before going to the next. In the beginning, processes on operating systems used single-threaded.

Explain non-preemptive scheduling and how it differs from pre-emptive scheduling.

Ans 3.

Non-Preemptive Scheduling

CPU scheduling is the operating system mechanism that determines which processes within the ready queue is allocated the CPU at any given moment. Non-preemptive schedule, also known as cooperative scheduling is a technique for scheduling CPU where a particular process is allocated the CPU, it is in control until decides to release the CPU, either by stopping, entering a waiting condition due to an input request, or explicitly surrendering the control. The scheduling system

Assignment Set – 2

What is deadlock prevention? Explain the four necessary conditions required for a deadlock to occur. Also, describe how deadlock avoidance can be achieved.

Ans 4.

Deadlock Prevention and Necessary Conditions

Deadlock refers to a situation where a set of operations are blocked as each process holds resources while waiting to acquire assets held by processes in the set, leading to a waiting cycle in which there is no way for a process to be able to continue. Deadlock prevention is a proactive approach that guarantees at least at the very least one of four conditions to prevent deadlock from

a) Explain the concept of segmentation and how it supports the user’s view of memory.
b) Define the different types of security attacks that target operating system.

Ans 5.

a) Segmentation and User’s View of Memory

Segmentation is a memory-management technique that divides memory into logical units of different sizes named segments. Each segment is a distinct element of the program such as code, variables, functions stacks, arrays, as well as data structure. Unlike paging, segmentation matches what the programmer’s mind naturally sees of programs as a set of distinct logical parts.

A logical address in an organization’s segmentation system has two elements that are a segment

Differentiate between sequential access, direct access, and indexed sequential file access methods in file systems.

Ans 6.

Sequential Access

Sequential access is the easiest and most well-known method for accessing files that reads or written in a strict sequential order starting from the first of the file up to its close of the file. Every read operation is able to retrieve the current record and automatically forwards the pointer of the file towards the following record. The only valid operations are read-next (reads the record in question and increases the position of the pointer) as well as write-next (appends to the

MUJ MCA 2 SEM Solved Assignments JAN FEB 2026

SESSION	JAN 2026
PROGRAM	MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER	II
COURSE CODE & NAME	DCA6209 DATA STRUCTURES & ALGORITHM

Assignment Set – 1

Q.1. Explain the concept of algorithm complexity. Discuss different types of complexity and analyze the time complexity of a simple linear search algorithm using asymptotic notation. (10 Marks)

Ans 1.

Algorithm Complexity

The measure of complexity in an algorithm is of computational resources- primarily time and memory — consumed by an algorithm in proportion of its input. Complexity analysis enables computer engineers and scientists to predict how an algorithm is going to scale as the size of input expands, to compare algorithms that solve the same challenge and identify bottlenecks in performance and make informed implementation choices without needing to run the algorithm

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/ assignment

MUJ Manipal University Complete SolvedAssignments JAN- FEB 2026

buy cheap assignment help online from us easily

we are here to help you with the best and cheap help

Contact No – 8791514139 (WhatsApp)

Mail us- [email protected]

Our website – https://muj.assignmentsupport.in/

JAN-FEB 2026

Q.2. Explain the structure of a linked list. Describe insertion and deletion operations with suitable examples. (10 Marks)

Ans 2.

Structure of a Linked List

An linked list (also known as an array) is a dynamic data structure consisting from a set of elements called nodes, where each node has data as well as an identifier (pointer or link) to the next one within the sequence. In contrast to arrays, linked lists do not include elements stored in contiguous memory places. Instead, nodes are distributed in memory, linked via pointers that allow for dynamic size adjustment — the list is able to expand or shrink during the time of

Q.3. Define stack and queue. Explain their implementation and applications with examples. (10 Marks)

Ans 3.

Stack – Definition and Implementation

A stack is a linear data structure that operates according to the Last In First Out (LIFO) principle. The element which was added the most recently to the stack is the first one to be eliminated. It is visualized in terms of the physical plate stack which have new plates placed on top. Only the highest plate is able to be taken off at any point. The stack is able to support three key processes:

Q.4. Explain external sorting. Why is it required, and how are extended initial runs generated during sorting on disks? Illustrate with an example. (10 Marks)

Ans 4.

External Sorting – Concept and Need

External sorting refers specifically to sorting algorithms designed to handle massive amounts of data to fit entirely in the main memory (RAM) and, therefore, must be backed up using slower storage devices, such as magnetic disks or solid state drives throughout the sorting process. In the event that the information to be sorting — which might include gigabytes and terabyteshas a larger capacity than RAM, internal sorting algorithms like QuickSort and MergeSort are not able

Q.5. What is static hashing? Explain how direct files are organized using hashing and discuss collision resolution methods. Also differentiate static hashing from dynamic hashing. (10 Marks)

Ans 5.

Static Hashing and Direct File Organization

Hashing is the process that transforms key values into an address within a storage structure by using a hash function that allows for an average O(1) time retrieval of records without sequential search. In the organization of files, static hashing uses the fixed size of a hash table, in which the bucket size is predetermined and does not change according to the rate at which the file expands or shrinks. The hash function h(k) converts the search key k bucket numbers within the range of

Q.6. Describe different file organization methods: Sequential files, Indexed Sequential Files, and Direct files. Explain where each method is best used. (10 Marks)

Ans 6.

Sequential File Organization

Records are stored in a sequential file structure with respect to their physical order which they’re added into the file. They are also sorted using an important field. The records are accessible by order of appearance from beginning of the file until the end. In a sorted sequential format, records are arranged in ascending or descending order of the key that is used to enable the search of binary data within files stored in memory. Operations such as read-next (advances through the

SESSION	JAN 2026
PROGRAM	MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER	II
COURSE CODE & NAME	DCA6210 COMPUTER ARCHITECTURE

Assignment Set – 1

Q.1. What is mapping? Explain the difference between Direct and Associative mapping. (10 Marks)

Ans 1.

Mapping in Cache Memory

Mapping is the act of establishing a correspondence between main memory blocks as well as lines (slots) inside the cache memory. It determines where the particular piece of memory is stored in cache. The goal of mapping is that, when a CPU attempts to request an address for memory and the cache controller has the ability to quickly determine whether the required data is present in cache (a cache hit) or must be fetched from main memory (a cache error). The effectiveness of the mapping strategy directly affects the frequency of cache hits as well as

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/ assignment

MUJ Manipal University Complete SolvedAssignments JAN- FEB 2026

buy cheap assignment help online from us easily

we are here to help you with the best and cheap help

Contact No – 8791514139 (WhatsApp)

Mail us- [email protected]

Our website – https://muj.assignmentsupport.in/

JAN-FEB 2026

Q.2. Write in brief the process of implementation of FX pipelines. (10 Marks)

Ans 2.

FX Pipelines in Computer Architecture

Fixed-point (FX) math pipelines are special hardware machines designed for Arithmetic operations that are fixed point, such as subtraction or subtraction, multiplication and division with integer or fixed-point binary numbers using an architecture of pipelines that spans various independent operations, resulting in higher efficiency. Fixed-point representation stores numbers with an implicit binary point located at an exact location, which makes the arithmetic functions directly attainable on hardware with integer components with no need for floating-point

Q.3. What are different types of addressing modes? Explain in detail. (10 Marks)

Ans 3.

Addressing Modes in Computer Architecture

Addressing mode defines what the operation of an instruction is specified how effectively the address of data being operated on is calculated from the address field within the instruction. Different types of addressing provide compilers and programmers with various options to access

Assignment Set – 2

Q.4. What do you understand by Parallel Processing? What are the different types of Parallel Processing? (10 Marks)

Ans 4.

Parallel Processing

Parallel processing is a type of computational process where several operations or tasks are carried out simultaneously by using different processing units (processors, cores, or specific hardware) working concurrently on different parts of a problem. In contrast to conventional processing where the operations take place one at a time on a single processor. Parallel processing takes advantage of the inherent parallelism in many computational problems it is

Q.5. What do you mean by Hazards? Explain the types of Hazards. (10 Marks)

Ans 5.

Pipeline Hazards – Introduction

In a pipelined processor multiple instructions are in different levels of execution at once. Hazards are a situation that blocks the next instruction to execute within its specified clock cycle. This could cause the process to stop (insert insert idle periods, also known as bubbles) or produce inaccurate outcomes or need special handling for ensuring proper execution of the program. These are the biggest design issues when it comes to pipelined processors as they reduce the

Q.6. Explain the concept of dynamic scheduling in detail. (10 Marks)

Ans 6.

Dynamic Scheduling

Dynamic scheduling is a method used by modern high-performance processors that allows the processor to execute instructions in a different order than the order of execution in which it was originally programmed for the purpose of improving performance, while ensuring that outcomes are equivalent to the results obtained from strictly sequential execution. It’s the hardware alternative to compiler-level instruction order reordering which operates in real-time throughout

SESSION	FEB-MARCH 2026
PROGRAM	MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER	II
COURSE CODE & NAME	DCA6303 CYBER SECURITY ESSENTIALS

Assignment Set – 1

Q.1. Define Cybersecurity Threat Actors and explain the characteristics of Hackers and Insiders. Analyze the motivations and attack methods of Nation States and Organized Criminal Groups with examples. (5+5 = 10 Marks)

Ans 1.

a) Cybersecurity Threat Actors: Hackers and Insiders

A cyber-security threat actor is anyone, group, or organization that deliberately compromises the integrity, confidentiality, or availability or integrity of systems for information. Understanding threat actor profiles is the key to designing efficient security measures.

Hackers attack technical flaws on networks, systems or even applications. Professionals who

MUJ

Its Half solved only

Buy Complete assignment from us

Price – 190/ assignment

MUJ Manipal University Complete SolvedAssignments JAN- FEB 2026

buy cheap assignment help online from us easily

we are here to help you with the best and cheap help

Contact No – 8791514139 (WhatsApp)

Mail us- [email protected]

Our website – https://muj.assignmentsupport.in/

JAN-FEB 2026

Q.2. Explain the concept and working of Firewalls in network security. Compare Intrusion Detection Systems (IDS) and Firewalls in terms of functionality and effectiveness. (5+5 = 10 Marks)

Ans 2.

a) Firewalls in Network Security

A firewall is a network security device or software which monitors and regulates incoming as well as outgoing traffic according to established security guidelines. It is a security device that acts as a wall between a secure internal network and external networks that are not trusted, such as the internet, applying access control rules by permitting or blocking traffic in accordance with predefined rules. Firewalls constitute the primary protection in any design and implementation of

Q.3. List and explain the phases of Incident Response. Evaluate the importance of Incident Response planning in minimizing cyber damage. (5+5 = 10 Marks)

Ans 3.

a) Phases of Incident Response

Incident Response is the standardized process of planning to detect, contain, and recovering from cybersecurity incidents. The NIST framework identifies six phases to guide organizations through effective incident management.

Preparedness involves forming the IR group, delineating roles and responsibilities, creating response playbooks, acquiring monitoring equipment, as well as conducting workshops and

Assignment Set – 2

Q.4. Explain Symmetric Encryption with its advantages and limitations. Describe Asymmetric Encryption and compare it with Symmetric Encryption. (5+5 = 10 Marks)

Ans 4.

a) Symmetric Encryption: Advantages and Limitations

Symmetric encryption makes use of a shared secret key, which is utilized for encrypting plaintext into ciphertext and decrypting plaintext. Both parties involved must hold the same secret key prior to any secure exchange is able to begin. The most commonly used algorithms are AES, 3DES, and ChaCha20. AES-256 is currently the most widely used industry standard in

Q.5. Explain the role of Artificial Intelligence in Cybersecurity. Analyze the advantages and challenges of using AI in Cybersecurity systems. (5+5 = 10 Marks)

Ans 5.

a) Role of Artificial Intelligence in Cybersecurity

Artificial Intelligence has become a revolutionary technology in cybersecurity, enabling organisations to identify, react to threats and stop them from happening at a scale and speed impossible by human analysts on their own. Traditional systems based on rules handle threats well, however they fail to tackle emerging, fast-changing pattern of attack. AI addresses this by learning using large data sets of security to identify patterns, predict threats, and automate

Q.6. Explain the concept of Quantum Cryptography and its significance in modern cybersecurity. Discuss the role of Threat Intelligence in proactive cyber defense. Analyze how organizations use it to prevent attacks. (5+5 = 10 Marks)

Ans 6.

a) Quantum Cryptography and Its Significance

Quantum cryptography uses principles from quantum mechanics to build digital systems with security assurances founded on physical laws than computational hardness assumptions. The most mature application has been Quantum Key Distribution (QKD) that allows two parties to share the same cryptographic key with a fundamental physical security aspect: any attempts to eavesdrop are automatically detected.

In the BB84 QKD protocol, the sender transmits photons which are quantum-stated and encode

To upload your assignment, synopsis, or project, please click the link below:
👉 Click Here to Upload

To check your Manipal University Exam Result 2021, click the link below:
👉 Click Here to View Results

MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026MUJ MCA 2 SEM Solved Assignments JAN FEB 2026