Notes to the Component Test Selenium page objects and associated UI test infrastructure

I firmly believe in TDD and have a lot of experience writing functional integration frameworks and system testing frameworks. I am used to writing unit tests for the system test infrastructure (general code, helper classes, test tools, etc.). But I am not very well acquainted with the latest UI tests with Selenium WebDriver. I understand the page object design pattern and its advantages. And so it seems, of course, that you want to unit-test your page objects in the same way you want to use helper classes and tooling for non-UI unit testing.

But after a long search it seems that this topic hardly ever appears. And I can not find any good advice on how to tackle that. Is that because people simply do not test their UI test infrastructure? Or is it that so few people do it that nobody bothers to write articles about it? And can you recommend articles about things you should or should not do? Some of the best questions I've found online are now 6 to 8 years old, and it seems that this approach has now become established.

This is meant to be a language independent question, but if relevant, we will use Python, PyTest, and the Pytest Selenium plugin in my current project.

Oracle – Copy the package in the production DB into the test DB with dependencies?

This is my first question here. Please let me know if this is not the right place.

I'm a new programmer, fresh from school. Primarily, I'm developing in Python / C #, with a dash of SQL if needed.

In my job, I was assigned a task in PL / SQL that changes some existing procedures. All well and good to learn some new syntax, but no serious obstacles.

My problem is, I have no idea how to migrate the existing packages / views / tables into our test databaseThis is basically a non-maintained sandbox environment.

I just need to copy two stored procedures into a package, two views, and three tables, so I can modify the procedures and see if the output is as expected. However, I think there must be a better way to move this data than "Ctrl + C, Ctrl + V" in the editor window or download and upload spreadsheet files from my local machine.

I work in Oracle SQL Developer and I really do not need to move enough data to run these procedures and test my work. My job is really the development here, and the more time I spend setting up this test environment, the less time I spend programming.

Is there a way to easily copy a package and all its data dependencies from one database to another? Bonus Points, if it is Oracle SQL Developer and this is easy for a non-DB Administrator. Thanks a lot!

Complexity theory – Injection test in o (n) space and O (n) time

The problem I want to solve is this: give a list $ A $ from $ n $ I want to check if all elements are different. If I did that "myself," I would need it $ O (n) $ room and $ O (n log n) $ Time to solve it, e.g. via a hashmap or a binary tree. Luckily, I have an untrustworthy but almighty oracle ally who is willing to give me clues to solve the problem.

The oracle may supply me $ O (n) $ of clues, and I want an algorithm that will read $ A $ and the Oracle input (both read-only) and either specify that $ A $ has no duplicates, or that the oracle gave me a bad hint in time $ O (n) $ and much smaller read / write space ($ O (1) $ or $ O ( log n) $).

Can it be done?

Penetration Test – How is it possible to scan the internal network for lateral movement without being detected by a firewall?

How is it possible to scan the internal network to perform lateral movements without being detected by a firewall? I've been trying to do a decent scan on the internal network for days. I have a meterpreter shell, add a subnet, set the proxy chain port 1080, and do a slow scan with nmap. I would like to know which other techniques that Pentesters use in their everyday lives are effective.

WebServer is an Ubuntu, but the internal network is full of Windows and Linux computers, creating a realistic training environment.
I do these studies in a controlled environment.

Measurable DCX test buyer

I've planned a few mystery shoppers sessions for one of our clients, but it's difficult to measure them across different situations and personalities. Has anyone worked with a framework? Or a digital workshop? I would like a guide to get it right.

Bottom up!

Measurable CDX test buyer

I've planned a few mystery shoppers sessions for one of our clients, but it's difficult to measure them across different situations and personalities. Has anyone worked with a framework? Or a digital workshop? I would like a guide to get it right.

Bottom up!

c – I can not find any test cases where my code does not provide the correct answer

Recently I solved a problem with SPOJ: Problem link: SUM GCD
I have to calculate the value of the following equation:
$$ sum_ {i = 1} ^ {n-1} sum_ {j = i + 1} ^ n gcd (a (i), a (j)) ; text {where} 1 leq n leq100 $$

Wrote the following code with brute-force approach, since the restrictions are small enough to pass, but I get WA,

#include
#include
#include
#include

typedef unsigned long long _uint64;

bool _take_input(size_t*,size_t);
size_t _find_gcd(size_t,size_t);
_uint64 _find_gcd_sum(size_t*,size_t);

int main(void) {
    uint16_t test;
    size_t n,*seq;
    fscanf(stdin,"%hu",&test);
    assert(test>0);
    while(test--) {
        seq = NULL;
        fscanf(stdin,"%ld",&n);
        assert(n>1 && n<101);
        seq = calloc(sizeof(size_t),n);
        if(seq) {
            if(!(_take_input(seq,n))) fprintf(stderr,"_take_input() not executed successfully!n");
            fprintf(stdout,"%llun",_find_gcd_sum(seq,n));
            free(seq);
        } else fprintf(stderr,"Memory not allocated to seq integer pointer!n");
    }
    return 0;
}

bool _take_input(size_t*seq,size_t n) {
    for(size_t i=0;i0 && seq(i)<1000001);
    }
    return true;
}

size_t _find_gcd(size_t a,size_t b) {
    return (b ? _find_gcd(b,(a%b)) : a);
}

_uint64 _find_gcd_sum(size_t*seq,size_t n) {
    _uint64 gcd_sum,no_of_pairs,loop_cnt;
    gcd_sum = loop_cnt = 0;
    no_of_pairs = (n*(n-1))>>1;
    for(size_t i=0;i<(n-1);++i) {
        for(size_t j=i+1;j

Than the number of different pairs for any set of sizes $ n $ can be calculated with: $ frac {n * (n-1)} {2} $, So the statement assert(loop_cnt == no_of_pairs); Check whether I consider all couples or not.

I can not determine the test cases where my code fails.
I wonder where my code gives the wrong answer because the logic to calculate the equation is correct.