now how abt tht

Can someone please suggest a one semester project based on theory of computation of an undergrad level? It is fine if it is totally theoretical or otherwise. thank you.

for the PDA: d=delta d(q0,a,Z) = {(q0,AZ)} d(q0,b,Z) = {(q0,BZ)} d(q0,a,A) = {(q0,AA)} d(q0,b,A) = {(q0,BA)} d(q0,a,B) = {(q0,AB)} d(q0,b,B) = {(q0,BB)} d(q0,c,Z) = {(q1,Z)} d(q0,c,A) = {(q1,A)} d(q0,c,B) = {(q1,B)} d(q1,a,A) = {(q1,e)} d(q1,b,B) = {(q1,e)} d(q1,e,Z0) = {(q1,e)} the cfg rules are: S -> [q0 Z q] [q0 …

I have the following code for shell sort (recursive) given in the question where t[ ] is an array to be sorted, n=no of elements initially. h is any large no initially,say h>n. [CODE]void shell_rec(int t[],int n,int h) { int aux,i; if(h<=0) return; if(n>h) { shell_rec(t,n-h,h); if(t[n]<t[n-h]) { aux=t[n]; i=n; …

[QUOTE]if you sort it DESCENDING you can loop through the array subbing the element from the total sum, if the next element causes the result to fall below zero you skip it for example[/QUOTE] what if u have: sum=14 integers : 10 5 -1 then it gives false that sum …

please help me understand when does one use *n=m and when to use n=&m [code]int *n,m; *n=5; m=2; *n=m;[/code] //gives an error