Kavita Bisht

Java

Map in Java

The java.util.Map interface represents a mapping between a key and a value. The Map interface is not a subtype of the Collection interface. Therefore it behaves a bit different from the rest of the collection types.

C++

User defined functions in C++

A function is a group of statements that together perform a task. Every C++ program has at least one function, which is main(), and all the most trivial programs can define additional functions. Users can create custom functions for code reusability and optimization

Software Engineering

Exceptions in Java

Java has a great and powerful mechanism to handle the exceptions so that normal flow of the application can be maintained. We explore the various types of exceptions, how it is handled by JVM and how it can be handled by users in a custom procedure.

C++

Multimap in C++ STL

Multi-map in C++ is an associative container like map. It internally store elements in key value pair. But unlike map which store only unique keys, multimap can have duplicate keys.

C++

Set in C++ STL

In C++ STL, a set is an Associative container which contains a sorted set of unique objects of type Key. The commonly used functions are begin(), cbegin(), end(), size(), max_size(), empty(), insert(), erase(), emplace() and emplace_hint()

C++

Unordered map in C++ STL

In C++ STL, Unordered map is a dictionary like data structure. The most commonly used methods of unordered_map are at(), begin(), end(), bucket(), bucket_count() / bucket_size(), count(), equal_range(), hash_function(), insert(), reserve() and load_factor()

Java

Using Threads in Java

Java is a multi-threaded programming language which means we can develop multi-threaded program using Java. A multi-threaded program contains two or more parts that can run concurrently and each part can handle a different task at the same time

Python

Lambda functions in Python

In Python, anonymous function is a function that is defined without a name. While normal functions are defined using the def keyword, in Python anonymous functions are defined using the lambda keyword. Hence, anonymous functions are also called lambda functions.

C++

Map in C++ STL

Map in C++ STL is a dictionary like data structure. It is a sequence of (key, value) pair, where only single value is associated with each unique key. It is often referred as associative array.

C++

Reader Writer Problem in C++ using semaphore and monitor

We will focus on solving the Reader Writer problem in C++ by using Semaphores as our first approach and Monitors as our second approach. It is a problem designed to illustrate synchronization within processes.

C++

Classes and Objects in C++

In C++, a class is a mechanism for creating user-defined data types. A class is used to specify the form of an object and it combines data representation. The variables inside class definition are called as data members and the functions are called member functions.

C++

Scopes in C++

Scope is defined as the extent to which something can be worked with (or a scope is a region of the program ). In C++, there are 9 types: Global scope, Local scope, Namespace scope, Class scope, Statement scope, Function scope, Function parameter scope, Enumeration scope and Template parameter scope

C++

Inheritance in C++

Inheritance in C++ allows us to define a class in terms of another class, which makes it easier to create and maintain an application. This provides an opportunity to reuse the code functionality. Single, multiple, hierarchical, multilevel, multipath and hybrid inheritance is supported in C++

C++

Operator Overloading in C++

Operator overloading is an important concept in C++. It is a type of polymorphism in which an operator is overloaded to give user defined meaning to it. Overloaded operator is used to perform operation on user-defined data type. We give examples of unary ++, bitwise + and arithmetic + operators

C Programming

Storage classes in C

A Storage Class defines the scope (visibility) and life-time of variables and/or functions within a C Program. They precede the type that they modify. Storage classes are used in C programming are Automatic variables (auto), External variables (extern) Static variables (static) and Register variable

Data Structures

Implementing Queue using Stack in two ways

Queue is an abstract data structure similar to Stacks. Queue is open at both its ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). For implementing queue using stack, one method is to make dequeue costly and other is to make enqueue costly

Data Structures

Skip List

A skip list is a data structure that is used for storing a sorted list of items with a help of hierarchy of linked lists that connect increasingly sparse subsequences of the items. A skip list allows the process of item look up in efficient manner. The time complexity of operations are O(log N)

Algorithms

Cycle Sort

Cycle sort is a comparison based sorting algorithm which forces array to be factored into the number of cycles where each of them can be rotated to produce a sorted array with O(N^2) time complexity It is an in-place and unstable sorting algorithm and is optimal in terms of number of memory writes

Sorting Algorithms

Radix Sort

Radix Sort is an efficient non-comparison based sorting algorithm which can sort a dataset in linear O(N) time complexity and hence, can be better than Quick Sort. It uses Counting Sort as a subroutine. It uses the fact that number of digits in an Integer is very less compared to the data