18. Seebohm Rowntree industrial How he did it: Conducted detailed surveys of poverty in York (early 1900s). Identified ‘poverty line’—the minimum income needed for basic needs. Showed links between poverty, poor health, and low life expectancy.
Short-term impact: Challenged the idea that poverty was due to laziness. Provided evidence that many people were poor through no fault of their own. Pressured government and charities to act. Long-term impact: Influenced development of social welfare
Implementation of KNN ALGORITHM -LAB PROGRAM
from sklearn.datasets import load_iris
from sklearn.neighbors import KNeighborsClassifier
from sklearn.model_selection import train_test_split
importnumpy as np
# Load the Iris dataset
dataset = load_iris()
# Split the dataset into training and test sets
X_train, X_test, y_train, y_test = train_test_split(dataset.data, dataset.target, test_size=0.2, random_state=0)
print("Training labels:", y_train)
# Initialize and fit the KNN classifier
kn = KNeighborsClassifier(
...| Lectures 6 ( Carbs, fats) + 7 (protein Amino Acid req'ts/ sports nutrition) | Lectures 8 (Mineral Requirements + Recs) + 9 (Vitmain Req'ts + recs/ Food labeling) |
|---|---|
|
Macronutrients; Protein, Carbs, Fat; All provide energy, all req’d in relatively large amounts “MACRO”; Fiber is closely related to CHO DRI: Acceptable Macronutrient Distribution Ranges (AMDR’s);Balance of macronutrients ;Rations (as a percentage of dietary energy) of macronutrients associated with:Maintenance of HEALTHY weight, |
Explain the use of scanf() and printf() with examples.
#include <stdio.h>
int main() {
int a = 10;
float b = 5.5;
printf("The value of a is %d and b is %.2f\n", a, b);
return 0;
}
The value of a is 10 and b is 5.50
#include <stdio.h>
int main() {
int age;
printf("Enter your age: ");
scanf("%d", &age);
printf("You are %d years old.\n", age);
return 0;
} , You are 21 years old.
Explain the following types of
("une pièce de musique", "un morceau de musique")
("un mix", "un mélange")
("extravagance", "un grain de folie")
("la sonorité", "le son")
("faire apparaître", "faire naître")
("immerger", "plonger")
("qui est à la mode", "tendance")
("exceptionnel", "inégalable")
("important", "significatif")
("positif", "bénéfiques")
("stimuler", "favoriser")
("qui dort en vous", "qui sommeille en vous")
("désagréable", "contraignante")
("développer", "accroître")
("primordial", "essentiel")
("aussi", "également"
A Turing Machine (TM) is a theoretical model that defines an abstract machine capable of performing computations using a tape, a head for reading and writing symbols, and a finite set of states. The tape is infinite and divided into cells, each holding a symbol. The machine reads the current symbol, changes it, moves left or right, and transitions between states based on a predefined set of rules. TMs can simulate any algorithm and are fundamental to understanding the limits of computation. However,
Q.1) Define a function with suitable example? Explain need for a function Ans- A function is a block of organized and reusable program code that perform single, specific, and well defined task. Python enables its programmer to break up a program into functions, Therefore, the code of one function is completely insulated from the codes of the other function. A function f that uses another function g is known as the calling function and g is known as the called function. Syntax:
def <space>
exp 01 NETWORK TRAFFIC ANALYSIS IN ICS/SCADA
###tools - wireshark
###objectives = use wireshark to capture and analyze network traffic to detect anomalies such as unauthorized commands or network scanning
###deliverable = a detailed report of the traffic patterns and recommendations for maitigations
##wireshark - Wireshark is a network protocol analyzer used to capture and inspect data packets in real time.
###installing wireshark on Linux :
step 01 = update package lists = sudo apt update
step
A PDA accepts an input string by final state if, after reading the entire input, it reaches a final state, regardless of the contents of the stack.
A problem is undecidable if there is no algorithm that can determine the answer (yes or no) for all possible inputs in a finite amount of time.
A Turing Machine consists of a tape, a tape head, a finite set of states, an input alphabet, a tape alphabet, a transition function, and a start, accept, and reject state.
The lexical analyzer (scanner) reads