Karteikarten
section B
Karten in diesem Stapel (16)
- 1In programming, stack can be implemented by using _____ and linked lists
- 2In a stack in which insertion and deletion of elements may take place at the same end; the first end is called as _____ and the other end is called ______top bottom
- 3Stacks are knows as ______lists.LIFO
- 4__________is add an element to the top of the stack and pop is remove the element at the top of the stackPush
- 5_______ is insert an element at the rear of the queue and dequeue is remove an element from the front of the queue.enqueue
- 6Enqueuing, the ______ index is always fixed and the ______ index moves forward in the arrayfront rear
- 7We use _______ of the element in the queue to detect an empty of full queue.counter
- 8A binary tree is made up of a finite set of elements called ______nodes
- 9_____ is a nodes with no childrenleaves
- 10______ is nodes with same parentsibling
- 11_______ is binary trees with only one childDegenerate
- 1212. We can build and maintain binary trees with _______ and ________insertion and deletion
- 13assigns different bits to characters based on their frequency of occurrences in the give message.Huffman coding
- 1414. A list is said to be _________ when it contains no elementsempty / under flow
- 15The numbers of elements currently stored is called the _____ of the listlength
- 16In a stack operation, ______ code used to return true if stack is full and return false otherwiseisFull
Informationen
- Beschreibung
- Karteikarten am section B, erstellt von Karmila am 29/07/2014.
- Erstellt von
- Karmila
- Aufrufe
- 16
- Bewertung