GARDEN CITY UNIVERSITY. Bachelor of Computer Applications SEMESTER- I. Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04

Size: px

Start display at page:

Download "GARDEN CITY UNIVERSITY. Bachelor of Computer Applications SEMESTER- I. Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04"

Kristin Watson
5 years ago
Views:

1 GARDEN CITY UNIVERSITY Bachelor of Computer Applications SEMESTER- I Course: CONCEPTS OF PROGRAMMING USING C LANGUAGE CODE: 05ABCAR17111 CREDITS: 04 Unit 1 Programming Basics 1.1 Introduction to Programming Concepts: Software, Classification of Software 1.2 Modular Programming, Structured Programming, Algorithms, Flowcharts with examples. 1.3 Overview: History, Character set, tokens, Identifiers, Keywords, Data types 1.4 Variables, Constants, Symbolic Constants, Operators, Hierarchy of Operators 1.5 Expressions, Type Conversions and Library Functions. Unit 2 Input and Output Functions 2.1 Managing Input and Output Operation: Formatted and Unformatted I/O Functions 2.2 Decision making, branching and looping: Decision Making Statements - if Statement, if else statement, nesting of if-else statements, else if ladder, switch statement, operator 2.3 Looping - while, do-while, for loop, Nested loop, break, continue, and go to statements. 2.4 Functions: Function Definition, prototyping, types of functions, passing arguments to functions 2.5 Nested Functions, Recursive functions Unit 3 Arrays & Storage Classes 3.1 Arrays: Declaring and Initializing, One Dimensional Arrays, Two Dimensional Arrays Multi- Dimensional Arrays, passing arrays to functions 3.3 Strings: Declaring and Initializing strings, Operations on strings, passing strings to functions 3.4 Storage Classes - Automatic, External, Static and Register Variables, Structures-Declaring and Initializing, Nested structure

2 3.5 Array of Structure, Passing Structures to functions, Unions, typedef, enum, Bit fields Unit 4 Memory Organization with Files 4.1 Pointers Declarations, Pointer arithmetic, Pointers & functions, call by value, Call by reference 4.2 Pointers and Arrays, Arrays of Pointers, Pointers and Structures 4.3 Meaning of static and dynamic memory allocation, Memory allocation functions 4.4 Files - File modes, File functions, and File operations, Text and Binary files 4.5 Command Line arguments. Pre-processor directives, Macros Definition, types of Macros, Creating and implementing user defined header files Course: CONCEPTS OF PROGRAMMING USING C LAB CODE: 05ABCAR17111 CREDITS: 04 Part A.1 Exercises 1 5 1) Write a Program to find the roots of the given quadratic equation using if-else if statement. 2) Write a menu driven program using switch-case to find: (a) Sum of the digits of number (b) Factorial of N. 3) Write a program to find cos(x) using series cos(x) = 1 x 2 /2! + x 4 /4!- x n /n!] 4) Write a Program to find whether a given number is prime number are not 5) Write a program to arrange the given set of numbers in ascending and descending order. Part A.2 Exercises 6 10

3 6) Write a program to find product of two N x M matrices. 7) Write a program to calculate n C r = n!/r! * (n-r)! using a function. 8) Write a program to display Fibonacci series using recursive function. 9) Write a program to concatenate two strings using pointers. 10) Write a program to copy content of one file to another file. Part B.1 A mini project must be developed by the students based on the applications of the concepts covered during theory. Part B.2 A mini project must be developed by the students based on the applications of the concepts covered during theory. PROGRAMME Bachelor of Computer Applications SEMESTER- I Course: DIGITAL ELECTRONICS CODE: 05ABCAR17112 CREDITS: 04 Unit 1 Introduction to Network theorems and AC fundamentals 1.6 Ohm s law, Kirchhoff s law: KVL, KCL, Mesh/loop analysis. 1.7 Delta/star, star/delta transformation, Need for application of network theorems. 1.8 Superposition theorem, Thevenin s theorem, Norton s theorem, Maximum power transfer theorem 1.9 Reciprocity theorem: Statement, explanation of theorem by considering a simple resisting network, expression for maximum power deliver (PL(max) =Vth2/4Rth) (no derivation), graph of Vs Pl, numerical problems and applications Reciprocity theorem, Statement, explanation using resistive network with DC source and numerical problems Unit 2 Semiconductor Devices 2.1 Introduction, atomic structure, energy level, energy band diagram in solids, classification of conductors, insulators, semiconductors

4 2.2 Semiconductor, properties, crystal structure of semiconductor, types intrinsic and extrinsic semiconductor. 2.3 Semiconductor devices : PN junction diode, formation of pn junction layer, potential barrier, energy level diagram of pn junction, Biasing of pn junction, behaviour of pn junction under forward and reverse biasing, break down in pn junction, avalanche and zener break down.(k,a,ap) 2.4 Diode characteristics; V-I characteristic, forward and reverse bias, diode parameters, bulk resistance, knee voltage, static and dynamic resistance, PIV. 2.5 Application of diode; As a rectifier, as logic gate, as a switch, etc. Rectifier, types, Half wave Full wave. Half wave rectifier Unit 3 Number Systems Representation 3.1 Number Systems: Introduction to number systems positional and non-positional, Base /Radix. Decimal number system-definition, digits, radix/base, Binary number system Bit Byte, Conversions: Binary to Decimal and Decimal to Binary. 3.2 Octal number system- Conversion from Octal to Decimal to Octal, Octal to Binary and binary to Octal. Hexadecimal number system Conversion: Decimal to Hex, Hex to decimal, Hex to Binary, Binary to Hex, Octal to Hex, Hex to Octal 3.3 Binary Arithmetic addition, subtraction, multiplication and division (Integer part). 1 s and 2 s compliment, Subtraction. 3.4 Binary code: BCD numbers, 8421 code, 2421 code- examples and applications. 3.5 Gray code Conversions-Gray to binary and Binary to Gray, application of gray code (Mention only). Excess-3 code self complimenting property and applications. Unit 4 Combinatorial Logic Circuits 4.1 Logic Gates: AND Gate: Definition, symbol truth table, timing diagram, Pin diagram IC OR Gate: Definition, symbol, truth table, timing diagram IC NOT Gate: Definition symbol, truth table, timing diagram, Pin diagram IC NAND Gate: Definition, symbol, truth table, Pin diagram IC NOR Gate: Definition, symbol, truth table, timing diagram, Pin diagram IC Exclusive OR Gate: Definition, symbol, truth table, timing diagram.

5 4.4 Combinational logic circuits: Definition, applications. Half Adder: Symbol, Logic circuits using XOR and basic gates, Truth table. 4.5 Full Adder: Symbol, Logic circuits using XOR and basic gates, Truth table, Half Subtractor: Symbol, Logic circuits using XOR and basic gates, Truth table. Course: DIGITAL ELECTRONICS LAB CODE: 05ABCAR17112 CREDITS: 04 Part A.1 Exercises Study of Logic Gates AND, OR, NOT, NAND, NOR XOR (Using respective ICs 2. Realization of AND, OR and NOT gates using Universal Gates. 3. Design and Realization of Half Adder/Subtracted using NAND Gates. 4. Design and Realization of Full Adder using Logic Gates. 5. Design and Realization of 4 bit Adder/Subtractor using IC Part A.2 Exercises Design and Realization of BCD Adder using IC Realization of J-K flip flop using IC 7400 and Realization of T and D flip flop using IC Implementation of PIPO Shift Registers using flip flops. (IC 7476). 10. Design and implementation of odd and even parity checker Generator using IC PART B.1 Exercises Realization of RS flip flop 12. Realization of SISO Shift registers 13. Realization of SIPO Shift registers 14. Design a logic circuit for the given expression. Y= AB+BC+AC

6 15.Design and Realization of Full Subtractor using logic circuits. PART B.2 Exercises Realization of Multiplexer 17. Design and Realization of Half adder using logic gates. 18. Design and Realization of Half subtractor using logic gates. 19. Design and implementation of 3 bit binary to gray code converter 20. Realization of PISO Shift registers GARDEN CITY UNIVERSITY Bachelor of Computer Applications SEMESTER- I Course: DISCRETE MATHEMATICS CODE: 05ABCAR17113 CREDITS: 04 Unit 1: Logic & Proofs 1.11 Propositional Logic, Propositional equivalences 1.12 Predicates, Quantifiers, Nested Quantifiers Rules of inference, Introduction to proofs, Proof methods and strategy Mathematical induction, Strong Induction and well ordering The basics of counting, Pigeonhole Principle. Unit 2 Combinatorial Logic and Graph Theory 2.1 Permutation and combination. 2.2 Recurrence relations and Solutions, Generating functions. 2.3 Inclusion-exclusion Principle and its applications 2.4 Graphs and graph models, Graph terminology, Special types of Graphs. 2.5 Graph isomorphism, Connectivity, Euler and Hamilton paths.

7 Unit 3 Algebraic Systems - Groups 3.1 Algebraic systems. 3.2 Semi groups and monoids 3.3 Groups, Subgroups 3.4Homomorphism, Normal subgroup and cosets 3.5 Lagrange s theorem, Definitions and examples of Rings and Fields. Unit 4 Boolean Algebra 4.1 Partial ordering 4.2 Posets, Lattices as Posets. 4.3 Properties of lattices 4.4 Lattices as algebraic systems 4.5 Sub lattices, Direct product and homomorphism, Some special lattices, Boolean algebra.

FIRST SEMESTER BCA Syllabus Copy BCA103T : PROBLEM SOLVING TECHNIQUES USING C

FIRST SEMESTER BCA Syllabus Copy BCA103T : PROBLEM SOLVING TECHNIQUES USING C Unit - I Introduction to Programming Concepts: Software, Classification of Software, Modular Programming, Structured Programming,