Chaitu Tech Bits
Showing posts with label embedded interview questions. Show all posts
Showing posts with label embedded interview questions. Show all posts

Embedded Market Job Trends

Sunday, February 19, 2012

Hai all ,

 i am so happy see you all once again

Right now  IT market is having lot more openings

but remember on thing those are all for experienced people


Freshers who are trying to get a job in embedded systems its really difficult task

guys have a look on the market trend  get ready with c and data structures and

linux commands and linux basic programming  .then go to market and buy 8051

 board  do all the programs with this board and get ready to buy new arm9 board like ( friendly-arm , beagle board  like that )  do some thing with these board and try for jobs  .

  damm sure you will place in some good embedded based company :)


For Exp People exp b/w 2 to 8 years

prepare c  and data structures  :D

then u will get good job yar :D

for interview questions please refer http://campusinterviewindia.com/


cheers /''\

u r s chaitu
Share/Bookmark

what is the stack where it is used ? what is the use of the stack

Wednesday, December 15, 2010


The stack is a place in the computer memory where all the variables that are declared and initialized before runtime are stored.
A stack is a last in, first out (LIFO) data structure.
The push operation adds to the top of the stack, hiding any items already on the stack, or initializing the stack if it is empty. The pop operation removes an item from the top of the stack, and returns this value to the caller. A pop either reveals previously concealed items, or results in an empty stack.

Stack is used in

1. Expression evaluation and syntax parsing

Many compilers use a stack Expression evaluation before translating into low level code.

Example (general)


Share/Bookmark

what is difference between macro and function? what is macro and what is funcution


1.Difference between a macro and a function is that a macro returns code and a function returns a     value.
2.  macro 'calls' nearly always get expanded once at compile time wheras most  function calls are evaluated many many times.
           
            When you call a function your compiler enters a call-sequence (which takes
            time) and allocates a new stack frame for that function (whcih takes text
            stack space) so that the function's body can be executed. After it's done
            you enter a returning-sequence phase (which takes time).

            A macro does not need anything of the above, because it's preprocessor's job
            to expand a macro, it's only about text replacement, not about compiler
            stuff or code-generating issues. So you don't expend time and space doing
            what a function would need in order to be executed.

            That makes functions and macros[/b] completely different even if the result of
            using both is, in some cases, the same. One must know it's suitable to use
            one or the other. For instance: you can't point a pointer to a macro, but
            you can use pointers to functions...


Share/Bookmark

what is difference between array and stack and queue ? what is


You can think of a queue like a line at the bank. The first person to get there will get to the teller first. If a bunch of people come while all the tellers are busy, they stand in line in the order in which they arrived. That is to say, new people (items) are added to the end of the line and the first person in line is the only one who is called to a teller. In real life this is known as "first come, first served." In programming terms it's known as first-in-first-out, or FIFO.

You can think of a stack like a deck of cards. You can put down cards into a pile on your table one at a time, but if you want to draw cards, you can only draw them from the top of the deck one at a time. Unlike a queue, the first card to be put down is the last card to be used. This is known as first-in-last-out, or FILO (also called LIFO for last-in-first-out). 


A queue is a first-in-first-out data structure. When you add an element to the queue you are adding it to the end, and when you remove an element you are removing it from the beginning.

A stack is a first-in-last-out data structure. When you add an element to a stack you are adding it to the end, and when you remove an element you are removing it from the end.



An array is data structure (type of memory layout) that stores a collection of individual values that are of the same data type. Arrays are useful because instead of having to separately store related information in different variables (named memory locations), you can store them—as a collection—in just one variable. It is more efficient for a program to access and process the information in an array, than it is to deal with many separate variables.

All of the items placed into an array are automatically stored in adjacent memory locations. As the program retrieves the value of each item (or "element") of an array, it simply moves from one memory location to the very next—in a sequential manner. It doesn't have to keep jumping around to widely scattered memory locations in order to retrieve each item's value.

Imagine if you had to store—and later retrieve—the names of all of the registered voters in your city. You could create and name hundreds of thousands of distinct variable names to store the information. That would scatter hundreds of thousands of names all over memory. An alternative is to simply create one variable that can will store the same information, but in sequential memory locations.

Share/Bookmark

what is difference between array and stack? what is array what is stack



            Briefly, there are two main differences between an array and a stack.
            1)An array can be multi-dimensional, while a stack is strictly one-dimensional.
            2)An array allows direct access to any of its elements, whereas with a stack, only  

the 'top' element is directly accessible; to access other elements of a stack, you      
must go through them in order, until you get to the one you want.
           
            Another difference is
            3)Array size is fixed where as stack can grow.

Share/Bookmark

Difference between volatile and const?( constant)

CONSTANT  is used to declare the constants i.e the value of this data type will not be changed through out the program execution.

VOLATILE, Normal this data type will be used to declare the variable for timer count & interrupt status because the value of this specific types can't be expected any time

suggestions welcome
Share/Bookmark

Related Posts Plugin for WordPress, Blogger...