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
-
the changes in the source table in the database will not be reflected in the source that has been imported
-
N/A
-
do the changes in the source table , close the session and then re-import the data
-
NA
A
Correct answer
Explanation
When you import a source table in Informatica, it creates a static definition of that table structure at the time of import. Changes made later in the actual database are not automatically reflected in the imported source definition or mappings that use it. You must manually re-import or synchronize the source definition to pick up database changes.
B
Correct answer
Explanation
Java arrays are strongly typed - they can only store elements of one declared type. A primitive array like int[] can hold only integers, while an Object[] can hold different types but only those within the same inheritance hierarchy. An array cannot store arbitrary different types like an integer, a string, and a boolean together.
-
The element will not be successfully added
-
ArrayIndexOutOfBounds Exception
-
The Vector allocates space to accommodate up to 15 elements
-
Nothing will happen
C
Correct answer
Explanation
In Java's legacy Vector class, new Vector(5, 10) creates a vector with initial capacity 5 and capacity increment 10. When adding the 6th element exceeds capacity, Vector automatically grows by the increment (10), creating new capacity of 15. This dynamic growth prevents overflow.
-
Reference on Stack
-
Reference on Heap
-
Reference on Stack and the Data it points to on Heap
-
None of the Above
C
Correct answer
Explanation
For reference types in C#, the reference variable itself is stored on the stack (holding the memory address), whereas the actual object instance and its data are allocated on the garbage-collected heap.
-
Physical machines on which PowerCenter services are installed
-
Logical ETL environment
-
ETL and metadata services
-
House keeping the ETL environment
A
Correct answer
Explanation
In Informatica PowerCenter ETL architecture, a node refers to a physical machine or server where PowerCenter services (Integration Service, Repository Service, etc.) are installed. It is not a logical concept or a service itself - it is the hardware infrastructure.
-
Source/Table Name
-
Database Name
-
Source/Table Structure
-
All of the above
D
Correct answer
Explanation
In Informatica PowerCenter Source Analyzer, you can modify the Source/Table Name, Database Name, and Source/Table Structure (such as adding or modifying columns and datatypes). Therefore, 'All of the above' is correct as all these components are editable in the Source Analyzer.
-
Xml
-
VSAM
-
Flat file
-
Relational DB
B,C
Correct answer
Explanation
In IBM MQSeries (WebSphere MQ) mapping, you can define associated source definitions for message data using VSAM (Virtual Storage Access Method) files and Flat files. These are traditional mainframe data sources that MQSeries can interface with. XML is typically handled through specialized XML parsers rather than direct source definitions in this context. Relational databases use different connectivity mechanisms (like ODBC/JDBC) and are not classified as associated source definitions in the same category as VSAM and flat files for MQSeries mappings.
-
Write lock
-
Write-intent lock
-
Read lock
-
Execute lock
-
In-use lock
B,D,E
Correct answer
Explanation
Repository objects use different locks for concurrent access control. Write-intent locks indicate an intent to modify an object. Execute locks prevent conflicts during workflow execution. In-use locks mark objects currently active in a session.
-
getDIServerProperties
-
startWorkflows
-
scheduleWorkflow
-
monitorDIServer
-
startSessionLogFetch
B
Correct answer
Explanation
Data Integration Web Service focuses on execution and monitoring operations. startWorkflows triggers workflow execution which is runtime control, not data integration metadata access. getDIServerProperties, scheduleWorkflow, monitorDIServer, and startSessionLogFetch are valid DI service operations.
-
Retrieves and validates session information from the repository
-
Verifies connection object permissions
-
Sends a request to start worker DTM processes on other nodes when the session is configured to run on a grid
-
Adds partitions to the session when the session is configured for dynamic partitioning
-
None of the Above
A,B,C,D
Correct answer
Explanation
The DTM (Data Transformation Manager) in Informatica PowerCenter performs multiple critical tasks: it retrieves and validates session configuration from the repository (A), verifies that the integration service has proper permissions on connection objects (B), coordinates worker DTM processes across grid nodes for parallel execution (C), and dynamically adds partitions when dynamic partitioning is enabled (D). All four tasks are core DTM responsibilities.
-
Buffer block size
-
Index and data cache size for Aggregator, Rank, Lookup, and Joiner transformations
-
Lookup transformations
-
All the Above
-
None of the above
D
Correct answer
Explanation
When 'collect performance data' is enabled at the session level, Informatica tracks detailed session-specific performance metrics. This includes buffer block sizes used during data flow, cache sizes configured for Aggregator, Rank, Lookup, and Joiner transformations, and detailed statistics for Lookup transformations. All listed metrics (A, B, C) are part of performance data collection.
-
Round Robin
-
Hash Auto Keys
-
Key range
-
Pass-through
-
Database partitioning
C,D,E
Correct answer
Explanation
For Source Qualifier transformations with relational sources, specific partition types are supported. Key range partitioning divides data based on key value ranges. Pass-through partitioning sends rows to partitions without modification. Database partitioning leverages the source database's native partitioning. Round Robin and Hash Auto Keys are NOT valid for relational Source Qualifiers - they're used for other transformation types.
-
Cube
-
Flat file
-
Operational
-
Star schema
C
Correct answer
Explanation
Operational databases (OLTP systems) normalize data to eliminate redundancy and maintain integrity during transaction processing. In contrast, star schemas and cubes deliberately denormalize data for faster analytical queries in data warehouses.
-
It illustrates a parallel relationship.
-
It should be consolidated into one table.
-
. It should be examined for a connection trap.
-
The cardinality between the tables should be reversed.
C
Correct answer
Explanation
The operational structure (typically representing a fan trap or chasm trap where two one-to-many relationships fan out from a central table) must be analyzed for connection traps. Connection traps occur when a pathway between entities is ambiguous, leading to incorrect assumptions about relationships between end tables.
-
Union
-
Normalized
-
Operational
-
Star schema
D
Correct answer
Explanation
A table in a star schema would typically be either a fact table containing measurements and foreign keys to dimensions, or a dimension table containing descriptive attributes. Star schemas organize data into central facts surrounded by descriptive dimensions.