{"title":"Classroom Indiscipline and Academic Performance of Primary School Pupils in Social Studies in Calabar South Local Government Area of Cross River State","authors":"Inyang Uguana","doi":"10.2139/ssrn.3849709","DOIUrl":"https://doi.org/10.2139/ssrn.3849709","url":null,"abstract":"This study investigated classroom indiscipline and academic performance of primary school pupils in Social Studies in Calabar South Local Government Area of Cross River State. To achieve this, three research questions and correspondent hypotheses were formulated to guide the study. A correlational research design was used to direct the study. The population of the study comprised of public primary schools in Calabar South numbering six thousand eight hundred (6,800) pupils. Random sampling technique was used to select sample of 200 pupils in the study area. Questionnaire titled “Classroom indiscipline and academic performance of primary schools (CIAPPSQ)”. The instrument was validated through face and content method. Pearson Product Moment Correlation Coefficient was used as statistical tools in analyzing hypotheses and was tested at 0.05 significance. The result of the finding revealed that fighting, truancy, and lateness to school significantly relate with academic performance of primary school pupils. From the findings, it was concluded that classroom indiscipline play vital role in inhibiting negative aspects in the performance of primary school pupils in the study area. From the conclusion, it was therefore recommended among others that, fighting in class causes physical and psychological damages to children, hence teachers and school heads should build strong rules against fighting in schools.","PeriodicalId":179478,"journal":{"name":"InfoSciRN: Other Information Theory & Research (Topic)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126443667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the Classification of NP Complete Problems and Their Duality Feature","authors":"Wenhong Tian","doi":"10.5121/IJCSIT.2018.10106","DOIUrl":"https://doi.org/10.5121/IJCSIT.2018.10106","url":null,"abstract":"NP Complete (abbreviated as NPC) problems, standing at the crux of deciding whether P=NP, are among hardest problems in computer science and other related areas. Through decades, NPC problems are treated as one class. Observing that NPC problems have different natures, it is unlikely that they will have the same complexity. Our intensive study shows that NPC problems are not all equivalent in computational complexity, and they can be further classified. We then show that the classification of NPC problems may depend on their natures, reduction methods, exact algorithms, and the boundary between P and NP. And a new perspective is provided: both P problems and NPC problems have the duality feature in terms of computational complexity of asymptotic efficiency of algorithms. We also discuss about the NPC problems in real-life and shine some lights on finding better solutions to NPC problems.","PeriodicalId":179478,"journal":{"name":"InfoSciRN: Other Information Theory & Research (Topic)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121377616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}