Detail syllabus of BCa [Hons.] course

magadh university, bodh-gaya


bca Hons. -  IInd Year 


PAPER - III


Full Marks - 100                                                     ( Theory -75, Practical - 25)


computer Networking

Introduction to the N/W, Network Topologies, Types of channels : Twisted Wire, Co-axial wire, Microwave Communication, Setellite Communication, Optical fibre, Simplex, Duplex, Half Duplex Communication. Switching Techniques,Circuit Switching, Massage Switching, Packet Switching, FEP, Repeaters, Bridge, Gateway, Token passing CS / CD, Protocols, ISO-OSI Model, NIC, Serial and Parallel Communications.

Internet

Evolution, Protocols, Interface concept, Internet Vs Intranet, Growth of Internet, ISP, Connectivity-Dial-Up, Leased Line, VSAT,etc URLs, Domain Names, Portals, Application. E-mail Concept, POP and Web Based E-Mail, address, Basics of  sending and receiving, E-Mail protocols, Mailing list, Free E-mail Services.



Boolean algebra

Boolean Algebra, Rules and Theorems, DeMorgan Theorem, Duality Principal, Logical gates, Canonical equations, K-Maps, Half Adder, encoder, decoder.

Structured Programing

Methods of Documentation. Methods of analyzing program requirement. Data flow diagrams.

C- language


Unit  1 : Overview of C ; Introduction & features of  C; Structure of C Program; Variables, Expressions, Identifiers, Keywords, Data types, Constants, Operators and Expressions; Operator : Arithmetic, logical, Relational,Conditional, and Bitwise operators; Precedence and Associativity of operators;Type Conversion in Expression.

Unit II :  Basic Input /Output and Library Functions; Single character Input / Output , i.e. getch ( ), getchar ( ), getche ( ), Putchar ( ); Formated Input / Output, i.e.printf ( ) and scanf ( );Library functions- Concepts, Mathematical and character functions; Control structure; If statements, If-Else Statements, Nesting of If-Else statements, else if ladder; The ? : Operator; goto Statement; Switch statement; Compound statement; Loop Controls; for, while, do-while loops; break, Continue, goto statement.

Unit - III : Single and Multi Dimensional Arrays;Array declaration and initialisation of Arrays; Strings : declaration, initialisation, functions.

Unit - IV : Functions; The need and form of c functions; Userdefined and Library functions; Functions arguments; Return values and nesting of function; Recursion; Calling of functions;Array as function argument;Scope and life of variable- local and global variable; Storage class specifier auto, extern, static, register.

Unit - V :Structure and Union; Defining structure; Declaration of structure variable; Accessing structure member; nested structure; Array of structure; Structure Assignment;Structure as function argument; Union.

Unit  - VI : Basic of Pointers, Operators, Pointers and function; Passing array to function; array pointers; Pointers strings;Pointers to Structure;Pointers Within Structure.

Unit - VII :Dynamic Memory Allocation; The Process of memory allocation; malloc ( ) operator;        size of () operator; function calloc ( ); function fee ( ); function realloc ( )

Unit - VIII: File handling: file structure; file handling function; file type; streams; text; Binary; file pointer; opening file and closing file; writing and reading a character; using fopen ( ), etc( ), putc( ) & fclose( ); using feof ( ); working with string fputs & fgets; flushing stream; Fusing fread ( ), fwrite ( ) & rewrite ( ); direct access file.

Unit - IX : Preprocessor Directive & Commands, The Preprocessor; #define; defining like macos;#error;        #include;conditional compilation directive i.e #if, #else, #elif and #iddef & #undef; #line;

Unit - X : Direct access color graphics; Initialise graphics mode; function used in graphics; Bitwise operator.

Unit - XI : Screen Control; Creation of windows; text attributes control; extended keywords code; menu design; word processing.


Practical

Programing in C language and Project development



Text & Referances Books


1        Pointer through                        C. Y. Kanitkar

2        Let Us C                        Y.Kanitkar

3        Programing in C -                E. Balaguruswami

4        Computer Networks                S.Jain,BPB

5        Computer Networks                Tanenbaum,PHI

6.        Computer Networking

       With Internet Protocol                Stallings,Pearson Education



Paper - IV


Full Marks - 100                                                        (Theory -75, Practical 25)


Data Structure


Introduction to data structure : concept of data structure; Abstract data structure; Analysis of Algorithm; The concept of List

Stack and Queues: Intoduction to stack & primitive operation on stack; Stack as an abstract data type; Multiple stack; Stack application : infix, postfix, prefix and recursion; Introduction to queues; Primitive operation on the queues; Queues as an  abstract data type;Circular Queue; Dequeue; Priority queue.

Linked List: Introduction to the linked list of stack; The linked list of Queue; Header nodes; Doubly Linked List; Circular Linked List;Stack & Queue as a circular linked list; Application of Linked list

Trees : Basic Terminology; Binary Tree;The Tree representation as Array & Linked List; Binary Tree representation; Traversal of Binary tree : Inorder, Preorder & Post order; Application of Binary Tree; Threaded Binary Tree; B- Tree & Height Balanced Tree, representation of B+ & B* trees Binary tree representation of trees; Counting Binary trees

Searching and sorting : Sequential Searching; Binary Search; Insertion Sort;Selection Sort; Quick sort; Bubble Sort; Radix Sort; Heap Sort; Merge Sort; Comparison of Sorting methods.

Tables and graphs : Hash Table; Collision resolution Technique; Introduction to Graphs; Definition; Terminology;        Directed, Undirected & Weighted Graph; Representation of Graphs; Graph Traversal -Depth First & Breadth First Search;        spanning Tree, Minimum spanning Tree; The Basic Greedy strategy for computing Algorithm of Kruskal and Prims

Computer Aided Drafting

Introduction to AUTOCAD / ROBOCAD or similar package. Advanced features of these Packages. Drawing plan of a building using AUTOCAD etc. Analysis feature of AUTOCAD

Practical

Design of layout of a building. Design of Interior of its rooms. Printing and plotting the prepared drawings. Fashion designing through AutoCAD.


Text & Referances Books


1        Data Structure through c                 Kanitkar,BPB

2        Fundamentals of Data Structure :        By S. Sahni & Horowitch

3        Data Structure :                        Tannenbaum

4        AutoCad 2000 -

       The Complete Reference                COHN,TMH


Last Articles

kfc experience code tjmaxxfeedback.com survey denny's survey kohls com survey feedback telltractorsupply survey kohlslistens survey