{"id":766,"date":"2025-02-10T10:20:59","date_gmt":"2025-02-10T10:20:59","guid":{"rendered":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/?page_id=766"},"modified":"2026-02-05T08:24:22","modified_gmt":"2026-02-05T08:24:22","slug":"it-exam-2025-encrypted","status":"publish","type":"page","link":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/?page_id=766","title":{"rendered":"IT Exam 2025"},"content":{"rendered":"\n<pre>\n(I)\n\nWrite a program in T++ computing the function: \nf(x,y) = x + y + 2\n\n(II)\n\nWrite a program in T++ computing the function: \nf(x) = 3x - 1 (where f(0) = 0)\n\n\n(III)\n\nWrite a program in T++ computing the function: \nf(x) = 1 if x = 0 and f(x) = x otherwise\n\n\n(IV)\n\nWrite the logical formula corresponding to the following electrical circuit:\n\n      |-----\/ A ----|       |-----\/ A -----|\n      |             |       |              |\n------|             |-------|              |--------\n      |             |       |              |\n      |-----\/ B ----|       |-----\/ C -----|\n\n\nBuild the equivalent circuit to (IV) where each switch is used only once \nand write the corresponding formula.\n\n\n\n(V)\n\n\nSolve the equation 37 * x = 1 mod 344\n\n\n(VI)\n\nCompute 1 0 0 1 1 * 1 1 1 1 (in binary) and write the answer in decimal format. \nWrite your computations (including the carry bits)\n\n\n\n(VII)\n\nCompute 1 1 0 1 1 1 1 1 : 1 0 0 1 0 (in binary) and write the answer \nin decimal format. Write your computations in binary format.\n\n\n(VIII)\n\n\nWe use the following code: A = 2, M = 3, P = 5. Numbers are encoded as usual.\nWe want to decrypt the time of our attack by means of the following \nencrypting method:\n\nDate: monthday (month without leading zero, day with leading zero)\nHour: hourminute (hour without leading zero, minute with leading zero)\nFormat: PM or AM\nCode: Date--Hour--Format\nE.g.: 223--145--23 --> February 23, 1:45 AM\nE.g.: 202--1259--53 --> February 2, 12:59 PM\nE.g.: 101--1100--53 --> January 1, 11:00 PM\nE.g.: 1206--606--23 ---> December 6, 6:06 AM\nEach fragment must be encrypted separately. Thus we need to encrypt \nseparetely 3 numbers (e.g. 101,1100,53)\n\nThe following encrypted message 315--1223--198 has been sent using \nthe public key (e,n), where n = 31 * 41 and e = 17.\nDecrypt the message and write the date and time of the planned attack. \nWrite all your computations.\n\nYou can use the online calculator: \nhttps:\/\/www.omnicalculator.com\/math\/power-modulo\n\n\n(IX)\n\nBob's private key is (d,n), where d = 31 and n = 23 * 29. \nWhat is his public key? \nEncrypt the message L-O-V-E using ASCII encoding \n(A = 65,..., Z=90); that is, encrypt 76-79-86-69.\n\nYou can use the online calculator: \nhttps:\/\/www.omnicalculator.com\/math\/power-modulo\n\n\n(X)\n\nCovert the following citation into APA7:\n\nKimlin Tam Ashing-Giwa, Geraldine Padilla, Judith Tejero, Janet Kraemer, \nKaren Wright, Anne Coscarelli, Sheila Clayton, Imani Williams, Dawn Hills: \nUnderstanding the breast cancer experience of women: \nA qualitative study of African American, Asian American, Latina \nand Caucasian cancer survivors. In: Psycho\u2010Oncology, 13(6), pp. 408-428, \nJohn Wiley & Sons Ltd 2004, \nhttps:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/pon.750 & https:\/\/doi.org\/10.1002\/pon.750\n\n\nLuke Haile, Michael Gallagher, Robert J. Robertson: Perceived Exertion \nLaboratory Manual. From Standard Practice to Contemporary Application. \nSpringer 2015, https:\/\/doi.org\/10.1007\/978-1-4939-1917-8 & \nhttps:\/\/link.springer.com\/book\/10.1007\/978-1-4939-1917-8\n\n<\/pre>\n\n<p> <\/p>\n\n<!--\nComment\n-->\n","protected":false},"excerpt":{"rendered":"<p>(I) Write a program in T++ computing the function: f(x,y) = x + y + 2 (II) Write a program in T++ computing the function: f(x) = 3x &#8211; 1 (where f(0) = 0) (III) Write a program in T++ computing the function: f(x) = 1 if x = 0 and f(x) = x otherwise &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/?page_id=766\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;IT Exam 2025&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/index.php?rest_route=\/wp\/v2\/pages\/766"}],"collection":[{"href":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=766"}],"version-history":[{"count":12,"href":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/index.php?rest_route=\/wp\/v2\/pages\/766\/revisions"}],"predecessor-version":[{"id":849,"href":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/index.php?rest_route=\/wp\/v2\/pages\/766\/revisions\/849"}],"wp:attachment":[{"href":"https:\/\/bacon.umcs.lublin.pl\/~wolsk\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=766"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}