0% found this document useful (0 votes)
79 views1 page

Bca 101

This document outlines the topics covered in a computer fundamentals and programming course, including number systems, computer components, algorithm development techniques, common algorithms, programming fundamentals, data types, control structures, subprograms, files and pointers, structured programming concepts, and program design. Students will be assessed through external written exams covering the whole syllabus, and an internal assessment, with exams consisting of 8 questions and students required to answer 5.
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
0% found this document useful (0 votes)
79 views1 page

Bca 101

This document outlines the topics covered in a computer fundamentals and programming course, including number systems, computer components, algorithm development techniques, common algorithms, programming fundamentals, data types, control structures, subprograms, files and pointers, structured programming concepts, and program design. Students will be assessed through external written exams covering the whole syllabus, and an internal assessment, with exams consisting of 8 questions and students required to answer 5.
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/ 1

BCA - 101 Computer Fundamentals and Programming External Marks : 75 Internal Assessment : 25 Time : 3 hrs.

Computer Fundamentals : Number system : decimal, octal, binary and hexadecimal; Representation of integers, fixed and floating points, character representation; ASCII, EBSDIC; Functional units of computer, I/O devices, primary and secondary memories; Pogramming Fundamentals. Algorithm development, Techniques of problem solving, Flow-charting, Step-wise refinement, Algorithms for searching, sorting (exchange and insertion), merging of ordered lists. Programming : Representation of integers, characters, real Data types : constants and variables; Arithmetic Expressions, Assignment statement, Logical expression, Sequencing, Alteration and iteration; ring processing; Sub programs, Recursion, Files and pointers; Structured programming concepts; Top down Design, Development of efficient program; program correctness; Debugging and testing of Programs. Note : The examiner is requested to set 8 questions covering whole syllabus in each paper out of which the candidates will be required to attempt any 5 questions.

You might also like