Courses
Tutorials
Jobs
Practice
Contests
Data Structure
Java
Python
HTML
Interview Preparation
Trending Now
DSA
Web Tech
Foundational Courses
Data Science
Practice Problem
Python
Machine Learning
JavaScript
System Design
Django
DevOps Tutorial
Java
C
C++
ReactJS
NodeJS
CP Live
Aptitude
Puzzles
Projects
GBlog
Frontend Developer Roadmap 2024
Frontend development means to design the face of a website or application. It involves working on the appearance of the website. Building interactive buttons, using images...
Read More
Nishant | quiz 1.0 | Question 9
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are ...
Read More
Misc
Nishant | quiz 1.0 | Question 3
What is the worst case time complexity of insertion sort where position of the data to be inserted is calculated using binary search? (A)N(B)N*log(N...
Read More
Misc
Nishant | quiz 1.0 | Question 2
Suppose we have an O(n) time algorithm that finds the median of an unsorted array. Now consider a QuickSort implementation where we first find the median using...
Read More
Misc
Nishant | quiz 1.0 | Question 1
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is (A)Θ(n)(B)Θ(log...
Read More
Misc
ankit | quiz | Question 10
A program P reads in 500 integers in the range [0..100] representing the scores of 500 students. It then prints the frequency of each score above 50. What woul...
Read More
Misc
ankit | quiz | Question 3
In a binary tree, the number of internal nodes of degree 1 is 5, and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tre...
Read More
Misc
ankit | quiz | Question 9
Given an array arr = {12, 13, 35, 78, 56} and key = 78; How many iterations are done until the element is found using Binary search? (A)3(B)2(C)1(D)...
Read More
Misc
Nishant | quiz 2.0 | Question 10
A program P reads in 500 integers in the range [0..100] representing the scores of 500 students. It then prints the frequency of each score above 50. What woul...
Read More
Misc
Nishant | quiz 2.0 | Question 9
Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right sub stress, respectively, of node X. Note that Y...
Read More
Misc
Nishant | quiz 2.0 | Question 5
In a balanced binary search tree with n elements, what is the worst-case time complexity of reporting all elements in the range [a,b]? Assume that the number o...
Read More
Misc
ankit | quiz | Question 4
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be...
Read More
Misc
How to Optimize Your Website SEO Using JavaScript
Most of the websites nowadays are built on JavaScript and its frameworks and almost every browser has the JavaScript engine, this is a perfect correlation to know how impo...
Read More
GBlog
Web Technologies
Best No-Code Tools for Developers in 2024
No-code tools are defined as a software development platform that allows non-technical people or people who have fewer coding skills to develop their software applications...
Read More
GBlog
Picked
Tools
JEE Exam Experience
The year 2023 will forever be etched in my memory as the year I attempted the Joint Entrance Examination (JEE) amid the challenges. My journey was filled with ups and down...
Read More
Career-Advices
Experiences
Competitive Exam Experiences
IIT- JEE
Engineering Entrance Exam Experience
Engineering entrance exams are designed to assess the aptitude and potential of aspiring engineers. These exams are typically highly competitive, and success requires a co...
Read More
Career-Advices
Experiences
Competitive Exam Experiences
1
...
1765
1766
1767
...
11307