Introduction To Programming Logic

[Shanel Arrendell]

Essentiallyprogramming is giving instructions to a machine on how to carry out particular tasks. Programming logic is something that must be understood and used in order to interact with computers. What enables developers to solve issues, make apps, and construct software systems is the basic organization and flow of operations.

What is Programming Logic?

The basic way programmers understand and organize their code to produce desired results is known as programming logic. Fundamentally, it involves decomposing issues into smaller, more manageable components and formulating a plan of action to address each one.

Key Elements of Programming Logic:

1. Sequence:

Programming logic involves arranging commands in a sequential order, allowing the computer to execute them one after another.

2. Selection (Conditional Statements):

Conditions or logical tests are used to direct the flow of a program. For instance, "if-else" statements allow the code to make decisions based on specific conditions.

1. Problem Solving:

Programming logic helps in breaking down complex problems into smaller, manageable parts. This simplification enables developers to solve problems systematically.

2. Efficient Code Writing:

By using logical structures, programmers can write code that is not only understandable but also efficient. It helps in avoiding redundancy and streamlining the execution process.

3. Enhancing Debugging Skills:

Logical thinking assists in identifying errors within the code and debugging more effectively. It becomes easier to trace the flow of a program and identify where issues might occur.

How to Develop Strong Programming Logic?

Solving problems and practicing regularly are necessary to develop strong programming reasoning. Here are some actions you can take to sharpen your reasoning:

This course covers fundamental programming concepts, including the representation of problems and processes in mathematical and logical forms. It also covers problem-solving strategies which can be used to test and debug computer programs. This supports the Gen Ed principle that students should be able to reason qualitatively and quantitatively.

Translate simple real-world problems into programming algorithms applying a design methodology. Translate programming algorithms into a physical programming language that meets user requirements, and validate input. Analyze questions or problems that impact the community and/or environment using quantitative information. QUANTITATIVE REASONING

This course introduces computer programming and problem solving in a structured program logic environment. Topics include language syntax, data types, program organization, problem solving methods, algorithm design, and logic control structures. Upon completion, students should be able to manage files with operating system commands, use top-down algorithm design, and implement algorithmic solutions in a programming language.

CITC 1301 - *Introduction to Programming and Logic This course is an introduction to the logic necessary for application programming. Topics include logic analysis, techniques of structured design, process flow, and object oriented concepts. A programming language will be used to teach data types, variables, control structures, methods and arrays. [This course was previously INFS 111.]

Semester Availability: (Subject to Change) Fall, Summer

Prerequisites: Acceptable placement scores or completion of all Learning Support Competencies in Reading and Writing or concurrent enrollment in ENGL 0810 and READ 0810 as determined by placement.

Contact Hours: 45 lecture hours per semester

Vocational/Career Program Designation: *Designated primarily for vocational/career programs

This course may be accepted as transfer credit by some colleges and universities, but that decision is made by the receiving institution. This course is collegiate level work, but it has been developed with a purpose other than being a university parallel course.

Credits: (3)

Click here for the Spring 2024 Class Schedule

So you've read through the Introduction to Programming, and you understand the basics of programming, but before you jump into the depths of learning various language syntax rules, there are even more basics that apply to every programming and scripting language. If program code is nothing more than a set of instructions, how does the computer make decisions? A large portion of computer code is contained within logical or conditional statements, and are only executed when certain situations arise.

This course is intended to thoroughly teach the principles of programming logic and procedural coding while reinforcing lessons learned in Introduction to Programming while avoiding the complications of any particular syntax. For this reason, the lessons will contain only pseudocode with occasional mathematical calculations.

Description: The course is an introduction to programming logic and problem solving including programming concepts and terminology. The focus of the course is on critical thinking skills necessary to write computer programs and provides students with an introduction to programming without focusing on the details of programming syntax. This course is intended for students with little or no object-oriented programming experience. Students who have completed CMP 104 will not get credit for CSC 104. (3 lecture hours)SUNY GEN ED-n/a; NCC GEN ED-CMPS, FBAE, MBAE Offered: Fall, Spring, Summer

Description: This course is an introduction to computer programming and algorithmic problem solving using an object-oriented, high level programming language. Emphasis is placed on problem solving strategies that utilize multiple classes and methods. This course will focus on the following concepts: algorithm implementation, modular development, documentation, abstraction and coding along with problem solving strategies. Includes supervised hands-on component. Students who have completed CMP 210 will not receive credit for CSC 120. (4 lecture, 2 laboratory hours) Laboratory fee applies. SUNY GEN ED-n/a; NCC GEN ED-CMPS Offered: Fall, Spring, Summer

Description: This course expands on the design of object-oriented programs introduced in Computer Science I. Students will be introduced to abstract data types including stacks, queues, and lists. Emphasis is placed on the design and implementation of these abstract data types as well as applications that utilize them. Object-oriented programming concepts such as composition, inheritance, polymorphism, and exception handling are utilized throughout this course. An introduction to binary-trees and recursion is provided. Includes supervised hands-on laboratory component. Students who have taken CMP 211 will not receive credit for CSC 130. (4 lecture, 2 laboratory hours) Laboratory fee applies.SUNY GEN ED-n/a; NCC GEN ED-CMPS, FBAE, MBAE Offered: Fall, Spring

Description: The C programming language is widely used in both the computer industry and as a tool for studying advanced topics in the area of Computer Science. Topics include language syntax, scalar and compound data types, pointers, functions, operators, modular coding practices and files. Both the ANSI version and the traditional C are discussed with emphasis on the former. Typically fall day and spring evening. Students who have completed CMP 217 will not receive credit for CSC 217. Laboratory fee applies. SUNY GEN ED-n/a; NCC GEN ED-n/a Offered: Fall, Spring

Description: This course introduces the programming literate student to the advanced data types and structures of priority queues, hash tables, and search trees. The concepts covered in this course include recursion, algorithm efficiency, best and worst time analysis, and advanced tree structures and graphs. Typically fall day and spring evening. Students who have completed CMP 251 will not receive credit for CSC 230. Laboratory fee applies. SUNY GEN ED-n/a; NCC GEN ED-n/a Offered: Fall, Spring

Description: This course introduces students to the emerging field of mobile device software development. Capitalizing upon their prior experience in general-purpose object-oriented program development, students will learn how to write and test programs for handheld devices. Students will learn about the hardware limitations of handheld devices and how to optimize performance for them. Laboratory fee applies. SUNY GEN ED-n/a; NCC GEN ED-n/a Offered: Fall, Spring

Description: Implementation and discussion of registers, addressing modes, relocatability, base arithmetic, data representation, assembly and linkage using a particular instruction set and architecture. Topics include arithmetic calculation, memory organization, flow of control, address modification and access method, bit and byte manipulations, I/O, user and system interrupts, routines and macros. Typically fall evening and spring day. Students who have completed CMP 207 will not receive credit for CSC 250. (4.5 lecture hours) Laboratory fee applies. SUNY GEN ED-n/a; NCC GEN ED-n/a Offered: On Occasion

Description: This course covers the fundamentals of computer architecture and organization. Topics include: classical von Neumann machines, major functional units, primary memory, representation of numerical (both integer and floating point) and non-numerical data, CPU architecture, instruction encoding, the fetch-decode-execute cycle, instruction formats, addressing modes, symbolic assemblers, assembly language programming, handling of subprogram calls at the assembly level, mapping between high level language patterns and assembly/machine language, interrupts and I/O operations, virtual memory management, and data access from magnetic disk. SUNY GEN ED-n/a; NCC GEN ED-n/a Offered: Fall, Spring

3a8082e126