yakaminad Goto Github PK

-an-arithmetic-expression-

regarding methods of binary tree structure in java

-for-method-getreachabledestinations-

more DS on graph,the graph.java has related methods implemented

arudino-robot-

database-building-for-device-company-

This is a database for device sell and repair company with access both for manager and staff,where i use sydney university database to store the data stream,and if you want to have data to have a try,contact my email

face_recogonition

This repository contains the face_detection using the eigenface and knn classfier method..real-live camera and multi-scale using the cascade classfiers.

happiness-website-with-game-survey-etc

We are creating a website to make people feel happy where several happiness tips and games based on our survey on individual happiness provided

linked_positionallist-

To implement an LinkedPositionalList

linkedpositionallist-

To implement an LinkedPositionalList

locker_company

a program that will create, update, query and delete storage lockers. Each locker is represented as a process in the system which is created by your management process. Signals can be sent to the locker process to change the state of the locker outside of the management process. A locker process is made up of: Process ID (pid) : (unique to process creation) Locker ID : Creation order, Unsigned integer, starts at 1, always increments User Id : Unsigned integer Locked/Unlocked state Owned/Free state Two signal handlers (SIGUSR1 and SIGUSR2) The default states of a locker when created: Locked No Owner (Detached) A locker can be in 4 states, {Locked, Free}, {Locked, Owned}, {Unlocked, Free} and {Unlocked, Owned} states. Lockers are kept in a queue (or a data structure of your choosing) for reuse. Your program must be able to provide reporting on the current state of the lockers and handle commands from standard input. Each locker needs to handle a SIGUSR1 and SIGUSR2 signals. SIGUSR1 locks the locker and SIGUSR2 unlocks the locker. Your management process must be able to create lockers by using the CREATE command that will create a new process that your management program will manage. Helpful Note! If heap data has been allocated, then newly created locker should immediately free this upon execution. Your management process will also receive requests to decommission a locker (DELETE). Part of your inter-process communication protocol needs to incorporate a way to decommission a locker. You are to implement the following list of commands. These commands are inputted to standard input on the management process. The command description will typically (with the exception of QUIT) interact with a locker. Your management process will be interacting with the locker through an inter-process communication method of your choosing (pipe() or mmap() ).

mini_instagram-

The social media platform is composed of two types of entities: • Users • Posts Each user in the social network have a list of followers, other users they are following and posts. These collections are represented as an array of indices that relate to a user* or post* array. struct user { uint64_t user_id; //User id, is unique size_t* followers_idxs; //User indices within user* users graph size_t n_followers; //Number of followers size_t* following_idxs; //User indices within user* users graph size_t n_following; //Number of users the user is following size_t* posts_idxs; //Post indices within post* posts graph size_t n_posts; // Number of posts a user has made. }; typedef struct user user; All user_id values within the users array will be unique. The lists: followers, following and posts are arranged by ascending order. In order of insertion. struct post { uint64_t pst_id; //Post id, is unique size_t* reposted_idxs; //Reposted indices within the graph size_t n_reposted; // Number of reposted posts. }; typedef struct post post; All pst_id values within the posts array will be unique. The posts array will not contain any cycles as for any reposts to exist depends on the existance of an original post. For all queries you will need to return a heap allocated result structure: This structure stores all elements retrieved from the query as a heap allocated contiguous block of pointers and the number of elements. It will be used to determine if your result is correct. struct result { void** elements; size_t n_elements; }; typedef struct result result;

motion-estimation-

This is a program that can estimate motion in video in frame-based with micro-blocking algorithm supported

shortest-distance-in-graph-ds

shortest path list && shortestPathCost

simulate-a-real-world-ball-motion

This is a programe using Processing to simulate the bouncing of balls between a 3D space

student_submission-platfrm

This is a java-based student submission platform which contains several common functions for data exchange and corresponding algorithm processed

threaded-tape

a program that will read different parts of a tape. The tape itself is represented as a 1 dimensional byte array of n size.The user will input commands that will allow the tape to move back and forth by k steps. Each step will output to a file the data being read. Each head is placed at an offset from the base or starting point of the tape (index 0), this offset is specified by the user. You are tasked with writing the command handler that will invoke functions related to tape head creation. Each head will write to its own respective file. If it is thread 1, it will write out to ./head1, thread 2 will write out to ./head2 and so on. The main thread needs to wait until all threads have finished reading and writing out to a file. If it attempts to run another command while it is still reading/writing, it could compromise this process, therefore the main thread needs to wait until all other threads have completed and all threads will need to wait until the main thread runs a command.