Programming in C and basic Data Structures (1st year)
Jump to navigationJump to search The C programming language is a computer programming language that was developed to do system programming for the operating system UNIX and is an imperative programming language. C was developed in the early 1970s by Ken Thompson and Dennis Ritchie at Bell Labs. It is a procedural language, which means that people can write their programs as a series of step-by-step instructions. C is a compiled language. A data structure is a specialized format for organizing, processing, retrieving and storing data. While there are several basic and advanced structure types, any data structure is designed to arrange data to suit a specific purpose so that it can be accessed and worked with in appropriate ways.
Data structure notes for BCA student for 1 St year student
An Emerging Opportunity for the tech college guys.
Hey everyone,Viden is personally one of the best platform I have come across to share your thoughts , gain access to the material uploaded all over the India. Helping each other and earning that sense of satisfaction which is very hard to achieve. In that aspect I would like to share this exam which I came across while discussing my future thoughts among my friends.CodeChef, a global competitive programming platform, has recently launched a new certification on Data Structures & Algorithms. This certification is an assessment of proficiency in programming using Data Structures and Algorithms under a proctored environment. It can be used for a lifetime as it tests a candidate’s grasp on subjects that are very fundamental to the field of computer science and durable. CodeChef has started with a new Certification Program on Data Sufficiency and Algorithms (CCDSAP) as a platform to learn and assess their programming skills on their platform.Features of the CCDSAP:1.) Currently there are three levels to the program- Foundation and Advanced. The Expert level will be started soon.2.) The Certification exams will conducted at a regular interval in different cities across India. It has been launched in many cities till now.. 3.) The exam will be of 3 hour duration under a proctored environment. Some advantages of certification program which you may be interested in:1.) Motivating yourself to improve your knowledge in the subject Assessing yourself.2.) Applying for a better job Getting admission in selected universities 3.) Writing efficient code Perks of Registering for CCDSAP:1.) The certificate will be valid for a lifetime Platform for self assessment 2.) Building a strong profile for job applications 3.) Getting admission in selected universities based on your performance and skillsFor more info visit:https://www.codechef.com/certification/data-structures-and-algorithms/about?utm_source=101VTA0T&utm_campaign=rep_progUsing the code ie. 101VTA0T (already mentioned in the link) you will get an additional discount of Rs 200/- over the offer going at that time. Early bird offer expires on 7th August 2019. I personally have applied for the exam.I hope this will provide a suitable opportunity for you all to prove and asses yourself. Also this will also help you to highlight your weakness and to overcome them. Just like Viden , which has helped count less no. of students, I hope this will also help everyone.
doubly linked lists
In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains three fields: two link fields (references to the previous and to the next node in the sequence of nodes) and one data field.
Array or Explain array in brief.(CHAPTER-1) (PART-4) (BCA SECOND SEMESTER NOTES)DATA STRUCTURE
OPERATIONS IN AN ARRAY (CHAPTER-1) (PART-5) (BCA SECOND SEMESTER NOTES)DATA STRUCTURE
WRITE AN ALGORITHM TO BINDING OF MAXIMUM NUMBER OF ELEMENTS OF AN ARRAY
WRITE AN ALGORITHM TO INSERT AN ELEMENT INTO A SORTED ARRAY .(BCA SECOND SEMESTER NOTES)DATA STRUCTURE
WRITE AN ALGORITH RO DELETE AN ITEM INTO AN ARRAY. (BCA SECOND SEMESTER NOTES)DATA STRUCTURE
PROGRAM AND PROCEDURE OF A SIMPLE SEARCH ON AN ARRAY.