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
ankit | quiz | Question 10
Which one of the following is an application of Stack Data Structure? (A)Managing function calls(B)The stock span problem(C)Arithmetic expression ev...
Read More
ankit | quiz | Question 8
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
Nishant | quiz 2.0 | Question 7
In a binary tree with n nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in t...
Read More
Nishant | quiz 2.0 | Question 6
What is the time complexity of searching for an element in a circular linked list? (A)O(n)(B)O(nlogn)(C)O(1)(D)O(n2) Answer: (A) ...
Read More
Nishant | quiz 1.0 | Question 10
For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true? (A)v= e-1(B)e= v-...
Read More
Nishant | quiz 1.0 | Question 8
The maximum number of binary trees that can be formed with three unlabelled nodes is: (A)1(B)5(C)4(D)3 Answer: (B) Explanati...
Read More
Nishant | quiz 1.0 | Question 7
You are given the postorder traversal, P, of a binary search tree on the n elements 1, 2, ..., n. You have to determine the unique binary search tree that has ...
Read More
Nishant | quiz 1.0 | Question 6
What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree for a skewed tree ? (A)O(n) for all(...
Read More
Nishant | quiz 1.0 | Question 5
What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked l...
Read More
Nishant | quiz 1.0 | Question 4
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...
Read More
ankit | quiz | Question 8
The problem related to subset-sum is defined as follows. A set consisting of n positive integers, S = {a1 ,a2 ,a3 ,…,an} and a positive integer W is given. Is ...
Read More
ankit | quiz | Question 7
You are given a matrix of dimensions 'm x n' containing non-negative integers. Your goal is to find the number of unique paths from the top-left corner to the ...
Read More
ankit | quiz | Question 2
Level of a node is distance from root to that node. For example, level of root is 1 and levels of left and right children of root is 2. The maximum number of n...
Read More
ankit | quiz | Question 1
Which of the following is true about Binary Trees? (A)Every binary tree is either complete or full.(B)Every complete binary tree is also a full bina...
Read More
KL | University | Question 2
Given below is a statement about unordered_set. Choose the correct alternative for the statement.Keys in unordered_set does not maintain an order (A...
Read More
1
...
1764
1765
1766
...
11293