PowerBI – How to See All Pages Being Linked to

I have a page called “Courses”.

On this page, I select certain filters.

  1. When I log into https://app.powerbi.com and select the filters, there is a Tab on the left that says “Courses” and a table appears after selecting the filters.

  2. When I open up the Power BI Desktop file and select filters on the “Courses” tab, I don’t see the same table.

How can I see how what filters are linked to what tables so that when I go to Power BI Desktop, I can select the same filters and see the same table?

How to get an actual execution plan from the linked server?

There is a “main” SQL Server to which I have full access and I can connect to it via SSMS. Its version is:

Microsoft SQL Server 2016 (SP1-CU15-GDR) (KB4505221) - 13.0.4604.0 (X64) 
    Jun 15 2019 07:56:34 
    Copyright (c) Microsoft Corporation
    Enterprise Edition: Core-based Licensing (64-bit) on Windows Server 2016 Datacenter 10.0 <X64> (Build 14393: ) (Hypervisor)

There is a linked server defined on the main server. The linked server is:

Microsoft SQL Azure (RTM) - 12.0.2000.8 
    Feb 20 2021 17:51:58 
    Copyright (C) 2019 Microsoft Corporation

I can’t connect directly to that remote server via SSMS, but I can run all sorts of queries against it using OpenQuery. For example, I got its version by running this:

select * from OpenQuery((LinkedServerName), 'select @@version');

There are a number of complex legacy queries that are run on the remote linked server via OpenQuery.

I wanted to analyze them and see if there are any obvious/easy ways to improve their performance. To do that I wanted to get their execution plans. If I try to get an execution plan on a local server all I get is one Remote Scan operator that takes 35 minutes without any details.

I know that there is a SET STATISTICS XML ON statement that returns an execution plan of a query.
Unfortunately, when I tried to put it into the OpenQuery, it didn’t work.

Let me explain.

I can run the actual query:

select * from OpenQuery((LinkedServerName), 
select TOP(10) * from bms.digitalbookinglinezone;

This returns me 10 rows as expected. When I uncomment the SET STATISTICS XML lines I get the following error message:

Msg 11527, Level 16, State 1, Procedure
sys.sp_describe_first_result_set, Line 1 (Batch Start Line 0) The
metadata could not be determined because statement ‘SET STATISTICS XML
ON;’ does not support metadata discovery.

At the same time I can run the following query just fine:

select * from OpenQuery((LinkedServerName), 
SELECT * FROM sys.dm_exec_describe_first_result_set
(N''select TOP(10) * from bms.digitalbookinglinezone'', null, 1);

And I’m getting valuable information about all columns in the remote table.

Is there any other “T-SQL” way of getting the execution plans?
Something that I could use via the OpenQuery?

data leakage – Over 533 millions Facebook s linked phone numbers leaked with 1 user out of 2 affected in my country. How to find out if I m affected?

The following kind of article about a data leak becoming free https://www.bleepingcomputer.com/news/security/533-million-facebook-users-phone-numbers-leaked-on-hacker-forum/ is making the headlines.

The problem is such data don t contains email addresses and isn t about account access theft. So it s not in projects like amIpwned.

So I tried to search about where that list is published in order to download it and look at the single entry I m interested in but found only other news articles on the topic.

How to check if my account along my phone number is in that list?

worksheet function – How to create a Destination file that is linked to a Source on Excel offline?

I am struggling with an excel feature regarding creating a Source and Destination workbook.

My Source data comes from the web using which I must create dashboards on Power BI. But before that, I make few changes to the Source data such that it is suitable for Power BI and represents certain information.

Since I have to make these changes to the Source data , I cannot directly link the data for automatic updates on Power BI. (Using from Web option)
And also my Source data is updated with new rows every week.

So the idea here is to create a Destination excel sheet with all necessary columns to connect on Power BI. And then download the Source file and create a link.

With the help of this link, every week when I download new Source data report, and refresh my Destination file, it should get updated with the new rows.

And as the Destination file will be linked to Power BI, my dashboards will also be updated with new information.

How can I make this happen? I am not excel expert and really need help!!

PS I am using office 365, Excel

Is there a way to add a linked slide within the same Google Slide presentation?

I’m familiar with the linked slides feature in Google Slides to insert a linked slide from another presentation. This allows edits in the source slide to flow through to the linked slides in the other presentations.

Is there a way to do this when pasting the slide into the original presentation (i.e. at a different section of the same pack)?

Ncurses Snake Game using a Linked List in C

This is a lightweight text based version of the popular game Snake written entirely in C. In order to build it, ncurses needs to be installed on the system. Navigation is done using the vim-keys and you can quit with ‘q’. The bones of the snake are stored in a linked list. This is one of my personal projects and I would love to recieve expert advice.

In snake.c I have:

#include <curses.h>
#include <locale.h>
#include <stdlib.h>
#include <time.h>

#include "linked_list.h"

enum dir {

/* Global variables */
int width;
int height;
struct node *snk;
int len;
enum dir dir;
int food_x;
int food_y;
bool gameover;

/* Initial setup */
void setup(void)
    setlocale(LC_ALL, "");
    initscr(); cbreak(); noecho();
    intrflush(stdscr, FALSE);
    keypad(stdscr, TRUE);

    getmaxyx(stdscr, height, width);
    width = (width + 1) / 2;

    snk = new_node(width / 2, 0, NULL);
    len = 1;
    dir = DOWN;

    do {
        food_x = rand() % width;
        food_y = rand() % height;
    } while (snk->x == food_x && snk->y == food_y);

    gameover = false;


/* Listen for key press */
void input(void)
    char c = getch();
    if (c == 'h' && (dir != RIGHT || len == 1))
        dir = LEFT;
    else if (c == 'j' && (dir != UP || len == 1))
        dir = DOWN;
    else if (c == 'k' && (dir != DOWN || len == 1))
        dir = UP;
    else if (c == 'l' && (dir != LEFT || len == 1))
        dir = RIGHT;
    else if (c == 'q')
        gameover = true;

/* Move snake, check for collision, handle food */
void logic(void)
    switch (dir) {
    case LEFT:
        snk = new_node(snk->x - 1, snk->y, snk);
    case DOWN:
        snk = new_node(snk->x, snk->y + 1, snk);
    case UP:
        snk = new_node(snk->x, snk->y - 1, snk);
    case RIGHT:
        snk = new_node(snk->x + 1, snk->y, snk);

    if (snk->x < 0)
        snk->x = width - 1;
    else if (snk->x >= width)
        snk->x = 0;
    else if (snk->y < 0)
        snk->y = height - 1;
    else if (snk->y >= height)
        snk->y = 0;

    if (node_exists(snk->next, snk->x, snk->y))
        gameover = true;

    if (snk->x == food_x && snk->y == food_y) {
        do {
            food_x = rand() % width;
            food_y = rand() % height;
        } while (node_exists(snk, food_x, food_y));
    } else {

/* Draw the snake and the food */
void draw(void)
    struct node *cursor = snk;
    while (cursor != NULL) {
        mvprintw(cursor->y, cursor->x * 2, "o");
        cursor = cursor->next;
    mvprintw(food_y, food_x * 2, "+");

int main(void)

    while (!gameover) {

        struct timespec ts;
        ts.tv_sec = 0;
        ts.tv_nsec = 100000000;
        nanosleep(&ts, &ts);

    return EXIT_SUCCESS;

In linked_list.c I have:

#include <stdio.h>
#include <stdlib.h>

#include "linked_list.h"

/* Create a new node */
struct node *new_node(int x, int y, struct node *next)
    struct node *new = malloc(sizeof *new);
    if (!new) {
        printf("Error: memory allocation failed");
    new->x = x;
    new->y = y;
    new->next = next;
    return new;

/* Delete the last node */
void delete_last(struct node *head)
    struct node **cursor = &head;
    while ((*cursor)->next != NULL)
        cursor = &(*cursor)->next;
    *cursor = NULL;

/* Check if node exists */
int node_exists(struct node *head, int x, int y)
    struct node *cursor = head;
    while (cursor != NULL) {
        if (cursor->x == x && cursor->y == y)
            return 1;
        cursor = cursor->next;
    return 0;

In linked_list.h I have:


struct node {
    int x;
    int y;
    struct node *next;

/* Create a new node */
struct node *new_node(int x, int y, struct node *next);

/* Delete the last node */
void delete_last(struct node *head);

/* Check if node exists */
int node_exists(struct node *head, int x, int y);

#endif /* LINKED_LIST_H */

Inserting and getting the position in a Linked List class using python

I am new to Data Structure and algorithms. I’m a self-taught Python programmer. I am doing a course on it and I wanted to make a linked list, get a specific position in the linked list, insert, and delete an element in the list.
So I wrote my code, and to me, it seems fine. It’s not giving me any errors, but it’s not executing as well.

This is the code that I wrote,

class Element(object):
    def __init__(self, value):
        self.value = value
        self.next = None
class LinkedList(object):
    def __init__(self, head=None):
        self.head = head
    def append(self, new_element):
        current = self.head
        if self.head:
            while current.next:
                current = current.next
            current.next = new_element
            self.head = new_element
    def get_position(self, position):
        """Get an element from a particular position.
        Assume the first position is "1".
        Return "None" if position is not in the list."""
        current = self.head
        if self.head:
            while current.next:
                if current == position:
                    return current
            return None
    def insert(self, new_element, position):
        """Insert a new node at the given position.
        Assume the first position is "1".
        Inserting at position 3 means between
        the 2nd and 3rd elements."""
        current = self.head
        if self.head:
            while current.next:
                if current.next == position:
                    current.next = new_element
            self.head = new_element

can anyone tell me what is it that I’m doing wrong?
Is there an issue with the loop or something?
Please help me, I’ll be grateful!! Thanks.

SQL Server 2019 using Linked server to Oracle 19c (19.9) using Oracle 19c client on Windows – DBCOLUMNFLAGS_ISNULLABLE error

Having issues selected data for some Oracle tables over the linked server from SQL Server:

select type, count(*) from RMTDB..JOB1308.HOST_INTERFACE group by type order by 1 desc;

Msg 7356, Level 16, State 1, Line 13
The OLE DB provider “OraOLEDB.Oracle” for linked server “RMTDB” supplied inconsistent metadata for a column. The column “CREATE_TIME” (compile-time ordinal 3) of object “”JOB1308″.”HOST_INTERFACE”” was reported to have a “DBCOLUMNFLAGS_ISNULLABLE” of 0 at compile time and 32 at run time.

Open query version of it works:

select * from OPENQUERY( RMTDB, 'select type, count(*) from HOST_INTERFACE group by type order by 1 desc')


TYPE      COUNT(*)
10          10450
8            6543
6            21

Anyone run into this?

java – Reverse linked list(using Recursion) – Time and space Complexity

How to calculate time and space complexity for the below recursive code.

Idea : Initially traverse till previous of last node and make the last node to point it’s previous node and the previous node to point null. (Do the same until head point’s to null)

private void reverseList(Node node,Node prev) {
    if (node.next == null) {
        node.next = prev;
        prev.next = null;
    else {
        if(node != head) {
//method calling
reverseList(head.next,head);//head points to start node

How to calculate time complexity using tree method or substitution method? How to derive equation for this code? Also would like to get suggestion on code optimization and better approach.

Thanks in Advance!!