GATE Exam  Aptitude Questions  GATE Syllabus  GATE Result  Mock Test  GATE Preparation
Best Answer to Any Question
Toggle navigation
GATE FORUM
Email or Username
Password
Remember
Login
Register

I forgot my password
Ask a Question
Submit Question
Recent questions tagged datastructuresandalgorithms
Ask a question:
0
votes
1
answer
Linked List data structure vs array
Which of the following points is/are true about Linked List data structure when it is compared with array A Arrays have better cache locality that can make them better in terms of performance. B It is easy to insert and delete elements in Linked List C Random access is not allowed in a typical implementation of Linked Lists D The size of array has to be predecided, linked lists can change their size any time. E All of the above
asked
in
linked lists
by
gate
linkedlist
datastructure
array
datastructuresandalgorithms
0
votes
0
answers
Big O Notation
The concept of order (Big O) is important because— (a) it can be used to decide the best algorithm that solves a given problem (b) it determines the maximum size of a problem that can be solved in a given system, in a given amount of time (c) it is the lower bound of the growth rate of the algorithm (d) Both (a) and (b)
asked
in
data structures and algorithms
by
anonymous
algorithms
datastructuresandalgorithms
analysisofalgorithms
bigonotation
bigo
0
votes
0
answers
What is the best way for a beginner to learn programming?
asked
in
c programming
by
anonymous
programming
cprogramming
datastructures
datastructuresandalgorithms
algorithms
To see more, click for the
full list of questions
or
popular tags
.
The best answer to any question