For each of the terms in the box. choose the one that best describes the concept

Question

For each of the terms in the box. choose the one that best describes the concepts below. Place the letter of your choice on the left side of cache description: A constrained version of a linked list in which nodes can be inserted and deleted from the same end. Although you cannot create objects of these classes using the new operator, you can create references of those to objects of their subclasses Class variables that are accessible from other classes only through get-and set- methods. Method of a class that is called for the creation of every new object of the class. Uses super class references to manipulate subclass objects in a generic manner. Class variables that arc shared by all objects of the class. A constrained version of a linked list in which nodes can be inserted only at the one end of the list and deleted at the other end of the list. You cannot create an object of this concept using the new operator and you cannot have a constructor for this. When a subclass method is defined with the same signature (header) as a super class method. Classes in the java. lang package that are used to create objects containing values of primitive types.

Explanation / Answer

#include #include struct node { int info; struct node *ptr; }*front,*rear,*temp,*front1; int frontelement(); void enq(int data); void deq(); void empty(); void display(); void create(); void queuesize(); int count = 0; void main() { int no, ch, e; printf(" 1 - Enque"); printf(" 2 - Deque"); printf(" 3 - Front element"); printf(" 4 - Empty"); printf(" 5 - Exit"); printf(" 6 - Display"); printf(" 7 - Queue size"); create(); while (1) { printf(" Enter choice : "); scanf("%d", &ch); switch (ch) { case 1: printf("Enter data : "); scanf("%d", &no); enq(no); break; case 2: deq(); break; case 3: e = frontelement(); if (e != 0) printf("Front element : %d", e); else printf(" No front element in Queue as queue is empty"); break; case 4: empty(); break; case 5: exit(0); case 6: display(); break; case 7: queuesize(); break; default: printf("Wrong choice, Please enter correct choice "); break; } } } /* Create an empty queue */ void create() { front = rear = NULL; } /* Returns queue size */ void queuesize() { printf(" Queue size : %d", count); } /* Enqueing the queue */ void enq(int data) { if (rear == NULL) { rear = (struct node *)malloc(1*sizeof(struct node)); rear->ptr = NULL; rear->info = data; front = rear; } else { temp=(struct node *)malloc(1*sizeof(struct node)); rear->ptr = temp; temp->info = data; temp->ptr = NULL; rear = temp; } count++; } /* Displaying the queue elements */ void display() { front1 = front; if ((front1 == NULL) && (rear == NULL)) { printf("Queue is empty"); return; } while (front1 != rear) { printf("%d ", front1->info); front1 = front1->ptr; } if (front1 == rear) printf("%d", front1->info); } /* Dequeing the queue */ void deq() { front1 = front; if (front1 == NULL) { printf(" Error: Trying to display elements from empty queue"); return; } else if (front1->ptr != NULL) { front1 = front1->ptr; printf(" Dequed value : %d", front->info); free(front); front = front1; } else { printf(" Dequed value : %d", front->info); free(front); front = NULL; rear = NULL; } count--; } /* Returns the front element of queue */ int frontelement() { if ((front != NULL) && (rear != NULL)) return(front->info); else return 0; } /* Display if queue is empty or not */ void empty() { if ((front == NULL) && (rear == NULL)) printf(" Queue empty"); else printf("Queue not empty"); }

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.