Question:
Let LIST be a datatype for an implementation of a linked list defined as follows:
Suppose a program has created two linked lists, L1 and L2, whose contents are given in the figure below (code for creating L1 and L2 is not provided here). L1 contains 9 nodes, and L2 contains 7 nodes. Consider the following C program segment that modifies the list L1. The number of nodes that will be there in L1 after the execution of the code segment is:
Let LIST be a datatype for an implementation of a linked list defined as follows:
Suppose a program has created two linked lists, L1 and L2, whose contents are given in the figure below (code for creating L1 and L2 is not provided here). L1 contains 9 nodes, and L2 contains 7 nodes. Consider the following C program segment that modifies the list L1. The number of nodes that will be there in L1 after the execution of the code segment is:
Show Hint
When working with linked lists in C, carefully track how nodes are added or removed by considering conditions and traversals through the list.
Updated On: Apr 4, 2025
Show Solution
Verified By Collegedunia
Solution and Explanation
The program iterates through the linked list
In the given lists:
- L1: 1 → 7 → 12 → 3 → 9 → 5 → 11 → 15 → 8
- L2: 11 → 6 → 9 → 15 → 12 → 4
The values
After the removal process, the remaining nodes in L1 will be:
1 → 7 → 3 → 5 → 8
Thus, the number of nodes left in
L1 and checks for the presence of each element from L1 in L2 using the function find(). If an element from L1 is found in L2, the corresponding node in L1 is removed. The find() function returns 1 when a match is found, and 0 otherwise.
In the given lists:
- L1: 1 → 7 → 12 → 3 → 9 → 5 → 11 → 15 → 8
- L2: 11 → 6 → 9 → 15 → 12 → 4
The values
11, 9, 12, and 15 are found in L2, and their corresponding nodes are removed from L1.
After the removal process, the remaining nodes in L1 will be:
1 → 7 → 3 → 5 → 8
Thus, the number of nodes left in
L1 is 5.
Was this answer helpful?
0
0
Top GATE CS Computer Science and IT Engineering Questions
- Suppose a program is running on a non-pipelined single processor computer system. The computer is connected to an external device that can interrupt the processor asynchronously. The processor needs to execute the interrupt service routine (ISR) to serve this interrupt. The following steps (not necessarily in order) are taken by the processor when the interrupt arrives:
(i) The processor saves the content of the program counter.
(ii) The program counter is loaded with the start address of the ISR.
(iii) The processor finishes the present instruction.
Which ONE of the following is the CORRECT sequence of steps? - Which ONE of the following statements is FALSE regarding the symbol table?
- Which ONE of the following techniques used in compiler code optimization uses live variable analysis?
- Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte addressable, what is the maximum number of entries in the page table?
A schedule of three database transactions \(T_1\), \(T_2\), and \(T_3\) is shown. \(R_i(A)\) and \(W_i(A)\) denote read and write of data item A by transaction \(T_i\), \(i = 1, 2, 3\). The transaction \(T_1\) aborts at the end. Which other transaction(s) will be required to be rolled back?
View More Questions
Top GATE CS Programming and Data Structures Questions
- Let G be any undirected graph with positive edge weights, and T be a minimum spanning tree of G. For any two vertices, u and v, let \( d_1(u, v) \) and \( d_2(u, v) \) be the shortest distances between u and v in G and T, respectively. Which ONE of the following options is CORRECT for all possible G, T, u, and v?
- Consider the following recurrence relation: \[ T(n) = 2T(n - 1) + n2^n { for } n>0, \, T(0) = 1. \] Which ONE of the following options is CORRECT?
Consider the following \(B^+\) tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the \(B^+\) tree. Which of the following options(s) is/are CORRECT?
- Which of the following statement(s) is/are TRUE for any binary search tree (BST) having \(n\) distinct integers?
- Let \( G(V, E) \) be an undirected and unweighted graph with 100 vertices. Let \( d(u, v) \) denote the number of edges in a shortest path between vertices \( u \) and \( v \) in \( V \). Let the maximum value of \( d(u, v) \), \( u, v \in V \) such that \( u \neq v \), be 30. Let \( T \) be any breadth-first-search tree of \( G \). Which ONE of the given options is CORRECT for every such graph \( G \)?
View More Questions
Top GATE CS Questions
- Which of the following sequences when stored in an array at locations A[1],..., A[10] forms a max-heap?
- The Lucas sequence Ln is defined by the recurrence relation: Ln = Ln−1 + Ln−2, for n ≥ 3, with L1 = 1 and L2 = 3. Which one of the options given is TRUE?
- Which of the following fields of IP header is/are always modified by any router before it forwards to IP Packet ?
- Which one of the following CIDR profix exactly represent the range of IP addresses 10.12.2.0 to 10.12.3.255?
- Consider an ethernet segment whose transmission is \(10^8\) bits per second. Maximum segment length \(500\ m\), speed of the provocation media velocity is \(2 × 10^8\) meter per second. What is the minimum frame size in bits ?
View More Questions