• Data Structures & Algorithms
  • C programming
  • Machine Learning
  • Database Management System
  • Operating System
  • Computer Network
  • Web Development
  • Engineering Mathematics Tutorials
  • Computer Organization and Architecture Tutorial
  • System Design

BCA 1st Semester Syllabus (2023)

Fundamentals of it & computers.

  • Basics of Computer and its Operations
  • Characteristics of Computer System
  • Types of Computers
  • Number System and Base Conversions
  • What is Algorithm | Introduction to Algorithms
  • What is a Flowchart and its Types?
  • What is an Operating System?
  • DOS Full Form
  • Types of Operating Systems
  • Commonly Used Operating System
  • Difference between Word Processor and Text Editor
  • Introduction to Microsoft Word
  • Introduction to MS Excel
  • Introduction to Microsoft PowerPoint

C Programming

  • C Programming Language Tutorial
  • Operators in C
  • Control Structures in Programming Languages
  • C if else if ladder
  • Nested switch case
  • Introduction to Divide and Conquer Algorithm - Data Structure and Algorithm Tutorials
  • Understanding Time Complexity with Simple Examples
  • What is PseudoCode: A Complete Tutorial
  • Arithmetic Operators in C
  • C Functions
  • Parameter Passing Techniques in C
  • Difference Between Call by Value and Call by Reference in C
  • Scope rules in C

Basic Mathematics

  • Determinant of a Matrix
  • Mathematics | Limits, Continuity and Differentiability
  • Advanced Differentiation
  • Chain Rule: Theorem, Formula and Solved Examples
  • Taylor Series
  • Relative Minima and Maxima
  • Beta Function
  • Gamma Function
  • Reduction Formula
  • Vector Algebra

Business Communication

  • What is Communication?
  • Communication and its Types
  • BCA 2nd Semester Syllabus (2023)
  • BCA 3rd Semester Syllabus (2023)
  • BCA 4th Semester Syllabus (2023)
  • BCA 5th Semester Syllabus (2023)
  • BCA 6th Semester Subjects and Syllabus (2023)
  • BCA Full Form
  • Bachelor of Computer Applications: Curriculum and Career Opportunity

BCA stands for Bachelor of Computer Applications. It is an undergraduate academic degree in the field of computer science. The curriculum is designed to provide students with a strong foundation in the field of computer science and to prepare them for careers in software development, programming, and other related fields.

BCA Course is generally divided into 6 semesters. In this article, we will provide a comprehensive overview of the BCA Semester 1 Syllabus , and its important topics.

This  BCA 1st Semester Syllabus covers a wide range of topics that are essential for a foundation in computer science. In this Semester 1 of BCA Program, students will learn about various fundamental concepts such as computers, programming, mathematics, communication and mor e. BCA Semester 1 syllabus is designed by experts to provide students with a solid foundation in the fundamentals concepts of computer science. Students who complete this syllabus will be well prepared for further studies in computer science or related fields.

BCA 1st Semester Syllabus

BCA 1st Semester Syllabus consist of important subjects such as Fundamentals of IT & Computers, C Programming, Digital Electronics & Computer Organization, Basic Mathematics, Business Communication and more . Here is the BCA syllabus for Semester 1:

2

Boolean Algebra, Logic Gates, Combinational Logic, Sequential Logic, Microprocessors, Microcontrollers, Memory Organization, Input/Output Interfacing

Programming in C, Basic DSA (Array, Stack, Queue), Basic Sorting and Searching Algorithms

The subjects in BCA 1st semester provide a solid foundation in the fundamentals of information technology and computers. These subjects are essential for students who want to pursue a career in information technology. They will help students develop their problem-solving skills, communication skills, and their ability to write and debug code. Students who successfully complete these courses will have a strong foundation in the fundamentals of information technology and computers, which will give them the knowledge and skills they need to succeed in their careers.

Please Login to comment...

Similar reads.

  • Computer Subject
  • GFG Academy

Improve your Coding Skills with Practice

 alt=

What kind of Experience do you want to share?

Experience Teachmint X - AI driven Interactive Flat Panels and Smart Boards

img

More from prajwal kumar

Recommended content, learn from anywhere on any device.

Top Leader by G2

Top Performer by SourceForge

Top Leader by SoftwareSuggest

Ranked Amongst Top 25 Companies by LinkedIn

ISO27001 Certified

Most Preferred Workplace

We use cookies to enhance site navigation and analyse usage, read our Privacy Policy for more.

problem solving techniques using c bca 1st sem nep syllabus

  • PRIVACY POLICY

EDUCSECTOR

B.C.A. SEMESTER –I (NEP SYLLABUS) - SOLVED - MODEL QUESTION PAPER

problem solving techniques using c bca 1st sem nep syllabus

B.C.A. SEMESTER –I (NEP SYLLABUS)

SOLVED - MODEL QUESTION PAPER

QUESTION PAPER PATTERN I

I. 10 objective questions 5 from Unit I and 5 from Unit II        10x01=10

II. 01 essay type question out of 2 from Unit I                          01x10=10

III. 01 essay type question out of 2 from Unit II                       01x10=10

IV. 02 questions out of 4: from Unit III                                    02x05=10

V. 04 Language Activity out of 6: from Unit IV                       04x05=20

I. Answer the following questions in a word, a phrase or a sentence each: 10x1=10

1) What is the elixir of life?

Ans: Water is real elixir of life. Divine Amrita is imaginary elixir of life.

2) What are the commonest words spoken by English speakers?

Ans: “Yes” and “No” are the commonest words spoken by English speakers.

3) Who is Baldeo?

Ans: Baldeo is watchman.

4) In which institute did Shaw deliver his speech on the topic Spoken English and Broken English?

Ans: Shaw delivered his speech in Lingua- phone institute on the topic Spoken English and Broken English.

5) Who is the author of ‘Tiger in the Tunnel’?

Ans: Ruskin Bond is the author of “Tiger in the Tunnel”.

6) Who will make the temples for Shiva?

Ans: Rich people will make the temples for Shiva.

7) What is the theme of the poem ‘To India, My Native Land’?

Ans: The theme of the poem “To India, My Native Land” is patriotism and nationalism.

8) How many roads diverged in the wood?

Ans: Two roads diverged in the wood.

9) How was India worshipped in the past?

Ans: India was worshipped as deity (Goddess) in the past.

10) What is the expression ‘things standing’ mean in Vachana 820?

Ans: The expression “things standing” in Vachana 820 is Manmade temples.

a) What are the measures suggested by C. V. Raman to control the movement of water in order to harness it for useful purposes?

Ans: Water is true elixir of life. It is very important for all living creature and plant. Our agriculture is relied upon water. C. V. Raman says that water gives beauty to the nature. He gives the example of rain red tanks which assume an extremely important part in south Indian agriculture. They are wonderful cheering sight when they are full. Yet, they are not very much kept maintained. These tanks are shallow. The water in these tanks is full of silt. The colour of the water in rain fed tanks changes as according to the catchment region from which the water comes. Swiftly flowing water can carry enormous and heavy particles. The best particles stay drifting in the water. Large areas of land can be changed into silt laden water. Collection and utilization of rain water is vital in light of the fact that our Indian agriculture relies upon seasonal rainfall. A large part of the rain water flows down into the seas and the ocean. So a huge amount of water is lost. The appropriate utilization of this flowing water is a great national problem. Planting of trees is dire need of India. They would assist with saving the rain water of the country from flowing away to waste. He recommended ways like construction of dams, reservoirs in the water to control the overflow of water.

b) Write about the qualities of bravery presented in the lesson The Tiger in the Tunnel.

Ans: Baldeo exhibits the courage to keep on taking care of his work even with overpowering conditions. One manner by which Baldeo shows mental fortitude is in his tirelessness in taking care of his work. Baldeo works late hours at a station that is a station. He bulges down for a task that doesn't convey much in the method of notoriety and little salary. This can be seen when he needs to get up in the center of the night to do his obligation. The tiger approaches Baldeo unquestionably on the grounds that he can see obviously in darkness. Furthermore, the tiger can stand to be sure: it is a quick, incredible animal and has an inborn capacity to hold its endurance in any pursuit.

The tiger has likewise gone after man for quite a long time, and it knows about the tendencies for people. Concerning Baldeo, he is crushed in light of the fact that he loses his weapon during his battle with the tiger. The tiger first hits out at Baldeo with his paw. Baldeo, expecting the tiger's turn, jumps to the side and brings his axe down on the creature's shoulder. The tiger roars in agony and searches for another chance. In the mean time, Baldeo cuts his axe down once more, this time on the tiger's leg. The blow nearly cuts off the creature's leg. Sadly, the fight isn't finished. Baldeo's axe gets struck in the bone of the tiger's leg. Without his axe, Baldeo is unprotected. Seeing its chance, the tiger jumps and cuts its human adversary down. The horrendous experience closes with Baldeo's deplorable demise.

a) Critically appreciate the poem The Road Not Taken??

Ans: This is an inspirational poem and quite tricky, according to Robert Frost himself. The poem presents an anti-thesis. The traveler comes to a fork and wishes to take both, which is impossible. First, one of the roads is described as grassy and ‘wanting wear’, then he says that both the roads look the same. This represents the eternal dilemma in man when he finds the grass greener on the other side. This poem is call for the reader to forge his or her way in life and not follow the path that others have taken. This poem encourages self-reliance, reinforces the power of independent thinking and sticking to one’s decisions. The poet does not moralize about choice. He simply says that choice is inevitable and you will never know until you have lived the difference. So there is nothing right or wrong about a choice, it is all relative. Whatever direction one takes one must pack it with determination and zest for one can never turn the clock back, or relive that moment.

b) Describe the ideas of spirituality in the Vachana 820.

Ans: The temple and the body (Vachana) a beautiful poem, Basvanna tells us that rich man can build temples for Shiva but a poor man cannot afford it. He compares his body as temple, where his legs as pillars, his body as shrine and his head as cupola. He says that things, structures could destroy as passes but the soul which is a part of God cannot destroy, it is eternal. He is comparing the human body to a temple because the speaker was unable to construct temple and the speaker compared his body a temple. As human soul is a part of God, similarly God’s idol is placed in the temple as the soul lives in the body.

IV ATTEMPT ANY TWO OF THE FOLLOWING QUESTIONS;

1) Draft a copy of your introduction to present yourself in front of a panel of Interviewers as an eligible candidate for the post of an Asst. teacher.

Ans: Good Morning sir/madam,

It's my pleasure to talk with you. I'm Aditya R. I belong to Hubli basically. I have been living in Dharwad for three years presently. I stay here with my family. Other than my parents, there is a younger sibling in my family. Presently, I am searching job opportunities in the reputed firms as I have completed my BSC degree from RCUB.

I'm exceptionally interested by the Physics subject. That was the reason I decided to seek after post graduation in Physics. Post that, my internship experience and other practical projects in the school and college additionally supported my advantage in graduation as a full-time career option. In addition to the fact that I am energetic with regards to the field I graduated, I am also inclined towards inventive exercises like singing, dancing, painting, acting, and etc. I have always been a functioning student in school and college. I have taken part in numerous cultural events during my school and college days and have won many honors.

In my extra time, I appreciate going out with companions and attempting new cooking styles. I additionally appreciate watching films, paying attention to music, perusing, working out, and going on travels. I'm anticipating find out about this opportunity and I will be glad to address more questions.

2) Draft a congratulatory note on the success of your friend in getting selected in the state cricket team.

Ans: Hi Tarun,

I hope you are healthy and in the best perspective. I'm exceptionally glad to know that you have been selected for State Cricket Team. You have truly worked sincerely and you deserve this achievement. I'm pleased with you. I salute you on your splendid achievement. First of all, accept my congratulations for getting selected for the State Cricket Team. I have full trust and confidence in your playing abilities and I am sure you will make a way to the national and international field from here. I realize you will amaze the selectors with your splendid batting and bowling abilities. My parents are extremely happy over your selection. They have additionally sent their greetings and all the best for next levels. All the best for the next rounds and achieve your goal. The rest is fine. Kindly, keep us updated with about to the results. Congrats to you once more. If it's not too much trouble, pay my respects to your parents.

3) Draft a dialogue between student and office clerk about the scholarship schemes and procedure of online application. 

Ans: Student: Good Morning Sir! Clerk: Good Morning! Student: Sir, I am studying in First Year BCA and I want to enquire about the scholarship. Clerk: What do you want to know about? Student: Sir, I want to apply for the SSP scholarship scheme. Clerk: Well, have you read the notice regarding this? Student: Yes Sir, I have. But it says I have to apply online. Can you help me in understanding the online procedure? Clerk: Sure. You have to register on www.ssp.in. If you have your previous year marks card, income caste, bank passbook and AADHAR card, the registration process will be easy and fast for you. Student: Ok Sir. What comes after that? Clerk: After you log in, navigate to scholarship schemes available and select the one you want to apply for. Once you complete the online form, take a print and submit it in the office. Student: Will I require anything else while applying online? Clerk: Of course, photos and documents as mentioned in the notice. Student: Thank you so much for the help Sir. Clerk: My pleasure. Do submit the form before the deadline. Student: Sure Sir. 

4) Introduce your family members to your friend on his/her first visit to your home.

Ans: I live in a huge house with my family. This is a two-storey building with more than seven rooms. I live on the first floor and this room is nearly more modest than different rooms. It is a south-facing room with a delightful nursery and lake view. As I am as yet a student, the room gives the feeling that a student lives there. Let me introduce you my family members. I have a little family and there are just five members including my father, mother, younger sister, younger sibling and I am eldest son of the family.

As I said we have five members in our family including me. My dad is an engineer. My mom is a professor and a cherishing and caring person. We love our parents very much. My younger sister is in grade 9 and she has got every one of the insane and inventive thoughts and she shares the vast majority of her secrets with me. My younger brother is concentrating on math at a college and he has an enthusiasm for playing football. He dreams to turn into an expert football player sometime however I have my doubts about it. I have as of late finished my Bachelor Degree in Bachelor of Computer Applications and have a plan to complete my Master Degree from a reputed university. We are a happy family and offer a solid bonding that makes us care for one another a great deal.

  Hi mum! Hi Dad! I need to both of you to see somebody. She is Riya. We met recently in the college and she has become probably my closest companion. She was so quick to meet you too that I at last brought her here. Trust both of you will treat her well.

V ANSWER ANY FOUR OF THE FOLLOWING SETS            4X5=20

A) USE THE FOLLOWING WORDS AS DIRECTED:

1) ‘Qualification’ as a verb in a sentence

Ans:   He is highly qualified for the job.

2) ‘Assess’ as a noun in a sentence

Ans: Your recent job assessment is excellent.

3) ‘Free’ as an adverb in a sentence

Ans: The criminals suddenly broke gate of prison and ran freely.

4) ‘Courage’ as a verb in a sentence

Ans: She encouraged him when had lost his courage.

5) ‘Beauty’ as an adjective

Ans: She is the most beautiful maid in the kingdom.

B) FILL IN THE BLANKS WITH THE SUITABLE ARTICLES: THE SUITABLE

1) It was an interesting poem.

2) This is the most unkind cut of all.

3) He applied for an NOC from the office.

4) That was a simple task.

5) He wants to work in a university.

C) FILL IN THE BLANKS WITH SUITABLE PREPOSITIONS:

1) I congratulated him for his success in the sports.

2) Corona had spread throughout India.

3) My sister is senior to me.

4) She was prevented from entering into the stadium.

5) I don’t believe in superstition.

D) CONVERT THE FOLLOWING DIRECT QUESTIONS INTO INDIRECT QUESTIONS:

1) Is he the captain of the team?

Ans: Can you tell me if he is the captain of the team?

2) Are they happy with their results?

Ans: Can you tell me if they are happy with their results.

3) Will he be there tomorrow?

Ans: Can you tell me if he will be there tomorrow.

4) Was it his principal’s home?

Ans: Can you tell me if it was his principal’s home.

5) Was he late for the class?

Ans: Can you tell me if he was late for the class.

E) FRAME THE NEGATIVE QUESTIONS

1) He is sure of his success.

Ans: Is not he sure of his success.

2) He understood everything.

Ans: Did not he understand everything?

3) He was late for the class.

Ans: Was not he late for the class?

4) The girl got what she desired.

Ans: Did not the girl get what she desired?

5) It is easy to work hard and get success.

Ans: Is not it easy to work hard and get success?

F) FRAME THE QUESTIONS AS DIRECTED.

1) He was working in the factory . (Frame WH question so as to get the underlined word as answer)

Ans: Where was he working?

2) The captain led the team to victory. (Frame WH question so as to get the underlined word as answer)

Ans: Who did lead the team to victory?

3) He made a mistake, ……..(Tag)

Ans: didn’t he?

4) You could help me lift this bag. (Frame Yes/no question)

Ans: Could you help me lift this bag?

5) You usually walk to work. (Frame Yes/no question)

Ans: Do you usually walk to work?

B.C.A. SEMESTER –I (NEP SYLLABUS) - SOLVED - MODEL QUESTION PAPER

It's good & helpfull

Good and helpful

Very fantastic 👍

Thank you soo much it's very helpful 💝

Good helpful

Thank you so much help ful😊

Please do not enter any spam link in comment box

CONTACT FOR ENGLISH NOTES

Copyright (c) 2020 - 2023 educsector.com All Rights Reserved.

close

Problem solving UNIT - 4 [C PROGRAMMING] (BCA I SEM)

Mansi  Tyagi

The document discusses various problem solving techniques including trial and error, brainstorming, and divide and conquer. It explains the steps in problem solving as understanding the problem, devising a plan, carrying out the plan, and looking back. It also covers algorithms, pseudocode, flowcharts, and complexity analysis. Key problem solving techniques are trial and error, which uses multiple attempts to find a solution, and brainstorming, where a group generates many ideas without criticism. Divide and conquer breaks a problem into subproblems, solves them recursively, and combines the solutions. Read less

problem solving techniques using c bca 1st sem nep syllabus

Recommended

More related content, what's hot, what's hot ( 20 ), similar to problem solving unit - 4 [c programming] (bca i sem), similar to problem solving unit - 4 [c programming] (bca i sem) ( 20 ), more from mansi tyagi, more from mansi tyagi ( 20 ), recently uploaded, recently uploaded ( 20 ).

  • 1. (UNIT-4 ) PPA Notes by: Mansi Tyagi PPA (UNIT - 5) INTRODUCTION TO Problem Solving In general, in our daily life ,we face a variety of problems that may be related to any field. The same problem can be solved in different way by different person and the techniques used for the solution by someone may be correct.  The nature of the problem depends on the situation.  Problem solving may be an art or science.It includes special knowledge in the fields to which the problem relates to and power of knowledge without learning,human reasoning and experience.  In problem solving each individual may have his or her own unique way. Therefore ,prior to the solution of any problem one should follow the following basic steps that may give a clear and better idea for the solution of any problem: Framework for problem solving: STEP1: Understanding the problem In this step you should try to understand the actual problems by asking the following basic questions:  Can you state the problems in your own words?  What are you trying to find or do?  What are unknowns?
  • 2. (UNIT-4 ) PPA Notes by: Mansi Tyagi STEP2: Devising a Plan/Making a plan of solution Its very useful to prepare a good plan for the solution of given problems:  Look for a pattern  Examine related problems.  Make a table,diagrams & equation if required  Use quess and check STEP3: Carrying out the plan Implement the strategies in step 2 and perform any necessary actions or computations.This may be a formal proof of each step.finally keep an accurate record of your work for further use. STEP4: Looking back/Verifying After successful carrying out the plan,following should be checked:  Check the results in the original problem.  Interpret the solution in terms of the original problem. BRB11 PROBLEM SOLVING TECHNIQUES TRIAL AND ERROR TECHNIQUES BRAIN STORMING TECHNIQUES DIVIDE & CONQUER TECHNIQUES
  • 3. (UNIT-4 ) PPA Notes by: Mansi Tyagi 1. TRIAL AND ERROR TECHNIQUE//METHOD : Some complex problems can be solved by a technique that is called trial and error.Trial and error is typically good for problems where you have multiple chances to get the correct solution.  The purpose of trial and error is not to find out why a problem was solved.its primarily used to solve the problem.  Trial and error is used to find a single solutions to a single problem.  Trial and error is used best when it is applied to situations that give your large amounts of time and safety to come up with a solution. For example :while trial and error may be excellent in finding solutions to mechanical or engineering problems. Advantages :  It does not require you to have a lot of knowledge.  It also plays an important role in the scientific method as well.  Trail and error is also an excellent tool for inventors. 2. BRAIN STORMING TECHNIQUES : “Brainstoring is a group method for obtaining new ideas and business solutions.The groups are organized for sitting together and stimulate
  • 4. (UNIT-4 ) PPA Notes by: Mansi Tyagi greater creativity by exchange of mutual experiences and participating in the discussions.”  Brainstorming can be an effective way to generate lots of ideas on a specific issue and then determine which ideas is the best solution.  It is most effective with groups of 8-12 people and should be performed in a relaxed environment.If participants feel free to relax and joke around,they will stretch their minds further and therefore produce more creative ideas. For example: It is commonly used for advertising,the development of new products,process management and business planning. There are four basic rules in brainstorming : 1. No Criticism : Criticism is reserved for the evaluation stage of the process.This allows the members to feel comfortable with the idea of generating unusual ideas. 2. Welcome unusual ideas :Unusual ideas are welcomed as it is normally easier “tame down” than to “tame up ” as new ways of thinking and looking at the world may provide better solutions. 3. Quantity wanted: The greater the number of ideas generated,the greater the chance of producing an effective solution. 4. Combine and improve ideas: combine ideas in order to make them better. Advantages :  Encouraged creative thinking  All ideas are accepted.
  • 5. (UNIT-4 ) PPA Notes by: Mansi Tyagi  Makes everyone part of team  Easy and simple technique. STEPS OF BRAINSTORMING : 3. DIVIDE AND CONQUER TECHNIQUES : In the technique,the main problem is divided into several smaller sub problems and then it is solved recursively.At last combine these solutions to create the solution of the original problem. Divide and conquer approach normally follow the following steps- Define the problem /Explain the topic Set a time limit Encourage Ideas Records the ideas Clarifying Evaluate ideas Create possible solution
  • 6. (UNIT-4 ) PPA Notes by: Mansi Tyagi  Divide : Divide the original problem into a set of sub problems  Conquer : Solve each sub problem individually and recursively if required.  Combine: Finally, combine the solutions of the sub problems into a solution of the entire original problem. Divide and conquer strategy PROBLEM OF SIZE “n” Subproblem 2 of size n/2Subproblem 1 of size n/2 Solution to Subproblem 1 Solution to Subproblem 2 Solution to the Original Problem
  • 7. (UNIT-4 ) PPA Notes by: Mansi Tyagi Seven Steps to Problem Solving 1.Define & identify the problem: The first step is critical .its essential for each group member to cearly understand the problem so that all energy will be focused in the same direction. 2.Analyze the problem : In this stage of problem solving, questions should be asked and information gathered. Do not make the mistakes of assuming you know what is causing the problem without an effort to fully investigate the problem you have defined. Define and Identify the problem Analyze the problem Identifying possible solutions Selecting the best solutions Evaluate Solutions Develop an Action Plan Implement the Solution
  • 8. (UNIT-4 ) PPA Notes by: Mansi Tyagi 3.Identifying possible solution: Identifying possible solutions to the problem is sometimes referred to as finding “Optional solutions” because the goal is to complete a list of all conceivable alternatives to the problem. 4. Selecting the best solution: Decision making can be seen as bringing one into an ambivalent relationship with both power and responsibility. 5.Evaluating Solutions: There are several ways to evaluate the chosen solution,and writing them all down will help the group to choose the best solution to the problem. 6. Develop an Action Plan: An action plan is a chart that lists the tasks that need to be done and identifies who will be responsible for each,when and what action is necessary ,where to start,and how.  Divide the solution into sequential tasks  Develop the contingency plans. 7.Implement the solution : Showing that the problem solving process organized and orderly process will convince others that the solution is valid.
  • 9. (UNIT-4 ) PPA Notes by: Mansi Tyagi ALGORITHM A algorithm is a procedure or formula for solving a problem.It can defined as a step-by-step procedure to solve a particular problem or program.  An algorithm is a sequence of finite instructions used for calculations and data processing.  It’s a type of effective method in which a lsit of well-defined instructions for completing a task will,when given an initial state,proceed through a well defined series of successive states,eventually terminating in an end-state.  Five Characterstics of Algorithm : 1.Input: It may accept zero or more input. 2.Output: It should produce at least one output. 3.Definiteness:Each instruction must be clear ,well defined and precise.There should not be an ambiguity. 4.Finiteness: It should be a sequence a finite instructions i.e;it should end after a fixed time. 5.Effectiveness: Steps are sufficiently simple and basic.  Notations for algorithm: 1.Name of the algorithm 2.Step numbers 3.Explanatory comment 4.Termination
  • 10. (UNIT-4 ) PPA Notes by: Mansi Tyagi  Essential properties of an algorithm :  It must be concise  It must be unambiguous  It must be simple  It should lead to a unique solution of the problem  It must be capable of machine execution  Advantages :  Easy to debug  It is independent of programming languages.  It has a definite procedure.  Disadvantages:  It is cumbersome and time consuming  Example 1: Write an algorithm to determine a student’s final grade and indicate whether it is passing or failing. The final grade is calculated as the average of four marks. Step 1: Start Step 2: Input M1,M2,M3,M4 Step 3: GRADE  (M1+M2+M3+M4)/4 Step 4: if (GRADE < 50) then Print “FAIL” else Print “PASS” Step 5: Stop
  • 11. (UNIT-4 ) PPA Notes by: Mansi Tyagi  Example 2: Write an algorithm that reads three numbers and prints the value of the largest number. Step 1: Start Step 2: Input N1, N2, N3 Step 3: if (N1>N2) then if (N1>N3) then [N1>N2, N1>N3] else [N3>N1>N2] endif else if (N2>N3) then [N2>N1, N2>N3] else [N3>N2>N1] endif endif Step 4: Print “The largest number is”, MAX Step 5 : Stop
  • 12. (UNIT-4 ) PPA Notes by: Mansi Tyagi  Example 3:To print pascal triangle (Important algo.) Step1:START Step2:Read n Step3: For i=1 to n in steps of 1 Begin For i=1 to (n-i)in steps of 1 Begin Print “ “ I=i+1 End For k=1 to (k<i)in steps of 1 Begin Print k K=k+1 End For k=i to 1 in steps of 1 Begin Print k K=k-1 End Print from new line i=i+1 End Step4: STOP
  • 13. (UNIT-4 ) PPA Notes by: Mansi Tyagi Pseudo Code: is an artificial and informal language that helps programmers develop algorithms. Pseudo code is very similar to everyday English.  Example 1: Write an algorithm to determine a student’s final grade and indicate whether it is passing or failing. The final grade is calculated as the average of four marks. Pseudo code:  Input a set of 4 marks  Calculate their average by summing and dividing by 4  if average is below 50 Print “FAIL” else Print “PASS”
  • 14. (UNIT-4 ) PPA Notes by: Mansi Tyagi Flowchart A Flowchart  shows logic of an algorithm  emphasizes individual steps and their interconnections  e.g. control flow from one action to the next  Flow chart is diagrammatic representation of an algorithm. It is built using different types of boxes of symbols. The operation to be performed is written in the box. All symbols are interconnected by arrows to indicate the flow of information and processing. Following are the standard symbols used in drawing flowcharts. Oval Terminal Start/stop/begin/end symbol Parallelogram Input/Output Making data available for processing (input) or recording of the processed information(output) Rectangle Process Any processing to be performed. An assignment operation normally represented by this symbol Diamond Decision Decisionorswitchingtype of operations that determines which of the
  • 15. (UNIT-4 ) PPA Notes by: Mansi Tyagi alternative paths is to be followed. Circle Connecter Used for connecting different parts of flow chart. Arrow Flow Joins two symbols and also represents executions flow.  `Advantages:  Communication: flowcharts are better way of communicating the logic of a system to all concerned.  Effective analysis: with the help of flowchart problem can be analyzed in more effective way.  Proper documentation  Efficient coding  Proper debugging  Efficient program maintenance  Disadvantages:  Complex logic  Alternativess and modifications  Reproductions  Time-consuming  Subjective
  • 16. (UNIT-4 ) PPA Notes by: Mansi Tyagi  Example :Draw a flowchart that will read the two sides of a rectangle and calculate its area. Complexity It is very convenient to classify algorithms based on the relative amount of time or relative amount of space they require and specify the growth of time/space requirements as a function of the input size. TYPES OF COMPLEXITY ARE: 1.SPACE COMPLEXITY 2. TIME COMPLEXITY
  • 17. (UNIT-4 ) PPA Notes by: Mansi Tyagi 1. Space complexity: Space complexity of an algorithm is the amount of memory it needs to run to completion. S(x)= c+Sx S(x) is the space required by a problem x C is a constant Sx is an instance characterstic 2.Time Complexity : Time complexity of an algorithm signifies the total time required by the program to run to completion. The time complexity of algorithms is most commonly expressed using the big O notation. Time Complexity is most commonly estimated by counting the number of elementary functions performed by the algorithm. And since the algorithm's performance may vary with different types of input data, hence for an algorithm we usually use the worst-case Time complexity of an algorithm because that is the maximum time taken for any input size. Some of the reasons for studying time complexity are:  We may be interested to know in advance that whether an algorithm/program will provide a satisfactory real time response.  There may be several possible solutions with different time requirements.
  • 18. (UNIT-4 ) PPA Notes by: Mansi Tyagi Types of Notations for Time Complexity Now we will discuss and Big Oh denotes "fewer than or the same as" <expression> iterations. 1. Big Omega denotes "more than or the same as" <expression> iterations. 2. Big Theta denotes "the same as" <expression> iterations. 3. Little Oh denotes "fewer than" <expression> iterations. 4. Little Omega denotes "more than" <expression> iterations. Understanding Notations of Time Complexity with Example  O (expression) is the set of functions that grow slower than or at the same rate as expression.  Omega (expression) is the set of functions that grow faster than or at the same rate as expression.  Theta (expression) consist of all the functions that lie in both O(expression) and Omega expression.
  • 19. (UNIT-4 ) PPA Notes by: Mansi Tyagi Big Oh Notation Big-oh notation is the formal method of expressing the upper bound of an algorithm’s running time. It is the measure of the longest amount of time it could possibly take for the algorithm to complete. We have O(f) called big-oh,which represents the class of functions that grow no faster than f. It is used in computer science to describe the performance or complexity of an algorithm. Use of Big Oh Notation Big oh notaion has two main areas of application:  In computer science, big oh notation is used to classify algorithms by how they respond to changes in input size.  In mathematics, big oh notation is used to describe the limiting behaviour of a unction when the argument tends towards a particular value or infinity, usually in terms of simpler functions.  It is also used in many other fields to provide similar estimates.
  • 20. (UNIT-4 ) PPA Notes by: Mansi Tyagi IMPORTANT QUESTIONS Q1. Describe the relevance and importance of problem solving techniques. Q2. What do you understand bythe pseudocode? Q3. What is divide and conquer techniques to solve a problem?Explain it by giving an example. Q4. Write the short note on brainstorming? Q5. Discuss the different techniques for problem solving with help of examples? Q6. Explain various steps involved in problem solving? Q7. What is big-oh notation? Explain its use. Q8. Explain the algorithm? What are five characterstics of an algorithm? Q9.Draw a flowchart to find highest common factor(H.c.f) of two given numbers m and n. Q10. What is flowchart?Explain its symbols by designing a flowchart for finding whether give number is prime or not? Q11. Why time complexity is an important issue?Explain. Q12. How flowchart ,algorithm,program &pseudo codes are different from each other ?Also enumerate their individual importance and relevance.Write them all for generating a sine series.

ChaloExam Logo

Bangalore University BCA 1st Sem NEP Syllabus

problem solving techniques using c bca 1st sem nep syllabus

Who is teaching?

Bangalore university lecturers, nep syllabus 2021-2022, total students.

problem solving techniques using c bca 1st sem nep syllabus

Problem Solving Techniques

problem solving techniques using c bca 1st sem nep syllabus

Discrete Structures

problem solving techniques using c bca 1st sem nep syllabus

Data Structures

Book now for free classes, learn from anywhere on any time, get started today.

problem solving techniques using c bca 1st sem nep syllabus

India’s Only E-Learning & E-Reference platform curated for Higher Education sector

problem solving techniques using c bca 1st sem nep syllabus

Quick Links

Privacy policy, terms of service, refund policy.

problem solving techniques using c bca 1st sem nep syllabus

jetty-study-logo

  • Problem Solving Through C (BCA) 1st Sem Previous Year Solved Question Paper 2022
  • Problem Solving Through C (BCA)

Unlock success in BCA 1st Semester with our comprehensive 'Problem Solving Through C' solved question paper for 2022. Access detailed solutions to previous year questions for effective preparation.

1. What is a flowchart ? Draw a flowchart to find out total number of students in a class who have scored more than 60%.

2. what is a constant discuss different types of constants used in c language., 3. discuss the structure of a c program with the help of an example program., 4. discuss various arithmetic and assignment operators available in c language. give appropriate examples., 5. discuss various looping statements used in c language., 6. what are the different ways to pass parameters to a function explain with the help of examples., 7. how to use switch, break and continue statements in a program give example code., 8. define a function to print ith fibonacci where term i is passed as argument to the function. use this function to print first n fibonacci terms., 9. write a program to find greatest element in each row of a two-dimensional array., 10. how to declare an array (single and double dimensional) how to access individual values in an array how to initialize an array during compile time and run time give appropriate example code., 11. what is a pointer how to use pointers with double dimensional array write a program to print all the elements of a two-dimensional array using pointers., 12. how to all allocate memory dynamically discuss various functions used., 13. discuss the following string handling functions with the help of example code :, 14. write a program to copy a string from one character array to another without using any build-in string handling function., 15. how to use array of structures explain with the help of an example code., 16. how to create, open and close a file in a c program discuss various functions used to write into a file., 17. differentiate between local and global variables., 18. what are date flow diagrams give example., 19. what logical operators are available in c language, 20. what is a union give example., 21. how are structures different from arrays , 22. what is the use of static storage class .

Problem Solving Techniques For 1 Sem Bca & Bsc Computer Science Nep : Bcu Bu

IMAGES

  1. Problem solving techniques using C bca 1st sem : Amazon.in: Books

    problem solving techniques using c bca 1st sem nep syllabus

  2. I BCA Problem-Solving Techniques Using C, Internal Assessment Test-1 22

    problem solving techniques using c bca 1st sem nep syllabus

  3. Problem Solving Using C BCA NOV 2017

    problem solving techniques using c bca 1st sem nep syllabus

  4. 1st Sem BCA NEP Exam Problem Solving Technique

    problem solving techniques using c bca 1st sem nep syllabus

  5. 1st sem bca Discrete structures nep 2021-22 question paper #1stsembca #Deepikalearning

    problem solving techniques using c bca 1st sem nep syllabus

  6. SOLUTION: Problem solving technique bca 1st sem chapter 10 banglore

    problem solving techniques using c bca 1st sem nep syllabus

VIDEO

  1. Types of matrices

  2. unit 3 Matrix algebra

  3. B.Com 3rd & 5th Sem NEP

  4. BCS-011 Solved Assignment 2023-24 || IGNOU BCA First Semester || Computer Basics and PC Software

  5. Important questions in C programming

  6. IGNOU BCA -BCS-011 (Block 3 Unit 1) Part 1

COMMENTS

  1. Problem solving techniques using c

    III & IV Sem BCA Pathya - Notes; ... Java notes Unit 1 - 2nd Sem Bca Java unit 1; Data Structures Using C NEP Syllabus; C Notes FULL - final; BCA EL 6 - NOTE POINTS ... Discrete-Mathematics; Problem Solving Techniques Using C; Preview text. Structure. 1 Introduction 1 Procedure (steps involved in problem solving) 1 Algorithm 1 Flow Chart 1 ...

  2. Problem Solving Techniques (Nep Syllabus)

    C was invented to write an operating system called UNIX. C is a successor of the B language which was introduced around the early 1970s. The language was formalized in 1988 by the American National Standard Institute (ANSI). The UNIX OS was totally written in C. Today C is the most widely used and popular System Programming Language. Most of ...

  3. BCA 1st Semester Syllabus (2023)

    The subjects in BCA 1st semester provide a solid foundation in the fundamentals of information technology and computers. These subjects are essential for students who want to pursue a career in information technology. They will help students develop their problem-solving skills, communication skills, and their ability to write and debug code.

  4. Bangalore University BCA 1st Sem Problem Solving Techniques NEP Study

    BU BCA Semester 2; BU BCA Semester 3; BU BCA Semester 4; BU BCA Semester 5; BU BCA Semester 6; MBA. ... Tumkur University Nep Syllabus 2021-22 Study Materials; ... Bangalore University BCA 1st Sem Problem Solving Techniques NEP Study Materials and Previous Year Question Papers. Free Notes. Module 1

  5. Unit-I C

    There are 32 keywords in C. BCA103T - Problem Solving Techniques using C Page 17 of 33 Identifiers: In C Programming, identifiers are names given to C entities, such as variables, functions, structures etc. identifiers are created to give unique name to C entities to identify it during the execution of program.

  6. PDF Bangaluru City University (Bcu) Bca I Year Syllabus (Nep):2021-2022

    BCA I YEAR SYLLABUS (NEP):2021-2022 . Semester Course Code Title of the Paper Credits Languages, Skill ... Credits I CA-C1T . Discrete Structure . 3 . OE1: Open Elective : 3 . 26 : CA-C2T Problem solving Techniques 3 Language L1 3 CA-C3T . Data Structure : 3 . Language L2 : 3 . CA-C4L Problem solving Lab 2 SEC I : O ffice ... Problem Solving ...

  7. PDF Bachelor of Computer Application (BCA) Course Structure

    Bachelor of Computer Application (BCA) Course Structure (Based on NEP-2020) Sl. No. Subject Name L T P Credits BCA- 1st Sem 1 Problem Solving using C 3 0 0 2 2 English Communication Skills 2 0 0 2 3 Computer System Architecture 3 1 0 4 4 Mathematical Foundations 3 1 0 4 5 Principles of Management 3 0 0 3

  8. NEP syllabus BCA

    Page 3 : Program Outcomes: BCA (3 Years) Degree, 1. Discipline knowledge: Acquiring knowledge on basics of Computer Science and, ability to apply to design principles in the development of solutions for problems, of varying complexity, 2. Problem Solving: Improved reasoning with strong mathematical ability to, Identify, formulate and analyze ...

  9. Notes of c programming 1st unit BCA I SEM

    Notes of c programming 1st unit BCA I SEM. This document discusses the basics of the C programming language. It covers the structure of a basic C program, which must include a main function with declaration and executable parts. C tokens like keywords, identifiers, constants, operators and strings are also introduced.

  10. B.c.a. Semester -i (Nep Syllabus)

    II. 01 essay type question out of 2 from Unit I 01x10=10. III. 01 essay type question out of 2 from Unit II 01x10=10. IV. 02 questions out of 4: from Unit III 02x05=10. V. 04 Language Activity out of 6: from Unit IV 04x05=20. Total 60. I. Answer the following questions in a word, a phrase or a sentence each: 10x1=10.

  11. PDF Bachelor of Computer Application (BCA)

    Bachelor of Computer Application (BCA) Course Structure (Based on NEP-2020) BCA- 1st Sem Sl No. Subject Name L T P Credits 1 Problem Solving using C 3 0 0 2 2 English Communication Skills 2 0 0 2 3 Computer System Architecture 3 1 0 4 4 Mathematical Foundations 3 1 0 4 5 Principles of Management 3 0 0 3 6 Health and Wellness 1 0 0 1

  12. Problem solving UNIT

    This document provides an overview of problem solving techniques, programs, and the program development cycle. It discusses: 1. The steps of problem solving techniques include defining the problem, formulating a mathematical model, developing an algorithm using a flowchart or pseudocode, writing code, and testing the program. 2.

  13. Bangalore University BCA 1st Semester NEP Notes

    Are you looking for BCA 1st semester NEP notes of Bangalore University? ChaloExam provides you with free and easy-to-understand study materials, covering all the topics of the new syllabus. You can also find question papers, model papers, and exam tips on this website. Don't miss this opportunity to ace your exams with ChaloExam.

  14. PDF st Semester (PPC:104) Paper Code : PPC:104 Paper name

    NU BCA First Year Syllabus 1st Semester (PPC:104) Page 2 of 3 Arithmetic operators, Relational, Logical operators, Assignment, increment and decrement ... ISRD Group, "Programming and Problem Solving Using ", Tata McGraw Hill,2008. 5. PradipDey ,ManasGhosh, "Programming in ", Oxford University Press, 2007.

  15. C programming complete notes

    Data Structures Using C NEP Syllabus; C Notes FULL - final; BCA EL 6 - NOTE POINTS; Discrete-Mathematics; Problem solving techniques using c; Related Studylists Pst Bca c. ... This note i am provide to 1st semester for bca student in banglore center university. Bachelor of computer applications 100% (8) 85.

  16. BCA Subjects & Syllabus 2024: List, Year Wise, Semester, Books

    The BCA Course syllabus covers a wide range of BCA subjects such as Introduction to Programming using C, Operating Systems, Computer Graphics & Animation, Programming in Java, Computer Networks, and Database Management Systems. BCA Hons Syllabus consists of 1 major subject which is the specialization subject. The students will have to study all ...

  17. Problem Solving Through C (BCA) 1st Sem Previous Year Solved Question

    1. What is a flowchart ? Draw a flowchart to find out total number of students in a class who have scored more than 60%. 2. What is a constant? Discuss different types of constants used in C language. 3. Discuss the structure of a C program with the help of an example program. 4.

  18. BCA 1st Year Subjects & Syllabus 2024: Electives, Skills, Books

    BCA 1st Semester Subjects . Mathematics- I - The course develops the basic Mathematical skills of students in analytical and problem-solving skills for computer applications. Students will learn about Logical operators, the validity of arguments, set theory and set operations, relations and functions, linary operations, Binary algebra ...

  19. Problem ST- Modelpaper-1

    Write a C program to sort n numbers using Insertion sort. Write a note on Text line editing. PART-C III. ANSWER ANY 4 QUESTIONS. Each question carries 8 marks 4 x 8 = 32. a) Write a 'C' Program to find factorial of a number b) Write a note on Formatted I/O Functions in 'C'. (4+4) a) Explain Various if statements.

  20. PDF BANGALORE UNIVERSITY and BANGALORE CITY UNIVERSITY PROPOSED BCA ...

    PROPOSED BCA SYLLABUS (NEP) [Based on I-C. Model of Karnataka State Higher Education Council] Semest er Course Code Title of the Paper Credits Languages, Skill Enhancement (SEC), and Ability Enhancement Courses (AECC) Credits Total Credits I CA-C1T Discrete Structure 3 OE1: Open Elective 3 26 CA-C2T Problem solving Techniques 3 Language L1 3

  21. Problem Solving Techniques For 1 Sem Bca & Bsc Computer Science Nep

    Buy Problem Solving Techniques For 1 Sem Bca & Bsc Computer Science Nep : Bcu Bu online, free home delivery. ISBN : 8194869080, 9788194869085 Problem Solving Techniques For 1 Sem Bca & Bsc Computer Science Nep : Bcu Bu by S Srikanth,Salini Suresh. our price 350 .

  22. PDF Department of Information Technology (In-house) Syllabus of Bachelor of

    Write a c program to print first n natural numbers using while loop. 12. Write a c program to print all the odd numbers in a given range. 13. Write a c program to add first n numbers using while loop. 14. Write a c program to print all numbers divisible by 3 or 5 in a given range. 15. Write a c program to add even numbers in a given range. 16.

  23. Problem solving techniques NEP question paper 2023

    I Semester B.C. Degree Examination, March/April 2023 ##### (NEP) (F+ R) (2021 -22 and Onwards) COMPUTER SCIENCE Problem Solving Techniques Max. Marks: 60 Time:2% Hours. Instruction: Answer any four questions from each Part. PART A. Answer any 4 questions. Each question carries 2 marks. (4x2-8) What is an Algorithm? What is variable? Give an ...