A computer programmer is a specialized person who designs, writes and tests the computer programs. They are responsible for writing code that runs on client as well as server side. He or she designs software programs through building logical work flow charts, the functionality of which is translated into one of several computer languages. A computer programmer is also called a software developer, software engineer, computer scientist, or software analyst.
In this article I would mainly provide you some interview questions that are frequently asked to the computer programmer. Let’s start with the first one.
1. What are linked list, binary tree, arrays, queues and strings?
Well, it is one of the most frequently asked interview questions. The interviewer checks your basic knowledge and understanding through this question. Linked list, binary tree, arrays, queues and strings are the elementary topics of programming. One should have a good command on the language on which he or she is working. Just prepare a short and well organized answer to this question before appearing in front of the interviewer.
2. What is the difference between TCP and UDP?
TCP stand for transmission control protocol and UDP stands for User datagram Protocol.TCP is a reliable and connection oriented protocol, if there has been any mistake then TCP resends the part that was corrupted whereas UDP is an unreliable and connection-less protocol. A TCP protocol sends the data in a serial manner but a UDP protocol does not sends the data in serial order.
3. What is the difference between calloc() and malloc() function?
A calloc function allocates a block of memory for an array of elements of a certain size whereas a malloc function allocates bytes of memory and not blocks of memory like calloc. A malloc function returns a void pointer to the allocated space or NULL if there is insufficient memory available whereas a calloc function allocates an array in memory with elements initialized to 0 and returns a pointer to the allocated space.
4. State some sorting methods.
There are various sorting techniques such as quick sort, merge sort, binary sort, radix sort etc. The quick sort algorithm works on divide and conquer rule. A merge sort algorithm works by considering the data to be sorted as a sequence of already-sorted lists and radix sort technique takes a list of integers and puts each element on a smaller list, depending on the value of its least significant byte.
Well, these are some of the frequently asked interview questions. I am very sure my article would surely help you to answer the questions with great confidence.
