Essential C++ Programming Examples and Database Concepts

1. C++ Pointer Declaration and Initialization

Ans:

#include <iostream>
using namespace std;

int main() {
    int num = 10;
    int *ptr = &num;
    cout << "Value of num: " << num << endl;
    cout << "Address of num: " << &num << endl;
    cout << "Pointer ptr stores: " << ptr << endl;
    cout << "Value pointed by ptr: " << *ptr << endl;
    return 0;
}

2. C++ Program to Add Two 4x4 Matrices

Ans:

#include <iostream>
using namespace std;

int main() {
    int A[4][4], B[4][4], C[4][4];
    cout << "Enter elements of first 4x4 matrix:\n";
    for(int i = 0; i < 4; i++) {
        for(int j = 0; j < 4; j++) {
            cin >> A[i][j];
        }
    }
    cout << "Enter elements of second 4x4 matrix:\n";
    for(int i = 0; i < 4; i++) {
        for(int j = 0; j < 4; j++) {
            cin >> B[i][j];
        }
    }
    for(int i = 0; i < 4; i++) {
        for(int j = 0; j < 4; j++) {
            C[i][j] = A[i][j] + B[i][j];
        }
    }
    cout << "Sum of matrices:\n";
    for(int i = 0; i < 4; i++) {
        for(int j = 0; j < 4; j++) {
            cout << C[i][j] << " ";
        }
        cout << endl;
    }
    return 0;
}

3. C++ Program to Delete an Array Element

Ans:

#include <iostream>
using namespace std;

int main() {
    int arr[50], n, pos;
    cout << "Enter number of elements: ";
    cin >> n;
    cout << "Enter elements:\n";
    for(int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    cout << "Enter position to delete (1 to " << n << "): ";
    cin >> pos;
    for(int i = pos - 1; i < n - 1; i++) {
        arr[i] = arr[i + 1];
    }
    n--;
    cout << "Array after deletion:\n";
    for(int i = 0; i < n; i++) {
        cout << arr[i] << " ";
    }
    return 0;
}

4. C++ Program to Sort User-Entered Numbers

Ans:

#include <iostream>
using namespace std;

int main() {
    int arr[50], n;
    cout << "Enter number of elements: ";
    cin >> n;
    cout << "Enter numbers:\n";
    for(int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    for(int i = 0; i < n - 1; i++) {
        for(int j = 0; j < n - i - 1; j++) {
            if(arr[j] > arr[j + 1]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
    cout << "Sorted numbers (ascending):\n";
    for(int i = 0; i < n; i++) {
        cout << arr[i] << " ";
    }
    return 0;
}

K-Map Simplification

Definition: Karnaugh Map (K-map) simplification is a method used in Boolean algebra to simplify Boolean expressions. It reduces the number of terms and variables, minimizing the logic gates required in a digital circuit.

Advantages of K-Map

• Reduces the number of logic gates.
• Minimizes complexity of digital circuits.
• Faster and easier than algebraic simplification for multiple variables.

Three Properties of XML

1. Self-Descriptive: Data is enclosed in tags that describe its meaning (e.g., <age>17</age>).
2. Platform-Independent: XML works across different systems without compatibility issues.
3. Hierarchical Structure: Organizes data in a tree-like structure with a root and nested elements.

Two-Dimensional Array Definition

A two-dimensional array is an array of arrays that stores data in a table-like structure consisting of rows and columns. Each element is identified by two indices: one for the row and one for the column.

Advantages of JavaScript

• Client-Side Execution: Runs in the browser, reducing server load and improving interactivity.
• Easy to Learn: Simple syntax similar to other programming languages.
• Dynamic and Interactive: Enables features like form validation and animations without page reloads.
• Platform Independent: Runs on any browser or operating system.
• Supports OOP: Allows creation of objects and reusable code.
• Rich Interfaces: Supports drag-and-drop, sliders, and responsive designs.

Advantages of SQL

1. Easy to Use: Uses simple, English-like commands (SELECT, INSERT, UPDATE, DELETE).
2. Efficient Data Management: Handles large amounts of data effectively.
3. Data Accuracy and Security: Ensures integrity through constraints and controlled access permissions.

Database Terminology

• Relation: A table in a database storing data in rows (records/tuples) and columns (attributes/fields).
• Primary Key: A column or combination of columns that uniquely identifies each record.
• Alternate Key: A candidate key that was not chosen as the primary key.