Scribd
Upload
783 views2 pages

SPA Syllabus Semester 1 - Mumbai University

This document outlines the syllabus and evaluation system for a structured programming approach course. It is divided into 8 modules that cover topics like problem definition, algorithms, scalar data types, control structures, functions, and additional C data types like arrays and pointers. Students will be evaluated based on a theory exam, practical exam, oral exam, and term work. The question paper format includes 6 questions worth 20 marks each, with question 1 being compulsory and covering the entire syllabus. The remaining questions will be randomly selected from the 8 modules.

Uploaded by

khadye_ashwini
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
783 views2 pages

SPA Syllabus Semester 1 - Mumbai University

This document outlines the syllabus and evaluation system for a structured programming approach course. It is divided into 8 modules that cover topics like problem definition, algorithms, scalar data types, control structures, functions, and additional C data types like arrays and pointers. Students will be evaluated based on a theory exam, practical exam, oral exam, and term work. The question paper format includes 6 questions worth 20 marks each, with question 1 being compulsory and covering the entire syllabus. The remaining questions will be randomly selected from the 8 modules.

Uploaded by

khadye_ashwini
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Structured Programming Approach

F.E. Sem. II EVALUATION SYSTEM Time Marks

Theory Exam Practical Exam Oral Exam Term Work Internal Assessment

3 Hrs.
SYLLABUS

80 25 25 20

Module -1 Problem definition Module -2 Algorithms 2.1 Developing Algorithms 2.2 Efficiency of Algorithms Module -3 Expressing Algorithm - Sequence 3.1 Expressions in C; Arithmetic and Boolean expressions 3.2 Use of Standard functions 3.3 Assignment statement 3.4 Input and output Module -4 Concept of Scalar Data Types 4.1 Scalar data types in C, Scope and life time, type conversion Module -5 Expressing Algorithms - Iteration 5.1 Ordering a solution in a loop 5.2 C-Control structures for Iteration Module -6 Expressing Algorithms - Selection 6.1 C-Control structures for selection Module -7 Decomposition of solution 7.1 Defining Functions in C 7.2 Functions and parameters 7.3 Introduction to recursive functions Module -8 Additional C data types 8.1 Arrays - single and multi dimensional 8.2 Strings 8.3 Structures 8.4 Files 8.5 Pointers

Engg/FE/SPA/Syllabus (1)

Mumbai University Question Paper Format : 1) Question paper will comprise of 6 questions, each carrying 20 marks. 2) Total 4 questions need to be solved. 3) Q.1 will be compulsory, based on entire syllabus wherein sub questions of 2 to 3 marks will be asked. 4) Remaining question will be randomly selected from all the modules. 5) Weightage of marks should be proportional to number of hours assigned to each Module.
Distribution of Marks
Topic Sub-Topic / Sub-topic Unit Title Weightage Unit No No 1.1 4 1 Problem Definition 12 2 Algorithms Developing Algorithms 2.1 Efficiency of Algorithms 2.2 Expressing Algorithms 9 3 -Sequence Expressions in C; Arithmetic 3.1 and Boolean expressions Use of Standard Functions 3.2 Assignment Statements 3.3 Input and Outputs 3.4 Concept of Scalar and 05 4 Data Types Scalar Data types in C, 4.1 Scope and Lifetime, type conversion Expressing Algorithms 15 5 -Iteration Ordering a Solution in loop 5.1 C-Control Structures for 5.2 Iteration Expressing Algorithms 12 6 -Selection C-Control Structures for 6.1 selection 23 7 Decomposition of Solution Defining functions in C 7.1 Function and Parameters 7.2 Introduction to recursive 7.3 functions 40 8 Additional C Data Types Arrays- Single and 8.1 Multidimesional 8.2 Strings 8.3 Structures 8.4 Files 8.5 Pointers Total 120 Q.1 4(c) 6(a) 6(a) Q.2 Q.3 Q.4 Q.5 Q.6

6(k) 3(k)

5(c)

3(c)

6(a)

6(a)

6(a)

6(c)

4(c) 5(a) 8(a) 8(a) 3(a) 10(a) 3(c) 3(c) 20 20 20 20 20 20 8(a) 5(a) 6(a)

Engg/FE/SPA/Syllabus (2)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy