Switch Statement Research Articles

The Design and Practice of a Multi-solution Teaching Strategy: Taking the C Language Programming Course as an Example

This paper explores one problem with multiple solutions teaching strategy applied to the integration of theory and practice teaching courses in C language programming course. According to the cognitive characteristics of students for the same problem combined with the specific learning situation of higher vocational colleges, the course has adopted the three methods of basic flow control statement, switch statement, and array. Showing the methods and skills to solve the problem from different angles with the gradual implementation of the specific teaching helps students deepen their understanding of C language knowledge. It also guides students to use knowledge to solve practical problems, to achieve the teaching goals.

Feature reduction techniques based code smell prediction

Code Smell refers to the telltale signs of poor code design that leads to software quality issues. Developers require specific methods to measure the complexity of Code Smells in order to resolve the problem quickly. Recent research has examined the problem of predicting Code Smell using various detection methods. However, the accuracy of machine learning-based Code Smell detectors is still at a normal level. One of the main objective of this paper is to assess how well dimensionality reduction methods can predict Code Smells. This paper uses three machine learning techniques with feature reduction techniques, such as Principal Component Analysis (PCA), t-Distributed Stochastic Neighbor Embedding (t-SNE), and Linear Discriminate Analysis (LDA). Ten-fold cross-validation is used to ensure that the model is well-trained. Datasets are balanced using the Synthetic Minority Oversampling Technique (SMOTE) to ensure an equal number of classes in each dataset. The experimental result concluded that the AdaBoost method with LDA performs better in both the Long Parameter List and Switch Statement datasets, with an accuracy of 92.72% and 91.24%, respectively.

WITHDRAWN: Prioritization of code smells in object-oriented software: A review

Code smells are symptoms that something may be wrong in software systems that can cause complications in maintaining software quality. During maintenance of software, due to market pressure and time constraints, it is difficult for the developers to remove all the code smells, so their prioritization can help the developers to refactor critical code smells in limited time with a limited budget. To address this, need several techniques have also been proposed to automate code smell prioritization in order to improve software quality. This paper presents an up-to-date review of code smell prioritization techniques and tools. We have collected nearly 23 articles published in renowned journals till May 2020. It is observed that majority of code smell prioritization tools have focused on prioritization of Long Method, Feature Envy, and Switch Statement code smells. These tools were implemented using Java programming language and majority of these are able to prioritize code smells in Java software only.

Non-local quantum functions and the distributed Deutsch-Jozsa algorithm

Non-local implementations of quantum gates are a vital part of quantum networks. We find an optimal non-local implementation of quantum functions, the quantum gate equivalent of a switch statement. Then, we apply this result to the Deutsch-Jozsa problem, obtaining a distributed Deutsch-Jozsa algorithm and we show the relative efficiency improvement. As an application, we find a non-cooperative game based upon the original Deutsch-Jozsa problem where a classical agent has at most a 50% probability of winning, while a quantum agent can win every time.

A novel framework to facilitate personalized web search in a dual mode

Now days, web search engines provide good services in terms of retrieval and presentation of the information to the user. A foremost difficulty in the modern and ever growing web is the lack of user interest adaption in the process of web search. All users are presented with the same set of search engine result pages (SERPs) for a given input query string, since it follows the keyword based search. The limitation of keyword based search is (i) uncertain user needs and (ii) improper query selection. If the programmer is searching for a query “switch”, it refers to the switch statement of a programming language and for an electrical engineer, the context of search is the physical house hold switch component. In addition to that a user may fall short in choosing the proper query for search that best articulate their information need. Hence, it is evident that keyword searches have tough time to distinguish the user context over the query. A typical approach to focus on this challenge is a personalized web search strategy where the results are retrieved based on the user interest and preferences. The three different major search modules are: (i) building user profiles (ii) re-ranking the SERPs in personal mode and (iii) re-ranking the SERPs in group mode. The proposed work stands for contributing in the field of user profile construction and personalized page ranking. A new method of user model representation termed as Preference Network is constructed. The proposed system can work in both initialization and maintenance mode to build a new or update an existing model. Both the short term and long term interest are utilized to rank the SERPs. The user interest score and group interest score are computed dynamically.

Obfuscation for object-oriented programs: dismantling instance methods

Code obfuscation can help software developers protect technological secrets. Code readability is greatly enhanced with object-oriented technology that represents dynamic binding using instance method invocation. Therefore, dismantling instance methods is proposed in this paper as a critical obfuscating technique for object-oriented programs. The interception classes are interpolated first into the project. The static images and the up forwarders are then created. For each virtual function system and each interface function system, a respective dispatching function is set up. By properly arranging the class identifiers and binding identifiers, the switch statement in the dispatching function can be compiled into constant-time low-level code. After using dispatching functions to simulate virtual function system or interface function system invocations, all original instance methods in the project will be removed. Interception functions and export functions are indispensable in supporting the operation of callback methods. A prototype of our obfuscation system was implemented and successfully tested on some practical scale applications. Copyright © 2013 John Wiley & Sons, Ltd.

Soil Liquid Limit and Plastic Limit Treating System Based on Analytic Method

According to two present China national standards, a software as Soil Liquid Limit and Plastic Limit Data Treating System, with analytic method, was developed using object-oriented visual programming tool. The analytic method used in the developed system was different to traditional method of treating soil liquid limit and plastic limit data. N-S algorithm flowchart demonstrated that switch statement and condition statement were taken as main algorithm and second level select nested structure was taken as main frame for the developed system. Three kinds of soil specimens were tested with liquid and plastic limit combined test and the test data was treated with graphic method, Excel software and Soil Liquid Limit and Plastic Limit Data Treating System. The comparative conclusion indicated that Soil Liquid Limit and Plastic Limit Data Treating System improved efficiency and accuracy evidently for treating soil liquid and plastic limit data and had advantages of easy operation and high reliability.

C++ for mathematicians: an introduction for students and professionals

List of Programs List of Figures Preface I. PROCEDURES The Basics What is C++? Hello C++ Numbers The Integer Types The Real Number Types The bool and char Types Checking the Size and Capacity of the Different Types Standard Operations Comparisons and Boolean Operations Complex Numbers Naming Variables Greatest Common Divisor The Problem A First Approach Euclid's Method Looping With for, while, and do An Exhaustive Approach to the GCD Problem Extended GCD, Call by Reference, and Overloading Random Numbers Pseudo Random Number Generation Uniform Random Values More on Pseudo Random Number Generation A Monte Carlo Program for the GCD Problem Normal Random Values Arrays Euler's Totient Array Fundamentals A Procedure to Factor Integers A Procedure to Calculate Euler's Totient The Sieve of Eratosthenes A Faster Totient Computing pn for Large n The Answer II. OBJECTS Points in the Plane Data and Methods Declaring the Point Class Data Hiding Constructors Assignment and Conversion Methods Procedures using Arguments of Type Point Operators Pythagorean Triples Generating Pythagorean Triples Designing a Primitive Pythagorean Triple Class Implementation of the PTriple Class Finding and Sorting the Triples Containers Sets Set Iterators Multisets Adjustable Arrays Via the Vector Class Ordered Pairs Maps Lists, Stacks, and Assorted Queues Modular Arithmetic Designing the Mod Type The Code The Default Modulus: Static Class Variables and Methods Constructors and Get/Set Methods Comparison Operators Arithmetic Operators Writing Mod Objects to Output Streams A Main to Demonstrate the Mod Class The Projective Plane Introduction to the Projective Plane, RP2 Designing the Classes PPoint and PLine Inheritance Protected Class Members Class and File Organization for PPoint and PLine The Parent Class PObject The Classes PPoint and PLine Discovering and Repairing a Bug Pappus Revisited Permutations Ulam's Problem Designing the Permutation Class Finding Monotone Subsequences Exercises Polynomials Procedure Templates Class Templates The Polynomial Class Template The GCD Problem Revisited Working in Binary III. TOPICS Using Other Packages Arbitrary Precision Arithmetic: the GMP Package Linear Algebra Other Packages Strings, Input/Output, and Visualization Character Arrays The String Class Command Line Arguments Reading and Writing Data in Files String Streams Formatting A Class to Parse Files Visualization Odds and Ends The switch Statement Labels and the goto Statement Exception Handling Friends Other Ways to Create Types Pointers IV. APPENDICES A. Your C++ Computing Environment Programming with a Command Window and a Text Editor Programming with an Integrated Development Environment General Advice on Debugging B. Documentation with Doxygen Doxygen Comments Using Doxygen C. C++ Reference Variables and Types Operations Control Statements Procedures Classes Standard Functions D. Answers Index *Each Chapter Contains Exercises Solutions can be found in Appendix D

Translating Iterative Algorithms into Automaton Ones

It is shown that the scheme of any iterative algorithm (program) can be realized by a do-while statement with a switch statement as its body that realizes the finite-state automaton transition graph constructed formally by the given scheme. This realization is simpler than that by the Ashcroft–Manna method.

A polymorphic record calculus and its compilation

The motivation of this work is to provide a type-theoretical basis for developing a practical polymorphic programming language with labeled records and labeled variants. Our goal is to establish both a polymorphic type discipline and an efficient compilation method for a calculus with those labeled data structures. We define a second-order, polymorphic record calculus as an extension of Girard-Reynolds polymorphic lambda calculus. We then develop an ML-style type inference algorithm for a predicative subset of the second-order record calculus. The soundness of the type system and the completeness of the type inference algorithm are shown. These results extend Milner's type inference algorithm, Damas and Milner's account of ML's let polymorphism, and Harper and Mitchell's analysis on XML. To establish an efficient compilation method for the polymorphic record calculus, we first define an implementation calculus, where records are represented as vectors whose elements are accessed by direct indexing, and variants are represented as values tagged with a natural number indicating the position in the vector of functions in a switch statement. We then develop an algorithm to translate the polymorphic record calculus into the implementation calculus using type information obtained by the type inference algorithm. The correctness of the compilation algorithm is proved ; that is, the compilation algorithm is shown to preserve both typing and the operational behavior of a program. Based on these results, Standard ML has been extended with labeled records, and its compiler has been implemented.

A retargetable compiler for ANSI C

lcc is a new retargetable compiler for ANSI C. Versions for the VAX, Motorola 68020, SPARC, and MIPS are in production use at Princeton University and at AT&T Bell Laboratories. With a few exceptions, little about lcc is unusual --- it integrates several well engineered, existing techniques --- but it is smaller and faster than most other C compilers, and it generates code of comparable quality, lcc's target-independent front end performs a few simple, but effective, optimizations that contribute to good code; examples include simulating register declarations and partitioning switch statement cases into dense tables. It also implements target-independent function tracing and expression-level profiling.