PPL: Strong Typing

STRONG TYPING

Strong Typing: A strongly-typed programming language is one in which variable type is defined. (such as integer, character, hexadecimal, packed decimal, and so forth).

If we specify a particular type to our data, the compiler will consider the data as the specified type and no other type.

An example of arithmetic operation in strongly typed language that will generate an error:
int addition = 10 + "10";
Here, a string type cannot be added with an integer type.

Strong typed language minimize errors while running the program because most of the errors will have been corrected before running the program. 

Some examples of strongly typed languages are C and Java.


Viva Voce on Strong Typing

Q1. What is strong type language?
Ans - A strongly-typed programming language is one in which each type of data (such as integer, character, hexadecimal, packed decimal, and so forth) is predefined as part of the programming language and all constants or variables defined for a given program must be described with one of the data types.

Q2. Is strong type language predefined part of language?
Ans- Yes.

Q3. In Strongly typed language errors are maximize or minimize?
Ans – Minimize.

Q4. In this Strongly typed language are slower / faster ?
Ans- It is faster.

Q5. Write some examples of strong typed language?
Ans- SQL, C , Java.

Q6. A language is strongly typed if there are compile-time or run-time checks for what?
Ans- it check the type constraint violations. If no checking is done, it is weakly typed.

Q7. what is the rule of strong typed language?
Ans- Generally, a strongly typed language has stricter typing rules at compile time, which implies that errors and exceptions are more likely to happen during compilation.

Q8. A language is strongly typed if the type of its data objects is fixed or not?
Ans- Yes, A language is strongly typed if the type of its data objects is fixed.

Q9.A language is weakly typed if the type of its data objects is changeable or not?
Ans- If the type of a datum can change.

Principles of Programming Languages

EasyExamNotes.com covered following topics in PPL.

Practicals:
Previous years solved papers:
A list of Video lectures
References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.