Four-class labels
int64 0
3
| Binary labels
int64 0
1
| Entity
stringlengths 8
33
| Definition1
stringlengths 15
259
| Definition2
stringlengths 14
253
|
|---|---|---|---|---|
3 | 1 | secondary storage | provides permanent or nonvolatile storage. using secondary storage devices, data and programs can be retained after the computer has been shut off. | nonvolatile, permanent storage, holds data when computer is off or during course of a program operation. |
3 | 1 | secondary storage | storage that is remote to the cpu and permanently holds data, even when the pc is turned off, such as a hard drive. - it is non-volatile | storage that is remote to the cpu and permanently holds data, even when the pc is turned off, such as a hard drive or flash drive fixed or removable permanent* |
2 | 1 | secondary storage | storage that is remote to the cpu and permanently holds data, even when the power is turned off. | retains data after the computer is turned off or in a space separate from the computer |
1 | 0 | secondary storage | holds data and programs for long periods of time. | place where programs are stored long term even when there is no power on the computer |
3 | 1 | secondary storage | big category of storage devices for data and programs that will not delete when power is off. permanent, non-volatile | nonvolatile storage stores programs and data regardless of power |
0 | 0 | secondary storage | not directly accessible to the processor because data has to be transferred into ram | nonvolatile external device used to store information. includes magnetic, optical and electrical storage. |
3 | 1 | secondary storage | holds data and programs even when powered off. (3 types: hard disk, sss, optical disc) | non-volatile storage used to store programs and files that need to be kept even when the power is not on |
2 | 1 | secondary storage | long term storage device for programs and data. may be magnetic or solid state. | is non volatile storage, does contain storage after the computer system is turned off |
1 | 0 | secondary storage | hard disk/drive. the hard disk has enormous storage capacity compared to main memory. found inside the case of your computer. | holds data and programs even when powered off. (3 types: hard disk, sss, optical disc) |
1 | 0 | secondary storage | is non volatile storage, does contain storage after the computer system is turned off | storage that is more permanent and often larger than the main memory. |
1 | 0 | secondary storage | storage that is saved even when computer turns off, i.e. the hard drive | secondary storage (sometimes called backing storage) is the name for all of the devices (apart from rom and ram) that can store data in a computer system |
3 | 1 | secondary storage | storage within a computer for storing files long term | the long term non-volatile storage of data |
3 | 1 | secondary storage | long-term program and data storage (hard disk, cd, etc) | holds data and programs for long periods of time (ex. hard drive, flash drive, cloud storage, cd) |
3 | 1 | secondary storage | long-term program and data storage (hard disk, cd, etc) | storage that is saved even when computer turns off, i.e. the hard drive |
1 | 0 | secondary storage | long-term program and data storage (hard disk, cd, etc) | storage that is remote to the cpu and permanently holds data, even when the pc is turned off, such as a hard drive. |
1 | 0 | secondary storage | external data storage used to store data so that the computer can be switched off. | the long term non-volatile storage of data |
3 | 1 | secondary storage | long term storage such as a hard drive or thumb drive. described as &"persistent&" since its data persists even without electricity. | non-volatile storage used to store programs and files that need to be kept even when the power is not on |
2 | 1 | secondary storage | long-term program and data storage (hard disk, cd, etc) | long term storage such as a hard drive or thumb drive. described as &"persistent&" since its data persists even without electricity. |
1 | 0 | secondary storage | non volatile memory that can store the os, applications and files permanently. | slower than other types of memory |
1 | 0 | secondary storage | long-term storage for instructions and data that a central processing unit does not need at the moment, but is expected to need in the future. | storage that is more permanent and often larger than the main memory. |
2 | 1 | secondary storage | -stores information permanently -in order to transfer info, mm and secondary storage must be directly connected -ex: hard disks, flash drives, and cd-roms | secondary storage (sometimes called backing storage) is the name for all of the devices (apart from rom and ram) that can store data in a computer system |
0 | 0 | secondary storage | external devices such as servers are referred to as | auxiliary, external, or permanent storage on devices or servers. |
0 | 0 | secondary storage | a device that stores data for a long period of time. includes hard disk drives, solid-state drives, and off-line storage (cds, dvds, dvd-ram and blu-ray disks) | can be removable, internal or external storage: -magnetic storage (hard drives) -optical storage (cd-rom discs) -flash memory (ssds, memory sticks) |
1 | 0 | secondary storage | long term storage of data, files, software, operating system. | external data storage used to store data so that the computer can be switched off. |
3 | 1 | secondary storage | a device that stores large amounts of data, instructions, and information more permanently than allowed with main memory. | also called permanent storage - for computer systems that need to store larger amounts of data more permanently than main memory allows |
0 | 0 | secondary storage | not directly accessible to the processor because data has to be transferred into ram | long term, non-volatile storage media such as hard disks, memory sticks, magnetic tapes and cds |
3 | 1 | secondary storage | storage that is saved even when computer turns off, i.e. the hard drive | holds data and programs even when powered off. (3 types: hard disk, sss, optical disc) |
0 | 0 | secondary storage | -stores information permanently -in order to transfer info, mm and secondary storage must be directly connected -ex: hard disks, flash drives, and cd-roms | long term storage such as a hard drive or thumb drive. described as &"persistent&" since its data persists even without electricity. |
2 | 1 | secondary storage | storage that is saved even when computer turns off, i.e. the hard drive | holds data and programs for long periods of time (ex. hard drive, flash drive, cloud storage, cd) |
0 | 0 | memory errors | if memory is a network, events are not filed away distinctly. memory made of nodes that either aid in retrieval or lead to false recollection | - errors of commission - errors of ommission |
0 | 0 | memory errors | code that surpasses your computer's memory. mistakes such as forgetting something, combining two or more memories into one, or actually creating false memories | - errors of commission - errors of ommission |
0 | 0 | memory errors | code that surpasses your computer's memory. mistakes such as forgetting something, combining two or more memories into one, or actually creating false memories | if memory is a network, events are not filed away distinctly. memory made of nodes that either aid in retrieval or lead to false recollection |
0 | 0 | relational model | collection of tables to represent data and relationship among data that is represemted through model. | the basis of today's database management systems, which make the data appear as a two-dimensional table |
3 | 1 | relational model | all data is logically structured within relations (tables). contains attributes and tuples. | - database is a collection of relations - each relation has attributes and a collection of tuples |
1 | 0 | relational model | a model to show a database which uses tables to describe the relations between data | a database model in which data and the relationships among them are organized into tables using key values to match |
2 | 1 | relational model | views database as a collection of two dimensional tables no complicated pointers or lists use of relational algebra. selections and joins | portrays data in the form of 2 dimensional tables -its strength is the ease with which tables may be linked to one another based on data relationships |
3 | 1 | relational model | -based on set theory and mathematical relations -data is logically arranged in tables -relationships are represented using values stored in tables (entities) -data organized as two-dimensional tables | a database model that describes data in which all data elements are placed in two-dimensional tables, called relations, which are the logical equivalent of files. |
1 | 0 | relational model | ted codd introduced this model using relational calculus and relational algebra | the relational model of data is based on the concept of a relation proposed in 1970 by e.f. codd (ibm), first commercial system in 1981-82. |
3 | 1 | relational model | this model uses a two-dimensional table of rows and columns of data. rows are records (also called tuples), and columns are fields (also referred to as attributes) | most popular two dimensional table of rows and columns rows are records (tuples) columns are fields (attributes) |
1 | 0 | relational model | mimics the structure of a relational database closely enough that you can actually sit down and start building the database. | data are organized in two-dimensional tables called relations. the tables are related to each other by way of shared primary key the most popular model. |
0 | 0 | relational model | views database as a collection of two dimensional tables no complicated pointers or lists use of relational algebra. selections and joins | mimics the structure of a relational database closely enough that you can actually sit down and start building the database. |
2 | 1 | relational model | introduced in 1970, e.f codd created, an ibm manager based on &"relational algebra,&" which is now the standard model for commercial (relational) dbms products. | the relational model of data is based on the concept of a relation proposed in 1970 by e.f. codd (ibm), first commercial system in 1981-82. |
1 | 0 | relational model | represents data as a collection of relations | collection of tables to represent data and relationship among data that is represemted through model. |
3 | 1 | relational model | uses a two dimensional table of rows and columns of data - each row recorded in a table - each column is a field or attribute of the records | uses a two-dimensional table of rows (records) and columns (fields) of data |
2 | 1 | relational model | data are organized in two-dimensional tables called relations. the tables are related to each other by way of shared primary key the most popular model. | portrays data in the form of 2 dimensional tables -its strength is the ease with which tables may be linked to one another based on data relationships |
3 | 1 | relational model | this model uses a two-dimensional table of rows and columns of data. rows are records (also called tuples), and columns are fields (also referred to as attributes) | uses a 2-d table of rows and columns of data. rows are records (also called tuples), and columns are fields (also called attributes). |
3 | 1 | relational model | uses a 2-d table of rows and columns of data. rows are records (also called tuples), and columns are fields (also called attributes). | most popular two dimensional table of rows and columns rows are records (tuples) columns are fields (attributes) |
2 | 1 | relational model | views database as a collection of two dimensional tables no complicated pointers or lists use of relational algebra. selections and joins | data are organized in two-dimensional tables called relations. the tables are related to each other by way of shared primary key the most popular model. |
3 | 1 | relational model | uses a two-dimensional table of rows and columns of data rows are records and columns are fields | uses a two dimensional table of rows and columns of data - each row recorded in a table - each column is a field or attribute of the records |
3 | 1 | relational model | uses a two-dimensional table of rows and columns of data rows are records and columns are fields | uses a two-dimensional table of rows (records) and columns (fields) of data |
1 | 0 | relational model | introduced in 1970, e.f codd created, an ibm manager based on &"relational algebra,&" which is now the standard model for commercial (relational) dbms products. | all relational database dbms products are built on this model -e.f. codd applied the concepts of a branch of math called relational algebra to the problem of databases |
1 | 0 | relational model | based on mathematical set theory and represents data as independent relations | it is a mathematical concept known as a relation. |
1 | 0 | relational model | represents data as a collection of relations | the basis of today's database management systems, which make the data appear as a two-dimensional table |
1 | 0 | relational model | all relational database dbms products are built on this model -e.f. codd applied the concepts of a branch of math called relational algebra to the problem of databases | ted codd introduced this model using relational calculus and relational algebra |
3 | 1 | dynamic analysis | type of check that is performed on code while it is running | a method of testing code that checks the code as it is running. |
1 | 0 | dynamic analysis | actual program execution to expose possible program failure | - done when the program is running - program monitors - coverage of the test cases given in summary statistics |
0 | 0 | dynamic analysis | exam code while the software is executed. fed inputs and checking outputs. | the process of checking an application, or at least a piece of an application, by running the code and observing the logic, inputs, interface, and memory management. |
1 | 0 | dynamic analysis | exam code while the software is executed. fed inputs and checking outputs. | send random input to an application to see if it can handle the data or have any other problems. |
2 | 1 | dynamic analysis | a type of software testing in which a program is executed and the results of this execution are examined | detailed examination of code while it is executing |
0 | 0 | dynamic analysis | performed while the software is executed, either on a target system or an emulated system | the process of evaluating behavior , e.g., memory performance, cpu usage, of a system or component during execution. |
0 | 0 | dynamic analysis | - examine execution trace of code - allows you to get closer to what is actually happening before (or as) the bug is encountered | code fuzzing, checks the code as it is running, by sending random data |
0 | 0 | dynamic analysis | runs an instrumented program in a controlled manner to collect info that can be analyzed to learn about a certain property (think: treadmill heart study analogy) | when a program is being analyzed while being executed it's called for an dynamic analysis. it's recommended that you use virtual machine to avoid getting your computer any malwares. |
3 | 1 | dynamic analysis | a type of software testing in which a program is executed and the results of this execution are examined | involves execution the program and observing the outcomes |
1 | 0 | dynamic analysis | the process of checking an application, or at least a piece of an application, by running the code and observing the logic, inputs, interface, and memory management. | send random input to an application to see if it can handle the data or have any other problems. |
0 | 0 | dynamic analysis | exam code while the software is executed. fed inputs and checking outputs. | - debug running process - memory dumps - system calls / library call / instruction trace - network packet captures |
1 | 0 | dynamic analysis | performed while the software is executed | detailed examination of code while it is executing |
2 | 1 | dynamic analysis | checks the code as it is running. sometimes uses fuzzing or random data. | code fuzzing, checks the code as it is running, by sending random data |
1 | 0 | dynamic analysis | performed while the software is executed | a type of software testing in which a program is executed and the results of this execution are examined |
1 | 0 | dynamic analysis | performed while the software is executed | involves execution the program and observing the outcomes |
1 | 0 | file system | used to control how data is stored and accessed. groups data to make it easy to identify where one piece of info begins and ends. groups known files. | an organized method to save and retrieve files |
1 | 0 | file system | os component that controls and manages storage and retrieval of files in a compute system | a method used by operating systems to store, retrieve, and organize files. |
2 | 1 | file system | a hierarchy of files and their respective directories, responsible for determining allocated and unallocated storage space | the method and format an os uses to store, locate, and retrieve files from electronic storage media. |
1 | 0 | file system | resides on secondary storage provides efficient and convenient access to disk and by allowing data to be stored, located and retrieved easily | provides user interface to storage, mapping logical to physical and provides efficient and convenient access to disk by allowing data to be stored, located, retrieved easily |
1 | 0 | file system | resides on secondary storage provides efficient and convenient access to disk and by allowing data to be stored, located and retrieved easily | a process that manages how and where data on a storage disk is stored, accessed and managed. |
3 | 1 | file system | the overall structure that an os uses to name, store, and organize files on a disk. examples are ntfs and fat32. | the overall structure your computer uses to name, store, and organize files and folders on a hard disk or partition. |
3 | 1 | file system | the part of the operating system on a computer that controls how files are organized and stored. | the methods and structures used by the os to organize and manage files stored on disk |
1 | 0 | file system | - implementation of abstraction (files) for secondary storage - logical organization into directories - sharing of data between processes, people, machines - access control | allows operating systems to manage and find files on storage, specifying organisation, writing, associated metadata, and physical storage location |
1 | 0 | file system | a collection of information maintained long term on behalf of the users of a computer system which consist of files and directory structures | the overall structure in which files are named, stored, and organized. a file system consists of files, directories (or folders), and the information needed to locate and access these items. |
0 | 0 | file system | can be general or special-purpose | provides the input and output mechanisms for the operating system. |
3 | 1 | file system | resides on the disks. provides ui to storage, mapping logical to physical | resides on secondary storage. provides user interface to storage, mapping logical to physical addresses |
3 | 1 | file system | the part of the operating system on a computer that controls how files are organized and stored. | os component that controls and manages storage and retrieval of files in a compute system |
3 | 1 | file system | the methods and structures used by the os to organize and manage files stored on disk | os component that controls and manages storage and retrieval of files in a compute system |
3 | 1 | file system | keeps track of names and locations of files that reside on a storage medium | technique used to keep track of files and their storage locations |
3 | 1 | file system | used by os to keep track of names and locations of files | technique used to keep track of files and their storage locations |
2 | 1 | file system | used by os to keep track of names and locations of files | keeps track of names and locations of files that reside on a storage medium |
2 | 1 | file system | a collection of information maintained long term on behalf of the users of a computer system which consist of files and directory structures | describes the use of files as a data repository, where each file contains rows of data organized as data structures. |
2 | 1 | file system | is how we manage these files. | how files are managed and placed within an operating system. |
3 | 1 | access time | amount of time it takes to complete a request for data to be retrieved from storage | the average time taken for a device to search and read the required data on the storage medium. |
2 | 1 | access time | the estimated time for a storage device to locate data on a disk, usually measured in milliseconds. | amount of time it takes to complete a request for data to be retrieved from storage |
3 | 1 | access time | (computer science) the interval between the time data is requested by the system and the time the data is provided by the drive | the average time it takes a computer to locate data on the storage medium and read it |
2 | 1 | access time | the estimated time for a storage device to locate data on a disk, usually measured in milliseconds. | the average time taken for a device to search and read the required data on the storage medium. |
2 | 1 | access time | the amount of time required for a disk drive's read/write head to locate data on the surface of a disk. | the time to read or write a disk page, made up of seek time + rotation delay + transfer time |
2 | 1 | access time | the time to read or write a disk page, made up of seek time + rotation delay + transfer time | seek time + latency + transfer time; unequal amounts of time: seek > latency > transfer |
1 | 0 | access time | the time between a computer's request for data and the completion of the transfer of that data is called...... | the average time taken for a device to search and read the required data on the storage medium. |
1 | 0 | access time | the amount of time required for a disk drive's read/write head to locate data on the surface of a disk. | seek time + latency + transfer time; unequal amounts of time: seek > latency > transfer |
3 | 1 | access time | the time between a computer's request for data and the completion of the transfer of that data is called...... | amount of time it takes to complete a request for data to be retrieved from storage |
0 | 0 | access time | the time between a computer's request for data and the completion of the transfer of that data is called...... | the estimated time for a storage device to locate data on a disk, usually measured in milliseconds. |
2 | 1 | access time | the average time taken for a device to search and read the required data on the storage medium. | the time it takes a storage device to locate its stored data |
1 | 0 | access time | the time between a computer's request for data and the completion of the transfer of that data is called...... | the time it takes a storage device to locate its stored data |
3 | 1 | access time | how long it takes to retrieve data from a memory location. | this is the time taken to read data from a given memory location. made up of latency & transfer time. |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.