Asked 16th Jul, 2022

Want to do research on Computaional Thinking and Digital Competence, both are 21st century skills. How I will connect these two variables?

I am coming from the background of Computer Science and now I am doing Phd. in eduaction. I want to connect my core subject computer science with the subject eduaction. I want to do a survey study on the topic Computational Thinking (CT)and Digital Competence (DC). Here I want to work on the relationship between CT and DC. I eagerly need your help and your valuable suggestion so that I can forward my work.

All Answers (2)

Adel Al Qeisi
Ministry of Education, UAE
It is more than amazing . Go on . Please send me your survey to comment on more .
1 Recommendation
Jowâner De Oliveira Araújo
Instituto Federal de Educação, Ciência e Tecnologia da Bahia (IFBA)
Computational Thinking allows students to develop certain skills that are independent of the area of ​​knowledge, including: problem solving and autonomy. These skills are necessary for the development of digital competence. I suggest identifying the competencies of computational thinking and digital competence. From there, relate these skills.

Similar questions and discussions

Is this new sorting algorithm based on Binary Search Tree useful ?
3 answers
  • Uday UppalUday Uppal
If we some how transform a Binary Search Tree into a form where no node other than root may have both right and left child and the nodes the right sub-tree of the root may only have right child, and vice versa, such a configuration of BST is inherently sorted with its root being approximately in the middle (in case of nearly complete BST’s). To to this we need to do reverse rotations. Unlike AVL and red black trees, where roatations are done to make the tree balanced, we would do reversed rotations.
I would like to explain the pseudo code and logical implementation of the algorithm through the images in following pdf. The algorithm is to first sort the left subtree with respect to the root and then the right subtree. These two subparts will be opposite to each other, that is, left would interchange with right. For simplicity I have taken a BST with right subtree, with respect to root, sorted.
To improve the complexity as compared to tree sort we can augment the above algorithm. We can add a flag to each node where 0 stands for a normal node while 1 is when the node has non null right child, in the original unsorted BST. The nodes with flag 1 have an entry in a hash table with key being their pointers and the values being the right most node. For example node 23's pointer would map to 30.5's pointer. Then we would not have to traverse all the nodes in between for the iteration. If we have 23's pointer and 30.5's pointer we can do the required operation in O(1). This will bring down time complexity , as compared to tree sort.
Please review the algorithm and give suggestion if this algorithm is of any use and if I should write a research paper on it.

Related Publications

Background & Context: We describe the rationale, design, and initial validation of computational thinking (CT) assessments to pair with curricular lessons that integrate fractions and CT. Objective: We used cognitive models of CT (learning trajectories; LTs) to design assessments and obtained evidence to support a validity argument Method: We use...
Conference Paper
Full-text available
Our proposed panel represents a variety of viewpoints on Computer Science (CS) and Computational Thinking (CT) in higher education teacher preparation programs. The goal of our panel discussion will be to present our varied research in the field so that the audience can experience cross disciplinary viewpoints on CT and CS. We are interested in fac...
Got a technical question?
Get high-quality answers from experts.