DCLD CHAPTER- 3 : LOGIC FAMILIES( HAND WRITTEN NOTES- ACCORDING TO PTU / KUK SYLLABUS )

-

Comments

Post a Comment

Popular posts from this blog

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-Recursiv...
Read more