Interview Preparation Articles

Interview preparation requires proficient knowledge of C/C++. This article has just been recently written (July 2013) and will be elaborated soon; the articles in RED are waiting to be written. The hope is that this article will be "one-stop-shop" for most common C/C++ interview questions.

Frequently Asked Topics

• What is a volatile variable?
• What is a static keyword in C/C++?
• Linked List

C++ Object Oriented Topics

• What is "virtual", "polymorphism" and "abstract class"?

Operating Systems Topics

FreeRTOS Tutorial

FreeRTOS is a real-time OS that has many ports for various different controllers. This is a great system to learn about because it gives you the fundamental knowledge of an operating system while making it incredibly easy to learn the material. Here's a must-read tutorial :

• FreeRTOS Tutorial

Other OS Topics

• Synchronization Primitives - Mutexes, Spinlocks, Queues etc.
• Common Problems in Multitasking OS

Miscellaneous Topics

Bit Fiddling

• Bit Fiddling
• Bitmasking Tutorial
• Bit Structures and Unions

Others

• String Manipulation
• All about pointers

Sorting Topics

Sorting means arrangement of elements in a defined manner(Ascending/Descending order). This is widely used in the complex algorithms to decrease the time complexity. There are five types of sorting algorithms namely. 1. Bubble Sort 2. Insertion Sort 3. Merge Sort 4. Quick Sort 5. Heap Sort 6. Selection Sort

• Bubble Sort
• Merge Sort
• Heap Sort

Big O notation

Big O notation is a mathematical way of representing an approximate time required for an expression to complete by checking for its major dependencies. For a example, f(n) = n^5 + n.

As we go on increasing the value of n the dependency on the second half equation on right-hand side will reduce.

so, we can also say that f(n) = n^5 or complexity is O(n^5) for n equal to infinity.

Note: For comparison of big O complexity for different algorithms, refer following site: http://bigocheatsheet.com/