Array list, Linkedlist, Stack, Queue, binary tree, hash table
What are their respective logical and physical / storage structures?
i am asking this question note what are their respective logical and physical / storage structures?
Answer)
The logical unit for any space allocation could be as data blocks, segments, tablespaces or etc where every physical level would have the data that would be stored in data file on that of the disk. Such data present in the data file would be stored in an operating system block.
Example: Oracle ASM disk is considered to be a physical disk or the partition which has the logical unit number from among the storable array, the volume to be logical or network format.
With regards to the above question.
The physical data structure would be the linked list, array list while the logical data structure would be the stack, queue, trees, hashtable etc.
Array or the linkedlist are mostly physically present while queue or stack, tree, hash table are mostly build on the framework of the array or linkedlist.
Please comment if you need any other inputs.
Share a like if you find the answer helpful. This would help us
learn and share our learning better.
Thank you.
Array list, Linkedlist, Stack, Queue, binary tree, hash table What are their respective logical and physical...
Array list, linked list, Stack, Queue, Binary tree, Hash table. In which cases do they apply to (combined with time complexity analysis) please answer the question completely note: which cases do they apply to (combined with time complexity analysis)
Array list, linked list, Stack, Queue, Binary tree, Hash table At least one application example combining data structure and algorithm should be given.
Binary tree please answer these two question properly about binary tree Q(1) What are their respective logical and physical / storage structures .Q(2) At least one application example combining data structure and algorithm should be given.
Queue data structure: please answer these two question properly Q(1) What are their respective logical and physical / storage structures .Q(2) At least one application example combining data structure and algorithm should be given.
Linked list: 1) What are their respective logical and physical / storage structures .2) At least one application example combining data structure and algorithm should be given. please answer these two questions properly
please answer these two questions properly about Stack data structure Q(1) What are their respective logical and physical / storage structures .Q(2) At least one application example combining data structure and algorithm should be given.
1. a. Stack b. Queue c. Priority Queue d. List - (ADTs) Given the following steps: push( "Jane" ); push( "Jess" ); push( "Jill" ); push( pop() ); push( "Jim" ); String name = pop(); push( peek() ); Write separate programs for each of the data structures Stack, Queue, PriorityQueue, and List. Use the appropriate push(), pop(), peek() for each of the respective ADT's. Use the Java class library of the ADT's as opposed to the author's implementation. What is in...
The Task: Create a console application that prompts the user to select either a stack, queue, linked list, or binary search tree. Then prompt the user for a number that will then be passed to a recursive function that will populate an array in ascending order. If user selected binary search tree, they will then be prompted to choose how the data will be received either in-order, preorder, or post-order. If user selected linked list, they will then be prompted...
Short answer in your own word: 1. Describe the role of a “Back-End” computer engineer in creating software. Give examples of decisions back end engineers make. Use the relationship between long-term and short-term memory as context for decision examples. 2. Identify Stack or Heap storage in RAM. a) Hash Map with static array as underlying storage b) Doubly Linked LIst - Stack Implementation c) Binary Search Tree with 10,000 Nodes d) Static Array - Stack Implementation c) Doubly Linked List...
Tree & Hash Table & Heap Use the following integer keys 73, 58, 91, 42, 60, 130, 64, 87 to perform the followings: a) Binary Search Tree - Draw a binary search tree - Retrieve the integers keys in post-order - Retrieve the integers keys in pre-order - Draw a binary search tree after node 58 is deleted b) Create a Hash Table using the methods described below. Show the final array after all integer keys are inserted. Assumes that...