• ¿Documento equivocado? Cámbialo gratis
  • Escrito por estudiantes que aprobaron
  • Inmediatamente disponible después del pago
  • Leer en línea o como PDF
Vender
¿Dónde estudias?
Tu idioma
Document preview thumbnail
Vista previa 1 fuera de 2 páginas
Examen

Module 1: Introduction to Data Structures and Algorithm Questions and Answers

Document preview thumbnail
Vista previa 1 fuera de 2 páginas

Module 1: Introduction to Data Structures and Algorithm Data Structure - Answer- a particular way of storing and organizing data in a computer so that it can be used efficiently; physical implementation of abstract data type Linear Data Structure - Answer- elements form a sequence or a linear list Non-Linear Data Structure - Answer- elements does not form a sequence or a linear list. Traversal - Answer- travel through the data structure Search - Answer- traversal through the data structure for a given element Insertion - Answer- Adding new elements to the data structure Deletion - Answer- removing an element from the data structure Sorting - Answer- arranging the elements in some type of order Merging - Answer- combining two similar data structures into one Arrays - Answer- linear data structure; a sequence of n items of the same data type that are stored contiguously in computer memory and made accessible by specifying a value of the array's index Properties of Arrays - Answer- fixed length, contiguous memory locations, direct access, insert/delete Linked List - Answer- linear data structure; a sequence of zero or more nodes each containing two kinds of information: some data and one or more links called pointers to other nodes of the linked list Properties of Linked Lists - Answer- dynamic length, arbitrary memory locations, access by following links, insert/delete Stacks - Answer- linear data structure; uses last in first out (LIFO) ordering and allows reading and writing on the top element only Properties of Stacks - Answer- insertion/deletion can be done only at the top, LIFO Two operations in Stacks - Answer- push and pop Queues - Answer- linear data structure; collection with access only to t

Vista previa del contenido

Module 1: Introduction to Data
Structures and Algorithm
Data Structure - Answer- a particular way of storing and organizing data in a
computer so that it can be used efficiently; physical implementation of abstract data
type

Linear Data Structure - Answer- elements form a sequence or a linear list

Non-Linear Data Structure - Answer- elements does not form a sequence or a linear
list.

Traversal - Answer- travel through the data structure

Search - Answer- traversal through the data structure for a given element

Insertion - Answer- Adding new elements to the data structure

Deletion - Answer- removing an element from the data structure

Sorting - Answer- arranging the elements in some type of order

Merging - Answer- combining two similar data structures into one

Arrays - Answer- linear data structure; a sequence of n items of the same data type
that are stored contiguously in computer memory and made accessible by specifying
a value of the array's index

Properties of Arrays - Answer- fixed length, contiguous memory locations, direct
access, insert/delete

Linked List - Answer- linear data structure; a sequence of zero or more nodes each
containing two kinds of information: some data and one or more links called pointers
to other nodes of the linked list

Properties of Linked Lists - Answer- dynamic length, arbitrary memory locations,
access by following links, insert/delete

Stacks - Answer- linear data structure; uses last in first out (LIFO) ordering and
allows reading and writing on the top element only

Properties of Stacks - Answer- insertion/deletion can be done only at the top, LIFO

Two operations in Stacks - Answer- push and pop

Queues - Answer- linear data structure; collection with access only to the term that
has been present the longest; uses first in first out

Información del documento

Subido en
18 de agosto de 2024
Número de páginas
2
Escrito en
2024/2025
Tipo
Examen
Contiene
Preguntas y respuestas
$9.49

¿Documento equivocado? Cámbialo gratis Dentro de los 14 días posteriores a la compra y antes de descargarlo, puedes elegir otro documento. Puedes gastar el importe de nuevo.
Escrito por estudiantes que aprobaron
Inmediatamente disponible después del pago
Leer en línea o como PDF

Seller avatar
Los indicadores de reputación están sujetos a la cantidad de artículos vendidos por una tarifa y las reseñas que ha recibido por esos documentos. Hay tres niveles: Bronce, Plata y Oro. Cuanto mayor reputación, más podrás confiar en la calidad del trabajo del vendedor.
Freshy
3.6
(11)
Vendido
65
Seguidores
4
Artículos
6964
Última venta
1 semana hace



Por qué los estudiantes eligen Stuvia

Creado por compañeros estudiantes, verificado por reseñas

Calidad en la que puedes confiar: escrito por estudiantes que aprobaron y evaluado por otros que han usado estos resúmenes.

¿No estás satisfecho? Elige otro documento

¡No te preocupes! Puedes elegir directamente otro documento que se ajuste mejor a lo que buscas.

Paga como quieras, empieza a estudiar al instante

Sin suscripción, sin compromisos. Paga como estés acostumbrado con tarjeta de crédito y descarga tu documento PDF inmediatamente.

Student with book image

“Comprado, descargado y aprobado. Así de fácil puede ser.”

Alisha Student

Preguntas frecuentes