Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for strings
4
votes
1
answer
1
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 42
The provided C code is a version of the C string library function strlen(), which calculates the length of a given string. unsigned int mystrlen(char *c) { unsigned int i = 0; /* Your code here. */ } Which line of code creates a working and ... != '\0') i++; return i; while (*(c + i) != '\0') ++i; return i;
The provided C code is a version of the C string library function strlen(), which calculates the length of a given string.unsigned int mystrlen(char *c) { unsigned in...
GO Classes
375
views
GO Classes
asked
Feb 5
Programming in C
goclasses2024-mockgate-14
programming
programming-in-c
strings
multiple-selects
2-marks
+
–
0
votes
0
answers
2
how many it string of length 10 over the alphabet {a,b,c} have either exactly three a's or exactly four b's
_shreya123
232
views
_shreya123
asked
Nov 18, 2023
Combinatory
combinatory
strings
+
–
1
votes
2
answers
3
Self Doubt
char st[] = {‘G’,’A’,’T’,’E’,’\0’}; then string ka length 4 hoga ya 5 with null character?
char st[] = {‘G’,’A’,’T’,’E’,’\0’};then string ka length 4 hoga ya 5 with null character?
Durgesh_7979
403
views
Durgesh_7979
asked
Jun 7, 2023
Programming in C
strings
+
–
1
votes
0
answers
4
Strings in C language
I have seen alot of people saying that we can make an Integer string in C language. But according to me we can only make a character string in C language. here is the code: void main(){ char c[20] = { 1234 }; } as far as i know this is a ... but can someone tell me that is it possible to make a string of only integers in C language? If yes then how can we initialize it?
I have seen alot of people saying that we can make an Integer string in C language.But according to me we can only make a character string in C language.here is the code:...
deependu
249
views
deependu
asked
Apr 23, 2023
Programming in C
strings
programming-in-c
+
–
0
votes
1
answer
5
Finite automata and formal languages
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .
Write input set, strings and language for the following 1) The set of all strings with three consecutive O's over (0,1) .
upasesharanesh
332
views
upasesharanesh
asked
Apr 6, 2023
Theory of Computation
finite-automata
regular-language
regular-expression
strings
+
–
0
votes
0
answers
6
Computational Theory
Give the state diagram of DFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0, 1}. {w | accept all string except 11 or 110} {w | w begins with a 11 and ends with a 0} {w | All string accepted except ... w | w contains at least three 0s } { w | w contains the substring 0101, i.e., w = x0101y for some x and y }
Give the state diagram of DFAs with the specified number of states recognizing each of the following languages. In all parts, the alphabet is {0, 1}. {w | accept all stri...
ahmed5
404
views
ahmed5
asked
Feb 7, 2023
Theory of Computation
theory-of-computation
number-of-dfa
strings
+
–
0
votes
1
answer
7
find all strings of lenght 4 less, for the following regular expression (a*b + b*a)
Hemant jha
702
views
Hemant jha
asked
Dec 25, 2022
Theory of Computation
theory-of-computation
regular-expression
strings
+
–
0
votes
1
answer
8
is (a , b)* and (a*b*) are same ?
Mikdhad
1.5k
views
Mikdhad
asked
Jan 14, 2023
Theory of Computation
theory-of-computation
regular-language
strings
+
–
0
votes
3
answers
9
theory regular langauge
Write a regular expression for all strings of 0’s and 1’s in which there is an even number of 0’s between any two 1’s.
Write a regular expression for all strings of 0’s and 1’s in which there is an even number of 0’s between any two 1’s.
moe12leb
663
views
moe12leb
asked
Nov 27, 2022
Theory of Computation
theory-of-computation
strings
regular-expression
+
–
1
votes
0
answers
10
Theroy regular langauge
Write a regular expression for all strings of 0’s and 1’s in which at least one copy of the substring 01 occurs before any copy of the substring 10 occurs in the string. If there is no occurrence of the substring 10 then there need not be any copy of the substring 01.
Write a regular expression for all strings of 0’s and 1’s in which at least one copy of the substring 01 occurs before any copy of the substring 10 occurs in the stri...
moe12leb
199
views
moe12leb
asked
Nov 27, 2022
Theory of Computation
theory-of-computation
regular-expression
strings
+
–
0
votes
1
answer
11
theory Regular Langauge
Write a regular expression for all strings of 0’s and 1’s in which the total number of zeros to the right of each 1 is even.
Write a regular expression for all strings of 0’s and 1’s in which the total number of zeros to the right of each 1 is even.
moe12leb
233
views
moe12leb
asked
Nov 27, 2022
Theory of Computation
theory-of-computation
strings
regular-expression
+
–
0
votes
0
answers
12
Compiler principles Techniques and Tools
For sr 7,11- 1. i.Strings of 0's and 1's of the form aa', where a is binary string and a' is reverse of a. ii. Binary string of the form xy s.t. x!=y. Total length of xy is even, each of x and y be of odd length
For sr 7,11- 1. i.Strings of 0's and 1's of the form aa', where a is binary string and a' is reverse of a.ii. Binary string of the form xy s.t. x!=y. Total length of xy i...
_harshit__01
238
views
_harshit__01
asked
Nov 14, 2022
Compiler Design
compiler-design
strings
+
–
0
votes
1
answer
13
Theory of Computation
does this string ‘baab’ belongs (ba)* U (ab)* ?
does this string ‘baab’ belongs (ba)* U (ab)* ?
moe12leb
331
views
moe12leb
asked
Nov 4, 2022
Theory of Computation
theory-of-computation
regular-expression
strings
+
–
0
votes
1
answer
14
theroy of computation
{ε}* , {ε} are these two expressions equal or different ? where ε is the empty string
{ε}* , {ε} are these two expressions equal or different ? where ε is the empty string
moe12leb
350
views
moe12leb
asked
Nov 4, 2022
Theory of Computation
theory-of-computation
regular-expression
strings
+
–
1
votes
1
answer
15
DOUBT
DOUBT: suppose a memory space of 16B is given and it is asked that what is the maximum length of string it can store. then do we have to consider the space taken by the “\0” also? OR just the string length?
DOUBT:suppose a memory space of 16B is given and it is asked that what is the maximum length of string it can store.then do we have to consider the space taken by the �...
Pranavpurkar
329
views
Pranavpurkar
asked
Sep 27, 2022
Programming in C
programming
strings
+
–
0
votes
0
answers
16
unacademy test series
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the possible string(s) that can be stored. A)STRUCTURE B)UNION C)POINTER D)FUNCTION
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the...
Pranavpurkar
544
views
Pranavpurkar
asked
Sep 27, 2022
Programming in C
programming-in-c
strings
unacademy-test-series
+
–
1
votes
0
answers
17
Self doubt - printing null character from a character array.
We use character array to declare string in C. So, if I declare an array like character ch[ ] = {‘a’,’k’,’a’,’/o’}; and try printing ch[3] like : printf(“%C”,ch[3]); what will be the output ?
We use character array to declare string in C. So, if I declare an array likecharacter ch[ ] = {‘a’,’k’,’a’,’/o’};and try printing ch[3] like :printf(“%...
aakash pandey
281
views
aakash pandey
asked
Apr 30, 2022
Programming in C
programming-in-c
strings
+
–
1
votes
1
answer
18
CMI2019-B-2
Let us assume a binary alphabet $\Sigma=\{a,b\}.$ Two words $u,v\in \Sigma^{\ast}$ are said to be conjugates if there exist $w_{1},w_{2}\in \Sigma^{\ast}$ such that $u=w_{1}w_{2}$ and $v=w_{2}w_{1}.$ Prove that $u$ and $v$ are conjugates if and only if there exists $w\in \Sigma^{\ast}$ such that $uw=wv.$
Let us assume a binary alphabet $\Sigma=\{a,b\}.$ Two words $u,v\in \Sigma^{\ast}$ are said to be conjugates if there exist $w_{1},w_{2}\in \Sigma^{\ast}$ such that $u=w_...
gatecse
356
views
gatecse
asked
Sep 13, 2019
Theory of Computation
cmi2019
theory-of-computation
conjugates
strings
+
–
2
votes
3
answers
19
UGC NET CSE | June 2019 | Part 2 | Question: 78
Consider the following grammar: $S \rightarrow XY$ $X \rightarrow YaY \mid a \text{ and } Y \rightarrow bbX$ Which of the following statements is/are true about the above grammar? Strings produced by the grammar can have consecutive three $a$ ... by the grammar have $b$'s in multiple of $2$. i only ii and iii only iv only iii and iv only
Consider the following grammar:$S \rightarrow XY$$X \rightarrow YaY \mid a \text{ and } Y \rightarrow bbX$Which of the following statements is/are true about the above gr...
Arjun
2.0k
views
Arjun
asked
Jul 2, 2019
Theory of Computation
ugcnetcse-june2019-paper2
grammar
strings
+
–
3
votes
1
answer
20
Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 3 (Page No. 125)
In a string of length $n$, how many of the following are there? Prefixes. Suffixes. Proper prefixes. Substrings. Subsequences.
In a string of length $n$, how many of the following are there? Prefixes. Suffixes. Proper prefixes. Substrings. Subsequences.
admin
1.8k
views
admin
asked
Aug 5, 2019
Compiler Design
ullman
compiler-design
strings
descriptive
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register