Technical questions

Collected from students who attended interviews

1. What are the operating system you are familiar with
2. Difference between Win 3.1 and Win 95
3. Other than using driver programs, can we run simultaneous programs in DOS if so how
4. What is multitasking , multiprogramming , multiprocessing ? Difference. (Try to tell with a clear example)
5. What is preemptive and non-preemptive multitasking?
6. What is context switching
7. Do you really feel the delay in time in switching over from one process to another in windows
8. What is real time operating system
9. What is closed system ? what is open system
10. How does windows sense and read inputs from different input devices
11. what are the different input devices
12. what is shadow mask method (in computer graphics)
13. In FORTRAN where are the include files if any how does linking occur
14. Does an object file carry information about linking
15. What are the advantages of compilers over interpreters
16. What is the difference between compiler and interpreters
17. What is load and go assemblers
18. What is bootstrap loader
19. What happens in pass1 and pass2
20. What are interrupts and different types in it(be clear try to give examples)
21. what is 8259
22. From a crystal oscillator how is time computed
23. What is a 16 bit counter and D flip flop
24. What are universal gates and how are other gates implemented using them
25. What is a flip-flop made of? How is a counter implemented
26. What is a register and when is it used
27. What gets loaded to boot a system in DOS
28. What is DMA operation and What are INT & INTA
29. What is memory management
30. What is MVT & MFT
31. different between paging and segmentation
32. What is compaction
33. What is demand paging? where is it used
34. What is pagefault? Why does it occur
35. What are additional information in pagetable other than index and frame
36. How are physical address generated in pagetable and segment table
37. What are single and multidimensional array
38. write program to find n! And n! / (n-r)! N
39. what is critical section
40. define arrays, hash tables, linked list, structures
41. compare DOS - WINDOWS
42. define INODES - > UNIX
43. semaphores -> test & set operations
44. define near and far pointers
45. define tagged variable
46. define blocking, starvation, deadlock
47. compare ++i & I++
48. can you return an address from a function
49. about MOD operator (with signed arguments)
50. compare 8088,8080,8086,8085
51. define internet
52. sorting -types ,order of their algorithm, time ....their tradeoffs
53. criteria for designing OS
54. different memory management in OS
55. synchronization of process
56. how will OS uniform waiting process to the processor
57. different algos for process scheduling
58. hashing, bucketing
59. define OS
60. concepts in OS
61. methods in deadlock recovery
62. how to allocate array dynamically
63. size of int, float, double, short
64. for what applications you use 8086. distinguish in terms of applications
65. does 8086 has registers
66. how will you calculate the delay time of a delay routine
67. how mathematics is applied in computer science .tell some subjects which you have learnt so far ,where math’s is applied
68. void main() {.... return 5} what will happen
69. different WIN95 & WIN-NT
70. what is virtual memory
71. different obj file & exe file
72. 5 diffs between RS, JK & MASTER SLAVE flip-flop
73. c program: pass the month no.. through’ command line argument and print the month no..
74. get two strings without using any string library functions print if the strings are equal, lesser or greater
75. what is FA,NFA,PDA
76. what is efficient line algo you use for drawing lines, explain
77. what is software cycle
78. features of c++
79. In WIN98 will one application crash affect other? How did they achieve it?
80. Any 4 significant features of C
81. c program to swap two variables without using temporary variable (they saw how you are writing the program - whether header files included, main() is present ,... )
82. whether it is possible to implement Turing machines in C
83. what is data structure
84. is linked list a data structure
85. what is diode
86. circuit for forward biasing
87. what is depletion layer
88. what is FET and MOSFET adv & disadv
89. what is karnaugh map explain
90. ideal char of diode
91. draw ckt of jk ff and exp using universal gates
92. how will u measure doping

Note: Try to answer the questions with examples. This will help to reduce confusions while explaining.