You are on page 1of 3

GE6151 UNITIINTRODUCTION8

COMPUTERPROGRAMMING

LTPC 3003

Generation and Classification of Computers Basic Organization of a Computer Number System Binary Decimal Conversion Problems. Need for logical analysis andthinking AlgorithmPseudocodeFlowChart. UNITIICPROGRAMMINGBASICS10 Problem formulation Problem Solving Introduction to C programming fundamentals structureof a C program compilation and linking processes Constants, Variables Data Types Expressions using operators in C Managing Input and Output operations Decision MakingandBranchingLoopingstatementssolvingsimplescientificandstatisticalproblems. UNITIIIARRAYSANDSTRINGS9 Arrays Initialization Declaration One dimensional and Two dimensional arrays. String StringoperationsStringArrays.Simpleprogramssortingsearchingmatrixoperations. UNITIVFUNCTIONSANDPOINTERS9 FunctiondefinitionoffunctionDeclarationoffunctionPassbyvaluePassbyreference Recursion Pointers Definition Initialization Pointers arithmetic Pointers and arrays ExampleProblems. UNITVSTRUCTURESANDUNIONS9 Introduction need for structure data type structure definition Structure declaration Structure within a structure Union Programs using structuresandUnions Storageclasses, Preprocessordirectives. TOTAL:45PERIODS TEXTBOOKS: 1. Anita Goel and Ajay Mittal, Computer Fundamentals and Programming in C, Dorling Kindersley(India)Pvt.Ltd.,PearsonEducationinSouthAsia,2011. 2. Pradip Dey, Manas Ghosh, Fundamentals of Computing and Programming in C, First Edition,OxfordUniversityPress,2009 3.YashavantP.Kanetkar.LetUsC,BPBPublications,2011. REFERENCES: 1. Byron S Gottfried, Programming with C, Schaums Outlines, Second Edition, Tata McGrawHill,2006. 2.DromeyR.G.,HowtoSolveitbyComputer,PearsonEducation,FourthReprint,2007. 3.Kernighan,B.WandRitchie,D.M,TheCProgramminglanguage,SecondEdition,Pearson

Education,2006.

IT2201 3003

DATASTRUCTURESANDALGORITHMS

Aim: To master the design and applications of linear, tree, and graphstructures.Tounderstand variousalgorithmdesignandanalysistechniques. UNITILinearStructures9 Abstract DataTypes(ADT) ListADTarraybasedimplementationlinkedlistimplementation cursorbased linked lists doublylinked listsapplicationsof listsStackADTQueueADT circularqueueimplementationApplicationsofstacksandqueues UNITIITreeStructures9 Tree ADT treetraversalsleftchildrightsiblingdatastructuresfor general treesBinaryTree ADT expression trees applications of trees binary search tree ADT AVL trees binary heaps UNITIIIHashingandSets9 Hashing Separate chaining open addressing rehashingextendiblehashingDisjointSet ADT dynamic equivalence problem smart union algorithms path compression applicationsofSets UNITIVGraphs9 Definitions Topological sort breadthfirst traversal shortestpath algorithms minimum spanning tree Prim's and Kruskal's algorithms Depthfirst traversal biconnectivity Euler circuitsapplicationsofgraphs UNITVAlgorithmdesignandanalysis9 Introduction to algorithm design techniques: Greedy algorithms, Divide and conquer, Dynamic programming, backtracking, branch and bound, Randomized algorithms Introduction to algorithmanalysis:asymptoticnotations,recurrencesIntroductiontoNPcompleteproblems Total:45 TEXTBOOK: 1. M. A. Weiss, Data Structures and Algorithm Analysis in C, Second Edition, Pearson Education,1997. REFERENCES: 1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, Pearson Education,1983. 2. R. F. Gilberg, B. A. Forouzan, Data Structures, Second Edition, Thomson India Edition, 2005. 3. A. M. Tenenbaum, Y. Langsam, and M. J. Augenstein, Data Structures using C, Pearson Education,1998.

4. K.S.Easwarakumar,ObjectOrientedDataStructuresusingC++,VikasPublishingHousepvt. Ltd.,2000 5. Sara Baase and A. Van Gelder, Computer Algorithms, Third Edition, Pearson Education, 2000. 6. T.H.Cormen,C.E. Leiserson,R.L.Rivest,andC.Stein,"Introductiontoalgorithms",Second Edition,PrenticeHallofIndiaLtd,2001.

IT2205 applications.

DATASTRUCTURESANDALGORITHMSLAB

0032

Aim: To develop programming skills in design and implementation of datastructures and their 1.Implementsinglyanddoublylinkedlists. 2.Representapolynomialasalinkedlistandwritefunctionsforpolynomialaddition. 3.Implementstackanduseittoconvertinfixtopostfixexpression 4.Implementarraybasedcircularqueueanduseittosimulateaproducerconsumerproblem. 5.Implementanexpressiontree.Produceitspreorder,inorder,andpostordertraversals. 6.Implementbinarysearchtree. 7.Implementpriorityqueueusingheaps 8.Implementhashingtechniques. 9.ImplementDijkstra'salgorithmusingpriorityqueues 10.ImplementabacktrackingalgorithmforKnapsackproblem Total:45 ListofEquipmentsandcomponentsforABatchof30students(1perbatch) 1.SOFTWAREREQUIREDTURBOCversion3orGCCversion3.3.4. 2.OPERATINGSYSTEMWINDOWS2000/XP/NTORLINUX 3. COMPUTERS REQUIRED 30 Nos. (Minimum Requirement :PentiumIIIorPentiumIVwith 256RAMand40GBharddisk)