StudentShare
Contact Us
Sign In / Sign Up for FREE
Search
Go to advanced search...

Educational Timetabling Algorithms and Data Structure - Literature review Example

Cite this document
Summary
As the paper "Educational Timetabling Algorithms and Data Structure" outlines, in the past decade, empirical tools made evolutionary progress to solve many databases’ design problems, such as simulated annealing, tabu search, ant colony optimization, and genetic algorithms (Alsmadi et al., 2011). …
Download full paper File format: .doc, available for editing
GRAB THE BEST PAPER92.4% of users find it useful

Extract of sample "Educational Timetabling Algorithms and Data Structure"

Download file to see previous pages

Fully automated educational timetabling is one of the main problems that tackle database designers, in fact, the problem was addressed rather extensively in many kinds of literature and from different aspects, and others were suggesting different and semi-solution approaches to the problem (Kingston, 2013, Schaerf, 1999). Educational timetabling systems can vary according to the types of the institution involved, for example, the school-timetabling system is different from both universities and colleges timetabling systems, or it can be differentiated according to the type of the educational system involved, for example, the American educational system is different than the British system; the first is focused on the number of academic credits, while the British system is based mainly on modules and subjects.

Moreover, University’s timetabling can be further divided into class-timetabling and examination- timetabling; to some extent, each has its individual process and difficulties, our main focus will be focused on University’s Course Timetabling Problem (UCTP) (Sarin et al., 2010). When an institution offers a specific course, the course is broken down into sections, where each has a set of constraints, the details of the course, modules involved, and the time associated with each module, suitability, and availability of each room, a number of students and lecturers, some of these constraints are considered Hard Constraints (HC), and another is considered Soft Constraint (SC).

However, conflicts could appear either when a single resource (student, a room, teacher, and student) takes a place in different events at the same time, or problem associated to lack of resources or time, such as the capacity of rooms or difficulties for the event to occur at specific working days such as bank holidays, moreover, some modules require the previous qualification such as a previous module to be taken, as a problem could occur when a student selects a particular section (Abuhamdah et al., 2013)

...Download file to see next pages Read More
Cite this document
  • APA
  • MLA
  • CHICAGO
(Educational Timetabling Algorithms and Data Structure Literature review, n.d.)
Educational Timetabling Algorithms and Data Structure Literature review. https://studentshare.org/education/2051555-educational-timetabling-quot-algorithms-and-data-structu
(Educational Timetabling Algorithms and Data Structure Literature Review)
Educational Timetabling Algorithms and Data Structure Literature Review. https://studentshare.org/education/2051555-educational-timetabling-quot-algorithms-and-data-structu.
“Educational Timetabling Algorithms and Data Structure Literature Review”. https://studentshare.org/education/2051555-educational-timetabling-quot-algorithms-and-data-structu.
  • Cited: 0 times

CHECK THESE SAMPLES OF Educational Timetabling Algorithms and Data Structure

Hash Algorithm and Secure Hash Algorithm

In hash tables and data processing, collisions inhibit the distinguishing of data, making records more costly to find.... This paper ''Hash Algorithm and Secure Hash Algorithm'' tells that A hash function is a reproducible method of turning some kind of data into a (relatively) small number that may serve as a digital "fingerprint" of the data.... substitutes or transposes) the data to create such fingerprints.... If a hash value is calculated for a piece of data, and then one bit of that data is changed, a hash function with a strong mixing property usually produces a completely different hash value....
12 Pages (3000 words) Essay

Routing Algorithms

(Perkins and Bhagwat 1994)AdvantagesOSPF can detect which nodes are closestSince OSPF can analyze the changes in link state, it can handle dynamic networks by instantaneously updating the routing tablesIt can be simply applied to networks where both workstations and mobile computers are being usedDisadvantagesGenerates highly complex and bulky trafficUses a number of varieties of data packets, where each variety has its specific functions.... Routing algorithms I....
2 Pages (500 words) Assignment

Data Structures and Algorithm Applications in Social Media

In deciding the data structure to use in a social media site, some of the steps to consider include; an analysis of the problem for determination of the applicable resource constraints, determination of the operation to be supported against the resource constraints, and selection of the most appropriate data structure for the given problem.... In selecting a data structure, it is always good to consider the cost of the solution, which is a factor of the resources used, thus selecting the simplest most appropriate data structure (Bender & Kuszmaul, 2014)....
7 Pages (1750 words) Essay

Processing Algorithm Developed by Google for Big Data

The aim of the paper “Processing Algorithm Developed by Google for Big data” is to analyze the storage system and processing algorithm developed by Google for Big data, which is known as the Bigtable.... Bigtable is a distributed storage system for managing structured data.... The primary purpose of metadata should be to provide context to the reported data that lead to the creation of knowledge.... structured) data....
4 Pages (1000 words) Essay

Machine Learning Algorithms and Tools

The paper "Machine Learning algorithms and Tools" explores the functionality of the WEKA tool that consists of visualization tools and algorithms used for data analysis and predictive modeling, the experimenter application that allows comparison of the predictive performance of Weka's machine learning algorithms on a collection of datasets, etc.... hellip; Machine learning is a branch of computer science that involves the usage of computer software and algorithms that allow the computer to model data....
8 Pages (2000 words) Essay

String Processing Structures and Algorithms

Another structure that is used to represent the LIST ADT is Linked List.... This is a dynamic structure as compared to an array which is static in nature.... The array is the most suitable structure to implement strings.... The author of this paper "String Processing Structures and Algorithms" examines the need-based classification of that are text data and numeric data, elementary or basic string operations: substring operations, length operations, concatenation operation, and the description of each operation type....
9 Pages (2250 words) Assignment

Algorithmic: the Spirit of Computing

A number of graph algorithms call for processing vertices and edges of a graph systematically.... The two principal types of algorithms that do such traversals are the depth-first search (DFS) and the breath-first search (BFS).... This assignment "Algorithmic: the Spirit of Computing" discusses Algorithmic as a branch of science but according to David Harel, it is “much more than that and is instead the core of computer sciences” (Harel, 1992)....
1 Pages (250 words) Assignment
sponsored ads
We use cookies to create the best experience for you. Keep on browsing if you are OK with that, or find out how to manage cookies.
Contact Us