-
1دورية أكاديمية
المؤلفون: Kniaź, Małgorzata, Zawrotna, Magdalena
مصطلحات موضوعية: code-switching, Egyptian Arabic, English, verb insertion, matrix language frame model
العلاقة: International Journal of Bilingualism, T. 25, nr 3, s. 622-639; https://ruj.uj.edu.pl/xmlui/handle/item/270686Test
الإتاحة: https://doi.org/10.1177/1367006920976909Test
https://ruj.uj.edu.pl/xmlui/handle/item/270686Test -
2دورية أكاديمية
مصطلحات موضوعية: Acinetobacter baumannii, wielolekooporność, genotypowanie, RAPD-PCR, pompy efflux, sekwencje insercyjne, biofilm, multi-drug resistance, genotyping, efflux pump, insertion sequence
العلاقة: Medycyna Doświadczalna i Mikrobiologia, T. 73, nr 1-4, s. 15-23; https://ruj.uj.edu.pl/xmlui/handle/item/290767Test; https://doi.org/10.32394/mdm.73.02Test
-
3دورية أكاديمية
المؤلفون: Orzeł, Łukasz, Waś-Mrozek, Joanna, Kania, Agnieszka, Susz, Anna, Rutkowska-Żbik, Dorota, Staroń, Jakub, Witko, Małgorzata, Stochel, Grażyna, Fiedor, Leszek
مصطلحات موضوعية: metallochlorophylls, heavy metals, metal ion insertion, metal ion activation
العلاقة: JBIC. Journal of Biological Inorganic Chemistry, T. 22, nr 6, s. 941-952; https://ruj.uj.edu.pl/xmlui/handle/item/45576Test; https://link.springer.com/content/pdf/10.1007%2Fs00775-017-1472-1.pdfTest
الإتاحة: https://doi.org/10.1007/s00775-017-1472-1Test
https://ruj.uj.edu.pl/xmlui/handle/item/45576Test -
4دورية أكاديمية
مصطلحات موضوعية: non-insertion tendinopathy, running, plantar pressure
العلاقة: Folia Medica Cracoviensia, T. 57, nr 3, s. 77-86; https://ruj.uj.edu.pl/xmlui/handle/item/142179Test; http://journals.pan.pl/Content/102288/PDF/FOLIA%20MED.%203-17%208-Wnuk.pdfTest
-
5دورية أكاديمية
المؤلفون: Srebro-Hooper, Monika, Piękoś, Łukasz, Michalak, Artur, Kim, Tae-Jin, Kang, Sang Ook, Cheong, Minserk, Ok, Myung-Ahn
مصطلحات موضوعية: ethylene polymerization, half-titanocenes, backside/frontside insertion preference, density functional calculations, molecular dynamic simulations
العلاقة: Macromolecular Research, T. 18, nr 10, s. 960-966; https://ruj.uj.edu.pl/xmlui/handle/item/71748Test
الإتاحة: https://doi.org/10.1007/s13233-010-1012-0Test
https://ruj.uj.edu.pl/xmlui/handle/item/71748Test -
6رسالة جامعية
المؤلفون: Wawrzyniak, Magdalena
-
7رسالة جامعية
المؤلفون: Bober, Aleksandra
-
8رسالة جامعية
المؤلفون: Smolik, Magdalena
-
9رسالة جامعية
المؤلفون: Majewska, Jagoda
-
10رسالة جامعية
المؤلفون: Matusiewicz, Ewelina
مصطلحات موضوعية: Python implementation of selected binary trees is presented. Basic operations supported by binary search trees are described: insertion of a node, deletion of a node, searching for a specific key, finding minimum or maximum node, finding the successor or the predecessor of a current node. Main tree traversal methods are shown: inorder, preorder, postorder, level-order.Binary search trees are basic structures used to implement dynamic sets of items that allow finding an item by its key. Searching is efficient only for balanced trees but for real data a tree may become unbalanced. That is why three modified kinds of trees are also shown. Red-black trees and AVL trees use an additional node attribute to ensure that trees remain approximately balanced. Splay trees improve access to frequently used nodes, they are placed near the root of the tree.All source code has been covered by unit test scripts, binary search tree, red-black tree, AVL tree, splay tree, DSW algorithm, tree rotations, tree traversal