recentpopularlog in


« earlier   
The BeOS file system, an OS geek retrospective | Ars Technica
File system basics

At the basic level, a file system exists to manage the data on permanent storage devices. Functions common to most file systems include:

Creating files and directoriesOpening, reading, writing, deleting, and renaming filesReading, writing, and updating file metadata or attributes

Additional features include symbolic links, access control lists, and memory mapping.
compsci  os 
11 days ago by dstelow
Top Algorithms/Data Structures/Concepts every computer science student should know
Along with above algorithms, every computer science student is expected to implement below data structures – Trie Implementation | Insert, Search and Delete
Memory efficient Trie Implementation using…
interview  compsci  datastructures  algorithms 
11 days ago by geetarista
Pulley Logic Gates on Vimeo
The essence of digital computing is the use of continuous physical states to represent a discrete number of symbols and the ability to perform logic based on those…
logic  compsci 
12 days ago by geetarista
Bartosz Milewski's 'Category Theory for Programmers' compiled in EPUB
compsci  from twitter_favs
12 days ago by skchrko
Fibonacci Hashing: The Optimization that the World Forgot (or: a Better Alternative to Integer Modulo) | Probably Dance
Fibonacci hashing solves both of these problems. 1. It’s really fast. It’s a integer multiplication followed by a shift. It takes roughly 1.5 nanoseconds on my machine, which is fast enough that it’s getting real hard to measure. 2. It mixes up input patterns. It’s like you’re getting a second hashing step for free after the first hash function finishes. If the first hash function is actually just the identity function (as it should be for integers) then this gives you at least a little bit of mixing that you wouldn’t otherwise get. But really it’s better because it’s faster. When I worked on hash tables I was always frustrated by how much time we are spending on the simple problem of “map a large number to a small number.” It’s literally the slowest operation in the hash table.
hashing  compsci  computerscience 
13 days ago by dlkinney
Assembly Lang - Reverse Engineering for Beginners (2018)
I am very excited to have you participate in the Reverse Engineering workshop.
First, please pat yourself on the back for doing it - this is going to be an adventure, not an easy one but definitely a fun one!
Assembly  Programming  Software  CompSci  Hardware 
15 days ago by mfernando
GitHub - trekhleb/javascript-algorithms: Algorithms and data structures implemented in JavaScript with explanations and links to further readings
Algorithms and data structures implemented in JavaScript with explanations and links to further readings.

This repository contains JavaScript based examples of many popular algorithms and data structures.

Each algorithm and data structure has its own separate README with related explanations and links for further reading (including ones to YouTube videos).
algorithms  computer-science  compsci  data-structures  javascript 
15 days ago by apiontek

Copy this bookmark:

to read