Notes, summaries, assignments, exams, and problems for Computers

Core OOP Definitions

Class and Object

• Class: A user-defined data structure that binds data members and operations (methods) into a single unit.
• Object: An instance of a class. Objects are used to perform actions or allow interactions based on the class definition.

Variables and Attributes

• Method: An action performed using the object's attributes.
• Attributes: Characteristics or properties of a class. Also known as instance variables (declared outside methods, belonging to one object). They are accessible through static and public methods.
• Class Variable: Declared using the static keyword; shared among all objects of the class.
• Local Variables: Declared inside methods, constructors, or blocks; they exist only while the method runs. They cannot be accessed

PHP Core Concepts: Quick Answers

PHP Array Types

• Indexed Array: A normal array with numeric keys.
• Associative Array: An array with named keys (strings).
• Multidimensional Array: An array containing one or more other arrays.

PHP Arithmetic Operators

• + (Addition): Adds two operands.
• - (Subtraction): Subtracts the second operand from the first.
• * (Multiplication): Multiplies two operands.
• / (Division): Divides the first operand by the second.
• % (Modulus): Returns the remainder of a division.

Understanding PHP Abstract Classes

An abstract class in PHP is a class that cannot be directly instantiated. It may contain abstract methods that must be defined (implemented) in any child classes that inherit from it.

What is a Sticky Form?

A sticky form is a web form that... Continue reading "PHP & Web Development Essentials: Core Concepts" »

Recursive Binary Tree Traversals

Inorder Traversal:

void inorder(struct node *root)
{
  if(root != NULL)
  {
    inorder(root->left);
    printf("%d\t", root->data);
    inorder(root->right);
  }
}

Preorder Traversal:

void preorder(struct node *root)
{
  if(root != NULL)
  {
    printf("%d\t", root->data);
    preorder(root->left);
    preorder(root->right);
  }
}

Postorder Traversal:

void postorder(struct node *root)
{
  if(root != NULL)
  {
    postorder(root->left);
    postorder(root->right);
    printf("%d\t", root->data);
  }
}

Linked List Operations

Search

void search(struct node *head,int key)
{
  struct node *temp = head;
  while(temp != NULL)
  {
    if(temp->data == key)
      printf("key found");
    temp =

Q1. Inheritance in Java (10 Marks)

Inheritance is an important feature of object-oriented programming that allows one class to acquire the properties and methods of another class. The class that gives its features is called the parent class or superclass, and the class that receives them is called the child class or subclass. In Java, inheritance is implemented using the extends keyword.

There are three main types of inheritance in Java:
(1) Single-level inheritance – one parent and one child class.
(2) Multilevel inheritance – one class inherits another, and another class further inherits it.
(3) Hierarchical inheritance – one parent class is inherited by multiple child classes.

Java does not support multiple inheritance using classes to... Continue reading "Core Java Concepts: Inheritance, Polymorphism & OOP" »

Algorithms

Algorithms involve inputs, instructions, outputs, and a purpose.

Instruction Types

• Instruction
• Decision
• Loop
• Variable
• Function

Python Basics

Comments

Comments explain what code is for, intended for human readers.

Variables

Storing a value in a variable is called assignment. It's best practice not to use generic names.

Calculations (Operators)

• + : Addition
• - : Subtraction
• * : Multiplication
• / : Division
• // : Integer Division (e.g., 6 // 4 = 1)
• % : Remainder / Modulo (e.g., 6 % 4 = 2)
• ** : Exponentiation

mass_in_kg = 15

weight_in_pounds = mass_in_kg * 2.2

print('the weight in pounds is: ', weight_in_pounds)

user_name = input("enter your user name: ")

print('hello', user_name)

Data Types

• int: Integer numbers (e.g., -1, 0, 2, 1000)
• float: Floating-point (real)

Syntax-Directed Translation Schemes (SDTS)

A possible Syntax-Directed Translation Scheme (SDTS) uses the attribute val to store the value of each non-terminal.

• E → E₁ + T { E.val = E₁.val + T.val }
• E → T { E.val = T.val }
• T → T₁ * F { T.val = T₁.val * F.val }
• T → F { T.val = F.val }
• F → num { F.val = num.value }

Bottom-Up Evaluation of 3 + 2 * 4

Evaluation using SDTS (bottom-up):

• F → num(4): F.val = 4
• F → num(2): F.val = 2
• F → num(3): F.val = 3
• T → F (for num(2)): T.val = F.val = 2
• T → T * F: T.val = T.val (from num(2)) * F.val (from num(4)) = 2 * 4 = 8
• T → F (for num(3)): T.val = F.val = 3
• E → T (for num(3)): E.val = T.val = 3
• E → E + T: E.val = E.val (from num(3)) + T.val (from 2 * 4) = 3 + 8 = 11

Therefore, the result of the computation... Continue reading "Compiler Design: SDTS, LR Parsing, and Code Optimization" »

Lecture 1: Moore's Law

Moore's Law: The number of transistors on microchips doubles every two years.

Lecture 2: Logic Gates

AND, OR, and NOT gates are universal.

Logic word problem steps:

Example: In a bank, there were four employees: the bank manager, assistant manager, teller, and the security guard. The bank has a single vault for the storage of their money. This vault was designed so that it needs four signals to open it. These four signals are from the bank manager, assistant manager, teller, and the security guard. For the vault to open, it needs the following conditions:

1. No single employee can open the vault.
2. It can be opened with three employees as long as one of them is the manager.
3. It can be opened by the manager together with the assistant

Here is a complete and concise answer sheet for your Digital Electronics CIE-1 preparation based on your questions:

1. Design Half and Full Subtractor with Truth Table

Half Subtractor

• Inputs: A, B
• Outputs: Difference (D), Borrow (Bo)
• Logic Equations:
  • Difference (D) = A ⊕ B
  • Borrow (Bo) = A' · B

Full Subtractor

• Inputs: A, B, B_in (Borrow In)
• Outputs: Difference (D), Borrow Out (B_o)
• Logic Equations:
  • D = A ⊕ B ⊕ B_in
  • B_o = B · B_in + B · A' + A' · B_in

2. Working of Adder and Subtractor

Adder Circuits

• Half Adder: Adds two bits A and B.
  • Sum = A ⊕ B, Carry = A · B
• Full Adder: Adds three bits A, B, and C_in.
  • Sum = A ⊕ B ⊕ C_in, C_out = AB + AC_in + BC_in

Subtractor Circuits

• Half Subtractor: Subtracts B from A.
  • Difference = A ⊕ B, Borrow = A' · B
• Full Subtractor:

Logical Volume Management (LVM) in Linux Storage

F. The the vast realm of operating systems, Linux has emerged as a robust and versatile choice, powering everything from personal computers to enterprise-level servers. One of its standout features is Logical Volume Management (LVM), a powerful storage management system that offers enhanced flexibility, scalability, and reliability for handling storage devices in Linux environments. LVM revolutionizes how disk partitions and physical storage are managed, providing an abstract layer that simplifies storage administration and facilitates efficient utilization of available resources. By introducing logical volumes, volume groups, and physical volumes (PVs) (originally referred to as "physical books"... Continue reading "Mastering LVM: Dynamic Storage Management in Linux" »