Skip to content
All Basic Articles
(34.4)8 × (23.4)8 evaluates to   A) (1053.6)8 B) (1053.2)8 C) (1024.2)8 D) None of these Answer: Explanation: We convert (34.4)8 to decimal. = 3… Read More
Given below is a program which when executed spawns two concurrent processes : semaphore X : = 0 ; /* Process now forks into concurrent… Read More
Given a number ‘n’ and a prime p, find if square root of n under modulo p exists or not. A number x is square… Read More
  Mobile internet usage is growing at a steady pace, so much so that it is expected to overtake desktop browsing as early as 2016.… Read More
What is the output of the following program? #include <stdio.h> int funcf (int x); int funcg (int y);    main() {     int x = 5,… Read More
Given an array arr[] of size n and integer k such that k <= n. Examples :  Input: arr[] = {3, 7, 90, 20, 10,… Read More
We are given two numbers x and y. We know that a number p divides their product. Can we say for sure that p also… Read More
A train leaves Mumbai at 7.15 Am and arrives in Delhi at 2.47 that afternoon. What total length of time does the trip take? (A) 7Hr 20… Read More
Neha is able to  type 10 pages in 5 minutes. Garima can type 5 pages in 10 minutes. How many pages can they type together in 30… Read More
It rained as much as on Wednesday as on all the other days of the week combined. If the average rainfall for the whole week… Read More
A class having 30 students in a class have an average of marks 28 . If every student is given 2 grace marks, the new average… Read More
Double ended queues are sequence containers with the feature of expansion and contraction on both the ends. They are similar to vectors, but are more… Read More
Queues are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back… Read More
Priority queues are a type of container adapters, specifically designed such that the first element of the queue is the greatest of all elements in… Read More
Stacks are a type of container adaptors with LIFO(Last In First Out) type of working, where a new element is added at one end and… Read More
Lists are sequence containers that allow non-contiguous memory allocation. As compared to vector, list has slow traversal, but once a position has been found, insertion… Read More
Multisets are a type of associative containers similar to set, with an exception that multiple elements can have same values.Some Basic Functions associated with multiset: begin()… Read More
Sorting is one of the most basic functions applied to data. It means arranging the data in a particular fashion, which can be increasing or… Read More
Binary search is a widely used searching algorithm that requires the array to be sorted before search is applied. The main idea behind this algorithm… Read More
The Standard Template Library (STL) is a set of C++ template classes to provide common programming data structures and functions such as lists, stacks, arrays,… Read More