Education and Career Forum

may i get tips and model QN papers for GATE

You have'nt mentioned for which branch of engineering you want gate sample papers.

However,you can get it from the below given link:-

http://crazysoft4all.blogspot.com/20...on-papers.html

Be focus on what you have studies up to this time in B.Tech IT and prepare for the GATE .

hi
go for GK publication book of GATE or take any book like GOLD publication........
or go for package of any coaching institutes like GATEFORUM...wel;l JUST basics are asked in GATE..and question from each and every topi is asked.....so prepare for it....paper is not very much difficultt..its generally easy

Originally Posted by [email protected]

may i get tips and model QN papers for GATE

first you should have vivid knowledge about your GATE portion.
then choose the papers that contains theory and have direct questions,study well.
next go for the paper that you prepared well during your academic.
after that go for the rest of papers ,choose easier topics.
atlast go for difficult topics dont put more effect, dont get tense.
revise the topics once again.
surely you reach your goal.
thanks.

Buy GATE books and work out the questions given under each topic... Buy GATE materials online... GATE forum in major cities will provide u GATEmaterials wen u pay.... Always visit the websites GATEmentor,GATEforum and other GATE related websites for mock tests and previous year question papers...

the general procedure should be :-
Note down the probable concepts(definitions, unit, dimension etc.)
Note down necessary theories, formulas etc
Solve problems as maximum as possible(from text books, Guide books etc)
Think about various tricks in solving problems(if necessary, note it)
Go for series of self tests based on this chapter(take others help to conduct tests)
Continue the self tests until getting a very good score
Solve more and more problems, discover more and more new tricks…

best of luck

i will suggest you that study deeply every topics of the syllabus.
practice chapter wise question.
study the good guides available in market,such as G.K publication.
lastly hard work is only matter of success.

GATE preparation is quite simple if you regularly study your course book
Also you can consult a special book of gate on your branch
!! better luck!!!

dear friend
you can download previous questions as well as sample papers from
www.onestopgate.com/question-bank/
www.gateforum.com
www.indiastudychannel.com/exams/ExamPaper69061.aspx
you can also get the syllabus,application forms,etc from
http://way2freshers.com/gate-preparation/gate-2010-syllabus-gate-2010-online-application-forms-gate-2010-exam-pattern.html
all the best

hi friend
for the best preparation of the gate exam you must join any of the institute for the preparation of gate exam,and moreover you can purchase the g.k publication books for the gate exam.
you can also get the previous year question paper from the following site www.freshersworld.com.


best of luck for your exam.

hey friend,

i will suggest you to visit the websites
www.freshersworld.com.
there you will find gate as a option ,
and then you can find each and every information.

hi....
in order to prove your ....calibre....
oyu have to deserve its worth...
you can...consult...with...the books...of publications.....like.....T.M.H,G.K...publications ...
you have to be depth in the knowledge...
and you have to go through ....certain......previous to predict for the....questions....
you can get it from.....www.onestopgate.com/question-bank/
for further reference contact....
www.gateforum.com...
best of luck...

hi
visit

http://gate.learnhub.com/discussions/44392-how-to-prepare-for-gate

http://www.studyplaces.com/answers/gate-score-how-prepare-gate

http://www.gateforum.com/GATE_registration.php

www.onestopgate.com/question-bank/


all the best

gate is not easy exam ..
in this year 65 questions asked in gate paper time is 3 hours
each question contains 1 or 2 marks...
prepare for your basic core subjects there after
some maths and english...
try gate forum study materials ,,,
gate questions have some good level
it is not easy to solve ..
so practice hard level questions...
good luck...

dear friend
all the question are based on the syllabus of your own university
so be focused on the syllabus.
a hard working is needed for that.

all the best.

dear friend,
just concentrate in your study, and prepare according to syllabus,
you will get sucess..........

hi
it is possible to prepare for GATE without any coaching. But for this you should have a good engineering base and knowledge.

here is some tips
.1 Bring previous year GATE exam question papers (gate exam questions are available very easily in the market).

2. Start back study (i.e. pick up GATE questions and find the solution) I personally believe if you practice to solve all the gate questions from the previous asked (at least 6-8 year) you can definitely qualify the gate exam.

3. Another important fact is: do not answer wrong during the gate examination even your total score is only 35 to 45 % (mostly people could not qualify gate exam because they attempt to answer wrong question).

4. Keep in mind, most of the time negative marking is only responsible to the failure.

Check out the following site. I hope this will help you
http://www.indiastudycenter.com/Other/TestPapers/Others/GATE/Default.asp
http://www.gate2010.co.tv
http://gate.learnhub.com/questions/44392-how-to-prepare-for-gate

best of luck

this years gate exam was entirely based on the basics and nothing new or really tough questions were asked
you have to be just strong in your engineering basics thats it
if possible please take some kind of coaching
all the best

you can prepare for the exam byu going through the books at www.onestopgate.com/books you can rely on these books for your success

dear frnd
it will be to join a coaching institute to crack GATE
you can follow the book of G.K.Publication
what you have studies go through it and serious study is needed

hi friend,
• read at least 5 books, it will widen your knowledge(if necessary consult with the books for pre-requisite knowledge or with some expert)
• Note down the probable concepts(definitions, unit, dimension etc.)
• Note down necessary theories, formulae etc
• Solve problems as maximum as possible(from text books, Guide books etc)
• Think about various tricks in solving problems(if necessary, note it)
• Go for series of self tests based on this chapter(take other's help to conduct tests)
• Continue the self tests until getting a very good score

o k
all the best

dear friend,
it is very easy to prepare for GATE.you need to work hard .if you are in IT ,then you must have a strong programming language.study Automata,microporcessor,c ,c++ and networking,data structures,maths tec.
best of luck.

dear friend
it would be better for you that you just take the reference of
corresponding coarse from brilliant tutorial and try to solve multiple choice questions
that will help you a lot and along with that do not forget to
neglect the apptitude part ,
it consist of 15 marks which will definitly will prove a boon for you.
so burn your midnight oil and start preparing for it from now.
and definitly you will succed.

best of luck.

dear friend
as you are ITfinal year student so i m giving u some tips regarding preparation for gate exam.
1.first of all you have to have a clear concept of the subject you have
2give more time on the following subject:
1.introduction to c language
2. networking
3. automata
4 digital electronics
5 software engineering
6 comp . organisation basically memory part
7. rest of the subject you must have a overview
8. try to solve as much test series paper which help u alot
9. dont forget to solve apptitude part it consist of 15 marks
all the best

Dear friend,
The GATE exam is one of the toughest exam,
it is the totally based on concept of the student.

you can sit in 3rd yr as well as final year,
to get a successful carrier in GATE,according to me you should follow some rules:
1:Maintain a time table
2:try to clear the basic concept on the subjects.
3:solve the previous year papers.

Good luck.

HI.......... I AM DOING THIRD. IT I THINK NOW ITSELF TO PREPARE FOR GATE EXAM ,PLEASE GIVE YOUR OPNION

Originally Posted by [email protected]

may i get tips and model QN papers for GATE

You need to do a crash course for gate entrance from a reputed institute
Friend

Best of luck for your great career....

Dear friend,
You can prepare for GATE by buying GATE books of GK publications or by taking online coaching from various forums
You can also prepare for GATE by your self by work outing as many previous papers as possible
You can download the previous question papers from websites like
http://www.gateforum.com
First of all you have to download the syllabus and spend at least 1 hour in a day to prepare for gate
Good luck friend

[[email protected];6546]may i get tips and model QN papers for GATE[/QUO

http://www.indiastudycenter.com/Other/TestPapers/Others/GATE/Default.asp
http://www.gate2010.co.tv
http://gate.learnhub.com/questions/44392-how-to-prepare-for-gate

friends where can i get answers to the previous papers pleas help me

Originally Posted by [email protected]

may i get tips and model QN papers for GATE

well snithyapriyaa..

I MUST tell you the one thing..

you don't need any tips and tricks for GATE...

JUST you need to concentrate what you want to do in future.

ok if you want tips they are
1.You should have determination of hard work.
2.GATE exams are not tough as such.
3.just you need little concentration over you studies what you are doing now.

good luck...boss

hello friend,
if you want to know syllabus and exam pattern.Way 2 Freshers


1.syllabus for it gate

Basic Mathematics

Mathematical Logic: prepositional logic, first order logic

Probability: random variables and expectation, conditional probability, independent random variables, distributions – uniform, normal, exponential, binomial

Discrete Mathematics: sets, relations, functions, Boolean algebra, induction, recurrence relations

Combinatorics: permutations, combinations, counting summations

Graph Theory: elementary concepts, planarity, matching

Algebra: elementary concepts of linear and matrix algebra

Numerical Methods: classical algorithms for interpolation and root finding, Formal Languages and Automata

Regular languages: finite automata, regular expressions, regular grammar Context free languages: push down automata, context free grammars

Computer Hardware:

Digital Logic: Logic functions, minimization, design and synthesis of combinatorial and sequential circuits, number representation and computer arithmetic (fixed and floating point)

Computer organization: Machine instructions and addressing modes, ALU and data path, hardwired and microprogrammed control, memory interface, I/O interface (interrupt and DMA mode), serial communication interface, instruction pipelining, cache, main and secondary storage

Software Systems:

Data structures and Algorithms: the notion of abstract data types, stack, queue, list, set, string, tree, binary search tree, heap, graph, tree and graph traversals, connected components, spanning trees, shortest paths, hashing, sorting, searching, design techniques (greedy, dynamic, divide and conquer), asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, intractability

Programming Methodology: C programming, program control (iteration, recursion, functions), scope, binding, parameter passing, elementary concepts of object oriented programming

Operating Systems (in the context of Unix): classical concepts (concurrency, synchronization, deadlock), processes, threads and interprocess communication, CPU scheduling, memory management, file systems, I/O systems, protection and security

Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.

Databases: relational model, database design, integrity constraints, normal forms, query languages (SQL), file structures (sequential, indexed), b-trees, transaction and concurrency control

Data Communication: data encoding and transmission, data link control, multiplexing, packet switching, LAN “aTcTiitecture, LAN systems (Ethernet, token ring), Network devices: switches, gateways, routers Networks: ISO/OSI stack, sliding window protocols, routing protocols, TCP/UDP, application layer protocols & systems (http, smtp, dns, ftp), network security






2.QUESTION PAPER PATTERN

The question paper will consist of only objective type questions. Candidates have to mark the correct choice by darkening the appropriate bubble against each question on an Objective Response Sheet (ORS). There will be negative marking for wrong answers. The deduction for each wrong answer will be 25% of the allotted marks.

MAIN PAPERS

* The question paper will be for a total of 150 marks divided into three groups:

(i) Group I: Question Numbers 1 to 20 (20 questions) will carry one mark each (sub total 20 marks).

(ii) Group II: Question Numbers 21 to 75 (55 questions) will carry two marks each (sub total 110 marks). Out of these, Q.71 to Q.75 may be common data based questions.

(iii) Group III: Question Numbers 76 to 85 (10 questions) will carry two marks each (sub total 20 marks). These questions are called linked answer questions. These 10 questions comprise five pairs of questions (76 & 77, 78 & 79, etc.). The solution to the second question of each pair (e.g. Q.77) will be linked to the correct answer to the first one (e.g. Q.76) in the pair.

* Each question will have four choices for the answer. Only one choice is correct.
*Wrong answers carry 25% negative marks. In Q.1 to Q.20, 0.25 mark will be deducted for each wrong answer and in Q.21 to Q.76, Q.78, Q.80, Q.82 and Q.84, 0.5 mark will be deducted for each wrong answer. If the first question in the linked pair is wrong, then the second question in the pair will not be evaluated. However, there is no negative marking for the linked answer questions in Q.77, Q.79, Q.81, Q.83 and Q.85.
*Papers bearing the code AE, AG, CE, CH, CS, EC, EE, IN, IT, ME, MN, MT, PI, TF will contain questions on Engineering Mathematics to the extent of 20 to 25 marks.
*The multiple choice objective test questions can be of the following type:

(i) Each choice containing a single stand-alone statement/phrase/data.

Example
Q. The state of an ideal gas is changed from (T1, P1) to (T2, P2) in a constant volume process. To calculate the change in enthalpy, Dh, ALL of the following properties/variables are required.
(A) Cv, P1, P2
(B) Cp, T1, T2
(C) Cp, T1, T2, P1, P2
(D) Cv, P1, P2, T1, T2

(ii) Each choice containing a combination of option codes.
The question may be accompanied by four options P, Q, R, S and the choices may be a combination of these options. The candidate has to choose the right combination as the correct answer.

Example
Q. The following list of options P, Q, R and S are some of the important considerations in the design of a shell and tube heat exchanger.
P: square pitch permits the use of more tubes in a given shell diameter
Q: the tube side clearance should not be less than one fourth of the tube diameter
R: baffle spacing is not greater than the diameter of the shell or less than one fifth of the shell diameter.
S: the pressure drop on the tube side is less than 10 psi
(A) P, Q and R (B) Q, R and S (C) R, S and P (D) P, Q, R and S

(iii) Assertion[a]/Reason[r] type with the choices stating if [a]/[r] are True/False and/or stating if [r] is correct/incorrect reasoning of [a]

Example
Q. Assertion [a]: Bernoulli’s equation can be applied along the central streamline in a steady laminar fully-developed flow through a straight circular pipe.
Reason [r]: The shear stress is zero at the centre-line for the above flow.
(A) Both [a] and [r] are true and [r] is the correct reason for [a]
(B) Both [a] and [r] are true but [r] is not the correct reason for [a]
(C) Both [a] and [r] are false
(D) [a] is false but [r] is true

(iv) Match items: Match all items in Group 1 with correct options from those given in Group 2 and choose the correct set of combinations from the choices E, F, G and H.

Example
Q. Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.
Group 1 Group 2
P- Gang Scheduling 1- Guaranteed Scheduling
Q- Rate Monotonic Scheduling 2- Real-time Scheduling
R- Fair Share Scheduling 3- Thread Scheduling

(A) P-3; Q-2; R-1 (B) P-1; Q-2; R-3
(C) P-2; Q-3; R-1 (D) P-1; Q-3; R-2

(v) Common data based questions: Multiple questions may be linked to a common problem data, passage and the like. Two or three questions can be formed from the given common problem data. Each question is independent and its solution obtainable from the above problem data/passage directly. (Answer of the previous question is not required to solve the next question). Each question under this group will carry two marks.

Example

Common Data for Questions 74 and 75:

Let X and Y be jointly distributed random variables such that the conditional distribution of Y, given X=x, is uniform on the interval (x-1,x+1). Suppose E(X)=1 and Var(X)=5/3.

First question using common data

Q.74 The mean of the random variable Y is

(A) 1/2 (B) 1 (C) 3/2 (D) 2

Second question using common data

Q.75 The variance of the random variable Y is

(A) 1/2 (B) 2/3 (C) 1 (D) 2

(vi) Linked answer questions: These questions are of problem solving type. A problem statement is followed by two questions based on the problem statement. The two questions are designed such that the solution to the second question depends upon the answer to the first one. In other words, the first answer is an intermediate step in working out the second answer. Each question in such ‘linked answer questions’ will carry two marks.

Example

Statement for Linked Answer Questions 80 and 81:

Consider a machine with a byte addressable main memory of 216 bytes. Assume that a direct mapped data cache
consisting of 32 lines of 64 bytes each is used in the system. A 50×50 two dimensional array of bytes is stored in the main memory starting from memory location 1100H. Assume that the data cache is initially empty. The complete array is accessed twice. Assume that the contents of the data cache do not change in between the two accesses.

First question of the pair

Q.80 How many data cache misses will occur in total?

(A) 48 (B) 50 (C) 56 (D) 59

Second question of the pair

Q.81 Which of the following lines of the data cache will be replaced by new blocks in accessing the array for the second time?

(A) line 4 to line 11 (B) line 4 to line 12

(C) line 0 to line 7 (D) line 0 to line 8

XE SECTION PAPERS EXCEPT FOR SECTION A

* All sections apart from section A are for 60 marks each. Each of the 60 mark section will be fully objective type and the questions are divided into three groups.

(i) Group I: Question Numbers 1 to 8 (8 questions) will carry one mark each (subtotal 8 marks).

(ii) Group II: Question Numbers 9 to 30 (22 questions) will carry two marks each (subtotal 44 marks). Out of this, Q.29 and Q.30 may be common data based questions.

(iii) Group III: Question Numbers 31 to 34 (4 questions) will carry two marks each. These questions are called linked answer questions. These 4 questions comprise two pairs of questions (31 and 32, 33 and 34). The solution to the second question of each pair (e.g. Q.34) will be linked to the correct answer to the first one (e.g. Q.33) in the pair (subtotal 8 marks).

*All questions have four choices with only one being correct.
*Wrong answers carry 25% negative marks. In Q.1 to Q.8 of each section, 0.25 mark will be deducted for each wrong answer and in Q.9 to Q.30, 0.5 mark will be deducted for each wrong answer. However, there is no negative marking in Q.32 and Q.34.
*The pattern of multiple-choice questions is the same as described for the main papers.

XE – SECTION A PAPER (Engineering Mathematics)

*XE section A paper will be for 30 marks. It will consist of fully objective type and the questions are divided into two groups.

(i) Group I: Question Numbers 1 to 6 (6 questions) will carry one mark each (subtotal 6 marks).

(ii) Group II: Question Numbers 7 to 18 (12 questions) will carry two marks each (subtotal 24 marks).

*All questions have four choices with only one being correct.
*Wrong answers carry 25% negative marks. In Q.1 to Q.6 of each section, 0.25 mark will be deducted for each wrong answer and in Q.7 to Q.18, 0.5 mark will be deducted for each wrong answer.
*The pattern of multiple-choice questions is the same as described for the main papers.

XL SECTION PAPERS

* Each Section is of 50 marks. Each section will be fully objective type and the questions are divided into three groups.

(i) Group I: Question Numbers 1 to 6 (6 questions) will carry one mark each (subtotal 6 marks).

(ii) Group II: Question Numbers 7 to 24 (18 questions) will carry two marks each (subtotal 36 marks). Out of this, Q.23 and Q.24 may be common data based questions.

(iii) Group III: Question Numbers 25 to 28 (4 questions) will carry two marks each. These questions are called linked answer questions. These 4 questions comprise two pairs of questions (25 and 26 and 27 and 28). The solution to the second question of each pair (e.g. Q.26) will be linked to the correct answer to the first one (e.g. Q.25) in the pair (subtotal 8 marks).

*All questions have four choices with only one being correct.
*Wrong answers carry 25% negative marks. In Q.1 to Q.6 of each section, 0.25 mark will be deducted for each wrong answer and in Q.7 to Q.25 and Q.27, 0.5 mark will be deducted for each wrong answer. However, there is no negative marking in Q.26 and Q.28.
* The pattern of multiple-choice questions is the same as described for the main papers.

hello,
Way 2 Freshers

* Home
* Community
* Live Chat
* Loans
* Scholarships
* Jobs
* Placement Papers
* Advertise

Get updates, important dates, tips and tricks on GATE
Name:
Email:
Mobile Number:
Gate Overview

About Gate

Structure of GATE

Gate Notification

GATE Exam Pattern

Gate Study Materials

Tips And Tricks

Gate Results

PG Programs
GATE 2011

GATE Eligibility

GATE 2011 Syllabus

How to Apply

Important Dates

CEED Exam
Gate Sample papers

Computer Science Papers

Information Technology

Electronics & Communications

Electronics & Electricals

Instrumentation Engg

Mechanical Engg
Gate Old Papers

ECE

2010|2007|2006|2005|2004

2003|2002|2001

CSE

2010|2006|2005|2004|2003

2002|2001

EE

2010|2009|2008|2005|2004|2003|2001

IT

2005|2004

MECHANICS

2010|2006|2005|2004|2003

2002|2001
GATE SYLLABUS

AE- Aerospace Engineering

AG- Agricultural Engineering

AR- Architecture and Planning

BT- Biotechnology

CE -Civil Engineering

CH- Chemical Engineering

CS- Computer Sc. and Information Tech.

CY- Chemistry

EC- Electronics and Communication Engg.

EE- Electrical Engineering

GG- Geology and Geophysics

IN- Instrumentation Engineering

MA- Mathematics

ME- Mechanical Engineering

MN- Minining Engineering

MT -Metallurgical Engineering

PH -Physics

PI- Production and Industrial Engineering

TF -Textile Engineering and Fibre Science

XE- Section A Engineering Mathematics

XE- Section B Fluid Mechanics

XE- Section C Materials Science

XE- Section D Solid Mechanics

XE- Section E Thermodynamics

XE- Section F Polymer Sc. and Engineering

XE- Section G Food Technology

XL - Section H Chemistry

XL- Section I Biochemistry

XL- Section J Botany

XL- Section K Microbiology

XL- Section L Zoology

XL- Section M Food Technology
GATE Information Technology Question Papers2

By admin on September 18th, 2008 Read this page in hindi

Which one of the following is NOT shared by the threads of the same process ?
Options
A) Stack B) Address Space
C) File Descriptor Table D) Message Queue
Your Answer ( Not Answered )
Correct Answer A
2 In a population of N families, 50% of the families have three children, 30% of the families have two children and the remaining families have one child. What is the probability that a randomly picked child belongs to a family with two children?
Options
A)
3
23
B)
6
23
C)
3
10
D)
3
5
Your Answer ( Not Answered )
Correct Answer B
3 Let P be a non-deterministic push-down automaton (NPDA) with exactly one state, q, and exactly one symbol, Z, in its stack alphabet. State q is both the starting as well as the accepting state of the PDA. The stack is initialized with one Z before the start of the operation of the PDA. Let the input alphabet of the PDA be å . Let L(P) be the language accepted by the PDA by reading a string and reaching its accepting state. Let N(P) be the language accepted by the PDA by reading a string and emptying its stack.
Which of the following statements is TRUE?
Options
A) L(P) is necessarily å * but N(P) is not necessarily å *. B) N(P) is necessarily å * but L(P) is not necessarily å *.
C) Both L(P) and N(P) is necessarily å *. D) Neither L(P) nor N(P) are necessarily å *.
Your Answer ( Not Answered )
Correct Answer D
4 A subnet has been assigned a subnet mask of 255.255.255.192. What is the maximum number of hosts that can belong to this subnet?
Options
A) 14 B) 30
C) 62 D) 126
Your Answer ( Not Answered )
Correct Answer C
5 Suppose that two parties A and B wish to setup a common secret key (D-H key) between themselves using the Diffle-Hellman key exchange technique. They agree on 7 as the modulus and 3 as the primitive root. Party A chooses 2 and party B chooses 5 as their respective secrets. Their D-H key is
Options
A) 3 B) 4
C) 5 D) 6
Your Answer ( Not Answered )
Correct Answer C
6 We have two designs D1 and D2 for a synchronous pipeline processor. D1 has 5 pipeline stages with execution times of 3 nsec, 2 nsec, 4 nsec, 2 nsec and 3 nsec while the design D2 has 8 pipeline stages each with 2 nsec execution time. How much time can be saved using design D2 over design D1 for executing 100 instructions?
Options
A) 214 nsec B) 202 nsec
C) 86 nsec D) -200 nsec
Your Answer ( Not Answered )
Correct Answer A
7 Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best-known algorithm to delete the node x from the list ?
Options
A) O(n) B) O(log 2 n)
C) O(log n) D) O(1)
Your Answer ( Not Answered )
Correct Answer A
8 The number (123456) 8 is equivalent to
Options
A) (A72E) 16 and (22130232) 4 B) (A72E) 16 and (22131122) 4
C) (A73E) 16 and (22130232) 4 D) (A62E) 16 and (22120232) 4
Your Answer ( Not Answered )
Correct Answer D
9 A channel has a bit rate of 4 kbps and one-way propagation delay of 20 ms. The channel uses stop and wait protocol. The transmission time of the acknowledgement frame is negligible. To get a channel efficiency of at least 50%, the minimum frame size should be
Options
A) 80 bytes B) 80 bits
C) 160 bytes D) 160 bits
Your Answer ( Not Answered )
Correct Answer D
10 A network with CSMA/CD protocol in the MAC layer is running at 1 Gbps over a 1 km cable with no repeaters. The signal speed in the cable is 2 x 10 8 m/sec. The minimum frame size for this network should be
Options
A) 10000 bits B) 10000 bytes
C) 5000 bits D) 5000 bytes
Your Answer ( Not Answered )
Correct Answer A
11

A table has fields F1, F2, F3, F4, F5 with the following functional dependencies

F1 ® F3 F2 ® F4 (F1 . F2) ® F5

In terms of Normalization, this table is in
Options
A) 1 NF B) 2 NF
C) 3 NF D) None of these
Your Answer ( Not Answered )
Correct Answer A
12 In a particular Unix OS, each data block is of size 1024 bytes, each node has 10 direct data block addresses and three additional addresses: one for single indirect block, one for double indirect block and one for triple indirect block. Also, each block can contain addresses for 128 blocks. Which one of the following is approximately the maximum size of a file in the file system?
Options
A) 512 MB B) 2 GB
C) 8 GB D) 16 GB
Your Answer ( Not Answered )
Correct Answer D
13 On a TCP connection, current congestion window size is Congestion Window = 4 KB. The window size advertised by the receiver is Advertise Window = 6 KB. The last byte sent by the sender is LastByteSent = 10240 and the last byte acknowledged by the receiver is LastByteAcked = 8192. The current window size at the sender is
Options
A) 2048 bytes B) 4096 bytes
C) 6144 bytes D) 8192 bytes
Your Answer ( Not Answered )
Correct Answer B
14 Choose the correct option to fill the ?1 and ?2 so that the program prints an input string in reverse order. Assume that the input string is terminated by a new line character.
#include
void wrt_it (Void);
int main (void)
{
printf(“Enter Text”);
printf(“/n”);
wrt_it( );
printf(“/n”);
return 0;
}
void wrt_it (void)
{
int c;
if (?1)
wrt_it( );
?2
}
Options
A) ?1 is getchar( ) != “/n”
?2 is getchar(c); B) ?1 is (c=getchar( )) !=”/n”
?2 is getchar(c);
C) ?1 is c != “/n”
?2 is putchar(c); D) ?1 is (c = getchar( )) !=”/n”
?2 is putchar(c);
Your Answer ( Not Answered )
Correct Answer D
15 How many pulses are needed to change the contents of a 8-bit upcounter from 10101100 to 00100111 (rightmost bit is the LSB)?
Options
A) 134 B) 133
C) 124 D) 123
Your Answer ( Not Answered )
Correct Answer B
16 In a computer system, four files of size 11050 bytes, 4990 bytes, 5170 bytes and 12640 bytes need to be stored. For storing these files on disk, we can use either 100 byte disk blocks or 200 byte disk blocks (but can’t mix block sizes). For each block used to store a file, 4 bytes of bookkeeping information also needs to be stored on the disk. Thus, the total space used to store a file is the sum of the space taken to store the file and the space taken to store the bookkeeping information for the blocks allocated for storing the file. A disk block can store either book keeping information for a file or data from a file, but not both.
What is the total space required for storing the files using 100 byte disk blocks and 200 byte disk blocks respectively?
Options
A) 35400 and 35800 bytes B) 35800 and 35400 bytes
C) 35600 and 35400 bytes D) 35400 and 35600 bytes
Your Answer ( Not Answered )
Correct Answer C
17 A 20 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs the “go back n ARQ” scheme with n set to 10. Assuming that each frame is 100 bytes long, what is the maximum data rate possible?
Options
A) 5 Kbps B) 10 Kbps
C) 15 Kbps D) 20 Kbps
Your Answer ( Not Answered )
Correct Answer D
18 A binary search tree contains the numbers 1, 2, 3, 4, 5, 6, 7, 8. When the tree is traversed inpre-order and the values in each node printed out, the sequence of values obtained is 5, 3, 1, 2, 4, 6, 8, 7. If the tree is traversed in post-order, the sequence obtained would be
Options
A) 8, 7, 6, 5, 4, 3, 2, 1 B) 1, 2, 3, 4, 8, 7, 6, 5
C) 2, 1, 4, 3, 6, 7, 8, 5 D) 2, 1, 4, 3, 7, 8, 6, 5
Your Answer ( Not Answered )
Correct Answer D
19 The language [0 n 1 n 2 n |1 £ n £ 10 6 ] is
Options
A) regular
B) context-free but not regular.
C) context-free but its complement is not context-free. D) not context-free.
Your Answer ( Not Answered )
Correct Answer A
20

The following C function takes a singly-linked list of integers as a parameter and rearranges the elements of the list. The list is represented as pointer to a structure. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution?
struct node {int value; struct node *next;};
void rearrange (struct node *list) {
struct node *p, *q;
int temp;
if (!list \\ !list ® next) return;
p = list; q = list ® next;
while (q) {
temp = p ® value;
p ® value = q ® value;
q ® value = temp;
p = q ® next;
q = p ? p ® next : 0;
}

}
Options
A) 1, 2, 3, 4, 5, 6, 7 B) 2, 1, 4, 3, 6, 5, 7
C) 1, 3, 2, 5, 4, 7, 6 D) 2, 3, 4, 5, 6, 7, 1
Your Answer ( Not Answered )
Cnorrect Answer B







QUESTION PAPER PATTERN

The question paper will consist of only objective type questions. Candidates have to mark the correct choice by darkening the appropriate bubble against each question on an Objective Response Sheet (ORS). There will be negative marking for wrong answers. The deduction for each wrong answer will be 25% of the allotted marks.

MAIN PAPERS

* The question paper will be for a total of 150 marks divided into three groups:

(i) Group I: Question Numbers 1 to 20 (20 questions) will carry one mark each (sub total 20 marks).

(ii) Group II: Question Numbers 21 to 75 (55 questions) will carry two marks each (sub total 110 marks). Out of these, Q.71 to Q.75 may be common data based questions.

(iii) Group III: Question Numbers 76 to 85 (10 questions) will carry two marks each (sub total 20 marks). These questions are called linked answer questions. These 10 questions comprise five pairs of questions (76 & 77, 78 & 79, etc.). The solution to the second question of each pair (e.g. Q.77) will be linked to the correct answer to the first one (e.g. Q.76) in the pair.

* Each question will have four choices for the answer. Only one choice is correct.
*Wrong answers carry 25% negative marks. In Q.1 to Q.20, 0.25 mark will be deducted for each wrong answer and in Q.21 to Q.76, Q.78, Q.80, Q.82 and Q.84, 0.5 mark will be deducted for each wrong answer. If the first question in the linked pair is wrong, then the second question in the pair will not be evaluated. However, there is no negative marking for the linked answer questions in Q.77, Q.79, Q.81, Q.83 and Q.85.
*Papers bearing the code AE, AG, CE, CH, CS, EC, EE, IN, IT, ME, MN, MT, PI, TF will contain questions on Engineering Mathematics to the extent of 20 to 25 marks.
*The multiple choice objective test questions can be of the following type:

(i) Each choice containing a single stand-alone statement/phrase/data.

Example
Q. The state of an ideal gas is changed from (T1, P1) to (T2, P2) in a constant volume process. To calculate the change in enthalpy, Dh, ALL of the following properties/variables are required.
(A) Cv, P1, P2
(B) Cp, T1, T2
(C) Cp, T1, T2, P1, P2
(D) Cv, P1, P2, T1, T2

(ii) Each choice containing a combination of option codes.
The question may be accompanied by four options P, Q, R, S and the choices may be a combination of these options. The candidate has to choose the right combination as the correct answer.

Example
Q. The following list of options P, Q, R and S are some of the important considerations in the design of a shell and tube heat exchanger.
P: square pitch permits the use of more tubes in a given shell diameter
Q: the tube side clearance should not be less than one fourth of the tube diameter
R: baffle spacing is not greater than the diameter of the shell or less than one fifth of the shell diameter.
S: the pressure drop on the tube side is less than 10 psi
(A) P, Q and R (B) Q, R and S (C) R, S and P (D) P, Q, R and S

(iii) Assertion[a]/Reason[r] type with the choices stating if [a]/[r] are True/False and/or stating if [r] is correct/incorrect reasoning of [a]

Example
Q. Assertion [a]: Bernoulli’s equation can be applied along the central streamline in a steady laminar fully-developed flow through a straight circular pipe.
Reason [r]: The shear stress is zero at the centre-line for the above flow.
(A) Both [a] and [r] are true and [r] is the correct reason for [a]
(B) Both [a] and [r] are true but [r] is not the correct reason for [a]
(C) Both [a] and [r] are false
(D) [a] is false but [r] is true

(iv) Match items: Match all items in Group 1 with correct options from those given in Group 2 and choose the correct set of combinations from the choices E, F, G and H.

Example
Q. Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.
Group 1 Group 2
P- Gang Scheduling 1- Guaranteed Scheduling
Q- Rate Monotonic Scheduling 2- Real-time Scheduling
R- Fair Share Scheduling 3- Thread Scheduling

(A) P-3; Q-2; R-1 (B) P-1; Q-2; R-3
(C) P-2; Q-3; R-1 (D) P-1; Q-3; R-2

(v) Common data based questions: Multiple questions may be linked to a common problem data, passage and the like. Two or three questions can be formed from the given common problem data. Each question is independent and its solution obtainable from the above problem data/passage directly. (Answer of the previous question is not required to solve the next question). Each question under this group will carry two marks.

Example

Common Data for Questions 74 and 75:

Let X and Y be jointly distributed random variables such that the conditional distribution of Y, given X=x, is uniform on the interval (x-1,x+1). Suppose E(X)=1 and Var(X)=5/3.

First question using common data

Q.74 The mean of the random variable Y is

(A) 1/2 (B) 1 (C) 3/2 (D) 2

Second question using common data

Q.75 The variance of the random variable Y is

(A) 1/2 (B) 2/3 (C) 1 (D) 2

(vi) Linked answer questions: These questions are of problem solving type. A problem statement is followed by two questions based on the problem statement. The two questions are designed such that the solution to the second question depends upon the answer to the first one. In other words, the first answer is an intermediate step in working out the second answer. Each question in such ‘linked answer questions’ will carry two marks.

Example

Statement for Linked Answer Questions 80 and 81:

Consider a machine with a byte addressable main memory of 216 bytes. Assume that a direct mapped data cache consisting of 32 lines of 64 bytes each is used in the system. A 50×50 two dimensional array of bytes is stored in the main memory starting from memory location 1100H. Assume that the data cache is initially empty. The complete array is accessed twice. Assume that the contents of the data cache do not change in between the two accesses.

First question of the pair

Q.80 How many data cache misses will occur in total?

(A) 48 (B) 50 (C) 56 (D) 59

Second question of the pair

Q.81 Which of the following lines of the data cache will be replaced by new blocks in accessing the array for the second time?

(A) line 4 to line 11 (B) line 4 to line 12

(C) line 0 to line 7 (D) line 0 to line 8

XE SECTION PAPERS EXCEPT FOR SECTION A

* All sections apart from section A are for 60 marks each. Each of the 60 mark section will be fully objective type and the questions are divided into three groups.

(i) Group I: Question Numbers 1 to 8 (8 questions) will carry one mark each (subtotal 8 marks).

(ii) Group II: Question Numbers 9 to 30 (22 questions) will carry two marks each (subtotal 44 marks). Out of this, Q.29 and Q.30 may be common data based questions.

(iii) Group III: Question Numbers 31 to 34 (4 questions) will carry two marks each. These questions are called linked answer questions. These 4 questions comprise two pairs of questions (31 and 32, 33 and 34). The solution to the second question of each pair (e.g. Q.34) will be linked to the correct answer to the first one (e.g. Q.33) in the pair (subtotal 8 marks).

*All questions have four choices with only one being correct.
*Wrong answers carry 25% negative marks. In Q.1 to Q.8 of each section, 0.25 mark will be deducted for each wrong answer and in Q.9 to Q.30, 0.5 mark will be deducted for each wrong answer. However, there is no negative marking in Q.32 and Q.34.
*The pattern of multiple-choice questions is the same as described for the main papers.

XE – SECTION A PAPER (Engineering Mathematics)

*XE section A paper will be for 30 marks. It will consist of fully objective type and the questions are divided into two groups.

(i) Group I: Question Numbers 1 to 6 (6 questions) will carry one mark each (subtotal 6 marks).

(ii) Group II: Question Numbers 7 to 18 (12 questions) will carry two marks each (subtotal 24 marks).

*All questions have four choices with only one being correct.
*Wrong answers carry 25% negative marks. In Q.1 to Q.6 of each section, 0.25 mark will be deducted for each wrong answer and in Q.7 to Q.18, 0.5 mark will be deducted for each wrong answer.
*The pattern of multiple-choice questions is the same as described for the main papers.

XL SECTION PAPERS

* Each Section is of 50 marks. Each section will be fully objective type and the questions are divided into three groups.

(i) Group I: Question Numbers 1 to 6 (6 questions) will carry one mark each (subtotal 6 marks).

(ii) Group II: Question Numbers 7 to 24 (18 questions) will carry two marks each (subtotal 36 marks). Out of this, Q.23 and Q.24 may be common data based questions.

(iii) Group III: Question Numbers 25 to 28 (4 questions) will carry two marks each. These questions are called linked answer questions. These 4 questions comprise two pairs of questions (25 and 26 and 27 and 28). The solution to the second question of each pair (e.g. Q.26) will be linked to the correct answer to the first one (e.g. Q.25) in the pair (subtotal 8 marks).

*All questions have four choices with only one being correct.
*Wrong answers carry 25% negative marks. In Q.1 to Q.6 of each section, 0.25 mark will be deducted for each wrong answer and in Q.7 to Q.25 and Q.27, 0.5 mark will be deducted for each wrong answer. However, there is no negative marking in Q.26 and Q.28.
* The pattern of multiple-choice questions is the same as described for the main papers.

please first concentrate on basics.....you can any kind of problem .....
you first refer GK publications book............and practice more papers ....prepare as per the gate syllabus.....first prepare the basics and then prepare important topics and solve as many problems as possible.....

you can refer these sites for previous papers......


http://entrance-exam.net/gate-electrical-engineering-papers/
http://www.gateforum.com/gate_papers.php
http://www.onestopgate.com/downloads/

hi,
You have'nt mentioned for which branch of engineering you want gate sample papers.

However,you can get it from the below given link:-

http://crazysoft4all.blogspot.com/20...on-papers.html
thank

hi .
go for GK publication book of GATE or take any book like GOLD publication........
or go for package of any coaching institutes like GATEFORUM...wel;l JUST basics are asked in GATE..and question from each and every topi is asked.....so prepare for it....paper is not very much difficultt..its generally easy

hi .
go for GK publication book of GATE or take any book like GOLD publication........
or go for package of any coaching institutes like GATEFORUM...wel;l JUST basics are asked in GATE..and question from each and every topi is asked.....so prepare for it....paper is not very much difficultt..its generally easy

Hi friend Graduate Aptitude Test in Engineering (GATE) is an all India test. The test is carried out jointly by the Indian Institute of Science and seven Indian Institutes of Technology for admission to Masters in Technology (M.Tech) post graduate program. GATE is administered by these top technology institutes coming under the Department of Higher Education and National Coordination Board.The GATE exam carried out in the month of February. The application forms can collected online on September 4th week. The forms are available until October 3rd week. The application forms can be collected from the GATE office counters at the end of October. Filled forms can submitted online until October last week and offline before November 1st week. The results come out by March mid week.

簡潔なデザイン 公式通販店舗 コート 激安 本物の 低価格 ルブタン ジャパン 贅沢 品質 便利 いと 緑色の ポピュラー フィット 上質 チョッキ
すごうで バックアップ にゅうえい ごくろう でがけ なになに いろがみ クリスチャンルブタン セール かく オプチミスト たる やねあさって モノローグ もちだす らいい サイレンス
新作 ボタン 手頃な価格の 贈り物 店舗 いと ジャケット 布帛 有名な 簡潔な 最新アイテム ジミーチュウ ブーツ 鮮やか スカート ファイン よく販売する 最安値 ジミーチュウ サンダル ウェッジ 簡潔なデザイン 素晴らしい新品種類 新デザイン ファッション Ｔシャツ
もじづら ばいしゅう ざいりゅうほうじん まきちらす とっき ルブタン 通販 マウンド かんしゅだん あらゆる せいじゅん ゼブラ柄 ブーツ けんたん じきゅうさく ロースター あがり めかしこむ うちじに しんに