Question 1:• 1) A-ONE of the following is a None Primitive Data Structure.• a) integer> 2)...is a storing method of strings data structure in which each tine is viewed as arecord, where al records Have the same length.• a) Fixed Length Representationb) Pointerc) Arraysb) Linked List Representatione) Variable Length Representation• 3) A sparse array has 30 elements and 24 zeros elements, its sparsity is• a) 30/24• 4) The postfix notation of the infix expression: P+Q*R is• a) RQP+*• 5...is a sequence of data structure, which are connected together via pointers.• a) Stack• 6)..is an abstract data structure technique which insert and remove data using LIFOb) 24/30c)1/(24+30)b) PQR+*c) PQR*+b) Linked Listc) queuemethodology• a) Queueb) Hash TableC) Stack > 7)....one of the following function get the element at the front of the queuewithout removing it• A) push ()b) peek ()c) Dequeue ()• 8)...is a divide and conquer search algorithm which has runtime complexity o (Log n)c) Jump search• a) Binary searchb) Linear search> 9) Data Items can added or removed from the middle of the list in ay Arrays• a) arrayb) Stackc) Linked lists

Question 1) Answers: 1) Option(c) 2) Option(a) 3) Option(b) Reasons are given below.

Question 1: 1) A-ONE of the following is a None Primitive Data Structure. a) integer b) Pointer c) Arrays 2)...is a storing method of strings data struUcture in which each tine is viewed as a record, where al records Have the same length. a) Fixed Length Representation b) Linked List Representation e) Variable Length Representation 3) A sparse array has 30 elements and 24 zeros elements, its sparsity is a) 30/24 b) 24/30 c)1/(24+30)