#1
31st August 2012, 01:45 PM
| |||
| |||
Karunya University B Tech Syllabus
Hello sir I want to take admission in the Karunya university for the B. Tech programme can you provide me the syllabus of it and also tell me the eligibility for this program?
|
#2
1st September 2012, 04:33 PM
| |||
| |||
Re: Karunya University B Tech Syllabus
Here I have attached a file for you having the syllabus of Karunya University B Tech,I suppose this syllabus will help you in your studies. Following is the content of the attached file of syllabus. Engineering Sciences and Technical Arts:: Engineering Graphics,, Work Workshop Practice,, Engineering Mechanics,, Basic Electrical Engineering,, Thermodynamics and Heat Transfer,, Material Science and Engineering,, Electronics and Instrumentation,, Engineering Systems Design,, Building Materials,, Surrveyiing,, Transport Phenomena You can download the file of syllabus from here after the registration. This is free for you….. |
#3
20th May 2015, 03:13 PM
| |||
| |||
Re: Karunya University B Tech Syllabus
I want to pursue B Tech Computer Science and Engineering syllabus from Karunya University. Will you please provide the syllabus of B Tech Computer Science and Engineering syllabus for an idea ?
|
#4
20th May 2015, 03:20 PM
| |||
| |||
Re: Karunya University B Tech Syllabus
Karunya University was established in the year 1986. It is located at Karunya Nagar, Coimbatore, Tamil Nadu, India . It is affiliated to UGC . Subjects List : Computer Programming in C Software and Computer Programming Lab (CS201 P) Data Structures and Algorithms I Data Structures and Algorithms II Operating System System Software Object Oriented Analysis and Design Java Programming Java Programming Lab Windows Programming Windows Programming Lab Distributed Computing Database Management Systems Database Management Systems Lab Principles of Compiler Design Unix Architecture Unix and Linux Lab Data Structures Lab Data Mining and Warehousing Object Oriented Systems Development Distributed Operating Systems Cryptography and Network Security Software Project Management Computer Architecture and Organization Genetic Algorithm Real Time Systems Discrete Structures Software Development Lab Karunya University B. Tech Computer Science and Engineering syllabus Computer Programming in C Software and Computer Programming Lab (CS201 P) Data Structures and Algorithms I Data Structures and Algorithms II Operating System System Software Object Oriented Analysis and Design Java Programming Java Programming Lab Windows Programming Windows Programming Lab Distributed Computing Database Management Systems Database Management Systems Lab Principles of Compiler Design Unix Architecture Unix and Linux Lab Data Structures Lab Data Mining and Warehousing Object Oriented Systems Development Distributed Operating Systems Cryptography and Network Security Software Project Management Computer Architecture and Organization Genetic Algorithm Real Time Systems Discrete Structures Software Development Lab CS201 COMPUTER PROGRAMMING IN C Credit : 3:0:0 Marks : 40+60 Unit I : Introduction to Computers What is a computer? Hardware – software types of software system utility and application, Elementary Computer Organization Block diagram. Introduction to Computing : What are algorithms, types of algorithm finite, deterministic algorithms and computer program? Why we need programming languages? Levels of languages compiler. Programming Language C. Basic Notations: Variables, Expressions, Assignments Iterative Instructions. Out First C Program : A program for insertion sort, full-fledged C program. Constants, Variables and Types : Variables, types and constants in C, names in C, Basic types in C, Qualified types, constants, declarations. Operators, Expressions and Statements: Operators, Expressions, Statements, Type Conversions. Unit II : Input and Output Function printf, scanf, getchar and putchar. Control Statements : Control flow statements, the execution flow, the if-statement, the ifelse statement, the else-if ladder, the switch statement, the break statement, the ?: operator, loops, the continue statement, the goto statement. Unit III : Arrays Arrays, one dimensional array, two dimensional arrays, multidimensional arrays. Strings : Reading strings, writing strings, character and integer, combining two strings. Unit IV : Functions Function definition, statement return, the exit statement, functions of type void, declaration and definition, internal and external variables, scope, blocks. Stepwise Refinement Through Functions: A program through stepwise refinement, overall idea, broad idea, data structure issues, example. Recursion: Recursion, definitions leading to recursive programs, some computing best described recursively, Towers of Hanoi problem. Unit V : Pointers & Structures Address of a variable, operators and pointers, declaring pointers, operations with pointers, pointers as function arguments. Address of an array, address of a string. Pointers to functions, structures and pointers, dynamic memory allocation, unions. Data Files : File operations, file handling functions organization, Blodk I/O, modifying records, advanced I/O. C Processor and other Features: Introduction, macro expansion, file inclusion, conditional compilation, miscellaneous directives, command line arguments, defining new data types, other features. Text Book 1. IBM Publication C complete reference by Herbert Schildt Reference Books 1. Programming language by Kezninghan & Ritchie 2. Schaums Outline series C Programming by Byran Gotfried CS202 (CS201 P) SOFTWARE AND COMPUTER PROGRAMMING LAB Credit 0:0:2 Marks: (50 + 50) 1. Microsoft Windows 98 2. Microsoft Word 2000 3. Microsoft Excel 2000 4. Microsoft Power Point 2000 5. Programming With C i) Generating Fibonacci series ii) Finding a number is armstrong number or not iii) Solving a quadratic equation iv) To check a number for prime v) Towers of Hanoi problem CS203 DATA STRUCTURES AND ALGORITHMS I Credit: 3:1:0 Marks (40 + 60) Unit I : Introduction Structure and problem solving, Algorithmic notation, Introduction to algorithm analysis for time and space requirements and Primitive data structures. (Chapter 0) Unit II : Representation And Manipulation Of Strings Definitions and concepts, String manipulation and pattern matching, Markov algorithms, Primitive and composite functions, Grammars, Storage representation of strings and String manipulation applications. (Chapter 2) Unit III : Linear Data Structures Sequential Storage Representation Storage structures for arrays, structures and arrays of structures, Stacks Applications of stacks, Queues, priority queues. (Chapter 3) Unit IV : Linked Storage Representation Pointers and linked allocation linked linear lists, Operations, Circularly and doubly linked list applications, Associative lists. (Chapter 4) Unit V : Non-Linear Data Structures Trees Definitions and concepts operations, Storage representation and manipulation of binary trees, conversion of general trees, Sequential and other representation of trees, Applications of trees Multi linked structures, Graphs and their representations, Applications of graphs, Dynamic storage management. (Chapter 5) Text Book 1. Jean-Paul Tremblay and Paul G Sorenson, An Introduction to Data structures with Applications, Second Edition, McGraw Hill, 1994.(chapters 0,2-5) CS204 DATA STRUCTURES AND ALGORITHMS II Credit: 3:1:0 Marks (40 + 60) Pre-requisite: CS203 DATA STRUCTURES AND ALGORITHMS I Unit I : Sorting Techniques Selection sort, bubble sort, merge sorting tree sort, partition, exchange sort, radix sort, address calculation sort. (Sections 6.1.1 to 6.1.9) Unit II : Searching Techniques Sequential searching, binary searching, search trees, height balanced trees, weight balanced trees, tree structures, Hash functions, collision, Resolution techniques. (Sections 6.2.1 to 6.2.4.3) Unit III : File Structures External and intermediate storage devices, sequential files in structure and processing, sorting on disks, indexed sequential files, structure and processing of indexed sequential files, class record retrieval system, direct files, An on line banking system. (Sections 7.1 to 7.10) Unit IV : External Sorting Dynamic hashing techniques, linear and virtual hashing, multiple key access and data base systems. (Sections 7.11 to 7.14) Unit V : Algorithm Design Model The Greedy method, Divide and conquer, Dynamic programming, Backtracking, Branch and bound. Text book 1. Jean-Paul Tremblay and Paul G Sorenson, An Introduction to Data structures with Applications, Second Edition, McGraw Hill Book Company, 1984. Reference book 1. Sartaj Sahni, Data Structures, Algorithms and Applications in C++, McGraw Hill, 1998. CS205 OPERATING SYSTEM Credit: 4:0:0 Marks (40 + 60) Unit I Generations and history of operating systems - performance factors utilisation - throughput response time - multiprogramming and time sharing concepts -, process states - state transition - pcb - suspend and resume - interrupt processing - job and processor scheduling levels, objectives and criteria for scheduling - pre emptive and non - pre emptive scheduling - interval timer - priorities - deadline scheduling - FIFO - round robin - quantum size - SJF - SRT - HRT scheduling - multilevel feedback queries. Unit : II storage organisation - management strategies - contiguous and non- - contiguous storage allocation - fixed partition multi - programming - variable partitions - swapping. Virtual storage, multilevel organisation, Block mapping, paging, m segmentation, paging /- segmentation systems - page replacement Locality, Working sets - Lemand paging - Anticipatory paging - page release - page size - program behaviour under paging. Unit : III File systems, Data hierarchy, Blocking and Buffering, Files organisation, Queued and basic access methods - file characteristics - File system - Allocating and freeing space, file descriptor Access control matrix - User classes - Back up and recovery - Data page systems. Security - Pass word protection - Security kernels OS penetration. Disk scheduling - seek optimisation rotational optimisation - systems considerations. Unit : IV Parallel processing - parbeging - parend - mutal exclusion - Critical sections - Implementing mutual exclusion primitives - Dekker's algorithm - Test and set instruction - Semaphores - Process synchronisation with semaphores - Producer consumer relationship - counting semaphores. Communication between computer - Elements of Computer networks - Network operating systems. Unit : V Monitors - Resource allocation with monitors - Ring buffer - Readers and writers - Ada Multi testing - Rendezvous - Accept - producer - consumer - select ads examples. Deadlock - conditions for deadlock prevention Avoidance - Banker's algorithm - Detection and Recovery. Performance measurement, monitoring and evaluation. The UNIX operating system. Contact: Karunya University Karunya Nagar, Coimbatore, Tamil Nadu 641114 0422 261 4301 Map: [MAP]https://maps.google.co.in/maps?q=Karunya+University&hl=en&ll=10.936915,76.74 3836&spn=0.010976,0.020363&sll=17.494303,78.402592 &sspn=0.010662,0.020363&t=m&z=16&iwloc=A [/MAP] For detailed syllabus, here is the attachment; |
|