bsf

Open source 5G core network based on 3GPP R17

SEGS Launcher and Custom Client

Portable BitScan implementation (MSC, ICL, GNUC, etc. for WIN32/IA32/Intel64/ARM only)

Azadi Ka Amrit Mahotsav Hackathon 2022 | Detection Of Rogue Drones On Border

Find the shortest path between two nodes in an unweighted graph based on breadth first search

Simple fft bearing analysis with VNB211 data capture

a web app to find the most interesting signatures from LINCS L1000

https://www.mdpi.com/2076-3417/12/21/10882/htm

This repository is a structured collection of Data Structures and Algorithms implemented in a clear and beginner-friendly way. It covers core topics like arrays, linked lists, stacks, queues, trees, graphs, and basic algorithms, organized into separate folders for easy navigation.

Notificerer sagsbehandlere i BSF Nexus omkring manglende Danmarks statistik indsats

Kontrollerer om borgeres antal søgte jobs stemmer overens med krav. Opretter opgave til sagsbehandler, hvis det ikke er tilfældet.

Momentum: der er ca. 800 borgere med en forkert/placeholder sagsbehandler fra fasit-tiden

Generador y resolvedor de laberintos en C usando DFS para la creación y BFS para encontrar el camino más corto entre la entrada (E) y la salida (S).

Proces der sikrer oprydning af medarbejder, forløb og organisation på baggrund af en bestilling fra en medarbejder. Bestillingerne forekommer ved en ungesags ophør.