gs gs121 Abstract Data Types - Stack using Linked List - Quiz No.1
gs gs121 Data Structures and Algorithms Quiz
This quiz belongs to book/course code gs gs121 Data Structures and Algorithms of gs organization. We have 169 quizzes available related to the book/course Data Structures and Algorithms. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Abstract Data Types. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: What is the best case time complexity of deleting a node in a Singly Linked list?
O (n)
O (n2)
O (nlogn)
O (1)
Question 2: Which of the following statements are not correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)?
Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL
SLL uses lesser memory per node than DLL
DLL has more searching power than SLL
Number of node fields in SLL is more than DLL
Question 3: Given below is the Node class to perform basic list operations and a Stack class with a no arg constructor.
Select from the options the appropriate pop() operation that can be included in the Stack class. Also ‘first’ is the top-of-the-stack.
Select from the options the appropriate pop() operation that can be included in the Stack class. Also ‘first’ is the top-of-the-stack.
class Node { protected Node next; protected Object ele; Node() { this(null,null); } Node(Object e,Node n) { ele=e; next=n; } public void setNext(Node n) { next=n; } public void setEle(Object e) { ele=e; } public Node getNext() { return next; } public Object getEle() { return ele; } } class Stack { Node first; int size=0; Stack() { first=null; } } public Object pop() { if(size == 0) System.out.println("underflow"); else { Object o = first.getEle(); first = first.getNext(); size--; return o; } } public Object pop() { if(size == 0) System.out.println("underflow"); else { Object o = first.getEle(); first = first.getNext().getNext(); size--; return o; } } public Object pop() { if(size == 0) System.out.println("underflow"); else { first = first.getNext(); Object o = first.getEle(); size--; return o; } } public Object pop() { if(size == 0) System.out.println("underflow"); else { first = first.getNext().getNext(); Object o = first.getEle(); size--; return o; } }
Question 4: What does the following function do?
public Object some_func()throws emptyStackException { if(isEmpty()) throw new emptyStackException("underflow"); return first.getEle(); }
pop
delete the top-of-the-stack element
retrieve the top-of-the-stack element
push operation
Question 5: What is the functionality of the following piece of code?
public void display() { if(size == 0) System.out.println("underflow"); else { Node current = first; while(current != null) { System.out.println(current.getEle()); current = current.getNext(); } } }
reverse the list
display the list
display the list excluding top-of-the-stack-element
reverse the list excluding top-of-the-stack-element
Question 6: What does ‘stack overflow’ refer to?
accessing item from an undefined stack
adding items to a full stack
removing items from an empty stack
index out of bounds exception
Question 7: Given below is the Node class to perform basic list operations and a Stack class with a no arg constructor. Select from the options the appropriate push() operation that can be included in the Stack class. Also ‘first’ is the top-of-the-stack.
class Node { protected Node next; protected Object ele; Node() { this(null,null); } Node(Object e,Node n) { ele=e; next=n; } public void setNext(Node n) { next=n; } public void setEle(Object e) { ele=e; } public Node getNext() { return next; } public Object getEle() { return ele; } } class Stack { Node first; int size=0; Stack() { first=null; } } public void push(Object item) { Node temp = new Node(item,first); first = temp; size++; } public void push(Object item) { Node temp = new Node(item,first); first = temp.getNext(); size++; } public void push(Object item) { Node temp = new Node(); first = temp.getNext(); first.setItem(item); size++; } public void push(Object item) { Node temp = new Node(); first = temp.getNext.getNext(); first.setItem(item); size++; }
Question 9: Which of the following data structures can be used for parentheses matching?
n-ary tree
queue
priority queue
stack
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121
Data Structures and Algorithms Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121
Data Structures and Algorithms Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121
Data Structures and Algorithms Online Quizzes
