MCA 1st Semester Practical Examination Paper Summary || PPU | Patna | MCA | Syllabus || Allrounder Sita Ram Sahu || Subscribe

 

1MCACCC4 – PRACTICAL EXAMINATION (Paper Summary)

This paper focuses on practical implementation of the concepts taught in other subjects during Semester I. It emphasizes hands-on experience with coding, algorithms, and database management systems. The total marks are 100, evaluated entirely through practicals, with no theoretical exams for this paper.

---

Scope of Practical Examination

The practicals are conducted based on the syllabus of the following courses (whichever are opted by the candidate):

1. Database Management Systems (1MCACCC1)
2. Data Structure and Algorithms with C (1MCACCC2)
3. Additional Courses (e.g., electives like VB.NET, IoT, Linux, etc.)

---

Evaluation Areas

The practical examination tests the following skills:

1. Problem-solving and Algorithm Development:

   • Designing and implementing algorithms in C or other programming languages.
   • Applying sorting, searching, and traversal algorithms.

2. Database Handling:

   • SQL queries, database creation, and table operations (CRUD - Create, Read, Update, Delete).
   • Writing advanced queries involving joins, subqueries, and triggers.

3. Application Development:

   • Creating small projects or programs that use the concepts from core subjects.
   • Examples: Linked lists, stacks, queues, or DBMS-backed applications.

4. Implementation of Theoretical Concepts:

   • Testing practical understanding of OS topics like memory management or process scheduling.

---

Examples of Practical Tasks

Here are examples of tasks that might be tested:

From Database Management Systems (DBMS):

1. Write SQL queries to create, manipulate, and retrieve data from relational databases.
2. Implement transaction management and recovery using SQL commands.

From Data Structures and Algorithms with C:

1. Implement a linked list with insertion and deletion operations.
2. Create a stack and apply it to reverse a string or evaluate postfix expressions.
3. Implement sorting algorithms like Quick Sort or Merge Sort.

From Electives like VB.NET or IoT:

1. Design a login module using VB.NET and validate user credentials.
2. Interface sensors with Raspberry Pi in IoT and print temperature readings.

---

Key Features of the Paper

1. Hands-on Learning:
   • Focuses on applying theoretical knowledge to practical scenarios.
2. Customizable:
   • Practical tasks can be chosen based on the student’s opted courses.
3. No Written Exams:
   • Entire evaluation is based on practical performance.

---

Here Solving specific practical examples ---

---

MCA - 1st Sem Practical Assignment

Paper Code: 4018-04
Full Marks: 100

Note: Answer it in a practical copy (not in stock file).

Q1:

Write a 'C' program to perform insertion & deletion operations in a singly linked list.

Q2:

a) Create a database employee.
b) Insert 10 records into it.
c) Apply selection & projection processes.
d) Write a query for each logical operator command — AND, OR, & NOT.

Q3:

What are wildcard characters in Unix? Explain their usage separately with examples.

---

Would you like help solving any of these? sitaramsahu.blogspot.com

---

Answer:

Here are the solutions to the questions:

---

Q1: C Program for Insertion and Deletion in a Singly Linked List

#include <stdio.h>
#include <stdlib.h>

struct Node {
    int data;
    struct Node* next;
};

// Function to insert a node at the beginning
void insertAtBeginning(struct Node** head, int newData) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = newData;
    newNode->next = *head;
    *head = newNode;
}

// Function to delete a node by value
void deleteNode(struct Node** head, int key) {
    struct Node* temp = *head, *prev = NULL;

    if (temp != NULL && temp->data == key) {
        *head = temp->next;
        free(temp);
        return;
    }

    while (temp != NULL && temp->data != key) {
        prev = temp;
        temp = temp->next;
    }

    if (temp == NULL) return;

    prev->next = temp->next;
    free(temp);
}

// Function to print the linked list
void printList(struct Node* node) {
    while (node != NULL) {
        printf("%d -> ", node->data);
        node = node->next;
    }
    printf("NULL\n");
}

int main() {
    struct Node* head = NULL;

    insertAtBeginning(&head, 10);
    insertAtBeginning(&head, 20);
    insertAtBeginning(&head, 30);

    printf("Linked List after insertion: ");
    printList(head);

    deleteNode(&head, 20);
    printf("Linked List after deletion: ");
    printList(head);

    return 0;
}

---

Q2a-d: SQL Commands

a) Create a Database employee

CREATE DATABASE employee;
USE employee;

b) Insert 10 Records

CREATE TABLE employees (
    id INT AUTO_INCREMENT PRIMARY KEY,
    name VARCHAR(50),
    age INT,
    department VARCHAR(50),
    salary DECIMAL(10, 2)
);

INSERT INTO employees (name, age, department, salary) VALUES
('John', 30, 'IT', 50000),
('Alice', 28, 'HR', 45000),
('Bob', 35, 'Finance', 60000),
('Eve', 25, 'Marketing', 40000),
('Mark', 40, 'IT', 70000),
('Sara', 32, 'HR', 48000),
('Tom', 29, 'Finance', 52000),
('Jane', 27, 'Marketing', 42000),
('Paul', 38, 'IT', 65000),
('Diana', 26, 'HR', 47000);

c) Apply Selection and Projection

• Selection: Retrieve employees in the IT department.

SELECT * FROM employees WHERE department = 'IT';

• Projection: Retrieve only name and salary of all employees.

SELECT name, salary FROM employees;

d) Logical Operator Queries

• AND: Retrieve employees in IT department with a salary greater than 60000.

SELECT * FROM employees WHERE department = 'IT' AND salary > 60000;

• OR: Retrieve employees in HR or Marketing departments.

SELECT * FROM employees WHERE department = 'HR' OR department = 'Marketing';

• NOT: Retrieve employees not in the Finance department.

SELECT * FROM employees WHERE NOT department = 'Finance';

---

Q3: Wildcard Characters in Unix

Definition:

Wildcard characters are used in Unix to match files or directories based on patterns.

1. * (Asterisk): Matches zero or more characters.
   Example:

   ls *.txt
   

   Lists all .txt files in the directory.

2. ? (Question Mark): Matches exactly one character.
   Example:

   ls file?.txt
   

   Lists files like file1.txt, fileA.txt, but not file10.txt.

3. [ ] (Square Brackets): Matches any one character within the brackets.
   Example:

   ls file[1-3].txt
   

   Lists files like file1.txt, file2.txt, file3.txt.

4. {} (Curly Braces): Expands to a set of strings.
   Example:

   ls file{1,2,3}.txt
   

   Lists file1.txt, file2.txt, file3.txt.

Would you like any further clarification or help with implementing these? comment💬 

:

---

Allrounder Sita Ram Sahu