MCA

After completing this course, the learner will be able to:

CLO 2: Know how to use and implement the various data structures.

CLO 3: Implement the various features of Java Programming by writing suitable programs.

CLO 4: Designing and implementing applications in Java.

Task 1: Linked List Implementation

•       Implement a singly linked list in a programming language of your choice (e.g., C/C++, Java, Python).

•       Include functions/methods for insertion (at the beginning, end, and specific position), deletion, and traversal.

Task 2: Stack Operations

•       Implement a stack using an array or linked list.

•       Include functions/methods for push, pop, peek, and checking if the stack is empty or full.

Task 3: Queue Implementation

•       Implement a queue using an array or linked list.

•       Include functions/methods for enqueue, dequeue, peek, and checking if the queue is empty or full.

Task 4: Binary Search Tree (BST) Operations

•       Implement a binary search tree (BST) in your chosen programming language.

•       Include functions/methods for insertion, deletion, searching for a key, finding minimum and maximum values, and traversing the tree (inorder, preorder, postorder).

Task 6: Sorting Algorithms

•       Implement at least two sorting and searching algorithms (e.g., selection sort, insertion sort, merge sort, quick sort).

•       Compare their time complexity and performance using different input sizes.

•       Implement an adjacency list representation of a graph.

•       Include functions/methods for BFS (Breadth-First Search) and DFS (Depth-First Search) traversal of the graph.

1)      Write a Java program that converts temperatures between Celsius and Fahrenheit based on user input using methods for conversion and input validation.

2)      Implement a Java program to perform matrix addition, multiplication, and transpose operations using arrays and methods.

3)      Develop a Java program that converts a decimal number to its binary, octal, and hexadecimal equivalents using loops and methods.

4)      Create a Java program to simulate a simple bank account management system with features like deposit, withdrawal, and balance inquiry using classes, objects, and encapsulation.

5)      Write a Java program that reads a text file, counts the occurrences of each word, and displays the top N most frequent words using HashMap for storage and sorting.

6)      Implement a Java program to generate the first N prime numbers using a combination of loops, methods, and optimizations like the Sieve of Eratosthenes algorithm.

7)      Develop a Java program that takes a month and year as input and prints the calendar for that month using control flow statements and loops for date calculation.

8)      Write a Java program that generates different number patterns like pyramid patterns using nested loops and methods for pattern printing.

9)      Create a Java program to manage an employee payroll system with features for adding employees, calculating salaries based on hours worked or monthly salary, and generating pay slips using classes, inheritance, and polymorphism.

10)  Implement Java programs to compare the performance of different sorting algorithms (like quicksort, mergesort, and heapsort) on large arrays of integers, measuring and analyzing time complexity.

11) Develop a Java program that recursively searches a directory for files matching a given pattern and displays the file paths using recursion and file handling classes.

12)  Write a Java program to perform arithmetic operations (addition, subtraction, multiplication, division) on large numbers using BigInteger class and exception handling for division by zero.

13)  Implement a Java program to solve the Tower of Hanoi problem for N disks using recursion, demonstrating the steps and movements required.

14)  Write a Java program to find the largest and smallest elements in an array.

15)  Implement a Java program to sort an array of integers using bubble sort.

16)  Create a Java program to find the frequency of each element in an array.

17)  Develop a Java program to reverse an array without using an additional array.

18)  Write a Java program to merge two sorted arrays into a single sorted array.

19)  Define a Java class representing a Student with private instance variables and public getter and setter methods.

20)  Create a Java program to demonstrate constructor overloading in a class.

21)  Implement a Java program to calculate the area and perimeter of a rectangle using a class and object.

22)  Develop a Java program to implement inheritance by creating a base class Animal and derived classes like Dog and Cat.

23)  Write a Java program to demonstrate method overriding by implementing a base class Shape and derived classes like Circle and Rectangle.

(Lab hours include instructions for writing programs and demonstration by a teacher and for running the programs on computer by students.)