Skip to main content

Featured Post

How to use Tabs in ASP.NET CORE

I want to show Components in a tabs , so first of all create few components. In this project we have three components, First View Component  public class AllViewComponent : ViewComponent     {         private readonly UserManager<ApplicationUser> _userManager;         public AllViewComponent(UserManager<ApplicationUser> userManager)         {             _userManager = userManager;         }         public async Task<IViewComponentResult> InvokeAsync()         {             List<StudentViewModel> allUsers = new List<StudentViewModel>();             var items = await _userManager.Users.ToListAsync();             foreach (var item in items)             {                 allUsers.Add(new StudentViewModel {Id=item.Id, EnrollmentNo = item.EnrollmentNo, FatherName = item.FatherName, Name = item.Name, Age = item.Age, Birthdate = item.Birthdate, Address = item.Address, Gender = item.Gender, Email = item.Email });             }            

Introduction of Structure in DataStructure, C Programming

       The standard data types available in any programming language like “C” cannot meet every need of the user his for data handling. It is not possible to implement s all real life activities and entities by using only standard data types. So the help of available standard data type by clubbing them into a single unit. Structures are user defined data types, which are used to club dissimilar data member into a single unit. That unit is the new user defined data type and can be used to declare the data variables according to the requirement.
             Usually the structures are defined to club the similar, related characteristics of an object derived as new data type.

Defining a structure  

            A structure is defined using a keyword struct and giving a name to the structure data type and declaring each individual members (elements) as normal declaration in a block (i.e., within a pair of curly brackets, {}) and ending the block by semicolon; because of data definition. The syntax of structure definition is as follows:
        struct datatype_name
        {
        Member1 declaration;
        …
       Membern declaration;
        };
Here “struct” is a key word. Datatype_name can be any valid identifier, used as a name for new data type. For example, an employee structure may be defined as:
        Struct emp
           {
             Int eno;
             Char ename [21];
             Float salary;
           };
Here “struct emp” is a new user defined data type (note: not a variable) and can be used to declare the variables of that type, like struct emp e1, e2, earr[10] etc. The variables defied inside the struct like eno, ename  and salary are the members of struct emp and are also called as elements of the structure. With the help of a variable of the type struct emp, the individual members (elements) may be referred by means of dot (.) operator also called as member access operator. At the time of defining data type the variables may be declared after closing curly bracket ‘}’, before the semi colon ‘;’ as shown below:
struct emp
{
 Int eno;
 char ename [21];
 float salary;
} e1,e2;
The structure variables can be initialized at the time of declaration as follows:
struct emp
{
  Int eno;
  Char ename [21];
  Float salary;
} e1={101,”Sachin”, 12360.55};


Comments

Popular Post

Polynomial representation using Linked List for Data Structure in 'C'

Polynomial representation using Linked List The linked list can be used to represent a polynomial of any degree. Simply the information field is changed according to the number of variables used in the polynomial. If a single variable is used in the polynomial the information field of the node contains two parts: one for coefficient of variable and the other for degree of variable. Let us consider an example to represent a polynomial using linked list as follows: Polynomial:      3x 3 -4x 2 +2x-9 Linked List: In the above linked list, the external pointer ‘ROOT’ point to the first node of the linked list. The first node of the linked list contains the information about the variable with the highest degree. The first node points to the next node with next lowest degree of the variable. Representation of a polynomial using the linked list is beneficial when the operations on the polynomial like addition and subtractions are performed. The resulting polynomial can also

How to use Tabs in ASP.NET CORE

I want to show Components in a tabs , so first of all create few components. In this project we have three components, First View Component  public class AllViewComponent : ViewComponent     {         private readonly UserManager<ApplicationUser> _userManager;         public AllViewComponent(UserManager<ApplicationUser> userManager)         {             _userManager = userManager;         }         public async Task<IViewComponentResult> InvokeAsync()         {             List<StudentViewModel> allUsers = new List<StudentViewModel>();             var items = await _userManager.Users.ToListAsync();             foreach (var item in items)             {                 allUsers.Add(new StudentViewModel {Id=item.Id, EnrollmentNo = item.EnrollmentNo, FatherName = item.FatherName, Name = item.Name, Age = item.Age, Birthdate = item.Birthdate, Address = item.Address, Gender = item.Gender, Email = item.Email });             }            

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