Skip to content
DSA
Data Structures
Arrays
Matrix
Strings
Linked List
Singly Linked List
Doubly Linked List
Circular Linked List
Doubly Circular Linked List
Linked List Tutorial
Stack
Queue
Tree
Generic Tree
Binary Tree
Binary Search Tree
AVL Tree
B Tree
B+ Tree
Red Black Tree
Tree Data Structure Tutorial
Heap
Hashing
Graph
Set Data Structure
Map Data Structure
Advanced Data Structure
Data Structures Tutorial
Algorithms
Analysis of Algorithms
Design and Analysis of Algorithms
Asymptotic Analysis
Asymptotic Notations
Worst, Average and Best Cases
Searching Algorithms
Linear Search
Binary Search
Searching Algorithms Tutorial
Sorting Algorithms
Selection Sort
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Counting Sort
Radix Sort
Bucket Sort
Sorting Algorithms Tutorial
Greedy Algorithms
Dynamic Programming
Graph Algorithms
Pattern Searching
Recursion
Backtracking
Divide and Conquer
Mathematical Algorithms
Geometric Algorithms
Bitwise Algorithms
Randomized Algorithms
Branch and Bound
Algorithms Tutorial
DSA Tutorial
Competitive Programming
Company Wise SDE Sheets
Facebook SDE Sheet
Amazon SDE Sheet
Apple SDE Sheet
Netflix SDE Sheet
Google SDE Sheet
Wipro Coding Sheet
Infosys Coding Sheet
TCS Coding Sheet
Cognizant Coding Sheet
HCL Coding Sheet
DSA Cheat Sheets
SDE Sheets
FAANG Coding Sheet
Love Babbaar Sheet
Mass Recruiter Sheet
Product-Based Coding Sheet
Company-Wise Preparation Sheet
Top Interview Questions
Top 100 DSA Interview Questions Topic-wise
Top 50 Array Problems
Top 50 String Problems
Top 50 Problems on Stack
Top 50 Problems on Heap
Top 20 Linked List Interview Question
Top 50 Tree Problems
Top 50 Graph Problems
Top 50 Problems on Recursion
Top 20 Greedy Algorithms Interview Questions
Top 50 Dynamic Programming (DP) Problems
Top 20 Hashing Technique based Interview Questions
Top 20 Dynamic Programming Interview Questions
Top 10 algorithms in Interview Questions
Commonly Asked Data Structure Interview Questions
Puzzles
All Puzzles
Top 100 Puzzles Asked In Interviews
Top 20 Puzzles Commonly Asked During SDE Interviews
Top MCQs on Puzzles with Answers
Crossword Puzzle Of The Week
Tutorials
Programming Languages
C
C++
Python
R
Golang
C#
Swift
Kotlin
Scala
Perl
Java
Java Tutorial
Java Collection
Java 8 Tutorial
Java Advance
Spring Tutorial
Spring Boot Tutorial
Spring MVC Tutorial
Hibernate Tutorial
Java Interview Questions
Java Interview Questions
Multithreading Interview Questions
Collection Interview Quesions
Java Programs
Java Projects
CS Subjects
Mathematics
Operating System
DBMS
Computer Networks
Computer Organization and Architecture
Theory of Computation
Compiler Design
Digital Logic
Software Engineering
System Design
System Design Tutorial
What is System Design
Key Terminologies in System Design
Analysis and Architecture of Systems
Scalability in System Design
Databases in System Design
High Level Design or HLD
Low Level Design or LLD
Communication Protocols
Web Servers and Proxies
Case Studies in Designing Systems
Complete System Design Tutorial
System Design Patterns
Factory Pattern
Observer Pattern
Singleton Design Pattern
Decorator Pattern
Strategy Pattern
Adapter Pattern
Command Pattern
Iterator Pattern
Prototype Design Pattern
All Design Patterns
System Design Roadmap
Top 10 System Design Interview Questions and Answers
DevOps
Git
AWS
Docker
Kubernetes
Microsoft Azure Tutorial
Google Cloud Platform
SQL Tutorial
Interview Questions
C Interview Questions
C++ Interview Questions
STL Interview Questions
Java Interview Questions
Python Interview Questions
R Interview Questions
SQL Interview Questions
Linux Interview Questions
C# Interview Questions
Android Interview Questions
Flutter Interview Questions
Operating System Interview Questions
Computer Network Interview Questions
Software Engineering Interview Questions
CCNA Interview Questions
Ethical Hacking Interview Questions
Interview Corner
Company Preparation
Top Topics
Practice Company Questions
Interview Experiences
Experienced Interviews
Internship Interviews
Competitive Programming
Multiple Choice Quizzes
Aptitude for Placements
Projects
C++ Projects
Java Projects
Python Projects
Machine Learning Projects
Android Projects
Cheat Sheets
C CheatSheet
C++ CheatSheet
C++ STL CheatSheet
Python CheatSheet
Docker CheatSheet
Kubernetes CheatSheet
Computer Network CheatSheet
CCNA CheatSheet
Ethical Hacking CheatSheet
Quizzes
C Quiz
C++ Quiz
Java Quiz
Python Quiz
DBMS Quiz
Operating System Quiz
Computer Network Quiz
COA Quiz
ML & Data Science
Python Tutorial
R Tutorial
Machine Learning
Machine Learning Maths
Machine Learning Tutorial
Machine Learning Projects
Data Science using Python
Data Science using R
Data Science Packages
Pandas Tutorial
NumPy Tutorial
Data Visualization
Data Visualization with Python
Python Data Visualization Tutorial
Matplotlib Tutorial
Bokeh Tutorial
Plotly Tutorial
Seaborn Tutorial
Data Visualization with R
Data Visualization with R
Plotly Tutorial
ggplot Tutorial
Data Visualization Tools
Tableau
Power BI
Data Analysis
Data Analysis with Python
Data Analysis with R
Deep Learning
Deep Learning Tutorial
Deep Learning Projects
NLP Tutorial
OpenCV Tutorial
Interview Questions
Machine Learning Interview Question
Deep Learning Interview Question
Python Interview Questions
Top 50 R Interview Questions
ML Frameworks
Tensorflow
PyTorch
PyTorch Lightning
Web Development
HTML
CSS
JavaScript
PHP
Bootstrap Tutorial
CSS Frameworks
Tailwind CSS
Foundation CSS
Materialize CSS
Bulma
Pure CSS
Primer CSS
Blaze UI
Semantic UI
JavaScript Frameworks
AngularJS
Angular PrimeNG
Angular ngx Bootstrap
NodeJS
Express.js
JavaScript Libraries
jQuery
jQuery Mobile
jQuery UI
jQuery EasyUI
jQWidgets
ReactJS
React Bootstrap
React Rebass
React Desktop
React Suite
ReactJS Evergreen
ReactJS Reactstrap
Ant Design
BlueprintJS
p5.js
Lodash
TensorFlow.js
Moment.js
Collect.js
Django Tutorial
WordPress
JSON
Web Dev Cheat Sheets
HTML Cheat Sheet
CSS Cheat Sheet
Bootstrap Cheat Sheet
JS Cheat Sheet
jQuery Cheat Sheet
Angular Cheat Sheet
Practice
All DSA Problems
Problem of the Day
GFG SDE Sheet
Curated DSA Lists
Beginner's DSA Sheet
Love Babbar Sheet
Top 50 Array Problems
Top 50 String Problems
Top 50 DP Problems
Top 50 Graph Problems
Top 50 Tree Problems
Home
Saved Videos
Courses
Data Structures and Algorithms
DSA Tutorial
Data Structures Tutorial
Algorithms Tutorial
Top 100 DSA Interview Questions
DSA-Roadmap[Basic-to-Advanced]
ML & Data Science
Learn Python
Data Science Tutorial
Machine Learning Tutorial
Deep Learning Tutorial
NLP Tutorial
Computer Vision Tutorial
Web Development
HTML Tutorial
CSS Tutorial
JavaScript Tutorial
ReactJS Tutorial
NodeJS Tutorial
Languages
C
C++
Java
R Tutorial
Golang
Interview Corner
Company Interview Corner
Experienced Interviews
Internship Experiences
Practice Company Questions
Competitive Programming
CS Subjects
Operating Systems
DBMS
Computer Networks
Software Engineering
Software Testing
Jobs
Get Hired: Apply for Jobs
Job-a-thon: Hiring Challenge
Corporate Hiring Solutions
Practice
All DSA Problems
Problem of the Day
GFG SDE Sheet
Beginner's DSA Sheet
Love Babbar Sheet
Top 50 Array Problems
Top 50 String Problems
Top 50 DP Problems
Top 50 Graph Problems
Top 50 Tree Problems
Contests
World Cup Hack-A-Thon
GFG Weekly Coding Contest
Job-A-Thon: Hiring Challenge
BiWizard School Contest
All Contests and Events
GBlog
Puzzles
What's New ?
Change Language
Trending Now
Data Structures
Algorithms
Foundational Courses
Data Science
Practice Problem
Python
Machine Learning
JavaScript
Java
C
C++
ReactJS
NodeJS
Web Development
Web Design
Web Browser
CP Live
Aptitude
Puzzles
Projects
DSA
System Design
Software Development
Product Management
SAP
SEO
▲
Similar Topics
Web Technologies
33.7k+ articles
DSA
21k+ articles
Python
19.1k+ articles
Experiences
12k+ articles
Interview Experiences
11.1k+ articles
Java
9.8k+ articles
JavaScript
9k+ articles
School Learning
7.7k+ articles
GATE
3.2k+ articles
Gate IT 2008
70+ articles
GATE-Gate IT 2008
70+ posts
Popular articles
Recent articles
GATE | Gate IT 2008 | Question 81
Last Updated: 26 October 2021
Host X has IP address 192.168.1.97 and is connected through two routers R1 and R2 to anÂother host Y with IP address 192.168.1.80. Router R1 has IP addresses 192.168.1.135
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 69
Last Updated: 16 November 2020
A Binary Search Tree (BST) stores values in the range 37 to 573. Consider the following sequence of keys. I. 81, 537, 102, 439, 285, 376, 305II. 52, 97, 121, 195, 242, 38
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 67
Last Updated: 28 June 2021
The three way handshake for TCP connection establishment is shown below. Which of the following statements are TRUE?(S1) Loss of SYN + ACK from the server will not establ
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
Similar Topics
Web Technologies
33.7k+ articles
DSA
21k+ articles
Python
19.1k+ articles
Experiences
12k+ articles
Interview Experiences
11.1k+ articles
Java
9.8k+ articles
JavaScript
9k+ articles
School Learning
7.7k+ articles
GATE
3.2k+ articles
Gate IT 2008
70+ articles
GATE | Gate IT 2008 | Question 66
Last Updated: 28 June 2021
Which of the following statements are TRUE?(S1) TCP handles both congestion and flow control(S2) UDP handles congestion but not flow control(S3) Fast retransmit deals w
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 65
Last Updated: 09 March 2018
Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true?(S1) Count to infinity is a problem only with DV and n
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 60
Last Updated: 28 June 2021
Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional depenÂdencies are known to hold: AB → CD, DE → P, C → E, P → C and B → G. The relation
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 59
Last Updated: 28 June 2021
Let R (A, B, C, D) be a relational schema with the following functional dependencies:A → B, B → C,C → D and D → B. The decomposition of R into (A, B), (B, C), (B, D)(A) gi
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 44
Last Updated: 28 June 2021
The following three are known to be the preorder, inorder and postorder sequences of a binary tree. But it is not known which is which.MBCAFHPYKKAMCBYPFHMABCKYFPHPick the
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 43
Last Updated: 28 June 2021
For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim\'s algorithm to construct a Minimum SpanÂn
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 42
Last Updated: 22 April 2020
When n = 22k for some k ≥ 0, the recurrence relationT(n) = √(2) T(n/2) + √n, T(1) = 1evaluates to :(A)√(n) (log n + 1)(B)√(n) (log n )(C)√(n) log √(n)(D)n log √(n) Answer:
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 40
Last Updated: 29 March 2018
The two numbers given below are multiplied using the Booth's algorithm.Multiplicand : 0101 1010 1110 1110Multiplier: 0111 0111 1011 1101How many additions/Subtractions are
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 26
Last Updated: 28 June 2021
G is a simple undirected graph. Some vertices of G are of odd degree. Add a node v to G and make it adjacent to each odd degree vertex of G. The resultant graph is sure to
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 15
Last Updated: 28 June 2021
A paging scheme uses a Translation Look-aside Buffer (TLB). A TLB-access takes 10 ns and a main memory access takes 50 ns. What is the effective access time(in ns) if the
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 12
Last Updated: 28 June 2021
Which of the following is TRUE?(A)The cost of searching an AVL tree is θ (log n) but that of a binary search tree is O(n)(B)The cost of searching an AVL tree is θ (log n)
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
GATE | Gate IT 2008 | Question 11
Last Updated: 28 June 2021
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE?(A) If X can be solved in polynomial time, then so can Y(B) X
...read more
GATE-Gate IT 2008
Gate IT 2008
GATE
1
2
3
4
5
6
>>
Last
1
2
3
4
5
6
>>
Last
1
2
3
4
>>
Last
Courses
13k+ interested Geeks
GATE Data Science and Artificial Intelligence 2024
Explore
90k+ interested Geeks
GATE CS & IT
Explore
17k+ interested Geeks
Complete Test Series for Service-Based Companies
Explore
Recently Published
Top 10 Android Project Ideas With Source Code
Read
A Day in a Life of a Software Engineer
Read
New Games inspired by Google generative AI
Read
Top 10 VS Code Extensions For Data Science
Read
10 Best Software Testing Tools For QA
Read
Python For DevOps:  A Complete Guide For Beginners
Read
Python vs Java Full Stack Developer
Read
Google Bard AI can now watch YouTube videos and answer your questions
Read
100 Days of GATE Data Science & AI – A Complete Guide For Beginners
Read
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 !