GATE Overflow for GATE CSE
Login Register
@
  • Dark Mode
  • Profile
  • Edit my Profile
  • Messages
  • My favorites
  • Register
  • Activity
  • Q&A
  • Questions
  • Unanswered
  • Tags
  • Subjects
  • Users
  • Ask
  • Previous Years
  • Blogs
  • New Blog
  • Exams
Dark Mode
Filter
  • User Shiva Sagar Rao
  • Wall
  • Recent activity
  • All questions
  • All answers
  • Exams Taken
  • All Blogs

Answers by Shiva Sagar Rao

1 vote
1
GATE2016 EC-3: GA-4
The number that least fits this set: $(324$, $441$, $97$ and $64)$ is ________. $324$ $441$ $97$ $64$
answered in Analytical Aptitude Apr 22, 2021
1.8k views
  • gate2016-ec-3
  • odd-one
  • analytical-aptitude
1 vote
2
TIFR CSE 2018 | Part A | Question: 3
Which of the following statements is TRUE for all sufficiently large integers n ? $2^{2^{\sqrt{\log \log n}}} <2^{\sqrt{\log n}} < n$ $2^{\sqrt{\log n}}<n<2^{2^{\sqrt{\log \log n}}}$ $n<2^{\sqrt{\log n}}<2^{2^{\sqrt{\log \log n}}}$ $n<2^{2^{\sqrt{\log \log n}}} <2^{\sqrt{\log n}}$ $2^{\sqrt{\log n}}<2^{2^{\sqrt{\log \log n}}} < n$
answered in Algorithms Nov 18, 2020
2.4k views
  • tifr2018
  • algorithms
  • asymptotic-notations
13 votes
3
TIFR CSE 2010 | Part B | Question: 27
Consider the Insertion Sort procedure given below, which sorts an array $L$ of size $n\left ( \geq 2 \right )$ in ascending order: begin for xindex:= 2 to n do x := L [xindex]; j:= xindex - 1; while j > 0 and L[j] > x do L[j + ... $n (n - 1) / 2$ comparisons whenever all the elements of $L$ are not distinct.
answered in Algorithms Aug 17, 2019
2.7k views
  • tifr2010
  • algorithms
  • sorting
3 votes
4
NIELIT 2018-84
For the given nodes: $89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100$ minimum ______ number of interchanges are required to convert it into a max-heap. $3$ $4$ $5$ $6$
answered in DS Aug 13, 2019
1.0k views
  • nielit-2018
  • data-structures
  • heap

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

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

  • Recruitment of Scientific Officers in the Department of Atomic Energy 2023
  • GATE CSE 2023 Paper & Analysis - Memory Based
  • From GATE to Australia
  • DRDO Previous Year Papers
  • From Rank 4200 to 64: My Journey to Success in GATE CSE Exam

Subjects

  • All categories
  • General Aptitude (2.5k)
  • Engineering Mathematics (9.3k)
  • Digital Logic (3.3k)
  • Programming and DS (5.9k)
  • Algorithms (4.6k)
  • Theory of Computation (6.7k)
  • Compiler Design (2.3k)
  • Operating System (5.0k)
  • Databases (4.6k)
  • CO and Architecture (3.8k)
  • Computer Networks (4.6k)
  • Non GATE (1.3k)
  • Others (2.4k)
  • Admissions (649)
  • Exam Queries (843)
  • Tier 1 Placement Questions (17)
  • Job Queries (75)
  • Projects (9)
  • Unknown Category (853)

Recent Blog Comments

  • Recommend test series??
  • pressman pdf/ geeksforgeeks
  • where to study software engineering for BARC
  • +1
  • 1200/1000 = 1.2
  • Send feedback
  • Rank Predictor
  • College Prediction
  • Useful Links
  • FAQ
  • Corrections
  • Discuss
  • Copyright
  • Request
  • Testimonials
  • Chat Logs
  • Chat
  • Badges
  • Search tips
  • Exam Category
  • Blog Category
  • Blog Tags
  • Privacy
  • Test Series
  • Contact Us
Developed by Chun