Difference between revisions of "Interview Preparation Articles"
Proj user18 (talk | contribs) (→Frequently Asked Topics) |
Proj user12 (talk | contribs) |
||
| Line 45: | Line 45: | ||
* [[Null Pointer]] | * [[Null Pointer]] | ||
* [[Add without using any arithmetic operators]] | * [[Add without using any arithmetic operators]] | ||
| − | * [[Data Structure Alignment-Packing | + | * [[Data Structure Alignment-Packing of Structures]] |
<br/> | <br/> | ||
Revision as of 21:42, 18 December 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
- What is a volatile variable?
- What is a static keyword in C/C++?
- Linked List
- About extern keyword in C/C++
- Pointers in C
- Structures and Unions
- Inline Specifier
- Dynamic memory allocation in C
- Standard Predefined Macros
- Recursive Function
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
BSS and Data Segments
Others
- String Manipulation
- All about pointers
- Null Pointer
- Add without using any arithmetic operators
- Data Structure Alignment-Packing of Structures
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/
Source Code
Searching Algorithms
Information retrieval is critical in any computer application. Large sets of records are stored in computer system, from which a particular record is fetched in which required information would be stored. Each record stored in the computer environment would have a key associated to it. Based on the search criteria system scans through the records and extract the matching records only. To Increase the speed or reduce the information retrieval duration, various searching techniques are used.
Below are the basic commonly used searching algorithms.
Embedded C Interview Questions and Answers
The following link would navigate to some questions that are very commonly asked in interviews(Cisco,Intacct,WNI etc.). It encloses some C programs as well.
