Computer Knowledge

Programming Languages and Compilers

2,284 Questions

Programming languages and compilers involve the rules, syntax, and semantics used to write and execute software programs. Key areas include scripting languages, object oriented concepts, and parsing algorithms like top down parsers. Practice these computer science questions to build proficiency for technical and computer knowledge exams.

Object oriented languagesScripting languagesCompilers and parsersProgramming syntax

Programming Languages and Compilers Questions

Multiple choice technology security

Ollydbg is a popular

  1. Compiler

  2. Reverse Engineering tool

  3. Database Monitoring tool

  4. Macro Analyzer
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

OllyDbg is a well-known 32-bit assembler-level analyzing debugger for Microsoft Windows. It is widely used in reverse engineering, malware analysis, and software cracking because it allows binary code analysis, modification, and debugging without access to the source code.

Multiple choice

What can be defined as - manages the execution of programs written in any of several supported languages, allowing them to share common object-oriented classes written in any of the languages?

  1. MSIL

  2. CLR

  3. JIT

  4. DLL

  5. CTS
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

As a part of Microsoft's .NET Framework, the Common Language Runtime (CLR) is programming that manages the execution of programs written in any of the several supported languages, allowing them to share common object-oriented classes written in any of the languages. A program compiled for the CLR does not need a language-specific execution environment and can easily be moved to and run on any system with Windows 2000 or Windows XP .

Multiple choice

Which of the following encryption-decryption classes of .NET technology performs asymmetric encryption and decryption using the CAPI implementation of the advanced encryption standard algorithm?

  1. AesManaged

  2. AesCryptoServiceProvider

  3. Aes

  4. AsnEncodedData

  5. ProtectedData
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

This encryption decryption class of .NET technology performs asymmetric encryption and decryption, using the CAPI implementation of the advanced encryption standard algorithm.

Multiple choice

Which of the following is the correct syntax to access an element of the form object?

  1. document.forms.element

  2. document.forms[0].elements[0]

  3. document[0].forms.element

  4. document.forms.elements[0]

  5. document.forms[0].element
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

if a web document contains a form element it can be referred in JavaScript using the syntax -document.forms[0]

If the Web document contains two form elements the first form is referred to as document.forms[0] and the second document.forms[1]. Therefore we can access first form element using document.forms[0].elements[0], the second element can be accessed as document.forms[0].elements[1] and so on.

Multiple choice

Which of the following tasks CAN NOT be performed by JavaScript?

  1. Detecting client browser information.

  2. Validating user input.

  3. Handling date and time.

  4. Mathematical calculations on client system.

  5. Access files on the client system.
Reveal answer Fill a bubble to check yourself
E Correct answer
Explanation

JavaScript can not directly access files on the user's system the only exception is the access to the browser's cookie files. 

Multiple choice

Which of the following statements is FALSE?

  1. In statically typed languages, each variable in a program has a fixed type

  2. In un-typed languages, values do not have any types

  3. In dynamically typed languages, variables have no types

  4. In all statically typed languages, each variable in a program is associated with values of only a single type during the execution of the program
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

(1) True for statically typed languages where each variable has fixed type. Similarly (4) is also correct. (2) True, in un-typed languages types of values are not defined. But option (3) is false, since in dynamically typed language variables have dynamically changing types but not that they have no type.

Multiple choice

If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true?

  1. L is necessarily finite

  2. L is regular but not necessarily finite

  3. L is context free but not necessarily regular

  4. L is recursive but not necessarily context free
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Since L can be effectively enumerated so L has to be regular, but is doesn't mean that the decisions are finite.