Question

Consider the following linked list. Which of the following piece of code will insert the node pointed to by q at the end of the list ?

a.

for (p=list; p!=NULL; p=p→next); p=q;

b.

for (p=list; p!=NULL; p=p→next); p→next=q;

c.

for (p=list; p→next !=NULL; p=p→next); p=q;

d.

for (p=list; p→next !=NULL; p=p→next); p→next=q;

Posted under UGC NET computer science question paper Data Structures and Algorithms

Answer: (d).for (p=list; p→next !=NULL; p=p→next); p→next=q;

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Consider the following linked list. Which of the following piece of code will insert the node pointed to by q at the end of the list ?

Add Comment

Similar Questions

Discover Related MCQs

Q. Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i > 0) of the tree? Assume that the root is at level 0:

View solution

Q. Which of the following data structure is used to implement recursion?

View solution

Q. The height of a binary tree with ‘n’ nodes, in the worst case is:

View solution

Q. Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by:

View solution

Q. With reference to implementation of different association mining algorithms, identify the correct statement:

View solution

Q. The maximum number of nodes in a binary tree of depth 10 is:

View solution

Q. The time required to find shortest path in a graph with n vertices and e edges is:

View solution

Q. Pre order is also known as:

View solution

Q. The equivalent post fix expression for d/(e+f) + b*c is:

View solution

Q. Which algorithm has same average, worst case and best case time?

View solution

Q. Application of data structure in queue is:

View solution

Q. The number of edges in a complete graph with N vertices is equal to:

View solution

Q. Which algorithm has same average, worst case and best case time?

View solution

Q. Binary search tree is an example of:

View solution

Q. What is the time required to insert an element in a stack with linked implementation?

View solution

Q. The equivalent postfix expression for d/(e+f) + b*c:

View solution

Q. Which one of the following is a physical data structure ?

View solution

Q. Which of the following statement is false ?

View solution

Q. If the postfix form of a string is ABC+-D*, the actual string is:

View solution

Q. Application of data structure queue is:

View solution

View All MCQs on Data Structures and Algorithms

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....