Notes, summaries, assignments, exams, and exercises for Computer science for Other courses

Digital Entrepreneurship

Digital entrepreneurship refers to the process of creating a business on the internet and selling products online. This model eliminates the need for physical business operations. Examples include online courses, e-commerce, blogs, and YouTube channels.

Search Engine Optimization (SEO)

SEO is the process of increasing a website's visibility on the internet when users search for products or services related to the business on Google or other search engines.

Business Planning

A business plan is a document that describes the company's objectives, operations, marketing goals, and financial projections. Key components include:

• Executive Summary: A brief explanation of the business idea.
• Business Description and Structure: Details

Algorithm Implementations in C#

Coin Change: Number of Ways

Calculates the number of ways to make change for amount N using given coin denominations.

• Time Complexity: O(N * C), where C is the number of coins.
• Space Complexity: O(N).

static long GetNumberOfWays(long N, long[] Coins)
{
    long[] ways = new long[(int)N + 1];
    ways[0] = 1;
    for (int i = 0; i < Coins.Length; i++)
    {
        for (int j = 0; j < ways.Length; j++)
        {
            if (Coins[i] <= j)
            {
                ways[j] = ways[j] + ways[(int)(j - Coins[i])];
            }
        }
    }
    return ways[(int)N];
}

Coin Change: Minimum Number of Coins

Determines the minimum number of coins needed to make change for a given amount.

• Time Complexity: O(

1. Keyword

Definition:
A keyword is a reserved word in C language that has a predefined meaning. Keywords cannot be used as names of variables, functions or identifiers.

Examples of Keywords:
int, float, if, else, while, return

Example:

int a = 10;

2. Constant

Definition:
A constant is a value that does not change during the execution of a program.

Types of Constants:

• Integer constant

• Floating constant

• Character constant

Example:

#define PI 3.14

3. Identifier

Definition:
An identifier is the name given to a variable, function or array in a program.

Rules for Identifiers:

• Must start with a letter or underscore

• Should not be a keyword

Example:

int totalMarks;

4. Variable

Definition:
A variable is a memory location used to store data whose value can change during program...

Polymorphism in C++

Polymorphism is a fundamental pillar of Object-Oriented Programming (OOP). The term is derived from two Greek words: Poly (many) and Morph (forms). Therefore, polymorphism signifies one name having many forms.

In C++, polymorphism enables the same function or operator to perform different operations depending on the context.

Why Use Polymorphism?

• Improves code flexibility
• Reduces complexity
• Increases readability
• Supports code reuse
• Facilitates generic programming

Types of Polymorphism in C++

Polymorphism in C++ is categorized into two primary types:

1. Compile-Time (Static) Polymorphism

Compile-time polymorphism is resolved during the compilation phase. The compiler determines which function to invoke based on the function definition....

Advantages of the System Approach

• Holistic View: Provides a comprehensive perspective of the organization, facilitating better decision-making.
• Coordination: Improves efficiency by integrating all departments and functions.

Types of Knowledge

• Explicit Knowledge: Knowledge that is documented and easily shared (e.g., manuals, reports).
• Tacit Knowledge: Personal experience-based knowledge that is difficult to express in words (e.g., skills, intuition).

Internet Protocols

• HTTP (Hypertext Transfer Protocol): Used for transferring web pages over the internet.
• FTP (File Transfer Protocol): Used for transferring files between computers on a network.

Origins of Fuzzy Logic

Fuzzy logic was proposed in 1965 by Lotfi A. Zadeh.

Functions of the CPU

• Arithmetic and Logic

Fundamental Sorting Algorithms in C

This document provides standard C implementations for three essential comparison-based sorting algorithms: Merge Sort, Quick Sort, and Heap Sort. These examples demonstrate the core logic and structure of each algorithm.

Merge Sort Implementation

Merge Sort is a stable, divide-and-conquer algorithm known for its consistent O(n log n) time complexity.

#include <stdio.h>

void merge(int a[], int l, int m, int r) {
    int i=l, j=m+1, k=0, b[100];
    while(i<=m && j<=r) {
        if(a[i]<a[j]) b[k++]=a[i++];
        else b[k++]=a[j++];
    }
    while(i<=m) b[k++]=a[i++];
    while(j<=r) b[k++]=a[j++];
    for(i=l,k=0;i<=r;i++,k++) a[i]=b[k];
}

void mergesort(int a[], int l, int

Expressions and Operators Fundamentals

Expressions Defined

What constitutes a valid expression in programming?

Understanding Operators

Operator Definition and Types

An operator is a symbol that represents a computation. What are the three primary types of operators?

• Unary: Operates on one operand (e.g., -x).
• Binary: Operates on two operands (e.g., x + y).
• Ternary: Operates on three operands (e.g., (a > b) ? a : b).

Order of Operation and Precedence

How is the order of operation determined? What mechanisms can be used to change the default order of operation?

Order is typically governed by Operator Precedence Rules and Associativity Rules (e.g., left-to-right). Parentheses can be used to override the default order.

Conditional Expressions

What is a conditional...

1.) What is computational complexity theory, and why is it important? It studies how efficiently problems can be solved using algorithms. 2.) Explain the difference between time complexity and space complexity. Time complexity measures how the runtime of an algorithm grows with input size, while space complexity measures how much memory an algorithm uses as input size grows. 3.) What are P and NP classes in complexity theory? P contains problems that can be solved quickly (in polynomial time), while NP contains problems whose solutions can be verified quickly. 4.) What does it mean when a problem is NP-complete? It means the problem is one of the hardest in NP; solving one NP-complete problem quickly means all NP problems can be solved quickly....

Single Inheritance in Java

Single inheritance involves one class inheriting properties and methods from exactly one parent class. Below is a demonstration using the Animal and Dog classes.

class Animal {
    Animal() {
        System.out.println("Animal constructor called");
    }
    void eat() {
        System.out.println("I can eat");
    }
}

class Dog extends Animal {
    Dog() {
        System.out.println("Dog constructor called");
    }
    void bark() {
        System.out.println("I can bark");
    }
}

public class Main {
    public static void main(String[] args) {
        Dog myDog = new Dog();
        myDog.eat();
        myDog.bark();
    }
}

Implementing Multiple Inheritance using Interfaces

Java does not support multiple inheritance...