Tutorials
Go Premium
Data Structure
Java
Python
HTML
Interview Preparation
DSA
Practice Problems
C
C++
Java
Python
JavaScript
Data Science
Machine Learning
Courses
Linux
DevOps
SQL
Web Development
System Design
Aptitude
GfG Premium
Similar Topics
Web Technologies
32.1K+ articles
DSA
20.0K+ articles
GATE-CS-2006
9+ articles
GATE-CS-2008
9+ articles
GATE-CS-2007
8+ articles
GATE-CS-2005
8+ articles
GATE-CS-2010
7+ articles
GATE-CS-2014
5+ articles
GATE-CS-2004
5+ articles
GATE-CS-2003
5+ articles
GATE-CS-DS-&-Algo
39 posts
Recent Articles
Popular Articles
DSA Guide for GATE CS Exam | Notes, Syllabus, Preparation Strategy
Last Updated: 23 July 2025
The GATE (Graduate Aptitude Test in Engineering) Exam is a critical milestone for computer science enthusiasts seeking advanced education or career opportunities. A solid ...
read more
Picked
DSA
GATE-CS-DS-&-Algo
DSA-GATE
Data Structures and Algorithms | Set 38
Last Updated: 11 July 2025
This topic contains basic questions of Algorithm which can be helpful for GATE CS Preparation. So, it is recommended to solve each of these questions if you are preparing ...
read more
DSA
GATE-CS-DS-&-Algo
MCQ
Data Structures and Algorithms | Set 37
Last Updated: 21 January 2021
Que - 1. For 8 keys and 6 slots in a hashing table with uniform hashing and chaining, what is the expected number of items that hash to a particular location.(A) 2.33(B) 0...
read more
DSA
GATE-CS-DS-&-Algo
Data Structures and Algorithms | Set 36
Last Updated: 06 February 2018
Que - 1. The function shiftNode() which takes as input two linked lists- destination and source. It deletes front node from source and places it onto the front of destinat...
read more
DSA
GATE-CS-DS-&-Algo
Data Structures and Algorithms | Set 35
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2014 exam.1) The number of distinct minimum spanning trees for the weighted graph below is ____Answer: 6Highlighted (in gree...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2014
Data Structures and Algorithms | Set 34
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2014 exam.1) Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an a...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2014
Data Structures and Algorithms | Set 33
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2014 exam.1) Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. T...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2014
Data Structures and Algorithms | Set 32
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2014 exam.1) Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth Fir...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2014
Data Structures and Algorithms | Set 31
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2013 exam.1) What is the return value of f(p, p) if the value of p is initialized to 5 before the call? Note that the first ...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2013
Data Structures and Algorithms | Set 30
Last Updated: 23 July 2025
Following questions have been asked in GATE CS 2013 exam.1) Which of the following statements is/are TRUE for an undirected graph?P: Number of odd degree vertices is evenQ...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2013
Data Structures and Algorithms | Set 29
Last Updated: 23 July 2025
Following questions have been asked in GATE 2012 exam.1) The recurrence relation capturing the optimal time of the Tower of Hanoi problem with n discs is(A) T(n) = 2T(n - ...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2012
Data Structures and Algorithms | Set 28
Last Updated: 23 July 2025
Following questions have been asked in GATE 2012 exam.1) Let w(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2012
Data Structures and Algorithms | Set 27
Last Updated: 13 December 2022
Following questions have been asked in GATE CS 2011 exam.1) An undirected graph G(V, E) contains n ( n 2 ) nodes named v1 , v2 ,....vn. Two nodes vi , vj are connected if...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2011
Data Structures and Algorithms | Set 26
Last Updated: 23 July 2025
Following questions have been asked in GATE 2011 exam.1) A max-heap is a heap where the value of each parent is greater than or equal to the values of its children. Which ...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2011
Data Structures and Algorithms | Set 25
Last Updated: 23 July 2025
Following questions have been asked in GATE 2010 exam.1 Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij in the matrix W below is the weight...
read more
DSA
GATE-CS-DS-&-Algo
GATE-CS-2010
1
2
3
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our
Cookie Policy
&
Privacy Policy
Got It !