The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
GATE19943.4
0
votes
391
views
Match the following items
(i) NewtonRaphson
(a) Integration
(ii) RungeKutta
(b) Root finding
(iii) GaussSeidel
(c) Ordinary Differential Equations
(iv) Simpson's Rule
(d) Solution of Systems of Linear Equations
gate1994
numericalmethods
easy
asked
Oct 4, 2014
in
Numerical Methods
by
Kathleen
Veteran
(
59.6k
points)

391
views
Facebook
Google+
Twitter
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
+1
vote
Best answer
ib,iic,iiid,iva
answered
Oct 10, 2014
by
Bhagirathi
Boss
(
14.4k
points)
selected
May 3, 2015
by
Rajarshi Sarkar
comment
Please
log in
or
register
to add a comment.
0
votes
Answer:
(i)  (b)
(ii)  (c)
(iii)  (d)
(iv)  (a)
answered
Apr 28, 2015
by
Rajarshi Sarkar
Boss
(
34.1k
points)
comment
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
0
votes
0
answers
1
GATE19941.3
Backward Euler method for solving the differential equation $\frac{dy}{dx}=f(x, y)$ is specified by, (choose one of the following). $y_{n+1}=y_n+hf(x_n, y_n)$ $y_{n+1}=y_n+hf(x_{n+1}, y_{n+1})$ $y_{n+1}=y_{n1}+2hf(x_n, y_n)$ $y_{n+1}= (1+h)f(x_{n+1}, y_{n+1})$
asked
Oct 4, 2014
in
Numerical Methods
by
Kathleen
Veteran
(
59.6k
points)

226
views
gate1994
numericalmethods
backwardeulermethod
outofsyllabusnow
+10
votes
3
answers
2
GATE19943.12
Find the inverse of the matrix $\begin{bmatrix} 1 & 0 & 1 \\ 1 & 1 & 1 \\ 0 & 1 & 0 \end{bmatrix}$
asked
Oct 6, 2014
in
Linear Algebra
by
Kathleen
Veteran
(
59.6k
points)

716
views
gate1994
linearalgebra
matrices
easy
descriptive
+17
votes
2
answers
3
GATE19943.7
An instance of a relational scheme $R(A, B, C)$ has distinct values for attribute $A$. Can you conclude that $A$ is a candidate key for $R$?
asked
Oct 6, 2014
in
Databases
by
Kathleen
Veteran
(
59.6k
points)

929
views
gate1994
databases
easy
candidatekeys
+17
votes
4
answers
4
GATE19943.6
State True or False with reason There is always a decomposition into BoyceCodd normal form (BCNF) that is lossless and dependency preserving.
asked
Oct 6, 2014
in
Databases
by
Kathleen
Veteran
(
59.6k
points)

887
views
gate1994
databases
databasenormalization
easy
+1
vote
1
answer
5
GATE19981.3
Which of the following statements applies to the bisection method used for finding roots of functions: converges within a few iterations guaranteed to work for all continuous functions is faster than the NewtonRaphson method requires that there be no error in determining the sign of the function
asked
Sep 26, 2014
in
Numerical Methods
by
Kathleen
Veteran
(
59.6k
points)

592
views
gate1998
numericalmethods
bisectionmethod
easy
+2
votes
1
answer
6
GATE20102
NewtonRaphson method is used to compute a root of the equation $x^2  13 = 0$ with 3.5 as the initial value. The approximation after one iteration is 3.575 3.676 3.667 3.607
asked
Sep 21, 2014
in
Numerical Methods
by
gatecse
Boss
(
18.3k
points)

562
views
gate2010
numericalmethods
newtonraphson
easy
nongate
+1
vote
1
answer
7
GATE20021.2
The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degree 0 but not 1 1 but not 0 0 or 1 2
asked
Sep 15, 2014
in
Numerical Methods
by
Kathleen
Veteran
(
59.6k
points)

376
views
gate2002
numericalmethods
trapezoidalrule
easy
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Basic LaTeX guide
IIT Madras Phd
Databases GO Classroom
Happy Birthday Sir Arjun
NIELIT EXAM DATE 2018
All categories
General Aptitude
1.4k
Engineering Mathematics
6.3k
Digital Logic
2.4k
Programming & DS
4.4k
Algorithms
3.8k
Theory of Computation
4.8k
Compiler Design
1.8k
Operating System
3.5k
Databases
3.5k
CO & Architecture
3k
Computer Networks
3.5k
Non GATE
1.2k
IS&Software Engineering
277
Web Technologies
60
Numerical Methods
53
Computer Graphics
87
Object Oriented Programming
69
Java
23
Cloud Computing
1
Distributed Computing
14
Machine Language
7
Knowledge Representation
18
Information Theory
0
Digital Image Processing
17
Digital Signal Processing
7
Computer Peripherals
10
Multimedia
2
Geometry
6
Integrated Circuits
8
Others
474
Others
1.3k
Admissions
508
Exam Queries
491
Tier 1 Placement Questions
23
Job Queries
64
Projects
17
Follow @csegate
Gatecse
Recent Blog Comments
Sir for final year student who have exam in...
I guess you meant while chasing :) Anyway those...
I'll write a post on how to best...
@Gaurav Go through all the previous yr questions,...
42,581
questions
48,569
answers
155,482
comments
63,603
users