Difference between revisions of "Interview Preparation Articles"
Proj user18 (talk | contribs) |
Proj user18 (talk | contribs) (→Source Code) |
||
| Line 51: | Line 51: | ||
=== Source Code === | === Source Code === | ||
| − | * [https://gitlab.com/Khanna_Bharat/Data_Structure/tree/master] | + | * [https://gitlab.com/Khanna_Bharat/Data_Structure/tree/master Gitlab Source Code Link] |
Revision as of 12:43, 25 November 2016
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.
Contents
Frequently Asked Topics
C++ Object Oriented Topics
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 :
Other OS Topics
Miscellaneous Topics
Bit Fiddling
Others
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 six types of sorting algorithms namely, Bubble Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort and Selection 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 the 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/
