0
array
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
How can you add different type of data in a stack?
stack is a linear data structure in which data item is either inserted or deleted at one end there are mainly two operations performed on stack.they're push poppush:writing a value to the stack is push or moving the stack pointer up to accomodatethe new item. pop:reading a value from stack or moving the stack pointer down.
What is data structure why is an array called a data structure which are the other data structures?
A data structure is a collection of more than one elementary item, in some kind of aggregate organization. An array is a type of structure where more than one item of the same type are arranged serially in memory, and accessed using an index. The item can either be an elementary type or it itself can be a structure type. A struct (not to be confused with the use of "structure" in this answer) is a type of structure where more than one item of the same or different types are arranged serially in memory, and accessed using the structure member (.) operator. A union is similar to a struct, except that each member occupies the same address. This means that only one type of data can be stored at any one time in a union. A self-referential structure is a type of structure, usually constructed of simpler structures, linked together with some kind of pointer scheme. Examples of this are the linked list and tree.
How is the stack and stack pointer work?
A stack is a data structure in which last item inserted is taken out first . That's why they are known as LIFO (last in first out). Inserting an item in stack is termed as push and taking an item out from stack I s termed as pop. Stack pointer is the pointer that points to the top of the stack or that points the item at the top of the stack and help in adding or deleting the item from the top of stack.
What is the difference between a data type and a data structure?
Data type can be regarded as data structure because we can define our own data type by using typed function. Data types are the category in which the variable are listed to hold the specific value and data structures are the way in which the values and variables are stored in the memory. The use of a data type called structures allows a collection of values possibly of different types to be treated as a single item. Each data structure is built up from the basic data types of the underlying programming language using the available data structuring facilities, such as arrays & pointers
Difference between linear n nonlinear data structures?
A data structure is linear if every item is related (or attatched) to its previous and next item(e.g.array, linked list) and it is non-linear if every item is attached to many other items in specific ways to reflect relationships(e.g, n-ary tree). In linear data structure data items are arranged in a linear sequence. In non-linear data structure data items are not in a sequence. A different Opinion (learnt while watching a video on Data Structures) is that Linear data structures are the Data structures implemented using arrays (with consecutive data allocation for each member of the array) while Non Linear Data Structure refers to an implementation in terms of use of pointers (such as a linked list). --Research Reqd.--
Difference between catalog and schema?
A catalog is a set of tables which contains the definitions or descriptions of the database structure and its constraints. For example it could store the structure of each file +Type and Format of each data item stored in the file. A catalog is a type of schema and a schema is what defines a data elements and their interrelationships.
How can you add different type of data in a stack?
stack is a linear data structure in which data item is either inserted or deleted at one end there are mainly two operations performed on stack.they're push poppush:writing a value to the stack is push or moving the stack pointer up to accomodatethe new item. pop:reading a value from stack or moving the stack pointer down.
What is data structure why is an array called a data structure which are the other data structures?
A data structure is a collection of more than one elementary item, in some kind of aggregate organization. An array is a type of structure where more than one item of the same type are arranged serially in memory, and accessed using an index. The item can either be an elementary type or it itself can be a structure type. A struct (not to be confused with the use of "structure" in this answer) is a type of structure where more than one item of the same or different types are arranged serially in memory, and accessed using the structure member (.) operator. A union is similar to a struct, except that each member occupies the same address. This means that only one type of data can be stored at any one time in a union. A self-referential structure is a type of structure, usually constructed of simpler structures, linked together with some kind of pointer scheme. Examples of this are the linked list and tree.
What is a descriptive word for each item in a record called in Microsoft access?
It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.It could be called a data item, or a field or attribute.
Is a plastic cup homogeneous?
Homogeneous can it be used as one substance
Are tacos homogeneous mixtures?
yes
What is the difference between a queue and a stack with example?
A stack is a data structure in which last item inserted is taken out first . That's why they are known as LIFO (last in first out). Inserting an item in stack is termed as push and taking an item out from stack I s termed as pop. Stack pointer is the pointer that points to the top of the stack or that points the item at the top of the stack and help in adding or deleting the item from the top of stack. The queue is a linear data structure where operations of insertion and deletion are performed at separate ends also known as front and rear. Queue is a FIFO structure that is first in first out. types of queues : circular, linear, double ended and priority
What is the data item with the greatest frequency called?
The data item with the greatest frequency is the mode.
What 40GB means?
40 gigabytes= 40,000 megabytes= 40,000,000 kilobytes They are terms used for how much data you can store on an item. One well known item is a camera. GB= gigabytes
What is 'comma delimited format'?
Also referred to as comma-separated format (CSV), this format is a way to store data by separating each field with a comma.EXAMPLE: first item, second item, third item, fourth item, fifth item, etc.Other delimited formats can use other characters as a delimiter to identify the difference between each field in a collection of data (database).OTHER EXAMPLES:"first item" "second item" "third item" "fourth item" "fifth item", etc.first item; second item; third item; fourth item; fifth item; etc.first_item second_item third_item fourth_item fifth_item, etc.
What to Compare and contrast between stack and queue?
A stack is a data structure in which last item inserted is taken out first . That's why they are known as LIFO (last in first out). Inserting an item in stack is termed as push and taking an item out from stack I s termed as pop. Some applications of stack are : Polish notation, reversing string, backtracking , quick sort algorithm etc. The queue is a linear data structure where operations od insertion and deletion are performed at separate ends also known as front and rear. Queue is a FIFO structure that is first in first out. Whenever a new item is added to queue, rear pointer is used. and the front pointer is used when an item is deleted from the queue.
Distinct features of queue and stack?
A stack is a data structure in which last item inserted is taken out first . That's why they are known as LIFO (last in first out). Inserting an item in stack is termed as push and taking an item out from stack I s termed as pop. Some applications of stack are : Polish notation, reversing string, backtracking , quick sort algorithm etc. The queue is a linear data structure where operations od insertion and deletion are performed at separate ends also known as front and rear. Queue is a FIFO structure that is first in first out. Whenever a new item is added to queue, rear pointer is used. and the front pointer is used when an item is deleted from the queue.
