vgrdrsf

  1. #P1
  2. #Demonstrating "string" operations
  3. s="hello"
  4. print(s.capitalize)
  5. print(s.upper())
  6. print(s.rjust(100))
  7. print(s.center(100))
  8. print(s.replace('l','(M)'))
  9. print(s)
  10. print("don't")
  11. #Indexing
  12. a='symbiosis2024'
  13. print(a[2])
  14. #Negative Indexing
  15. print(a[-1])
  16. print(a[-6])
  17. #Slicing
  18. print(a[9:12])
  19. print(a[9:])
  20. print(a[9:-1])
  21. print(a[:8])
  22. print(a[-12:-1])
  23. #Stride [start index:end index:step size]
  24. print(a[0:13:2])
  25. print(a[0::2])
  26. #Concatenation
  27. b='hello'
...

See on Wikiteka »

jksjhffwhskd

  1. #S1
  2. #Skill 1: Operation & operators
  3. a = 10//3  # Floor Division
  4. a = 10 % 3  # Modulo Operator
  5. a = 3  # Assignment
  6. b = 1  # Declaring variables
  7. a == b  # comparison
  8. # Operator: Used for operations betweens values and variables
  9. # 1] Assignment 2] Logical 3] Comparison 4] Arithmetic 5] Bit-wise 6] Identity 7] Membership
  10. # Practice Time
  11. a, b, c, d, e = 12, 3, 4.0, 6.0, 'hi'
  12. f, g = a + b, a + c
  13. print(f), print(g), print(type(g))
  14. mult_int, mult_float, multi_comb
...

See on Wikiteka »

cecs329

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

...

See on Wikiteka »

AI cheat sheet

‘Soft’ Inference: Probability

  1. What Is Probability?

    • A measure PPP assigning each event AAA a number in [0,1][0,1][0,1].

    • Axioms:

      1. P(∅)=0,  P(Ω)=1P(\varnothing)=0,\;P(\Omega)=1P(∅)=0,P(Ω)=1

      2. 4 disjoint A,BA,BA,B, P(A∪B)=P(A)+P(B)P(A\cup B)=P(A)+P(B)P(A∪B)=P(A)+P(B)

    • Conditional: P(A∣B)=P(A∧B)P(B)P(A\mid B)=\frac{P(A\land B)}{P(B)}P(A∣B)=P(B)P(A∧B)​

  2. Bayesian Inference

    • Bayes’ Rule:

      P(H∣E)=P(E∣H) P(H)P(E) P(H\mid E)=\frac{P(E\mid H)\,P(H)}{P(E)}P(H∣E)
...

See on Student Notes »

organisational change

Organisational change" in simple terms means a company or group changing the way it works. This could be:

  • Changing how people do their jobs

  • Bringing in new technology

  • Changing the structure of teams or leadership

  • Starting new goals or ways of thinking

The aim is usually to improve the organisation, keep up with the times, or solve problems.t happens when a business wants to improve, grow, solve problems, or respond to something new (like new laws, customer needs, or technology).New ways

...

See on Student Notes »

asdfghjk

You use ED when you are talking about People/ Subject. You use ING when you are talking about a Situation/Object E: I'm Bored (ED) This situation is boring. (ING) They are boring me to death. (Is a situation because is afeet another person) Models of Speculation –  Presente (Must = certeza She must be tired.) (May / Might / Could = possibilidade He might be at home.) (Can’t / Cannot = certeza negativaThat can’t be true.) ( Passado (Modal + have + past participle) (Must have =

...

See on Student Notes »

weeeeeee

🔧 Kotlin & Android Coding Terms You Must Know

  • ?.let {}: Kotlin null-safe scope function. Prevents crashes if object is null; not a security check.

  • getCallingPackage(): Identifies the app that sent an intent. Use this to verify intent source.

  • checkCallingOrSelfPermission(): Checks if permission is declared. Does not verify actual identity of sender.

  • resolveActivity(intent, 0): Checks if the intent can be handled. Prevents app crash, but not a security check.

  • putExtra() / getStringExtra(

...

See on Student Notes »

Interpretation of statutes

1Reference to Constituent Assembly Debates in Adjudication: Theoretical Approaches, Scholarly Themes, and Judicial Practice

Introduction

The Constituent Assembly Debates (CAD) of India, spanning from 1946 to 1950, represent a foundational moment in the creation of the Indian Constitution. These debates, involving figures like B.R. Ambedkar and Jawaharlal Nehru, have become a crucial interpretive resource for courts, scholars, and legislators seeking to understand the intent and philosophy underlying

...

See on Student Notes »

Interview

Hi, I'm Navneeth, a final-year Computer Science Engineering student. I have a strong interest in full stack development and machine learning. During my academic journey, I completed an internship where I worked on [brief description of your role—e.g., building web applications, working with data, or contributing to a live project]. It gave me hands-on experience with tools like Flask, React, and version control systems like Git.

Alongside my internship, I developed projects like MediVision, a

...

See on Student Notes »