Question:
What is return value of strcmp() if the two parameters are identical?
What is return value of strcmp() if the two parameters are identical?
Show Hint
Use strcmp return value for exact string match: 0 means identical strings.
Updated On: June 02, 2025
- -1
- 1
- 0
- True
Hide Solution
Verified By Collegedunia
The Correct Option is C
Solution and Explanation
strcmp() returns:
- 0 if both strings are equal
- negative value if first<second
- positive value if first>second
- 0 if both strings are equal
- negative value if first<second
- positive value if first>second
Was this answer helpful?
0
0
Top Questions on Programming and Data Structures
The value printed by the given C program is __________ (Answer in integer).
- GATE CS - 2025
- Computer Science and IT Engineering
- Programming and Data Structures
- In a double hashing scheme, \( h_1(k) = k \mod 11 \) and \( h_2(k) = 1 + (k \mod 7) \) are the auxiliary hash functions. The size \( m \) of the hash table is 11. The hash function for the \( i \)-th probe in the open address table is \( [h_1(k) + i \cdot h_2(k)] \mod m \). The following keys are inserted in the given order: 63, 50, 25, 79, 67, 24. The slot at which key 24 gets stored is:
- GATE CS - 2025
- Computer Science and IT Engineering
- Programming and Data Structures
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is ___________ (answer in integer).
- GATE CS - 2025
- Computer Science and IT Engineering
- Programming and Data Structures
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:
- GATE CS - 2025
- Computer Science and IT Engineering
- Programming and Data Structures
- 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 \)?
- GATE CS - 2025
- Computer Science and IT Engineering
- Programming and Data Structures
View More Questions
Questions Asked in TS PGECET exam
- Melting rates of electrodes in manual metal arc welding process is mainly governed by the
- TS PGECET - 2024
- Manufacturing Processes
- The maximum area of a rectangle that can be inscribed in a circle of radius $R$ is
- TS PGECET - 2024
- 3D Geometry
- For the matrix \[ \begin{bmatrix} 2 & 1 & 1 \\ 0 & 2 & 1 \\ 1 & 0 & 1 \end{bmatrix}, \] an Eigen vector among the following vectors is
- TS PGECET - 2024
- Linear Algebra
- Which of the following expression is a tautology?
- TS PGECET - 2024
- Digital Logic
- The 2’s complement representation of the decimal value $-15$ is
- TS PGECET - 2024
- Digital Logic
View More Questions
