Difference between revisions of "Interview Preparation Articles"

From Embedded Systems Learning Academy
Jump to: navigation, search
(Sorting Topics)
(BSS and Data Segments)
 
(56 intermediate revisions by 5 users not shown)
Line 6: Line 6:
 
*  [[Meaning of Static | What is a '''static''' keyword in C/C++?]]
 
*  [[Meaning of Static | What is a '''static''' keyword in C/C++?]]
 
*  [[Interview Preparation Linked List | Linked List]]
 
*  [[Interview Preparation Linked List | Linked List]]
 +
*  [[Interview Preparation topic : About '''extern''' keyword in C/C++ | About '''extern''' keyword in C/C++]]
 +
*  [[Interview Preparation topic : Pointers in C | Pointers in C]]
 +
*  [[Interview Preparation topic : Structures and Unions | Structures and Unions]]
 +
*  [[Inline Specifier | '''Inline''' Specifier]]
 +
*  [[Dynamic memory allocation in C]]
 +
*  [[Standard Predefined Macros]]
 +
*  [[Interview Preparation topic: Recursive Function | Recursive Function]]
 +
*  [[Interview Preparation topic: Name Mangling | Name Mangling]]
 +
<br/>
  
<br/>
 
 
== C++ Object Oriented Topics ==
 
== C++ Object Oriented Topics ==
 
*  [[Interview Preparation C++ Virtual, Polymorphism and Abstract class |What is "virtual", "polymorphism" and "abstract class"?]]
 
*  [[Interview Preparation C++ Virtual, Polymorphism and Abstract class |What is "virtual", "polymorphism" and "abstract class"?]]
 +
*  [[Dynamic Memory Allocation in C++]]
  
 
<br/>
 
<br/>
 +
 
== Operating Systems Topics ==
 
== Operating Systems Topics ==
 
=== FreeRTOS Tutorial ===
 
=== FreeRTOS Tutorial ===
Line 19: Line 29:
 
=== Other OS Topics ===
 
=== Other OS Topics ===
 
*  [[Interview Preparation OS Synchronization Primitives|Synchronization Primitives - Mutexes, Spinlocks, Queues etc.]]
 
*  [[Interview Preparation OS Synchronization Primitives|Synchronization Primitives - Mutexes, Spinlocks, Queues etc.]]
*  [[Interview Preparation OS Common Problems|Common Problems in Multitasking OS]]
+
*  [[Kernel Space and User Space|Kernel Space and User Space]]
  
 
<br/>
 
<br/>
 +
 
== Miscellaneous Topics ==
 
== Miscellaneous Topics ==
 
=== Bit Fiddling ===
 
=== Bit Fiddling ===
Line 27: Line 38:
 
*  [[Bitmasking Tutorial]]
 
*  [[Bitmasking Tutorial]]
 
*  [[Bit Structures | Bit Structures and Unions]]
 
*  [[Bit Structures | Bit Structures and Unions]]
 +
=== BSS and Data Segments ===
 +
*  [[Where do your variables stored | Where are Global and static variables stored ?]]
 +
<br/>
  
 
=== Others ===
 
=== Others ===
 
*  [[Interview Preparation Strings |String Manipulation]]
 
*  [[Interview Preparation Strings |String Manipulation]]
 
*  [[Interview Preparation Pointers|All about pointers]]
 
*  [[Interview Preparation Pointers|All about pointers]]
 +
*  [[Null Pointer]]
 +
*  [[Add without using any arithmetic operators]]
 +
*  [[Data Structure Alignment-Packing of Structures]]
 +
*  [[Priority Queues]]
 +
*  [[Integer promotion in C]]
 +
<br/>
  
<br/>
 
 
== Sorting Topics ==
 
== 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.
+
*  [[Interview Preparation Sorting |Sorting]]
  
*  [[Interview Preparation Bubble Sort | Bubble Sort]]
+
== Algorithms==
* [[Interview Preparation Merge Sort | Merge Sort]]
+
*[[Searching Algorithms]]
* [[Interview Preparation Insertion Sort | Insertion Sort]]
+
*[[Graph Algorithms]]
*  [[Interview Preparation Heap 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.
+
==Embedded C Interview Questions and Answers==
  
so, we can also say that f(n) = n^5 or complexity is O(n^5) for n equal to infinity.
+
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.
  
Note: For comparison of big O complexity for different algorithms, refer following site:  http://bigocheatsheet.com/
+
* [[Interview Preparation Question and Answer]]

Latest revision as of 00:47, 13 February 2017

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


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


Sorting Topics

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.