Browsing by Author "Muhammad Awais"

Now showing 1 - 4 of 4

Association between Perfectionism, Memory Deficits, and Generalized Anxiety in Computer Programmers
(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2023) Muhammad Awais; FA19-BPY-053; Dr. Farzana Ashraf; LHR TP 8400
The current research study focuses on and aims to check the association or link between perfectionism, memory deficits, and generalized anxiety in computer programmers of Pakistan. The findings and results of the study show that there is a significant association or link between generalized anxiety and memory deficits and perfectionism acts as the significant moderator of generalized anxiety and memory deficits. Since the association between these variable of the study is the main and basic interest of the study and research, 457 computer programmers from different institutes were taken as the sample of the study. They all were young adults and working programmers having at least one or two-year of experiences in the field. The data was gathered through a convenient and slowball sampling technique. Generalized anxiety has a significant and negative association or link with memory deficits and perfectionism act as the moderator in generalized anxiety and memory deficits. Three assessment scales were used to check perfectionism, memory deficits, and generalized anxiety in computer programmers. The scales are the Big Three Perfectionism Scale-Short form, Generalized Anxiety Disorder, and Memory Deficits scale. This research study highlights the inverse relationship between 11 perfectionism and generalized anxiety among Pakistani computer programmers, suggesting that perfectionism may serve as a protective factor against stress in this demographic.
Association between Perfectionism, Memory Deficits, and Generalized Anxiety in Computer Programmers
(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2023) Muhammad Awais; FA19-BPY-053; Dr. Farzana Ashraf; LHR TP 8400
The current research study focuses on and aims to check the association or link between perfectionism, memory deficits, and generalized anxiety in computer programmers of Pakistan. The findings and results of the study show that there is a significant association or link between generalized anxiety and memory deficits and perfectionism acts as the significant moderator of generalized anxiety and memory deficits. Since the association between these variable of the study is the main and basic interest of the study and research, 457 computer programmers from different institutes were taken as the sample of the study. They all were young adults and working programmers having at least one or two-year of experiences in the field. The data was gathered through a convenient and slowball sampling technique. Generalized anxiety has a significant and negative association or link with memory deficits and perfectionism act as the moderator in generalized anxiety and memory deficits. Three assessment scales were used to check perfectionism, memory deficits, and generalized anxiety in computer programmers. The scales are the Big Three Perfectionism Scale-Short form, Generalized Anxiety Disorder, and Memory Deficits scale. This research study highlights the inverse relationship between perfectionism and generalized anxiety among Pakistani computer programmers, suggesting that perfectionism may serve as a protective factor against stress in this demographic.
Intership on AH Traders
(Library Information Services, CUI Lahore, 2023) Muhammad Awais; SP20-BAF-019; Mr. Nayyar butt
Students earning bachelor's degrees in the subjects of accounting and finances has outstanding internship choices. A designated professor oversees each student throughout their internship. Working with A.H Traders, the tobacco company Philip Morris Pakistan affiliate, is one of the best breaks I've gotten in my life. The duration of the internship is six weeks. It's impossible to learn everything there is to know about the company and its operations in a relatively brief frame, but the best examples I've seen have given me confidence that I can succeed. On the twentieth of July I will begin my internship, but it will expire on September 1, 2023. In addition to developing marketable skills like talking in public, teamwork, and problem solving, my summer job with A.H. Traders gave me invaluable practical experience in the world of cigarettes. My responsibilities include data input and thinking about, tax return preparation, financial statement development, transaction analysis, administration of revenue and collections, and support for the review of financial plans. Furthermore, I ensure that all employees are aware of the significance of money and their role in its management. I went to other business gatherings and met other people who work in banking. The internship was quite helpful to me. As a result, I am more equipped to handle accounting and finance tasks and have a broader understanding of the corporate world. With the skills and education, I have already earned, I know I will be successful in any endeavour I undertake.
Resolving Set of Grid Graph and its Variants
(Library Information Services, COMSATS University Islamabad, Lahore Campus, 2025) Muhammad Awais; FA23-RMT-026; Dr. Muhammad Rafiullah; LHR TP 9772
If the distance in equation 𝑑𝐺 (𝑥, 𝑧) ≠ (𝑦, 𝑧) is valid for separate vertices 𝑥, 𝑦, 𝑧 in graph 𝐺 = (𝑉, � �), we say the pair of vertices 𝑥, 𝑦 can be discriminated by vertex 𝑧. If any two distinct vertices in graph G can be identified by at least one vertex in the vertex subset 𝑆 ⊂ 𝑉, then 𝑆 ⊂ 𝑉 is a resolving set of graph G. The one with the smallest number of nodes among all of the resolving sets is termed a metric basis of graph G, and its cardinality is called the metric dimension of graph G [1]. Let (𝑉, 𝐸) be a simple connected graph. We define the distance between an edge 𝑒 = 𝑥𝑦 and vertex 𝑣 as follows: � �(𝑒, 𝑣) = 𝑚𝑖𝑛{𝑑(𝑥, 𝑣), 𝑑(𝑦, 𝑣)}. Two edges 𝑒1 and 𝑒2 are distinguished by a vertex v if (𝑒1, 𝑣) ≠ (𝑒2, 𝑣). If there is a vertex 𝑠 ∈ 𝑆 such that s differentiates 𝑒1 and 𝑒2 for any two unique edges 𝑒1,2∈ 𝐸, then a set 𝑆 ⊆ 𝑉 is an edge metric generator of a graph (𝑉, 𝐸). An edge basis of G is an edge generating set with the fewest members; the edge dimension of G is the number of elements in an edge basis [2]. This study calculates the diagonally folded grid (DFG) graph's metric and edge metric dimensions.