Stack Using Linked List Questions and Answers

28/11/2023, 09:26 Stack using Linked List Questions and Answers - Sanfoundry
Data Structure Questions and Answers – Stack

using Linked List
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Stack using
Linked List”.
1. What is the best case time complexity of deleting a node in a Singly Linked list?
a) O (n)
b) O (n2)
c) O (nlogn)
d) O (1)
View Answer
2. Which of the following statements are not correct with respect to Singly Linked List(SLL) and
Doubly Linked List(DLL)?
a) Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL
b) SLL uses lesser memory per node than DLL
c) DLL has more searching power than SLL
d) Number of node fields in SLL is more than DLL
View Answer
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.
advertisement
https://www.sanfoundry.com/data-structure-questions-answers-stack-linked-list/ 1/11
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;
}
}
a)
Note: Join free Sanfoundry classes at Telegram or Youtube
public Object pop()

{
if(size == 0)
System.out.println("underflow");
else
{
Object o = first.getEle();
first = first.getNext();
size--;
return o;
}
}
b)
advertisement
public Object pop()

{
if(size == 0)
else
{
first = first.getNext().getNext();
size--;
return o;
}
}
c)
advertisement
public Object pop()

{
if(size == 0)
else
{
first = first.getNext();
size--;
return o;
}
}
d)
public Object pop()

{
if(size == 0)
else
{
first = first.getNext().getNext();
size--;
return o;
}
}
View Answer
4. What does the following function do?
public Object some_func()throws emptyStackException

{
if(isEmpty())
throw new emptyStackException("underflow");
return first.getEle();
}
a) pop
b) delete the top-of-the-stack element
c) retrieve the top-of-the-stack element
d) push operation
View Answer
5. What is the functionality of the following piece of code?
public void display()

{
if(size == 0)
else
{
Node current = first;
while(current != null)
{
System.out.println(current.getEle());
current = current.getNext();
}
}
}
a) reverse the list

b) display the list
c) display the list excluding top-of-the-stack-element
d) reverse the list excluding top-of-the-stack-element
View Answer
6. What does ‘stack overflow’ refer to?

a) accessing item from an undefined stack
b) adding items to a full stack
c) removing items from an empty stack

d) index out of bounds exception
View Answer
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;
}
}
a)
public void push(Object item)

{
Node temp = new Node(item,first);
first = temp;
size++;
}
b)

{
Node temp = new Node(item,first);
first = temp.getNext();
size++;
}
c)

{
Node temp = new Node();
first = temp.getNext();
first.setItem(item);
size++;
}
d)

{
Node temp = new Node();
first = temp.getNext.getNext();
first.setItem(item);
size++;
}
View Answer
8. Consider these functions:

push() : push an element into the stack
pop() : pop the top-of-the-stack element
top() : returns the item stored in top-of-the-stack-node
What will be the output after performing these sequence of operations
push(20);
push(4);
top();
pop();
pop();
push(5);
top();
a) 20
b) 4
c) stack underflow
d) 5
View Answer
9. Which of the following data structures can be used for parentheses matching?
a) n-ary tree
b) queue
c) priority queue
d) stack
View Answer
10. Minimum number of queues to implement stack is ___________

a) 3
b) 4
c) 1
d) 2
View Answer
Sanfoundry Global Education & Learning Series – Data Structure.
To practice all areas of Data Structure, here is complete set of 1000+ Multiple Choice Questions and
Answers.
« Prev - Data Structure Questions and Answers » Next - Data Structure Questions and Answers –
– Stack using Array Queue using Array
Related Posts:
Apply for Data Structure Internship

Practice Computer Science MCQs
Practice Design & Analysis of Algorithms MCQ
Check Programming Books
Practice Programming MCQs
Data Structure MCQ, DS MCQ - Abstract Datatype
advertisement
Recommended Articles:
1. Data Structure Questions and Answers – Doubly Linked List
2. Data Structure Multiple Choice Questions – Linked List
3. Data Structure Questions and Answers – Circular Linked List
4. Data Structure Questions and Answers – Singly Linked List Operations – 1
6. Python Program to Implement Stack using Linked List
8. Java Program to Implement Stack using Linked List
9. Data Structure Questions and Answers – Xor Linked List
10. Data Structure Questions and Answers – Queue using Linked List
advertisement
Additional Resources:
Linked List Programs in C
Linked List Programs in Python
Data Structure MCQ Questions
Data Structures in C
Data Structures in Java
Popular Pages:
Data Structures in C++
C Programs on Recursion
Data Science MCQ Questions
C Tutorial
Python Programming Examples
Subscribe: Data Structure Newsletter
Name
Email
Subscribe
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to

get free Certificate of Merit. Join our social networks below and stay updated with latest contests,
videos, internships and jobs!
Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is
Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on
development of Linux Kernel, SAN Technologies, Advanced C, Data
Structures & Alogrithms. Stay connected with him at LinkedIn.
Subscribe to his free Masterclasses at Youtube & discussions at Telegram

SanfoundryClasses.
About | Certifications | Internships | Jobs | Privacy Policy | Terms | Copyright | Contact
     
© 2011-2023 Sanfoundry. All Rights Reserved.

Stack Using Linked List Questions and Answers

Uploaded by

Copyright:

Available Formats

Stack Using Linked List Questions and Answers

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Stack Using Linked List Questions and Answers

Uploaded by

Copyright:

Available Formats

28/11/2023, 09:26 Stack using Linked List Questions and Answers - Sanfoundry

Data Structure Questions and Answers – Stack

Note: Join free Sanfoundry classes at Telegram or Youtube

public Object pop()

public Object pop()

public Object pop()

public Object pop()

4. What does the following function do?

public Object some_func()throws emptyStackException

5. What is the functionality of the following piece of code?

public void display()

a) reverse the list

6. What does ‘stack overflow’ refer to?

c) removing items from an empty stack

public void push(Object item)

public void push(Object item)

public void push(Object item)

public void push(Object item)

8. Consider these functions:

10. Minimum number of queues to implement stack is ___________

Sanfoundry Global Education & Learning Series – Data Structure.

Apply for Data Structure Internship

Data Structure MCQ, DS MCQ - Abstract Datatype

Subscribe: Data Structure Newsletter

Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest

Subscribe to his free Masterclasses at Youtube & discussions at Telegram

About | Certifications | Internships | Jobs | Privacy Policy | Terms | Copyright | Contact

© 2011-2023 Sanfoundry. All Rights Reserved.

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.