COS2601 Theoretical Computer Science II (COS2601)

the document has the latest questions and elaborate aswers

the document has the latest questions and elaborate answers

the document has the latest questions and elaborate answers

COS2601 EXAM PACK 2023

COS2601 EXAM PACK 2023

Recent exam questions and answers and summarized notes for exam preparation.

questions with well outlined answers for exam preparations. compiled from past years

School of computing Solution to Assignment 03 Structured Systems Analysis and Design ICT2621 Semester 2 2020 INTRODUCTION Dear student, Note that NO tutorial letters that will be sent to you for solutions, examination information or for any other issue, as was the case in years past. All this information will be found on the module’s website, in this case ICT2621, on myUnisa at www.My.U. The information will be found under Learning Units, Official Study Materials or Additional Resou...

COS2601 Theoretical Computer Science II Example examination paper and solutions (a) Let S = {a bb bab abaab}. For each of the following strings, state whether or not it is a word in S*: (i) abbabaabab (ii) abaabbabbbaabb (2) (b) Give an example of a set S such that S* only contains all possible strings of combinations of a’s and b’s that have length divisible by three. (4) (c) Give an example of two sets S and T of strings such that S* = T* but S ⊄ T and T ⊄ S. (4) ANSWER TO QU...

COS2601 Examination Paper And Solutions. Theoretical Computer Science II. A recursive definition for the language ODDAB should be compiled. Consider the alphabet ∑ = {a, b} and the language ODDAB, where ODDAB consists of all words of odd length that contain the substring ab. Provide (i) an appropriate universal set, (1) (ii) the generator(s) of ODDAB, (2) (iii) an appropriate function on the universal set, and then (1) (iv) use these concepts to write down a recursive definition for the ...