answersLogoWhite

0


Best Answer

you can use strstr()

User Avatar

Wiki User

13y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: How do you write c programme to find proper subset of a given string?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the meaning of properset?

I believe the term "proper set" is not use in math. A "proper subset" is a subset of a given set, that is not equal to the set itself.


What is the meaning of proper subset?

Given a set S, T is a proper subset of Sifany element of T is an element of S and there is at least one element of S that is not in T.The first condition ensures that T is a subset. The second ensures that it is a proper subset.


What are the proper subsets of 36912 in matrix form?

The only proper subset of a set comprising one element, is the null set.


What are examples of a proper subset?

The set {1, 3} is a proper subset of {1, 2, 3}.The set {a, b, c, d, e} is a proper subset of the set that contains all the letters in the alphabet.All subsets of a given set are proper subsets, except for the set itself. (Every set is a subset of itself, but not a proper subset.) The empty set is a proper subset of any non-empty set.This sounds like a school question. To answer it, first make up any set you like. Then, as examples of proper subsets, make sets that contain some, but not all, of the members of your original set.


What is subsets and proper subsets?

A set "A" is said to be a subset of "B" if all elements of set "A" are also elements of set "B".Set "A" is said to be a proper subset of set "B" if: * A is a subset of B, and * A is not identical to B In other words, set "B" would have at least one element that is not an element of set "A". Examples: {1, 2} is a subset of {1, 2}. It is not a proper subset. {1, 3} is a subset of {1, 2, 3}. It is also a proper subset.


What is subset of a set?

A subset, A, of a given a set S, consists of none or more elements that belong to S.


What is subset sets?

Given a set, S, a subset A of S is set containing none or more elements of S. So by definition, the subset A is a set.If there exists some element that is in S but not in A then A is a pro[er subset of S.


What is subset of set?

Given a set, S, a subset A of S is set containing none or more elements of S. So by definition, the subset A is a set.If there exists some element that is in S but not in A then A is a pro[er subset of S.


How many subset are there in given set?

If the set has n elements then it has 2n subsets.


How do you get odd ascii letters from a given string using string copy?

there is no such method using string copy


How many patterns of subset can you make from a set?

given any set of n objects, there are 2^n subsets. This comes from the fact that each item is either in or not in any given subset. So for all n objects, each one has two possibilities, either it is or is not in a subset. Then 2^n come from the multiplication principle.


How do you determine if a given string is palindrome or not?

Reverse the string and compare it to the original. If they match, then it is a palindrome.