Total Formula Book For GATE[Computer Science & Engineering]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Don't Forgt To Hit Like

FOR 24*7 HELP LINE - Join This Group (Click Here)

                                                  I am shashank singh. A computer science and engineering grad from IET( Govt.) Lucknow While I was preparing for competitive exams, I made a collection of formulas from various sources. Then I thought that it would be great to share it with my fellow

colleagues who are also on the same boat. This inspired me to write this book so that
any GATE, PSUs and other aspirants in computer science could get all the tricky
formulas in one place.

P.S. This book should be used as a quick reference guide only for formulas. For concepts
please go through some standard text books. Also depending on your feedback, I am
planning to write a new edition of this book with more formulas and numerical problems
in it. Also please provide your valuable feedback as I am planning to publish another
quick peek reference book on important facts of computer science subjects so that
you can revise your subjects quickly.

For any feedback or suggestions please follow me on
Facebook:  https://www.facebook.com/shashank.bluee

                                                                                    Thanks and Best wishes for your exams


Download CSE FORMULA BOOK HERE-- > (CLICK HERE)

MadeEasy Notes For Computer Science[Gate2015] Now., no Need To Pay Them.. [Best Notes Over Internet] [Contains Question And Answers]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Download Subject Wise Questions And Answers Provided By MadeEasy !!FOR 24*7 HELP LINE - Join This Group (Click Here)
---------------------------------------------------------------------------------------------------
          Like MADEEasy on Facebook For Regular Update:-

     Follow MADEASY here:-
     Like This Article On Facebook:-  

1. Question Set 1 {Click here to Download}
2. Question Set 2 {Click here to Download}
3. Question Set 3 {Click here to Download}
4. Question Set 4 {Click here to Download}
5. Question Set 5 {Click here to Download}
6. Question Set 6 {Click here to Download}
7. Question Set 7 {Click here to Download}
8. Question Set 8 {Click here to Download}
9. Question Set 9 {Click here to Download}
10. Question Set 10 {Click here to Download}
11. Question Set 11 {Click here to Download}
12. Question Set 12 {Click here to Download}
13. Question Set 13 {Click here to Download}
14. Question Set 14 {Click here to Download}
15. Question Set 15 {Click here to Download}
16. Question Set 16 {Click here to Download}
17. Question Set 17 {Click here to Download}
18. Question Set 18 {Click here to Download}
19. Question Set 19 {Click here to Download}
20. Question Set 20 {Click here to Download}
21. Question Set 21 {Click here to Download}
22. Question Set 22 {Click here to Download}
23. Question Set 23 {Click here to Download}
24. Question Set 24 {Click here to Download}
25. Question Set 25 {Click here to Download}
26. Question Set 26 {Click here to Download}
27. Question Set 27 {Click here to Download}
28. Question Set 28 {Click here to Download}
29. Question Set 29 {Click here to Download}
30. Question Set 30 {Click here to Download}
31. Question Set 31 {Click here to Download}
32. Question Set 32 {Click here to Download} 
    
    For More:- www.fb.com/shashank.bluee

Don't Forgt To Hit Like

National Programme on Technology Enhanced Learning [NPTEL] Notes For Computer Science For Gate 2015 [Best Notes Over Internet]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

The National Programme on Technology Enhanced Learning (NPTEL) is a Government of India sponsored collaborative educational programme. By developing curriculum-based video and web courses the programme aims to enhance the quality of engineering education in India. It is being jointly carried out by 7 IITs and IISc Bangalore, and is funded by the Ministry of Human Resources Development of the Government of India.

As of October 2012, over 600 courses were available online. The course videos are available in streaming mode, and may also be downloaded for viewing offline. The video files are also view-able via the IIT Channel in Youtube.

Seven IITs and the Indian Institute of Science (IISc) have worked together to develop web and video based material for basic undergraduate science and engineering courses in order to enhance the reach and quality of technical education in India.

-----------------------------------------------------------------------------------------------------------------------------------------
Don't Forgt To Hit Like

< Subject Wise Notes / Topic wise >

#1x- Comiler Design (Click here to dowanload)

#2x- Graph Theory    (Click here to dowanload)

#3x- Computer Algorithum  (Click here to dowanload)

#4x- Maths  (Click here to dowanload)

#4x- Parallel Algorithun  (Click here to dowanload)

#5x- TOA  (Click here to dowanload)

Follow NPTEL 

IIT Kharagpur Hand Made Notes____ For Gate[Computer Science] Best Notes On Internet

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

All The Notes Are Very Simple And UseFul To You Guys. Just DownLoad And Study.

                                           ____IIT-Kharagpur____

Don't Forgt To Hit Like

1.  Click Here For______ "CompilerDesign"
2. Click Here For______"ComputerArchitecture"
3. Click Here For______"ComputerNetworks"
4. Click Here For______"DAAandDS"
5. Click Here For______"DBMS"
6. Click Here For______"DigitalLogic"
7. Click Here For______"DiscreteMathematics"
8. Click Here For______"EngineeringMathematics"
9. Click Here For______"GraphTheory"
10. Click Here For______"OperatingSystems"
11. Click Here For______"SoftwareEngineering"
12. Click Here For______"TheoryOfComputation"
13. Click Here If You Like!______""

IIT Kharagpur Notes______ Best GATE Notes On Internet For CSE+IT! [ All Subject wise+ Topic Wise]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Don't Forgt To Hit Like

1. “Discrete Mathematics” Click Here
2. “Engineering Mathematics” Click Here
3. “Graph Theory” Click Here
4. “Digital Logic” Click Here
5. “Computer Organization and Architecture” Click Here
6. “Data Structures and Algorithms” Click Here
7. “Theory of Computation” and “NPC” Click Here
8. “Compiler Design” Click Here
9. “Operating Systems” Click Here
10. “Database Management Systems” Click Here
11. “Computer Networks” Click Here
12. “Software Engineering” Click Here

Ten Basic Things to Remember for GATE Exam

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Whatever I am going to write today are very basic things, but I have seen that most of the students forget one thing or other. Hence I thought writing these things here. I would suggest that make a list of all such things so that you don’t forget anything on the day of exam.

1. Don’t Forget Your Wrist Watch and Calculator :

Now a days, most of us have left the habit of wearing a wrist watch because of mobile phones. But this thing is not going to work in a competition exam like GATE. For calculator, I would just say that most of the time it’s not need, specially in GATE Computer Science but still it’s better to keep it with you.

2. Keep a Water Bottle With You:

This is one of the very important things. If you are in exam and you are thirsty, then your mind will be distracted. I would suggest that don’t take much water at a time. Just take small sips of water whenever you feel thirsty. Don’t think that you will purchase the water bottle from some shop near to your exam center. You might end up in some exam center where there is no shop near by.

3. Keep Pencil, Eraser and Sharpener

Most of you might be thinking that you have to mark the GATE OMR sheet using a ball pen, so you don’t need to keep these things. My suggestion is that fill the omr sheet using ball pen, but solve the questions only using pencil. The space given in the exam paper is not much, so you can’t afford to do a long calculation again if you make some mistake. In another case, suppose if you draw a wrong diagram using ball pen, then you will have to draw it again, but with pencil, you can correct it easily. This thing had happened with me in GATE 2010, that’s why I thought to mention it.

4. Say No to Heavy Breakfast

Don’t take heavy breakfast, otherwise you will feel sleepy in the exam. Better take light breakfast and fruits. Also keep some packets of biscuits.

5. Wear Comfortable Clothes

This is the thing most of us usually don’t care, but it’s very important. You should be able to sit comfortably in the exam otherwise your mind will be distracted. Hence say no to tight jeans for one day.

6. Keep a Clip Board With You

I hope you understood why you need this. It will be needed if the furniture in the classroom is not good. So it’s better to be on the safe side.

7. Reach the Exam Center Before Time

Reach at least one hour before time. You will find a very long queue at exam center. So for peace of mind, it’s necessary that you reach before time. I would also suggest that if you are thinking to use your own vehicle to reach the exam center, then keep some backup plan to avoid situations like bike puncture. Better come with some family member.

8. Don’t Study Anything the Day Before Exam

Since you have already spent so much time in studying, you need this one day break so that your mind can fit things in it properly. Try to take rest as much as possible which will relax your mind and you will be able to solve more difficult problems in the exam.

9. Use the Given Answer Choices to Find the Correct Answer

In few questions, you will find that it’s difficult to solve the question and get the answer. For example in case of recurrence relations, it’s difficult to find the equation from the recurrence relation given. But if you know the answer choices, you can verify which equation satisfies the recurrence relation. You can try this technique to solve some of the problems.

10. Pick Some Random Question, if You Are Not Able to Solve the Questions

Sometimes it happens that you are not able to solve many questions continuously. If you stuck at this kind of situation, you will start loosing your confidence and your speed will slow down. In that case I would suggest that pick some random question and try to start solving from that question. Sometimes it’s good to start the question paper from last, because you might find easy questions in last and difficult questions in starting.

I hope you liked these simple things. Thanks for reading and All The Best for your exam. I will be writing post GATE tips after the GATE exam. So please keep checking this website.

Don't Forgt To Hit Like

SAMPLE QUESTIONS FOR GATE ECOLOGY AND EVOLUTION (EY) PAPER

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

SAMPLE QUESTIONS FOR GATE ECOLOGY AND EVOLUTION (EY) PAPER

Click/Like This Post On FaceBook-

1. There are two isolated populations of different size. The frequency of alleles M1 and M2 in population 1 (N=2000) is 0.23 and 0.77, whereas the frequency of alleles M1 and M2 in population 2 (N=200) is 0.76 and 0.24. Which of the following is true:
(A) probability of fixation of M1 allele is greater than M2 allele in population 1.
(B) probability of fixation of M2 allele is greater than M1 allele in population 2.
(C) probability of fixation of M1 allele in population 1 is greater than M2 allele in population 2.
(D) probability of fixation of M2 allele in population 2 is greater than M1 allele in population 1.

2. Consider a population which is changing from one generation to the next as per the equation N(t) = R*N(t-1), where N(t) represents the size of the population at time t and R is a constant growth parameter. Under what condition is the population likely to go extinct?
(A) R=2
(B) R<1
(C) R=1
(D) R>1
3. India and Pakistan play a one-day cricket series with 7 games. The match referee uses the same unbiased coin for the toss at each of the seven games. What is the probability that the same team wins the toss in all seven games?
(A) 1/26
(B) 1/27
(C) 1/28
(D) This is impossible with a fair coin.
4. Which of the following primates is most closely related to humans?
(A) Lemur
(B) Macaque
(C) Loris
(D) Spider monkey
5. Most sharks need to swim continuously, because
(A) they lack swim bladders and would sink if they did not move
(B) they have high metabolic rates and need to feed constantly
(C) they lack lateral lines and would get disoriented
(D) they are adapted to search for prey constantly
6. All organisms are either
(A) autotrophs or heterotrophs
(B) photosynthetic or chemosynthetic
(C) photosynthetic or autotrophic
(D) herbivores or carnivores
7. Parental care is least common in which of the following groups:
(A) Frogs
(B) Crocodiles
(C) Snakes
(D) Turtles
9. The number of species increases as a nonlinear function of forest patch size. Which of the following is not a signature of nonlinearity?
(A) Each time the patch-size of a forest doubles, the number of species quadruples.
(B) Each time the patch-size of a forest doubles, the number of species doubles.
(C) Rate of change of number of species with patch-size is not a constant.
(D) Each time the patch-size of a forest doubles, the number of species decreases by a factor of four.
10. If the population density (n) of a species at time (t) is governed by the equation, n(t) = 8 e-t/2, the population will decline by a factor of 1/e in
(A) 1 time unit
(B) 2 time units
(C) 4 time units
(D) 8 time units.
11. Mean value of a trait in the population will increase when
(A) trait values and fitness are not correlated
(B) trait values and fitness are negatively correlated
(C) trait values and fitness are positively correlated
(D) trait values and fitness are both random.
13. Which of the following would cause a decrease in body temperature in a mammal?
(A) an increase in metabolic rate
(B) shifting circulation from periphery to core
(C) evaporation of water from skin
(D) basking next to standing water
14. A population shows three distinct mating strategies at an evolutionary equilibrium, i.e., relative frequencies of these strategies do not change with time. If the frequency of occurrence of these three strategies is in the ratio 1:2:3, the ratio of their average fitness is:
(A) 1:2:3
(B) 1 : 1 : 1
(C) 1:3:6
(D) 1 : 0.5 : 0.33
15. The derivative of a function f(x) at a location x0 is
(A) The value of function f(x) at x0
(B) The inverse of the value of function f(x) at x0
(C) The slope of the tangent of the function at x0
(D) The inverse of the slope of the tangent of the function at x0
17. In a frog chorus, the probability of an individual calling frog being eaten by a bat predator increases with the number of calling frogs (larger choruses). This is probably because
(A) Larger choruses increase the probability of a calling individual being located by a predator.
(B) Larger choruses increase the probability of attracting bat predators.
(C) Larger choruses increase the detectability of individuals within them.
(D) Larger choruses decrease the detectability of individuals within them.
18. Rats could be successfully trained to avoid a novel odour that was paired with presentation of a food item that made them vomit soon after consumption. They could not however be trained to avoid a sound stimulus paired in the same manner with the food item, even after multiple presentations. Which of the following statements is not a possible interpretation of these results?
(A) Rats are phylogenetically constrained in the kinds of stimuli they can use to form associations.
(B) The sound stimulus used may have been outside the perceptual range of the rat’s auditory system.
(C) Food and odours tend to co-occur in a rat’s natural environment whereas food and sounds do not.
(D) Odours induce learning in animals far more effectively than sounds do.
19. Which of the following characterizes a k-selected species?
(A) long life expectancy
(B) little parental care
(C) many offspring per reproductive bout
(D) early maturity
20. A Poisson distribution is often used in ecology to describe discrete data, such as counts of animals. In the Poisson distribution the variance equals the mean. For this distribution, the coefficient of variation
(A) increases as the mean increases
(B) decreases as the mean increases
(C) is unrelated to the mean
(D) increases with the mean as long as the mean is less than 10.
21. Assume that Species X is a weed that was introduced into India from South America about 200 years ago. In a molecular genetic study, the diversity at a single neutral locus was determined from 100 individuals collected from across India and 100 from across South America. What of the following is likely to be true?
(A) Allelic diversity at this locus will be higher in the South American population than the Indian population, but heterozygosity will be higher for the Indian population.
(B) Allelic diversity at this locus will be lower in the South American population than the Indian population, and heterozygosity will be about the same for both.
(C) Allelic diversity at this locus will be higher in the Indian population than the South American population, but heterozygosity will be higher for the South American population.
(D) Both allelic diversity and heterozygosity will be higher in the South American population.
22. Individual ants were trained to forage from a food source 20 m from their nest. In test trials, these ants, after walking the outbound distance to the food source, were then displaced 100 m to one side in an odourless terrain without visual landmarks. They walked 20 m in a random direction and then started searching for the nest entrance. This experiment indicates that
(A) Ants require visual landmarks to estimate distance correctly.
(B) Ants do not require directional information to estimate distance correctly.
(C) Ants require directional information to estimate distance correctly.
(D) Ants require odours to estimate direction correctly.
23. Dinosaurs were the most dominant terrestrial vertebrate for 135 million years. According to the fossil record, dinosaurs first appeared during the ______ period and were extinct by the end of the __________ period.
(A) Triassic, Cretaceous
(B) Jurassic, Cretaceous
(C) Jurassic, Holocene
(D) Cretaceous, Tertiary
24. A bat species preys exclusively on two moth species E and F. The bat chases every moth it encounters in flight and encounters are random. If chased, a moth of species E has a 20% chance of being eaten whereas a moth of species F has an 80% chance of being eaten. The relative abundance of the two moth species is 4:1 (E:F) and both have similar levels of flight activity. The proportion of the two moth species (E:F) in the diet of the bat will be
(A) 4:1
(B) 1:4
(C) 1:1
(D) 1:16
25. To investigate whether hunting reduces recruitment in a deer population, I studied a hunted forest (H+) and a forest without any hunting (H–). I laid 20 transects in H+ and 15 in H– and estimated the density of juvenile deer in both forests. I estimated a mean density of 3 juveniles per sq km (95% confidence interval = 0.2 – 5 juveniles per sq km) at H+ and a mean density of 20 juveniles per sq km (95% confidence interval = 14 – 28 juveniles per sq km) at H–. Based on these data, which of the following statistical inferences is most appropriate?
(A) Mean density of juvenile deer at H+ is significantly lower than that at H–
(B) In general, forests with hunting have lower mean density of juvenile deer than those with no hunting
(C) Mean density of juvenile deer at H+ is significantly lower than that at H–; and, in general, forests with hunting have lower mean density of juvenile deer than those with no hunting
(D) no statistical inferences can be made since sample sizes are not equal.
26. Which of the following is an exotic plant in India
(A) Shorea robusta
(B) Mangifera indica
(C) Casuarina equisetifolia
(D) Rauwolfia serpentina
27. Metapopulation structure is thought to reduce the risk of extinction of a species in the larger landscape. Which of the configurations of populations described below has the lowest risk of extinction?
(A) Populations that show high connectivity and synchronised dynamics
(B) Populations that are very isolated from each other
(C) Populations that are very close to each other
(D) Populations that show some connectivity and asynchronised dynamics
29. In a study of tree dispersion in a forest, we divided the forest into 1 sq km grid cells, choose 50 of them at random, and counted the number of trees in each cell. The variance to mean ratio of the counts of trees per cell was much less than 1. What does this tell us about the spatial distribution of the trees? That they are:
(A) randomly dispersed
(B) highly aggregated
(C) uniformly dispersed
(D) more information is needed
30. Which of the following is not a function of melatonin
(A) influencing circadian rhythms
(B) protection against sunlight
(C) antioxidant
(D) regulation of breeding seasons
31. We study an optimally foraging bird in a habitat where its food is found in patches. Our study reveals that this bird forages within a patch as long as the yield per unit effort in the patch is greater than the average yield per unit effort in the habitat, and leaves for the next patch when this yield per unit effort falls below the average. Which of the following inferences about the system can be made from these results?
(A) Food items are super abundant within a patch.
(B) Patches are equal in size
(C) The cost of moving between patches is negligible
(D) The habitat is resource poor
32. Which of the following is characteristic of long-lived mammals compared to short-lived mammals?
(A) lack of disease
(B) high reproductive rate
(C) large body size
(D) fast metabolism
33. Which of the following plants with particular traits is most vulnerable to extinction in a fragmented forest landscape?
(A) self-pollinated and wind-dispersed
(B) cross-pollinated and animal-dispersed
(C) self-pollinated and animal-dispersed
(D) cross-pollinated and wind-dispersed
34. I sampled ants in a forest with three different vegetation types – dry deciduous forest, moist deciduous forest and evergreen forest. In order to capture as much species richness as possible, I laid 10 plots in each vegetation type, following no particular procedure for determining where each plot was laid within the vegetation type. The sampling procedure can best be described as:
(A) Random sampling
(B) Uniform sampling
(C) Stratified random sampling
(D) Stratified sampling
35. In pea plants, yellow seeds are dominant to green. If a heterozygous yellow seeded plant is crossed with a green seeded plant, what ratio of yellow and green seeded plants would you expect in the F1 generation?
(A) 3 : 1
(B) 50 : 50
(C) 9 : 1
(D) 1 : 3
36. In cladistics, monophyletic groups are those that contain all the possible descendants of a hypothetical common ancestor. In the classification of higher vertebrates, an example of a paraphyletic group is:
(A) Reptiles, since it does not include frogs.
(B) Herpetofauna, since it does not include birds.
(C) Reptiles, since it does not include birds.
(D) Mammals, since it does not include birds.
37. The evolutionary process most likely to account for the fixation of a neutral allele in small populations is:
(A) selection
(B) mutation
(C) genetic drift
(D) recombination
38. Scientists have predicted on the basis of modeling future climate change at the global scale that:
(A) precipitation would decline globally.
(B) Antarctic ice would be first to melt as a result of global warming.
(C) Himalayan glaciers would disappear by the year 2035.
(D) variability in weather events would increase.
39. Atmospheric levels of carbon dioxide have been steadily increasing in recent decades as a result of fossil fuel and biomass burning. Botanists studying changes in leaf stomata have observed that:
(A) stomatal density has been increasing over time.
(B) stomatal density has been decreasing over time.
(C) stomatal size has been increasing over time.
(D) stomatal size has been decreasing over time.
40. You wish to evaluate the effects of fire and grazing on grassland productivity. To do this, you set up 12 plots representing 3 replicates each of 4 treatments (ungrazed and no fire, ungrazed plus fire, grazed plus fire, grazed but no fire) and measure the biomass in each plot. An appropriate statistical test to evaluate the effects of fire and grazing on biomass would be:
(A) a cluster analysis.
(B) a discriminant function analysis.
(C) multidimensional scaling.
(D) an analysis of variance.
41. Three species of lizards live in a largely rocky area with a few shrubs and some bare ground. Species A is distributed equally across all habitats, Species B is found largely on bushes, and Species C is found largely on rocks. Given the information, which of the following statements is most likely to be true?
(A) Species A shows no preference for any of habitats.
(B) Species B shows a preference for bushes.
(C) Species C shows a preference for rocks.
(D) None of the lizards show a preference for bare ground.
42. A mountain chain is formed in the middle of the range of a widely distributed species, splitting it into two populations. Eventually these two populations diverge into two distinct species due to a lack of gene flow between them. This is an example of:
(A) parapatric speciation
(B) sympatric speciation
(C) allopatric speciation
(D) peripatric speciation
43. The peak of the last ice age, also known as the Last Glacial Maximum, occurred approximately how many years ago?
(A) 800 years ago
(B) 8000 years ago
(C) 18000 years ago
(D) 28000 years ago
44. Seed dispersal is likely to strongly promote recruitment in forest tree species for which seed survival ______________ with distance from the parent tree and ___________ with conspecific seed density.
(A) is uniformly high; decreases
(B) decreases; increases
(C) increases; decreases
(D) increases; is uniformly low
45. In a diploid organism, a locus has only two alleles A1 and A2. The heterozygosity at this locus can attain a maximum value of:
(A) 1.00
(B) 0.75
(C) 0.50
(D) 0.25
46. To call a behaviour altruistic, an evolutionary biologist will have to demonstrate that
(A) the behaviour increases the individual fitness of the donor and decreases the individual fitness of the recipient
(B) the donor does not bear any cost when performing the behaviour and the recipient’s individual fitness increases
(C) the behaviour increases the individual fitness of both the donor and the recipient
(D) the behaviour decreases the individual fitness of the donor and increases the individual fitness of the recipient.

Stay Update For EveryNotes Of GATE

Don't Forgt To Hit Like

Computer Networks (CN) Notes____________IIT-BHU [HandMade Notes]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Click/Like This Post On FaceBook-

Note: This Note is Prepared By one of The Gems Of IIT-BHU For You Guys...!!

Please Download And Share In Your Frnds..!!

______Computer Networks (CN)(Click here)_____

or Copy This Link and Paste in New Window~

https://drive.google.com/file/d/0B14srbnImPKeSm4yaFdsMVBqVmc/edit?usp=sharing
Stay Update For EveryNotes Of GATE

Don't Forgt To Hit Like

ShortNotes For Gate__________[Computer Science] [2 Marks Questions] [Free Download]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Like This Page to Get All The Updates  Direct To You FB Inbox ...

[2 Marks Questions ]

Click/Like This Post On FaceBook-

Note: This Note is Prepared By me!

Please Download And Share In Your Frnds..!!

Stay Update For EveryNotes Of GATE
_______"AI"
______"CN"
____"DBMS"
___"SoftwareEngg"
_______"TOC"
_______"DS"
______"DAA"
______"DM"
______"OS"
______"OOPs"

Don't Forgt To Hit Like

Maths Notes____________IIT-BHU [HandMade Notes]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Click/Like This Post On FaceBook-

Note: This Note is Prepared By one of The Gems Of IIT-BHU For You Guys...!!

Please Download And Share In Your Frnds..!!

____________Maths Notes(Click here)_______________
or Just Copy the Link And Paste
Link- https://docs.google.com/file/d/0B14srbnImPKeeGhBVWxWTU56M0E/edit?usp=sharing

Stay Update For EveryNotes Of GATE

Don't Forgt To Hit Like

Data Structure Notes_____________IIT-BHU [Hand Made Notes!] [Free Download]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Click/Like This Post On FaceBook-

Note: This Note is Prepared By one of The Gems Of IIT-BHU For You Guys...!!

Please Download And Share In Your Frnds..!!

____________DATA Structure(Click here)_______________

Stay Update For EveryNotes Of GATE

In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
Data structures provide a means to manage large amounts of data efficiently, such as large databases and internet indexing services. Usually, efficient data structures are a key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Storing and retrieving can be carried out on data stored in both main memory and in secondary memory.

Don't Forgt To Hit Like

Compiler Notes___________IIT-BHU [Home Made Notes] Free Download

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Click/Like This Post On FaceBook-

Note: This Note is Prepared By one of The Gems Of IIT-BHU For You Guys...!!

Please Download And Share In Your Frnds..!!

____________Compiler Notes(Click here)_______________

Stay Update For EveryNotes Of GATE

A compiler is a computer program (or set of programs) that transforms source code written in a programming language (the source language) into another computer language (the target language, often having a binary form known as object code).The most common reason for wanting to transform source code is to create an executable program.

The name "compiler" is primarily used for programs that translate source code from a high-level programming language to a lower level language (e.g., assembly language or machine code). If the compiled program can run on a computer whose CPU or operating system is different from the one on which the compiler runs, the compiler is known as a cross-compiler. A program that translates from a low level language to a higher level one is a decompiler. A program that translates between high-level languages is usually called a language translator, source to source translator, or language converter. A language rewriter is usually a program that translates the form of expressions without a change of language.

Structure of a compiler

Compilers bridge source programs in high-level languages with the underlying hardware. A compiler verifies code syntax, generates efficient object code, performs run-time organization, and formats the output according to assembler and linker conventions. A compiler consists of:

1. The front end: Verifies syntax and semantics, and generates an intermediate representation or IR of the source code for processing by the middle-end. Performs type checking by collecting type information. Generates errors and warning, if any, in a useful way.
2. The middle end: Performs optimizations, including removal of useless or unreachable code, discovery and propagation of constant values, relocation of computation to a less frequently executed place (e.g., out of a loop), or specialization of computation based on the context. Generates another IR for the backend.
3. The back end: Generates the assembly code, performing register allocation in process. (Assigns processor registers for the program variables where possible.) Optimizes target code utilization of the hardware by figuring out how to keep parallel execution units busy, filling delay slots. Although most algorithms for optimization are in NP, heuristic techniques are well-developed.

Don't Forgt To Hit Like

TOC Notes_________________IIT-BHU [Hand Made Notes] Free Download

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Click/Like This Post On FaceBook-

Note: This Note is Prepared By one of The Gems Of IIT-BHU For You Guys...!!

Please Download And Share In Your Frnds..!!

____________TOC Notes(Click here)_______________

Stay Update For EveryNotes Of GATE

In theoretical computer science and mathematics, the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory, computability theory, and computational complexity theory

Automata theory is the study of abstract machines (or more appropriately, abstract 'mathematical' machines or systems) and the computational problems that can be solved using these machines. These abstract machines are called automata. Automata comes from the Greek word (Αυτόματα) which means that something is doing something by itself. Automata theory is also closely related to formal language theory, as the automata are often classified by the class of formal languages they are able to recognize. An automaton can be a finite representation of a formal language that may be an infinite set.

Don't Forgt To Hit Like

DBMS Notes_____________ IIT-BHU [Hand Made Notes] Free Download

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Click/Like This Post On FaceBook-

Note: This Note is Prepared By one of The Gems Of IIT-BHU For You Guys...!!

Please Download And Share In Your Frnds..!!

____________DBMS Notes(Click here)_______________

Stay Update For EveryNotes Of GATE

Don't Forgt To Hit Like

DAA Notes______IIT-BHU(Hand Made Notes)

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Like This To Be Updated Every Notes in Facebook


Click Below To Download DAA Notes.... :)

___________ DAA Notes/Click Here__________

____________For More Notes Kinda Write To Us. (:
____________Waiting  For Your FeedBack

Don't Forgt To Hit Like

curriculum vitae (CV) for Freshers [B.Tech]

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

Curriculum vitaeA curriculum vitae (CV) provides an overview of a person's experience and other qualifications. In some countries, a CV is typically the first item that a potential employer encounters regarding the job seeker and is typically used to screen applicants, often followed by an interview, when seeking employment.

Click Here to Download
((

curriculum vitae

))

Don't Forgt To Hit Like

Basic Things That You Must Know For Qualifying Gate & Computer Engineering.

CLick Here For Free All MadeEasy Sample Paper download - https://goo.gl/zdBmvx

[Books and Resources for gate preparation]

By Er./Hr. Shashank Singh[Freelance]

Books I refered for  gate preparation

COMPILERS

-> Compilers : Principles, Techniques ,  Alfred V. Aho,
-> Compiler design O.G kakde *
-> http://lambda.uta.edu/cse5317/notes/node1.html

THEORY OF COMPUTATION


-> Introduction to Automata Theory, Languages and Computation ,  John E. Hopcroft,
-> Formal Languages And Automata Theory , K V N Sunitha, N Kalyani *


OPERATING SYSTEM

-> Operating System Concepts by Galvin,Silberswatz
-> SCHAUM SERIES , Archer J Harris *


DATA STRUCTURE


-> Data StructuresandProgram Designin C++ Prentice Hall ,Robert L. Kruse Alexander J. Ryba
-> Data Structures (Schaum’s Outline Series) by Seymore Lipshutz *
-> Fundamentals of Data Structures in C 2nd by  Sartaj Sahni, Susan Anderson-Freed, Ellis Horowitz

DIGITAL LOGIC
-> Digital Logic Design by Morris Mano
-> Fundamentals of digital circuit by anand kumar *


COMPUTER ARCHITECTURE


-> Computer System Architecture by Morris Mano
-> fundamental of computer architecture , Mostafa Abd-El-Barr ,Hesham El-Rewini *

COMPUTER NETWORKS


-> computer networks by andrew s tanenbaum *

DATABASE

-> Database System Concepts by Korth,Sudershan & Silberswatz
-> Fundamental Of Database Systems by Elmsari, Navathe
-> Schaum's Outline of Fundamentals of Relational Databases *

ALGORITHM

-> Introduction to Algorithms , CLRS
-> Algorithms , Dasgupta ,vazirani *

MATHS

-> Elements of Discrete Mathematics : C l Liu
-> Introduction to Graph Theory , Douglas B. West *
-> Higher Engineering Mathematics B,S grewal  // one serious advise don't read this book crappy book  only good if you already know maths no learning curve.     good alternative for this will be Advanced Engineering Mathematics by Erwin Kreyszig


Software/web tech/aptitute/english  is more or less  like general knowledge

Books with * mark after it may not be the best book but they are very easy to understand and will develop your interest  atleast in my case :)
**************************************************************************************
All resources
**************************************************************************************

you are advised to copy all this content to your own mediafire account just click on add to my account .

This may get  deleted at some point of time and I may not reupload but when I get time probably I may create mirrors and alternate links .

Links to study material for GATE- all standard books etc. (will be updating when I get time)
http://www.mediafire.com/?mtw2utt94vr58

‎1998-2011 gate papers with keys- (keys may me wrong sometimes or maybe many times)
http://www.mediafire.com/?amtpnenmdsec9m9

1991-2012 (last 22 years) gate paper cs without keys.
http://www.mediafire.com/?g2em8o1yueep3ge

All gateforum targate Paper 2012 - (My own targate test :D)
http://www.mediafire.com/?jig6ej59cf5u4v0

Handouts materials misc collections (Recommended) single zip file
http://www.mediafire.com/?3vaebd7i87927t7

subject wise question with keys
http://www.mediafire.com/?j3vp3n5dj15e9

ACE My Online TEST (small size some kb after extractin open html file)
test_datastrucutre_1.7z http://www.mediafire.com/?5wac8038qp043y7
test_datastrucutre_2.7z http://www.mediafire.com/?wnivke3np91mj40
test_datastrucutre_3.7z http://www.mediafire.com/?onctoj9led2ch24
test_digital_1.7z http://www.mediafire.com/?nvm4n8ewws3820c
ace os mem mng.7z http://www.mediafire.com/?b7b1sch1j5se1t5
test_toc_regular.7z http://www.mediafire.com/?h57jjc1s12a1sqe

*** Gate Materials By Aman ***
http://theradium.blogspot.in/2010/03/download-gate-ebooks-cse-it.html

Radom Topics (you can add to your evernote account)
https://www.evernote.com/pub/nirajkant/csgate#b=1fb744aa-7068-46e7-bad9-f5db178c8240&n=659b9253-9299-4d7e-91da-d164e8605a7e


**************************************************************************************
Video lectures which are too good
**************************************************************************************


complete video Lecture Series of P.K biswas for operating system
downloadabe link
http://www.mediafire.com/?ukq8ibq02v7vnyoutube linkhttps://www.youtube.com/playlist?list=PLLDC70psjvq5hIT0kfr1sirNuees0NIbG

complete video Lecture Series of discerte mathematics by arthur t benjamin
http://www.mediafire.com/?47ckyz0ygj1rq
Theory of computation by shai simonsonhttp://www.youtube.com/watch?v=HyUK5RAJg1c&list=PL601FC994BDD963E4Discrete
Maths by shai simonsonhttp://www.youtube.com/watch?v=h_9WjWENWV8Algorithms
by shai simonsonhttp://www.youtube.com/watch?v=gwlevtaC-u0&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm

Don't Forgt To Hit Like