problem solving class 11 computer science

• Book Solutions
• State Boards

NCERT Solutions Class 11 Computer Science Chapter 4 Introduction to Problem Solving

NCERT Solutions Class 11 Computer Science Chapter 4 Introduction to Problem Solving: National Council of Educational Research and Training Class 11 Computer Science Chapter 4 Solutions – Introduction to Problem Solving. NCERT Solutions Class 11 Computer Science Chapter 4 PDF Download.

NCERT Solutions Class 11 Computer Science Chapter 4: Overview

Question 3. Write the pseudocode to print all multiples of 5 between 10 and 25 (including both 10 and 25).

FOR EACH I := 10 TO 15

IF I % 5 :=0   THEN

Question 4. Give an example of a loop that is to be executed a certain number of times.

Answer: Suppose we certain number starting from 11 to 16. The loop will be executed as follow:

SET i: = 11

FOR i: = 11 to 16 do

Question 5. Suppose you are collecting money for something. You need ` 200 in all. You ask your parents, uncles and aunts as well as grandparents. Different people may give either ` 10, ` 20 or even ` 50. You will collect till the total becomes 200. Write the algorithm.

Step 1: Set need Money := 0

Step 2: While Loop (need Money <200)

Input money

Step 3: need Money : = need Money + money

Step 4: End Loop

Question 6. Write the pseudocode to print the bill depending upon the price and quantity of an item. Also print Bill GST, which is the bill after adding 5% of tax in the total bill.

INPUT all_Item

INPUT price_for_each_Item

COMPUTE bill :=totalItem * price_for_each_Item

COMPUTE tax := bill * (5 / 100)

COMPUTE bill_with_gst := bill + tax

PRINT bill_with_gst

Question 7. Write pseudocode that will perform the following: a) Read the marks of three subjects: Computer Science, Mathematics and Physics, out of 100 b) Calculate the aggregate marks c) Calculate the percentage of marks.

INPUT Computer_Science, maths, physics

COMPUTE aggregate := (Computer_Science + maths + physics) / 3

COMPUTE percentage := ((Computer_Science + math + physics) / 300) * 100

PRINT aggregate

PRINT percentage

Question8. Write an algorithm to find the greatest among two different numbers entered by the user.

Step1: READ num1

Step2: READ num2

Step3:IF (num1 > num2)

Question9 . Write an algorithm that performs the following: Ask a user to enter a number. If the number is between 5 and 15, write the word GREEN. If the number is between 15 and 25, write the word BLUE. if the number is between 25 and 35, write the word ORANGE. If it is any other number, write that ALL COLOURS ARE BEAUTIFUL.

Step 1: INPUT n

Step 2: IF n>5 And n<15 THEN

Step 3: PRINT “GREEN”

Step 4: ELSE IF n>15 And n<225 THEN

Step 5: PRINT “BLUE”

Step 6 : ELSE IF n>25 And n<35 THEN

Step 7: PRINT “ORANGE”

Step 8: ELSE

PRINT “ALL COLOURS ARE BEAUTIFUL”

Step 9: End IF

Question 10. Write an algorithm that accepts four numbers as input and find the largest and smallest of them.

Question11. Write an algorithm to display the total water bill charges of the month depending upon the number of units consumed by the customer as per the following criteria:

• for the first 100 units @ 5 per unit
• for next 150 units @ 10 per unit
• more than 250 units @ 20 per unit Also add meter charges of 75 per month to calculate the total water bill .

Step 1: INPUT units

Setp 2: SET bill := 0

Step 3: IF units > 250 THEN

COMPUTE bill := units * 20

IF units <= 100 THEN

COMPUTE bill := units * 5

COMPUTE bill := 100 * 5 + (units – 100) * 10

Step 4: END IF

Step 5: COMPUTE total_Bill := bill + 75

Step 6: PRINT total_Bil

Question 12. What are conditionals? When they are required in a program?

In programming conditionals are used for providing the condition to values, input and output. There are various conditional statements are there to evaluate the expression. Generally conditional statement give us a output in the form of true or false which is known as Boolean value.

Conditionals are required in program to check whether the value is satisfied with required output or not.

In case you are missed :- Previous Chapter Solution

Question 13. Match the pairs

Question14. Following is an algorithm for going to school or college. Can you suggest improvements in this to include other options?

Reach_School_Algorithm

b) Get ready

c) Take lunch box

d) Take bus

e) Get off the bus

f) Reach school or college

• Brush our teeth
• Do some exercise
• Take a bath
• Take a breakfast
• Take a lunch box
• Go to bus stand
• Get off the bus
• Reach school or college

Question 15. Write a pseudocode to calculate the factorial of a number (Hint: Factorial of 5, written as 5!=5 4 3 21 ×××× )

INPUT number

SET factorial := 1, i := 1

WHILE i<= number DO

COMPUTE factorial := factorial * i

INCREASE i by 1

PRINT factorial

Question 16. Draw a flowchart to check whether a given number is an Armstrong number. An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. For example, 371 is an Armstrong number since 3**3 + 7**3 + 1**3 = 371.

Question 17. Following is an algorithm to classify numbers as “Single Digit”, “Double Digit” or “Big”. Classify_Numbers_Algo

INPUT Number

IF Number < 9

“Single Digit”

 Else If Number < 99

“Double Digit”

Verify for (5, 9, 47, 99, 100 200) and correct the algorithm if required.

For given data,

5 and 9 are single digit number, so it will print “single digit”

47 and 99 are double digit number, so it will print “double digit”

100 and 200 is a three digit number, so it will print “big”

Correct algorithm:

Step 1: INPUT Number

Step 2: IF Number <= 9

Step 3: Else If Number <= 99

Step 4: Else

Step 5: End IF

Question 18. For some calculations, we want an algorithm that accepts only positive integers upto 100.Accept_1to100_Algo

IF (0<= Number) AND (Number <= 100)

a) On what values will this algorithm fail?

b) Can you improve the algorithm?

This algorithm fails at value 0. Because in condition we specify “greater than equal to operator”. So it will accept zero also.

IF (0<Number) AND (Number <= 100)

In case you are missed :- Next Chapter Solution

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.

We have a strong team of experienced Teachers who are here to solve all your exam preparation doubts

Justify the statement “industrialisation and urbanisation go hand in hand” in details, creative hindi worksheet for lkg students in pdf, west bengal board class 9 bengali radharani solution, 10 anuched lekhan in hindi for class 10th students.

Sign in to your account

Username or Email Address

Remember Me

Introduction to Problem Solving Class 11 Notes | CBSE Computer Science

Latest Problem Solving Class 11 Notes includes Problem Solving, steps, algorithm and its need, flow chart, pseudo code with lots of examples.

• 1 What is Problem Solving?
• 2 Steps for problem solving
• 3 What is Algorithm?
• 4 Why do we need Algorithm?
• 5.1 Flow chart
• 5.2 Flow Chart Examples
• 5.3 Pseudo code
• 5.4 Pseudo Code Example
• 6.1 Selection
• 6.2 Algorithm, Pseudocode, Flowchart with Selection ( Using if ) Examples
• 6.3 Repetition
• 6.4 Algorithm, Pseudocode, Flowchart with Repetition ( Loop ) Examples
• 7 Decomposition

What is Problem Solving?

Problem solving is the process of identifying a problem, analyze the problem, developing an algorithm for the identified problem and finally implementing the algorithm to develop program.

Steps for problem solving

There are 4 basic steps involved in problem solving

Analyze the problem

• Developing an algorithm
• Testing and debugging

Analyzing the problem is basically understanding a problem very clearly before finding its solution. Analyzing a problem involves

• List the principal components of the problem
• List the core functionality of the problem
• Figure out inputs to be accepted and output to be produced

Developing an Algorithm

• A set of precise and sequential steps written to solve a problem
• The algorithm can be written in natural language
• There can be more than one algorithm for a problem among which we can select the most suitable solution.

Algorithm written in natural language is not understood by computer and hence it has to be converted in machine language. And to do so program based on that algorithm is written using high level programming language for the computer to get the desired solution.

Testing and Debugging

After writing program it has to be tested on various parameters to ensure that program is producing correct output within expected time and meeting the user requirement.

There are many standard software testing methods used in IT industry such as

• Component testing
• Integration testing
• System testing
• Acceptance testing

What is Algorithm?

• A set of precise, finite and sequential set of steps written to solve a problem and get the desired output.
• Algorithm has definite beginning and definite end.
• It lead to desired result in finite amount of time of followed correctly.

Why do we need Algorithm?

• Algorithm helps programmer to visualize the instructions to be written clearly.
• Algorithm enhances the reliability, accuracy and efficiency of obtaining solution.
• Algorithm is the easiest way to describe problem without going into too much details.
• Algorithm lets programmer understand flow of problem concisely.

Characteristics of a good algorithm

• Precision — the steps are precisely stated or defined.
• Uniqueness — results of each step are uniquely defined and only depend on the input and the result of the preceding steps.
• Finiteness — the algorithm always stops after a finite number of steps.
• Input — the algorithm receives some input.
• Output — the algorithm produces some output.

What are the points that should be clearly identified while writing Algorithm?

• The input to be taken from the user
• Processing or computation to be performed to get the desired result
• The output desired by the user

Representation of Algorithm

An algorithm can be represented in two ways:

Pseudo code

• Flow chart is visual representation of an algorithm.
• It’s a diagram made up of boxes, diamonds and other shapes, connected by arrows.
• Each step represents a step of solution process.
• Arrows in the follow chart represents the flow and link among the steps.

Flow Chart Examples

Example 1: Write an algorithm to divide a number by another and display the quotient.

Input: Two Numbers to be divided Process: Divide number1 by number2 to get the quotient Output: Quotient of division

Step 1: Input a two numbers and store them in num1 and num2 Step 2: Compute num1/num2 and store its quotient in num3 Step 3: Print num3

• Pseudo code means ‘not real code’.
• A pseudo code is another way to represent an algorithm.  It is an informal language used by programmer to write algorithms.
• It does not require strict syntax and technological support.
• It is a detailed description of what algorithm would do.
• It is intended for human reading and cannot be executed directly by computer.
• There is no specific standard for writing a pseudo code exists.

Keywords used in writing pseudo code

Pseudo Code Example

Example:  write an algorithm to display the square of a given number.

Input, Process and Output Identification

Input: Number whose square is required Process: Multiply the number by itself to get its square Output: Square of the number

Step 1: Input a number and store it to num. Step 2: Compute num * num and store it in square. Step 3: Print square.

INPUT num COMPUTE  square = num*num PRINT square

Example: Write an algorithm to calculate area and perimeter of a rectangle, using both pseudo code and flowchart.

INPUT L INPUT B COMPUTER Area = L * B PRINT Area COMPUTE Perimeter = 2 * ( L + B ) PRINT Perimeter

Flow of Control

An algorithm is considered as finite set of steps that are executed in a sequence. But sometimes the algorithm may require executing some steps conditionally or repeatedly. In such situations algorithm can be written using

Selection in algorithm refers to Conditionals which means performing operations (sequence of steps) depending on True or False value of given conditions. Conditionals are written in the algorithm as follows:

If <condition> then                 Steps to be taken when condition is true Otherwise                 Steps to be taken when condition is false

Algorithm, Pseudocode, Flowchart with Selection ( Using if ) Examples

Example: write an algorithm, pseudocode and flowchart to display larger between two numbers

INPUT: Two numbers to be compared PROCESS: compare two numbers and depending upon True and False value of comparison display result OUTPUT: display larger no

STEP1: read two numbers in num1, num2 STEP 2: if num1 > num2 then STEP 3: display num1 STEP 4: else STEP 5: display num2

INPUT num1 , num2 IF num1 > num2 THEN                 PRINT “num1 is largest” ELSE                 PRINT “num2 is largest” ENDIF

Example: write pseudocode and flowchart to display largest among three numbers

INPUT: Three numbers to be compared PROCESS: compare three numbers and depending upon True and False value of comparison display result OUTPUT: display largest number

INPUT num1, num2, num3 PRINT “Enter three numbers” IF num1 > num2 THEN                 IF num1 > num3 THEN                                 PRINT “num1 is largest”                 ELSE                                 PRINT “num3 is largest”                 END IF ELSE                 IF num2 > num3 THEN                                 PRINT “num2 is largest”                 ELSE                                 PRINT “num3 is largest”                 END IF END IF

• Repetition in algorithm refers to performing operations (Set of steps) repeatedly for a given number of times (till the given condition is true).
• Repetition is also known as Iteration or Loop

Repetitions are written in algorithm is as follows:

While <condition>, repeat step numbers                 Steps to be taken when condition is true End while

Algorithm, Pseudocode, Flowchart with Repetition ( Loop ) Examples

Example: write an algorithm, pseudocode and flow chart to display “Techtipnow” 10 times

Step1: Set count = 0 Step2: while count is less than 10, repeat step 3,4 Step 3:                  print “techtipnow” Step 4:                  count = count + 1 Step 5: End while

SET count = 0 WHILE count<10                 PRINT “Techtipnow”                 Count = count + 1 END WHILE

Example: Write pseudocode and flow chart to calculate total of 10 numbers

Step 1: SET count = 0, total = 0 Step 2: WHILE count < 10, REPEAT steps 3 to 5 Step 3:                  INPUT a number in var Step 4:                  COMPUTE total = total + var Step 5:                  count = count + 1 Step 6: END WHILE Step 7: PRINT total

Example: Write pseudo code and flow chart to find factorial of a given number

Step 1: SET fact = 1 Step 2: INPUT a number in num Step 3: WHILE num >=1 REPEAT step 4, 5 Step 4:                  fact = fact * num Step 5:                  num = num – 1 Step 6: END WHILE Step 7: PRINT fact

Decomposition

• Decomposition means breaking down a complex problem into smaller sub problems to solve them conveniently and easily.
• Breaking down complex problem into sub problem also means analyzing each sub problem in detail.
• Decomposition also helps in reducing time and effort as different subprograms can be assigned to different experts in solving such problems.
• To get the complete solution, it is necessary to integrate the solution of all the sub problems once done.

Following image depicts the decomposition of a problem

2 thoughts on “Introduction to Problem Solving Class 11 Notes | CBSE Computer Science”

SO HELPFUL AND BEST NOTES ARE AVAILABLE TO GAIN KNOWLEDGE EASILY THANK YOU VERY VERY HEPFUL CONTENTS

THANK YOU SO MUCH FOR THE WONDERFUL NOTES

Leave a Comment Cancel Reply

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.

TutorialAICSIP

A best blog for CBSE Class IX to Class XII

Introduction to problem solving Computer Science Class 11 Notes

This article – introduction to problem solving Computer Science Class 11 offers comprehensive notes for Chapter 4 of the CBSE Computer Science Class 11 NCERT textbook.

Topics Covered

Introduction to problem solving Computer Science class 11

Computers, mobiles, the internet, etc. becomes our essentials nowadays for our routine life. We are using the to make our tasks easy and faster.

For example, earlier we were going to banks and standing in long queues for any type of transaction like money deposits or withdrawals. Today we can do these tasks from anywhere without visiting banks through internet banking and mobiles.

Basically, this was a complex problem and solved by a computer. The system was made online with the help of computers and the internet and made our task very easy.

This process is termed “Computerisations”. The problem is solved by using software to make a task easy and comfortable. Problem solving is a key term related to computer science.

The question comes to your mind how to solve a complex problem using computers? Let’s begin the article introduction to problem-solving Computer Science 11.

Introduction to problem solving Computer Science Class 11 – Steps for problem solving

“Computer Science is a science of abstraction -creating the right model for a problem and devising the appropriate mechanizable techniques to solve it.”

Solving any complex problem starts with understanding the problem and identifying the problem.

Suppose you are going to school by your bicycle. While riding on it you hear some noise coming from it. So first you will try to find that from where the noise is coming. So if you couldn’t solve the problem, you need to get it repaired.

The bicycle mechanic identifies the problem like a source of noise, causes of noise etc. then understand them and repair it for you.

So there are multiple steps involved in problem-solving. If the problem is simple and easy, we will find the solution easily. But the complex problem needs a few methods or steps to solve.

So complex problem requires some tools, a system or software in order to provide the solution. So it is a step-by-step process. These steps are as follows:

Analysing the problem

Developing an algorithm, testing and debugging.

The first step in the introduction to problem solving Computer Science Class 11 is analyzing the problem.

When you need to find a solution for a problem, you need to understand the problem in detail. You should identify the reasons and causes of the problem as well as what to be solved.

So this step involves a detailed study of the problem and then you need to follow some principles and core functionality of the solution.

In this step input and output, elements should be produced.

The second step for introduction to problem solving Computer Science class 11 is developing an algorithm.

An algorithm is a step-by-step process of a solution to a complex problem. It is written in natural language. An algorithm consists of various steps and begins from start to end. In between input, process and output will be specified. More details we will cover in the next section.

In short, the algorithm provides all the steps required to solve a problem.

For example:

Finding the simple interest, you need to follow the given steps:

• Gather required information and data such as principle amount, rate of interest and duration.
• Apply the formula for computing simple interest i.e. si=prn/100
• Now store the answer in si
• Display the calculated simple interest

In the above example, I have started and completed a task in a finite number of steps. It is completed in 4 finite steps.

Why algorithm is needed?

The algorithm helps developers in many ways. So it is needed for them for the following reasons:

• It prepares a roadmap of the program to be written before writing code.
• It helps to clearly visualise the instructions to be given in the program.
• When the algorithm is developed, a programmer knows the number of steps required to follow for the particular task.
• Algorithm writing is the initial stage (first step) of programming.
• It makes program writing easy and simple.
• It also ensures the accuracy of data and program output.
• It increases the reliability and efficiency of the solution.

Characteristics of a good algorithm

The characteristics of a good algorithm are as follows:

• It starts and ends with a finite number of steps. Therefore the steps are precisely stated or defined.
• In the algorithm, the result of each step is defined uniquely and based on the given input and process.
• After completion of the task, the algorithm will end.
• The algorithm accepts input and produces the output.

While writing the algorithm the following things should be clearly identified:

• The input required for the task
• The computation formula or processing instructions

After writing the algorithm, it is required to represent it. Once the steps are finalised, it is required to be represented logically. This logical representation of the program clearly does the following:

• Clears the logic of the program
• The execution of the program

The algorithm is steps written in the form of text. So it is difficult to read sometimes. So if it is represented in pictorial form it would be better for analysis of the program.

The flowchart is used to represent the algorithm in visual form.

Flowchart – Visual representation of an algorithm

A flowchart is made of some symbols or shapes like rectangles, squares, and diamonds connected by arrows. Every shape represents each step of an algorithm. The arrow basically represents the order or link of the steps.

The symbols used in the flow chart are as follows:

Coding is an essential part of the introduction to problem solving ComputerScience11.

• It is pronounced as soo-doh-kohd
• It is one of the ways of representing algorithms in a systematic way
• The word pseudo means not real, therefore pseudocode means not real code
• It is non-formal language, that helps programmers to write code
• It is written in human understandable language
• It cannot be directly read by computers
• There is no specific standard or way of writing pseudocode is there

When an algorithm is prepared, the next step is writing code. This code will be written in a specific programming language. The code follows certain rules and regulations of the programing language and provides solutions.

When coding is done you need to maintain it with proper documentation as well. The best practices for coding procedures must be followed. Because this code can be reviewed a number of times for further development and upgradation.

Let’s understand this step with a simple example!!

When your mother prepares a cake at your home, she will give peace of cake to someone before serving it to check the taste of the cake, right!!! If anything is needed like sugar or softness or hardness should be improved she will decide and do the improvement.

Similarly after writing code testing and debugging are required to check the software whether is providing the solution in a good manner not.

Have look at this also: Computer Science Class XI

Share this:

• Click to share on WhatsApp (Opens in new window)
• Click to share on Telegram (Opens in new window)
• Click to share on Facebook (Opens in new window)
• Click to share on Twitter (Opens in new window)
• Click to share on LinkedIn (Opens in new window)

By Sanjay Parmar

More on this, computer science class 11 sample paper 2023-24 comprehensive guide, split up syllabus computer science class 11 comprehensive guide, comprehensive notes types of software class 11, leave a reply cancel reply.

You must be logged in to post a comment.

• Trending Now
• Foundational Courses
• Data Science
• Practice Problem
• Machine Learning
• System Design
• DevOps Tutorial
• Concept of Comments in Computer Programming
• Modular Approach in Programming
• Classification of Computers
• CBSE Class 11 | Concepts of Programming Methodology
• System Software
• Open Source, Freeware and Shareware Softwares
• Domain Specific Tools
• Cyber safety
• Difference between Algorithm, Pseudocode and Program
• CBSE Class 11 | Computer Science - C++ Syllabus
• Office Tools and Domain Specific Tools
• CBSE Class 11 | Mobile Operating Systems - Symbian, Android and iOS
• Interesting Examples of algorithms in everyday life
• ISC- Class 12 Computer Science 2017
• CBSE Class 11 C++ Sample Paper-3
• CBSE Class 11 C++ | Sample Paper -2
• Difference between fundamental data types and derived data types
• Writing First C++ Program - Hello World Example

CBSE Class 11 | Problem Solving Methodologies

Problem solving process.

The process of problem-solving is an activity which has its ingredients as the specification of the program and the served dish is a correct program. This activity comprises of four steps : 1. Understanding the problem: To solve any problem it is very crucial to understand the problem first. What is the desired output of the code and how that output can be generated? The obvious and essential need to generate the output is an input. The input may be singular or it may be a set of inputs. A proper relationship between the input and output must be drawn in order to solve the problem efficiently. The input set should be complete and sufficient enough to draw the output. It means all the necessary inputs required to compute the output should be present at the time of computation. However, it should be kept in mind that the programmer should ensure that the minimum number of inputs should be there. Any irrelevant input only increases the size of and memory overhead of the program. Thus Identifying the minimum number of inputs required for output is a crucial element for understanding the problem.

2. Devising the plan: Once a problem has been understood, a proper action plan has to be devised to solve it. This is called devising the plan. This step usually involves computing the result from the given set of inputs. It uses the relationship drawn between inputs and outputs in the previous step. The complexity of this step depends upon the complexity of the problem at hand.

3. Executing the plan: Once the plan has been defined, it should follow the trajectory of action while ensuring the plan’s integrity at various checkpoints. If any inconsistency is found in between, the plan needs to be revised.

4. Evaluation: The final result so obtained must be evaluated and verified to see if the problem has been solved satisfactorily.

Problem Solving Methodology(The solution for the problem)

The methodology to solve a problem is defined as the most efficient solution to the problem. Although, there can be multiple ways to crack a nut, but a methodology is one where the nut is cracked in the shortest time and with minimum effort. Clearly, a sledgehammer can never be used to crack a nut. Under problem-solving methodology, we will see a step by step solution for a problem. These steps closely resemble the software life cycle . A software life cycle involves several stages in a program’s life cycle. These steps can be used by any tyro programmer to solve a problem in the most efficient way ever. The several steps of this cycle are as follows :

Step by step solution for a problem (Software Life Cycle) 1. Problem Definition/Specification: A computer program is basically a machine language solution to a real-life problem. Because programs are generally made to solve the pragmatic problems of the outside world. In order to solve the problem, it is very necessary to define the problem to get its proper understanding. For example, suppose we are asked to write a code for “ Compute the average of three numbers”. In this case, a proper definition of the problem will include questions like : “What exactly does average mean?” “How to calculate the average?”

Once, questions like these are raised, it helps to formulate the solution of the problem in a better way. Once a problem has been defined, the program’s specifications are then listed. Problem specifications describe what the program for the problem must do. It should definitely include :

what is the input set of the program

What is the desired output of the program and in what form the output is desired?

2. Problem Analysis (Breaking down the solution into simple steps): This step of solving the problem follows a modular approach to crack the nut. The problem is divided into subproblems so that designing a solution to these subproblems gets easier. The solutions to all these individual parts are then merged to get the final solution of the original problem. It is like divide and merge approach.

Modular Approach for Programming :

The process of breaking a large problem into subproblems and then treating these individual parts as different functions is called modular programming. Each function behaves independent of another and there is minimal inter-functional communication. There are two methods to implement modular programming :

• Top Down Design : In this method, the original problem is divided into subparts. These subparts are further divided. The chain continues till we get the very fundamental subpart of the problem which can’t be further divided. Then we draw a solution for each of these fundamental parts.
• Bottom Up Design : In this style of programming, an application is written by using the pre-existing primitives of programming language. These primitives are then amalgamated with more complicated features, till the application is written. This style is just the reverse of the top-down design style.

3. Problem Designing: The design of a problem can be represented in either of the two forms :

The ways to execute any program are of three categories:

• Sequence Statements Here, all the instructions are executed in a sequence, that is, one after the another, till the program is executed.
• Selection Statements As it is self-clear from the name, in these type of statements the whole set of instructions is not executed. A selection has to be made. A selected number of instructions are executed based on some condition. If the condition holds true then some part of the instruction set is executed, otherwise, another part of the set is executed. Since this selection out of the instruction set has to be made, thus these type of instructions are called Selection Statements.

Identification of arithmetic and logical operations required for the solution : While writing the algorithm for a problem, the arithmetic and logical operations required for the solution are also usually identified. They help to write the code in an easier manner because the proper ordering of the arithmetic and logical symbols is necessary to determine the correct output. And when all this has been done in the algorithm writing step, it just makes the coding task a smoother one.

• Flow Chart : Flow charts are diagrammatic representation of the algorithm. It uses some symbols to illustrate the starting and ending of a program along with the flow of instructions involved in the program.

4. Coding: Once an algorithm is formed, it can’t be executed on the computer. Thus in this step, this algorithm has to be translated into the syntax of a particular programming language. This process is often termed as ‘coding’. Coding is one of the most important steps of the software life cycle. It is not only challenging to find a solution to a problem but to write optimized code for a solution is far more challenging.

Writing code for optimizing execution time and memory storage : A programmer writes code on his local computer. Now, suppose he writes a code which takes 5 hours to get executed. Now, this 5 hours of time is actually the idle time for the programmer. Not only it takes longer time, but it also uses the resources during that time. One of the most precious computing resources is memory. A large program is expected to utilize more memory. However, memory utilization is not a fault, but if a program is utilizing unnecessary time or memory, then it is a fault of coding. The optimized code can save both time and memory. For example, as has been discussed earlier, by using the minimum number of inputs to compute the output , one can save unnecessary memory utilization. All such techniques are very necessary to be deployed to write optimized code. The pragmatic world gives reverence not only to the solution of the problem but to the optimized solution. This art of writing the optimized code also called ‘competitive programming’.

5. Program Testing and Debugging: Program testing involves running each and every instruction of the code and check the validity of the output by a sample input. By testing a program one can also check if there’s an error in the program. If an error is detected, then program debugging is done. It is a process to locate the instruction which is causing an error in the program and then rectifying it. There are different types of error in a program : (i) Syntax Error Every programming language has its own set of rules and constructs which need to be followed to form a valid program in that particular language. If at any place in the entire code, this set of rule is violated, it results in a syntax error. Take an example in C Language

In the above program, the syntax error is in the first printf statement since the printf statement doesn’t end with a ‘;’. Now, until and unless this error is not rectified, the program will not get executed.

Once the error is rectified, one gets the desired output. Suppose the input is ‘good’ then the output is : Output:

(ii) Logical Error An error caused due to the implementation of a wrong logic in the program is called logical error. They are usually detected during the runtime. Take an example in C Language:

In the above code, the ‘for’ loop won’t get executed since n has been initialized with the value of 11 while ‘for’ loop can only print values smaller than or equal to 10. Such a code will result in incorrect output and thus errors like these are called logical errors. Once the error is rectified, one gets the desired output. Suppose n is initialised with the value ‘5’ then the output is : Output:

(iii) Runtime Error Any error which causes the unusual termination of the program is called runtime error. They are detected at the run time. Some common examples of runtime errors are : Example 1 :

If during the runtime, the user gives the input value for B as 0 then the program terminates abruptly resulting in a runtime error. The output thus appears is : Output:

Example 2 : If while executing a program, one attempts for opening an unexisting file, that is, a file which is not present in the hard disk, it also results in a runtime error.

6. Documentation : The program documentation involves :

• Problem Definition
• Problem Design
• Documentation of test perform
• History of program development

7. Program Maintenance: Once a program has been formed, to ensure its longevity, maintenance is a must. The maintenance of a program has its own costs associated with it, which may also exceed the development cost of the program in some cases. The maintenance of a program involves the following :

• Detection and Elimination of undetected errors in the existing program.
• Modification of current program to enhance its performance and adaptability.
• Enhancement of user interface
• Enriching the program with new capabilities.
• Updation of the documentation.

Control Structure- Conditional control and looping (finite and infinite)

There are codes which usually involve looping statements. Looping statements are statements in which instruction or a set of instructions is executed multiple times until a particular condition is satisfied. The while loop, for loop, do while loop, etc. form the basis of such looping structure. These statements are also called control structure because they determine or control the flow of instructions in a program. These looping structures are of two kinds :

In the above program, the ‘for’ loop gets executed only until the value of i is less than or equal to 10. As soon as the value of i becomes greater than 10, the while loop is terminated. Output:

In the above code, one can easily see that the value of n is not getting incremented. In such a case, the value of n will always remain 1 and hence the while loop will never get executed. Such loop is called an infinite loop. Output:

Please Login to comment...

Similar reads.

• School Programming
• 10 Best Slack Integrations to Enhance Your Team's Productivity
• 10 Best Zendesk Alternatives and Competitors
• 10 Best Trello Power-Ups for Maximizing Project Management
• Google Rolls Out Gemini In Android Studio For Coding Assistance
• 30 OOPs Interview Questions and Answers (2024)

Improve your Coding Skills with Practice

What kind of Experience do you want to share?

gradsapp.in

CBSE NCERT Notes Class 11 Computer Science Chapter 4 Introduction to Problem Solving

4. Introduction to Problem Solving

Introduction:

Problem solving is a fundamental skill in computer science that involves identifying, analyzing, and solving complex problems using logical and systematic approaches. In this chapter, we will explore the key concepts and techniques of problem solving in computer science.

4.1 Understanding the Problem:

The first step in problem solving is to clearly understand the problem statement or the requirements. It is essential to analyze the problem and break it down into smaller, manageable components. This involves identifying the inputs, outputs, constraints, and any special conditions that need to be considered.

4.2 Decomposition:

Decomposition is the process of breaking down a complex problem into smaller, more manageable subproblems. It helps in understanding the problem better and allows for a systematic approach to solving it. By decomposing a problem, we can focus on solving each subproblem individually, which leads to a more organized and efficient solution.

4.3 Algorithmic Thinking:

Algorithmic thinking involves designing step-by-step instructions or algorithms to solve a problem. It requires breaking down the problem into logical and sequential steps. An algorithm is a well-defined set of instructions that can be executed to solve a problem. It should be clear, unambiguous, and finite. Algorithmic thinking helps in creating a systematic approach to problem solving.

4.4 Abstraction:

Abstraction is the process of simplifying complex systems or problems by focusing on the essential details and ignoring irrelevant details. It allows us to create models or representations of problems that are easier to understand and work with. By abstracting the problem, we can focus on the key aspects and develop general solutions that can be applied to similar problems.

4.5 Computational Thinking:

Computational thinking is a problem-solving approach that involves thinking like a computer scientist. It involves breaking down a problem into smaller steps, designing algorithms, and using logical reasoning to solve problems efficiently. Computational thinking emphasizes the use of abstraction, decomposition, algorithmic thinking, and pattern recognition to solve problems.

4.6 Testing and Debugging:

Testing and debugging are essential steps in problem solving. After developing a solution, it is important to test it with various inputs to ensure that it produces the expected results. Testing helps in identifying any errors or bugs in the solution. Debugging involves locating and fixing these errors to make the solution function correctly.

Conclusion:

Problem solving is a critical skill in computer science that enables students to tackle complex challenges and develop innovative solutions. By understanding the problem, decomposing it, applying algorithmic thinking, using abstraction and computational thinking, and testing and debugging their solutions, students can effectively solve problems in various domains. Mastering problem-solving techniques not only enhances their problem-solving abilities but also prepares them for a successful career in computer science.

CBSE NCERT Class 11 Computer Science Chapter 4 Introduction to Problem Solving Chapter Notes, Revision Notes, Chapter Summary, Notes PDF, CBSE, NCERT.

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.

IndCareer Schools

School Admissions & Notices

NCERT Book for Class 11 Computer Science Chapter 4 Introduction to Problem-Solving

Share this:

• Click to share on Twitter (Opens in new window)
• Click to share on Facebook (Opens in new window)
• Click to share on LinkedIn (Opens in new window)
• Click to share on WhatsApp (Opens in new window)
• Click to share on Telegram (Opens in new window)

Class 11 Computer Science Chapter 4 Introduction to Problem-Solving: NCERT Book for Class 11 Computer Science Chapter 4 Introduction to Problem-Solving is available for reading or download on this page. Students who are in Class 11 or preparing for any exam which is based on Class 11 Computer Science can refer NCERT Book for their preparation. Class 11th Computer Science NCERT Books PDF Provided will help you during your preparation for both school exams as well as competitive exams.

Here you can read Chapter 4 of Class 11 Computer Science NCERT Book.

NCERT Class 11th Computer Science Chapter 4 Books will give you authentic information and you can rely on them during your preparation. Try practicing the previous papers and sample questions attached in the NCERT Books of Class 11th Computer Science Chapter 4 Introduction to Problem-Solving to solve the questions in your exam easily.

Scroll down for Introduction to Problem-Solving from NCERT Book Class 11 Computer Science Book & important study material.

• 1 NCERT Book for Class 11 Computer Science Chapter 4 Introduction to Problem-Solving
• 2 Download NCERT Book for Class 11 Computer Science PDF
• 3 Buy NCERT Book for Class 11 Computer Science Online
• 4 NCERT Solutions for Class 11 Chapter 4 Introduction to Problem-Solving
• 5.1 Related

Download NCERT Book for Class 11 Computer Science PDF

NCERT books can be downloaded in PDF format from the official website.

Click Here  to go to the page where you can download NCERT Computer Science Book Class 11 PDF.

Buy NCERT Book for Class 11 Computer Science Online

You can buy the Class 11 Computer Science NCERT Book from various online platforms. For your convenience, we have curated a direct link to NCERT Book Class 11 Computer Science. You can simply visit the link to go to the amazon website and order online.

Click Here to go to the Amazon website to buy NCERT Book Class 11 Computer Science Online.

NCERT Solutions for Class 11 Chapter 4 Introduction to Problem-Solving

After reading the chapter, you can refer to our Class 11 NCERT Solutions . Step by Step answers to all the exercise questions is provided by experts to help you prepare better in your examination.

• Get NCERT Solutions for Class 11 Computer Science Chapter 4 Introduction to Problem-Solving
• Get NCERT Solutions for Class 11 Computer Science

All the study material was prepared to help you understand the topic easily and better way. If you like our resources, please share the post!

You can download NCERT Books for 11th Class Computer Science Chapter 4 Introduction to Problem-Solving PDF free of cost on our page.

• CBSE Revision Notes
• CBSE Free Video Lectures
• CBSE Important Questions
• CBSE Objective (MCQs)
• Assertation & Reasoning Questions
• CBSE Syllabus
• CBSE Sample paper
• CBSE Extra Sampler Paper
• Question Bank
• Project, Assignments & Activities
• ICSE Free Video Lectures
• Class 6 ICSE Revision Notes
• CLASS 7 ICSE REVISION NOTES
• CLASS 8 ICSE REVISION NOTES
• CLASS 9 ICSE REVISION NOTES
• CLASS 10 ICSE REVISION NOTES
• Class 6 ICSE Solutions
• CLASS 7 ICSE Solutions
• CLASS 8 ICSE Solutions
• CLASS 9 ICSE Solutions
• CLASS 10 ICSE Solutions
• Class 6 ICSE Important Questions
• CLASS 7 ICSE Important Question
• CLASS 8 ICSE IMPORTANT QUESTIONS
• CLASS 9 ICSE Important Questions
• CLASS 10 ICSE Important Question
• Class 6 ICSE Mcqs Question
• Class 7 ICSE Mcqs Question
• CLASS 8 ICSE MCQS QUESTION
• CLASS 9 ICSE Mcqs Questions
• CLASS 10 ICSE Mcqs Question
• ICSE Syllabus
• Class 6th Quick Revision Notes
• Class 7th Quick Revision Notes
• Class 8th Quick Revision Notes
• Class 9th Quick Revision Notes
• Class 10th Quick Revision Notes
• Class 11th Quick revision Notes
• Class 12th Quick Revision Notes
• Class 6th NCERT Solution
• Class 7th NCERT Solution
• Class 8th – NCERT Solution
• Class 9th NCERT Solution
• Class 10th NCERT Solution
• Class 11th NCERT Solution
• Class 12th NCERT Solution
• Class 6th Most Important Questions
• Class 7th Important Questions
• Class 8th Important Questions
• Class 9th Most Important Questions
• Class 10th Most Important Questions
• Class 11th important questions
• Class 12th important questions
• Class 6th MCQs
• Class 7th MCQs
• Class 8th MCQs
• Class 9th MCQs
• Class 10th MCQs
• Class 11th MCQs questions
• Class 12th Important MCQs
• NCERT Sample Paper
• NCERT Books in Pdf
• NCERT Chapter Mind Maps
• OliveTree Books Study Materials
• Forever With Books Study Material
• Rs Aggrawal Solutions
• RD Sharma Solution
• HC Verma Solution
• Lakhmir Singh Solution
• T.R Jain & V.K ohri Solution
• DK Goel Solutions
• TS Grewal Solution
• Our Products
• Online Tuition Services
• Career Advisor Booking
• Skill Development Courses
• Previous Year Board Exam Papers
• Free Video Lectures

Chapter 4 : Introduction to Problem Solving | class 11th | Ncert solution for computer

• Uncategorized
• Chapter 4 : Introduction to…

NCERT Class 11 Computer Science Solution

Chapter 4 introduction to problem solving.

1. Write pseudocode that reads two numbers and divide one by another and display the quotient.

2. Two friends decide who gets the last slice of a cake by flipping a coin five times. The first person to win three flips wins the cake. An input of 1 means player 1 wins a flip, and a 2 means player 2 wins a flip. Design an algorithm to determine who takes the cake?

3. Write the pseudocode to print all multiples of 5 between 10 and 25 (including both 10 and 25).

4. Give an example of a loop that is to be executed a certain number of times.

5. Suppose you are collecting money for something. You need  200 in all. You ask your parents, uncles and aunts as well as grandparents. Different people may give either  10,  20 or even  50. You will collect till the total becomes 200. Write the algorithm.

6. Write the pseudocode to print the bill depending upon the price and quantity of an item. Also print Bill GST, which is the bill after adding 5% of tax in the total bill.

7. Write pseudocode that will perform the following: a) Read the marks of three subjects: Computer Science, Mathematics and Physics, out of 100 b) Calculate the aggregate marks c) Calculate the percentage of marks

8. Write an algorithm to find the greatest among two different numbers entered by the user.

9. Write an algorithm that performs the following: Ask a user to enter a number. If the number is between 5 and 15, write the word GREEN. If the number is between 15 and 25, write the word BLUE. if the number is between 25 and 35, write the word ORANGE. If it is any other number, write that ALL COLOURS ARE BEAUTIFUL.

10. Write an algorithm that accepts four numbers as input and find the largest and smallest of them.

11. Write an algorithm to display the total water bill charges of the month depending upon the number of units consumed by the customer as per the following criteria: • for the first 100 units @ 5 per unit • for next 150 units @ 10 per unit • more than 250 units @ 20 per unit Also add meter charges of 75 per month to calculate the total water bill .

12. What are conditionals? When they are required in a program?

13. Match the pairs

14. Following is an algorithm for going to school or college. Can you suggest improvements in this to include other options? Reach_School_Algorithm a) Wake up b) Get ready c) Take lunch box d) Take bus e) Get off the bus f) Reach school or college

15. Write a pseudocode to calculate the factorial of a number ( Hint: Factorial of 5, written as 5! =5 × 4× 3× 2×1) .

16. Draw a flowchart to check whether a given number is an Armstrong number. An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. For example, 371 is an Armstrong number since 3 3 + 7 3 + 1**3 = 371.

17. Following is an algorithm to classify numbers as “Single Digit”, “Double Digit” or “Big”. Classify_Numbers_Algo INPUT Number IF Number < 9 “Single Digit” Else If Number < 99 “Double Digit” Else “Big” Verify for (5, 9, 47, 99, 100 200) and correct the algorithm if required

18. For some calculations, we want an algorithm that accepts only positive integers upto 100.

Accept_1to100_Algo INPUT Number IF (0<= Number) AND (Number <= 100) ACCEPT Else REJECT a) On what values will this algorithm fail? b) Can you improve the algorithm?

Author:  noor arora

Related posts.

Class 10th NCERT Science All Activity & Comptency Bases Questions | Important Topics February 29, 2024

Class 10th Science Mind Maps February 29, 2024

NCERT Class 10th Mind Maps February 29, 2024

Chemical reaction and equation Case based question Class 10 November 19, 2023

Chapter 7 Alternating Current Chapter assertation & reasoning Questions class 12th physics May 24, 2023

Chapter 6 Electromagnetic Induction assertation & reasoning Questions class 12th physics May 24, 2023

• Class 6 Maths
• Class 6 Science
• Class 6 Social Science
• Class 6 English
• Class 7 Maths
• Class 7 Science
• Class 7 Social Science
• Class 7 English
• Class 8 Maths
• Class 8 Science
• Class 8 Social Science
• Class 8 English
• Class 9 Maths
• Class 9 Science
• Class 9 Social Science
• Class 9 English
• Class 10 Maths
• Class 10 Science
• Class 10 Social Science
• Class 10 English
• Class 11 Maths
• Class 11 Computer Science (Python)
• Class 11 English
• Class 12 Maths
• Class 12 English
• Class 12 Economics
• Class 12 Accountancy
• Class 12 Physics
• Class 12 Chemistry
• Class 12 Biology
• Class 12 Computer Science (Python)
• Class 12 Physical Education
• GST and Accounting Course
• Excel Course
• Tally Course
• Finance and CMA Data Course
• Payroll Course

Interesting

• Learn English
• Learn Excel
• Learn Tally
• Learn GST (Goods and Services Tax)
• Learn Accounting and Finance
• GST Tax Invoice Format
• Accounts Tax Practical
• Tally Ledger List
• GSTR 2A - JSON to Excel

Are you in school ? Do you love Teachoo?

We would love to talk to you! Please fill this form so that we can contact you

You are learning...

Computer Science - Class 11

Click on any of the links below to start learning from Teachoo ...

Do you want to learn more about the fascinating and diverse field of computer science? Do you want to develop your skills and knowledge in programming, data structures, algorithms, databases, networking, etc.? Do you want to prepare yourself for higher studies and careers in computer science and related fields?

If you answered yes to any of these questions, then you will benefit from studying computer science class 11. Computer science class 11 is a comprehensive and rigorous course that covers the core concepts and principles of computer science. Computer science class 11 will help you understand how computers work and how they can be used to solve various problems.

Some of the topics you will cover in computer science class 11 are:

• The introduction to computer science: How computer science is defined, divided, and related to other disciplines. 📚🔎👥
• The basics of Python: How Python is a simple and powerful programming language that can be used for various purposes. 🐍👍
• The data types and operators: How data types and operators are used to store and manipulate data in Python. 📊📈📉
• The control structures: How control structures such as if, else, elif, for, while, etc. are used to control the flow of execution in Python. 💻🖱️👍
• The functions: How functions are used to modularize and reuse code in Python. 💬🔎👏
• The lists, tuples, and dictionaries: How lists, tuples, and dictionaries are used to store and access data in Python. 💥😥🚱💧
• The strings: How strings are used to store and manipulate text data in Python. 📄💵🔙
• The file handling: How file handling is used to store and manage data in files using Python. 📒👀
• The object-oriented programming: How object-oriented programming is used to create and use objects, classes, methods, inheritance, etc. in Python. 🐶🐱🐭
• The database concepts: How database concepts such as tables, records, fields, keys, etc. are used to store and manipulate data in databases. 🗄️🗃️
• The structured query language: How structured query language (SQL) is used to communicate with databases and perform various operations on data. 🗣️👂

By studying computer science class 11, you will gain a deeper understanding of how  computer science is the study of computation and its applications . You will also develop critical thinking skills to solve various problems and cases using computer science. You will also appreciate  the importance of Python as a versatile and powerful language  for various domains and purposes.

Chapter 2 Class 11 - Encoding Schemes and Number System

Chapter 12 class 11 - boolean algebra, chapter 4 class 11 - introduction to problem solving, chapter 5 class 11 - getting started with python, chapter 1 class 11 - computer systems, chapter 6 class 11 - flow of control, chapter 7 class 11 - functions, chapter 8 class 11 - strings, chapter 9 class 11 - lists, teachoo sample paper, chapter 10 class 11 - tuples and dictionaries, chapter 11 class 11 - societal impact, chapter 13 class 11 - cyber safety.

What's in it?

Hi, it looks like you're using AdBlock :(

Please login to view more pages. it's free :), solve all your doubts with teachoo black.

Computer Science Class 11 NCERT Solutions

Computer Science Class 11 NCERT Solutions – The NCERT textbooks for computer science class 11 typically include questions and answers at the end of each chapter or section. These questions and answers are designed to test the students’ understanding of the concepts covered in the chapter. They range from simple factual questions to more complex problem-solving questions and may include multiple-choice questions, fill-in-the-blank questions, true or false questions, and short-answer questions. students can develop their critical thinking and problem-solving skills with the help of NCERT texbook Questions and Answers.

Computer Systems and Organisation

• Basic Computer Organisation
• Encoding Schemes and Number System

Computational Thinking and Programming – 1

• Introduction to problem solving
• Getting Started with Python
• Conditional statement and Iterative statements in Python
• Function in Python
• String in Python
• Lists in Python
• Tuples and Dictionary in Python
• Society, Law and Ethics

THE PATH TO SUCCESS IN EXAM...

Class 11 Computer Science NCERT Exercise Solution

Class 11 – computer science – ncert solution, class 11 ncert exercise solution of computer science, computer science exercise class 11 ncert solution.

Chapter 7: Functions

NCERT Book Solution Computer Science of Class 11

Related posts.

Society, Law, and Ethics: Societal Impacts – Notes

Data structure: stacks – notes.

Python Revision Tour I : Basics of Python – Notes

Introduction to Python Module – Notes

Tuples manipulation in python notes.

Data Handling – Notes

Python Fundamentals – Notes

Getting Started with Python – Notes

Leave a comment cancel reply.

You must be logged in to post a comment.

You cannot copy content of this page

Browse Course Material

Course info, instructors.

• Dr. George Kocur
• Dr. Christopher Cassa
• Prof. Marta C. Gonzalez

Departments

• Civil and Environmental Engineering

As Taught In

• Programming Languages
• Software Design and Engineering
• Computational Science and Engineering

Learning Resource Types

Introduction to computers and engineering problem solving, course description.

This course presents the fundamentals of object-oriented software design and development, computational methods and sensing for engineering, and scientific and managerial applications. It cover topics, including design of classes, inheritance, graphical user interfaces, numerical methods, streams, threads, sensors, and …

This course presents the fundamentals of object-oriented software design and development, computational methods and sensing for engineering, and scientific and managerial applications. It cover topics, including design of classes, inheritance, graphical user interfaces, numerical methods, streams, threads, sensors, and data structures. Students use Java ® programming language to complete weekly software assignments.

How is 1.00 different from other intro programming courses offered at MIT?

1.00 is a first course in programming. It assumes no prior experience, and it focuses on the use of computation to solve problems in engineering, science and management. The audience for 1.00 is non-computer science majors. 1.00 does not focus on writing compilers or parsers or computing tools where the computer is the system; it focuses on engineering problems where the computer is part of the system, or is used to model a physical or logical system.

1.00 teaches the Java programming language, and it focuses on the design and development of object-oriented software for technical problems. 1.00 is taught in an active learning style. Lecture segments alternating with laboratory exercises are used in every class to allow students to put concepts into practice immediately; this teaching style generates questions and feedback, and allows the teaching staff and students to interact when concepts are first introduced to ensure that core ideas are understood. Like many MIT classes, 1.00 has weekly assignments, which are programs based on actual engineering, science or management applications. The weekly assignments build on the class material from the previous week, and require students to put the concepts taught in the small in-class labs into a larger program that uses multiple elements of Java together.

You are leaving MIT OpenCourseWare

Search Cornell

Class Roster

Section menu.

• Toggle Navigation
• Summer 2024
• Spring 2024
• Winter 2024
• Archived Rosters

Last Updated

• Schedule of Classes - April 11, 2024 7:34PM EDT
• Course Catalog - April 11, 2024 7:07PM EDT

COGST 1101 Introduction to Cognitive Science

Course description.

Course information provided by the Courses of Study 2023-2024 . Courses of Study 2024-2025 is scheduled to publish mid-June.

This course provides an introduction to the science of the mind. Everyone knows what it's like to think and perceive, but this subjective experience provides little insight into how minds emerge from physical entities like brains. To address this issue, cognitive science integrates work from at least five disciplines: Psychology, Neuroscience, Computer Science, Linguistics, and Philosophy. This course introduces students to the insights these disciplines offer into the workings of the mind by exploring visual perception, attention, memory, learning, problem solving, language, and consciousness. 

When Offered Fall, Summer.

Distribution Category (ETM-AS, KCM-AS)

Comments A one credit Writing in the Majors section is available, COGST 1104.

View Enrollment Information

  Regular Academic Session.   Combined with: CS 1710 ,  HD 1102 ,  LING 1170 ,  PHIL 1620 ,  PSYCH 1102

Credits and Grading Basis

3 Credits Stdnt Opt (Letter or S/U grades)

Class Number & Section Details

10690 COGST 1101   LEC 001

Meeting Pattern

• TR 11:40am - 12:55pm To Be Assigned
• Aug 26 - Dec 9, 2024

Instructors

To be determined. There are currently no textbooks/materials listed, or no textbooks/materials required, for this section. Additional information may be found on the syllabus provided by your professor.

For the most current information about textbooks, including the timing and options for purchase, see the Cornell Store .

Additional Information

Instruction Mode: In Person

Or send this URL:

Available Syllabi

About the class roster.

The schedule of classes is maintained by the Office of the University Registrar . Current and future academic terms are updated daily . Additional detail on Cornell University's diverse academic programs and resources can be found in the Courses of Study . Visit The Cornell Store for textbook information .

Please contact [email protected] with questions or feedback.

If you have a disability and are having trouble accessing information on this website or need materials in an alternate format, contact [email protected] for assistance.

Cornell University ©2024