#1
16th September 2012, 10:11 AM
| |||
| |||
VTU 3rd Sem Syllabus Codes
Hello sir I am student of VTU university. I want to know about the BE 3rd semester syllabus codes, please provide me the codes of the syllabus of it ?
|
#2
16th September 2012, 11:36 AM
| |||
| |||
Re: VTU 3rd Sem Syllabus Codes
Visvesvaraya Technological University, Belgaum, Karnataka has published the syllabus of BE. Below is the information about the code : Course Name: BE Civil Engineering Code : CV For rest of the detail I have attached a file of subject codes of this course. This filed contains the subject code of the each subject with the mark system of examination. Feel free to download it |
#3
2nd December 2012, 04:08 PM
| |||
| |||
Re: VTU 3rd Sem Syllabus Codes
sir,i am the student of 3rd sem CSE branch(BE).i want to know the syllabus of all my subjects.can u please send me the syllabus copy.
|
#4
25th July 2014, 01:51 PM
| |||
| |||
Re: VTU 3rd Sem Syllabus Codes
please help me out for computer graphics lab manual for MCA 3RD SEM
|
#5
18th March 2015, 09:38 AM
| |||
| |||
Re: VTU 3rd Sem Syllabus Codes
Will you provide me the syllabus of the B.E. Computer Science 3rd semester subjects with the subject codes of VTU as I am looking for the same ?
|
#6
18th March 2015, 10:46 AM
| |||
| |||
Re: VTU 3rd Sem Syllabus Codes
As you want I am here giving you list of B.E. Computer Science 3rd semester subjects with the subject codes of VTU. Subjects with code: Data Structures 10CS35 DS Lab 10CSL37 Electronic Circuits 10CS32 Eng Maths 10MAT31 LD Lab 10CSL38 Logic Design 10CS33 Obj Oriented Progm 10CS36 Syllabus -Data Structures – BE 3rd sem.: PART-A UNIT - 1 8 Hours BASIC CONCEPTS: Pointers and Dynamic Memory Allocation, Algorithm Specification, Data Abstraction, Performance Analysis, Performance Measurement UNIT - 2 6 Hours ARRAYS and STRUCTURES: Arrays, Dynamically Allocated Arrays, Structures and Unions, Polynomials, Sparse Matrices, Representation of Multidimensional Arrays UNIT - 3 6 Hours STACKS AND QUEUES: Stacks, Stacks Using Dynamic Arrays, Queues, Circular Queues Using Dynamic Arrays, Evaluation of Expressions, Multiple Stacks and Queues. UNIT - 4 6 Hours LINKED LISTS: Singly Linked lists and Chains, Representing Chains in C, Linked Stacks and Queues, Polynomials, Additional List operations, Sparse Matrices, Doubly Linked Lists PART – B UNIT - 5 6 Hours TREES – 1: Introduction, Binary Trees, Binary Tree Traversals, Threaded Binary Trees, Heaps. UNIT – 6 6 Hours TREES – 2, GRAPHS: Binary Search Trees, Selection Trees, Forests, Representation of Disjoint Sets, CountinBinary Trees, The Graph Abstract Data Type. UNIT – 7 6 Hours PRIORITY QUEUES Single- and Double-Ended Priority Queues, Leftist Trees, Binomial Heaps, Fibonacci Heaps, Pairing Heaps UNIT – 8 8 Hours EFFICIENT BINARY SEARCH TREES: Optimal Binary Search Trees, AVL Trees, Red-Black Trees, Splay tree Address: Visvesvaraya Technological University VTU Campus Belagavi, Belgaum, Karnataka 590018 0831 240 5454 • Map: [MAP]https://maps.google.co.in/maps?q=VTU&hl=en&ll=15.783478,74.46722&spn=0.01133 6,0.020428&sll=28.544823,77.192093&sspn=0.082786,0 .163422&t=m&z=16&iwloc=A[/MAP] |
|