Yash Tutorials

Foundation Day Meeting  :  About AI : AI helps in 1. Climate change 2. Disaster management 3. Autonomous driving, computer vision, health care, finance How AI Language models to be developed : Ethical ai : 1. Fairness 2. Ethics ( moral principles ) 3. Moral system websites 4. Historical data matters most ( based on that large data , ai takes decision ). 5. AI - ML algorithms build and learn from data 6. Regression model (continuous thing). Compas : About Criminal Case Correctional Offender Management Profiling for Alternative Sanctions  ( COMPAS )   is a  case management  and  decision support tool  developed and owned by Northpointe (now Equivant) used by  U.S. courts  to assess the likelihood of a  defendant  becoming a  recidivist . Recidivist is the act of a person repeating an undesirable behavior after they have experienced negative consequences of that behavior, or have been trained to  extinguish  it. ...

#include <stdio.h> int main() {     int num, n, newNum;     printf("Enter any number: ");     scanf("%d", &num);     printf("Enter nth bit to clear (0-31): ");     scanf("%d", &n);     newNum = num & (~(1 << n));     printf("Number before clearing %d bit: %d (in decimal)\n", n, num);     printf("Number after clearing %d bit: %d (in decimal)\n", n, newNum);     return 0; } Logic :-  num&(~(1<<n));

  Python Revision Notes Direct Download Link :)  Click on below link  Download

Python Revision Notes :- Refer the below notes 👇👇👇

                                                         2643.   Row With Maximum Ones  Link for Question :-  https://leetcode.com/problems/row-with-maximum-ones/description/ Solution :- Solving this problem using dictionary concept: Approach Of solving the problem :  Create a empty dictionary d = {} , initialise count = 0 , lst = [] Iterate over the mat list, now add dictionary for its index and count from the dictionary find the maximum value and store it in v_max variable Now iterate over the dictionary using .items() method Check condition if(value == v_max) append the key and value to the list and terminate the loop now, return the list Complexity Time complexity:  O ( n )       Since we used for loops  Code in Python: class Solution : def rowAndMaximumOnes ( self...