I Semester BCAMAHATMA GANDHI UNIVERSITY KOTTAYAM BACHELOR DEGREE PROGRAMMEINCOMPUTER. APPLICATIONS(BCA)SCHEME & SYLLABUS(Effective from 2. Admissions onwards)1. The past two revolutions, industrial and electronic, have. The use of this technology in all sectors gave the. Conversion of an Expression : Infix to Postfix Manual MethodQuestion : Convert Following Expression Into Postfix?? Again Bracket Contain Two Operators. Infix to Postfix ExamplePre-requisite : What is Infix and Postfix? Infix to Postfix Algorithm Expression Current Symbol Stack Output Comment A/B^C-D Initial State NULL – Initially Stack is Empty /B^C-D A NULL A Print Operand B^C-D / / A Push Operator Onto. If there's something about what infix and prefix mean that you don't quite understand, I'd highly suggest you reread that section of your textbook. You aren't doing yourself any favors if you come out of this with the right answer for this one problem, but still don't. Admin We are a group of young techies trying to provide the best study material for all Electronic and Computer science students. We are publishing Microcontroller projects, Basic Electronics, Digital electronics, Computer projects and also c/c++, java programs. Infix, Prefix and Postfix Expressions When you write an arithmetic expression such as B * C, the form of the expression provides you with information so that you can interpret it correctly. In this case we know that the variable B is being multiplied by the variable. Stack data structure 1. IMPLEMENTATION OF STACKS PART 1 2. INTRODUCTION ABOUT STACKS The stack is a very common data structure used in programs which haslot of potential. Stacks hold objects, usually all of the same. Computer Industry and its unprecedented growth launched another. Communication. Information, the basic raw material for the. Postfix to Infix implementation in c #include <stdio.h> #include <stdlib.h> int top = 10; struct node Decision Support System, can be derived from processing of huge database. Systematic storage and management with adequate. The information technology plays an important role in all areas. Easy Tutor author of Program to convert an Infix Expression into a Postfix Expression using Linked List as a Stack is from United States. Easy Tutor says Hello Friends, I am Free Lance Tutor, who helped student in completing their homework. Find working C programs here. Copy the programs, use them, share with friends. Discuss about C programs. Ask for a specific C Program. C Program for Evaluation of Postfix Expression In this program we evaluate the Postfix Expression, using the stack. Here you can change between infix (seen normally in most writing) and post fix also known as reverse polish notation online tool. Infix to postfix online converter: The converter below takes an infix mathematical expression and converts into to postfix (rpn) form. Infix To Postfix Conversion In Data Structure Programs In CThis may be due to lack of awareness of the merits and advantages. So our youths have to be equipped with all kinds of. The syllabus. revision committee has considered all these factors thoroughly before venturing. The revised syllabus for BCA Programme. The knowledge acquired by the students may also equip. The Programme shall be. Each semester is a minimum of 1. University examination at the end of each semester. Course Objectives. The BCA Programme is designed with the. To attract young minds to the potentially rich & employable. To be a foundation graduate programme which will act as a feeder. Computer Science/Applications.(c) To develop skills in software development so as to enable the BCA. Indian & global software market.(d) To Train & Equip the students to meet the requirement of the. Industrial standards. Admission The eligibility for admission to BCA Degree Programme under the Mahatma Gandhi University is a pass in Pre- degree, Plus Two or equivalent examinations in. Mathematics/Computer Science as a compulsory subject. Registration. All the candidates admitted. M. G University along with the original. I semester programme. Duration of Course The pogramme shall normally extend over a period of three. Requirement of Attendance. Progress A candidate shall normally be permitted to. He/She secured not less than grade C for. His/Her progress is satisfactory in the. Examination. System. The Internal and External examinations shall be evaluated. Direct Grading system based on 5- point scale as given below. Letter Grade. Performance. Grade point(G)Grade Range. AExcellent. 43. 5. CGood. 21. 5. to 2. DAverage. 10. 5. to 1. EPoor. 00. 0. 0. to 0. The overall grade for a programme for certification shall be. CGPA with a 7- point scale given below. CGPAGrade. 3. 8. 0. A+3. 5. 0. to 3. 4. B+2. 5. 0. to 2. 4. C+1. 5. 0. to 1. 4. DA separate. minimum of D Grade for internal and external are required for a pass for a. Components of the Internal evaluation and their weights are. The evaluation of all components are to be published and are. But. such improvement in internal in the same paper cannot be attempted more than. The supplementary examinations will be conducted along. PATTERN OF QUESTIONS Questions. Requirement for the completion of. Programme A candidate has to complete the Programme within a period of five years. A candidate who does not complete the concerned. PROPOSED SCHEME FOR BCA PROGRAMME REVISED CURRICULUMREVISED CURRICULUM - 2. I Semester. Course. No. Course. No. Output Devices: Monitors, Sound. Systems, and Printers. Unit- 3: Data. Processing: Representation of data, processing of data - The CPU. Memory- different types of RAM and ROM, Factors affecting speed. Unit- 4: Storing. Information in a Computer: Types of Storage Devices. Magnetic Storage Devices –Data storage and organization on a Magnetic. Disk, Finding data on a disk - Diskettes - Hard Disks- Tape drives- . Optical Storage devices ,Solid state storage devices. Unit- 5: Operating. Systems and Networking: Definition of an. Operating System - Different types of PC Operating Systems. Brief idea of multimedia. Book of study. : Peter. Norton’s Introduction to Computers, Sixth Edition, Published by Tata. Mc. Graw Hill. References: Computer. Fundamentals By P K Sinha & Priti Sinha Fourth Edition. Arrays & Strings: Single dimensional arrays. Searching. and sorting of Arrays, Array of Characters, Character arrays and. String handling Functions. Unit 4: User Defined Functions: Function declaration, definition & scope. Arrays and functions, call by value, call by reference, Storage. Classes: automatic, external (global), static & registers. Unit 5: Structures: Definition of Structures, declaration, structure. Pointers: Pointer Definition, pointer arithmetic, array &. Bala. Guruswamy, TMH Programming. C, Byron S Gottfried, Shaum’s Outline series. TMHReferences: Computer. Fundamentals By P K Sinha & Priti Sinha Fourth Edition. B. Ritchie, “The ANSI C. Programming Language”, PHIBCA1. Software Lab I (Core). Exercises 1 and 2 will. Familiarization of Computer System and installation: Demonstration of various units of Computer system, handling of. Login process, Booting Process, software. Practicing Operating System Commands. MS- DOS internal & External commands (dir, copy, del, ren, copy con, date. EDIT etc). MS- WINDOWS –using start menu, desk. Demonstration of editing, compiling and executing a C program using a C. Programs using Basic Constructs: Fundamental data types. Arithmetic expressions, Evaluation of integer, real and mixed mode arithmetic. Conditional operators, trigonometric functions- sin(), cos(). Programs using control structures: if. Sample. programs should include printing of Fibonacci numbers, prime numbers, check for. Armstrong numbers, summation series – exp(x), sin series etc and verification. Programs using Arrays: Array based. Creation of array containing prime numbers, matrix addition, matrix. String manipulation programs – reading strings using %s. User. Defined Functions: Programs using return type. Program using structures: array of. Simple program using pointers SEMESTER 2. BCA 2. 01: ENGLISH (Common)( Syllabus as. Board of Studies of English ( UG) BCA 2. MATHEMATICS( Complementary)( Syllabus as. Board of Studies of Mathe Matics ( UG) BCA2. Accounting and Programming in COBOL (Core) Unit- 1 . Accounting Principles: Accounting concepts, conventions, Double Entry systems. Journal and Journalizing, Ledger- Posting and balancing, Trial balance. Unit 2 . Final accounts: Manufacturing account, Trading. Profit and Loss account, Balance sheet. Unit 3. Introduction to COBOL: History of COBOL, COBOL. Coding sheet, Basic structure of COBOL programs, Character set, COBOL words and. Data names, Identifiers, Literals, Figurative constants, Identification Division- entries, Environment Division - Configuration section. Data Division - Working- storage section - Level numbers and structure - . Picture clauses- Edited Picture. Unit 4: Procedure division : Need for Paragraph, Input- Output Verbs – Display and Accept. Data Movement Verb – Move. Arithmetic verbs- Add, Subtract. Multiply, Divide, Compute- Rounded option - On size error option, Operator precedence, conditional verb- If statement, If- else statement, Nested If. Conditions in If. Sequence control verbs- GO TO, STOP RUN, Corresponding option – move. Table Handling- Arrays and subscripting- one, two. Perform. statement - five different formats, GO TO with DEPENDING ON option. Programs. based on above verbs. Unit 5: Sequential files and File Programs : Various types of files, File program entries in various divisions- Environment division, Input- Output Section- . Data Division- File Section entries- Level numbers, Level indicators- FD. SD, FILLER clause, Procedure Division. OPEN, READ, WRITE, REWRITE, CLOSE verbs, various File. I- O modes, Simple SORT verb, Simple MERGE verb, Detailed structure of COBOL. Sequential file program. Concept of Indexed sequential file and Random. Book of study: 1. Unit 4: Trees: Concept of recursion, definition of - trees, binary trees. Binary search tree. Creation of binary search tree, traversing methods - examples. Unit 5: File. organization: File organizations- sequential, random files, linked organization, inverted. Book of study. : Data. Structures Through C (A Practical Approach), G. S Baluja Danapat. Rai & Co. Kamthane, Person. Education Theory and Problems of Data Structures, Schaum’s Outline Series, Seymour Lipschutz Data structures using c and C++ , Tanenbaum. BCA2. 05. : Fundamentals of Digital Systems (Core)Unit 1: Number Systems: Base of a number system, Positional number system, Popular number. Decimal, Binary, Octal and Hexadecimal), Counting in binary number. Conversion- Decimal to Binary, Binary to Decimal, Decimal to Octal. Octal to decimal and binary, Decimal to hexadecimal, Hexadecimal to decimal. Binary and octal, Concept of binary addition and subtraction, Complements in. Complement, 2s Complement and. Number representation in memory- bi- stable devices, Signed. Representation of real numbers, BCD numbers- concept and addition. Concept of parity bit. Unit 2: Boolean. Algebra and Gate Networks: Logic gates- AND, OR. NOT, NAND and NOR – Truth tables and graphical representation, Basic laws of. Boolean Algebra, Simplification of Expressions, De Morgan’s theorems, Dual. Canonical expressions, Min terms and Max terms, SOP and POS. Simplification of expression using K- MAP (up to 4 variables). Representation of simplified expressions using NAND/NOR Gates, Don’t care. XOR and it’s applications, parity generator and checker. Unit. 3: - Sequential. Combinational Logic. Flip flops- Latch. Clocked, RS, JK, T, D and Master slave , Triggering of flip flops , Counters- . Synchronous and asynchronous , BCD, Ripple counters, Half adder, Full adder(. Encoders, Decodes, Multiplexers and Demultiplexers(. Analog to digital and digital to analog. Diagram and working principle). Unit 4: - The Memory. Elements: Concept of Registers, Shift. Registers, Flip flops as building blocks of memory, RAM, ROM, organization . Book of study : M. M. Mano- Digital. Logic and Computer design. References: 1. Thomas C. Bartee- Digital computer Fundamentals. Floyd- . Digital Electronics. Malvino &. Leach- Digital Principles and Applications. BCA2. 06 . Software Lab – II.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
December 2016
Categories |