Computer Knowledge

Data Structures and Algorithms

1,518 Questions

Data Structures and Algorithms form the core of computer science, focusing on arrays, linked lists, trees, and sorting mechanisms. These concepts are essential for solving complex computational problems efficiently. Test takers preparing for technical and administrative IT exams will find these questions highly relevant.

Array OperationsLinked List ApplicationsSorting AlgorithmsTree Data StructuresMultilevel IndexingAlgorithm Time Complexity

Data Structures and Algorithms Questions

Multiple choice technology databases

Database Key is a combination of

  1. Record Number

  2. Page Number

  3. Area Name

  4. Page Name

  5. Area Code

  6. Record Name
Reveal answer Fill a bubble to check yourself
A,B,E Correct answer
Explanation

A database key uniquely identifies a specific record and consists of three components: the record number within its page, the page number within the area, and the area code. This combination ensures each record has a unique address across the entire database.

Multiple choice technology databases

In a set ORDER is defined as LAST. When we insert a new member record occurence, this record will become.

  1. last member of the set

  2. first member of the set

  3. will be inserted after the current location in the set

  4. will be inserted before the current location in the set
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

When ORDER is LAST, new member records are inserted at the end of the set, making them the last member. This maintains insertion order where newer records always follow existing ones.

Multiple choice technology databases

In a set ORDER is defined as FIRST. When we insert a new member record occurence, this record will become.

  1. last member of the set

  2. first member of the set

  3. will be inserted after the current member in the set

  4. will be inserted before the current member in the set
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

When ORDER is FIRST, new member records are inserted at the beginning of the set, becoming the first member. This means newer records appear before older ones in the set order.

Multiple choice technology databases

In a set ORDER is defined as NEXT. When we insert a new member record occurence, this record will become.

  1. last member of the set

  2. first member of the set

  3. will be inserted after the current member in the set

  4. will be inserted before the current member in the set
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

In COBOL sets, when ORDER is defined as NEXT, new member occurrences are inserted immediately after the current member of the set. This is the standard behavior for NEXT-ordered set insertion in COBOL database systems.

Multiple choice technology databases

In a set ORDER is defined as PRIOR. When we insert a new member record occurence, this record will become.

  1. last member of the set

  2. first member of the set

  3. will be inserted after the current member in the set

  4. will be inserted before the current member in the set
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

In a CODASYL database, when a set's member order is defined as PRIOR, inserting a new member record inserts it immediately before the current record of the set. Options specifying last, first, or after the current member do not match the definition of the PRIOR order.

Multiple choice technology programming languages

push (@array, @sublist);

  1. splice (@array, 0, 1);

  2. splice (@array, @array-1, 1);

  3. splice (@array, scalar(@array), 0, @sublist);

  4. splice (@array, 0, 0, @sublist);
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

push appends @sublist to the end of @array. splice(@array, scalar(@array), 0, @sublist) inserts @sublist at position equal to the array's length (the end), without removing any elements (0 elements removed).

Multiple choice technology programming languages

The attribute information includes the variable’s name, type, ......

  1. Length

  2. Format

  3. Informat

  4. Label
Reveal answer Fill a bubble to check yourself
A,B,C,D Correct answer
Explanation

In SAS, variable attributes define the properties of a variable. The name identifies the variable, type determines if it's numeric or character, length defines storage size, label provides a descriptive text, format controls output appearance, and informat specifies how to read raw data values. All four options listed are valid SAS variable attributes.

Multiple choice technology platforms and products

OWB allows you to create Error-free code

  1. True

  2. False
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

OWB generates validated, deployment-ready code through its design environment with built-in validation and error checking. While no tool guarantees absolutely error-free code in all scenarios, OWB's code generation engine is designed to produce syntactically correct and executable code.

Multiple choice technology platforms and products

OWB allows you to create Error-free code

  1. True

  2. False
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

OWB (Oracle Warehouse Builder) includes validation features, code generation capabilities, and debugging tools that help reduce errors in ETL code. It provides a structured environment that minimizes manual coding errors through its visual design interface and built-in validation rules.

Multiple choice technology testing

The length of the array can be get by the method

  1. length(array)

  2. unbound(array)

  3. ubound(array)

  4. count(array)
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

In VBScript (used by QTP), UBound(array) returns the highest index of an array, which equals length minus one for zero-based arrays. LBound returns the lowest index, typically zero.