FFS: Writes:Writes data to blocks chosen by cylinder groups.Tries to place related blocks near each other and rotationally optimize access.Metadata updates (inodes, directories) also written in-place within the same group.Reads:Very fast because data is grouped by cylinder minimal seeks.Sequential reads benefit from rotational optimization & large block size (4-8 KB).First read goes through inode, then inode’s data block pointers.Appends: Allocates next block near the previous one.Uses rotational...
1. Difference between Tree and Graph (TABLE FORMAT – 15–20 words each row)
Feature Tree Graph
Structure
A tree is a hierarchical structure containing
a root and several levels of child nodes.
A graph is a network structure containing
vertices and edges without any fixed
hierarchical arrangement.
Cycles
A tree never contains cycles because it
maintains a strict parent-child relationship
across all nodes.
A graph can freely contain cycles because it
allows multiple connections and flexible
relationships....
UNIT I — Bigger One-Line Answers
• OOP → A programming style that organizes software using objects containing data and methods.
• Encapsulation → Binding data and methods together while restricting direct access.
• Abstraction → Hiding complex details and showing only essential functionality.
• Inheritance → A mechanism where one class acquires properties and methods of another.
• Class → A blueprint defining properties and behaviors; Object → its runtime instance.
•
utilizados na atividade económica (lã, linho, café, cacau). Define-se trabalho como toda a atividade física ou mental desempenhada pelo ser humano de forma remunerada e que tem por objetivo a produção de bens e serviços. Existem os seguintes tipos de trabalho: Trabalho simples: Não exige qualificações (varredor, empregada doméstica); Trabalho complexo: exige qualificações específicas adquiridas através de formação ou experiência profissional. Trabalho manual: Aquele em que predomina...
🔴 8 MARK ANSWERS
1. Analyse the Deficit Theory (with criticism and implications)
Deficit Theory, commonly associated with the work of John Ogbu and earlier sociolinguistic theorists, explains academic underachievement among students from disadvantaged, minority, or marginalized backgrounds by attributing it to deficiencies in their language, culture, or home environment. According to this theory, such learners enter school without the linguistic competence, cognitive stimulation, or cultural...
1. Prime Number using Command-Line Argument
class PrimeCheck {
public static void main(String[] args) {
int n = Integer.parseInt(args[0]);
boolean isPrime = true;
if (n <= 1) isPrime = false;
for (int i = 2; i <= n / 2; i++) {
if (n % i == 0) {
isPrime = false;
break;
}
}
if (isPrime)
System.out.println(n + " is Prime");
else
System.out.println(n + " is Not Prime");
}
}
2. Count Vowels and Consonants
import java.util.Scanner;
class VowelConsonantCount {
public static void main(String[]...
Data Mining is the process of automatically discovering meaningful patterns, trends, and relationships from large datasets using statistical, machine learning, and database techniques.
Applications (any two):
Market Basket Analysis
Fraud Detection
(Other examples: customer segmentation, medical diagnosis, recommendation systems)
KDD is the overall process of extracting useful knowledge...
CAPM expected return:
Expected return of asset = risk free rate + beta * (market return - risk free rate)
Beta formula:
Beta = Covariance(asset return, market return) / Variance(market return)
CAPM regression:
(asset return - risk free rate) = alpha + beta * (market return - risk free rate)
Alpha formula:
Alpha = actual expected return - CAPM predicted return
CAPM predicted return:
Predicted return = risk free rate + beta * market risk premium
Interpretation:
Beta = market sensitivity
Alpha...
In a circular singly linked list, the last node's next pointer points back to the head instead of NULL.
struct Node {
int data;
Node* next;
};
// Function to insert a node (Creating the list)
void insertEnd(Node*& head, int value) {
Node* newNode = new Node();
newNode->data = value;
if (head == NULL) {
head = newNode;
newNode->next = head; //