CA ( CODE:BTCS 301) IMPORTANT & EXPECTED QUESTIONS( IMPORTANT FOR PTU)- NOTES 2

-
COMPUTER ARCHITECTURE ( CODE:BTCS 301)  
(IMPORTANT & EXPECTED QUESTIONS-IMPORTANT FOR PTU EXAMS)

QUESTIONS CARRYING 2 MARKS

Q26. What are the basic functional units of computer?

Q27. Discuss basic organization of Micro-programmed control unit.

Q28. What is Inter-Process Communication?

Q29. Discuss the different types of ROM's.

Q30. Draw the block diagram of 2's Compliment Subtractor.

Q31. List various Memory Reference Instructions.

Q32. What is relation between address and memory space in a Virtual Memory System.?

Q33. Give two applications of Three-address instructions.

Q34. What is the role of Registers in digital computers.

Q35. Compare SIMD and MIMD Machine.

Q36. What is Micro Programming?

Q37. What do you mean by Associative memory and its applications?

Q38. Define Guard bit and Truncation.

Q39. What is bus arbitration and its types?

Q40. State the Basic performance equation.

Comments

Post a Comment

Popular posts from this blog

VOCABULARY OF THE DAY- 02/01/2019 ( With Antonyms, Synonyms and pics to learn )- Important for various Government Exams

-
Image
1. Defiance- Meaning: bold disobedience Synonyms: opposition, provocation Antonyms: calm, love ,peace 2. Dejected- Meaning: unhappy, disappointed Synonyms: discouraged, gloomy Antonyms: cheerful, happy   3.Delicacy - Meaning: fineness of texture or structure Synonyms: lightness, fragility Antonyms: strength     4. Deluge- Meaning: large amount of water Synonyms: barrage, spate Antonyms: -----   5.Demographic - Meaning: relating to structure of populations Synonyms: analytical Antonyms: -----
Read more

DATA STRUCTURES ( CODE:BTCS 304) IMPORTANT & EXPECTED QUESTIONS- NOTES 1

-
Image
DATA STRUCTURES ( CODE:BTCS 304)    (IMPORTANT & EXPECTED QUESTIONS-IMPORTANT FOR PTU EXAMS) SHORT ANSWER TYPE QUESTIONS (2 MARKS EACH): Q1. What are the applications of Queue? Q2. How Trees are represented in Memory? Q3. What is the Complexity of Insertion Sort? Q4. Define Header Nodes. Q5. What is DEQUEUE? Q6. What do you mean by depth of a Tree? Q7. What is the linked representation of Stacks? Q8. What are B Trees? Q9. Define Circular Queue. Q10. What is Heap? Q11. What is Big 'O' Notation? Q12. What are the advantages of linked lists over Arrays? Q13. What is threaded binory tree? Q14. Define Hashing. Q15. What is Breadth-First Traversal? Q16. Differentiate between Linear and Non-Linear Data structures. Q17. What is Graph and give its application? Q18. Discuss Double Linked List. Q19. What are postfix and prefix notations? Q20. Define Debugging. Q21. What are Non-Recursive
Read more