Sree Charan.

M (16CO228)
Shiva Swaroop. V(16CO252)
Shivaswaroop11344@gmail.com
Group No: 32

TOPIC: Online GRE Examination with

Different sets

1. Abstract-

The Graduate Record Examinations (GRE) is a

standardized test that is an admissions requirement for most graduate schools.
This topic deals with the problems encountered during the implementation of
the above technique and also the mere solutions to overcome those. Also, in
this paper we are going to discuss the algorithm for distribution of different
sets (Question paper sets) for different systems. This algorithm is very
important in order to avoid malpractices in examinations and also helps in
correct estimation of the student’s calibre.
2. Keywords-
GRE, algorithm, online examination.
3. Introduction-

Improvements in technology proficiencies such as data

processing, storing, transmission speed and connectivity availability have
played an essential part to support e-Learning functions. Graduate Record
Examinations (GRE) is very commonly used for foreign based examination
which helps in determining student knowledge. This algorithm is student
friendly. Gradually the standards of questions are raised as per the student
previous performance. Combined with the GRE an algorithm for distribution of
different question paper sets makes sure that no two adjacent test takers get
the same question at a given time. There are Old and New GRE techniques to
implement this software. Now let us select the best among them.
Old GRE vs New GRE – Advent of sectional adaption approach –
On the old GRE, the test adapted within each section.
The computer would assume that every test taker was equal and start with a
mid-range question. If the test taker answered a few questions correctly, the
test would become progressively difficult.
Whereas the New GRE adapts between sections. Each section is static. The first
section and your score in that whole section determines your next section. This
New/revised GRE seems more student friendly.
Each question in the New GRE are of same level. This helps a student to boost
his confidence for the 1st section and can nail the remaining with same scope.
4. Literature Review-
Many solutions were proposed in order to improve
and enhance e-Learning environment, and their communication learning
software, to achieve the goal of assessment criteria for the students. Our
proposed procedure helps to achieve such a goal to some good extent in
estimation of student merit.
Moreover; the online examination system was developed with the feature of
dynamic exam generation for multiple choice and true-false questions. The
development process has been divided into two main phases. The first phase is
to design the examination software and the second phase is to create an
examination questions’ bank. A model was proposed to handle the
aforementioned problem of receiving the same exam questions by adjacent
terminals. The proposed model works by adding a controller between the
student’s terminals and the database containing the questions’ bank. The
controller will be responsible for the process of generating different questions
between adjacent terminals to ensure that all students have received questions
of the same difficulty. By using a binary-tree technique for questions’ selection
process, an application for online examination system is proposed. The
proposed application works by selecting a question with medium level of
difficulty. Subsequently, when a student provides an answer to the question;
the next difficulty question level will be selected from lower or higher difficulty
level questions. This is nothing but the same as our GRE Examination software
implementation with some extra features which makes the software more
effective in the view of its purpose.

5. To-do Algorithm-

In this part, a small discussion about the proposed

algorithm will be provided. The first step is to assign a number for each
terminal in the lab. Moreover, in this step a number will be assigned for each
terminal in the lab for example (terminal-1, terminal-2, etc.). Once a number
has been assigned to specific terminal, the system will automatically extract
that terminal’s Media Access Control (MAC) address and stored it in a specific
table at the examination systems’ database.

Terminals MAC Address Terminal Number

07:00:28:E0:0B:78 1
07:00:28:0D:20:68 2
07:00:28:90:E6:00 3

In second step, after the student logs into the system, the terminal will
automatically send its MAC address to the system server, which will use the
pervious mentioned Table I in order to retrieve the terminal’s assigned number.
This process will be used to verify each and retrieve the assigned number for
each terminal. Afterward the verification process, terminal number will be used
for the next step to select the exam sets from the database containing all types
of exam sets predefined. Each set contains the subsets of questions with
different difficulty set-wise which will be explained later.

The selection of a specific exam set for a specific terminal can be implemented
using the following equation:
ES= ((Tn + key) % Tnos) +1

The arguments which used in the proposed Equation are described as follows:

 ES is the exam’s set to be selected for specific terminal in the lab.

 Tn is the terminal’s assigned number that will be retrieved based on MAC

address from table 1.

 Key is a random value to be selected form the set (1 up to total number

of questions in the form) which will be unified for all terminals

 Tnos is the total number of sets stored on the system’s database.

 +1 is added to ensure that the outcome of the equation will not be zero
where in system’s database the numbers started from 1.

Now the Next part is to obtain the Questions from different difficulty
levels as per the previous performance. In each set of question paper
there will be questions with 3 difficulties predefined (easy, medium,
difficult).

 At the beginning, for all the sets medium question section will be
selected as default.

Do:
If (end of section)
{
If (Score (I) < limit1)
{
I++
Current section= Select (easy section)
Get Questions (Current section)
}
Else if (limit1 <= Score (previous section) < limit2)
{
Current section= Select (medium section)
Get Questions (Current section)
 }
Else
{
Current section= Select (difficult section)
Get Questions (Current section)
}

}
Else
{
Get Questions (Current set)
}

While (! (end of exam))

 After that set completion, Next set is selected as per the previous score in
previous section “Score (I)” compared to “limit at respective section”
that is predefined.
 Every time at the end of the set “Current section” variable gets updated
and questions from that difficulty are obtained as per the above
algorithm.
 Total score is sum of all the scores across the sections encountered by
student.

Here we adopted New GRE. Since, it has a sectional adaption approach, the
difficulty of questions gets updated at the end of each section.

 Firstly: Retrieve the terminal number from the database.

 Secondly: apply the proposed algorithm using the retrieved terminal
number.
 Thirdly: select the form based on the terminal number that was identified
during the second step.
 Finally: Select question sections as per the LIMIT at each section.

6. Conclusion-

This paper presented a set- distribution algorithm

for online GRE examination systems with the goal of preventing set of
questions to be repeated and shared between adjacent terminals. This
algorithm ensures that students performing the exam will not receive the same
alignment of questions during examination session. When compared to old GRE
it can precisely decide the knowledge of the student. This paper document
contains about the keywords, approach, literature review and new algorithm
for GRE examination. Approach describes about how the old GRE can be
improvised in considering the judgement of student’s wisdom. Literature review
describes shortly about solution for main problem encountered. We may have
to implement this algorithm in a real working environment to know more about
its constraints.

7. References-

[1]. P. Raj, P. Kumar, S. Sengupta, K. Vats, and P. Gupta “An Architectural

Insight into the National Online Examination System” International Journal of
e-Education, e-Business, e-Management and e-Learning, Vol. 2, 2012
[2]. Li-dong Zhou; Hui Li; Hang Gu; Jun Shi “Research and development of
intelligent Online Examination System” International Conference on Computer
Science Engineering, IEEE conferences, pg:57-62; 2017
[3]. R.H. Austing “The GRE Advanced Test in Computer Science”, Vol 10, IEEE
Journals & Magazines, pg:129-133,1977
[4]. . Bazar, and B. Kasasbeh, “Smart Online Examination System Based on VLAN
Concept” International Journal of Engineering Technology and Management,
vol, 201
[5]. Jan M. Miller Ph.D., Ann Goodyear-Orwat M.A “The effects of intensive,
extensive, structured study on GRE scores”, Springer, Journal of Behavioural
Education, 1996.
[6]. “How does gmatlab-algorithm works”, study on GRE, gmatlab.com