C Programming - Data Structure Interview Questions Answer

We have started series of C programming Q&A for job interview for freshers.Computer / IT Engineering Professionals and Students alike will be benefited.We recommend our user to go through previous post to enhance their knowledge and increase their work productivity and skill ratings at their Job.


We encourage our readers to provide feedback and ask question if required. Readers can also add Explanation, if  required for individual question please use our contact form or sends us mail mentioning topic and question number. We will publish it after review. We have tried our best to avoid any errors/ misprints,but if found by our readers please let us know.You can reach us at info@ingenuitydias.com

1. Which is problem oriented language
  1. BASIC
  2. PL/I
  3. FORTRAN
  4. none of above
Answer: 4

2. Which is ALGOL based simulation language
  1. FORTRAN
  2. SIMSCRIPT
  3. GASP IV
  4. none of above
Answer: 2

3. Which data structure is needed to convert infix notations to postfix notations
  1. linear list
  2. tree
  3. stack
  4. queue
Answer: 3

4. Repeated execution of simple computation may cause compounding of
  1. round off errors
  2. syntax errors
  3. run time errors
  4. logic errors
Answer: 1

5. Deletion from one end and insertion from other end is
  1. stack
  2. branch
  3. tree
  4. queue
Answer: 4

6. Which statement we should ignore in structure programming
  1. WHILE-DO
  2. GO-TO
  3. IT-ELSE
  4. SWITCH
Answer: 2

7. In C how many parameters can passed to a function
  1. 2
  2. 5
  3. 10
  4. as many as defined in function definition
Answer: 4

8. minimum number of stacks of size n required to implement a queue of size n
  1. One
  2. Two
  3. Three
  4. Four
Answer: 2

9. Preorder is
  1. depth first order
  2. breadth first order
  3. topological order
  4. linear order
Answer: 1



10. Sort which compares adjacent elements in a list and switch where necessary is
  1. Insertion sort
  2. Heap sort
  3. Quick sort
  4. Bubble sort
Answer: 4

11. Recursive problems are implemented by
  1. queues
  2. stacks
  3. linked lists
  4. strings
Answer: 2

12. A linear list from which elements can be added or removed from either end is called
  1. stack
  2. queue
  3. deque
  4. tree
Answer: 3

13. ++i is equivalent to
  1. i = i + 2
  2. i = i + 1
  3. i = i + i
  4. i = i - 1
Answer: 2

14. How many divisions are there in COBOL language
  1. Two
  2. Three
  3. Four
  4. Five
Answer: 3

15. O log(n) can be connected with
  1. Selection sort
  2. Insertion sort
  3. Binary sort
  4. Merge sort
Answer: 3

16. Which of the languages is often translated to the pseudo code
  1. PASCAL
  2. FORTRAN
  3. PL/I
  4. BASIC
Answer: 1

17. Merge sort uses
  1. Divide and conquer strategy
  2. Backtracking approach
  3. Heuristic search
  4. Greedy approach
Answer: 1

18. Which is having highest precedence in C
  1. relational operators
  2. equality operator
  3. logical operator
  4. arithmetic operator
Answer: 4

19. Which sorting method is slowest
  1. Quick sort
  2. Heap sort
  3. Shell sort
  4. Bubble sort
Answer: 4

20. Information about an array used in a program will be stored in
  1. symbol table
  2. activation record
  3. dope vector
  4. system table
Answer: 3

Related

Switch 1178880849094656534

Post a Comment

SPAMMING will not be Appreciated.

emo-but-icon

Hot in week

Recent

Comments

Our Channel

Contact Us

Name

Email *

Message *

Follow by Email

item