{"id":12945,"date":"2019-12-17T17:00:02","date_gmt":"2019-12-17T11:30:02","guid":{"rendered":"https:\/\/kseebsolutions.guru\/?p=12945"},"modified":"2021-07-02T15:36:29","modified_gmt":"2021-07-02T10:06:29","slug":"2nd-puc-computer-science-question-bank-chapter-4","status":"publish","type":"post","link":"https:\/\/kseebsolutions.guru\/2nd-puc-computer-science-question-bank-chapter-4\/","title":{"rendered":"2nd PUC Computer Science Question Bank Chapter 4 Data Structures"},"content":{"rendered":"

You can Download Chapter 4 Data Structures Questions and Answers, Notes, 2nd PUC Computer Science Question Bank with Answers<\/a> Karnataka State Board Solutions help you to revise complete Syllabus and score more marks in your examinations.<\/p>\n

Karnataka 2nd PUC Computer Science Question Bank Chapter 4 Data Structures<\/h2>\n

2nd PUC Computer Science Data Structures One Mark Questions and Answers<\/h3>\n

Question 1.
\nWhat are data structures?
\nAnswer:
\ndata structure is a systematic way of organising, storing and accessing data.<\/p>\n

Question 2.
\nDifferentiate between one-dimensional and two-dimensional array.
\nAnswer:
\nOne-dimensional array is structured in one dimension and each element is accessed by an index value whereas two-dimensional array is structured in two dimensions and each element is accessed by a pair of index values.<\/p>\n

Question 3.
\nGive any two examples for primitive data structures.
\nAnswer:
\nThe two examples for primitive data structures are int and float data.<\/p>\n

Question 4.
\nMention any two examples for non-primitive data structures.
\nAnswer:
\nThe two examples for non-primitive data structures are array and lists.<\/p>\n

\"KSEEB<\/p>\n

Question 5.
\nWhat are primitive data structures?
\nAnswer:
\nThe data structures that are directly operated upon by machine-level instructions.<\/p>\n

Question 6.
\nWhat are non-primitive data structures?
\nAnswer:
\nThe non-primitive data structures derived from primitive data types are more complex.<\/p>\n

Question 7.
\nName the data structure which is called LIFO list.
\nAnswer:
\nThe data structure which is called LIFO list is stacks.<\/p>\n

Question 8.
\nWhat is the other name of the queue?
\nAnswer:
\nThe FIFO list is the other name of the queue.<\/p>\n

\"KSEEB<\/p>\n

Question 9.
\nDefine an array.
\nAnswer:
\nArray is a collection of similar elements that share a common name. It is a structured data type and allocates memory contiguously.<\/p>\n

Question 10.
\nWhat are the lists?
\nAnswer:
\nLists are a way to store many different values under a single variable. Every item in this list is numbered with an index.<\/p>\n

Question 11.
\nWhat is meant by linear data structures?
\nAnswer:
\nThe linear(sequential) data structures is the one which displays the relationship of adjacency between the elements.<\/p>\n

Question 12.
\nWhat are non-linear data structures?
\nAnswer:
\ndata structure that is possible to derive any relationship other than the adjacency relationship is called non-linear data structures.<\/p>\n

\"KSEEB<\/p>\n

Question 13.
\nWhat is a stack?
\nAnswer:
\nstack is an ordered collection of items in which items may be inserted and deleted at one end.<\/p>\n

Question 14.
\nWhat is a queue?
\nAnswer:
\nA queue is a non-primitive data structure where an item is inserted at one end and removed from the other end.<\/p>\n

Question 15.
\nName the data structure whose relationship between data elements is by means of links.
\nAnswer:
\nThe data structure whose relationship between data elements is by means of links is linked lists.<\/p>\n

Question 16.
\nWhat is a linked list?
\nAnswer:
\nLinked list is a data structure in which each element is dynamically allocated and in which elements point to each other to define a linear relationship.<\/p>\n

Question 17.
\nMention any one application of stack.
\nAnswer:
\nThe one application of stack is recursive function\/expression evaluation.<\/p>\n

Question 18.
\nWhat do you mean by traversal in data structure?
\nAnswer:
\nThe process of accessing each data item only once in group of elements for some operation.<\/p>\n

\"KSEEB<\/p>\n

Question 19.
\nDefine searching in a one-dimensional array.
\nAnswer:
\nSearching is the process of finding the location of data element in the array.<\/p>\n

Question 20.
\nWhat is meant by sorting in an array?
\nAnswer:
\nThe sorting is the process of arranging the array elements in ascending or in descending order.<\/p>\n

Question 21.
\nMention the types of searching in the array.
\nAnswer:
\nThe linear search and binary search techniques are the types of searching in the array.<\/p>\n

Question 22.
\nWhat are non-linear data structures?
\nAnswer:
\nThe TREES and GRAPH are non-linear data structures.<\/p>\n

Question 23.
\nWhat is a binary tree?
\nAnswer:
\nThe TREE is a general data structure that describes the relationship between data items or ‘nodes’. The parent node of a binary tree has only two child nodes.<\/p>\n

Question 24.
\nWhat do you mean by the depth of a tree?
\nAnswer:
\nIt is the number of ancestors of a node excluding itself i.e., the length of the path to its root.<\/p>\n

\"KSEEB<\/p>\n

Question 25.
\nHow do you find the degree of a tree?
\nAnswer:
\nThe degree of the tree is the total number of its children i-e the total number nodes that originate from it. The leaf of the tree does not have any child so its degree is zero.<\/p>\n

Question 26.
\nWhat are the operations that can be performed on stacks?
\nAnswer:
\nThe stack(), push(item), pop(), peek(), is Empty() and size() are the operations that can be performed on stacks.<\/p>\n

Question 27.
\nWhat are the operations that can be performed on queues?
\nAnswer:
\nThe queue(), enqueue(item), dequeue(), isEmpty() and size() are the operations that can be performed on queues.<\/p>\n

Question 28.
\nDefine the term PUSH and POP operations in stack.
\nAnswer:
\nThe process of adding a new item to the top of the stack is called PUSH and the process of removing the top item from the top of stack is called POP operation.<\/p>\n

Question 29.
\nWhat is the FIFO list?
\nAnswer:
\nThe data structure queue is called FIFO(First In First Out) which means first inserted data item is removed first.<\/p>\n

Question 30.
\nWhat is the LIFO list?
\nAnswer:
\nThe data structure stack is called LIFO(Last In First Out) which means the last inserted data item is removed first.<\/p>\n

Question 31.
\nMention the different types of queues.
\nAnswer:
\nThe different types of queues are simple queue, circular queue, priority queue and dequeue.<\/p>\n

Question 32.
\nGive examples for linear data structures.
\nAnswer:
\nThe examples for linear data structures are stack, queues and linked lists.<\/p>\n

Question 33.
\nGive examples for non-linear data structures.
\nAnswer:
\nThe examples for non-linear data structures are trees and graphs.<\/p>\n

\"KSEEB<\/p>\n

Question 34.
\nWhat is meant by traversal operations on data structure?
\nAnswer:
\nIt is the process of accessing each and every data element only once for some task.<\/p>\n

Question 35.
\nWhat is meant by insertion operations on data structure?
\nAnswer:
\nIt is the process of adding a data element into the existing set of data elements.<\/p>\n

Question 36.
\nWhat is meant by deletion operations on data structure?
\nAnswer:
\nIt is the process of removing existing data element from the existing set of data elements.<\/p>\n

Question 37.
\nWhat is meant by merging operations on data structure?
\nAnswer:
\nIt is the process of combining more than one set of similar data elements into one set of elements.<\/p>\n

Question 38.
\nHow is each and every element in the array referred?
\nAnswer:
\nThe array elements are referred by subscript or index of an array.<\/p>\n

Question 39.
\nGive the syntax of a one-dimensional array declaration.
\nAnswer:
\nDatatype arrayname [size] ;<\/p>\n

Question 40.
\nWhat is the first element index number in an array?
\nAnswer:
\nThe first element index number in an array is 0.<\/p>\n

Question 41.
\nWhat is the last element index number in an array?
\nAnswer:
\nThe last element index number of array is n-1 where n is the number of elements in an array.<\/p>\n

Question 42.
\nGive the formula to calculate the length of the one-dimensional array.
\nAnswer:
\nThe formula is
\nSize of the array = UB – LB + 1
\nWhere UB is Upper bound, LB is lower bound<\/p>\n

Question 43.
\nWhat do you mean by base address in-memory representation of an array?
\nAnswer:
\nThe base address in-memory representation of an array is the memory address of the first element of an array.<\/p>\n

Question 44.
\nGive the formula to calculate the memory address of an array element.
\nAnswer:
\nThe formula to calculate the memory address of an array element is
\nBase_Address + W ( Position – LB )
\nWhere W is the number of words per memory cell, position is the location of array element for which memory address is calculated, LB is Lower bound of an array.<\/p>\n

Question 45.
\nMention any one advantage of the linear search method.
\nAnswer:
\nThe linear search method doesn’t require the list should be in order.<\/p>\n

\"KSEEB<\/p>\n

Question 46.
\nMention any one dis-advantage of the linear search method.
\nAnswer:
\nThe disadvantage of the linear search method is time-consuming (slow in searching).<\/p>\n

Question 47.
\nMention any one advantages of the binary search method.
\nAnswer:
\nThe binary search method is very fast.<\/p>\n

Question 48.
\nMention any one disadvantage of the binary search method.
\nAnswer:
\nThe binary search method requires the list of elements should be in order.<\/p>\n

Question 49.
\nWhat is the formula to calculate mid element index number in the binary search method?
\nAnswer:
\nThe formula to calculate mid element index number in the binary search method is
\nMid-element-index = (low + high) \/ 2
\nWhere low is beginning index number and high is the last index number of an array.<\/p>\n

Question 50.
\nWhat are the different types of representation of stacks in memory?
\nAnswer:
\nThe two types of representation of stacks in memory are static representation and dynamic representation.<\/p>\n

Question 51.
\nGive the various elements that are required for stack PUSH operation.
\nAnswer:
\nThe various elements required for PUSH operation are PUS( STACK, TOP, SIZE, ITEM).<\/p>\n

2nd PUC Computer Science Data Structures Two Marks Questions and Answers<\/h3>\n

Question 1.
\nHow are data structure classified?
\nAnswer:
\nThe data structure is classified as primitive data structures and non-primitive data structures.<\/p>\n

Question 2.
\nJustify the need for using arrays.
\nAnswer:
\nArray is a contiguous memory locations represented by a single name and useful in storing data elements in adjacent memory locations. It can be used to implement data structures like linked lists, stacks, queues, trees, graphs, etc.,<\/p>\n

Question 3.
\nHow are arrays classified?
\nAnswer:
\nArray is classified as one dimensional, two dimensional and multidimensional arrays.<\/p>\n

\"KSEEB<\/p>\n

Question 4.
\nMention the various operations performed on arrays.
\nAnswer:
\nThe various operations performed on arrays are traversing, searching, sorting, insertion, deletion, and merging.<\/p>\n

Question 5.
\nHow do you find the length of the array?
\nAnswer:
\nLength of the array = UB – LB + 1
\nwhere
\nUB is the largest index or upper bound index number
\nLB is the smallest index or lower bound index number.<\/p>\n

Question 6.
\nMention the types of linked lists.
\nAnswer:
\nThe types of linked lists are Singly linked list, Doubly linked list and a circular linked list.<\/p>\n

Question 7.
\nWhat is a stack? Mention the types of operations performed on the stacks.
\nAnswer:
\nA stack is an ordered collection of items in which data item may be inserted and deleted at one end.
\nThe stack(), push(item), pop(), peek(), isEmpty() and size() are the operations that can be performed on stacks.<\/p>\n

Question 8.
\nWhat is a queue? Mention the various operations performed on the queue.
\nAnswer:
\nA queue is a non-primitive data structure where an item is inserted at one end and removed from the other end.
\nThe queue(), enqueue(item), dequeue(), isEmpty() and size() are the operations that can be performed on queues.<\/p>\n

Question 9.
\nGive the syntax for a 2-dimensional array declaration.
\nAnswer:
\nThe two dimensional array declaration syntax
\nDatatype arrayname [rowsize] [columnsize] ;<\/p>\n

Question 10.
\nWhat do you mean by row-major ordering and column-major ordering in two-dimensional array?
\nAnswer:
\nIn row-major ordering, every row of the 2-dimensional array is stored one after the other in the memory. In column-major ordering, every column of the two-dimensional array is stored one after the other in the memory.<\/p>\n

\"KSEEB<\/p>\n

Question 11.
\nGive the formula to calculate the memory address of an element using row-major ordering and column-major ordering methods.
\nAnswer:
\nRow major order method formula
\nLOC(rowidx, colidx) = BaseAddress + W ( colsize * rowidx + colidx)
\nColumn major order method formula
\nLOC(rowidx, colidx) = BaseAddress + W (rowidx + rowsize * colidx)<\/p>\n

Question 12.
\nWhat is an expression? Write the different methods of representing an expression.
\nAnswer:
\nThe expression is a combination of operators and operators. The different methods are infix, prefix and postfix expressions.<\/p>\n

Question 13.
\nConvert the infix expression A + B to prefix and postfix expression.
\nAnswer:
\nPrefix expression –\u00a0 \u00a0 +AB
\nPostfix expression –\u00a0 \u00a0 AB +<\/p>\n

Question 14.
\nWrite the rules for evaluating postfix expressions.
\nAnswer:
\nRule 1:
\nread the expression from left to right.<\/p>\n

Rule 2:
\neach operator follows the previous two operands.<\/p>\n

Rule 3:
\nPUSH when operands are read, and operands will be in the top two-element when operator found.<\/p>\n

Rule 4:
\nevaluate the expression and push the result on the stack.<\/p>\n

\"KSEEB<\/p>\n

Question 15.
\nWhat is the significance of variables FRONT and REAR in a queue?
\nAnswer:
\nThe variable FRONT is used to identify the position of the first element in the queue, and variable REAR is used to identify the position of the last element of the queue.<\/p>\n

2nd PUC Computer Science Data Structures Three Marks Questions and Answers<\/h3>\n

Question 1.
\nMention the various operations performed on data structures.
\nAnswer:
\nThe various operations performed on primitive data structures are create, destroy, select and update and traversal, insertion-deletion, searching, sorting and merging on non-primitive data structures.<\/p>\n

Question 2.
\nExplain the memory representation of a one-dimensional array.
\nAnswer:
\nThe data elements of array is stored in contiguous memory locations. Let P be the location of the data element. The address of the first element of linear array A is given by Base(A)
\nTo calculate the address of any element of A formula
\nLOC ( A[P] ) = Base(A) + W ( P – LB )
\nWhere
\nW is the size of data type (number of words per memory cell)
\nP – location of the data element
\nA – Base address of first element of array
\nLB – Lower bound index number<\/p>\n

Question 3.
\nExplain the memory representation of a stack using a one-dimensional array.
\nAnswer:
\nThe items into the stack are stored in a sequential order from the first location of the memory block. A pointer TOP contains the location of the top element of the stack. A variable MAXSTK contains the maximum number of elements that can be stored in stack.
\nThe stack is full when TOP = MAXSTK
\nThe stack is empty when TOP = 0.<\/p>\n

\"KSEEB<\/p>\n

Question 4.
\nExplain the memory representation of the queue using a one-dimensional array.
\nAnswer:
\nLet Q be a linear array of size N
\nThe pointer FRONT contains location of front element of the queue (element to be deleted)
\nThe pointer REAR contains location of rear element of the queue (recently added element)
\nThe queue is empty when FRONT = 0
\nThe queue is full when FRONT = N
\nTo add element, REAR = REAR + 1
\nTo delete element, FRONT = FRONT + 1<\/p>\n

Question 5.
\nExplain the memory representation of single linked list.
\nAnswer:
\nA linked list maintains the memory location of each item in the list by using a series of ‘pointers’ within the data structure.
\nEvery node of a singly-linked list contains the following information:<\/p>\n

    \n
  • Data element (user’s data);<\/li>\n
  • A link to the next element (auxiliary data).<\/li>\n<\/ul>\n

    A number of pointers are required, these are:<\/p>\n

      \n
    1. The start pointer’ points to the first node in the list.<\/li>\n
    2. The last node in the list has a ‘null pointer’ (which is an empty pointer)<\/li>\n
    3. Each node has a pointer providing the location of the next node in the list.<\/li>\n<\/ol>\n

      Question 6.
      \nDefine the following with respect to binary tree<\/p>\n

        \n
      1. root<\/li>\n
      2. subtree<\/li>\n
      3. depth<\/li>\n
      4. degree<\/li>\n<\/ol>\n

        Answer:
        \n1. root:
        \nA topmost node in a tree<\/p>\n

        2. subtree:
        \nA tree T is a tree consisting of node in T and all of its descendants in T.<\/p>\n

        3. depth:
        \nIt is the number of ancestors of a node excluding itself i.e., the length of the path to its root.<\/p>\n

        4. degree:
        \nThe degree of the tree is the total number of it’s children i.e., the total number nodes that is zero.<\/p>\n

        \"KSEEB<\/p>\n

        Question 7.
        \nWrite an algorithm for traversal in a linear array.
        \nAnswer:
        \nAlgorithm for traversal of linear array
        \nTraversal (A, N) – A is an array of N elements
        \nStep 1: for i = 0 to N-l repeat step 2
        \nStep 2: print A[i]
        \n[End of for loop]
        \nStep 3: Exit.<\/p>\n

        Question 8.
        \nGive the memory representation of the two-dimensional array.
        \nAnswer:
        \nLet A be two-dimensional array
        \nLet M is rows and N is columns
        \nThe A array may be stored in the memory in one of the following methods;
        \n1. Row-major representation:
        \nIn this type of method, the first row occupies the first set of memory locations reserved for the array and second-row occupies the next set and so on.<\/p>\n

        2. Column-major representation:
        \nIn this type of method, the first column occupies the first set of memory locations reserved for the array and the second column occupies the next set and so on.<\/p>\n

        2nd PUC Computer Science Data Structures Five Mark Questions and Answers<\/h3>\n

        Question 1.
        \nWrite an algorithm to insert an element in an array.
        \nAnswer:
        \nA is an array
        \nN is number of elements (size)
        \nElement is a data element
        \nPos is the location of the element to be inserted.<\/p>\n

        Insertion (A, N, Element, Pos)
        \nStep 1: for i = N-1 downto Pos repeat step 2
        \nStep 2: A[i+1] = A[i]
        \nEnd for
        \nStep 3: A [Pos] = Element
        \nStep 4: N = N + 1<\/p>\n

        Question 2.
        \nWrite an algorithm to delete an element in an array.
        \nAnswer:
        \nA is an array
        \nN is number of elements (size)
        \nElement is a deleted data element
        \nPos is the location of the element to be deleted.
        \nDeletion (A, N, Pos)
        \nStep 1: Element = A [Pos]
        \nStep 2: for i = Pos to N-1 repeat step 3
        \nStep 3: A[ i ] = A[i+1]
        \nEnd for
        \nStep 4: N = N -1<\/p>\n

        Question 3.
        \nWrite an algorithm to search an element in an array using binary search. Algorithm: Binary_search(A,ele,N)
        \nAnswer:
        \nStep 1: low = 0
        \nStep 2: high = n-1
        \nStep 3: while (low <= high) repeat step 4 through step 6
        \nStep 4: mid = (low + high) \/ 2
        \nStep 5: Is ( ele = = a[mid]) then
        \nLoc = mid
        \ngoto step 7
        \nOtherwise
        \nStep 6: is ( ele < a[mid])? then
        \nhigh = mid – 1
        \notherwise
        \nlow = mid + 1
        \n[end while – step 3]
        \nStep 7: Is ( Loc >= 0 ) ? then
        \nPrint “search element found at location “, loc
        \nOtherwise
        \nPrint “search element not found”.<\/p>\n

        \"KSEEB<\/p>\n

        Question 4.
        \nWrite an algorithm to sort an array using insertion sort Algorithm: lnsertion_sort (A,N)
        \nAnswer:
        \nStep 1: for i = 1 to n-1 Repeat step 2
        \nStep 2: for j = i downto 1 Repeat step 3
        \nStep 3: is ( a[j] < a[j-1])? then
        \ntemp = a[j]
        \nA[j] = a[j-1]
        \nA[j-1] = temp [ end of j loop]
        \n[ end of i loop]<\/p>\n

        Question 5.
        \nWrite an algorithm for push and pop operation in stack using array.
        \nAnswer:
        \nAlgorithm for PUSH operation
        \nPUSH(STACK, TOP, SIZE, ITEM)
        \nStep 1: if TOP >= N-1 then
        \nPRINT “stack is overflow”
        \nExit
        \nEnd of if
        \nStep 2: Top = TOP + 1
        \nStep 3: STACK[TOP] = ITEM
        \nStep 4: Return<\/p>\n

        Algorithm for POP operation
        \nPUSH(STACK, TOP, ITEM)
        \nStep 1: if TOP = 0 then
        \nPRINT “stack is empty”
        \nExit
        \nEnd of if
        \nStep 2: ITEM = STACK[POP]
        \nStep 3: TOP = TOP -1
        \nStep 4: Return<\/p>\n

        Question 6.
        \nWrite an algorithm to insert a data element at the rear end of the queue.
        \nAnswer:
        \nStep 1: if REAR >= N -1 then
        \nPrint “Queue is overflow”
        \nExit
        \nEnd of if
        \nStep 2: REAR = REAR+ 1
        \nStep 3: QUEUE [REAR] = element
        \nStep 4: if FRONT =-1 then
        \nFRONT = 0.<\/p>\n

        \"KSEEB<\/p>\n

        Question 7.
        \nWrite an algorithm to delete a data element from the front end of the queue.
        \nAnswer:
        \nStep 1: if FRONT = -1 then
        \nPrint “Queue is Underflow”
        \nExit
        \nEnd of if
        \nStep 2: ITEM = QUEUE [FRONT]
        \nStep 3: if FRONT = REAR then
        \nFRONT = 0
        \nREAR = 0
        \nElse
        \nFRONT = FRONT + 1
        \nStep 4: return<\/p>\n

        Question 8.
        \nWrite an algorithm to insert a data element at the beginning of a linked list.
        \nAnswer:
        \nStep 1: if AVAIL = NULL then
        \nPrint ” Availability stack is empty”
        \nElse
        \nNEW_NODE = AVAIL
        \nAVAIL = AVAIL \u2192 LINK
        \nStep 2: if FIRST = NULL then
        \nNEW_NODE \u2192 INFO = ELEMENT
        \nNEW_NODE \u2192 LINK = NULL
        \nFIRST = NEW_NODE
        \nElse
        \nNEW_NODE \u2192 INFO = ELEMENT
        \nNEW_NODE \u2192 LINK = FIRST
        \nFIRST = NEW_NODE
        \nStep 3: return<\/p>\n

        Question 9.
        \nWrite an algorithm to delete a data element at the end of a linked list.
        \nAnswer:
        \nStep 1: if FIRST = NULL then
        \nPrint “Linked list is empty”
        \nExit
        \nEnd of if
        \nStep 2: if FIRST \u2192 LINK= NULL then
        \nReturn FIRST \u2192 data
        \nFIRST = NULL
        \nElse
        \nP2 = FIRST
        \nWhile P2 \u2192 LINK not equal to NULL
        \nP1 = P2
        \nP2 =P2 \u2192 UNK
        \nEnd while
        \nSTEP 4: Return p2 \u2192 data
        \nSTEP 5: P1 \u2192 LINK = NULL
        \nSTEP 6: EXIT.<\/p>\n

        \"KSEEB<\/p>\n

        Question 10.
        \nApply binary search for the following sequence of number. 10,20,30,35,40,45,50,55,60 search for item 35.
        \nAnswer:
        \nLow = 0, High = 8 search_ele = 35
        \nMid_ele_idx = (low + high)\/2
        \n= (0+8)\/2
        \n= 4
        \nIs 40 = 35? No
        \nThe list now is 10 20 30 35
        \nLow =0, high= 3
        \nMid_ele_idx = (low + high) \/2
        \n= (0+3)\/2
        \n= 1
        \nIs 20 = 35? No
        \nThe list now is 30 35
        \nLow = 2, high = 3
        \nMid_ele_idx = (low + high)\/2
        \n= (2+3)\/2
        \n= 2
        \nIs 30 = 35 No
        \nThe list now is 35
        \nLow = 3, high = 3
        \nMid_ele_idx = (low + high) fl
        \n= (3+3)\/2
        \n= 3
        \nIs 35 = 35 yes
        \nlocation = 3
        \nOutput:
        \nThe search element 35 is found at location 3.<\/p>\n","protected":false},"excerpt":{"rendered":"

        You can Download Chapter 4 Data Structures Questions and Answers, Notes, 2nd PUC Computer Science Question Bank with Answers Karnataka State Board Solutions help you to revise complete Syllabus and score more marks in your examinations. Karnataka 2nd PUC Computer Science Question Bank Chapter 4 Data Structures 2nd PUC Computer Science Data Structures One Mark …<\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[82],"tags":[],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/posts\/12945"}],"collection":[{"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/comments?post=12945"}],"version-history":[{"count":0,"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/posts\/12945\/revisions"}],"wp:attachment":[{"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/media?parent=12945"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/categories?post=12945"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kseebsolutions.guru\/wp-json\/wp\/v2\/tags?post=12945"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}