Question

Quiz 2i CISC220 NAME 2ICHEN UD ID 1022 83 1. In a B-tree with M 5, L7 1. What is the maximum number of children nodes and keys at each internal node? 2. Minimum number of data items at a leaf node? 2. With a block size of 100, data size of 10, pointer size of 4, and key size of s, what is the maximal values for N L? 3. Briefly describe the difference between Stack and Queue data structures.

Answer 1

answer1) 1) given m= 5 and L =7 , maximum number children node as internal node is given by 2L-1 therfore maximum number of children nodes at each internal node is 2*7 -1 = 13

2)minimum number data at aleaf node is L-1 = 6

answer 2) note: since half of the question is not visible ..i am not able to solve it..please comment the full question in the comments section i will provide the answer for it too

answer 3) difference between stack and queue

=> stack is datastructure in which objects are accessed in LIFO order, that is last in first out principle , whereas queue follow FIFO( first in first out principle)

=>in stack the object is pushed onto the top of the collection where as in queue it is inserted at the end

=> stack has 1 point of access that is " top" whereas queue has two poinnt of access that is front and rear end

=>in stack objects are inserted and removed at same end , while in queue insertoion takes place in one end and deletion take places in another end

=> stack operation are called push and pop whereas queue operation is called enqueue and dequeue

=>collection of plates in an ceremony is an example stack , whereas booking a railway ticket in railways station is an example of queue

thankyou,

cheer.