O GoConqr está de visual novo! Conte para nós o que você achou.

Registre-se grátis

Quiz

Final prep Theory (3210)

Austin Stockhecke 13 perguntas

Fazer o quiz

Perguntas do quiz (13)

  1. 1When implementing a compiler for a programming language, regular expression is used to specify
    1. AToken name
    2. BToken pattern
    3. CIdentifier
    4. DContext free grammar
  2. 2When designing a programming language, context free grammar (or BNF) is used to specify
    1. ARegular expression
    2. BLanguage syntax
    3. CLanguage semantics
    4. DProgram
    5. EToken pattern
  3. 3Which of the following criteria is not appropriate to evaluate a programming language?
    1. AReadability
    2. BWritability
    3. CReliability
    4. DCost
    5. ENone of the above
  4. 4A CFG is ambiguous if
    1. AThere is a sentence such that no parse tree can be constructed from the CFG
    2. BThere is a sentence such that one parse tree can be constructed from the CFG
    3. CThere is a sentence such that two or more parse trees can be constructed from the CFG
    4. DNone of the above
  5. 5A program has syntax error(s) if
    1. Ano parse tree for the program can be constructed from the CFG
    2. Bone parse tree for the program can be constructed from the CFG
    3. Ctwo or more parse trees can be constructed from the CFG
    4. Dnone of the above
  6. 6The functions int sum( int aArray[]. int size); and __________ are NOT overloaded functions
    1. Afloat sum(float aArray[]. int size);
    2. Bint sum(int size, int aArray[]);
    3. Cfloat sum(int aArray[], int size);
    4. Dvoid sum(int oneArray[]. int arraySize, int& result);
  7. 7Which of the functions will be invoked by the statement f(10.5,10);
    1. Afloat f(int x, int y=10);
    2. Bint f(double x, double y);
    3. Cfloat f(double x, int y, int z = 10);
    4. Dvoid f(int x, int y, double z = 10.0);
  8. 8Which of the following function declarations follows Java syntax?
    1. AAre local variables statically or dynamically allocated?
    2. BCan subprograms be generic?
    3. CCan subprograms be overloaded?
    4. DCan subprograms be overrided?
  9. 9Which of the following is a legal rule or fact in Prolog?
    1. ARaining(Today).
    2. Braining(today).
    3. CRaining.
    4. DRaining(Today) :- not(sunny(Today)),not(cloudy(Today)).
  10. 10Which of the following is NOT a correct representation of a list in Prolog?
    1. A[a, b, c]
    2. B[a, "b", 2]
    3. C[a | [] ]
    4. D[a | [a | [b, c] ] ]
    5. E[a, [a, c]]
    6. FNone of the above

Informações

Descrição
Computer Science Quiz sobre Final prep Theory (3210), criado por Austin Stockhecke em 02-05-2018.
Idioma
English
Visualizações
1
Etiquetas
computer science
Avaliação
Ainda sem avaliações
Avalie este quiz
Avalie este quiz

Fale Conosco

Sobre o que é sua mensagem?

O que você acha do novo visual?

Você gostou?