Courses Offered

[Faculty of Islamic Studies and Social Science][Faculty of Pharmacy][Faculty of Management Studies and Information Technology][Faculty of Nursing][Faculty of Medicine][Faculty of Science]

Master of Computer Application

{MCA}

The Curriculum

Highlights of the curriculum of MCA are described in the following table:

• Modes of curriculum delivery include classroom teaching, assignments, tests, lab work, presentations, participation in relevant events and regularity.

The Course Structure

Course structure, that guides the teaching, practical and associated assessment, of MCA programme is described semester-wise in the following tables: 

Semester – I

Semester – II

Semester – III

Semester – IV

Semester – V

 Semester – VI

#            Elective Courses may include following, together with others decided by the department from time to time: 

•         Advance Database Management.

•         Artificial Intelligence and Applications

•         Image Processing and Pattern Recognition

•         Modeling and Simulation

•         Parallel Processing

•         Programming Languages and Design Concepts

•         Advanced Computer Graphics

•         Current topics in Information Technology –I    

•         Current topics in Information Technology –II   

#          All the papers shall be supported by relevant application software tools in the associated lab papers, wherever possible. The department will decide these tools from time to time.

Admission

1. A candidate, aspiring for admission to MCA Programme, shall have to

1.      apply in the  prescribed application form that is complete in all respects, on or before the last date of submission;

2.      appear in the written examination on the date, time and place advised by the university and

3.      appear before the duly constituted interview-committee for personal interview.

*            However, a different procedure may be adapted for admission of foreign/NRI/NRI-sponsored/company-sponsored candidates, who apply for admission in the prescribed form and fulfill the eligibility requirements.

2. The admission committee, duly constituted for the purpose, by adding marks obtained in written examination and personal interview would prepare a merit list.
3. Admission committee shall display/ publish the list of candidates that are declared eligible for admission, after the due approval of the competent authority.
4. Eligible candidates shall have to complete the prescribed formalities, for completion of admission, with in the stipulated period of time, otherwise they will forfeit the right to admission.

 Teaching, Tutorials and Practicals

a.       Each academic year shall consist of 2 academic semesters referred to as ODD Semester (July -December) and EVEN semester (January-June).

b.      Each semester consists of 3 terms of teaching/training, of at least one month each.

c.       Each batch of MCA, in each of the semesters, shall be assigned a coordinator. He/she may normally be teaching one of the papers and will coordinate and supervise teaching-learning activities of the concerned batch.

d.      Each theory paper shall normally be taught by ONE teacher, who will be responsible for completion of various teaching-related requirements.

e.       A teacher, who may normally be teaching at least one lab-related theory paper, shall coordinate a lab paper. The concerned teacher shall be available to students to guide/supervise the practicals during the assigned lab-slots.

f.        Each teacher shall prepare a detailed teaching-plan by expanding the prescribed syllabus outline, prescribe major references and submit the same to the course-coordinator. Similarly a lab-work document may also be prepared by respective lab-coordinators.

g.       Tutorial sessions are meant for facilitating individualized attention, consultations and guidance. The concerned teachers shall be available to students individually, in small groups or any other format evolved by teacher and associated students.  

Attendance

1. All students are supposed to attend every lecture and practical classes. However, the attendance requirement for appearing in the examination shall be a minimum of 75 % of the theory classes actually held.
2. Each one-hour classroom teaching shall account for one attendance unit. However, every scheduled practical class will account for one attendance unit, irrespective of the number of contact hours.
3. The concerned teacher will take a roll call in every scheduled lecture and practical classes.
4. The teachers/coordinators shall maintain and consolidate the attendance record, which would be submitted to the Head, at the conclusion of the semester.
5. Attendance on account of participation in the prescribed co-curricular / extra-curricula activities, can be granted by the Dean on receipt of certificates or recommendations of the respective activity-coordinators countersigned by the Head of the department.
6. The statements of attendance of student shall be displayed on the Department Notice Board after the conclusion of each term and semester.
7. Notice displayed, in respect of short attendance, on Notice Board shall be deemed to be a proper notification and no individual notice shall be sent to students.
8. In case, a student is found to be continuously absent from the classes without information for a period of 30 days, the teacher incharge shall report it to the Head of the Department.
9. Head of the department may recommend for striking off the name of a student from rolls, after ensuring ‘one month continuous absence’, from all the concerned teachers.
10. A student, whose name has been struck off on account of long absence, may apply to the Dean for readmission within 15 days of the notice of striking off the name. The readmission shall be effected on payments of prescribed readmission fees.
11. A student with less than 75 % attendance, in aggregate, shall not be allowed to appear in the semester examination. The Head shall recommend such cases to the Dean.
12. The Dean, on the recommendation of the Head of the Department, may consider the condonation of attendance up to 10 % on account of sickness and/or any other valid reason. No application for condonation of attendance (duly certified by a Registered Medical Practitioner / Public hospital or a competent authority) will be entertained after 15 days from the recovery from illness etc.
13. A student detained on account of short attendance will start afresh in the same class in the next academic year on payment of current fees except enrollment fee, identity card fee and security deposits etc.

Internal Assessment

1. Internal assessment, to be made by concerned teachers, will be based on minor tests, quizzes, presentations, programming tests, demonstrations and assignments.
2. Two minor tests, with a total of 15 marks, for each theory paper shall be mandatory. Other modes of assessment shall account for remaining 10 marks.
3. A minor test each shall be scheduled after the completion first and second term.
4. Dates for minor tests will be announced at the beginning of the semester, by the examination coordinator. The time period for conducting all the minor tests shall not exceed 3 working days.
5. The teacher concerned shall maintain a regular record of the marks obtained by students in minor tests and display the same in due course. 
6. The concerned teachers shall submit the compiled internal assessment marks to the Head of the Department, on the conclusion of teaching of the current semester.
7. The Head shall display a copy of the compiled sheet, of internal assessment marks of all the papers, before forwarding it to the controller i.e. at the conclusion of the semester.
8. A promoted candidate, who has to reappear in the examination of a paper, will retain internal assessment marks.
9. In the case of re-admission, the candidate shall have to go through the internal assessment process afresh and shall retain nothing of the previous year.
10. No student, who has secured less than 50% marks in internal assessments, shall be allowed to appear in semester examinations.

    Semester Examinations

Prescriptions for conducting semester examinations of theory and Lab papers, those shall be conducted after the conclusion of each of the semesters, are presented in the following table:

·        There shall be no supplementary examination till V Semester. Candidates shall reappear in the examination of their uncleared papers in following semesters, when these papers are offered again.

·        Only one additional chance in the form of supplementary examination shall be given in VI Semester to enable a student to Graduate in time.

·        Qualifying in Lab papers shall be mandatory for promotion to next year of the study.

Project (Industrial Training)

1. Each student of the final semester shall submit a synopsis of the proposed project-work. The external supervisor, from the site/industry, must duly countersign the synopsis that is to be submitted to the Head of the department.
2. Period of completion of project/training work shall be 4 months extendable to 6 months in exceptional circumstances.
3. There shall normally be two supervisors - one internal and one external, from the place where the student is pursuing project-work.
4. An internal supervisor shall be assigned to each of the students by the department, considering the nature of project.
5. All the students, who are pursuing the project work, shall be continuously in touch with the internal supervisor.
6. There shall a mid-term evaluation of the progress and the internal supervisors will conduct it. However, an internal supervisor may ask the student to submit a confidential progress-report from the external supervisor.
7. All the candidates shall submit 3 hard copies of the project report that are duly approved and signed by both the supervisors.
8. The last date for submission of the project-report shall be 10^th May, of the year in progress.
9. The date of submission may be extended in exceptional cases. The Head of the department may entertain a written request from the candidate that is duly recommended by supervisors.
10. An external examiner, appointed for the purpose, shall evaluate the project report. The examiner shall award marks out of 300.
11. The Head of the Department shall fix a date and time for viva-voce examinations, on receipt of the evaluation-report of the project reports from the external examiner (with in 15 days of the submission).
12. Internal supervisor and the external examiner shall jointly conduct viva-voce examination and award marks out of 100.
13. Head of the department shall forward the compiled total marks (awarded in internal assessment, Project Report and Viva-Voce Examination), in the project-semester  of each of the candidate, to the Controller of Examination.

Promotion to MCA  2^nd, 3rd and 4^th Year

¨  A student, who has not cleared the lab papers, shall be deemed to be detained, as qualifying in lab papers is mandatory.

¨  Following promotion rules shall be in effect for the students who have cleared their lab papers and secured at least 50% marks in all the internal assessments.

MCA 2^nd Year

a.       A candidate may be promoted to 2^nd year provided

-         he / she has secured at least 50% marks in at least 7 theory papers out of 10 prescribed in Semesters I & II taken together ; and

-         aggregate of marks in all papers of Semester I and II taken together is at least 50 %.

*    Such a candidate shall be required to reappear in uncleared papers along with the papers of Semester III and/or semester IV, when these courses are offered again, so as satisfy the pass criteria.

b.     A candidate who fails to satisfy the criteria laid down in (a) for the promotion to 2^nd year shall be detained in MCA 1st year.

MCA 3^rd Year

a.       A candidate may be promoted to MCA 3^rd year provided

-         he / she has secured at least 50% marks in at least 16 theory papers out of 20 prescribed in Semester I to Semester IV taken together ; and

-         aggregate of marks in all papers of Semester III and Semester IV taken together is at least 50 %.

*    Such a candidate shall be required to reappear in uncleared papers along with the papers of Semester V and VI, when these courses are offered again, so as to satisfy the pass criteria.

b.      A candidate who fails to satisfy the criteria laid down in (a) for the promotion to MCA 3rd year shall be detained in MCA 2nd year.

Award of the MCA Degree

a.      A candidate will be deemed to have satisfied the examination requirements for the award of MCA degree provided he/she fulfills the criteria for passing the examinations of MCA 1^st, 2^nd and 3^rd years.

b.      The minimum marks required for passing MCA 3^rd  year examination shall be 50% in each of the Papers prescribed in Semesters I to V and 50 % marks in the project of semester VI.

·        In case a student has failed to submit his project report by the deadline specified by the Head or his/her work is found unsatisfactory, he / She may be asked to do more work and submit the project-report with in stipulated time, on the advice of Head and the supervisors. His/her result will be announced separately.

c.       Provided that a candidate has secured 50 % marks in the project and has failed to secure 50% marks in each of the papers prescribed in Semesters I to V. He / she will have to reappear in uncleared theory papers in the following Semester examinations, so as to satisfy the criteria for passing out MCA 3rd year laid down in (b).

d.      There would be a provision for ONE supplementary examination to facilitate the candidate to pass-out at the end of his third year of study.

·        In case a candidate is even not able satisfy the criteria he/she would have to reappear in the uncleared papers (eligible for reappear) in the semester examinations of next year, when these papers are offered again.

¨  After having passed all the SIX semesters, the students shall  be eligible for the award of MCA degree of JAMIA HAMDARD.

 Classification of Successful Candidates

a.       The result of successful candidates, who fulfill the criteria for the award of MCA, shall be classified at the end of last semester, on the basis of aggregate marks of all papers.

b.   Classification shall be done as following criteria:

            I^st  division :     ³ 60%    (marks in aggregate)

            2^nd division :     ³ 50 %  and     < 60%  (marks in aggregate)

c.       A candidate securing at least 75% marks in aggregate and having passed all the semester examinations in the first attempt shall be declared to have obtained Distinction.

d.      A  student shall be awarded Gold Medal provided

·        he / she has secured the highest marks in aggregate of all the semesters of the course of study; and

·        he / she has obtained a minimum  of 75% in aggregate ; and

·        he / she has passed all examinations in first attempt.

Span Period

a.       All MCA students shall have to pass the first year examinations with in two years; otherwise admission of such candidate shall deemed to be cancelled.

b.      All the students shall have to complete all the requirements for the award of MCA degree, within a total period of five years.

c.       In case of project only, permission may be granted to submit it even beyond the period of six years with prior approval of vice-chancellor. 

DETAILED SYLLABUS

 Semester I

CS  1 . 1: Programming and Problem Solving using C

Overview of Programming: planning, design and development; Problem solving: definition, analysis and strategies; algorithms, flowchart; Programming languages: generation, type etc.; Assembler, compiler, interpreter; Programming in C, Advance program design techniques: control constructs, functions; Data structures: binary search, sorting, pointers; Miscellaneous features: file handling, library function, string manipulation and special  utility functions. Design of efficient programs.

CS 1. 2:    Discrete Computer Mathematics

 Discrete structures and its significance for computer science; Sets and related operations, relations and functions, matrix and digraph of relation, functions and its properties; Sequences, countable sets etc.; Poset, lattices and Boolean algebra; Prepositional calculus: transformation, conditional statements and methods of proving; Introduction to combinatorics-pigeon hole principles, permutation, combinations, Recurrence relations etc.; Semigroup, Monoids and groups; Graphs Theory: Euler and Hamiltonian path and circuits, Coloring.

 CS 1. 3:     Computer Organization and System Software

Evolution of computers-Hardware and software; Hardware organization; Number systems and binary arithmetic; Error detection, codes correction and Boolean expression; Digital logic: gates, combination logic circuits, flip-flop, counters, registers etc.; Processor’s architecture-organization, instruction set, interrupt, I/O organization, CPU organization, addressing modes, instruction formats, CPU with large registers; Memory organizations: static & dynamic RAM using  chips, cache memory, virtual memory; Assemblers, loaders, compilers & operating systems; Introduction to assembly language programming.                              

CS 1.4: Computer Based Financial Accounting and Management

Financial accounting : meaning, definition and nature; Accounting  principles  & preparation of financial  statements; Financial  statements analysis: ratio  analysis etc.; A synoptic  view of  profit  from balance sheets; Conceptual framework of cost accounting: nature, elements & preparation of cost sheets; Cost-volume profile relationship: break - even analysis for high & multiple products; Budgeting: techniques & methods of project appraisal, pay, average accounting rate of  return method etc.; Costing and its attributes: direct, cost-volume, standard and  variance  analysis. Case study ; use  of a software tool to solve finance-based problems.

                          CS 1.5: Business Data Processing and File Systems

Business and the related concepts: firm, environment, process and systems; Analysis of business in system terms; Systems related challenges in business system: management, improvement, competition, technical trend and innovations, infrastructure and context; System- related needs in business; Information technology in business: attributes, functions, optimization and efficiency considerations; Computer software & hardware: a overview of developments; Organisation and attributes of business data processing: management of computer resources, emerging trend, data modelling, file, data structures etc.; File Systems: concepts, types, organisation, attributes, management etc, Principles and techniques of programming : debugging, testing, verification; Structured programming: characteristics, techniques and advantages; Data processing using COBOL / FoxPro: basic constructs and  advanced features.

Semester  II

                        CS2.1: Computer System Architecture

Principles of computer design, basic components of computer system: input-output, ALU, CPU, storage; A/D and D/A converter; half and full adders; Types of computer instructions; Instruction cycle, fetch and execution; RTL; Micro programming and CPU organization; implementation of arithmetic operations; Memory organization; I/O structure, interrupts, DMA; Layered architecture and design;  Examples of organization of  main frame, micro and PC systems; introduction to parallel architecture.

CS 2.2 : Data  Structures and  Algorithm  Design

Elementary data structures: concept & operations on arrays, stack, queues, list, linked lists, trees; Evaluation of arithmetic expressions using stacks; List representations; Graph : types, significance and implementation; Searching & sorting algorithms; Analysis of algorithms : characteristics of  algorithm, asymptotic notations and related attributes; Algorithms design methodologies: divide and conquer, greedy and dynamic programming ; Examples of classical problems and  their solutions; implementation of algorithms using C.

CS 2.3: Object Oriented Programming

Structured and object-oriented methodologies: concepts of procedure-oriented and object- oriented programming; advantages of OOP methodologies, characteristics of OOP languages: objects, classes, inheritance, reusability, extensibility, polymorphism and operator overloading; Introduction to C++; data abstraction, data types, constants, expressions and statements, functions, derived classes, operator overloading, file streams;  OO approach to system design and UML. Development and implementation of an OO case study.

CS 2.4: Management and Organizational Principles

Concept of management & administration, brief history of management thoughts: Taylor, Ellen Moy, Herbert Simon theories; Management as art and profession; Function of management: planning, organizing, staffing, directing, control, leadership; communication; Organizations:  forms,  principles,  functional  committee, centralization, delegation & supervision; Decision making and executive development; Functional areas of  management, finance, personnel, production  and marketing. Organizational Behavior and principles; Management of IT-issues, methods and relevance.

CS 2.5: Systems Analysis and Design

System :  definition and concept; Real time and distributed systems; Data information and related attributes;   System analysis and analyst;  System development  life cycle: study, analysis, design & development and implementation; System  planning;  data & fact finding techniques; System design and modelling: logic &  physical design representation,  data flow diagram, ERD, structured charts; forms design : classification, user interface, control and validation checks; Modular and structured design; system implementation & maintenance; Project management techniques; Introduction to MIS, DSS, ES and ERP; case  study on systems analysis and design.

 Semester III

 CS 3.1  :   Data Communication and Networks

Communication system; Analogue data and digital data, communication channels, synchronous and asynchronous data; Transmission media: twin wire, coaxial cable, radio, VHF, satellite link, optical fiber; Data modems and multichannel data communication; Data networks: circuit switching, packet switching, PBAX and network topologies; Networks protocols: OSI model, data link, LAN, Ethernet and token rings and satellites; Client server computing, distributed file system; Network management; Global check, distributed synchronization; Multimedia communication and co-operative computing. 

CS 3. 2 : Operating Systems

Overview of OS: concept, need and significance; Classification and different viewpoints of OS; Concept of multilevel machine, virtual language, multiprogramming, batch processing, time sharing etc.; Process and interposes communication with examples of classical problems; Deadlocks: detection, prevention, recovery and avoidance; Memory management schemes, I/O processing;  File and device management attributes and techniques; real time and distributed OS. Illustrartive examples with Unix/WindowsNT

CS 3.3: Data Base Management System

Database: concept, comparative view, goals etc.; Data independence, consistency, security & integrity; DBMS models: hierarchical, relational and network; Structured query language (SQL) and programming; Database design and architecture; concurrency control and recovery. CASE study implementation via ORACLE; Introduction to distributed and OO databases. 

CS 3.4: Visual Language Programming

Concept of procedure & event oriented languages; Low and high level visual languages; Visual architecture: methods, statements and properties; Basic concepts of visual program design and comparison with non-visuals; Visual programming environment and development of visual programs: project window, forms, code, properties & event procedures; Program design including case solution, run time properties; Programming using Visual Basic /  VC++; implementation of a case study. 

CS 3.5: Theoretical Computer Science and Compiler Design

Significance and basic concepts; Alphabet, strings, graphs, trees and inductive proof; Finite state systems; Basic concepts, non-deterministic finite automaton, finite automaton; Finite state machine and languages, regular languages; Regular expressions; Application of finite automaton; Lexical analysis and text editors; Regular sets, decision algorithm and closures properties; Introduction to Turing Machine; Compiler Design: Basic Issues, grammar generation, phases, passes, databases, data structures, storage, interrupts, pointers, implementation and optimization.

                       Semester IV

 CS 4.1: E-Commerce

Introduction to e-Business; EDI; Electronic Fund Transfer (EFT); Value-chain, internet Business strategy, Functional Architecture, implementation Strategies; Building Blocks of E-commerce, System design, creating and managing contents.; Cryptography and security management; Payment systems; Auxiliary system; transaction Processing; Building e-commerce system, system architecture, secure links etc; case study on development of e-commerce system; various tools to develop e-commerce applications; legal requirements for e-commerce; Present and future Trend; Impact of e-commerce; Indian scenario. 

CS 4.2: Internet and Intranet Technology

Internet & intranet: concept, use and Applications; Client server computing, TCP/IP, mail, web search engines, Usenet, gopher; Internet hardware, internet via LAN etc.; Modem & ISDN; Software requirements: hosts, terminals; UNIX hosts, VT 100 terminals & telnet; shell & PPP accounts; PPP & SLIP; Installation & configuration of TCP/IP; SMTP: mail system and operation; Multimedia with internet; web page design; Web Programming;. Different tools to implement web-based applications; Web database; Implementation of a simple case study. 

CS 4.3 :   Software Engineering and  CASE  Tools

Software:  Product and Process, Software Process Models: Software architecture and  design, Risk Management, Prominent design methodologies: S/W testing and debugging concepts; Verification, validation and performance evaluation; Software Configuration Management, Software Metrics, Software quality and Quality Metrics, CASE Tools: Functions of CASE tools and their use,  detailed study of one CASE Tool. 

CS 4.4:   UNIX  and  Shell Programming

Concept of Shell, OS Structure and computing models; Shell programming: types,  simple commands, use of meta characters, shell scripts, control and substitution; AWK programming: general structure; Nroff / Troff: general nature, font and char size control, text filling, centering, macros; I/O conventions etc.; UNIX editors and basic commands: vi editors and Ed editor, UNIX utilities-grep, sed, bc, dc, mn, cut & paste ; System administration: functions and important commands.

CS  4.5 : Computer Graphics and Multimedia Applications 

Graphics application and display devices; Interactive devices; Line and circle plotting using Bressenham’s algorithm’, windowing and clipping, Sutherland  & Cohen approach,  Cyrus Beck method, midpoint subdivision algorithm; Curves drawing using Hermit polynomial, Bezier curves, B-splines; Picture transformation, translation, rotation,  searching & mirror images; Interactive graphics : pointing  and positioning devices; Techniques for zooming, panning, clipping etc.;  3-D graphics : co-ordinate system, transformation etc.; graphical standards; file formats; OpenGL and its use to develop graphical applications; Multimedia preliminaries and  applications;  Development and use of multimedia  packages; introduction to virtual reality and modeling languages. 

Semester V

CS 5.1: Network Management

Data communications and Network Management Overview; Review of Network technology; Basic foundations: standards, models, languages; SNMPv1 Network Management: organization and information models, Communication and functional models; SNMP management: v2, v3; SNMP management RMON; Broadband network Management: ATM networks; Broadband and Telecommunication management; Network management tools and applications; Web-based Management. 

CS 5.2: Windows Programming 

Windows basic concepts, windows API, DEF Files, creating windows, messages, x-windows; Mouse and keyboard; Introduction to resources, designing and creating menus, pop-up menus, user defined resources; Bitmaps and dialogues; Windows animation; Font basics; Window controls; Font display, static controls, edit controls, list boxes, check boxes; Psychic windows; Overview and structure of windows programming, coding conventions; Displaying text, mouse, graphics device interfaces.

CS 5.3: Software Testing and Quality Assurance

Testing and the related concepts: significance and potential; Software Testing Techniques, Software Testing Strategies, Object Oriented Testing, Testing of Special Software: Real Time, Process Control, Embedded etc, Metrics for Software Testing, static analysis, symbolic testing, program mutation testing, input space, partitioning, functional program testing, data flow guided testing; Comparative evaluation techniques; Testing tools; Dynamic analysis tools, test data generators; Debuggers, test drivers etc.; Quality assurance: concept, importance and essence; structured walk through technique ; Features affecting quality of software; Quality models: ISO 9000, SEI-CMM. 

ELECTIVES

1 :   Advance Database Management Systems

Review of database management systems; Design and knowledge databases; Review of different database models; Integrity of databases : need for concurrency control, locking, deadlock avoidance; Coding : representation of knowledge, classification and compression; Distributed databases : advantages, techniques and related concepts;  Database machines : concept advantages features and back end machine approach ; Object oriented databases.

     2. Artificial Intelligence and Applications

Problem solving, search techniques, control strategies, reasoning, knowledge representation through predicate logic , rule based systems, semantic nets, frames, conceptual dependency. A.I programming language PROLOG / LISP, handling uncertainty; Introduction to A.I applications in expert systems, natural language processing , vision;  Neural nets, non-monotonic  logic.

3. Image Processing and Pattern Recognition

Electronic system of image transmission and storage; Recognition and processing of pictorial data; over command of application; Mathematical and perceptual preliminaries; Human visual system, image signal representation & specification etc.; Image processing techniques: enhancement, restoration, compression and pattern recognition; Colour image processing: representation, transformation and processing techniques; Hardware architectures for image processing; Distributed processing of image, array processing, image processor chips; Application of image processing; Use of relevant package.

 4. Modeling and Simulation

Definition of a system: types of system-continuous and discrete, modeling process and definition of a model, differential and partial differential equation models; Simulation process: use of simulation, discrete and continuous simulation procedures, simulation of time sharing computer system; Simulation languages: a brief introduction to important discrete and continuous simulation languages study; Use of database and AI techniques in the area of modeling and simulation. 

5. Parallel Processing

 Concept of parallelism; Mechanism for uniprocessor systems; Parallel computer architecture; Pipelining and vector processing requirements and computers; Instruction and arithmetic pipelining; Parallel algorithms for array processors, SIMD computers & performance enhancement; Microprocessor architecture & programming: functional structures, interconnection networks, multiprocessors; Parallel algorithm for multiprocessors and data flow computers; Data driven computing and languages. 

6. Programming Languages and Design Concepts

Evolution of typical programming languages; General language features; Imperative languages: block structure, procedures, functions; Implementation of imperative language; Declarative languages: logic & functional programming; Principles of object oriented languages; Database query language: SQL; 4GLs; Data manipulation languages, report generators, screen painters & application generators.