michael dcosta :: Blog

Ok here it goes folks. I will be mentioning most of the GRE words(along with there meanings) here

with their antonyms(ant) and synonyms(syn) .

So here the first thread goes

1) ABHOR(V) Hate:

Syn:(v)

Despise

Execrate

Abominate

Syn:(N) 

Antagonism

Aversion

Antipathy

Ant:

Esteem

Revere

Venerate

Dote on

2) Assiduous (adj) : hardworking and perseverant

Syn:

Diligent

Sedulous

Plodding

Ant(lazy):

Torpid

Slothful

Languorous

Ant (tired):

Jaded 

Lackadaisical

Enervated

Incapacitated

3) Ebullient (adj) : Cheerful and full of energy

Syn:

Exuberant

Vivacious

Exhilarated

Euphoric

Elated

Ant(dejected):

Melancholy

Despondent

Disconsolate

Doleful

Desolate

4) Effusive (adj): very demonstrative in displaying feelings and emotions

Syn:

Rhapsodic

Fulsome

Profuse

Gushing

Ant(Subtle)

Discreet

Unobstrusive

Phlegmatic

Reticent

5) Stoical(adj): Enduring pain and hardship without showing one's feeling or complaining

Syn:

Forbearing

Fatalistic

Phlegmatic

Imperturbable

Ant(edgy)

Testy

Irascible

6) Plagiarism (N) : taking some one else's work or ideas and passing them off as one's own

Syn:

Poaching

Apocryphal

Infringement

Ant:

Seminal

Ingenious

Autochthonous (originating or occuring naturallyin a particular place)

Veritable

Archetypal

7) Bombast : high sounding language with little meaning, used to impress people

Syn:

Pompous

Verbose

Turgid(used with text and speech)

Orutund(only for speech)

Fustian

Grandiloquent

Ant:

Laconinc (using very few words)

Terse (short and abrupt)

Succint (precise)

Pithy (precise)

Aphoristic (a true proverbial saying_ 

Does anyne know how to add the favorites from IE to the bookmark section of this site??

thanx

Format of GRE

Section                   Type of Questions                    Total Questions               Time 

Writing          Present you perspective on an                    2                           75 min

                    issue and analyze an argument
 

 Verbal          around 6 sentence completions                  30                          30 min

                    around 7 analogies

                    around 8 reading comprehensions

                    around 9 antonyms

Math             around 14 quantitative comparisons            28                          45 min

                    around 9 multiple choices

                    around 5 graphs

 Experimental  Verbal or Math

The test always begins with the writing section, the math and verbal section can appear in

any order and also, the questions within each section can appear in any order.

There is a 1 min break between each section and a 10 min break after the writing section.

The experimental section doesnt count towards your score.

The average score in GRE worldwide is 1040, but to get into an ivy league university try to

get at least 1400.

When is GRE given?

It is given year round.

 How many times should i take gre?

You can take atmost 5 times a year, but some graduate schools will average your scores.

Can i cancel my score?

Yes.You can cancel your score immediately after the test but before you see your score.

For more details and information about registration you can log onto www.gre.org 

Q: Given an array of size N in which every number is between 1 and N, 

determine if there are any duplicates in it.

Ans: I'll try to do it in O(N) w/o using any additional memory. The key is

to use content of the array as index into array, checking in O(1) if 

that number has been seen already.

bool HasDups(int * a, int N)
{ 
	bool fHasDup = false;
	for (int i = 0; i < N; i++) {
		int index = a[i] % N;
		if (a[index] > N) {
			fHasDup = true;
			break;
		}
		a[index] += N;
	}
	
	//restore the array
	for (int j = 0; j < i; j++)
		if (a[j] > N) a[j] %= N;

	return fHasDup;
}

void quicksort (int[] a, int lo, int hi)
{
//  lo is the lower index, hi is the upper index
//  of the region of array a that is to be sorted
    int i=lo, j=hi, h;
    int x=a[(lo+hi)/2];

    //  partition
    do
    {    
        while (a[i]<x) i++; 
        while (a[j]>x) j--;
        if (i<=j)
        {
            h=a[i]; a[i]=a[j]; a[j]=h;
            i++; j--;
        }
    } while (i<=j);

    //  recursion
    if (lo<j) quicksort(a, lo, j);
    if (i<hi) quicksort(a, i, hi);
}

I want to know how to make my own community. I need to make a community but everyone should not be allowed.

Thanks

hey guys i got this idea while studying the shortest path algos like djikstra nd warshall.

this can be done as a minor project... very simple thing to do.. we can write a symbian os program to find shortest path between 2 destinations on a map...... we will first have to make a map according to a scale, and then when the user enters the source and destination.. it will find out the shortest path between them using djikstra or warshall.......

we can also extend this algo to be of better use by also inculcating the traffic density, stoppages etc in the weigthage we give to each edge of the graph and then calculating the shortest path.....

i hope this is fine for minor projects......what do you think guys??......