psych

 The Yerkes–Dodson law states that performance is related to arousal in an inverted-U shape: performance improves with increased arousal up to an optimal level, but too little or too much arousal reduces performance. For example, a moderate level of stress before an exam can improve focus and memory, while very low arousal may lead to poor concentration and very high anxiety can impair recall and lower exam performance.Social facilitation and social inhibition explain how the presence of others

...

See on Wikiteka »

envsocty exam

Geo rgns: Atlan, QUE, ON, Wstrn, BC, TerriN; loca, rgn iden, hist, pop, econ. Faultlines: Econ, soc, poli divide (Simpson 1993). Dormant but can erupt. Comp: soft CAN.  No comp: hard US. RgnlF: heav geo & poli. rgn ctrl over resour. Fed-prov feud. CentC “natnl interest”=West alienate. Feud btwn prov. QUEF: <Fr. Offic Lang Act 1974, Bill 21 2019. Strong Cemissions. Immig: cont. newcomers bring cultures, lang, relig. que dont like; Bill 21 Core/periphery: capitalism = uneven rgn grow

...

See on Student Notes »

LOC 3 unit

Half Adder :- A Half Adder is a basic combinational logic circuit that is used to add two single-bit binary numbers. It produces two outputs called Sum and Carry. It is called a half adder because it does not consider any carry input from a previous stage.

1. Inputs and Outputs:- Inputs: A, B

Outputs:-    Sum (S)     Carry (C)

The operation performed is:-  A + B

2. Working Principle:- • When both input bits are 0, the sum and carry are 0

• When one input is 1 and the other is 0, the sum

...

See on Student Notes »

SOCIAL MIDIA

1. Social Media Marketing: Fundamentals & Strategy

  • Definition: Using social media platforms (Facebook, Instagram, LinkedIn, etc.) to promote a brand, increase sales, drive traffic, and engage with customers.

  • Core Pillars: Connection, Interaction, and Customer Data.

  • Strategy Fundamentals:

    1. Set Clear Goals & KPIs: Align SMM goals (e.g., brand awareness, lead generation, customer care) with overall business objectives.

    2. Know Your Audience: Research demographics, interests, and behavior

...

See on Student Notes »

datast

public static void mergeSort(int[] array) {
    int length = array.length;
    if (length <= 1)
        return;

    int middle = length / 2;
    int[] leftArray = new int[middle];
    int[] rightArray = new int[length - middle];

    int j = 0;
    for (int i = 0; i < length; i++) {
        if (i < middle)
            leftArray[i] = array[i];
        else
            rightArray[j++] = array[i];
    }

    mergeSort(leftArray);
    mergeSort(rightArray);

 

...

See on Student Notes »

Yujuka

1. Flip-Flop Characteristic Tables
The Characteristic Table summarizes the behavior of a flip-flop by listing the next state (Q_{n+1}) for all possible combinations of the present state (Q_n) and the input(s). It's derived directly from the operating rules of the flip-flop.
| Present State (Q_n) | Inputs | Next State (Q_{n+1}) | Operation |
|---|---|---|---|
| SR Flip-Flop | S, R |  |  |
| 0 | 0, 0 | 0 | Hold |
| 0 | 0, 1 | 0 | Reset |
| 0 | 1, 0 | 1 | Set |
| 0 | 1, 1 | X (Undefined) | Forbidden |
| 1

...

See on Student Notes »

Hehhrhrhr

Sequential circuits are fundamental components of digital systems, defined by the fact that their output depends not only on the current inputs but also on the past history of inputs (i.e., their current state).
The most basic element of a sequential circuit is the Flip-Flop, which is a 1-bit memory cell.
Here is a detailed explanation of the basic Flip-Flops and their operation:
1. Latches vs. Flip-Flops
Both latches and flip-flops are 1-bit storage elements, but they differ in how they are controlled:

...

See on Wikiteka »

Hutttrtt

Logic Gates are the basic building blocks of any digital system. They perform logical operations on one or more binary inputs to produce a single binary output.
Here is a breakdown of the common logic gates, including their symbols, Boolean expressions, and truth tables. 
1. Basic Logic Gates
These three gates are the fundamental operations from which all other logical functions are derived.
| Gate | Symbol | Boolean Expression | Output Condition | Truth Table (A, B \rightarrow Y) |
|---|---|---|---

...

See on Student Notes »

Yhuiii

This covers the core arithmetic operations in digital logic, which are fundamental to how computers process data.
1. Binary Arithmetic
Binary arithmetic uses only the digits 0 and 1. The key difference from decimal arithmetic is that a carry is generated when the sum reaches 2 (which is 10_2).
A. Binary Addition
| Rule | Description |
|---|---|
| 0 + 0 | 0 (Carry 0) |
| 0 + 1 | 1 (Carry 0) |
| 1 + 0 | 1 (Carry 0) |
| 1 + 1 | 0 (Carry 1 to the next position) |
| 1 + 1 + 1 | 1 (Carry 1 to the next position)

...

See on Student Notes »