In this paper a new efficient approach to solving the balanced connected partitioning is presented. The graph partitioning problem has been used in many areas of computer science like LSI design; electrical power networks (EPNs) and ect. The problem aims to obtaining sub graphs of a graph which include balance connected vertices. The proposed solution is based on Cuckoo Optimization Algorithm (...

This lecture note presents and analyses two simple hashing algorithms: “Hashing with Chaining”, and “Cuckoo Hashing”. The analysis uses only very basic (and intuitively understandable) concepts of probability theory, and is meant to be accessible even for undergraduates taking their first algorithms course.

Predicting student academic performance with a high accuracy facilitates admission decisions and enhances educational services at educational institutions. This raises the need to propose a model that predicts student performance, based on the results of standardized exams, including university entrance exams, high school graduation exams, and other influential factors. In this study, an approa...