JAC 12th Computer Science Important Question Unit 2

JAC 12th Computer Science Important Questions Unit 2 : झारखण्ड बोर्ड कक्षा 12th सभी विद्यार्थियों के लिए Computer Science में unit 2 Data Structure के पिछले वर्षो में जो भी प्रश्न पूछे गए हैं, उनकी चर्चा हम इसमें करेंगे तो इन Important Questions को पढ़ लीजिए.

रांची: झारखंड एकेडमिक काउंसिल ( JAC Board) कक्षा JAC 12th Computer Science Important Questions के पिछले वर्षों के सभी महत्वपूर्ण प्रश्न (important Questions) आपको यहाँ पर बताए जा रहे है, जो बोर्ड परीक्षा 2023 के लिए बहुत महत्वपूर्ण है. अगर आप इन सभी प्रश्नों को याद कर लेते हो तो अवश्य ही आप JAC Board class 12th Computer Science  Exam 2023 में अच्छे अंक प्राप्त कर सकते हो.

विद्यार्थी इसका उत्तर स्वयं करें। ये सारे प्रश्न आपके परीक्षा (JAC 12th Computer Science Important Questions For Board Exams)में बार – बार पूछे जा रहे है। इसमें आपको सभी chapter का अलग-अलग पिछले 11 वर्षों के महत्वपूर्ण प्रश्न मिलेंगे। यानि 2009-2020 इसमें आपको ये भी बताया जा रहा है कि कौन से प्रश्न किस तरह केJAC 12th Computer Science Important Questions पूछे जा रहें है..

Join Telegram	Join Now
Join WhatsApp	Join Now

JAC 12th Computer Science Important Questions Unit 2 – Overview

Name of Organisation	Jharkhand Academic Council Ranchi
Category	Important Question
Article	JAC 12th Computer Science Important Questions Unit 2
State	Jharkhand
Question Types	Previous Year & Important Questions
Class	12th(Inter)
Stream	Science
Subject	Computer Science
Chapter	Unit 2
Chapter Name	Data Structure
Telegram	Join Us

Also Read –

• JAC 12th Computer Science Important Questions Unit 3 : Database and SQL
• JAC 12th Computer Science Important Questions Unit 4 : Boolean Algebra
• JAC 12th Computer Science Important Questions Unit 5 : Networking And Internet.

JAC 12th Computer Science Previous Years Important Questions Unit 2

Q1. Write an algorithm for POP operation in Stack. (2009)
Q2. Write an algorithm for Binary Search. (2009, 2013)
Q3. Convert from Infix to postfix to following expression: (2009)
A+BC/D

Q4. Write the Structure of singly linked list in C++.(2009)
Q5. Describe the similarities and differences between stack and queues. (2010, 2015, 2017)
Q6. Write an algorithm for Linear Searching procedure. (2010)
Q7. Translate following Infix into prefix expression: (2010)
(A+(BC))/(C – (DB))

Q8. Define Stack . Write an algorithm for PUSH operation in Stack. (2010)
Q9. What is a sorting? Write an algorithm for bubble sort.(2011, 2013)
Q10. Evaluate the following postfix notation of expression. (2011)
Q11. Obtain the postfix for the following Infix notation of expression showing the contents of the stack and postfix expression formed after each step of conversion. (2011)
A*B+(C-D/F)

Q12. Define queue. Write an algorithm for insert operation in queue in array form. (2011)
Q13. What is linked list ?Write an algorithm to count total number of nodes in a linked list.(2011)
Q14. Differentiate between data type and data structure. (2012)
Q15. What is meant by the term ‘overflow ‘ and ‘underflow’. (2012).
Q16. What is linear search? Explain. (2012)

Q17. Write an algorithm to count number of times a given ITEM occurs in a linked list L.(2012)
Q18. Differentiate between a LIFO and FIFO. (2012)
Q19. Write an algorithm to find maximum and minimum value of number is stored in one dimensional array.(2012)
Q20. Write an algorithm to delete an element from a circular queue.(2012)
Q21. Write an algorithm to merge to stored arrays A and B (both stored in increasing orders) into a final sorted array.

Q22. Write an algorithm for selection sort sorting procedure. (2012)
Q23. Transform each of the following Infix expression to postfix form :-(2012)
(i) (A+BC-D)/EF
(ii) A+(((B-C(D-E)+F)/G)(H-I))
Q24. Evaluate the following postfix expression using a stack and show the content of stack after each execution of each operation: (2012)
50, 40, +, 19, 14, -, 4, , +

Q25. Distinguish between Infix and postfix expressions giving examples of each. (2013)
Q26. Write an algorithm to search for an ITEM in a linked list L. (2013)
Q27. Define the following :(2013)
(a) Dynamic data structure
(b) Pointers
Q28. What is meant by Base Address of an array? (2013)
Q29. Obtain the postfix for the following Infix notation of expression showing the contents of the stack and postfix expression formed after each step of conversion : (2013)
(AB+(C-D)/EF))
Q30. Write an algorithm for delete operation in a queue. (2013)

Q31. Evaluate the following postfix expression showing the stack contents. (2014)
2, 4, *, 3, -10, 5, +, /
Q32. Describe the similarities and differences between queues and stacks. (2015)
Q33. What are the two components of a node in a given linked list? Explain with suitable diagram. (2015)
Q34. Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation – 120, 45, 20, +, 25, 15, -, +, . (2015)

Q35. Compare and contrast between Bubble sort and selection sort. (2015)
Q36.  Transform each of the following expression to prefix and Infix form – (a) +—ABC, (b) +A-BC, (c) +-/ACD↑EFG. (2015)

Q37. What is Queue? In a Queue , what is the purpose of front and rear? (2016)
Q38. What do you mean by linked list? (2016)
Q39. Explain sorting along with two popular sort technique. (2016)
Q40. Evaluate the following postfix operation using a stack : (2016)
AB+C*D/ if A=2, B=3, C=4, D=5

Q41. Write an algorithm for Quick Sort procedure. (2017)
Q42. List four important operations associated with linear data structure. Describe each. (2018)
Q43. Write an algorithm to count total number of nodes in a list. (2018, 2019)
Q44. Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation : (2018)
500, 20, 30, 10, , +

Q45. Write an algorithm for merge sort procedure. (2018)
Q46. Transform each of the following expression to Infix form : (2018)
a)+*ABC
b)-+/AC↑D|EFG.

Q47. Write an algorithm to insert an element in a queue. (2019)

Q48. Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation: (2019)
300, 10, 30, +, 20, , +

Q49. Transform each of the following expression to prefix and postfix form :(2019) a) (A-B(C+D))/EF b) (A+B)-CD
Q50. Write an algorithm on bubble sort or Binary search. (2020)
Q51. Obtain the postfix notation for the following Infix notation manually: – (2020)
(A) A+C-DB (B) (A+B)C+D/E-F

JAC 12th Computer Science Important Questions Unit 2 – FAQ’s

Important Links –

Google News	Click Here
Telegram	Click Here
Whatsapp	Click Here

Conclusions –

उम्मीद करते हैं या आर्टिकल(JAC 12th Computer Science Important Questions Unit 2) आपको पसंद आया होगा अगर आया हो तो कृपया करके अपना प्यारा सा comment नीचे कर दे उसके साथ ही अधिक अपडेट जानने के लिए हमारे telegram channel & Whatsapp Group में ज्वाइन कर ले.