Skip to main content

Common Language Runtime and Features, .NET Framework: Introduction to Sql Server

Earlier article was about .Net Framework and its components. In this article we will discuss about the remaining component i.e. Common Language Runtime, the important among all.

The CLR, Common Language Runtime, is one of the most essential components of the .NET Framework. It provides an environment for the application to run. The CLR or the runtime provides functionalities, such as exception handling, security, debugging, and versioning support to the applications.

Here're some of the features provided by the CLR:


  • Automatic memory management: allocates and de-allocates memory to the application as and when required.
  • Standard type system: provides a set of common data types in the form of Common Type System (CTS). This means that the size of integer and long variables is the same across all programming languages.
  • Language Inter-operability: provides the ability of an application to interact with another application written in a different programming language. This also helps maximize code reuse.
  • Platform independence: allows execution of a code from any platform that supports the .NET CLR.
  • Security management: applies restrictions on the code to access the resources of a computer.

The CLR can host a variety of languages and offers a common set of tools across these languages, ensuring inter-operability between the codes. The code developed with a language compiler that targets the CLR is called a managed code.

Alternatively, the code that is developed without considering the conventions and requirements of the common language runtime is called unmanaged code. Unmanaged code executes in the common language runtime environment with minimal services. For example, unmanaged code may run with limited debugging and without the garbage collection process.

The components of SQL Server and the .NET Framework provide various features to the database server. These features help the developers to manage data in an efficient way.

Read Also: SQL Server Features and SQL Intro

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …