kokulife: screenie of ichigo and otome from aikatsu, hugging (Default)

NPRG062 (Introduction to algorithms) [tutorial] - went over homework and then did some things regarding binary heaps and linked lists, i've come to the conclusion that i like heaps, what a silly data structure


NPRG030 (Programming 1) [tutorial] - linked lists, specifically working towards the homework we have where we are given a series of natural numbers and we have to, using a linked list, sort it in a way that first are the sorted evens then sorted odds


NJAZ070 (English for Upper-Intermediate Students I) - i did pretty well on the test! 26/30 with the best score in the class being 27/30, after going over the test answers and the homework we were told about how to structure the essay we're writing in 3 weeks.. i'm a little afraid of it, as i always am with essays, for what if none of the subjects speak to me.. it's going to be an argumentative essay, with the little time left we also did some thing from the book..


no adventure this week because i was feeling really week and also i couldn't find a place i wanted to adventure in..


NMSA230 (Introduction to R programming) - data frames! good way to structure data and work with it it seems, how to merge multiple data frames together, how to make subsets, how to analyse them and the library stargazer, which creates a TeX table from a data frame, around the end we also found out how to extract data from a csv/excel




koku daily message:
today has been a good day
kokulife: screenie of ichigo and otome from aikatsu, hugging (Default)

NPRG062 (Introduction to algorithms) [lecture] - the (binary) heap! how to implement it using a list, indexing it from 1 is better because then the index of the parent node is n/2 rounded down and the index of its children is 2n and 2n+1, heap sort as example of a sort that has O(nlog(n)) and is in-place, dictionary and how to deal with a collision caused by the hashing function not being injective


NPRG030 (Programming 1) [lecture] - defined a class that uses a linked list to create a double sided queue and shows how to use assert, then some oop theory, which i know.. python has duck typing, meaning that "if it walks like a duck and it quacks like a duck, then it must be a duck", the teacher gave an example from his life where he got on a filming van during the filming of the movie amadeus and he did what he was told to, so he has a small role in the movie, despite not being cast in it




koku daily message:
stirling approximation

March 2026

S M T W T F S
1234567
89 1011121314
15161718192021
22232425262728
293031    

Syndicate

RSS Atom

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Apr. 7th, 2026 05:13 pm
Powered by Dreamwidth Studios