A context diagram basically shows an overview of how a program functions by showing the flow of data, represented using two external entities and ONE process. However a dataflow diagram shows the flow of data within a program in a more detailed manner but showing the flow of data between inputs from the external entity, various processes, data storage and data that is outputted back to an external entity.
Went pretty well in the option, think i made a slight mistake and lost like 1 mark in a 3-4 marker on division and i wasnt familiar with the exact twos complement subtraction method (i use a different method) which lead to problems when i had to explain why some calculation was wrong or something.Nice work in prelimactually even in your trials you beat me - I got 75%. How do you find the option topic? I lose most of my marks there, then in mc, then section II for little things like forgetting to put storage in a DFD or talking crap about a dot point I don't really know where I usually get 1/2 or 2/3.
No. I just wanted to test you on basics they can ask if they are mean...
When the old program is no longer needed or fails to meet the needs of the client / user / organisation.
BEGIN Subprogram StringLength(s : string)
index = 0
length = 0
REPEAT
length = length + 1
increment index
UNTIL s(index) doesn't contain a character
Return length
END
BEGIN InsertString (OriginalString, InsertString, TempString : string, position : integer)
index = position
counter = 0
WHILE index <= (StringLength(OriginalString)) // Copy the part of the original string that will appear after the inserted substring
TempString(counter) = OriginalString(index)
increment index
ENDWHILE
index = position
counter = 0
WHILE counter <= StringLength(InsertString) // Insert the substring into its position, overwriting existing characters
OriginalString(index) = InsertString(counter)
increment counter
ENDWHILE
counter = 0
WHILE counter <= StringLength(TempString) // Append the original characters
OriginalString(index) = TempString(counter)
increment index
increment counter
ENDWHILE
ENDOpen source is not in the syllabus. HNNNNGGG
Hey, I don't understand this concept
BEGIN SUBPROGRAM StringLength(String)
Index = 1
WHILE String[Index] contains a character
Increment Index
ENDWHILE
Length = Index - 1
RETURN Length
END SUBPROGRAM StringLengthvalidation would be making sure the types are correct, verification would be if the data is actually what you want
Is this from the soft developers view topic ?
No. It's from the role of the CPU topic in one of the core chapters.
They're subtracting 1 because of the nature of the while loop - it will stop looping when index is 1 more than the length of the string, because it is there that it finds no character. However, if you started indexing at 0, this would correct the issue, because you're essentially not counting the first character.
Lexical analysis is the first stage of translating source code into executable code. It is the process of examining each word to ensure it is a valid part of the language, and involves assigning identifiers with tokens, which are stored in a symbol table, or lexicon, for reference. Reserved words will have predefined tokens, while new variables will require new tokens. Once a token has been assigned to a string of characters, each time that string appears the same token will be used. Errors that occur in this part of translation result from undeclared identifiers, incorrect naming of identifiers etc.
Well depends on the context. If its a minor aspect of a rough bit of pseudocode, just say it like it is.
BEGIN InsertString(start,newData,array)
temp = ExtractString(1,start - 1,array) + newData
temp = temp + ExtractString(start,array.length,data)
InsertString = temp
END InsertString
BEGIN ExtractString(start,length,array)
index = start
while index < start + length
temp = temp + array(index)
index = index + 1
endwhile
ExtractString = temp
END ExtractStringBEGIN InsertString(InsertString, Position)
Index = Position
Counter = 0
OriginalStringLength = StringLength(OriginalString)
{Create a copy of the end of the original string}
WHILE Index <= OriginalStringLength
TempString[Counter] = OriginalString[Index]
Increment Index
Increment Counter
ENDWHILE
TempStringLength = Index
{Calculate Length of Inserted String}
Index = Position
Counter = 0
InsertStringLength = StringLength(InsertString)
{Attach new string}
WHILE Counter <= InsertStringLength
OriginalString[Index] = InsertString[Counter]
Increment Index
Increment Counter
ENDWHILE
Counter = 0
{Attach end of original string back onto the string}
WHILE Counter <= TempStringLength
OriginalString[Index] = Temp[Counter]
Increment Index
Increment Counter
ENDWHILE
END InsertString