(Declared as Deemed to be University U/S 3 of UGC Act, 1956)


M.Tech. (Evening) (Computer Science & Technology)
(w.e.f 2007 -08 admitted batch)

Gandhi Nagar Campus, Rushikonda VISAKHAPATNAM – 530 045

(w.e.f. 2008-09 admitted batch) 1.0 ADMISSIONS 1.1 Admissions into M Tech. (Evening) (CST) programme of GITAM University are governed by GITAM University admission regulations.


ELIGIBILTY CRITERIA 2.1 A pass in B E / B Tech / AMIE or equivalent in any branch of specialization or Masters Degree in Physics, statistics, Mathematics or Applied Mathematics, Applied Statistics, Applied Physics, Geo Physics or MSc. in Computer Science or Information Systems or MCA. Admissions into M.Tech (Evening) will be based on the following: (i) (ii) (iii) Work experience. Score obtained in GAT (PG), if conducted. Performance in Qualifying Examination / Interview


The actual weightage to be given to the above items will be decided by the authorities before the commencement of the academic year. Candidates with valid GATE score shall be exempted from appearing for GAT (PG). 3.0 STRUCTURE OF THE M Tech. (Evening) PROGRAMME 3.1 The Programme of instruction consists of: (i) (ii) (iii) 3.2 A core programme imparting to the student specialization of engineering branch concerned. An elective programme enabling the students to take up a group of departmental courses of interest to him/her. Carry out a technical project approved by the Department and submit a report.

Each academic year consists of two semesters. Every branch of the M Tech programme has a curriculum and course content (syllabi) for the courses recommended by the Board of Studies concerned and approved by Academic Council. The timings for the conduct of the M Tech (Evening Programmes) is between 5.30 pm and 9 pm from Monday to Friday. Project Dissertation has to be submitted by each student individually.






The course content of individual courses - theory as well as practicals – is expressed in terms of a specified number of credits. The number of credits assigned to a course depends on the number of contact hours (lectures & tutorials) per week.


In general, credits are assigned to the courses based on the following contact hours per week per semester. One credit for each Lecture hour. One credit for two hours of Practicals. Two credits for three (or more) hours of Practicals.


The curriculum of M Tech (Evening) programme is designed to have a total of 70 – 85 credits for the award of M Tech degree. A student is deemed to have successfully completed a particular semester’s programme of study when he / she earns all the credits of that semester i.e., he / she has no ‘F’ grade in any course of that semester.


MEDIUM OF INSTRUCTION The medium of instruction (including examinations and project reports) shall be English.


REGISTRATION Every student has to register himself/herself for each semester individually at the time specified by the Institute / University.


CONTINUOUS ASSESSMENT AND EXAMINATIONS 7.1 The assessment of the student’s performance in each course will be based on continuous internal evaluation and semester-end examination. The marks for each of the component of assessment are fixed as shown in the Table 2.

Table 2: Assessment Procedure


Component assessment


Marks allotted

Type Assessment


Scheme of Examination (i) Two mid semester examinations shall be conducted for 10 marks each. (ii) Two quizzes shall be conducted for 5 marks each. (iii) 5 marks are allotted for assignments. (iv) 5 marks are allotted for attendance The semester-end examination in theory courses will be for a maximum of 60 marks. (i) 40 marks are allotted for record work and regular performance of the student in the lab. (ii) One examination for a maximum of 20 marks shall be conducted by the teacher handling the lab course at the middle of the semester

40 1 Theory

Continuous evaluation


60 100

Semester-end examination




Continuous evaluation

(i) 50 marks are allotted for continuous evaluation of the project work throughout the semester by the guide.2 10. He /She has to repeat the semester along with his / her juniors. 9. 8. may be permitted to appear for the special examination. However.2 .0 SPECIAL EXAMINATION 9.1 A Student who has secured ‘F’ Grade in any theory course / Practicals of any semester shall have to reappear for the semester end examination of that course / Practicals along with his / her juniors.2 9. A student who has secured ‘F’ Grade in Project work shall have to improve his report and reappear for viva – voce Examination of project work at the time of special examination to be conducted in the summer vacation after the last academic year.0 REAPPEARANCE 8.0 ATTENDANCE REQUIREMENTS 10. which shall be conducted in the summer vacation at the end of the last academic year.semester examination and he/she will not be allowed to register for subsequent semester of study.* * Head of the Department concerned shall appoint two examiners for conduct of the examination.(iii) One examination for a maximum of 40 marks shall be conducted at the end of the semester (as scheduled by the Head of the Department concerned).1 A student whose attendance is less than 75% in all the courses put together in any semester will not be permitted to attend the end . 10. 8.1 A student who has completed the stipulated period of study for the degree programme concerned and still having failure grade (‘F’) in not more than 5 courses ( Theory / Practicals). the Vice Chancellor on the recommendation of the Principal / Director of the University college / Institute may condone the shortage of attendance to the students whose attendance is between 66% and 74% on genuine medical grounds and on payment of prescribed fee. A student having ‘F’ Grade in more than 5 courses (Theory/practicals) shall not be permitted to appear for the special examination. 3 Project work 100 Project evaluation (ii) 50 marks are allotted for the (III & IV presentation of the project work Semesters) & viva-voce at the end of the semester.

12. and is deemed to have earned the credits assigned to that course. a similar formula is used considering the student’s performance in all the courses taken in all the semesters completed up to the particular point of time. . 12. However.0* ≥ 7.0.3 12. The letter grades and the corresponding grade points are as given in Table 3. To arrive at Cumulative Grade Point Average (CGPA).4 Table 4: CGPA required for award of Degree Distinction First Class Second Class Pass ≥ 8.11.2 Grade points 10 9 8 7 6 5 Failed.1 Based on the student performance during a given semester. 12. G = grade points obtained by the student in the course. 0 Absolute Marks 90 and above 80 – 89 70 – 79 60 – 69 50 – 59 40 – 49 Less than 40 A student who earns a minimum of 5 grade points (C grade) in a course is declared to have successfully completed the course.1 A Grade Point Average (GPA) for the semester will be calculated according to the formula: Σ[Cx G] GPA = ---------------ΣC Where C = number of credits for the course. The requirement of CGPA for a student to be declared to have passed on successful completion of the M Tech programme and for the declaration of the class is as shown in Table 4. Table 3: Grades & Grade Points Grade O A+ A B+ B C F 11.0 GRADE POINT AVERAGE 12.0 * In addition to the required CGPA of 8.2 Semester Grade Point Average (SGPA) is awarded to those candidates who pass in all the courses of the semester. a final letter grade will be awarded at the end of the semester in each course.0 GRADING SYSTEM 11. the student must have necessarily passed all the courses of every semester in first attempt.0 ≥ 5. a minimum of 24 marks is to be secured at the semester end examination of theory courses in order to pass in the theory course.0 ≥ 6.

However the above regulation may be relaxed by the Vice Chancellor in individual cases for cogent and sufficient reasons.4 13. NCC / NSS etc. However. b) Successfully acquired the minimum required credits as specified in the curriculum corresponding to the branch of his/her study within the stipulated time. Libraries. programme in four semesters of two years.3 13. and d) No disciplinary action is pending against him / her. it can be extended up to a period of 6 months maximum.5 The degree shall be awarded after approval by the Academic Council. hostels.2 13. A student shall be eligible for award of the M Tech degree if he / she fulfils all the following conditions.13.1 Duration of the programme: A student is ordinarily expected to complete the M Tech. However a student may complete the programme in not more than four years including study period. a) Registered and successfully completed all the courses and projects. with the written permission of the Head of the Department concerned. Project dissertation shall the submitted on or before the last day of the course.0 ELIGIBILITY FOR AWARD OF THE M Tech DEGREE 13. . 13. c) Has no dues to the Institute.

The average of the two evaluations shall be considered for the award of grade in that course. 5. 3. 4. The paper setters are to be appointed by the Vice Chancellor on the basis of recommendation of Director of Evaluation / Controller of Examinations. The attendance marks (maximum 5) shall be allotted as follows: Percentage of Attendance 76% to 80% 81% to 85% 86% to 90% 91% to 95% 96% to 100% Marks 1 2 3 4 5 9. The theory papers of end-semester examination will be evaluated by two examiners. 6. The examiner for evaluation should possess post graduate qualification and a minimum of three years teaching experience. in addition to the teacher who handled the laboratory work during the semester. the paper setting shall be done by an external paper setter having a minimum of three years of teaching experience. Panel of examiners of evaluation for each course is to be prepared by the Board of Studies of the department concerned and approved by the Academic Council. The appointment of examiners for evaluation of theory papers will be done by the Vice Chancellor on the basis of recommendation of Director of Evaluation / Controller of Examinations from a panel of examiners approved by the Academic Council. 8. . If the difference of marks awarded by the two examiners of theory course exceeds 12 marks. 7. 2. With regard to the conduct of the end-semester examination in any of the practical courses of the programme. The panel of paper setters for each course is to be prepared by the Board of Studies of the department concerned and approved by the Academic Council. the Head of the Department concerned shall appoint one examiner from the department not connected with the conduct of regular laboratory work. The Vice Chancellor can permit appointment of second examiner to be internal when an external examiner is not available. Project work shall be evaluated by two examiners at the semester end examination. The average of the two nearest evaluations of the three shall be considered for the award of the grade in that course. One examiner shall be internal and the other be external.RULES 1. In respect of all theory examinations. the paper will have to be referred to third examiner for evaluation. The examiners may be internal or external.

M.Tech. (Evening ) (CST) Programme Course Code: EPECS200700 I SEMESTER Course Code EPECS101 EPECS102 EPECS103 EPECS104 EPECS111 EPECS112 Theory of Computation Computer Organization Digital Logic Circuits Discrete Mathematics Computer Organization Lab C programming Lab Name of the Course Instruction hours per week L T P Total 3 3 2 3 1 1 1 1 1 3 2 4 4 3 4 3 3 Maximum Marks C S Total 40 40 40 40 100 100 60 60 60 60 --100 100 100 100 100 100 Total: SECOND SEMESTER Course Code EPECS201 EPECS202 EPECS203 EPECS204 EPECS211 EPECS212 Language Processors Operating System Data Structures with C++ Database Management System Data Structures Lab Database Management System Lab Total: L – Lectures T – Tutorials D – Drawing P – Practicals C –Continuous Evaluation S – Semester End Examination 18 Name of the Course Instruction hours per week L T P Total 3 3 3 2 1 1 1 3 3 4 3 4 3 3 3 Maximum Credits Marks C S Total 40 40 40 40 100 100 60 60 60 60 --100 100 100 100 100 100 4 3 4 3 2 2 Credits SYLLABUS 4 4 3 4 2 3 20 .

Tech. (Evening) (CST) THIRD SEMESTER Instruction hours per week L T P Total 3 3 2 1 1 4 3 3 Maximum Marks C S Total 40 40 40 60 60 60 100 100 100 Course Code EPECS301 EPECS302 Name of the Course Credits Software Engineering Computer Networks Elective-I 4 3 3 EPECS321 a) Data Warehousing and Data Mining b)Embedded Systems c)Internet Technologies Object Oriented Analysis and Design Computer Networks Lab Object Oriented Analysis and Design Lab 3 1 3 3 4 3 3 40 100 100 60 --100 100 100 4 2 2 18 EPECS322 EPECS323 EPECS302 EPECS311 EPECS312 Total: FOURTH SEMESTER Course Code EPECS411 EPECS412 Name of the Course Instruction hours per week L T P Total 24 - Maximum Marks C S Total 50 100 50 -100 100 Credits Project Seminars 12 2 14 Total: Total Credits: 70 .M.

Introduction to Automata Theory.E and J. Christos H.Tech.Finite Representation of Languages. .D. UNIT-IV Church thesis: Church’s Thesis – The Primitive Recursive functions – Godelization – The μ-Recursive Functions – Turing – Computability of the μ-Recursive functions – Universal Turing Machines.M. UNIT-III Turing machines: The Definition of Turing Machine – Computing with Turing Machines – Combining Turing Machines – Some Examples of More Powerful Turing Machines. UNIT-V Computational complexity: Time-bounded Turing Machines – Rate of Growth of functions – Time-Bounded simulations – The Classes P and NP – NP-Completeness – Some NP-complete Problems – Integer Programming – The Travelling Salesman Problem. J. New Delhi Reference: Hopcroft. Turing – Acceptability. (Evening) (CST) I SEMESTER THEORY OF COMPUTATION Course Code : Credits: 4 Department: CSE EPECS101 Category : CE Hours : 4 per week UNIT-I Introduction To Finite Automata: Alphabets and languages. Reading.Decidability – Unsolved problems about Turing machines and μ-Recursive FunctionsPost’s correspondence problem. UNIT-II Context free languages: Context –Free Grammar – Regular Languages and Context-Free Grammar – Pushdown Automata – Pushdown Automata and Context-Free Grammar – Properties of Context-Free Languages – Closure Properties – Periodicity Properties – Determinism and Parsing – Deterministic Pushdown Automata and Context – Free Languages – Top. and Computation. Languages. Mass. Ullman. Deterministic Finite Automata – Non-deterministic Finite Automata – Equivalence of Deterministic and Non-Finite Automata – Properties of the Languages Accepted by Finite Automata – Finite Automata and Regular Expressions – Proofs of those Languages Are and Are Not Regular.down Parsing – Bottom – Up parsing. Uncomputability: The Halting Problem – Turing-Enumerability. Addison-Wesley. 1979. Prentice-Hall of India Private Limited. Text Book: Harry R Lewis. and Turing . Papadimitriou : Elements of The Theory of Computation”.

V.L. simple programs with 8085. Register Transfer. Instruction Formats. Address Sequencing. Associative Memory. Stack Organization.N. Design of the Control Unit. Input-Output and Interrupt. Addressing Modes. Arithmetic Logic Shift Unit. Text Books: 1.M. UNIT-IV Input Output Organization: Peripheral Devices. UNIT-II Basic Computer Organization: Instruction Course Codes. Raja Rao Publisher: Scitech Publication. Main Memory. Priority Interrupt. Input Output Processor. Asynchronous Data Transfer. addressing modes. UNIT-V 8085 Microprocessor: Internal architecture. Addition and Subtraction. Virtual Memory. Morris Mano Publisher: PHI 2 Micro processor architecture. (Evening) (CST) I SEMESTER COMPUTER ORGANIZATION Course Code : Credits: 4 Department: CSE EPECS102 Category : CE Hours : 4 per week UNIT-I Register Transfer And Micro Operations: Register Transfer Language. Direct Memory Access. Modes of Transfer. Data Transfer and Manipulation. MICROPROGRAMMED CONTROL: Control Memory. Computer Registers. programming and applications with 8085 Author: Ramesh Gaonkar Reference Book: Computer Architecture and Organization (Third Edition) Author: John P. Cache Memory. Hayes Publisher: Tata McGraw Hill Reference Book: Computer Organization Author: M. . CENTRAL PROCESSING UNIT Central Processing Unit: Introduction. Input-Output Interface. Bus and Memory Transfers. Memory Organization: Memory Hierarchy. Timing and Control. Shift Micro-operations. instruction set. Logic Micro-operations. Booth Multiplication Algorithm. Instruction Cycle. Micro program Example. Auxiliary Memory. Memory-Reference Instructions.Computer System Architecture Author : M. Computer Instructions. General Register Organization.Tech. UNIT-III Computer Arithmetic: Introduction. pin configuration. Arithmetic Microoperations. Program Control. block diagram. Decimal Arithmetic Unit.

OR and NOT gates. binary. general radix ‘r’ system. subtraction). ring counter.triggered D flip flop. bcd counter. UNIT-IV Flip Flops And Counters: Flip flops. a tabular method for minimization. multilevel synthesis. arithmetic with signed and unsigned numbers (addition.JK flip flops). incompletely specified functions.Tech. Course Code converters. minimization of product of sums forms. (Evening) (CST) I SEMESTER DIGITAL LOGIC CIRCUITS Course Code : Credits: 3 Department: CSE EPECS103 Category : CE Hours : 3 per week UNIT-I Number Systems And Course Codes: Positional representation of numbers. Fundamental of digital logic with Verilog Design by Stephen Brown & ZVONKO VRANESIC.error detection and correction UNIT-II Logic Gates And Boolean Algebra: Introduction to logic circuits-variables and functions. UNIT-III Combinational Circuits: Combinational logic. complements.D. NAND and NOR logic networks. Construction of 3x4 memory(RAM and ROM). cubical technique for minimization. Tata McGraw Hill 2. binary Course Codes. adders. introduction for CAD tools. decimal.V.shift register(uni directional and bidirectional). representation of signed numbers(integers and floating point). octal. Johnson counter. truth tables. basic latch. Writing verilog Course Code for combinational procedures.shift register with parallel load. gated SR latch. ripple counters. Master-slave and edge. logic gates and networks. gated D latch. Optimized implementation of logic functions-karnaugh map. mod counters. de-multiplexers. sub tractors. strategy for minimization. Text Books: Digital logic and computer design by Morris Mano Reference: 1. T flip flop. synthesis using AND. deCourse Coders. Kohavi. writing verilog Course Code for flip flops and counters UNIT-V Registers: Register with parallel load (using RS. multiplexers. multiple output circuits.M. Boolean algebra. Hexadecimal number systems. JK flip flop. Switching Theory & Finite Automata – Z. number conversions. enCourse Coders. . synchronous counters.

(Evening) (CST) I SEMESTER DISCRETE MATHEMATICS Course Code : Credits: 4 Department: CSE UNIT-I EPECS104 Category : CE Hours : 4 per week Mathematical logic-statements and notation. 2.General properties.. Discrete Mathematics structure with applications to computer science. binary trees. References books: 1.Pearson Education. Text Books: 1. characteristic roots. Kenith Rosen. R. and their applications. homomorphism. Manohar 2. solutions of recurrence relations-substitution. theory of inference for propositional calculus. Tata McGraw Hill. nonhomogenous recurrence relations UNIT-III Partial ordered sets – Hasse diagrams – Lattices – Distributive and modular lattices – Boolean algebra UNIT-IV Algebraic structures. predicate calculus.M. semi groups. normal forms. Trembly. planar graphs. residue arithmetic. Marc Lipson. Euler & Hamiltonian graphs. Schaum’s outlines by Seymour Lipschutz. spanning trees. Discrete Mathematics. monoids groups.Tech. chromatic number. directed trees.Asia. connectives. Mcgraw Hill. trees. generating functions. . coefficients of generating functions. Discrete Mathematical Structures by kolman.P. isomorphism. Busby and Ross. Discrete Mathematics & Its applications. J. Tata Mc Graw Hill publishing Company Ltd. Fermat’s theorem group Course Codes. UNIT-II Recursion – Primitive recursive & partial recursive function – Recurrence relationsgenerating functions of sequences. UNIT-V Graphs-concepts.

Half subtractor and full subtractor d. Addition of two sixteen bit numbers 3. Shift register 2. Verification of gates b. List of Hardware Experiments: a.Tech. Maximum from a set of numbers 2. (Evening) (CST) I SEMESTER COMPUTER ORGANIZATION LAB Course Code : Credits: 2 Department: CSE EPECS111 Category : CE Hours : 3 per week 1. List of Software Programs: 1. Sorting a set of numbers 4. Conversion of BCD to HEX 5. Flashing and rolling display of a word 7. Conversion of HEX to BCD 6.M. Display of seconds in the data field . Half adder and full adder c. DeCourse Coder and multiplexer e R-S and J-K flip flops f Counter (Synchronous or ripple) g.

4. Write a program to implement binary search. Write a function to swap to numbers by using call by reference. Write a program to read the coordinates of a triangle and find the area. Check whether the given points form a triangle or a straight line. Write a program to delete redundant elements in a given set of values. sex. Write a program to check whether the given matrix is symmetric or not. . Write a program to find the roots of a quadratic equation. 13. 3. 14. 9. 12. (Evening) (CST) I SEMESTER C PROGRAMMING LAB Course Code : Credits: 3 Department: CSE EPECS112 Category : CE Hours : 3 per week 1. (use string handling functions) 16. multiplication of two given matrices . Write a program to print the Pascal triangle. 6. Write a program for addition. Write a program to check whether the given number is prime or not. Write a program to read N student records having fields (sno. cgpa) and sort them by CGPA. 2. 8. 10. Write a function to find the value of nCr. Write a program to count the number of words and number of vowels in a given sentence. Write a program to find maximum element of a given array 11. Write a program to print Fibonacci series up to a given number. sname. 15. 7.M. 5. Write a program to arrange the elements in ascending order.Tech. Write a function to sort the given list of names in dictionary order.

Boolean Expressions. Ullman. Implementation of a Lexical Analyzer UNIT – III Syntax Analysis: Basic parsing techniques: Shift Reduce Parsing. Canonical LR and LALR parsing tables. Systems Programming and Operating Systems. Alfred v. Peephole Optimization. register allocation and Assignment. The DAG representation of Basic Blocks UNIT . . Donovan. Techniques and Tools.II Introduction to Compilers: The structure of a compiler. Jeffery D. Alfred V. TATA Mcgraw Hill.M.IV Syntax directed Translation: Syntax directed Translation Schemes. (Evening) (CST) II Semester LANGUAGE PROCESSORS Course Code : EPECS201 Category : CE Credits: 4 Hours : 4 per week Department: CSE UNIT – I : Introduction to System Programming. Implementation of LR Parsing Tables. Systems programming by John. phases of a compiler.Tech. Syntax Trees. Recursive Descent Parsing. Predictive Parsing. Lexical Analysis: The role of the Lexical analyzer. Loaders: Brief discussion on various Loader schemes UNIT . 2. Brute Force Parsing. triples. 2. Efficient Bottom Up parsing techniques: LR Parsers. Compilers Principles. Course Code Optimization: The Principal Sources of Optimization.AHO. Loop Optimization. UNIT . Error Detection and Recovery: Brief discussion on Errors. D M Dhamdhere. J. Features of a macro facilities. Constructing SLR. a simple approach to the design of Lexical analyzers. Translation of Assignment Statements. boot strapping. Code Generation from DAG. Narosa Publishing House. Three Address Course Code: quadruples. Principles of Compiler Design. AHO and Jeffery D. Macros and Macro Processors: Macro Instructions.V Code Generation: A Simple Code Generator. Intermediate Course Codes: Postfix Notation. Design of a two pass macro processor. Assemblers: Introduction to assemblers. Ullman &Ravi Sethia Addison Wesley. A Language for Specifying Lexical analyzers. an automatic Parser generator. Design of a Two Pass Assembler and brief discussion on Single Pass Assembler. Reference Books: 1. Lexical Phase errors. Operator-Precedence Parsing. Syntactic Phase errors and Semantic errors Symbol Tables: Contents of Symbol table and Data structures for symbol table Runtime Storage Administration: Simple stack allocation scheme Text Books: 1.

Paging. Allocation methods. Threads. Handling.M. UNIT-III Dead Locks: Characterization. (Evening) (CST) II Semester OPERATING SYSTEMS Course Code : EPECS202 Credits: 3 Category : CE Hours : 3 per week Department: CSE UNIT-I Introduction to Operating Systems: Definition. File system structure. Grey Gagne. Operating systems structures: Services. I/O Interfaces. Disk scheduling. Classical problems of Synchronization. Design issues. system calls. Galvin. 2. Segmentation & Paging. Frames. Detection & Recovery. Demand paging. UNIT-IV Storage Management: Memory Management: Swapping. Segmentation. Page replacement. Multi processing systems. Semaphores. Case study overview: Unix. Inter process communications. Real time system. Multiprogramming Batch System. Access methods. Text Book: 1. Definition. UNIT-II Process Management: Process Concepts. File Systems: Concepts. Demand Segmentation. Operation on processes. Prevention. Software concepts. Introduction to Distributed systems. Co- operating processes. UNIT-V I/O management: I/O Hardware. Virtual memory. Time sharing systems. Scheduling algorithms. Protection. Hardware concepts. Multiple Processors and Real time scheduling. Linux. Kernel I/O Subsystems. system structure. Tanenbaum. Types of OS: Batch processing system. CPU Scheduling. And Windows NT OS. Thrashing. Applied Operating Systems concepts with Java Silberschatz. PHI . Reference: Modern Operating Systems – Andrew S. Process scheduling. Distributed Operating Systems by Andrew S Tanenbaum. virtual machines. Avoidance. Process synchronization: Critical section problems. systems programs.Tech.

M. Complexity analysis. Selection Sort. Tata McGraw Hill. Various types of hashing. Applications. Basics of time complexity UNIT II Linked Lists. formula based representation. Dequeues. Heileman (Tata McGraw Hill Edition) . Circular Lists Operations and Applications. Mark Allen Weiss. Asia. Overview of C++ classes. Binary Search. indirect addresses.Minimum Spanning Tree. Operations on B + trees and applications. Quick Sort. matrices. Vikas publication House. Pearson Edition. Reference Books: 1. UNIT III Trees Definitions and properties. Spanning Tree . 2. Applications. Gregory L. Second Edition. simulating pointers. Algorithm and OOP. B+Trees. Priority Queue. Data Structures & Algorithm Analysis in C++. pointers. . Operations. Algorithms and Applications in C++. Sequential Search. Prim’s Algorithm. Binary tree traversal. Stacks And Queues Single Linked Lists. Adam Drozdek. UNIT IV Searching And Sorting Merge Sort. Prentice Hall India.Tech. Data Structures. AVL Trees and Operations on AVL Trees. (Evening) (CST) II Semester DATA STRUCTURES WITH C++ Course Code : Credits: 4 Department: CSE UNIT I Introduction EPECS 203 Category : CE Hours : 4 per week Object oriented programming concepts. Array and linked representation of stacks Queues: Definitions and operations. MosheJ Augenstein. Circular Queues. Data Representation: Linear lists. Text Book: 1. Data Structures using C and C++ . Yedidyah Langsam. UNIT V Graphs Definitions and Representation of Graphs. Data Structures & Algorithm in C++. Representation of Binary Trees. Double Linked Lists. 3. S Sahani. Arrays. aaron M Tenenbaum . Data Structure. Array and linked representation of queues. Graph Search Methods. Kruskal’s Algorithm. 2. Heap Sort. parameters passing.

logs. transaction management. media recovery Text Book: Reference: th Database Management Systems. queries in dbms. Basic SQL query. Functional dependencies. Triggers UNIT-IV Database Design: Schema refinement. aggregation. (Evening) (CST) II Semester DATABASE MANAGEMENT SYSTEM Course Code : Credits: 3 Department: CSE UNIT-I Introduction: EPECS204 Category : CE Hours : 3 per week Data. Transaction & schedule.Tech. McGraw Hill .M. multi version concurrency control. Decomposition into 3NF and BCNF. recovering from a system crash. relational model. structure of dbms and people who work with dbms UNIT-II ER Model. Relational Model ER model. check pointing. ARIES. A. lock conversions. Optimistic concurrency control. Raghu Ramakrishnan. Concurrent execution of transaction. attributes & entity sets. UNIT-III Relational Algebra And SQL: Relational algebra. Third & Boyce-Course Code normal forms. dealing with dead locks. Schema refinement in database design UNIT-V Transaction Processing: ACID properties. Lock management. conceptual design with ER model. weak entities. nested queries. integrity constraints. Silberschatz. H. Johannes Gehrke 4 Edition. the writeahead log protocol. properties of decomposition. levels of abstraction. relational calculus. McGraw Hill th Database System Concepts. aggregate operators. crash recovery. timestamp-based concurrency. ER diagrams. Korth 5 Edition. key and participation constraints. storing data in dbms. Serializability and recoverability. entities. data independence. null values. class hierarchies. relationship & relationship sets. case study: requirement analysis and conceptual design. Lockbased concurrency control. closure of set of FDs and attribute.

Sorting Algorithms: Quick Sort. In order. Evaluating a given postfix expression 8. Breadth First Search of a Graph 13. Operations of a dequeue 9. preorder. Insertion Sort. Merge Sort. preorder. Operations on queues 3.Tech. Finding the shortest path from a given node to all other nodes a digraph a) Directed Graph b) Undirected Graph 14. (Evening) (CST) II Semester DATA STRUCTURES LAB Course Code : Credits: 2 Department: CSE EPECS211 Category : CE Hours : 3 per week Develop algorithms and write programs in C++ to implement the following: 1. multiplication. Converting a given infix expression to postfix form 7. Addition and multiplication of two sparse matrices 6. . Hashing Algorithms 10. Depth First Search of a graph 12. Heap Sort 11. 2. Polynomial Addition. In order. post order traversal of a binary tree using non recursion 5.M. Operations on stacks. post order traversal of a binary tree using recursion 4.

A. Oracle PL/SQL Programming Steven Feuerstein O’Reilly Publishers 2. C++. Be sure to underline all primary keys. Identify the functional dependencies in each relation 3. The logical design performs the following tasks: 1. search internet for necessary documentation . (Evening) (CST) II Semester DATABASE MANAGEMENT SYSTEM LAB Course Code : Credits: 2 Department: CSE EPECS212 Category : CE Hours : 3 per week Each student is assigned with a problem. 2.Tech. Normalize to the highest normal form possible B. include all necessary foreign keys and indicate referential integrity constraints.M. PL/pgSql. The student is to develop a logical and physical database design for the problem. Perform DML and DDL using all possible SQL commands and with the help any one host languages like C. Perform DML and DLL using PL/SQL and PL/pgSQL for the above problems Reference: 1. Map the ER/EER diagrams to a relational schema. VB etc (ie embedded SQL) D. Perform physical design based above logical design using Oracle/MSSQL on Windows platform and MySQL/PostgreSQL on Linux platform C.

Shroff Publishers & Distribution Pvt Ltd. A Generic view of process: Software engineering. Software Engineering.Tech. the art of Debugging. Software myths. Requirements management. (Evening) (CST) III Semester SOFTWARE ENGINEERING Course Code : Credits: 4 Department: CSE EPECS301 Category : CE Hours : 4 per week UNIT-I: Introduction to Software Engineering: The evolving role of software. .K. Validation testing. System requirements. System models: Context Models. Design evolution.Shely Cashman Rosenblatt. Pressman.A layered technology. personal and team process models. The Capability Maturity Model Integration (CMMI). Metrics for Analysis Model.M. Design evaluation. Simulation and Prototypes. 4. Architectural Design. Managing the Test.Roger S. 6th edition. structured methods. UNIT-V: Plans for testing: Snooping for information.Thomson Publications. Testing for recoverability. Incremental process models. Product metrics: Software Quality. UNIT-IV: Testing Strategies: A strategic approach to software testing. Design concepts. Creating an architectural design: software architecture. Architectural styles and patterns.Sommerville . A practitioner’s Approach. Software Engineering. Requirements engineering process: Feasibility studies. Data design. Shannon.Waman S Jawadekar. Data models. test strategies for conventional software. UNIT-II: Software Requirements: Functional and non-functional requirements. Requirements validation. Requirements elicitation and analysis. Witold Pedrycz. an Engineering approach. 3. Object-Oriented Design: Objects and object classes. Interface specification. Changing Nature of Software. User interface analysis and design. Black-Box and White-Box testing. Tools. The McGraw-Hill Companies. Coping with complexity through teaming. Peters. Software Testing Techniques – Loveland. Software Engineering principles and practice.New Age International Publishers 2. Metrics for maintenance. Performing User interface design: Golden rules. Process patterns. Planning for troubles. Preparing for the tests: Software Reuse. Evolutionary process models. Metrics for Design Model. The Unified process. McGraw Hill International Edition. Object models. 3. interface analysis. Pearson education. Reference Books: 1. System testing. John Wiely. Software Engineering. process assessment. interface design steps. Metrics for source Course Code. Test Execution. Systems Analysis and Design. a process framework. An Object-Oriented design process. Testing plan focus areas. Agarwal & Yogesh Singh. Metrics for testing.James F. 7th edition. 2. User requirements. UNIT-III: Design Engineering: Design process and Design quality. Prewitt. Data corruption. Developing good test programs. Process models: The waterfall model.K. the design model. Software Engineering. Customer’s role in testing Text Books: 1. Miller. the software requirements document. Testing with a virtual computer.. Behavioral models..

Final Delivery. ICP and IPV6. HTTP – The Hyper Text Transfer Protocol. Static Web Documents . Berkeley Sockets and examples. Unit-IV Transport Layer: Transport Services: Services provided to the upper layer. Dynamic Web Documents. The Network Layer in the Internet: IP. . UDP. Remote bridges. Connection Establishment. Bridges. The Internet Transport Protocols: TCP. Message Formats. Local Internetworking. (Evening) (CST) III Semester COMPUTER NETWORKS Course Code : Credits: 3 Department: CSE EPECS302 Category : CE Hours : 3 per week Unit-I Reference Models: OSI. 4th Edition. The Wireless Web. Data and Computer Communications. Unit-III Network Layer: Design Issues: Store and forward packet switching. Multiple Access Protocols: ALOHA.Tech. Services provided to the Transport Layer. Routers and Gateways. Message Transfer. Data Communications and Networking by Behrouz a Forouzan. Resource. MAC sub layer protocol. Name server. physical layer. Primitives.Computer Networks – Andrew S Tanenbum. Records. Pearson Education/PHI. Flow control and Buffering. Connection Oriented Networks. Text Books: 1. Reference Book: 1. the user Agent. Unit-II IEEE 802. Multiplexing and crash Recovery. Release. Switches. Performance Enhancements.M. Elements of Transport Protocols: Addressing. Electronic Mail: Architecture and services. frame structure and services. Examples of Networks: Novel Netware. 4th Edition.y. Data link Layer Switching: Bridges from 802. Tata McGraw-Hill.x to 802. 2. Routing Algorithms. Wireless LANS: 802.x Standards Ethernet. TCP/IP and Differences between OSI and TCP/IP. Bluetooth. MAC Sub layer: Channel Allocation Problems: Static and Dynamic. Congestion Control Algorithms.11 protocol stack. Hubs. Internet. Spanning tree bridges. Repeaters. Implementation of connection less and connection oriented services and comparisons. The World Wid Web (WWW): Architecture Overview. Collision-free protocols. 7th Edition by William Stallings. Unit-V Application Layer: The Domain Name System (DNS): The DNS Name Space. CSMA.

A Categorization of Major Clustering Methods. Data Mining by Tan. Data Warehouse Architecture. Margaret H Dunhan. Steinbach. From Association Mining to Correlation Analysis. Hierarchical Algorithms. Types of Data in Cluster Analysis. Pearson Education. Mining Multidimensional Association Rules from Relational Databases and Data Warehouses. Bayesian Classification. Cluster Analysis: What is Cluster Analysis. Data Warehouses. Mining Class Comparisons: Discriminating between different Classes. Mining Multilevel Association Rules from Transaction Databases. . What is Data Mining. Transactional Databases. Classification by Back propagation. Data Mining Functionalities. Morgan Kaufman Publications. Data Reduction. Data Warehousing to Data Mining. Partition Algorithms. Analytical Characterization: Analysis of Attribute Relevance. (Evening) (CST) III Semester DATA WAREHOUSING AND DATA MINING Course Code : Credits: 3 Department: CSE EPECS321 Category : CE Hours : 3 per week UNIT-I Introduction to Data Mining: Motivation and importance. Vipin Kumar. Fuzzy Set Approaches. Rough Set Approach. Data Warehouse Implementation. Development of Data Cube Technology. Generic Algorithms. Witten Eibe Frank. Interestingness of a pattern Classification of Data Mining Systems. Advanced Database Systems and Advanced Database Applications. Pearson Education.M. Prediction. Classifier Accuracy. 2. Classification Based on Concepts from Association Rule Mining. 3. Data Preprocessing: Why Pre-process the Data? Data Cleaning. Mining Single-Dimensional Boolean Association Rules from Transactional Databases. Constraint-Based Association Mining. Text Books: 1Data Mining Concepts and Techniques Jiawei Han and Micheline Kamber Morgan Kaufman Publications Reference Books: 1. Other Classification Methods like k-Nearest Neighbor Classifiers. UNIT-IV Mining Association rule in large Databases: Association Rule Mining. Discretization and Concept Hierarchy Generation UNIT-III Concept Description: Characterization and Comparison: What is Concept Description. Ian H. Case-Based Reasoning. Major issues in Data Mining.Tech. Mining Descriptive Statistical Measures in large Databases. Data Generalization and summarization-based Characterization. Data Integration and Transformation. UNIT-II Data Warehouse and OLAP Technology for Data Mining: What is a Data Warehouse? Multi-Dimensional Data Model. Relational Databases. Data Mining. Data Mining Introductory and Advanced Topics. Classification by Decision Tree Induction. UNIT-V Classification and Prediction: Concepts and Issues regarding Classification and Prediction.

4. Pearson Education. Complex Systems and Microprocessor. An example RTOS like uC-OS (Open Source). Labrosse. External Memory. 2. UNIT -IV Introduction to Real – Time Operating Systems: Tasks and Task States. Events. Interrupt Routines in an RTOS Environment UNIT . Programming the 8051. UNIT -III Arithmetic Operations. Applications: Interfacing with Keyboards. Raj Kamal. Raj kamal. Hard RealTime Scheduling Considerations. Microcontrollers. Using Laboratory Tools. and Shared Data. Displays. Embedded Systems. Embedding system building blocks. David E. Jump and Call Instructions. Saving Memory and Power. An Embedded Software Primer. Timer Functions. Formalisms for System Design. An Example System.Tech. Elseveir. TMH. Counter and Timers. The 8051 Microcontroller. Wayne Wolf. John Wiley. . Design Examples. Serial data Input/Output.M. Semaphores and Queues. Memory Management. Computers and Components.Ayala. 2. Frank Vahid. Pearson Education. Data Transfer and Logical Instructions. Embedded Software Development Tools: Host and Target machines. Micro Controllers. Linker/Locators for Embedded Software. Interrupts UNIT -II Basic Assembly Language Programming Concepts : The Assembly Language Programming Process. Reference Books: 1. Multiple Interrupts. Simon. Text Books: 1. The Embedded System Design Process. via CMP publishers. Input/Output Ports and Circuits. Ajay V Deshmukhi. Tasks and Data. Further Details on Interrupts. Decimal Arithmetic. (Evening) (CST) III Semester EMBEDDED SYSTEMS Course Code : Credits: 3 Department: CSE EPECS322 Category : CE Hours : 3 per week UNIT . Thomson. Mailboxes and Pipes. Message Queues. 5. 8051 Micro controller Hardware. Serial Data Communication.V Basic Design Using a Real-Time Operating System: Principles. Third Edition. Programming Tools and Techniques. Getting Embedded Software into the Target System. Semaphores. Embedded System Design. Kenneth J. Debugging Techniques: Testing on Host Machine. Tony Givargis. The 8051 Architecture : Introduction. 3. TMH.I Embedded Computing: Introduction. 3. D/A and A/D Conversions.

getting input from the user. operators.Herbert Schildt. sending data to the server. static members. Managing errors and exceptions. overriding methods. UNIT-III Interfaces. UNIT-V Networking and Servlets: Introduction to networking using JAVA API. 1998. java tokens. designing a web page. languages under different operating systems. programming style. multithreaded programming. 3. designing applications using forms in PERL. abstract methods and classes. inheritance: extending a class.Tech. constructors. programming in CGI. Managing input/output files in java. Decoding forms in other languages. finalize method. input/output exceptions. simple java Program. two-dimensional arrays. creating of files. File statistics. (Evening) (CST) III Semester INTERNET TECHNOLOGIES Course Code : Credits: 3 Department: CSE EPECS323 Category : CE Hours : 3 per week UNIT-1 Common Gateway Interface(CGI): CGI applications. strings and vectors: arrays. interactive input and output. multithreading and Exceptions: Interfaces: multiple inheritance. 6th Edition. UNIT-II Introduction to Java: Overview of Java language: introduction . Output from CGI and response headers. Kenarnold and James Gosling: “The Java Programming Language” Addison.Wesley. objects and methods. Server side includes(SSI)configuration. Executing external program and CGI programs. Thomas Boutel: “CGI Programming In C and Perl”. Using JDBC in servlets. command line arguments. Addison – Wesley. implementing the “runnable” interface. wrapper classes.1996. decision making and branching. packages. 1996. “JAVA 2: The Complete Reference”. Constants. Common errors. java statements. Shishir Gundavaram: “CGI Programming On the World Wide Web”. synchronization. accessing from input. 5th Edition. expressions. Handling HTTP GET and POST requests.. final variables and methods. Input to the CGI-environmental variables. methods overloading. Examining environmental variables. “JAVA How to program”. configuring the server. one-dimensional arrays. Tailoring SSI output. Overview and architecture of a servlets. data types. UNIT-IV Applet programming and Files: Applet programming. vectors. 2002 Reference Books: 1. Arrays. Text Books: 1. environmental variables.2005. variables. . java virtual machine. other stream classes. Including boilerplates. creating and array. TCP/IP Sockets and Datagram Sockets.M. Classes. Deital H. Deital P. Packages. O’ Reilly and Associates. strings.M. Forms and CGI: HTML tags. 2. J. 4. Pearson Education. TMH. implementing a java program. visibility control.

Addison. Booch Methodology. Functional Model. . Alpha. The Unified Modeling Language User Guide (unit-ii). Behavior. Bottom-up. Black-box. Unit. Reference books: 1. Designing Classes. Differences between Patterns and Frameworks. UML diagrams: Static.Tech.Class Visibility. Object Oriented System Development Life Cycle. Non Generative. Orthogonal Views of Software. Testing. Design Patterns.associations and aggregations. Craig Larman: Applying UML and Patterns. Introduction to UML. OODBMS. Primary Goals of UML.Object Model. Object Oriented Methodologies: Rambaugh Object Model.McGrawHill. Pearson Education. DBMS. Dynamic. Patterns: Generative. 1994. Integration. Need for Testing. Ivar Jacobson. Implementation. Top-down.M. Unit III: Analysis: Object Oriented Analysis Process: Identifying Use cases. Text Book: 1. State and Activity diagrams. Identifying Object Relationships. James Rambaugh. Unit IV: Design: Object Oriented Design Process and Design Axioms. Object Analysis: Classification into classes . Jacobson Methodology. Beta. View Layer: Designing interface Objects: Macro-level. Access layer: Object Storage and Object interoperability. 2. Designing Access layer Classes.Wesley. (Evening) (CST) III Semester OBJECT ORIENTED ANALYSIS AND DESIGN Course Code : Credits: 4 Department: CSE EPECS302 Category : CE Hours : 4 per week Unit I: Introduction: Need for Object Orientation. Grady Booch: Object Oriented Analysis and Design. Dynamic Model. methods. Coupling. attributes. Pearson Education. Principles of Modeling. Test Cases. Ali Bahrami: Object Oreinted Systems Development. Cohesion. Object Oriented Design Corollaries. 1999. Design Philosophy. Unit II: UML: Importance of Modeling. Object basics. Unit V: Quality Assurance: Software Quality Assurance: Introduction. Micro-level interfaces. 2002. Frameworks. Testing Strategies: White-box. OMT. Interaction. 2. Concepts of Object orientation. Designing Classes. Kinds of Errors. Grady Booch.

The server must handle multiple clients. HEAD. An Introduction to Computer Networking. Simulation of Telnet: Provide a user interface to contact well-known ports. If the exception does not occur then the remote port is active else the remote port is inactive. POST.M.Tech. Whatever is written by one party can be seen by all other parties. Java Network Programming. HTTP-Server: Develop a HTTP server to implement the following commands. so that client-server interaction can be seen by the user. Simple file transfer between two systems (without protocols): By opening socket connection to our server on one system and sending a file from one system to another. (Evening) (CST) III Semester COMPUTER NETWORKS LAB Course Code : Credits: 2 Department: CSE EPECS311 Category : CE Hours : 3 per week 1. (Unix Network programming-Stevens) 8. 2. ii) Many-Many (Broad cast): Each client opens a socket connection to the chat server and socket. DELETE. This server accepts SQL queries from the client. ii) SMTP Client : Gives the server name.) 5. Mail Client: i) POP Client : Gives the server name . Mansfield Jr and James L. Antonakos Pearson Education Asia. Identifying well known ports on a Remote System: By trying to listen to the various well known ports by opening client connections. 4. Kenneth C. executes it on the database and sends the response to the client. GET. Reference Books: 1. user name and password retrieve the mails and allow manipulation of mail box using POP commands. 3. send e-mail to the recipient using SMTP commands.(Core Java 2 pg:163. Writing a Chat application: i) One-One: By opening socket connection and displaying what is written by one party to the other. 7. Data retrieval from a Remote Database: At the remote database a server listens for client connections. Harold Orielly 2. 6. writes to the . TFTP-Client: To develop a TFTP client for file transfer.

A POS system must support multiple and varied client-side terminals and interfaces such as browser. Email takes up 30 . Mini-Project-II: Online Bookshop Example: Following the model of amazon. it is typically used in a retail store. and then taxis over to the terminal. Mini-Project-V: An Automated Community Portal: Business in the 21st Century is above all BUSY.M.both static & dynamic aspects. The resulting application will enable the user to take out a loan. Landing: an aircraft uses the runway. Numerous other ideas can be found in the pages from the list of references given below. PDAs. (Evening) (CST) III Semester OBJECT ORIENTED ANALYSIS AND DESIGN LAB Course Code : Credits: 2 Department: CSE EPECS312 Category : CE Hours : 3 per week The student is expected to take up about five mini-projects and model them and produce Use Cases. and software to run the system. purchase a machine. Distractions are everywhere. design and implement an online bookstore. lands. follow the performance of their company. that is. Sequence Diagrams and State-Charts.70% of an employee's time. management is tasked with un for seen and unfunded leadership and change-agent roles as well as leadership development and succession management. even if remote services are temporarily unavailable they must still be of capturing sales and handling at least cash payments. Mini-Project-III: A Simulated Company: Simulate a small manufacturing repeatable process that enhances communications within . Your application should support multiple aircrafts using several runways and gates avoiding collisions/conflicts. What is needed is a simplified. it includes hardware components such as a computer and bar Course Code scanner. Take-Off: an aircraft taxies to the runway and then takes off. It interfaces to various service applications. Mini-Project-IV: A Multi-Threaded Airport Simulation: Simulate the operations in an airport. touch-screens. Mini-Project-I: A Point-of-Sale (POS) System: A POS system is a computerized application used to record sales and handle payments. These systems must be relatively fault tolerant. despite the large capital expenditures it takes to stand them up. Meanwhile. The current crop of "enterprise intranet portals" are often high noise and low value. Analysis Documents .Tech. and over a series of monthly production runs. such as a third-party tax calculator and inventory control. Database Design using Rational Products A sample collection of ideas is given. Chat and Instant Messaging are either in the enterprise or just around the or bn.

The editor will act according to the specific language the current source . All these documents are usually kept 1 on papers or individual files on the computer. it will have powerful discovery and business intelligence features. unattended moderation of discussions However. and permissions. Glass Course Code's goal is to build that etc. The system will also allow users to collaborate by assigning permissions for multiple users to view and edit notes. and share information over the web. Mini-Project-VIII: A Notes and File Management System: In the course of one's student years and professional career one produces a 1 lot of personal notes and documents. Features: * Robust Permissions System * Templates for easy custom site designs * Total control over the content * Search engine friendly URL's * Role based publishing system * Versioning control * Visitor profiling Mini-Project-VII: An Auction Application: Several commerce models exist and are the basis for a number of companies like Encourages peer review and indicates for management potential leaders. auctioning etc. security. Mini-Project-VI: A Content Management System: The goal is to enable non-technical end users to easily publish. style. access. enterprise. owing to a powerful API and adherence to Java platform standards. Design and implement an auction application that provides auctioning services. It should clearly model the various auctioneers. the system should function as a general-purpose content management. and will have the following features: Remote. while allowing management and peers to self-select future leaders and easily recognize high performance team members in a dynamic way. The software is released under a proprietary license. the bidding process. Mini-Project-IX: A Customizable Program Editor: A programmer's editor which will be focused on an individual programmer's particular needs and style. and be infinitely extendable. pricellne. business intelligence and peer-review application. The goal of this 1 project is to build a distributed software application that addresses this "| problem. The system will provide an interface to create. Either way the bulk of the I information is often erased corrupted and eventually lost. organize and manage I personal notes through the Internet for multiple users. while giving administrators and managers complete control over the presentation. strong team players and reinforces enterprise and team goals seamlessly and with zero administration.

and the programming style of the user will be used to create as efficient an editing environment as possible. high-quality graph editing applications. 2001 Various Net Resources and Projects: http://user-mode-linux.file is in.onesmartclick.cio. These features will be able to be turned on or off by the programmer. High-quality user interactions for moving." Andrew . http://www.sourceforge.pdf http://www. Generic properties sheet based on Java Beans Model-View-Controller design based on the Swing Java Ul library makes GEF able to act as a Ul to existing data http://governing. Pearson Education Asia. reshaping. Node-Port-Edge graph model that is powerful enough for the vast majority of connected graph applications. 2 Edition "Object-Oriented Analysis & rejects http://hotscripts. such as auto-completion or file 2002. 2002. Simon Sennet. Steve nd McRobb. McGraw Hill. and Ray Farmer. Craig Larman. concrete design that makes the framework easy to understand and extend. Tata McGraw Hill.aponline. and also minimizing learning time for developers familiar with Swing. E. GEF also supports several novel interactions such as the broom alignment tool and selection-action-buttons. and will perform numerous features.html http://www. XML-based file formats based on the PGML standard Text Book(s): "Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and the nd Unified Process".com/programming/case-studies. 2 Edition Reference(s): "Object Oriented Systems Analysis and Design using UML".g. resizeing.html http://www.. Some of GEF's features are: A simple. The goal of the GEF project is to build a graph editing library that can be used to construct many. applications that include the ability to draw structured and unstructured diagrams. Mini-Project-X: A Graphics Editor: Design and implement a Java class collection that supports the construction of graph editing applications. on the http://sourceforge.tigris.htm http://www.

M. (Evening) (CST) PROJECT Course Code : Credits: 12 Department: CSE EPECS411 Category : CE Hours : 24 hours per week M.Tech. (Evening) (CST) SEMINAR Course Code : Credits: 2 Department: CSE EPECS412 Category : CE .Tech.